{"meta":{"query_hash":"a2cf84b40bc3","filters":{"venue":"Fundamenta Informaticae"},"cohort_total":151,"direct_labels_cover":0,"predictions_cover":151,"exported":151,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a2cf84b40bc3","api":"https://metacan.xera.ac/api/v1/cohort?venue=Fundamenta+Informaticae"},"results":[{"id":"W1248144726","doi":"10.3233/fi-2015-1228","title":"Simple Linear Comparison of Strings in <i>V</i> -order","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Simple (philosophy); Order (exchange); Focus (optics); Algorithm; Computer science; Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics; Physics","score_opus":0.05041916041186955,"score_gpt":0.3242366516021957,"score_spread":0.27381749119032617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1248144726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12215501,0.0011943778,0.8509914,0.00040028492,0.00045964858,0.0003020417,0.0012512389,0.0049179625,0.01832802],"genre_scores_gemma":[0.38705105,0.0004606425,0.59792495,0.0002517905,0.00015430916,0.00024482416,0.002400459,0.0008705374,0.010641444],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.0003596127,0.00030391495,0.0005462522,0.0007709796,0.0002351144],"domain_scores_gemma":[0.99484825,0.0025107455,0.00046766846,0.0009604183,0.0010250501,0.00018799881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008238821,0.0006631173,0.00092478504,0.0016966987,0.00083294493,0.0025556218,0.0013780377,0.0006461781,0.0078038652],"category_scores_gemma":[0.008529906,0.00037263593,0.00057663093,0.00339356,0.0011186107,0.004429055,0.0015879166,0.0009621988,0.0028743723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015565567,0.00019316144,0.0036096156,0.0009487106,0.00010362315,0.00045249122,0.0006524915,0.014492587,0.05600417,0.12285508,0.009428807,0.7897028],"study_design_scores_gemma":[0.00023019854,0.0016695545,0.0042789066,0.00044088726,0.00015987962,0.0017941734,0.0011425302,0.16326028,0.22892562,0.514264,0.08358623,0.00024773955],"about_ca_topic_score_codex":0.0009644236,"about_ca_topic_score_gemma":0.0014838843,"teacher_disagreement_score":0.0078038652,"about_ca_system_score_codex":0.00086043734,"about_ca_system_score_gemma":0.0014565818,"threshold_uncertainty_score":0.026106477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011626136913635801,"score_gpt":0.19371171611329274,"score_spread":0.18208557919965696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484840002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54427105,0.002421387,0.36487386,0.0031572888,0.00025734905,0.0001623875,0.00025133076,0.0006410174,0.083964385],"genre_scores_gemma":[0.9748975,0.0006828,0.018231727,0.00016414227,0.00018519294,0.000091134425,0.000081366816,0.00008631693,0.0055796453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978777,0.00058502995,0.00015269834,0.00045589387,0.0005687224,0.0003599453],"domain_scores_gemma":[0.9964876,0.0018385121,0.0003647155,0.00041624383,0.00050703896,0.00038597023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736477,0.00064835907,0.00087225705,0.0019524456,0.0013363819,0.003034768,0.0009614071,0.0015132776,0.0035784182],"category_scores_gemma":[0.0074954685,0.0005655837,0.0012889047,0.0009713596,0.00674746,0.0070802863,0.004525806,0.0023276783,0.00046298033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045735887,0.0000059035724,0.000118871365,0.000021417925,0.00000469424,0.000052757405,0.00022212861,0.0017179524,0.0003803844,0.9958301,0.0001543057,0.0014868879],"study_design_scores_gemma":[0.0000055322653,0.00000747745,0.000062939216,0.000007833057,0.000002817602,0.00008102314,0.000045748307,0.012337869,0.00023542868,0.986482,0.00072262395,0.000008703334],"about_ca_topic_score_codex":0.0010300904,"about_ca_topic_score_gemma":0.00050840795,"teacher_disagreement_score":0.0035784182,"about_ca_system_score_codex":0.0020325757,"about_ca_system_score_gemma":0.00078873965,"threshold_uncertainty_score":0.014747441},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Mathematics; Artificial intelligence","score_opus":0.006780213110684829,"score_gpt":0.2129740249290568,"score_spread":0.20619381181837196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488252274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1558294,0.0009177585,0.83512294,0.00093255215,0.000111421985,0.00011033129,0.00007746018,0.0004633007,0.0064347787],"genre_scores_gemma":[0.71862906,0.0007579077,0.27251768,0.000114869756,0.00020095966,0.0002334392,0.00014453461,0.000080228354,0.0073213866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978854,0.0009360547,0.00008448435,0.00041755577,0.0003187482,0.00035776084],"domain_scores_gemma":[0.99394715,0.004107091,0.0007908118,0.0006076122,0.00027605082,0.00027127287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026936003,0.0004227067,0.001003156,0.00044979947,0.0015041842,0.0015324835,0.0017310987,0.0012845864,0.0017412058],"category_scores_gemma":[0.0061984276,0.00043282,0.0005436857,0.0008237228,0.0012666362,0.004231945,0.0018122083,0.0010329044,0.0006557966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014877985,0.00030309198,0.0026554484,0.0005057535,0.00008161342,0.0009979989,0.0010307978,0.5628001,0.020202521,0.31468743,0.0043065143,0.09094088],"study_design_scores_gemma":[0.0002306976,0.00026776784,0.00045047776,0.00001662376,0.00004007826,0.00021511874,0.00022952944,0.8252045,0.008023503,0.15970059,0.005584781,0.000036349196],"about_ca_topic_score_codex":0.00044496218,"about_ca_topic_score_gemma":0.0004937231,"teacher_disagreement_score":0.0026936003,"about_ca_system_score_codex":0.0005649256,"about_ca_system_score_gemma":0.0004418868,"threshold_uncertainty_score":0.014245272},"labels":[],"label_agreement":null},{"id":"W1489951046","doi":"10.3233/fi-2013-904","title":"Weak Dependencies in Approximation Spaces","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dependency theory (database theory); Mathematics; Computer science; Functional dependency; Data mining; Relational database","score_opus":0.01641336345911307,"score_gpt":0.22248716538328728,"score_spread":0.2060738019241742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489951046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009817678,0.004501297,0.97339916,0.0012903665,0.0001874741,0.0000395798,0.00013500486,0.000102253274,0.010527287],"genre_scores_gemma":[0.57251877,0.013156801,0.39753315,0.0008392849,0.0015251578,0.00043135538,0.00066539575,0.00016751619,0.013162511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919486,0.00304652,0.0005315833,0.00096118695,0.0031508112,0.00036142988],"domain_scores_gemma":[0.98696554,0.009602259,0.00082241703,0.001021275,0.0012585788,0.00032996217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076707336,0.0011345504,0.0016297392,0.0034128828,0.0010228388,0.0042296653,0.0016638918,0.0014308596,0.0026733468],"category_scores_gemma":[0.022164749,0.0008026547,0.0018216226,0.002813636,0.0038935852,0.005656362,0.004578228,0.00494212,0.0007190261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002039951,0.000008952005,0.0003296958,0.00012680152,0.000048466507,0.000060808823,0.00018276526,0.026738297,0.00030037214,0.9520393,0.001033656,0.019110354],"study_design_scores_gemma":[0.000004576217,0.000022762797,0.00022198938,0.000043995224,0.000016023832,0.000049046157,0.00003904398,0.13279589,0.00020552249,0.8619256,0.0046628746,0.00001274382],"about_ca_topic_score_codex":0.002274431,"about_ca_topic_score_gemma":0.001047189,"teacher_disagreement_score":0.0076707336,"about_ca_system_score_codex":0.0025842304,"about_ca_system_score_gemma":0.0009966614,"threshold_uncertainty_score":0.04056716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008469286528252585,"score_gpt":0.20656023149267533,"score_spread":0.19809094496442275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491079601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011107977,0.0034247295,0.9674562,0.0032821088,0.00028861754,0.000111518435,0.00037005122,0.00027394385,0.013684724],"genre_scores_gemma":[0.38208637,0.0059788823,0.6052474,0.00081138883,0.0006750936,0.00044194414,0.00047800984,0.00016525574,0.0041157007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967242,0.0012420879,0.00039763888,0.0005398927,0.0009209258,0.00017522537],"domain_scores_gemma":[0.9959394,0.0019294996,0.0004646574,0.000982668,0.0005193091,0.0001645128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039530974,0.00082420016,0.0011368353,0.0032884018,0.00080221164,0.008010482,0.0014167731,0.0012392907,0.0026661442],"category_scores_gemma":[0.011642082,0.00058011856,0.0011703745,0.0029779093,0.005721242,0.00818935,0.0027695284,0.0026610116,0.0004392507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004124864,0.000013217621,0.0003072596,0.00020232219,0.000032554206,0.00014629241,0.0005194079,0.010633088,0.0012564586,0.962226,0.0015177741,0.023104412],"study_design_scores_gemma":[0.000012701437,0.00001832829,0.00042412177,0.00012991815,0.000030961437,0.00009899217,0.00030801477,0.027569348,0.0008041125,0.95740134,0.013170244,0.000031908396],"about_ca_topic_score_codex":0.0014678513,"about_ca_topic_score_gemma":0.00093673036,"teacher_disagreement_score":0.008010482,"about_ca_system_score_codex":0.0018657908,"about_ca_system_score_gemma":0.0011139065,"threshold_uncertainty_score":0.02090621},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020396367087482468,"score_gpt":0.2827322265737545,"score_spread":0.262335859486272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493458121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006321967,0.018280989,0.8803456,0.008143095,0.0012788512,0.00011320818,0.00016168729,0.00037927786,0.08497528],"genre_scores_gemma":[0.32781073,0.017519519,0.62905866,0.0035871742,0.0039689625,0.0012835921,0.00039871671,0.00026675314,0.016105885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963322,0.0016074924,0.00040194264,0.0004915764,0.00096096663,0.00020586814],"domain_scores_gemma":[0.99544877,0.002767871,0.00045149768,0.0007163765,0.0004501782,0.00016528185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004590605,0.0013511421,0.0011888025,0.0033790944,0.0021259957,0.006010093,0.0017555401,0.0023457154,0.005762077],"category_scores_gemma":[0.008457771,0.0005092179,0.0017795685,0.0029558614,0.014033543,0.014207232,0.0039543537,0.0057665203,0.0014798907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026481844,0.0000027041365,0.000026413805,0.000026583579,0.0000037470247,0.000019758705,0.00015624198,0.00014656261,0.00010670622,0.9966054,0.00034911078,0.0025541661],"study_design_scores_gemma":[0.0000052749892,0.000007890645,0.000053927048,0.00002960388,0.0000051905686,0.00007681555,0.00006669754,0.0012343524,0.0001555418,0.97726053,0.021095406,0.000008799026],"about_ca_topic_score_codex":0.00084242714,"about_ca_topic_score_gemma":0.0007790746,"teacher_disagreement_score":0.006010093,"about_ca_system_score_codex":0.0027785907,"about_ca_system_score_gemma":0.0018480733,"threshold_uncertainty_score":0.024277687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02291557565412861,"score_gpt":0.2590175512023282,"score_spread":0.23610197554819962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497284170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011554786,0.000830583,0.9851231,0.00027518484,0.000039823106,0.00002194849,0.00016433463,0.00024555126,0.0017447205],"genre_scores_gemma":[0.46505094,0.0028240678,0.5277828,0.00015852814,0.00016647388,0.0001152402,0.0009178821,0.000080224374,0.0029038559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983492,0.00039937234,0.00018269068,0.0003772447,0.00057123165,0.000120255514],"domain_scores_gemma":[0.99537116,0.002655139,0.0005690597,0.0009396096,0.0003519127,0.000113046706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022057563,0.0008577556,0.0009242459,0.0014075561,0.0007001491,0.0031558687,0.0020624334,0.0011477612,0.0025705905],"category_scores_gemma":[0.011083976,0.00041779262,0.0012531099,0.0026908412,0.0015950394,0.007658203,0.0021474333,0.001335729,0.00042537437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023725042,0.000082605744,0.0020046416,0.00051495526,0.00020670048,0.0006803075,0.00071101624,0.51331896,0.0037145566,0.3139472,0.003079712,0.16150214],"study_design_scores_gemma":[0.000010176104,0.00003298001,0.00040223615,0.00003212166,0.000042284424,0.0001771539,0.000118537806,0.70153487,0.001769451,0.29143384,0.004428539,0.00001779403],"about_ca_topic_score_codex":0.0047065937,"about_ca_topic_score_gemma":0.0037713912,"teacher_disagreement_score":0.0047065937,"about_ca_system_score_codex":0.0012316926,"about_ca_system_score_gemma":0.00063325546,"threshold_uncertainty_score":0.011665285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Pairwise comparison; Convergence (economics); Mathematics; Algorithm; Computer science; Statistics; Economics","score_opus":0.3388397757513775,"score_gpt":0.43504658380418865,"score_spread":0.09620680805281112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497606539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012111954,0.00030776166,0.9856017,0.0002174313,0.000042140327,0.00017099972,0.00003408936,0.00014781387,0.0013661621],"genre_scores_gemma":[0.2653607,0.00023960636,0.7319077,0.00023310339,0.00008017064,0.0007910296,0.00021104273,0.0002154748,0.000961166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9271894,0.04945045,0.0026910868,0.0064673205,0.013105539,0.0010962432],"domain_scores_gemma":[0.6270665,0.32606855,0.00998113,0.020477502,0.015117698,0.0012886258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05503623,0.0015329593,0.0030991235,0.0038245434,0.0015288222,0.0031705075,0.004537932,0.0019294334,0.0029792928],"category_scores_gemma":[0.30573237,0.0012260794,0.0032892756,0.0021823042,0.004612643,0.0067035174,0.0058142156,0.007078205,0.00074648595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010369814,0.0003269383,0.011645755,0.0016500661,0.0010986492,0.000369921,0.0027646045,0.3418836,0.0061166883,0.36409584,0.0029100422,0.26610085],"study_design_scores_gemma":[0.00010574388,0.00047830184,0.002218148,0.00017733102,0.00013155572,0.0004958359,0.0003048888,0.59105086,0.0061092805,0.39582118,0.0029888963,0.000117882606],"about_ca_topic_score_codex":0.0014471923,"about_ca_topic_score_gemma":0.00083847786,"teacher_disagreement_score":0.05503623,"about_ca_system_score_codex":0.00229083,"about_ca_system_score_gemma":0.0025990375,"threshold_uncertainty_score":0.2910629},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04913518201304213,"score_gpt":0.25703201312074914,"score_spread":0.20789683110770701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498104397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1233708,0.0013196326,0.8571363,0.00025044472,0.00007400703,0.00028960864,0.00058612454,0.0006403239,0.016332736],"genre_scores_gemma":[0.82093424,0.00085233967,0.1700421,0.000114184295,0.0001923169,0.00041697468,0.0008156404,0.00015925958,0.006473039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743134,0.00069940154,0.00028152394,0.0004582756,0.00084817305,0.0002813471],"domain_scores_gemma":[0.9939142,0.0031586401,0.0009630869,0.0009527103,0.0007319215,0.0002795991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606938,0.0007186702,0.0004528698,0.0026696168,0.0010305704,0.0024653582,0.00087046943,0.000902573,0.0031740977],"category_scores_gemma":[0.008410121,0.00055433036,0.0008613917,0.0017127017,0.002992021,0.0051113134,0.0023102819,0.0011331053,0.0003770981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008215725,0.000036534882,0.0024916525,0.00013740969,0.00003152124,0.0007395736,0.0016891086,0.027215295,0.0046239374,0.9347091,0.00042466735,0.027819121],"study_design_scores_gemma":[0.000020041323,0.0000870123,0.0010108717,0.00008810003,0.000030090008,0.00059692474,0.0004813795,0.054541197,0.004534193,0.9210785,0.017496813,0.000034936922],"about_ca_topic_score_codex":0.0014716014,"about_ca_topic_score_gemma":0.0011137304,"teacher_disagreement_score":0.0031740977,"about_ca_system_score_codex":0.00088730897,"about_ca_system_score_gemma":0.00078662485,"threshold_uncertainty_score":0.010618389},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010699586373205113,"score_gpt":0.21600292244230437,"score_spread":0.20530333606909926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499453370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065148408,0.0005327298,0.9897016,0.00029323742,0.000054586075,0.00004017416,0.00002076023,0.000107252126,0.0027348695],"genre_scores_gemma":[0.70667005,0.0012120197,0.28582555,0.00024092237,0.00021376878,0.00039496497,0.00012323284,0.000064941814,0.005254473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975448,0.0013684862,0.00012246173,0.00027700746,0.0005440769,0.0001431354],"domain_scores_gemma":[0.994167,0.004376765,0.00039424535,0.00042905612,0.00043637794,0.00019647574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00347372,0.0010973414,0.0015636716,0.0007138331,0.00045278625,0.0017416005,0.0015869727,0.0013225853,0.0025601073],"category_scores_gemma":[0.011384163,0.00041258373,0.0009963157,0.00070971745,0.002128966,0.0020269232,0.001859924,0.0022977216,0.0003737552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089007015,0.000063579995,0.00060030795,0.0001462335,0.0000950628,0.00006462874,0.00014108409,0.7359882,0.0005218188,0.22078232,0.00068316096,0.040824573],"study_design_scores_gemma":[0.00002286829,0.000060132068,0.000056412136,0.000014595407,0.000009636107,0.000015278318,0.0000118832295,0.9227118,0.00018587631,0.07567888,0.0012243316,0.000008339865],"about_ca_topic_score_codex":0.0024894895,"about_ca_topic_score_gemma":0.0015182776,"teacher_disagreement_score":0.00347372,"about_ca_system_score_codex":0.0016497148,"about_ca_system_score_gemma":0.001131648,"threshold_uncertainty_score":0.018370986},"labels":[],"label_agreement":null},{"id":"W1500786493","doi":"10.3233/fi-2010-285","title":"An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Mathematics; Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.016521425353453467,"score_gpt":0.27466689756448437,"score_spread":0.2581454722110309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500786493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07615393,0.011710342,0.70874846,0.013913334,0.0043215733,0.000331933,0.0017047019,0.0015682015,0.18154752],"genre_scores_gemma":[0.58421224,0.0064808205,0.33450332,0.007701862,0.0050987294,0.00095740263,0.0020122342,0.0022140234,0.056819376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98997307,0.0016909649,0.000431685,0.002623112,0.003225754,0.0020553395],"domain_scores_gemma":[0.9700033,0.020353975,0.000879951,0.0044701854,0.0029988948,0.0012935781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00886472,0.0024107848,0.0041959216,0.0044196723,0.0034293921,0.004609189,0.006788376,0.0045090797,0.01810217],"category_scores_gemma":[0.04502211,0.0011931361,0.0046499097,0.0040783025,0.0069910064,0.017671725,0.007773865,0.010551808,0.0050999923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010264411,0.0003156035,0.002138522,0.0008850518,0.00017519054,0.00055050704,0.00069381576,0.02980867,0.006900131,0.81761354,0.042747483,0.09714506],"study_design_scores_gemma":[0.000075328615,0.0002020504,0.0009825233,0.00020703766,0.0001323899,0.00052447186,0.000083874525,0.09139617,0.0034235234,0.8742975,0.028543659,0.00013142968],"about_ca_topic_score_codex":0.003372257,"about_ca_topic_score_gemma":0.0025223226,"teacher_disagreement_score":0.01810217,"about_ca_system_score_codex":0.0058413255,"about_ca_system_score_gemma":0.0033481538,"threshold_uncertainty_score":0.060557783},"labels":[],"label_agreement":null},{"id":"W1504896064","doi":"10.3233/fi-2013-804","title":"Filtrations of Formal Languages by Arithmetic Progressions","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Computer science; Mathematics; Programming language; Algebra over a field; Pure mathematics","score_opus":0.004885578396302735,"score_gpt":0.22976776281802905,"score_spread":0.2248821844217263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504896064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45579925,0.00083817815,0.50701714,0.00081197266,0.0001660021,0.00017905816,0.0005753686,0.001694441,0.032918647],"genre_scores_gemma":[0.891756,0.00039097894,0.095286645,0.00022925183,0.000252671,0.00031578063,0.0006680159,0.00023913471,0.010861593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971054,0.00064592675,0.00031225086,0.0007469462,0.00059650105,0.0005929392],"domain_scores_gemma":[0.99337715,0.0037728546,0.0006113741,0.0008671447,0.0006709897,0.0007005075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028738298,0.00083484483,0.00089555123,0.002838068,0.0025316495,0.004403189,0.00074844615,0.0009977643,0.004968969],"category_scores_gemma":[0.006137205,0.00082579046,0.0026889623,0.0011281896,0.0044055013,0.0057692598,0.002928462,0.0021974067,0.0009218995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014171761,0.000052518844,0.0007844933,0.00008313448,0.000020309973,0.00038922997,0.0014178168,0.0036721977,0.009320461,0.96958935,0.0008344853,0.013694234],"study_design_scores_gemma":[0.000049032016,0.00009689581,0.00066768273,0.000042781416,0.00002905727,0.00037595746,0.00021262898,0.015668817,0.007151235,0.96824616,0.007403127,0.00005672835],"about_ca_topic_score_codex":0.0011013394,"about_ca_topic_score_gemma":0.00077626074,"teacher_disagreement_score":0.004968969,"about_ca_system_score_codex":0.0018616625,"about_ca_system_score_gemma":0.0010056357,"threshold_uncertainty_score":0.016622841},"labels":[],"label_agreement":null},{"id":"W1506688052","doi":"10.3233/fi-2014-990","title":"Heuristics to Solve a Real-world Asymmetric Vehicle Routing Problem with Side Constraints","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network","score_opus":0.013558364460848333,"score_gpt":0.25216539241031305,"score_spread":0.23860702794946473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506688052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14166713,0.0013842927,0.84444714,0.000463094,0.00015007537,0.00038804163,0.00038381573,0.00052768004,0.010588744],"genre_scores_gemma":[0.5167043,0.0005579905,0.4781316,0.00014603592,0.000073271076,0.00053516286,0.00052697095,0.00010921304,0.0032155153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00031567473,0.00002411196,0.00007241964,0.000055033153,0.00010056371],"domain_scores_gemma":[0.9982255,0.0013822214,0.0001447136,0.00006972013,0.00010709088,0.00007074044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012528569,0.0012903227,0.0009838917,0.0011011872,0.00055549346,0.0009932942,0.0014779008,0.0015559995,0.0025691716],"category_scores_gemma":[0.0023166554,0.0006281015,0.00076670287,0.0017417745,0.0006425734,0.00078368257,0.0006262306,0.00097456924,0.00024210215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006688071,0.00009193161,0.0002748099,0.00008273525,0.000040592407,0.00007940721,0.000035339108,0.9796118,0.00047400908,0.004231563,0.0008019377,0.014209014],"study_design_scores_gemma":[0.000053894062,0.00006602596,0.00011627426,0.000015323785,0.00001815482,0.000032263048,0.000040982384,0.9953257,0.00034609242,0.0032987085,0.00067998725,0.0000065853123],"about_ca_topic_score_codex":0.0041242056,"about_ca_topic_score_gemma":0.004303299,"teacher_disagreement_score":0.0041242056,"about_ca_system_score_codex":0.00090119295,"about_ca_system_score_gemma":0.0013201878,"threshold_uncertainty_score":0.008594751},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010013033749252725,"score_gpt":0.23239784096643004,"score_spread":0.22238480721717732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509287145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2751786,0.004262846,0.6305194,0.0016213395,0.00038886437,0.00024528036,0.0022116154,0.0010365766,0.08453548],"genre_scores_gemma":[0.74306667,0.0022207312,0.21965662,0.0007675355,0.0005867342,0.00073393487,0.0028655583,0.0004342442,0.02966802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744844,0.0004755683,0.00025725694,0.0007063722,0.00058212416,0.0005301286],"domain_scores_gemma":[0.9946398,0.003008626,0.0006794309,0.00067521614,0.0006349829,0.0003619777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017011798,0.0007389244,0.0011708468,0.003417971,0.0036415707,0.0034943908,0.0013167885,0.0011842675,0.014453761],"category_scores_gemma":[0.008210031,0.00089368486,0.0017330353,0.00334159,0.0036535903,0.0063038208,0.0030880475,0.0014334414,0.0018868813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062445564,0.000026008158,0.00092552276,0.000121029996,0.000016175436,0.00032188228,0.00044823508,0.0017168928,0.0008586872,0.96688277,0.0029280938,0.025692109],"study_design_scores_gemma":[0.000020326499,0.00002741126,0.00036835246,0.00006666424,0.000016139256,0.00081113545,0.00018292437,0.0047008675,0.0010889916,0.9771966,0.015485614,0.00003501082],"about_ca_topic_score_codex":0.0011758069,"about_ca_topic_score_gemma":0.0011532409,"teacher_disagreement_score":0.014453761,"about_ca_system_score_codex":0.0020123972,"about_ca_system_score_gemma":0.00082012045,"threshold_uncertainty_score":0.04835266},"labels":[],"label_agreement":null},{"id":"W1513961548","doi":"10.3233/fun-2007-791-205","title":"A Propositional Proof System with Quantification Over Permutations","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Propositional variable; Propositional formula; Computer science; Propositional calculus; Mathematics; Discrete mathematics; Theoretical computer science; Intermediate logic","score_opus":0.01971584741629512,"score_gpt":0.2577705835148094,"score_spread":0.2380547360985143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513961548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014573478,0.00024802083,0.97275066,0.00089318544,0.0002075951,0.00012397867,0.0006091155,0.0040412103,0.0065527232],"genre_scores_gemma":[0.26018196,0.0003377045,0.72915846,0.0007038863,0.00024490486,0.00020517419,0.0008671233,0.00042321277,0.007877596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997471,0.00065132586,0.00023978083,0.00057187246,0.0007179195,0.00034804593],"domain_scores_gemma":[0.9959591,0.0023570133,0.00024472483,0.00069934694,0.000468837,0.0002710159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00289719,0.0005968266,0.0007033927,0.0010429701,0.0012339331,0.0038169788,0.0015037812,0.0011983847,0.008113462],"category_scores_gemma":[0.0047211354,0.0009951281,0.001099144,0.0010061916,0.0024216175,0.005379904,0.0034974325,0.0035043994,0.0012517757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015352327,0.000112170484,0.0006303404,0.00024510734,0.00006848525,0.00028825036,0.00033471925,0.021221297,0.010660277,0.8953168,0.006159069,0.06480993],"study_design_scores_gemma":[0.0002616604,0.00012708096,0.0004880239,0.00008066241,0.0001238453,0.00043250003,0.000072625495,0.18337451,0.02236347,0.71904844,0.07352024,0.00010686216],"about_ca_topic_score_codex":0.0023618776,"about_ca_topic_score_gemma":0.001866535,"teacher_disagreement_score":0.008113462,"about_ca_system_score_codex":0.0018286313,"about_ca_system_score_gemma":0.0033320403,"threshold_uncertainty_score":0.027142286},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021207698024009347,"score_gpt":0.2559839443181559,"score_spread":0.23477624629414656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519279188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102856494,0.0019041696,0.8046052,0.002209147,0.00047460088,0.0001170296,0.00030631258,0.00024079464,0.087286204],"genre_scores_gemma":[0.8627825,0.001118071,0.122528784,0.0007569826,0.0006477168,0.00014338426,0.00040237044,0.000079098405,0.011541109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733377,0.0007414491,0.00017287652,0.00045819386,0.001026012,0.00026776147],"domain_scores_gemma":[0.99729234,0.0012142613,0.0002711319,0.00036857958,0.0005770296,0.00027654783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026607318,0.00043362673,0.0007453336,0.0017111283,0.0013263653,0.0034960848,0.0007396925,0.000882497,0.0036663518],"category_scores_gemma":[0.0048836716,0.00036187764,0.0016302647,0.0011125703,0.0039046935,0.0058087963,0.0029915487,0.0033124068,0.0006956371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007325442,0.0000118528,0.000050636783,0.000015703354,0.000005048771,0.000032697553,0.00007961249,0.00041277354,0.00036912755,0.997042,0.00024179746,0.00173138],"study_design_scores_gemma":[0.000009508174,0.000017135617,0.00007158461,0.000009082408,0.0000054129514,0.00007971802,0.000043906606,0.0057673184,0.0005301309,0.9898246,0.0036341308,0.000007368089],"about_ca_topic_score_codex":0.0006413226,"about_ca_topic_score_gemma":0.0004114461,"teacher_disagreement_score":0.0036663518,"about_ca_system_score_codex":0.0015311007,"about_ca_system_score_gemma":0.0007330481,"threshold_uncertainty_score":0.014071465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03795754249442898,"score_gpt":0.24078968601563955,"score_spread":0.20283214352121057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529665683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084358705,0.0002640717,0.98791575,0.00015922867,0.000039860846,0.000036021855,0.0000786308,0.00018971587,0.0028808415],"genre_scores_gemma":[0.579042,0.0011284694,0.41115808,0.00015965462,0.00011440084,0.00034099753,0.00035040025,0.00008556599,0.00762042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985746,0.00043843745,0.000103723476,0.00029036778,0.0004316181,0.00016125882],"domain_scores_gemma":[0.9985104,0.0008194396,0.00021824011,0.00017807314,0.00017575297,0.0000980758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020646015,0.0010570046,0.001012629,0.0010310182,0.0008092773,0.0026543303,0.0018075282,0.0013724106,0.0018574073],"category_scores_gemma":[0.0029389928,0.00061325065,0.0022713179,0.000946768,0.0023095445,0.003983301,0.0013800629,0.0017080323,0.0004426991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009511892,0.00003558869,0.0004111934,0.00007254466,0.000049641676,0.00019102804,0.00021607589,0.59499335,0.0017529409,0.39319247,0.0003399706,0.0086500775],"study_design_scores_gemma":[0.000019880903,0.000038711463,0.00010245262,0.00001547274,0.000029015426,0.000040591363,0.000030744523,0.8504816,0.00095275755,0.14605863,0.002209081,0.000021103395],"about_ca_topic_score_codex":0.007658405,"about_ca_topic_score_gemma":0.0049708392,"teacher_disagreement_score":0.007658405,"about_ca_system_score_codex":0.0018648817,"about_ca_system_score_gemma":0.001429746,"threshold_uncertainty_score":0.015227616},"labels":[],"label_agreement":null},{"id":"W1531179027","doi":"10.3233/fun-2007-76402","title":"Fuzzification of Rational and Recognizable Sets","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo; Saint Mary's University","funders":"","keywords":"Computer science; Set (abstract data type); Mathematics; Artificial intelligence; Programming language","score_opus":0.20775407789635877,"score_gpt":0.4564450907038856,"score_spread":0.24869101280752684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531179027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06973936,0.00082595414,0.91912925,0.0003446177,0.00007818959,0.000078838755,0.00006417516,0.00020610234,0.009533494],"genre_scores_gemma":[0.7202641,0.00074517465,0.2707905,0.0001950076,0.00015616819,0.00014505452,0.00012847026,0.000058196838,0.007517433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729294,0.0005255206,0.00021107454,0.0008385362,0.0008920814,0.0002397872],"domain_scores_gemma":[0.9974668,0.0013675749,0.00030295464,0.0004843612,0.0002983633,0.00007991941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003010246,0.0005360454,0.0007453841,0.0014685106,0.0008263655,0.0028579931,0.0010277036,0.0011325205,0.002335577],"category_scores_gemma":[0.006714683,0.0003484426,0.0015646308,0.0005796819,0.004781794,0.004878155,0.0014432204,0.0019692285,0.00032056557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002751448,0.000015045637,0.00029000852,0.000061305545,0.000019023786,0.00019892493,0.0006004934,0.008207838,0.0045546554,0.97425437,0.00009389571,0.01167671],"study_design_scores_gemma":[0.000017964514,0.00006571146,0.0004382837,0.00006588917,0.000041972475,0.0002821918,0.00019058211,0.053921968,0.008917306,0.9292379,0.006785015,0.000035352594],"about_ca_topic_score_codex":0.00092707574,"about_ca_topic_score_gemma":0.00040894133,"teacher_disagreement_score":0.003010246,"about_ca_system_score_codex":0.0013123171,"about_ca_system_score_gemma":0.0008202396,"threshold_uncertainty_score":0.015919864},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022024443204917362,"score_gpt":0.25560863738836026,"score_spread":0.2335841941834429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531714509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03661879,0.0013332582,0.95213604,0.0008504037,0.000093181974,0.000048775393,0.00015976082,0.00014741626,0.008612329],"genre_scores_gemma":[0.7493503,0.0020459844,0.23894039,0.00028037094,0.000286315,0.00017819136,0.00038252902,0.000074498574,0.008461474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956398,0.0013002683,0.00028476532,0.0011566773,0.0013372718,0.000281262],"domain_scores_gemma":[0.99542,0.0021098799,0.00062454975,0.00096040266,0.0005885694,0.0002966525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003327989,0.0007040969,0.0015346702,0.0024396784,0.0009836935,0.0037721114,0.0027886822,0.0021063725,0.0031036704],"category_scores_gemma":[0.010861325,0.00044239324,0.002230803,0.0024749094,0.0037836616,0.010157646,0.00440506,0.003086122,0.0004910883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006643868,0.000031664084,0.00086759217,0.00012365545,0.000050198498,0.00023288933,0.0005727925,0.055691253,0.000913983,0.91811836,0.00063419394,0.022696994],"study_design_scores_gemma":[0.000018232056,0.00010808128,0.0004355227,0.000055557164,0.00003992126,0.0003758883,0.00018832908,0.3676404,0.00049532484,0.6241733,0.006435178,0.0000341853],"about_ca_topic_score_codex":0.0026067088,"about_ca_topic_score_gemma":0.00090350315,"teacher_disagreement_score":0.0037721114,"about_ca_system_score_codex":0.0018041726,"about_ca_system_score_gemma":0.0007224607,"threshold_uncertainty_score":0.017600358},"labels":[],"label_agreement":null},{"id":"W1534895432","doi":"","title":"The Shortest Common Superstring Problem and Viral Genome Compression","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Superstring theory; Upper and lower bounds; Genome; Combinatorics; Mathematics; Computer science; Algorithm; Gene; Biology; Genetics; Supersymmetry","score_opus":0.006281524256892357,"score_gpt":0.2102484524311311,"score_spread":0.20396692817423875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534895432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12956001,0.0036716487,0.85061216,0.0018711465,0.00023597102,0.000104057865,0.00043041012,0.0005746285,0.01293994],"genre_scores_gemma":[0.59418833,0.003560291,0.38952616,0.00046033823,0.0004355629,0.0003670689,0.0019388681,0.00034270264,0.009180711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987281,0.00039424337,0.00007522082,0.00017738796,0.00046716965,0.00015782041],"domain_scores_gemma":[0.9967533,0.0022729414,0.00026841948,0.00038377146,0.0002453609,0.000076229364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010486277,0.00061959797,0.0009920968,0.001573835,0.0007601565,0.0016962852,0.001076211,0.0017127083,0.002976167],"category_scores_gemma":[0.006903034,0.00037174302,0.00067746406,0.003136028,0.0016750395,0.0034987188,0.0014145533,0.0016247667,0.000651159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003234071,0.00012150874,0.0013044672,0.00029527946,0.000067788846,0.00027086097,0.0002608397,0.44437137,0.007649849,0.35231388,0.009951338,0.18306948],"study_design_scores_gemma":[0.00002842266,0.000059198264,0.00039941134,0.000035578203,0.0000143899,0.00024757054,0.000093762814,0.58388644,0.005745233,0.40380362,0.005663745,0.000022558575],"about_ca_topic_score_codex":0.0011470857,"about_ca_topic_score_gemma":0.0008507825,"teacher_disagreement_score":0.002976167,"about_ca_system_score_codex":0.0011175255,"about_ca_system_score_gemma":0.00081525603,"threshold_uncertainty_score":0.0099563},"labels":[],"label_agreement":null},{"id":"W1537079998","doi":"10.3233/fun-2004-59403","title":"Trajectory-Based Embedding Relations","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Embedding; Trajectory; Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.013528172953539632,"score_gpt":0.2637694309856211,"score_spread":0.25024125803208147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537079998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10345074,0.00042685878,0.8544309,0.0007651953,0.00014660007,0.00017785326,0.000988793,0.00055593805,0.039056983],"genre_scores_gemma":[0.7876622,0.0007942343,0.180231,0.00027288438,0.00020261802,0.00032715444,0.0016685781,0.00035181956,0.02848942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831474,0.0003585485,0.00015446427,0.0004944703,0.0004039478,0.000273868],"domain_scores_gemma":[0.99553645,0.0016866698,0.0006130075,0.000973073,0.00076577766,0.00042502733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172134,0.000717446,0.0005632159,0.0015164713,0.001002832,0.0025315075,0.0010042527,0.00089546037,0.012922758],"category_scores_gemma":[0.004949836,0.0003477719,0.0009990842,0.0016205157,0.0023352792,0.008055233,0.002236965,0.0020386404,0.0017648813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048863232,0.000034852506,0.00035010828,0.000051881867,0.000010406381,0.00010003163,0.00014005914,0.013436961,0.0018060872,0.9646684,0.0009075344,0.018444749],"study_design_scores_gemma":[0.000017139471,0.00009548113,0.0003927616,0.000029597351,0.000019742958,0.00022598627,0.000120888144,0.08181773,0.0048914296,0.8993642,0.012988393,0.00003663408],"about_ca_topic_score_codex":0.0015850608,"about_ca_topic_score_gemma":0.0018573622,"teacher_disagreement_score":0.012922758,"about_ca_system_score_codex":0.0014304223,"about_ca_system_score_gemma":0.0008438995,"threshold_uncertainty_score":0.04323095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Western University","funders":"","keywords":"Substring; Computer science; Mathematics; Programming language; Data structure","score_opus":0.02942245181713476,"score_gpt":0.2242724471165491,"score_spread":0.19484999529941432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542422837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11930379,0.002732041,0.86716527,0.00067603093,0.000112215435,0.00005474637,0.00045139896,0.000379562,0.009124887],"genre_scores_gemma":[0.53561825,0.0016570332,0.4573568,0.0002451814,0.0002661819,0.00012068016,0.0008528887,0.00022843387,0.0036545603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983962,0.00043629235,0.00014224782,0.0005456797,0.00036426657,0.00011524875],"domain_scores_gemma":[0.9907346,0.0063003474,0.00093155727,0.0012465733,0.0005406629,0.00024618246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013131246,0.00040355464,0.0011258529,0.0018595725,0.0008863376,0.0016242632,0.0013105402,0.0010581551,0.0028239256],"category_scores_gemma":[0.013023989,0.00046169956,0.0006690415,0.0023184207,0.0016354627,0.0052847117,0.0015970658,0.0017420249,0.00066080916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028729538,0.00009493139,0.0034067067,0.00067668996,0.00006091563,0.00031925956,0.0004423302,0.033070832,0.011656383,0.6910986,0.0039168163,0.25496942],"study_design_scores_gemma":[0.00001655324,0.000060161918,0.00076976314,0.000059298378,0.000021180056,0.0006329946,0.00011225479,0.060990594,0.0083133355,0.9227368,0.0062595685,0.000027387185],"about_ca_topic_score_codex":0.0002234021,"about_ca_topic_score_gemma":0.00024698218,"teacher_disagreement_score":0.0028239256,"about_ca_system_score_codex":0.0006109314,"about_ca_system_score_gemma":0.0005589427,"threshold_uncertainty_score":0.009446979},"labels":[],"label_agreement":null},{"id":"W1543636397","doi":"10.3233/fi-2018-1627","title":"Anatomy of the Chase","year":2018,"lang":"en","type":"preprint","venue":"Fundamenta Informaticae","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Chase; Undecidable problem; Computer science; Completeness (order theory); Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.018567064667733963,"score_gpt":0.2900648519673199,"score_spread":0.27149778729958596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543636397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151896505,0.0030361675,0.8004274,0.0071738786,0.00054217264,0.00035215038,0.00042209952,0.001199123,0.17165728],"genre_scores_gemma":[0.4939071,0.005845027,0.40405858,0.00419244,0.0012282382,0.0015803676,0.0016288755,0.002204211,0.085355125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919606,0.002602515,0.0006632608,0.0019340712,0.001965877,0.0008736193],"domain_scores_gemma":[0.98114955,0.011223564,0.00086726167,0.0033570286,0.002692556,0.00070998824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065830825,0.0009476385,0.0012476316,0.0038051067,0.0055432315,0.007756538,0.0031423222,0.0046540145,0.022038696],"category_scores_gemma":[0.026786495,0.0014418892,0.002824573,0.00329205,0.01505859,0.01937492,0.0087899,0.009484011,0.006774251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002003108,0.000010828611,0.00015768067,0.000048908812,0.000007719687,0.000077658784,0.0003269351,0.0006710801,0.0002553276,0.99016905,0.0015764361,0.0066783517],"study_design_scores_gemma":[0.000020015063,0.000034956294,0.00013238682,0.0000769176,0.000015286543,0.0002436725,0.00012375129,0.0062530497,0.0007016356,0.94988453,0.042487286,0.00002652521],"about_ca_topic_score_codex":0.0040448895,"about_ca_topic_score_gemma":0.0023802558,"teacher_disagreement_score":0.022038696,"about_ca_system_score_codex":0.0040179417,"about_ca_system_score_gemma":0.0039234348,"threshold_uncertainty_score":0.07372677},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03127157510158429,"score_gpt":0.2525004377000977,"score_spread":0.22122886259851343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546124752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68524766,0.0009968358,0.28454426,0.001104775,0.000144939,0.00015367572,0.0005546031,0.0005328119,0.026720416],"genre_scores_gemma":[0.96923673,0.00045544346,0.025899198,0.000065742504,0.00008764075,0.00013517174,0.00038860226,0.00013350906,0.003597996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734807,0.00054674,0.0001800337,0.00057504955,0.00073128974,0.000618826],"domain_scores_gemma":[0.97042793,0.023571089,0.0017922287,0.0021028966,0.0012887965,0.0008170827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017647679,0.00071147643,0.0010345909,0.0015044191,0.0012569005,0.004792007,0.001314366,0.0011515465,0.007220926],"category_scores_gemma":[0.015739141,0.00050327583,0.0014991509,0.0012051683,0.0029071276,0.009193416,0.0028684444,0.0026010405,0.00052126154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010927694,0.00018522039,0.0045256456,0.00039591343,0.000104215884,0.0003889073,0.0007759368,0.08077283,0.013202868,0.8543055,0.0020425515,0.042207547],"study_design_scores_gemma":[0.00004370589,0.00029387293,0.0017576216,0.000050429873,0.00012840805,0.00039886942,0.00034164725,0.308711,0.013663589,0.6717713,0.0027391666,0.00010034632],"about_ca_topic_score_codex":0.0012198746,"about_ca_topic_score_gemma":0.001344206,"teacher_disagreement_score":0.007220926,"about_ca_system_score_codex":0.0020652078,"about_ca_system_score_gemma":0.0014887863,"threshold_uncertainty_score":0.024156392},"labels":[],"label_agreement":null},{"id":"W1547564544","doi":"10.3233/fi-2013-907","title":"Lattice Machine Classification based on Contextual Probability","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Lattice (music); Computer science; Artificial intelligence; Pattern recognition (psychology); Mathematics; Machine learning; Physics","score_opus":0.04768432713206656,"score_gpt":0.26126066096898043,"score_spread":0.21357633383691388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547564544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008120249,0.000944234,0.9882697,0.00039773458,0.000093730465,0.000042506643,0.00010102979,0.0003290555,0.0017016446],"genre_scores_gemma":[0.38180843,0.0020751131,0.61184186,0.0003506631,0.000630105,0.0003811523,0.000606999,0.00013349598,0.0021722363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555945,0.0014810169,0.00028568888,0.00069764873,0.0017089169,0.00026736723],"domain_scores_gemma":[0.99311334,0.004574339,0.00048232125,0.0006620839,0.00097583333,0.00019199634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038534172,0.00071304134,0.001850234,0.0029766879,0.0010179738,0.0027561581,0.0020437886,0.001632157,0.0025262283],"category_scores_gemma":[0.021662628,0.00042800952,0.0011764868,0.0029341802,0.002409714,0.0057224007,0.0022793987,0.002268851,0.0009923313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000218096,0.0000820068,0.006206667,0.00038945387,0.00011050766,0.00031129402,0.00032908723,0.16889599,0.002656744,0.38178265,0.0060964576,0.43292105],"study_design_scores_gemma":[0.000016591952,0.000041569125,0.00052581105,0.000062204424,0.000019884668,0.00017834661,0.000050911887,0.76201683,0.0009921875,0.23137896,0.004684242,0.000032429994],"about_ca_topic_score_codex":0.0023667756,"about_ca_topic_score_gemma":0.0017776121,"teacher_disagreement_score":0.0038534172,"about_ca_system_score_codex":0.0014810412,"about_ca_system_score_gemma":0.0012349802,"threshold_uncertainty_score":0.020379007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024639848227710065,"score_gpt":0.23867644491508688,"score_spread":0.21403659668737682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548747954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007275622,0.005412737,0.9321905,0.0027533008,0.00060720916,0.00017716353,0.0016197263,0.0011599443,0.04880381],"genre_scores_gemma":[0.26156646,0.010110035,0.6930079,0.0026789857,0.0017562282,0.0011041736,0.0036064344,0.0010476616,0.025122074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951056,0.0014076114,0.00066421775,0.0009767349,0.0014390027,0.00040674943],"domain_scores_gemma":[0.99579394,0.001524334,0.00057132356,0.0008009745,0.0011430008,0.00016642772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004806695,0.0009714262,0.0008610504,0.0034823818,0.0021775693,0.007826112,0.002052954,0.0017891737,0.010594029],"category_scores_gemma":[0.008609201,0.0007845026,0.0016174682,0.0050568543,0.0051801032,0.015656747,0.0030389242,0.0030265772,0.0035213162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008521048,0.0000045881193,0.00003253639,0.000041027604,0.0000040808704,0.00002681447,0.00022217567,0.00034811907,0.00019968225,0.99117434,0.0014199966,0.0065181013],"study_design_scores_gemma":[0.000012302418,0.000012465516,0.000057509333,0.000070037895,0.0000117582085,0.00017625048,0.00016272099,0.0037328887,0.0006701038,0.9311385,0.06393677,0.000018758716],"about_ca_topic_score_codex":0.0023882247,"about_ca_topic_score_gemma":0.0010852861,"teacher_disagreement_score":0.010594029,"about_ca_system_score_codex":0.002086675,"about_ca_system_score_gemma":0.0015473003,"threshold_uncertainty_score":0.035440624},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01394603826728902,"score_gpt":0.25979712306420516,"score_spread":0.24585108479691614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552423790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014545662,0.025781387,0.34830478,0.042236928,0.0034549043,0.00020687377,0.00041836587,0.00058335316,0.5644677],"genre_scores_gemma":[0.778022,0.02106141,0.13986574,0.013422643,0.007052958,0.0011142901,0.00046716182,0.0002402941,0.038753536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548715,0.0014459512,0.00032397776,0.00082785386,0.00148453,0.00043042024],"domain_scores_gemma":[0.99440527,0.0030171315,0.00044535424,0.0010603599,0.0007436696,0.00032828312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034040955,0.0008832289,0.0010711699,0.0026982091,0.0036493489,0.008308818,0.001884503,0.004389218,0.005476435],"category_scores_gemma":[0.008320223,0.00038152988,0.0011114114,0.0023982488,0.0329917,0.011494878,0.0057713557,0.0061088894,0.001989811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018663088,0.0000023331463,0.00003589654,0.000022698056,0.000002604228,0.00001239792,0.00015595484,0.00007920224,0.000033938777,0.9954228,0.0013586759,0.002871644],"study_design_scores_gemma":[0.0000057676493,0.000007812877,0.00007668221,0.000053171865,0.000003971672,0.00010880037,0.0000943023,0.00041184854,0.000090378635,0.9590125,0.040125865,0.00000879366],"about_ca_topic_score_codex":0.0020896976,"about_ca_topic_score_gemma":0.0009584133,"teacher_disagreement_score":0.008308818,"about_ca_system_score_codex":0.0034424623,"about_ca_system_score_gemma":0.0048373616,"threshold_uncertainty_score":0.024976969},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030419670666367606,"score_gpt":0.22433861280715583,"score_spread":0.19391894214078823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553071595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067241944,0.0011098324,0.8819641,0.0006033234,0.00039554032,0.00041058593,0.0028884513,0.022838246,0.022548039],"genre_scores_gemma":[0.33598748,0.0009934411,0.6262264,0.0007206728,0.0002605786,0.0005700882,0.008795657,0.0029708198,0.023474796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991122,0.00009194478,0.00009025502,0.00016322917,0.00044284787,0.000099521305],"domain_scores_gemma":[0.99816567,0.0004146512,0.00009111989,0.0007299236,0.00055231364,0.000046257526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041877574,0.00056997256,0.00061803416,0.0016255621,0.000423991,0.0010855746,0.0013735016,0.0006184369,0.0062914994],"category_scores_gemma":[0.0028924234,0.0003041316,0.0005496937,0.002300026,0.00076268404,0.0021346554,0.0016654284,0.000781142,0.0027054083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046296863,0.00021688706,0.0013541719,0.00044363958,0.000060017046,0.000821639,0.00051541504,0.032897525,0.10285846,0.08769705,0.042428803,0.7302435],"study_design_scores_gemma":[0.00020093363,0.00040099918,0.0016835603,0.00012433954,0.000102110025,0.0020689175,0.00023848125,0.48446676,0.27051568,0.12285126,0.117229044,0.00011787172],"about_ca_topic_score_codex":0.0011471857,"about_ca_topic_score_gemma":0.0012253736,"teacher_disagreement_score":0.0062914994,"about_ca_system_score_codex":0.00068013516,"about_ca_system_score_gemma":0.0011387765,"threshold_uncertainty_score":0.021047175},"labels":[],"label_agreement":null},{"id":"W1554777263","doi":"10.3233/fi-2009-203","title":"Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.044114998271657734,"score_gpt":0.29313819367518373,"score_spread":0.249023195403526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554777263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043859586,0.0010240212,0.94849443,0.00026345477,0.000099478726,0.00017102865,0.000335954,0.0030874878,0.0026646524],"genre_scores_gemma":[0.097765885,0.00036979106,0.89795685,0.00010128575,0.00008649147,0.0002554613,0.0011977393,0.00031491453,0.0019515996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984497,0.00028977238,0.0001975899,0.00037153155,0.0005247901,0.00016661777],"domain_scores_gemma":[0.99500763,0.002698271,0.0004557312,0.00102912,0.00069931947,0.000109943765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013960805,0.0011642167,0.0013397442,0.002057541,0.001065771,0.0018789861,0.0021051802,0.0013857419,0.0046796896],"category_scores_gemma":[0.008979109,0.0007131189,0.0011457829,0.004000831,0.00066277635,0.0051678484,0.0017225868,0.001303096,0.0019000998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075110816,0.0002672678,0.0034751599,0.0005953567,0.00019032018,0.00024773667,0.0006599236,0.12785992,0.021739006,0.0612687,0.010247934,0.7726976],"study_design_scores_gemma":[0.0002742179,0.00024225898,0.0010341224,0.000083218016,0.00009238139,0.0005142085,0.00025743194,0.81222874,0.026549648,0.1426751,0.015981037,0.00006772665],"about_ca_topic_score_codex":0.0015526903,"about_ca_topic_score_gemma":0.003081806,"teacher_disagreement_score":0.0046796896,"about_ca_system_score_codex":0.0009779936,"about_ca_system_score_gemma":0.0017852691,"threshold_uncertainty_score":0.0156551},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02803641882716702,"score_gpt":0.24436297975022234,"score_spread":0.21632656092305533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559666492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02337516,0.00746713,0.900131,0.002828611,0.00069885683,0.00008784805,0.0001246676,0.00010823502,0.065178394],"genre_scores_gemma":[0.73049146,0.0051969313,0.25564957,0.00095002295,0.0013940481,0.00032099988,0.0001479628,0.00007663387,0.005772353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936128,0.003405136,0.00033385152,0.000749676,0.0016373007,0.00026117833],"domain_scores_gemma":[0.99570626,0.0029745875,0.0003644146,0.00039156614,0.00040810826,0.00015507781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054275715,0.00058262615,0.0011991742,0.0023878522,0.0011647686,0.004626737,0.00090378727,0.0011529214,0.0018761775],"category_scores_gemma":[0.009030891,0.00041070703,0.0014670414,0.0023990234,0.010599243,0.0067453543,0.0032509768,0.0031369836,0.0004076687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007128485,0.0000029122295,0.0000480252,0.000025410647,0.000006752333,0.000031869506,0.00017722521,0.0015606264,0.00012398015,0.9944015,0.00022289502,0.0033917073],"study_design_scores_gemma":[0.0000049862165,0.000015179693,0.000059877497,0.000017404303,0.000004669078,0.00006099998,0.0000656809,0.005957561,0.00011749221,0.988667,0.005020247,0.000008795368],"about_ca_topic_score_codex":0.00053253246,"about_ca_topic_score_gemma":0.00029140283,"teacher_disagreement_score":0.0054275715,"about_ca_system_score_codex":0.0014870528,"about_ca_system_score_gemma":0.00073537655,"threshold_uncertainty_score":0.028704047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Formal language; Computer science; Programming language; Computational biology; Biology","score_opus":0.006143947400711379,"score_gpt":0.24264472975004872,"score_spread":0.23650078234933733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562193608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050981894,0.00092393206,0.9365433,0.0013683034,0.00010087457,0.00011170089,0.00048956217,0.0006320042,0.008848432],"genre_scores_gemma":[0.6316996,0.0008173653,0.35817468,0.0004733998,0.0002709411,0.00020867078,0.0012098559,0.00019897496,0.006946505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981616,0.0004460579,0.0001425177,0.00045887934,0.0005519591,0.00023896103],"domain_scores_gemma":[0.9956995,0.002816155,0.00032855273,0.00040754332,0.00061312784,0.00013506878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013715161,0.00051499734,0.00049014133,0.0019562533,0.0012218329,0.0024891566,0.0012816669,0.0006562912,0.0043022265],"category_scores_gemma":[0.0054273913,0.0004213282,0.0020722332,0.0016094361,0.0028957715,0.0047241054,0.0016660652,0.0017587519,0.00057669444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005984749,0.000058806134,0.00054633274,0.00018898588,0.00002427681,0.00021430248,0.00067043875,0.012740353,0.0063477503,0.9434101,0.0015742929,0.03416456],"study_design_scores_gemma":[0.000020583324,0.00005506671,0.0002363968,0.000056651643,0.000031087155,0.0002778092,0.00021821156,0.065384164,0.005486469,0.9166525,0.011548606,0.00003246192],"about_ca_topic_score_codex":0.0015620623,"about_ca_topic_score_gemma":0.00097261526,"teacher_disagreement_score":0.0043022265,"about_ca_system_score_codex":0.0018453168,"about_ca_system_score_gemma":0.001399671,"threshold_uncertainty_score":0.014392376},"labels":[],"label_agreement":null},{"id":"W1562670678","doi":"10.3233/fi-2010-264","title":"Structures with Multirelations, their Discrete Dualities and Applications","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Duality (order theory); Class (philosophy); Dual (grammatical number); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.006596488771713494,"score_gpt":0.2245322349275121,"score_spread":0.2179357461557986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562670678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22210059,0.024150198,0.5402578,0.008760569,0.0009226951,0.00008782999,0.00025348188,0.00022270398,0.20324418],"genre_scores_gemma":[0.91991305,0.0033158248,0.067038864,0.00063122355,0.00058818667,0.00005408492,0.000102955324,0.000047601538,0.008308181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834585,0.0006877872,0.00009740023,0.000385182,0.000352482,0.00013126535],"domain_scores_gemma":[0.9979907,0.00095343014,0.00026023528,0.0002931532,0.00023847348,0.00026413306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018572995,0.0004838929,0.0005467565,0.0018512275,0.0016203168,0.003310086,0.0007157619,0.0011480948,0.0034719952],"category_scores_gemma":[0.0038681782,0.0005385746,0.0007884259,0.0015598217,0.0055689528,0.007829368,0.0038471206,0.0036247496,0.00039331737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008261905,0.000008829133,0.00008156152,0.000020803236,0.000002547292,0.0000331103,0.00012527019,0.00022990209,0.0001879017,0.9964437,0.00014255708,0.0027156507],"study_design_scores_gemma":[0.0000063092884,0.000010397875,0.00006402478,0.000019878606,0.000003568755,0.00014540995,0.00011411214,0.0019379185,0.00028856512,0.9914596,0.0059441687,0.0000060905527],"about_ca_topic_score_codex":0.00043743532,"about_ca_topic_score_gemma":0.00031364008,"teacher_disagreement_score":0.0034719952,"about_ca_system_score_codex":0.0013412143,"about_ca_system_score_gemma":0.00043033017,"threshold_uncertainty_score":0.011614978},"labels":[],"label_agreement":null},{"id":"W1565803390","doi":"10.3233/fi-2013-890","title":"Nearness of Sets in Local Admissible Covers. Theory and Application in Micropalaeontology","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.006242084648264107,"score_gpt":0.2526267368455923,"score_spread":0.24638465219732816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565803390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2777705,0.014898504,0.675432,0.0011181921,0.00018937356,0.00008506059,0.0007050536,0.00020548954,0.029595824],"genre_scores_gemma":[0.914565,0.0034067149,0.07656008,0.00017720106,0.0002851235,0.00011584039,0.0005385381,0.000059645394,0.0042919014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985281,0.00028468104,0.00017073279,0.00044190386,0.00046910235,0.00010545149],"domain_scores_gemma":[0.99517703,0.002936563,0.00076329894,0.00040232198,0.00043100427,0.00028976065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545265,0.0004414776,0.0008629711,0.0066046845,0.0016409118,0.0032067937,0.0010764243,0.001089743,0.0017495614],"category_scores_gemma":[0.007305091,0.0005238523,0.0013476477,0.0037043674,0.006375769,0.006844202,0.003346628,0.0014894777,0.00023713576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027796194,0.000011031453,0.0037809366,0.00019026744,0.000037676742,0.00017271176,0.00086866424,0.00961869,0.0017128382,0.9620545,0.0003933144,0.02113165],"study_design_scores_gemma":[0.0000043785867,0.000046726087,0.004577847,0.00013824599,0.000032470092,0.0006109605,0.00086916063,0.023504406,0.0013132265,0.96032566,0.008539797,0.000037177615],"about_ca_topic_score_codex":0.0019446033,"about_ca_topic_score_gemma":0.0012889643,"teacher_disagreement_score":0.0066046845,"about_ca_system_score_codex":0.0024899822,"about_ca_system_score_gemma":0.00039026033,"threshold_uncertainty_score":0.018066168},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05780612909384455,"score_gpt":0.27329282784682896,"score_spread":0.2154866987529844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567021454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023609865,0.0006534534,0.9680996,0.00067141507,0.00009153289,0.000084414576,0.0001308525,0.00010201596,0.006556926],"genre_scores_gemma":[0.73732775,0.0016148633,0.25558776,0.00012002664,0.00012773882,0.00029635784,0.00023042005,0.00003335929,0.004661763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975349,0.0013334182,0.00016293324,0.0002687642,0.00048571726,0.00021425894],"domain_scores_gemma":[0.99570835,0.0028803393,0.0007003361,0.00027498885,0.00026095926,0.0001749173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032852197,0.0010082513,0.001558076,0.0011632661,0.0005942157,0.003953386,0.0020197174,0.0016998573,0.0023043521],"category_scores_gemma":[0.0071381372,0.000719108,0.002180434,0.0016930327,0.0019136445,0.0033569008,0.0018319715,0.0019179025,0.00041497426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056308792,0.00003580017,0.000469323,0.00008658674,0.0000974446,0.00019335476,0.0001529498,0.8148134,0.00042167245,0.1753038,0.00034068854,0.008028672],"study_design_scores_gemma":[0.0000214717,0.000035241825,0.00013690618,0.000019440198,0.000027402555,0.00002655103,0.000038398062,0.87827367,0.00018043806,0.12002732,0.0011932513,0.000019856487],"about_ca_topic_score_codex":0.0054345876,"about_ca_topic_score_gemma":0.0041901534,"teacher_disagreement_score":0.0054345876,"about_ca_system_score_codex":0.0017778786,"about_ca_system_score_gemma":0.0015262252,"threshold_uncertainty_score":0.017374098},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Transition (genetics); Computer science; Theoretical computer science","score_opus":0.08387304573960493,"score_gpt":0.23571382373511496,"score_spread":0.15184077799551005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572529124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069995,0.0005769541,0.48141432,0.0007331057,0.00005187128,0.00008934774,0.0011500915,0.0005082419,0.008476642],"genre_scores_gemma":[0.96965003,0.00029731306,0.027240999,0.000047983754,0.000038195252,0.00011134151,0.0006783691,0.00008495527,0.001851008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715495,0.0005049483,0.000275354,0.00064505753,0.0009380369,0.00048174005],"domain_scores_gemma":[0.97960955,0.01492937,0.0015184899,0.0018344603,0.0014634837,0.00064471905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017729324,0.00052190985,0.0010808607,0.0018586117,0.0010785491,0.003650979,0.0015909722,0.0008993615,0.003609441],"category_scores_gemma":[0.015560905,0.00042881566,0.0019983011,0.0014738342,0.002143595,0.007904277,0.0021904702,0.0027046828,0.0003068498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002488105,0.00007896665,0.003100567,0.00024242734,0.00008766958,0.00022086063,0.0007159072,0.22380458,0.005511481,0.7444695,0.0007339091,0.020785253],"study_design_scores_gemma":[0.000015154739,0.00003905312,0.0007043053,0.000024163013,0.00003960533,0.000072990966,0.00007731766,0.39630082,0.0031173774,0.59824866,0.0013313374,0.000029254064],"about_ca_topic_score_codex":0.003076832,"about_ca_topic_score_gemma":0.0020666302,"teacher_disagreement_score":0.003650979,"about_ca_system_score_codex":0.0032955518,"about_ca_system_score_gemma":0.0014612754,"threshold_uncertainty_score":0.023911059},"labels":[],"label_agreement":null},{"id":"W1574815653","doi":"10.5555/1497096.1497101","title":"Learning from Skewed Class Multi-relational Databases","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Relation (database); Computer science; Class (philosophy); Relational database; Tuple; Data mining; Benchmarking; Feature (linguistics); Database; Machine learning; Artificial intelligence; Mathematics","score_opus":0.06297568131224934,"score_gpt":0.2940272656755052,"score_spread":0.23105158436325585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574815653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15212283,0.0015522136,0.84028685,0.0010321455,0.000087693465,0.00019259848,0.0015955811,0.001312602,0.0018175127],"genre_scores_gemma":[0.7694723,0.00095377146,0.22187483,0.0004086096,0.00026015867,0.0002725956,0.0052283704,0.00009883996,0.001430484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545527,0.0012232467,0.00037289519,0.0012501406,0.0014152662,0.0002832417],"domain_scores_gemma":[0.98683536,0.007642912,0.0012456037,0.0024693287,0.0014827265,0.000324106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051396624,0.001078017,0.0016962877,0.0025627143,0.000837291,0.003513551,0.0032726137,0.0014085666,0.001175705],"category_scores_gemma":[0.017376088,0.0005636267,0.0014543544,0.0027535327,0.0007156753,0.004975296,0.0027708681,0.00201123,0.00060506276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079450494,0.0005930054,0.031150583,0.00038840188,0.00043219107,0.0008709826,0.0008284828,0.33631316,0.0036515698,0.020254157,0.0083409995,0.59638196],"study_design_scores_gemma":[0.000024237544,0.000057888225,0.0013598579,0.000024291763,0.0000224793,0.00017605489,0.0001794985,0.97357404,0.0016441889,0.02170802,0.001216886,0.000012473468],"about_ca_topic_score_codex":0.0022714974,"about_ca_topic_score_gemma":0.0023425294,"teacher_disagreement_score":0.0051396624,"about_ca_system_score_codex":0.0010350854,"about_ca_system_score_gemma":0.000914791,"threshold_uncertainty_score":0.027181447},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016944709139934847,"score_gpt":0.22366183988554011,"score_spread":0.20671713074560527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577577485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044644095,0.002514764,0.8922534,0.00071835757,0.00022394267,0.000049594586,0.00037824412,0.0010592197,0.05815841],"genre_scores_gemma":[0.761081,0.0019645032,0.22490701,0.00020705217,0.00019918471,0.00014319329,0.00022463623,0.00014589865,0.011127583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996983,0.000101073,0.000013045006,0.00007863635,0.00007699179,0.000032014188],"domain_scores_gemma":[0.9995307,0.0001763377,0.000058712874,0.0000813211,0.000104760074,0.000048249305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002908042,0.00051787286,0.0003690775,0.000854554,0.0004008823,0.0020511409,0.0007189192,0.0008029561,0.004888689],"category_scores_gemma":[0.0013118758,0.00023084915,0.00052929076,0.00047598517,0.0011936863,0.0012903799,0.0006637312,0.0009486037,0.0008648583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053480246,0.000011881003,0.00038408715,0.000086221786,0.000014851452,0.00019029864,0.00031761176,0.05299857,0.014434668,0.9144687,0.0013748225,0.015664747],"study_design_scores_gemma":[0.000024894845,0.000072408315,0.0006835439,0.000043515545,0.000019847032,0.0003997705,0.00021195791,0.5570508,0.0056585106,0.4049961,0.030786723,0.00005191372],"about_ca_topic_score_codex":0.0024912732,"about_ca_topic_score_gemma":0.0010703681,"teacher_disagreement_score":0.004888689,"about_ca_system_score_codex":0.00069706683,"about_ca_system_score_gemma":0.00032060195,"threshold_uncertainty_score":0.016354263},"labels":[],"label_agreement":null},{"id":"W1582883792","doi":"10.3233/fi-2013-830","title":"Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"H2020 European Research Council","keywords":"Mathematics; Extension (predicate logic); Flow (mathematics); Graph; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.016177563522801797,"score_gpt":0.24519658257726382,"score_spread":0.229019019054462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582883792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828482,0.0016770025,0.8902397,0.0005252802,0.00016893359,0.00012573009,0.00033337323,0.0002158317,0.023865974],"genre_scores_gemma":[0.68098795,0.001978501,0.29962233,0.000364716,0.0003676617,0.0003472922,0.0006642641,0.00025753782,0.01540972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.00032498638,0.000062193605,0.00030074822,0.00028556175,0.000097344746],"domain_scores_gemma":[0.9966863,0.0017827656,0.00043653484,0.00039418458,0.0003549846,0.00034522344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011365663,0.000636624,0.0008618794,0.003486869,0.001621526,0.0022844598,0.0013288213,0.0013294587,0.003843807],"category_scores_gemma":[0.0065224716,0.0006182943,0.0013691409,0.0013457778,0.0033461575,0.005389187,0.0034505972,0.002164053,0.00060821156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008087229,0.000022243723,0.000809941,0.000120870885,0.000018227174,0.00016237462,0.00048643036,0.013831207,0.0023500675,0.96072876,0.0008650664,0.020523826],"study_design_scores_gemma":[0.000018401242,0.00008324571,0.0007179577,0.00008432126,0.00002547276,0.00034027745,0.00031398647,0.05107947,0.0014402217,0.93303376,0.012826717,0.000036230653],"about_ca_topic_score_codex":0.0019685314,"about_ca_topic_score_gemma":0.0014993715,"teacher_disagreement_score":0.003843807,"about_ca_system_score_codex":0.0012991169,"about_ca_system_score_gemma":0.000377623,"threshold_uncertainty_score":0.012858868},"labels":[],"label_agreement":null},{"id":"W1588334962","doi":"","title":"A comparison of different decision algorithms used in volumetric storm cells classification","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Hydrological Forecasting Using AI","field":"Environmental Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Support vector machine; Computer science; Radar; Algorithm; Rough set; Data set; Statistical classification; Storm; Decision table; Data mining; Decision support system; Artificial intelligence; Machine learning; Decision rule; Set (abstract data type); Training set; Database; Meteorology; Geography","score_opus":0.08031928922161695,"score_gpt":0.30135891453936053,"score_spread":0.22103962531774357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588334962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44492808,0.0059315497,0.5343486,0.0005759192,0.00039585598,0.0008879171,0.0008497301,0.001833185,0.010249135],"genre_scores_gemma":[0.66006917,0.0017366536,0.33519986,0.00012840734,0.00007401466,0.00031530685,0.0009742502,0.00009131505,0.0014109829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936187,0.0027217218,0.00085488346,0.0005427234,0.0019159504,0.00034605913],"domain_scores_gemma":[0.9830341,0.012530282,0.00052245293,0.000786249,0.0029553634,0.00017163505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008314752,0.0009502414,0.0012893204,0.0036775582,0.00064102496,0.0018095545,0.0010953961,0.0010509208,0.0009944404],"category_scores_gemma":[0.02139894,0.00026709877,0.00093383284,0.0030884468,0.00033212453,0.0015625145,0.00052614295,0.0007466243,0.00050178467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018420764,0.000492457,0.011720798,0.0006379982,0.0004162765,0.000102872385,0.00030911583,0.0857806,0.004830444,0.0032679015,0.0018501397,0.8887493],"study_design_scores_gemma":[0.0002836322,0.0024528478,0.014030279,0.00023044032,0.000553238,0.00037424066,0.0009362951,0.9396498,0.028792396,0.004877789,0.007710316,0.000108726344],"about_ca_topic_score_codex":0.0036640132,"about_ca_topic_score_gemma":0.0021898951,"teacher_disagreement_score":0.008314752,"about_ca_system_score_codex":0.0009845551,"about_ca_system_score_gemma":0.0008055473,"threshold_uncertainty_score":0.043973148},"labels":[],"label_agreement":null},{"id":"W1589534114","doi":"10.3233/fun-2006-742-309","title":"Process-Specific Information for Learning Electronic Negotiation Outcomes","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Ottawa; Université Laval","funders":"","keywords":"Process (computing); Computer science; Negotiation; Process management; Artificial intelligence; Knowledge management; Business; Programming language","score_opus":0.008438188234329182,"score_gpt":0.3093537271060896,"score_spread":0.3009155388717604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589534114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13469131,0.00020416753,0.8540338,0.00055942225,0.000076867604,0.0007232219,0.0021244686,0.0016179401,0.005968778],"genre_scores_gemma":[0.76326895,0.00013752143,0.23008984,0.00005635188,0.000083300314,0.0013901026,0.003911963,0.000103766935,0.0009582309],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9941056,0.0023341924,0.00064912834,0.0008634212,0.0017459351,0.00030167442],"domain_scores_gemma":[0.96353245,0.02504915,0.0033487743,0.0031999426,0.00429569,0.0005738863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008254685,0.000922853,0.0006829883,0.0042463127,0.00085389754,0.0023500891,0.0010310713,0.001112733,0.0067841946],"category_scores_gemma":[0.06191612,0.00021991521,0.00091829814,0.0039885086,0.0006732306,0.0050699394,0.0017854924,0.0019658427,0.0010858497],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006090507,0.0011357396,0.050370906,0.00075755024,0.00017139698,0.00030424722,0.0016998737,0.023233864,0.0056977207,0.038442034,0.005162591,0.872415],"study_design_scores_gemma":[0.00020307965,0.0011861369,0.12781252,0.0005366321,0.00032784505,0.0006323422,0.0017211675,0.5241719,0.025837632,0.29771268,0.019638712,0.0002194349],"about_ca_topic_score_codex":0.00070098124,"about_ca_topic_score_gemma":0.0007959385,"teacher_disagreement_score":0.008254685,"about_ca_system_score_codex":0.0010322743,"about_ca_system_score_gemma":0.00091482326,"threshold_uncertainty_score":0.043655515},"labels":[],"label_agreement":null},{"id":"W1591975058","doi":"10.3233/fi-2009-163","title":"Measuring Resemblances Between Swarm Behaviours: A Perceptual Tolerance Near Set Approach","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Swarm behaviour; Set (abstract data type); Perception; Computer science; Artificial intelligence; Communication; Psychology; Mathematics; Cognitive psychology; Neuroscience","score_opus":0.08221212626415805,"score_gpt":0.281956884644228,"score_spread":0.19974475838006997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591975058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29440922,0.00072462077,0.7002751,0.00018268505,0.00005153527,0.00011868445,0.0001745006,0.0002959999,0.0037677144],"genre_scores_gemma":[0.84811425,0.0002449257,0.15077384,0.000053654447,0.0000464628,0.000089413894,0.00019593105,0.000042050007,0.000439344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970746,0.0007486014,0.00030228007,0.00059800537,0.0011511657,0.00012536289],"domain_scores_gemma":[0.9903983,0.004787312,0.0020009882,0.0013993256,0.0009191253,0.00049497007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023722325,0.00045372537,0.00088471174,0.0053815013,0.00076599565,0.0018730859,0.0011001324,0.00090734736,0.0010221555],"category_scores_gemma":[0.018155253,0.00035793654,0.00084149657,0.0022204872,0.0021062463,0.004268149,0.002883881,0.0008761407,0.00024992452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013872954,0.00042187108,0.07690644,0.001074129,0.0006523918,0.0009149625,0.0068146866,0.099022076,0.063362926,0.08749901,0.0015620572,0.66038215],"study_design_scores_gemma":[0.000070101916,0.0019376806,0.15889642,0.00029380474,0.00036844905,0.003368673,0.0047418796,0.49612105,0.028284619,0.29528117,0.010246104,0.000390098],"about_ca_topic_score_codex":0.00082720455,"about_ca_topic_score_gemma":0.00056812627,"teacher_disagreement_score":0.0053815013,"about_ca_system_score_codex":0.0006020809,"about_ca_system_score_gemma":0.00032390893,"threshold_uncertainty_score":0.012545705},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03282598919826751,"score_gpt":0.3414536577833389,"score_spread":0.3086276685850714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596798185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061228545,0.00037497038,0.9974396,0.00017587015,0.000037278696,0.00003618734,0.000013484361,0.000049654733,0.0012606363],"genre_scores_gemma":[0.09192211,0.0013857824,0.90438384,0.0002061504,0.00017584194,0.00032343995,0.00006454555,0.00004045688,0.0014977851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447787,0.0023186568,0.0004314118,0.00050766824,0.0021343098,0.00013012199],"domain_scores_gemma":[0.99392563,0.0044192495,0.00035741055,0.0006305017,0.0006010107,0.00006615807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006860061,0.0010501962,0.001700699,0.00213819,0.0007976457,0.0027136405,0.0014253076,0.0012604244,0.0021004274],"category_scores_gemma":[0.011142417,0.0008189112,0.0026683614,0.0017404567,0.0023405554,0.0022274218,0.0014657562,0.0023358625,0.00044554638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006129074,0.0000634158,0.00043879927,0.00054435106,0.0003112508,0.0002129592,0.00041184324,0.25148952,0.0024325103,0.60796094,0.0016418505,0.13443133],"study_design_scores_gemma":[0.000061938124,0.00014666439,0.00022703568,0.00014369302,0.000106572275,0.00013763031,0.00006964781,0.38990462,0.0022044426,0.5896774,0.017251806,0.000068549125],"about_ca_topic_score_codex":0.0017046559,"about_ca_topic_score_gemma":0.0013510623,"teacher_disagreement_score":0.006860061,"about_ca_system_score_codex":0.0013812555,"about_ca_system_score_gemma":0.001410378,"threshold_uncertainty_score":0.036279917},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Rough set; Computer science; Business; Operations research; Risk analysis (engineering); Mathematics; Data mining","score_opus":0.03345543096663277,"score_gpt":0.266800736715795,"score_spread":0.23334530574916224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604618930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074278295,0.00045492215,0.9157019,0.0010538094,0.00006320333,0.00020446892,0.00071416475,0.00022721272,0.007302052],"genre_scores_gemma":[0.80160433,0.00040361143,0.19423833,0.00010585516,0.000098324424,0.00025466472,0.00069685205,0.00003797308,0.0025600342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996111,0.001748028,0.00027610513,0.000513638,0.0011166764,0.00023463732],"domain_scores_gemma":[0.9924388,0.0045354976,0.0010026889,0.00074748736,0.001058784,0.00021683179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041307695,0.00078528863,0.0018418563,0.0013921591,0.00054200744,0.0025563037,0.0015310694,0.0010731325,0.0030765804],"category_scores_gemma":[0.011113819,0.0005461403,0.0012308154,0.0010550267,0.0011030597,0.002916019,0.000940605,0.0011635011,0.00055497506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033273856,0.00020920378,0.003088236,0.00043416538,0.00023340636,0.0004526919,0.00034166742,0.736938,0.0019649193,0.14280279,0.0050953105,0.10810686],"study_design_scores_gemma":[0.000022925604,0.000084269166,0.00085480703,0.00004180842,0.000035525245,0.000082561186,0.00007797601,0.8609029,0.0008629079,0.13550171,0.0015000263,0.00003250927],"about_ca_topic_score_codex":0.0014687345,"about_ca_topic_score_gemma":0.0021786108,"teacher_disagreement_score":0.0041307695,"about_ca_system_score_codex":0.0014546376,"about_ca_system_score_gemma":0.0013230256,"threshold_uncertainty_score":0.021845818},"labels":[],"label_agreement":null},{"id":"W1627988614","doi":"10.3233/fun-2006-742-305","title":"Rough Relation Algebras Revisited","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Mathematics; Algebra over a field; Pure mathematics; Computer science; Data mining","score_opus":0.010722853358636517,"score_gpt":0.21711359821553658,"score_spread":0.20639074485690007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627988614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091035575,0.037660673,0.6055769,0.013028058,0.0015995424,0.00026382259,0.0009049597,0.0005062846,0.24942413],"genre_scores_gemma":[0.8110623,0.01157184,0.1440811,0.0017758411,0.0019945924,0.00017024044,0.0005298765,0.00007996934,0.028734284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973464,0.0007921394,0.00019721276,0.00037676818,0.0010677002,0.00021973206],"domain_scores_gemma":[0.99760926,0.00090471836,0.00039231637,0.00039610517,0.0004974464,0.00020006073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025723258,0.0005489269,0.0009397119,0.0026160306,0.0022526616,0.0056730164,0.0012663637,0.001413476,0.005528958],"category_scores_gemma":[0.005781406,0.0004834768,0.0014579687,0.0030715098,0.0043624234,0.010341589,0.002221326,0.0032878923,0.0011909776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003404806,0.0000030698086,0.00003098262,0.00001904375,0.000004366424,0.000039571827,0.00011763868,0.00044357736,0.00010179682,0.9965879,0.0004025887,0.002246116],"study_design_scores_gemma":[0.0000031507702,0.000004992143,0.000057129928,0.000017495877,0.0000043787604,0.00006905533,0.000056552995,0.0023643218,0.00007886982,0.989744,0.007592929,0.00000716592],"about_ca_topic_score_codex":0.0026571378,"about_ca_topic_score_gemma":0.0015134426,"teacher_disagreement_score":0.0056730164,"about_ca_system_score_codex":0.0021624074,"about_ca_system_score_gemma":0.0014232649,"threshold_uncertainty_score":0.018496215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11099799002495385,"score_gpt":0.26734217892815526,"score_spread":0.1563441889032014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634497061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004431408,0.0016355292,0.97897905,0.0013336007,0.00008821559,0.00009583688,0.00007656669,0.000081561964,0.013278234],"genre_scores_gemma":[0.39427033,0.004218731,0.5930004,0.00032075855,0.0003673303,0.0007002998,0.00025291924,0.00008216686,0.0067870566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935486,0.0033059649,0.00040731323,0.0006836732,0.0016785152,0.00037594305],"domain_scores_gemma":[0.99266666,0.004732546,0.0009031171,0.0007126997,0.00068605255,0.00029886872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062960414,0.001285382,0.0019350833,0.0047522313,0.001720629,0.006519101,0.003699951,0.0020152836,0.0044263373],"category_scores_gemma":[0.012405655,0.0010657883,0.003505625,0.0037388434,0.006670195,0.0077069034,0.004432035,0.0037584137,0.00062693434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009207431,0.000014060598,0.000137478,0.000089267916,0.00005315886,0.00008218069,0.00043186147,0.058558166,0.00011291659,0.93184596,0.0004925577,0.008173163],"study_design_scores_gemma":[0.000011929779,0.000013835235,0.00009769203,0.000045223565,0.000018974059,0.00004008474,0.00023183464,0.11496865,0.00008704917,0.8795073,0.004952935,0.000024506206],"about_ca_topic_score_codex":0.0043159295,"about_ca_topic_score_gemma":0.0032217996,"teacher_disagreement_score":0.006519101,"about_ca_system_score_codex":0.005027901,"about_ca_system_score_gemma":0.0020285377,"threshold_uncertainty_score":0.03648019},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08471044716938086,"score_gpt":0.27639645030902515,"score_spread":0.1916860031396443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640105340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9339767,0.00042700025,0.064139396,0.00011045845,0.000048611197,0.00006683913,0.00013517514,0.00039115982,0.0007044981],"genre_scores_gemma":[0.94868773,0.00016113804,0.049897183,0.00003467427,0.0000244207,0.00006341949,0.00028419495,0.000052084073,0.0007951062],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880254,0.0003427988,0.00015189548,0.00021047352,0.0003835203,0.00010879723],"domain_scores_gemma":[0.99320954,0.0055344547,0.0003188449,0.00027352764,0.00049061474,0.00017301159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016116189,0.0007538343,0.0012358262,0.00094088016,0.00030290292,0.0006891526,0.00039781615,0.0008008525,0.0012708985],"category_scores_gemma":[0.0064037517,0.00021260438,0.00047165813,0.00074759073,0.00041712107,0.0010929373,0.00048691008,0.0004967466,0.0004744471],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004043676,0.00058583467,0.008177086,0.00080604065,0.00031201873,0.0004269462,0.00073671824,0.033671137,0.49487048,0.00054206845,0.00090275804,0.4549252],"study_design_scores_gemma":[0.00012810624,0.0028251186,0.03336037,0.000032929816,0.00022124095,0.00049273926,0.00069152744,0.7070208,0.25299683,0.0011248365,0.0010259848,0.00007953995],"about_ca_topic_score_codex":0.0008195805,"about_ca_topic_score_gemma":0.00065744127,"teacher_disagreement_score":0.0016116189,"about_ca_system_score_codex":0.00024424447,"about_ca_system_score_gemma":0.00016624395,"threshold_uncertainty_score":0.008523166},"labels":[],"label_agreement":null},{"id":"W1640529447","doi":"10.3233/fi-2015-1181","title":"Communication Complexity of Consensus in Anonymous Message Passing Systems","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Message passing; Uniform consensus; Theoretical computer science; Distributed computing; Computer security; Computer network; Consensus; Artificial intelligence; Multi-agent system","score_opus":0.07983935127487378,"score_gpt":0.287115616522844,"score_spread":0.20727626524797022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640529447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41983092,0.0006982131,0.5611465,0.002957544,0.00012388629,0.00020130929,0.00044592025,0.0006322266,0.013963531],"genre_scores_gemma":[0.9597518,0.0003118332,0.03627025,0.00011796773,0.00011221788,0.00023802629,0.0002692583,0.00010729361,0.002821218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963103,0.0012616684,0.0001890338,0.00053343724,0.0011039686,0.0006015313],"domain_scores_gemma":[0.9665317,0.02874526,0.0016425294,0.0013217024,0.0011766907,0.0005820715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00264551,0.000641332,0.00125784,0.00092170667,0.0013600807,0.0024760375,0.0018841539,0.0015247363,0.0031603815],"category_scores_gemma":[0.02302542,0.0004461558,0.0006496685,0.0012024095,0.0019648045,0.00494125,0.0025027785,0.0017925996,0.0003233921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004219068,0.000101656646,0.0014922629,0.00019372033,0.00006214034,0.00022846392,0.00039427992,0.888037,0.0028171213,0.08699825,0.0019955817,0.017257651],"study_design_scores_gemma":[0.000030921612,0.000026367436,0.00022950029,0.000004924101,0.0000104707415,0.000031873762,0.000049089213,0.9204423,0.00086357474,0.07795021,0.00035035904,0.000010458497],"about_ca_topic_score_codex":0.0028405155,"about_ca_topic_score_gemma":0.0014311369,"teacher_disagreement_score":0.0031603815,"about_ca_system_score_codex":0.0028112666,"about_ca_system_score_gemma":0.0017779742,"threshold_uncertainty_score":0.020397246},"labels":[],"label_agreement":null},{"id":"W1642340034","doi":"10.3233/fun-2001-48404","title":"Non-Clausal Reasoning with Definite Theories","year":2001,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Calculus (dental); Mathematics; Computer science; Epistemology; Algebra over a field; Pure mathematics; Philosophy","score_opus":0.010190278672589034,"score_gpt":0.226365688647173,"score_spread":0.21617540997458395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642340034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008031219,0.0006510681,0.9816554,0.00070869917,0.00012250707,0.00009470387,0.00008412605,0.00060130865,0.008050908],"genre_scores_gemma":[0.24529944,0.0008084663,0.74602616,0.0005267721,0.00021927177,0.00015166885,0.0004460279,0.00013175936,0.006390514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941189,0.0020040665,0.00040073993,0.0007487457,0.0023592694,0.0003681628],"domain_scores_gemma":[0.9946267,0.0031860224,0.00035963036,0.00091589754,0.0007568264,0.00015490522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072431182,0.0009226481,0.0009270029,0.0021731404,0.0017567154,0.0034602913,0.00392075,0.0013548273,0.0044017257],"category_scores_gemma":[0.0097425515,0.0008177738,0.0022784532,0.001351214,0.0039827563,0.0073577277,0.0040400475,0.003310125,0.000839154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035064026,0.00004557511,0.00018570604,0.0001908318,0.000036310565,0.00022209555,0.0003966235,0.00546049,0.0010830356,0.9632146,0.0012070774,0.02792253],"study_design_scores_gemma":[0.00004090814,0.000026570358,0.000090704336,0.000049681545,0.00003747857,0.00016183525,0.00012016602,0.050653327,0.004306484,0.9290176,0.015469308,0.000025956464],"about_ca_topic_score_codex":0.002289784,"about_ca_topic_score_gemma":0.0031109035,"teacher_disagreement_score":0.0072431182,"about_ca_system_score_codex":0.0016645795,"about_ca_system_score_gemma":0.0015720932,"threshold_uncertainty_score":0.0383057},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Pairwise comparison; Mathematics; Calculus (dental); Statistics","score_opus":0.13935402150520276,"score_gpt":0.4196155115520413,"score_spread":0.28026149004683854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664278360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029004256,0.00049399363,0.98822355,0.0007037838,0.00018303556,0.000118177326,0.0001496912,0.000099337965,0.0071279323],"genre_scores_gemma":[0.1401562,0.0010350944,0.85345644,0.0009744773,0.00061639544,0.0012689676,0.0007328259,0.00014523098,0.0016143702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9227293,0.043522716,0.0068707108,0.008961472,0.016370542,0.0015452061],"domain_scores_gemma":[0.88681096,0.08486463,0.0064424817,0.009471732,0.011316541,0.0010937167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.050322887,0.0020571249,0.0021857189,0.005933114,0.0031726796,0.005525498,0.004380273,0.0028375348,0.0055904104],"category_scores_gemma":[0.08904573,0.0011458095,0.0049750675,0.0068621985,0.01233096,0.015913537,0.0071930964,0.011848967,0.001249422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031453954,0.000028795643,0.0003211815,0.00020603619,0.00007033962,0.00008999965,0.0003342791,0.0044655083,0.00046253152,0.9797997,0.0007465336,0.01344347],"study_design_scores_gemma":[0.00002573214,0.00006057024,0.00024399102,0.00010740905,0.000056113866,0.00016919973,0.000090074594,0.016628955,0.0008468596,0.9761705,0.0055460413,0.00005445375],"about_ca_topic_score_codex":0.0016669323,"about_ca_topic_score_gemma":0.0011156194,"teacher_disagreement_score":0.050322887,"about_ca_system_score_codex":0.0037746835,"about_ca_system_score_gemma":0.0032162152,"threshold_uncertainty_score":0.26613605},"labels":[],"label_agreement":null},{"id":"W1664930710","doi":"10.3233/fi-2012-730","title":"Tabular Expressions Operators","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McMaster University","funders":"","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.014461415083229295,"score_gpt":0.22872368086712858,"score_spread":0.21426226578389929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664930710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043994705,0.00091285986,0.95014536,0.0007787672,0.000663989,0.00042432157,0.0026317693,0.0051563433,0.034887195],"genre_scores_gemma":[0.11484251,0.0020234957,0.8388826,0.0016804953,0.00065088976,0.0013774325,0.004612708,0.0036461207,0.03228372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941491,0.001634447,0.00094565,0.0010448745,0.0016153451,0.0006107418],"domain_scores_gemma":[0.9951539,0.0018515754,0.00048548533,0.00081685017,0.0015117509,0.00018055308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044075265,0.0015599739,0.0011623291,0.0019366099,0.0019087836,0.0055891513,0.0024389382,0.0015300922,0.022268457],"category_scores_gemma":[0.009308415,0.00076106144,0.0018913652,0.002892916,0.0029140732,0.009027093,0.003485633,0.0027394472,0.008754963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014784833,0.00003691178,0.00029294638,0.00047644394,0.000036630467,0.00026435076,0.0010295808,0.001834302,0.00477253,0.895205,0.024332538,0.07157083],"study_design_scores_gemma":[0.000063043,0.000062771476,0.00015240244,0.00026291428,0.00006971659,0.0005524635,0.00045698785,0.016443936,0.012838439,0.47168246,0.49731782,0.00009708061],"about_ca_topic_score_codex":0.002043814,"about_ca_topic_score_gemma":0.0015353953,"teacher_disagreement_score":0.022268457,"about_ca_system_score_codex":0.0017865017,"about_ca_system_score_gemma":0.002120532,"threshold_uncertainty_score":0.074495375},"labels":[],"label_agreement":null},{"id":"W1667057730","doi":"10.3233/fi-2012-633","title":"Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Public-key cryptography; Key (lock); Key exchange; Cryptography; Extension (predicate logic); Computer science; Public key cryptosystem; Theoretical computer science; Computer security; Mathematics; Encryption; Programming language","score_opus":0.0386312350513452,"score_gpt":0.23051973436159862,"score_spread":0.19188849931025342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667057730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07907886,0.00872155,0.5748799,0.004243547,0.0018995401,0.00034087256,0.0006877228,0.0012499854,0.32889798],"genre_scores_gemma":[0.8037981,0.0057848925,0.13247254,0.0006345622,0.0008275052,0.00026101607,0.00034078272,0.00024674332,0.055633865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.00010342867,0.000015791644,0.00005851471,0.00023037319,0.00007930611],"domain_scores_gemma":[0.99937326,0.00019369602,0.00007320653,0.0001367737,0.00016922121,0.000053936557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958816,0.00046969633,0.0005085839,0.0011075923,0.0010416936,0.0013241633,0.0005646042,0.0006051055,0.0047553354],"category_scores_gemma":[0.0023275411,0.0002488308,0.00045052962,0.0015753869,0.0020431974,0.0018733026,0.0012845001,0.0020952686,0.0020262597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065423636,0.0000114132445,0.00006233408,0.000060614915,0.000003185027,0.000054921155,0.00007252905,0.0047546714,0.0016330106,0.97316724,0.003154881,0.016959852],"study_design_scores_gemma":[0.000056212968,0.00008342148,0.00020799089,0.000051852632,0.000008136123,0.00023836929,0.000039194056,0.041749433,0.002925324,0.8644271,0.09015358,0.00005935473],"about_ca_topic_score_codex":0.0022827033,"about_ca_topic_score_gemma":0.0019579132,"teacher_disagreement_score":0.0047553354,"about_ca_system_score_codex":0.0016333845,"about_ca_system_score_gemma":0.0017142083,"threshold_uncertainty_score":0.015908241},"labels":[],"label_agreement":null},{"id":"W1673496079","doi":"10.3233/fi-2009-141","title":"Application of Concurrency in the Asynchronous Design of Write-after-read Operations","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Concurrency; Computer science; Asynchronous communication; Programming language; Asynchronous system; Parallel computing; Computer architecture; Computer network; Telecommunications","score_opus":0.009797610377747182,"score_gpt":0.2276488690925133,"score_spread":0.21785125871476613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673496079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052289598,0.00038464472,0.9429561,0.000092614726,0.000047131947,0.00009817597,0.000019665553,0.00047735826,0.0036347276],"genre_scores_gemma":[0.76130855,0.00034555985,0.2358371,0.00006573305,0.00003637398,0.0001240678,0.00003142908,0.00009886775,0.0021522373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918646,0.00025143125,0.00008547015,0.00014044567,0.0002551553,0.00008105142],"domain_scores_gemma":[0.99871397,0.00071833504,0.00012810354,0.00021687319,0.000183656,0.00003904125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011944978,0.00039329412,0.00028892636,0.00043362964,0.0004202564,0.0008898443,0.001015257,0.00023805209,0.001587525],"category_scores_gemma":[0.0023092567,0.0002899424,0.0003017523,0.000291053,0.0006813445,0.0011560775,0.0006525077,0.0006429971,0.00024153912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009126046,0.00017316655,0.0028048104,0.00045798975,0.000067586254,0.0007357855,0.0011311722,0.13896048,0.31079832,0.20939496,0.00075748906,0.33380565],"study_design_scores_gemma":[0.00023060718,0.0010164285,0.0005391759,0.00007353942,0.00013936908,0.00075057964,0.000107216074,0.49593502,0.40847442,0.06755816,0.025101801,0.00007360256],"about_ca_topic_score_codex":0.00053415896,"about_ca_topic_score_gemma":0.00092424947,"teacher_disagreement_score":0.001587525,"about_ca_system_score_codex":0.00040088556,"about_ca_system_score_gemma":0.00065615796,"threshold_uncertainty_score":0.0063171387},"labels":[],"label_agreement":null},{"id":"W1675101798","doi":"10.3233/fi-2014-1112","title":"Reconstructing Words from a σ-palindromic Language","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; Computation; Involution (esoterism); Mathematics; Combinatorics; Computer science; Algebra over a field; Discrete mathematics; Linguistics; Algorithm; Pure mathematics; Philosophy","score_opus":0.005768128546149364,"score_gpt":0.21212812442914294,"score_spread":0.20635999588299359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675101798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2729394,0.00057889015,0.7185153,0.00053402514,0.00013629794,0.00009183867,0.0006262385,0.0019113289,0.004666665],"genre_scores_gemma":[0.53528565,0.00039486328,0.45480317,0.00017907818,0.00010632944,0.00010871922,0.0020620276,0.0006149171,0.0064451424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.00018338903,0.00008227188,0.00027704152,0.0001472141,0.00010874024],"domain_scores_gemma":[0.99591845,0.0025408475,0.00029191293,0.0007732375,0.00034536363,0.00013016678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007788801,0.000763567,0.0007153183,0.0008634449,0.00074036943,0.0017869446,0.0014532434,0.0011242904,0.004099721],"category_scores_gemma":[0.0077408873,0.0007811494,0.0010456687,0.0009344332,0.0013648318,0.0030522905,0.0022853143,0.0014915484,0.001936256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017736485,0.00026342552,0.0054370523,0.001521962,0.00012437989,0.002045614,0.004474351,0.07586628,0.0709906,0.44062522,0.0063791275,0.3904984],"study_design_scores_gemma":[0.000115782066,0.00025918908,0.00042423478,0.00012631253,0.000081269485,0.00064449036,0.00097006164,0.20064156,0.048295114,0.7394015,0.008974513,0.000065906745],"about_ca_topic_score_codex":0.00081722817,"about_ca_topic_score_gemma":0.0013209569,"teacher_disagreement_score":0.004099721,"about_ca_system_score_codex":0.00050960004,"about_ca_system_score_gemma":0.0007596981,"threshold_uncertainty_score":0.013714969},"labels":[],"label_agreement":null},{"id":"W1678022017","doi":"10.3233/fi-2013-914","title":"Treasure Trove at Banacha. Set Patterns in Descriptive Proximity Spaces","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Treasure; Set (abstract data type); Mathematics; Computer science; Geography; Programming language; Archaeology","score_opus":0.026170858186714625,"score_gpt":0.22568712666095997,"score_spread":0.19951626847424533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678022017","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021150598,0.24100147,0.1338231,0.16847032,0.05039067,0.00013750579,0.0021543673,0.0017592676,0.38111278],"genre_scores_gemma":[0.28675172,0.12461841,0.06879306,0.018157393,0.030296037,0.0003907219,0.0017239556,0.0014199169,0.46784884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840695,0.00049945386,0.000095895404,0.0004039046,0.0004866057,0.000107215],"domain_scores_gemma":[0.9981639,0.0007616145,0.00014908565,0.00020371297,0.00040595888,0.00031574076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018258335,0.00074608123,0.0006903536,0.0020632804,0.0018474542,0.004049356,0.0007685843,0.0013613993,0.029857999],"category_scores_gemma":[0.0057261894,0.0003628392,0.00084180414,0.0021842457,0.0027935025,0.010449996,0.0030422083,0.004764163,0.010666788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011661509,0.000048232076,0.0005609623,0.0003937828,0.000032319593,0.00017438649,0.00110401,0.0005565313,0.0010089352,0.6825206,0.15870629,0.15477729],"study_design_scores_gemma":[0.000008193909,0.000053312244,0.0005514022,0.00021549434,0.0000101527985,0.00040463227,0.00033948882,0.0007344356,0.00064577936,0.21224794,0.7847545,0.000034707024],"about_ca_topic_score_codex":0.0015468216,"about_ca_topic_score_gemma":0.0011451511,"teacher_disagreement_score":0.029857999,"about_ca_system_score_codex":0.0022197594,"about_ca_system_score_gemma":0.0011456661,"threshold_uncertainty_score":0.09988493},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012313270662353644,"score_gpt":0.23672250789099755,"score_spread":0.22440923722864392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1682128552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002652671,0.0005630456,0.9835686,0.0014142181,0.00031521317,0.00020246633,0.00067010114,0.0020144624,0.008599229],"genre_scores_gemma":[0.09887301,0.0011004338,0.88573503,0.0011671876,0.00050655927,0.00048477252,0.0017342037,0.0006630214,0.009735723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995812,0.0011024739,0.00050052296,0.00079895515,0.0014823431,0.00030367257],"domain_scores_gemma":[0.989665,0.007042762,0.00039854783,0.0010371297,0.0016055306,0.0002510433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005870749,0.0009556131,0.00094493636,0.002459834,0.002716659,0.004557424,0.002156648,0.001815059,0.015030001],"category_scores_gemma":[0.012302194,0.0012448499,0.0024297752,0.0017705626,0.0027586047,0.008897413,0.0054426375,0.0047006314,0.004051341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004025575,0.000039862527,0.00017163252,0.00033999773,0.000038842645,0.00035628126,0.0004363572,0.0037022948,0.0032858357,0.9303625,0.0113876285,0.0498386],"study_design_scores_gemma":[0.00009595595,0.00004788498,0.00013878962,0.00013801378,0.000089933186,0.00035946525,0.00008612846,0.03618415,0.0067200684,0.8673382,0.08873936,0.00006205688],"about_ca_topic_score_codex":0.0025811105,"about_ca_topic_score_gemma":0.0027366818,"teacher_disagreement_score":0.015030001,"about_ca_system_score_codex":0.0024216268,"about_ca_system_score_gemma":0.003927587,"threshold_uncertainty_score":0.050280333},"labels":[],"label_agreement":null},{"id":"W1684681859","doi":"10.3233/fun-2002-52405","title":"One-Visit Caterpillar Tree Automata","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Caterpillar; Tree (set theory); Automaton; Computer science; Mathematics; Theoretical computer science; Combinatorics; Biology; Botany; Larva","score_opus":0.02570031036777105,"score_gpt":0.21881751186003628,"score_spread":0.19311720149226524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684681859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74871975,0.0005222827,0.22884198,0.0007474664,0.00006954205,0.00015032635,0.00048484514,0.0010901762,0.019373644],"genre_scores_gemma":[0.9681327,0.00018141305,0.02723012,0.000088579916,0.000020187092,0.00008690358,0.00026062637,0.000049030667,0.003950538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941266,0.00009682934,0.000051674484,0.00018508166,0.00009690444,0.00015684086],"domain_scores_gemma":[0.99710685,0.0015104695,0.00034511066,0.0006171796,0.00021418353,0.00020621021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048244488,0.0003111256,0.00050748803,0.00023196844,0.0011070404,0.0011859315,0.0016366333,0.0010753963,0.0031149238],"category_scores_gemma":[0.0024706598,0.00027176258,0.00081869576,0.00048707114,0.0016072462,0.001657598,0.0009634188,0.0008429684,0.0005262756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009148268,0.00033641857,0.011765091,0.0005201209,0.00009395548,0.0021358153,0.0027672008,0.11615944,0.06540803,0.75188416,0.0055174143,0.042497456],"study_design_scores_gemma":[0.0001972362,0.00043275816,0.0021692556,0.000056335364,0.00013347347,0.0019780006,0.00090086483,0.447031,0.030100346,0.50255847,0.01432695,0.00011529683],"about_ca_topic_score_codex":0.0014654868,"about_ca_topic_score_gemma":0.0018722864,"teacher_disagreement_score":0.0031149238,"about_ca_system_score_codex":0.00088684785,"about_ca_system_score_gemma":0.0007479891,"threshold_uncertainty_score":0.010420382},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06935996552841586,"score_gpt":0.2858082205213743,"score_spread":0.21644825499295842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1701036113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014507156,0.0010099657,0.9682823,0.0049204524,0.00015941633,0.00011459104,0.00018984565,0.00010410911,0.010712168],"genre_scores_gemma":[0.5112437,0.0012376062,0.48179618,0.00090737315,0.00042291565,0.000589272,0.0003282468,0.000078766614,0.0033959697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870257,0.005669846,0.0011026833,0.0013900944,0.0042067007,0.00060491014],"domain_scores_gemma":[0.98944163,0.00669838,0.0010799647,0.0012479349,0.0010772054,0.00045487922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01134371,0.00094723806,0.0018761221,0.0029882623,0.0015664278,0.006660604,0.0024109099,0.003727486,0.0020979133],"category_scores_gemma":[0.02226279,0.000994719,0.002413137,0.002400431,0.0070833275,0.012199321,0.0037958152,0.0043583764,0.00045160952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018727807,0.000016265121,0.000110256755,0.000054522785,0.000016062097,0.00007030082,0.000327152,0.0091267,0.0002164575,0.9848701,0.00029161424,0.0048818057],"study_design_scores_gemma":[0.000014235362,0.000020867254,0.00010188745,0.000033518714,0.0000166992,0.000098273464,0.00008298089,0.031076193,0.0002472513,0.965776,0.0025074806,0.00002447011],"about_ca_topic_score_codex":0.00096422515,"about_ca_topic_score_gemma":0.0006573836,"teacher_disagreement_score":0.01134371,"about_ca_system_score_codex":0.0021221482,"about_ca_system_score_gemma":0.0018232032,"threshold_uncertainty_score":0.059991956},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Mathematics; Game theory; Computer science; Mathematical economics; Artificial intelligence","score_opus":0.04029298648701973,"score_gpt":0.23326444428821164,"score_spread":0.1929714578011919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704544815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018268175,0.0012912818,0.9179044,0.0036987888,0.00020968138,0.0001423994,0.0003170409,0.00011906985,0.05804925],"genre_scores_gemma":[0.74122244,0.0024450659,0.24134985,0.0006560309,0.00037496624,0.00044319732,0.00034686908,0.000050158964,0.0131114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995891,0.0020941063,0.00021410505,0.00044863173,0.0010942974,0.00025781972],"domain_scores_gemma":[0.9959818,0.0024668714,0.00032422564,0.00059632765,0.00038982026,0.00024095045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004078742,0.0009461611,0.0013199056,0.0013227944,0.00115605,0.0048919073,0.0018443062,0.0014527265,0.0032548497],"category_scores_gemma":[0.008917471,0.00044293358,0.0016834778,0.0013090451,0.0038991002,0.004940561,0.0022358086,0.0024936632,0.0006042525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045913353,0.0000054988627,0.000039672617,0.000015570313,0.000010625052,0.000014046243,0.00004555651,0.0076552043,0.000058854348,0.9901557,0.00034599577,0.0016486649],"study_design_scores_gemma":[0.0000071992104,0.000012214754,0.00004211786,0.000009298753,0.0000067605556,0.000018504388,0.000029287645,0.03223677,0.000042128904,0.9648142,0.0027751725,0.00000642757],"about_ca_topic_score_codex":0.0018387003,"about_ca_topic_score_gemma":0.0014326655,"teacher_disagreement_score":0.0048919073,"about_ca_system_score_codex":0.002262629,"about_ca_system_score_gemma":0.0013187734,"threshold_uncertainty_score":0.021570742},"labels":[],"label_agreement":null},{"id":"W1705435008","doi":"10.3233/fi-2010-286","title":"Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint (computer-aided design); Loop (graph theory); Aggregate (composite); Mathematics; Computer science; Algebra over a field; Algorithm; Theoretical computer science; Pure mathematics; Combinatorics; Geometry; Materials science","score_opus":0.06131650265581724,"score_gpt":0.2707485198897412,"score_spread":0.20943201723392396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1705435008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1062785,0.00011206725,0.8799995,0.0006051326,0.00004059206,0.00014244812,0.00033349046,0.0008001073,0.011688044],"genre_scores_gemma":[0.72627145,0.00019104377,0.26624817,0.00045653133,0.00008968604,0.00035004123,0.00070525514,0.00026707773,0.00542079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814963,0.00036211617,0.00014234593,0.0003052281,0.0008150952,0.00022568011],"domain_scores_gemma":[0.9954521,0.0029402038,0.0003675202,0.00035912936,0.000767332,0.00011373818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015916321,0.00047728754,0.0003774918,0.0014616289,0.00057616184,0.0021445784,0.0011482615,0.0008771506,0.0046624774],"category_scores_gemma":[0.00787722,0.00028989208,0.0012022428,0.0010863453,0.0018176576,0.0058531784,0.0017641716,0.0020623165,0.00040720534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006881207,0.000088724606,0.0011782277,0.00012452157,0.000021769312,0.00020038229,0.000652797,0.010316587,0.0048611285,0.9443048,0.0011330753,0.0370492],"study_design_scores_gemma":[0.000029120129,0.00006288491,0.00036634487,0.000027921751,0.000043517703,0.00016790688,0.00020680176,0.11989746,0.009060268,0.8658452,0.0042688292,0.000023769357],"about_ca_topic_score_codex":0.0011725147,"about_ca_topic_score_gemma":0.001366589,"teacher_disagreement_score":0.0046624774,"about_ca_system_score_codex":0.0016884129,"about_ca_system_score_gemma":0.00093664904,"threshold_uncertainty_score":0.015597582},"labels":[],"label_agreement":null},{"id":"W1722516136","doi":"10.3233/fi-2010-287","title":"Computing Maximal Error-detecting Capabilities and Distances of Regular Languages","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Programming language; Theoretical computer science","score_opus":0.007556075071810087,"score_gpt":0.24278347386891294,"score_spread":0.23522739879710286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722516136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60407615,0.00019350777,0.38885424,0.00023346725,0.00002299221,0.00007962307,0.00053549797,0.0010409773,0.004963609],"genre_scores_gemma":[0.9134512,0.0000823888,0.085260704,0.0000321018,0.00002469972,0.000072204675,0.00033857548,0.000110722336,0.00062747946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961274,0.0009881514,0.00052094454,0.0010703006,0.000870924,0.000422301],"domain_scores_gemma":[0.9645523,0.026862739,0.0029930768,0.0028777993,0.001523129,0.0011911225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028995713,0.00086541224,0.0009077006,0.0026304927,0.00070400466,0.0030609842,0.0012821119,0.0008458412,0.0018504716],"category_scores_gemma":[0.023899127,0.0007303349,0.0013300717,0.0011830999,0.004035706,0.007222434,0.0032750708,0.0015858337,0.00030175343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016666864,0.0002334942,0.018302193,0.0009525013,0.0002533694,0.0006101016,0.003507293,0.23801649,0.039907113,0.59952015,0.00093652686,0.09609404],"study_design_scores_gemma":[0.00008245089,0.00027332603,0.002749788,0.000089474685,0.00012303403,0.00044344718,0.0007871693,0.25765166,0.060201913,0.6749262,0.0025094885,0.00016200983],"about_ca_topic_score_codex":0.0006671803,"about_ca_topic_score_gemma":0.0005496109,"teacher_disagreement_score":0.0030609842,"about_ca_system_score_codex":0.0011755236,"about_ca_system_score_gemma":0.0010009578,"threshold_uncertainty_score":0.015334606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03820724143386406,"score_gpt":0.3166172499363737,"score_spread":0.27841000850250963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1724114674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018285572,0.00053057517,0.99394625,0.0001670005,0.00008537225,0.00004165436,0.00003001759,0.00009806458,0.003272553],"genre_scores_gemma":[0.1336618,0.0023121436,0.8588326,0.00022978244,0.00024361991,0.00020902265,0.00018160428,0.00007396294,0.004255439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981042,0.0006103444,0.00019788052,0.0002930118,0.0006945746,0.00009989915],"domain_scores_gemma":[0.9983291,0.0010488416,0.00013322996,0.00011580553,0.0003235937,0.000049438448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030553176,0.0012875937,0.0010936793,0.0018851686,0.0010341741,0.0026119594,0.0014666693,0.0012207191,0.004112184],"category_scores_gemma":[0.0050758407,0.0004949433,0.0020717592,0.0024180182,0.0024786238,0.0046795565,0.0015966903,0.0023101654,0.0010711413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010673761,0.000053391534,0.00017503856,0.00030083433,0.00008469108,0.00033035022,0.00049844827,0.12254745,0.004067568,0.7925141,0.0014018965,0.07791945],"study_design_scores_gemma":[0.0000319343,0.000057807578,0.00007254332,0.000076243006,0.000038160768,0.00015088775,0.000062728584,0.41845593,0.0027616008,0.5661968,0.012043613,0.00005174494],"about_ca_topic_score_codex":0.006168825,"about_ca_topic_score_gemma":0.00453016,"teacher_disagreement_score":0.006168825,"about_ca_system_score_codex":0.0019465516,"about_ca_system_score_gemma":0.0011270908,"threshold_uncertainty_score":0.016158283},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021936662549670697,"score_gpt":0.23984099126626743,"score_spread":0.21790432871659673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1725028495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1637185,0.008221031,0.7725074,0.0041320184,0.0005272608,0.00030407886,0.00097633066,0.0006357681,0.048977524],"genre_scores_gemma":[0.8196768,0.0023499678,0.1734005,0.00040030206,0.00038272567,0.00014506721,0.0006340404,0.00011133449,0.0028992284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98898685,0.0049527823,0.00043854074,0.0012473613,0.003970394,0.00040401114],"domain_scores_gemma":[0.9674127,0.020266073,0.002737499,0.0042601833,0.0048673837,0.0004561963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007892869,0.0007329048,0.0011685464,0.0073118433,0.0012950746,0.0058903787,0.00082087336,0.0012721828,0.003204848],"category_scores_gemma":[0.07463644,0.0005052562,0.0006896697,0.008041551,0.003285688,0.0034738735,0.003296097,0.0014162875,0.0011692033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039328038,0.00011068978,0.03857959,0.00085926265,0.00056867825,0.00045640187,0.0033950645,0.08607597,0.0033146695,0.65206045,0.008066201,0.20611976],"study_design_scores_gemma":[0.000021904149,0.00011769891,0.032999177,0.0002771722,0.00012833072,0.0006394576,0.0024838778,0.1286469,0.0025311643,0.8110255,0.020957587,0.000171214],"about_ca_topic_score_codex":0.0024662756,"about_ca_topic_score_gemma":0.002048273,"teacher_disagreement_score":0.007892869,"about_ca_system_score_codex":0.0014362829,"about_ca_system_score_gemma":0.0012721156,"threshold_uncertainty_score":0.041741967},"labels":[],"label_agreement":null},{"id":"W1734841232","doi":"10.3233/fi-2012-621","title":"Unambiguous Functions in Logarithmic Space","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Logarithm; Space (punctuation); Mathematics; Computer science; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.06794524300788368,"score_gpt":0.324892316653019,"score_spread":0.2569470736451353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734841232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2981485,0.0014641829,0.6232652,0.0023009516,0.00020580905,0.00007648218,0.00022648777,0.0005389485,0.0737734],"genre_scores_gemma":[0.94828343,0.00048337615,0.039577935,0.00017810657,0.00014258624,0.00008511924,0.00010729431,0.00011937968,0.01102282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877065,0.00034326632,0.000057761416,0.00024732633,0.0004032495,0.00017774808],"domain_scores_gemma":[0.9969555,0.0020862452,0.00021594779,0.00035764842,0.00022842285,0.000156282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011450425,0.00072054344,0.000596598,0.0013286542,0.0013308453,0.0024041347,0.0010933673,0.0009346941,0.007203875],"category_scores_gemma":[0.007331675,0.00026494396,0.000780253,0.0013105097,0.003608215,0.007006512,0.0025754855,0.0023642809,0.0009834011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033609685,0.00001652527,0.00019605753,0.00005149057,0.0000054161146,0.000060262504,0.00014184865,0.006402589,0.0008791458,0.98473996,0.00032265595,0.007150415],"study_design_scores_gemma":[0.0000051606175,0.00001155167,0.00006469979,0.0000069302446,0.0000037955238,0.000034907218,0.000027817616,0.015917081,0.0012782644,0.98119754,0.0014462128,0.000006122105],"about_ca_topic_score_codex":0.0005291205,"about_ca_topic_score_gemma":0.00038861454,"teacher_disagreement_score":0.007203875,"about_ca_system_score_codex":0.0014940589,"about_ca_system_score_gemma":0.00056723185,"threshold_uncertainty_score":0.02409935},"labels":[],"label_agreement":null},{"id":"W1738746856","doi":"","title":"Results on Transforming NFA into DFCA","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Mathematics; Finite-state machine; Upper and lower bounds; Discrete mathematics; Combinatorics; Nondeterministic algorithm; Nested word; ω-automaton; Quantum finite automata; DFA minimization; Conjecture; Cover (algebra); Automaton; State (computer science); Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.011932914249501422,"score_gpt":0.2410837567690871,"score_spread":0.22915084251958567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738746856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06435646,0.0016740375,0.87646747,0.0017874142,0.00022308198,0.00017416377,0.00044427224,0.0012445257,0.053628597],"genre_scores_gemma":[0.7003008,0.0025147337,0.2793192,0.0015181608,0.000535193,0.0005223525,0.0016065747,0.0007421737,0.012940648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508095,0.0007752868,0.00043864135,0.0012617344,0.001937597,0.00050582364],"domain_scores_gemma":[0.977344,0.017081963,0.00061941723,0.0033026608,0.0013661791,0.00028588317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024108398,0.00075036444,0.0009263195,0.0012961655,0.0015693092,0.0024613882,0.0015404292,0.0014508663,0.009630677],"category_scores_gemma":[0.016991481,0.00057723554,0.0026958429,0.0015666725,0.002678591,0.007900531,0.0021514609,0.00421218,0.0014302833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017859534,0.00024266758,0.0014981139,0.0009152845,0.00007412556,0.00027394271,0.0008566773,0.037415605,0.015362455,0.83630323,0.0027157208,0.10416366],"study_design_scores_gemma":[0.000033282326,0.00010456786,0.00076239347,0.0001093713,0.00007663981,0.0004281341,0.0001278624,0.064192414,0.012102029,0.898911,0.023117501,0.000034792207],"about_ca_topic_score_codex":0.0018083086,"about_ca_topic_score_gemma":0.0010703147,"teacher_disagreement_score":0.009630677,"about_ca_system_score_codex":0.0022890195,"about_ca_system_score_gemma":0.0009990147,"threshold_uncertainty_score":0.03221786},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise comparison; Ranking (information retrieval); Computer science; Mathematics; Data mining; Statistics; Algorithm; Artificial intelligence","score_opus":0.1813216940829353,"score_gpt":0.43770189737751825,"score_spread":0.25638020329458294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762037976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028768664,0.00015827731,0.9947009,0.000102476675,0.00005576339,0.00014009187,0.00010931278,0.00011462613,0.0017417364],"genre_scores_gemma":[0.08421701,0.0002921208,0.9119893,0.00008331041,0.000086085565,0.00064206263,0.0006339588,0.00008396158,0.0019722115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9652352,0.021882905,0.0016837635,0.002270533,0.008369464,0.00055816094],"domain_scores_gemma":[0.96737623,0.022093277,0.001581872,0.0034173878,0.0050004716,0.0005306785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014889728,0.0013822457,0.00201168,0.0049124355,0.0015032851,0.0038798612,0.0025453158,0.0009143541,0.0054996787],"category_scores_gemma":[0.049932506,0.0006005567,0.0022470518,0.004951316,0.0029109698,0.0049283835,0.0037700708,0.0033671933,0.0018928626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023969376,0.000158957,0.0016017263,0.0011105308,0.00025264177,0.00022576771,0.0007714238,0.040870797,0.006179597,0.59185576,0.0040237913,0.35270932],"study_design_scores_gemma":[0.000040281884,0.0005234341,0.0016227897,0.0001690471,0.000080390506,0.00029970732,0.00030189176,0.20618744,0.005226966,0.7719028,0.013528949,0.000116301664],"about_ca_topic_score_codex":0.0007043593,"about_ca_topic_score_gemma":0.0012164244,"teacher_disagreement_score":0.014889728,"about_ca_system_score_codex":0.0015701058,"about_ca_system_score_gemma":0.003172007,"threshold_uncertainty_score":0.078745365},"labels":[],"label_agreement":null},{"id":"W1764315815","doi":"10.3233/fun-2002-52403","title":"On Modal and Fuzzy Decision Logics Based on Rough Set Theory","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Modal; Fuzzy set; Dominance-based rough set approach; T-norm fuzzy logics; Mathematics; Fuzzy logic; Normal modal logic; Computer science; Set theory; Modal logic; Set (abstract data type); Artificial intelligence; Algebra over a field; Fuzzy set operations; Pure mathematics; Programming language","score_opus":0.02869129953860263,"score_gpt":0.23975822923722853,"score_spread":0.2110669296986259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764315815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004016235,0.011750482,0.9392241,0.002769645,0.0006078987,0.0001716072,0.00027757676,0.00024613287,0.04093637],"genre_scores_gemma":[0.24897794,0.018950908,0.7101395,0.0024299647,0.0023968532,0.0008002138,0.0006935147,0.0000994533,0.015511637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956173,0.001611917,0.00030908483,0.00045583607,0.0017250043,0.00028089568],"domain_scores_gemma":[0.9970861,0.0018548246,0.00025358153,0.00027763814,0.00040557317,0.00012239082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004744578,0.00126217,0.0014892955,0.0034113263,0.0013384949,0.005486422,0.0020247628,0.0019696092,0.0042409166],"category_scores_gemma":[0.0071495688,0.0006461032,0.0022696317,0.0045499606,0.004431402,0.0075510317,0.0026902796,0.0033402864,0.0010155003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025005127,0.000023382368,0.00007511607,0.00013698419,0.000031579704,0.00013505942,0.00018576572,0.010269045,0.00028738967,0.96540135,0.0019855301,0.021443747],"study_design_scores_gemma":[0.000014782982,0.0000194249,0.00007043494,0.00008025142,0.000020565658,0.0000884812,0.000044976114,0.023628552,0.00020587294,0.96380734,0.011992903,0.000026414336],"about_ca_topic_score_codex":0.0020110453,"about_ca_topic_score_gemma":0.0016483488,"teacher_disagreement_score":0.005486422,"about_ca_system_score_codex":0.002267884,"about_ca_system_score_gemma":0.0016642928,"threshold_uncertainty_score":0.025092006},"labels":[],"label_agreement":null},{"id":"W1792817236","doi":"10.3233/fun-2006-71406","title":"On Problems in Polymorphic Object-Oriented Languages With Self Types and Matching","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Programming language; Object (grammar); Matching (statistics); Object-oriented programming; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.004100339476644207,"score_gpt":0.20584280747812744,"score_spread":0.20174246800148324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792817236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024916843,0.012526739,0.9196927,0.021579426,0.0006554174,0.00020992747,0.00012119478,0.00072692876,0.019570846],"genre_scores_gemma":[0.36262634,0.02050577,0.57092834,0.00794048,0.0055832486,0.0010076036,0.00052983797,0.0017690664,0.029109392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9750249,0.011133152,0.0022755943,0.003198793,0.0071425824,0.001225042],"domain_scores_gemma":[0.92755616,0.059029624,0.0031294075,0.006489319,0.0030753717,0.00072014827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023902964,0.0014179156,0.0024531272,0.003359328,0.0049480726,0.0090863295,0.004050064,0.009101876,0.005160441],"category_scores_gemma":[0.06331109,0.002123711,0.0030476637,0.008786602,0.015309034,0.042015463,0.009892276,0.009503907,0.0013502763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005620234,0.000051970834,0.00044904472,0.00022875915,0.000024206975,0.00035913213,0.0012040767,0.005116057,0.0002918336,0.95395404,0.0037338957,0.03453085],"study_design_scores_gemma":[0.000020313484,0.000020426272,0.00013219578,0.0000977467,0.000014491236,0.0005657199,0.00023436545,0.011602241,0.00047099288,0.97573674,0.011072181,0.00003241405],"about_ca_topic_score_codex":0.002940761,"about_ca_topic_score_gemma":0.0013225306,"teacher_disagreement_score":0.023902964,"about_ca_system_score_codex":0.0040063867,"about_ca_system_score_gemma":0.0025400973,"threshold_uncertainty_score":0.12641251},"labels":[],"label_agreement":null},{"id":"W1795337728","doi":"10.3233/fi-2013-788","title":"Crisp and Fuzzy Topological Interior and Closure Operators with Inclusion Degree. Theory and Applications","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Closure (psychology); Degree (music); Mathematics; Fuzzy logic; Inclusion (mineral); Topology (electrical circuits); Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Physics; Artificial intelligence; Economics","score_opus":0.03822743626251569,"score_gpt":0.32070455568522177,"score_spread":0.2824771194227061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795337728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02823764,0.0051892595,0.9341631,0.0011190345,0.00051578437,0.00005642603,0.00015746999,0.00015441922,0.030406846],"genre_scores_gemma":[0.5731261,0.004629981,0.40480724,0.0005381718,0.0012330347,0.00021922674,0.0002464668,0.00009985157,0.015100041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975866,0.000689956,0.0001984649,0.00043860203,0.00095408305,0.00013229491],"domain_scores_gemma":[0.99709475,0.001351711,0.00047183462,0.00038167686,0.00047493112,0.00022496675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028492592,0.0007599971,0.0007568384,0.002275324,0.0010488095,0.0033641895,0.0008670415,0.0011950755,0.0026896964],"category_scores_gemma":[0.00719481,0.00040677312,0.0013014618,0.0020930723,0.0052463417,0.0058071995,0.0025489877,0.0024472368,0.0004980355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034939843,0.000024967881,0.00027709172,0.00014073885,0.000024450821,0.0001779272,0.0003764862,0.006939576,0.0024193819,0.9582266,0.0013350995,0.030022701],"study_design_scores_gemma":[0.000015811602,0.00007790801,0.0006641065,0.000088111185,0.000029204668,0.00078947225,0.00024420212,0.0560558,0.0019216009,0.91662055,0.023445701,0.000047490008],"about_ca_topic_score_codex":0.0006738526,"about_ca_topic_score_gemma":0.00043055072,"teacher_disagreement_score":0.0033641895,"about_ca_system_score_codex":0.0012566814,"about_ca_system_score_gemma":0.0007535301,"threshold_uncertainty_score":0.015068531},"labels":[],"label_agreement":null},{"id":"W1796922279","doi":"10.3233/fi-2011-592","title":"Algebraic Framework for the Specification and Analysis of Cryptographic-Key Distribution","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptography; Key (lock); Computer science; Theoretical computer science; Algebraic number; Key distribution; Cryptographic protocol; Distribution (mathematics); Mathematics; Public-key cryptography; Algorithm; Encryption; Computer security","score_opus":0.04044709570393733,"score_gpt":0.2580575956302242,"score_spread":0.21761049992628684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796922279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048481533,0.00082847144,0.97845185,0.0008158536,0.000087657834,0.00007966424,0.0001831279,0.00009431347,0.014610949],"genre_scores_gemma":[0.40890285,0.003910477,0.5729586,0.00055641955,0.0006492517,0.0007475653,0.00079018023,0.0001281306,0.011356456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531955,0.0020187902,0.00040247437,0.00046413665,0.0014011209,0.00039389284],"domain_scores_gemma":[0.9957747,0.0021257445,0.0005186355,0.00058721035,0.0008201096,0.00017357292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005849176,0.0011098984,0.001007048,0.0023247413,0.0020327922,0.004505162,0.002337718,0.0021494105,0.0057214783],"category_scores_gemma":[0.008126692,0.00058868394,0.0022165088,0.002926032,0.005796088,0.0071326173,0.0029562425,0.0043264376,0.0012620703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027675778,0.0000067180576,0.000032669817,0.000020230691,0.0000043464734,0.000027045206,0.00005432488,0.002750117,0.000109721695,0.9956482,0.00017861297,0.0011651833],"study_design_scores_gemma":[0.000015169453,0.00002357859,0.00007028299,0.000031526764,0.000010418547,0.00006923897,0.00007648838,0.029358637,0.00030754608,0.9589276,0.011094248,0.000015268613],"about_ca_topic_score_codex":0.0027408518,"about_ca_topic_score_gemma":0.0017035933,"teacher_disagreement_score":0.005849176,"about_ca_system_score_codex":0.004021714,"about_ca_system_score_gemma":0.0023860864,"threshold_uncertainty_score":0.030933797},"labels":[],"label_agreement":null},{"id":"W1797796873","doi":"","title":"Special Issueon Application of Concurrency to System Design","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Concurrency; Computer science; Programming language","score_opus":0.015129233455650938,"score_gpt":0.25199024415237925,"score_spread":0.23686101069672832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797796873","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042586406,0.06419814,0.09687867,0.030395808,0.6751767,0.000292255,0.00053430145,0.0009783488,0.1272872],"genre_scores_gemma":[0.03418603,0.054690618,0.0205948,0.004250752,0.59571135,0.0002846831,0.0013194531,0.0011422809,0.28781998],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681795,0.00074530684,0.00029649114,0.00061715493,0.001303821,0.00021927367],"domain_scores_gemma":[0.99147123,0.0044020587,0.00030694238,0.0010614299,0.0019759876,0.00078239926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037259422,0.001972621,0.0025822707,0.0022350387,0.0016519623,0.006095135,0.0019091844,0.0023253108,0.076785535],"category_scores_gemma":[0.008196969,0.0008238197,0.0014959759,0.002697341,0.0018466971,0.0040222583,0.0020054595,0.0041637286,0.011486856],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002113327,0.00016481728,0.00066484645,0.0016639893,0.00012389486,0.00037066455,0.00020597682,0.002146604,0.0016496266,0.065237254,0.7317673,0.1957938],"study_design_scores_gemma":[0.000042983174,0.0001448027,0.00078210805,0.0003375645,0.00006327506,0.0006745286,0.00007016011,0.0037756898,0.00095145503,0.040933587,0.95219505,0.00002882937],"about_ca_topic_score_codex":0.00085940416,"about_ca_topic_score_gemma":0.0017444604,"teacher_disagreement_score":0.076785535,"about_ca_system_score_codex":0.0018707205,"about_ca_system_score_gemma":0.0013493064,"threshold_uncertainty_score":0.2568732},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043228175001902375,"score_gpt":0.27945411912867,"score_spread":0.23622594412676765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800174300","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055491608,0.00080443715,0.9884934,0.0013587474,0.00009601165,0.00013585898,0.00015876755,0.00014043816,0.0032632786],"genre_scores_gemma":[0.16559602,0.002180829,0.82688,0.0005377496,0.00048373695,0.00061625254,0.00046263836,0.00012315868,0.003119703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926547,0.0030218984,0.00091871613,0.0008780357,0.0022033022,0.00032341937],"domain_scores_gemma":[0.9875974,0.004911228,0.0006919561,0.005247691,0.0011255345,0.00042629484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008271027,0.0007039902,0.0013713496,0.0043666363,0.0018863649,0.006316543,0.003609002,0.0027625877,0.004232819],"category_scores_gemma":[0.024285525,0.00064031914,0.0016739157,0.0080155,0.0060935295,0.017938543,0.007531328,0.0033840116,0.0017959458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028259794,0.000019364725,0.00015086708,0.00006261852,0.000009112839,0.00004163292,0.0001671342,0.003119667,0.00087108,0.9767411,0.0009711415,0.017818004],"study_design_scores_gemma":[0.00002484996,0.00007192872,0.00011479628,0.0000334211,0.000009489726,0.00022640232,0.00008187207,0.043803193,0.001106126,0.9419493,0.012551581,0.000026954267],"about_ca_topic_score_codex":0.00091020524,"about_ca_topic_score_gemma":0.00047680555,"teacher_disagreement_score":0.008271027,"about_ca_system_score_codex":0.0021256285,"about_ca_system_score_gemma":0.0013394776,"threshold_uncertainty_score":0.04374188},"labels":[],"label_agreement":null},{"id":"W1801211801","doi":"","title":"Fast Data Compression with Antidictionaries","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Compression (physics); Computer science; Data compression; De Bruijn sequence; Algorithm; Overhead (engineering); Quadratic equation; Data compression ratio; Compressibility; Upper and lower bounds; Theoretical computer science; Mathematics; Discrete mathematics; Image compression; Artificial intelligence; Geometry; Mathematical analysis; Physics","score_opus":0.026892456964286292,"score_gpt":0.2527401879142297,"score_spread":0.2258477309499434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801211801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035489,0.0012459102,0.9511959,0.0011903789,0.00032022258,0.00016239328,0.0005793496,0.003670239,0.0061466433],"genre_scores_gemma":[0.23201239,0.0007904535,0.7557002,0.0006346066,0.000301768,0.0003914731,0.0016766137,0.00086939824,0.007623109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792516,0.00037573223,0.00022069903,0.00050079165,0.0007631793,0.0002145037],"domain_scores_gemma":[0.99355304,0.0031819306,0.00031463645,0.0021300912,0.000734865,0.00008554479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735874,0.0009805388,0.00090574555,0.0017017866,0.0010298893,0.0018975837,0.0019227646,0.0015583697,0.007092694],"category_scores_gemma":[0.008102007,0.0005494109,0.00083373307,0.002572157,0.0020141285,0.0061658965,0.0038125848,0.0024257426,0.0027827993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011401381,0.00021211502,0.0015878404,0.0006875607,0.00008301578,0.00044504294,0.0006413308,0.041270442,0.057654828,0.18870598,0.014198138,0.6933736],"study_design_scores_gemma":[0.00018315043,0.00039811613,0.0008599456,0.00014949132,0.00006919587,0.0013694539,0.0002854786,0.49023917,0.16864452,0.29919386,0.03847718,0.00013048553],"about_ca_topic_score_codex":0.0009617071,"about_ca_topic_score_gemma":0.001376119,"teacher_disagreement_score":0.007092694,"about_ca_system_score_codex":0.0006999079,"about_ca_system_score_gemma":0.0008956476,"threshold_uncertainty_score":0.023727417},"labels":[],"label_agreement":null},{"id":"W1802373871","doi":"","title":"Computing Properties of Numerical Imperative Programs by Symbolic Computation","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Symbolic computation; Maple; Symbolic-numeric computation; Computation; Computer science; Symbolic trajectory evaluation; The Symbolic; Theoretical computer science; Class (philosophy); Symbolic data analysis; Programming language; Algebra over a field; Mathematics; Artificial intelligence; Model checking; Pure mathematics","score_opus":0.0352984035358526,"score_gpt":0.24824464905590682,"score_spread":0.21294624552005423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802373871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04384945,0.000110427216,0.9508807,0.00019016024,0.000026202313,0.000024329414,0.00009948553,0.00088965177,0.003929526],"genre_scores_gemma":[0.68680114,0.00038017821,0.31089145,0.00008333141,0.00006849884,0.00015563681,0.00024140594,0.00032669122,0.001051732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987224,0.00033976752,0.00008968706,0.00017352286,0.0005387594,0.00013596722],"domain_scores_gemma":[0.9953784,0.0032369732,0.00028999068,0.0007315152,0.00029283817,0.00007030757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012776192,0.0006069584,0.0006411475,0.0012892792,0.0008172737,0.0026728485,0.0010663312,0.000595813,0.0028992086],"category_scores_gemma":[0.009421468,0.00035721133,0.0009085715,0.0011637777,0.002679748,0.0048284293,0.0016651968,0.0014229733,0.00051534106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000972809,0.000061229555,0.0010995647,0.00018281111,0.00003237652,0.00019788304,0.00047078342,0.07948886,0.008853849,0.87181264,0.0007456111,0.036957115],"study_design_scores_gemma":[0.000016057427,0.00003987862,0.00018270785,0.000024777783,0.000024112755,0.00008173515,0.00006878505,0.3389486,0.012320996,0.64574033,0.0025330079,0.000018974464],"about_ca_topic_score_codex":0.00064137054,"about_ca_topic_score_gemma":0.00061930006,"teacher_disagreement_score":0.0028992086,"about_ca_system_score_codex":0.0007131844,"about_ca_system_score_gemma":0.0006530866,"threshold_uncertainty_score":0.009698808},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02745331881619353,"score_gpt":0.25385051435091227,"score_spread":0.22639719553471874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808687169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031267975,0.0011200802,0.9568617,0.0014593506,0.000104281404,0.00009995226,0.00020716437,0.000081050406,0.008798552],"genre_scores_gemma":[0.70736545,0.0017424833,0.2829448,0.0003143774,0.00031172417,0.00031831182,0.0002115907,0.000050969637,0.0067402874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99170965,0.0034611765,0.0004613703,0.0010999979,0.0025805754,0.0006871953],"domain_scores_gemma":[0.9744071,0.019801537,0.0024380602,0.001169903,0.0015197524,0.00066372997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013112851,0.001202783,0.0016273638,0.0051826327,0.0014567351,0.00590495,0.0024471134,0.0019539553,0.008615148],"category_scores_gemma":[0.030092416,0.0007663662,0.003173858,0.0036541978,0.0038860838,0.010275112,0.0029912912,0.0032949771,0.0006985572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094993964,0.000052332627,0.0021016046,0.00019614457,0.00019531223,0.0002693569,0.0004779055,0.14978166,0.0008045309,0.8121749,0.00073155045,0.033119638],"study_design_scores_gemma":[0.0000099986855,0.000044944143,0.0009448784,0.00007224087,0.000065827335,0.00010938247,0.00012033299,0.3812584,0.00026708934,0.61577487,0.0012868439,0.000045236942],"about_ca_topic_score_codex":0.0028023738,"about_ca_topic_score_gemma":0.0022756865,"teacher_disagreement_score":0.013112851,"about_ca_system_score_codex":0.0024345464,"about_ca_system_score_gemma":0.001854848,"threshold_uncertainty_score":0.069348276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Concordia University","funders":"","keywords":"Path (computing); Computer science; Theoretical computer science; Mathematics; Programming language","score_opus":0.021314384049354696,"score_gpt":0.20625042352430084,"score_spread":0.18493603947494613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812036194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022053597,0.00042158508,0.96704626,0.0008878092,0.00010433768,0.00027337685,0.0009895598,0.0010931415,0.0071303435],"genre_scores_gemma":[0.35915107,0.0009139389,0.62532866,0.0013053926,0.00030333243,0.0006057512,0.002921184,0.00058535254,0.008885223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98495966,0.004911719,0.0016960221,0.0028352768,0.004645127,0.00095217914],"domain_scores_gemma":[0.97701216,0.011677545,0.0013565948,0.0055380594,0.0037882237,0.00062734867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008802709,0.0008634038,0.0012613565,0.0019666792,0.0014606968,0.0038624443,0.0027282462,0.0015059357,0.005668126],"category_scores_gemma":[0.030331122,0.00063455745,0.0013587136,0.0042115306,0.002783849,0.017815148,0.004108735,0.0024285677,0.001250715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030557546,0.00009092991,0.0015002843,0.0003378485,0.00005862501,0.0004588162,0.0012979911,0.0117783435,0.004391636,0.88070476,0.0066417735,0.092433475],"study_design_scores_gemma":[0.00004328638,0.00013954705,0.0002799067,0.000057899175,0.0000723218,0.0007514618,0.0005455532,0.07194947,0.0060114334,0.87639695,0.043673698,0.00007839512],"about_ca_topic_score_codex":0.0024827337,"about_ca_topic_score_gemma":0.0021442233,"teacher_disagreement_score":0.008802709,"about_ca_system_score_codex":0.0014075086,"about_ca_system_score_gemma":0.0018386338,"threshold_uncertainty_score":0.04655373},"labels":[],"label_agreement":null},{"id":"W1816937868","doi":"10.3233/fun-2005-67404","title":"First and Second Order Recursion on Abstract Data Types","year":2005,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Recursion (computer science); Order (exchange); Computer science; Mathematics; Algorithm; Business","score_opus":0.03276109681091978,"score_gpt":0.27124038571001485,"score_spread":0.2384792888990951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816937868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17374855,0.0019948252,0.76191115,0.0020799455,0.00033517147,0.00011007508,0.00041931093,0.0012879326,0.058113005],"genre_scores_gemma":[0.8971018,0.0006826622,0.08689367,0.0003434177,0.0001555925,0.0001451405,0.00029555452,0.0002080174,0.014174056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598855,0.0010115383,0.00028462367,0.0006078739,0.0015809629,0.0005265076],"domain_scores_gemma":[0.99401796,0.0025883892,0.0004575391,0.0019682453,0.0007282894,0.0002396626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029742888,0.00043674553,0.00077226403,0.0014921338,0.0014352245,0.005673133,0.0014115127,0.001807345,0.0054367785],"category_scores_gemma":[0.009269432,0.00044218768,0.0018425673,0.0012341929,0.0048181936,0.012305393,0.00270815,0.0025571075,0.00063615665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018890547,0.000004665013,0.0002744419,0.000022565275,0.0000039190845,0.000014612163,0.00020438578,0.0012289307,0.00037497378,0.9952329,0.0001857018,0.0024341221],"study_design_scores_gemma":[0.00002574542,0.00004927295,0.00044254397,0.00004719226,0.000023668217,0.0001589193,0.00014051772,0.031697493,0.0026141813,0.953602,0.011167454,0.000031130545],"about_ca_topic_score_codex":0.0029091004,"about_ca_topic_score_gemma":0.0020495758,"teacher_disagreement_score":0.005673133,"about_ca_system_score_codex":0.0028623543,"about_ca_system_score_gemma":0.0027133308,"threshold_uncertainty_score":0.020767868},"labels":[],"label_agreement":null},{"id":"W1834309530","doi":"10.3233/fi-2000-423402","title":"Reliable Minimum Finding Comparator Networks","year":2000,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Control Systems and Identification","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Comparator; Computer science; Mathematics; Engineering; Electrical engineering; Voltage","score_opus":0.009881448112048892,"score_gpt":0.20512270130865146,"score_spread":0.19524125319660257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834309530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19747254,0.00085461175,0.7915983,0.00058344664,0.00006917003,0.00011240239,0.00047159832,0.0011114855,0.007726354],"genre_scores_gemma":[0.7465534,0.00048482465,0.24821632,0.00015332352,0.00004124369,0.00013169264,0.0005135193,0.000092449125,0.0038132556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945,0.000120773344,0.000038596365,0.00014988531,0.00015084608,0.00008988269],"domain_scores_gemma":[0.9973966,0.0012956625,0.00040051123,0.0004589419,0.0003334444,0.00011488066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070928165,0.00038431847,0.000534184,0.00072581554,0.0005941242,0.00084006606,0.0014880869,0.00092832063,0.004376681],"category_scores_gemma":[0.0055913986,0.00042175115,0.00045985746,0.00090319506,0.000741889,0.0032073855,0.001202941,0.0008634498,0.00058193994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087169546,0.00013602374,0.0042218617,0.0011744334,0.00012829728,0.0008618077,0.0006730977,0.48413426,0.08363703,0.18740913,0.004337268,0.23241505],"study_design_scores_gemma":[0.000067146386,0.00047783068,0.0010911726,0.00010214736,0.000085905944,0.00056273496,0.00022612598,0.73892605,0.041064158,0.20371765,0.013628282,0.00005073016],"about_ca_topic_score_codex":0.0005548119,"about_ca_topic_score_gemma":0.000788071,"teacher_disagreement_score":0.004376681,"about_ca_system_score_codex":0.00073216733,"about_ca_system_score_gemma":0.00052837236,"threshold_uncertainty_score":0.014641464},"labels":[],"label_agreement":null},{"id":"W1839542112","doi":"10.3233/fi-2015-1178","title":"Privacy Issues in SOAP Message Exchange Pattern for Social Services","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"SOAP; Computer science; Internet privacy; Computer security; World Wide Web; Business","score_opus":0.03228870856109244,"score_gpt":0.29522224168799954,"score_spread":0.2629335331269071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839542112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031308785,0.0017207074,0.92082345,0.012595738,0.00034221253,0.00032776702,0.0004229175,0.0009239782,0.03153439],"genre_scores_gemma":[0.70101297,0.0027549977,0.27385545,0.0023432872,0.00040700927,0.00096361095,0.00070421543,0.00033808415,0.017620394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9832345,0.0077137756,0.0013693605,0.001589483,0.0051003885,0.0009924417],"domain_scores_gemma":[0.9885888,0.006132877,0.00120186,0.002205424,0.0016850516,0.00018606774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011327155,0.0005814409,0.0008554127,0.0016849315,0.0030479494,0.0052674315,0.0013049713,0.0033024927,0.00212712],"category_scores_gemma":[0.03032782,0.00078936905,0.001746603,0.003506218,0.0031999059,0.012178353,0.002504166,0.003355644,0.0009256446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052909516,0.000029317831,0.0007730524,0.0000972422,0.000022343469,0.00036895694,0.0006440273,0.0070918887,0.0009867926,0.9679515,0.002957295,0.019024702],"study_design_scores_gemma":[0.00003294472,0.000052181647,0.0005333015,0.000104991566,0.00004306249,0.00084279425,0.00036477682,0.10055805,0.0035140954,0.84345335,0.05045224,0.00004819639],"about_ca_topic_score_codex":0.005226295,"about_ca_topic_score_gemma":0.0030498004,"teacher_disagreement_score":0.011327155,"about_ca_system_score_codex":0.0036774254,"about_ca_system_score_gemma":0.0041662185,"threshold_uncertainty_score":0.059904456},"labels":[],"label_agreement":null},{"id":"W1849765400","doi":"10.3233/fun-2001-48106","title":"Computability in Type-2 Objects with Well-Behaved Type-1 Oracles is p-Normal","year":2001,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computability; Type (biology); Computer science; Programming language; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01929553382772611,"score_gpt":0.2530119135057787,"score_spread":0.23371637967805256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849765400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3456221,0.00067291595,0.6206215,0.002169058,0.0003636525,0.00017780905,0.0010309905,0.0034075342,0.025934478],"genre_scores_gemma":[0.9213076,0.0004776265,0.068866566,0.00042328882,0.00043152302,0.00027854712,0.00078312925,0.00060223613,0.006829415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921187,0.0010157767,0.0008940613,0.002298158,0.002153224,0.0015199448],"domain_scores_gemma":[0.9722845,0.013858903,0.0025473046,0.0076800194,0.0023026108,0.0013267878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044135796,0.0011886598,0.0015360211,0.001818157,0.0016553213,0.009088262,0.0026380634,0.0022489983,0.0036258693],"category_scores_gemma":[0.019512752,0.0011424707,0.0026146763,0.0021185027,0.011073905,0.020905241,0.0067975703,0.004970752,0.0010315984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043496222,0.00011970432,0.008906901,0.00028172947,0.00006915274,0.0010580852,0.0015741499,0.0063860873,0.005273562,0.95261663,0.001574177,0.02170486],"study_design_scores_gemma":[0.000024715753,0.00006634083,0.0006607822,0.000029390178,0.00004001278,0.00080890156,0.00013353273,0.013979732,0.007360695,0.97305894,0.0037886375,0.00004830828],"about_ca_topic_score_codex":0.0010307094,"about_ca_topic_score_gemma":0.00061264774,"teacher_disagreement_score":0.009088262,"about_ca_system_score_codex":0.0018897301,"about_ca_system_score_gemma":0.0016909353,"threshold_uncertainty_score":0.023341477},"labels":[],"label_agreement":null},{"id":"W1850727751","doi":"10.5555/2365896.2365913","title":"Optimization in Discovery of Compound Granules","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Rough set; Granular computing; Function approximation; Mathematics; Approximation algorithm; Approximation error; Context (archaeology); Set (abstract data type); Approximation theory; Function (biology); Computer science; Algorithm; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.0231939788722258,"score_gpt":0.22674385509676617,"score_spread":0.20354987622454038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850727751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043976016,0.00092581264,0.95099694,0.00063214765,0.000042274096,0.000096655145,0.0001091018,0.00014792927,0.0030731813],"genre_scores_gemma":[0.41009158,0.0009921961,0.5853213,0.00015000047,0.00006004258,0.0002586687,0.00032708625,0.000131308,0.0026677998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967362,0.0009747053,0.00032061548,0.0008051521,0.00088762876,0.0002757562],"domain_scores_gemma":[0.99344915,0.004292942,0.0007534096,0.0006275998,0.0006820042,0.00019480786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053033507,0.0008896264,0.0023358292,0.0017587953,0.0008268121,0.0039584385,0.0015954883,0.0013559633,0.001973284],"category_scores_gemma":[0.015544245,0.0007094814,0.0018666639,0.001890367,0.0020902269,0.004873264,0.0032203163,0.0014293614,0.00023383755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034565062,0.0000955952,0.002979952,0.00055913307,0.00024816304,0.00041661825,0.0005462543,0.39658073,0.005920309,0.49510077,0.0020602033,0.095146574],"study_design_scores_gemma":[0.000026133604,0.00008227394,0.00042843245,0.000053769487,0.000049490012,0.00008062178,0.00011906005,0.73940045,0.0027273074,0.25435305,0.0026522072,0.000027230344],"about_ca_topic_score_codex":0.0014833474,"about_ca_topic_score_gemma":0.0011716618,"teacher_disagreement_score":0.0053033507,"about_ca_system_score_codex":0.0023837993,"about_ca_system_score_gemma":0.0016011099,"threshold_uncertainty_score":0.028047144},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Open research; Theoretical computer science; Algorithm; World Wide Web","score_opus":0.0496346177391194,"score_gpt":0.2940333217176931,"score_spread":0.2443987039785737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851724702","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038250953,0.38766456,0.37144297,0.060393933,0.0034972103,0.0001511382,0.0011552714,0.0009325596,0.13651146],"genre_scores_gemma":[0.4711224,0.37324157,0.10008897,0.0064622937,0.027550964,0.00047889366,0.0026574,0.0006830101,0.017714372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956448,0.00090563874,0.00032102058,0.0010288003,0.0016036787,0.00049614144],"domain_scores_gemma":[0.96244544,0.03133046,0.0011446658,0.0017569001,0.0024793707,0.0008432051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055169524,0.001687893,0.0026142125,0.004842647,0.0025598162,0.007068794,0.0034647093,0.0035615258,0.009507283],"category_scores_gemma":[0.023627652,0.0010002047,0.0020802033,0.009255154,0.0071230773,0.026580658,0.0043616593,0.010247156,0.0020436156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013457946,0.00014729188,0.000872334,0.001772893,0.00008644808,0.000111583904,0.00031053627,0.0105337575,0.00032533263,0.8408335,0.0145776225,0.13029417],"study_design_scores_gemma":[0.000013070117,0.000028214927,0.00031662462,0.0001647118,0.00003054636,0.00011001793,0.00012992886,0.013650584,0.0002974436,0.96316475,0.022069434,0.000024617104],"about_ca_topic_score_codex":0.0019560242,"about_ca_topic_score_gemma":0.0010601812,"teacher_disagreement_score":0.009507283,"about_ca_system_score_codex":0.0045702313,"about_ca_system_score_gemma":0.0021099418,"threshold_uncertainty_score":0.033159494},"labels":[],"label_agreement":null},{"id":"W1860684177","doi":"10.3233/fi-2009-127","title":"A Two-Phase Model for Learning Rules from Incomplete Data","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Phase (matter); Artificial intelligence; Data mining; Physics","score_opus":0.099284281999071,"score_gpt":0.34305224838339093,"score_spread":0.24376796638431994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860684177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011443289,0.000076133605,0.9979594,0.00011432681,0.000015677262,0.00012327654,0.00007076806,0.0001324173,0.00036376706],"genre_scores_gemma":[0.068268225,0.00030224636,0.92795074,0.00014817496,0.00007675437,0.0009355787,0.00064201816,0.00005275552,0.0016234966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878157,0.0051094596,0.0011156973,0.0022812954,0.0032532462,0.0004245119],"domain_scores_gemma":[0.9729973,0.019729244,0.0014693913,0.0024991052,0.0028861812,0.00041875013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010978889,0.0015092856,0.0024460114,0.0027306771,0.0009037714,0.003675286,0.00632676,0.002346431,0.0045714853],"category_scores_gemma":[0.026865851,0.0016447854,0.0028200438,0.0033388552,0.0022290228,0.0067149317,0.0026618796,0.0042168675,0.0016666641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035066027,0.0004718749,0.0019346713,0.00089647505,0.0004017628,0.00081398303,0.0010501194,0.5159011,0.0032361879,0.1935158,0.0038255965,0.27760178],"study_design_scores_gemma":[0.00004627978,0.00011081558,0.00015788946,0.000041270458,0.00005256218,0.0001688803,0.00004159006,0.90307677,0.0011840271,0.09264468,0.0024310013,0.000044172182],"about_ca_topic_score_codex":0.0034105254,"about_ca_topic_score_gemma":0.0040577147,"teacher_disagreement_score":0.010978889,"about_ca_system_score_codex":0.0013732604,"about_ca_system_score_gemma":0.002309551,"threshold_uncertainty_score":0.058062613},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004837685138154746,"score_gpt":0.2442605870385754,"score_spread":0.23942290190042065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874539085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054040696,0.007928671,0.95242435,0.0073769027,0.00052412215,0.000100819336,0.0003709108,0.0003898115,0.025480337],"genre_scores_gemma":[0.3058834,0.008121106,0.67130953,0.0028785036,0.0015343238,0.00060328946,0.0009194773,0.00036475126,0.008385596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970822,0.0012280253,0.0002872148,0.0004826298,0.00074455515,0.00017548433],"domain_scores_gemma":[0.9954425,0.0030334215,0.00035626444,0.0004911917,0.00053641037,0.00014021932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043230234,0.0009213366,0.00083503895,0.0023724062,0.0019883579,0.0039851307,0.0016108694,0.0017699214,0.003719031],"category_scores_gemma":[0.008445123,0.00066121045,0.0019968506,0.0015419049,0.013469663,0.011664225,0.0028022819,0.0039660186,0.0008315357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025946572,0.0000028216193,0.000023651055,0.000028250783,0.0000025635945,0.000029732817,0.00019895162,0.00055578555,0.00013581768,0.9958209,0.00037736996,0.0028215267],"study_design_scores_gemma":[0.0000066839266,0.000007339045,0.00003171379,0.00004040827,0.0000053151825,0.00007957092,0.000048963255,0.0017170265,0.0001437423,0.9802806,0.017629674,0.000009007194],"about_ca_topic_score_codex":0.00213157,"about_ca_topic_score_gemma":0.0011045802,"teacher_disagreement_score":0.0043230234,"about_ca_system_score_codex":0.002054552,"about_ca_system_score_gemma":0.002815352,"threshold_uncertainty_score":0.022862613},"labels":[],"label_agreement":null},{"id":"W1893780431","doi":"10.3233/fi-2000-42103","title":"Models For Dependable Computation with Multiple Inputs and Some Hardness Results","year":2000,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Computer science; Algorithm; Theoretical computer science","score_opus":0.02064399726817953,"score_gpt":0.24811833279753814,"score_spread":0.2274743355293586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893780431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04728313,0.0019661807,0.9127112,0.0053612753,0.00013900016,0.0002032683,0.0008794399,0.00034950738,0.031107066],"genre_scores_gemma":[0.8363093,0.0040054214,0.1356103,0.0014119671,0.0007760137,0.000932679,0.0015822974,0.00024589497,0.019126114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.0004727429,0.00009570634,0.0003586384,0.00060288835,0.00030625972],"domain_scores_gemma":[0.99449265,0.0040653218,0.00047435262,0.0005000458,0.00023460132,0.00023302573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045942,0.0013370394,0.001383178,0.0009369432,0.0011790685,0.0024850671,0.0026320056,0.0027614974,0.006722607],"category_scores_gemma":[0.0065987115,0.00077075866,0.002255291,0.0015524058,0.0025375674,0.005666793,0.0023029242,0.003850865,0.0005373299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006678872,0.00010069515,0.0002971108,0.00024073043,0.000055023527,0.00029627708,0.00020309228,0.23417084,0.0008245328,0.751618,0.0038190333,0.008307771],"study_design_scores_gemma":[0.000031023785,0.000025391631,0.0001003507,0.000024012335,0.000017424172,0.000100859004,0.000042694297,0.24400169,0.00031888144,0.75211483,0.0032102407,0.00001268874],"about_ca_topic_score_codex":0.0022779992,"about_ca_topic_score_gemma":0.0019468756,"teacher_disagreement_score":0.006722607,"about_ca_system_score_codex":0.002116817,"about_ca_system_score_gemma":0.0010850246,"threshold_uncertainty_score":0.02248931},"labels":[],"label_agreement":null},{"id":"W1933655552","doi":"","title":"Contextual Grammars with Uniform Sets of Trajectories","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Rule-based machine translation; Tree-adjoining grammar; Alphabet; Context-sensitive grammar; Context-free grammar; Set (abstract data type); Indexed grammar; Context (archaeology); Generative grammar; Computer science; Stochastic context-free grammar; L-attributed grammar; Mathematics; Grammar; Phrase structure grammar; Embedded pushdown automaton; Artificial intelligence; Combinatorics; Linguistics; Programming language","score_opus":0.012009057617999959,"score_gpt":0.23743093247552435,"score_spread":0.2254218748575244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933655552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765057,0.0004956051,0.693113,0.0006389711,0.000084687104,0.00008117325,0.0008374175,0.0019198856,0.02632348],"genre_scores_gemma":[0.8670172,0.00025028083,0.12631921,0.00019446401,0.00007413508,0.00012371145,0.0006918045,0.00030187963,0.0050273724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772733,0.0005375063,0.00017774235,0.00082160224,0.0004131148,0.0003227664],"domain_scores_gemma":[0.99488884,0.002202987,0.00038610765,0.0016435535,0.000570875,0.00030762466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013350778,0.0004930043,0.0005459012,0.000807619,0.001105821,0.0014355226,0.00096180197,0.000652393,0.003181502],"category_scores_gemma":[0.0068843546,0.0005396488,0.0009390402,0.00094786106,0.0036653727,0.0031403017,0.0028871023,0.0010688799,0.0005360485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009605251,0.000023452367,0.0013581419,0.00007912495,0.000025122188,0.0002744338,0.00042045297,0.022292735,0.0063619297,0.946954,0.00091688347,0.021197585],"study_design_scores_gemma":[0.000034508736,0.000047675087,0.00086668576,0.000040792427,0.00005869468,0.00030941959,0.00012771552,0.0894513,0.008816754,0.8889467,0.011248156,0.000051618423],"about_ca_topic_score_codex":0.0025838518,"about_ca_topic_score_gemma":0.0027037258,"teacher_disagreement_score":0.003181502,"about_ca_system_score_codex":0.0010484712,"about_ca_system_score_gemma":0.00111313,"threshold_uncertainty_score":0.010643125},"labels":[],"label_agreement":null},{"id":"W1943597037","doi":"10.3233/fi-2012-670","title":"State Complexity of Combined Operations with Union, Intersection, Star and Reversal","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); State (computer science); Regular language; Mathematics; Combined operations; Computer science; Discrete mathematics; Combinatorics; Algorithm; Theoretical computer science; Automaton; Political science; Engineering","score_opus":0.019345864440645868,"score_gpt":0.23070205014580658,"score_spread":0.2113561857051607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943597037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7881254,0.00052978954,0.19549927,0.00086620275,0.00008048707,0.0002271623,0.0010482722,0.0012985868,0.01232491],"genre_scores_gemma":[0.967839,0.00017663525,0.027958972,0.0000564411,0.00004402165,0.00020404227,0.0006895289,0.0002098884,0.002821393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947831,0.0008570055,0.00049951824,0.0010292685,0.001496053,0.0013349908],"domain_scores_gemma":[0.96838164,0.023212492,0.0021035876,0.0037484416,0.0015570255,0.0009968508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023116318,0.0007715461,0.0012470227,0.0012601118,0.0015032013,0.005902084,0.0023981335,0.0013873734,0.01241292],"category_scores_gemma":[0.017311333,0.00062571926,0.0018225219,0.0016187053,0.0028826196,0.01338684,0.003428007,0.0028533484,0.0009158764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006700809,0.0011275461,0.019275365,0.0013752229,0.0003906779,0.000991241,0.0020095776,0.30473685,0.04558984,0.49098474,0.005417406,0.1214007],"study_design_scores_gemma":[0.00017425035,0.00058201887,0.0024589223,0.0000668406,0.0003056378,0.0004343148,0.00072146306,0.7066734,0.042449597,0.24234731,0.0036343553,0.00015189749],"about_ca_topic_score_codex":0.003115294,"about_ca_topic_score_gemma":0.0032783349,"teacher_disagreement_score":0.01241292,"about_ca_system_score_codex":0.0027371738,"about_ca_system_score_gemma":0.0036333029,"threshold_uncertainty_score":0.041525304},"labels":[],"label_agreement":null},{"id":"W1945757731","doi":"10.3233/fi-2013-871","title":"Decomposition of Relations and Concept Lattices","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Decomposition; Computer science; Theoretical computer science; Mathematics; Algebra over a field; Pure mathematics; Chemistry","score_opus":0.012461757959239815,"score_gpt":0.2571450207368841,"score_spread":0.2446832627776443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945757731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07051831,0.0043923105,0.84535897,0.0014333172,0.00031565758,0.00014126264,0.0005583049,0.00037686678,0.076905005],"genre_scores_gemma":[0.5681134,0.0017073186,0.40842524,0.00035510704,0.00028623675,0.00023706924,0.0010632633,0.00012582597,0.019686578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983652,0.0004628604,0.00011400446,0.0003580889,0.0005061659,0.00019360014],"domain_scores_gemma":[0.99909127,0.00024776653,0.000117090654,0.00018198366,0.00020838619,0.00015346002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015843766,0.0006387834,0.0004224255,0.0017791342,0.0009937453,0.0031738288,0.00068663555,0.0005658689,0.0048255385],"category_scores_gemma":[0.0018414397,0.00039004572,0.0010016933,0.0014444847,0.0034689114,0.0049981093,0.0024145572,0.0018183404,0.00091483985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104646415,0.000007741202,0.00006115972,0.000027728818,0.000003952447,0.000037915477,0.00031672395,0.00064520485,0.00060250476,0.99411786,0.00034080804,0.0038279642],"study_design_scores_gemma":[0.000009561324,0.000020150066,0.00014177825,0.000025500389,0.000006158413,0.00016495856,0.00021037302,0.0059902696,0.0006729972,0.97101957,0.02172973,0.000009061419],"about_ca_topic_score_codex":0.0014830282,"about_ca_topic_score_gemma":0.0011412753,"teacher_disagreement_score":0.0048255385,"about_ca_system_score_codex":0.0018070311,"about_ca_system_score_gemma":0.00088860263,"threshold_uncertainty_score":0.016143024},"labels":[],"label_agreement":null},{"id":"W1946205157","doi":"10.3233/fun-2008-83405","title":"A Relation-Algebraic Theory of Bisimulations","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Algebraic theory; Mathematics; Algebraic number; Algebra over a field; Computer science; Pure mathematics","score_opus":0.0531799845477055,"score_gpt":0.28035470639325566,"score_spread":0.22717472184555015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946205157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008479187,0.0016407372,0.9534953,0.0012485702,0.00029211445,0.00006503549,0.00012757302,0.00024558514,0.034405876],"genre_scores_gemma":[0.55270714,0.0041355398,0.42300475,0.0013887376,0.0014487458,0.0005365561,0.00060183083,0.00027186493,0.015904883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962937,0.00092979573,0.00027697132,0.000771469,0.0014194549,0.00030853122],"domain_scores_gemma":[0.997542,0.0010412215,0.00022533654,0.0004826013,0.0005090101,0.00019988477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031115455,0.0008702679,0.0008269969,0.0024717976,0.0023225038,0.0046727317,0.0020017847,0.0014353901,0.0058887904],"category_scores_gemma":[0.0041225725,0.0005668827,0.002072253,0.002361809,0.008153159,0.011818371,0.003763032,0.004949874,0.0013077155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025488876,0.000004141761,0.000017239081,0.000017604523,0.000002896383,0.000015245169,0.000064241016,0.00049012835,0.00016724401,0.9978021,0.00011639759,0.0013002463],"study_design_scores_gemma":[0.000008767125,0.000020566633,0.00004352682,0.000022957396,0.000011653319,0.00007442156,0.00006716878,0.005784248,0.00056883757,0.9774884,0.015897494,0.000011925449],"about_ca_topic_score_codex":0.0012918618,"about_ca_topic_score_gemma":0.0008437049,"teacher_disagreement_score":0.0058887904,"about_ca_system_score_codex":0.0028101262,"about_ca_system_score_gemma":0.0013281779,"threshold_uncertainty_score":0.02038896},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03307718618616286,"score_gpt":0.2549486071848239,"score_spread":0.22187142099866108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952406403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005919097,0.0017011676,0.9059964,0.006529739,0.00042196168,0.000094351846,0.00019249353,0.000275673,0.078869194],"genre_scores_gemma":[0.3385433,0.0035514033,0.63047016,0.0028513814,0.00089957076,0.0006107372,0.00069650734,0.0004432737,0.021933647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942275,0.002478765,0.00039953843,0.000670931,0.0018503388,0.0003729055],"domain_scores_gemma":[0.9960471,0.0016254593,0.00027098143,0.0009914471,0.0008146016,0.00025050744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063994713,0.00064499455,0.0009908029,0.0027054069,0.0030706981,0.006947275,0.0024391226,0.002989308,0.0042108707],"category_scores_gemma":[0.007562318,0.00084471045,0.002389726,0.0022452008,0.014459896,0.017756797,0.0054486804,0.0069780913,0.0010205057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002302656,0.0000040357218,0.000029375136,0.000012553189,0.0000022403535,0.000012861655,0.00027144657,0.00048002278,0.000058248308,0.9972819,0.0002929648,0.001552014],"study_design_scores_gemma":[0.0000048757556,0.000005287442,0.000059849204,0.000027886746,0.000004442908,0.000036194084,0.0002200129,0.004880843,0.000105414154,0.95822287,0.036425155,0.000007102475],"about_ca_topic_score_codex":0.0051687043,"about_ca_topic_score_gemma":0.002840059,"teacher_disagreement_score":0.006947275,"about_ca_system_score_codex":0.0047730156,"about_ca_system_score_gemma":0.0032340242,"threshold_uncertainty_score":0.034630835},"labels":[],"label_agreement":null},{"id":"W1955944964","doi":"10.3233/fi-2011-609","title":"On Three Alternative Characterizations of Combined Traces","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Computer science","score_opus":0.07303667729737182,"score_gpt":0.2743309215394803,"score_spread":0.20129424424210848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955944964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05539265,0.0026490595,0.82350445,0.0029235145,0.0004561403,0.00021223564,0.00041881268,0.00050016434,0.11394298],"genre_scores_gemma":[0.80540144,0.002415522,0.15692696,0.0015034442,0.0011179294,0.0005324893,0.0008956929,0.0004991837,0.03070734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930521,0.0016534758,0.0005631374,0.0015956146,0.0021215463,0.0010141487],"domain_scores_gemma":[0.9828126,0.006376565,0.0014596295,0.004045292,0.003909287,0.0013966656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049050543,0.0015232837,0.001102369,0.004968335,0.0021437216,0.009357556,0.004071174,0.0037635237,0.012173273],"category_scores_gemma":[0.021947537,0.0006283841,0.0020912823,0.005940411,0.009998781,0.020140566,0.008163767,0.0052210046,0.001812085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047869074,0.000022651442,0.00046616886,0.00004746631,0.000015310094,0.00013376011,0.00053102995,0.0009484815,0.0004334262,0.9897681,0.0006594593,0.0069262274],"study_design_scores_gemma":[0.000033101103,0.00008696711,0.00042977452,0.00012658854,0.000042053667,0.00030320423,0.0006818105,0.016016515,0.0012269974,0.9617226,0.019275399,0.00005495015],"about_ca_topic_score_codex":0.001725593,"about_ca_topic_score_gemma":0.0014292294,"teacher_disagreement_score":0.012173273,"about_ca_system_score_codex":0.002198872,"about_ca_system_score_gemma":0.0015282729,"threshold_uncertainty_score":0.04072362},"labels":[],"label_agreement":null},{"id":"W1993088316","doi":"","title":"A Multi-modal Logic for Disagreement and Exhaustiveness","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Rough set; Disjoint sets; Modal; Modal logic; Mathematics; Representation theorem; Representation (politics); Complementarity (molecular biology); Set (abstract data type); Binary relation; Computer science; Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.042004840766848205,"score_gpt":0.30455674365340313,"score_spread":0.26255190288655494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993088316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02678416,0.00092010724,0.9167218,0.0024697336,0.00019814051,0.00013896696,0.00038568248,0.0002910114,0.052090358],"genre_scores_gemma":[0.64542335,0.0005966244,0.3433321,0.0010363453,0.00030649855,0.00034374231,0.00046628158,0.000069526155,0.00842554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643445,0.0012184427,0.00034587263,0.00071864267,0.0010294587,0.0002530265],"domain_scores_gemma":[0.9973506,0.0015499998,0.00020332601,0.00028802647,0.0004630961,0.00014497225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920004,0.00049509143,0.0006540085,0.0024109844,0.0029481046,0.003516765,0.0013328082,0.0011598676,0.0037450255],"category_scores_gemma":[0.0060237017,0.00045127966,0.0015498298,0.0023478118,0.0052273683,0.009866235,0.0048742425,0.0033308545,0.00042694432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016777838,0.000009474789,0.00007706876,0.000043345724,0.000007695276,0.00009432924,0.0006605961,0.0008511366,0.0004099457,0.9909559,0.00054411625,0.0063296417],"study_design_scores_gemma":[0.000015788235,0.000016001955,0.00011857845,0.000035634246,0.000019818206,0.00013954072,0.00022826446,0.011654275,0.00077238405,0.97778237,0.009196585,0.000020795087],"about_ca_topic_score_codex":0.0019455539,"about_ca_topic_score_gemma":0.0014364449,"teacher_disagreement_score":0.003920004,"about_ca_system_score_codex":0.002653042,"about_ca_system_score_gemma":0.0013371719,"threshold_uncertainty_score":0.02073121},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0559662170445804,"score_gpt":0.2406667216710299,"score_spread":0.1847005046264495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040106564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2642093,0.00033173084,0.7028442,0.0005290448,0.00026958485,0.00015085441,0.0004877093,0.0015152886,0.029662332],"genre_scores_gemma":[0.9272954,0.00014703324,0.06472909,0.00012840414,0.00007225268,0.000128275,0.00044367052,0.0002747304,0.0067812097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980081,0.0004474587,0.0001883425,0.00038633007,0.0006674737,0.00030236228],"domain_scores_gemma":[0.99684036,0.0014301876,0.0002863103,0.0008795603,0.00037267973,0.0001909571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009127363,0.00056537834,0.00056783773,0.0008796305,0.00092095387,0.003235671,0.0012719557,0.0010523238,0.007859406],"category_scores_gemma":[0.0050798105,0.00041409262,0.0018641859,0.0008096529,0.0021914335,0.0064493245,0.0020223535,0.0020430293,0.00097038684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007092432,0.00005498406,0.0002704506,0.000057591646,0.000021200569,0.0003792359,0.00040813544,0.02349182,0.0048296587,0.9608497,0.0006208898,0.008945449],"study_design_scores_gemma":[0.000019555511,0.000037876565,0.00012822745,0.000014212507,0.00001861725,0.00010136073,0.00008485741,0.08878688,0.0050176918,0.9036835,0.002083731,0.000023475097],"about_ca_topic_score_codex":0.00085837947,"about_ca_topic_score_gemma":0.00095960376,"teacher_disagreement_score":0.007859406,"about_ca_system_score_codex":0.001093043,"about_ca_system_score_gemma":0.00059219694,"threshold_uncertainty_score":0.026292324},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Theoretical computer science; Computer science; Mathematics","score_opus":0.04110850759150856,"score_gpt":0.2683393531769816,"score_spread":0.22723084558547305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098103684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60337377,0.0020310672,0.32938626,0.013579686,0.0002477202,0.0006140762,0.0045745578,0.0020873973,0.044105362],"genre_scores_gemma":[0.86266357,0.0011152297,0.12167932,0.00082289113,0.00017355659,0.00043057694,0.003185841,0.00037942422,0.009549538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976031,0.00071153,0.00016442875,0.00055346824,0.00041281997,0.00055463705],"domain_scores_gemma":[0.9766402,0.020194864,0.00090341456,0.00095540425,0.00055587257,0.0007501214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020313968,0.0010310325,0.002298392,0.00077639654,0.0016549606,0.0039811432,0.0028916262,0.0028787942,0.012372347],"category_scores_gemma":[0.016549118,0.00085011317,0.0018840582,0.0015136985,0.001532102,0.0054826224,0.003318989,0.0022762627,0.0010703711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019341966,0.0004873217,0.0068753823,0.0015034921,0.00042563528,0.0009621541,0.0010003517,0.821115,0.006664199,0.07353232,0.01899524,0.066504605],"study_design_scores_gemma":[0.00028008563,0.00011766091,0.0010542455,0.000051289233,0.000118459175,0.00032804997,0.00035310414,0.86470777,0.0013375087,0.1294527,0.0021675609,0.000031563744],"about_ca_topic_score_codex":0.007975309,"about_ca_topic_score_gemma":0.0053453827,"teacher_disagreement_score":0.012372347,"about_ca_system_score_codex":0.002252966,"about_ca_system_score_gemma":0.0026614354,"threshold_uncertainty_score":0.041389644},"labels":[],"label_agreement":null},{"id":"W2099682898","doi":"10.3233/fi-2009-206","title":"Complex Algebras of Arithmetic","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council","keywords":"Arithmetic; Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.024349699551559478,"score_gpt":0.26463244573006833,"score_spread":0.24028274617850887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099682898","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061157316,0.027741343,0.37194553,0.007872173,0.0013922218,0.00031444608,0.002190128,0.0006151502,0.5267717],"genre_scores_gemma":[0.75427866,0.01462344,0.16891398,0.002505758,0.0032232616,0.00053705653,0.0020517188,0.00018341688,0.05368267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987166,0.00035089985,0.00009031802,0.00026235898,0.0004562384,0.0001235634],"domain_scores_gemma":[0.998187,0.00075612206,0.0002266901,0.00025874408,0.00042101735,0.00015042404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816766,0.0008433841,0.0006682796,0.0031949044,0.0017786912,0.0060948203,0.0008576404,0.0009110143,0.012674403],"category_scores_gemma":[0.0036432857,0.0003790744,0.0006999943,0.0029124054,0.004483438,0.009074668,0.0021252087,0.0024185933,0.0017126693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002185916,0.0000017104878,0.000021678557,0.000017400167,0.0000020470395,0.000009696758,0.000063092266,0.00015646894,0.00010862356,0.9971226,0.00066361664,0.0018308931],"study_design_scores_gemma":[0.0000031496722,0.0000036183635,0.00008365476,0.000014372398,0.0000027091555,0.00005557695,0.00005211281,0.0010988171,0.000116118106,0.97757214,0.020991696,0.0000059811223],"about_ca_topic_score_codex":0.0014196917,"about_ca_topic_score_gemma":0.0010175039,"teacher_disagreement_score":0.012674403,"about_ca_system_score_codex":0.0019832323,"about_ca_system_score_gemma":0.00094727194,"threshold_uncertainty_score":0.042400062},"labels":[],"label_agreement":null},{"id":"W2106154414","doi":"","title":"Nondeterministic Bimachines and Rational Relations with Finite Codomain","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Mathematics; Rational function; Finite set; Discrete mathematics; Pure mathematics","score_opus":0.004265870775491289,"score_gpt":0.19047498247860684,"score_spread":0.18620911170311555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106154414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18237525,0.0013131712,0.7869897,0.00042773376,0.0001424088,0.000089525434,0.00019328865,0.00047075897,0.02799816],"genre_scores_gemma":[0.85989565,0.0006104703,0.1297237,0.00016991833,0.000104348255,0.00016946829,0.00021287042,0.00011178067,0.009001763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981831,0.00041310056,0.0001713704,0.00058269233,0.0004227401,0.00022701437],"domain_scores_gemma":[0.997761,0.0011560764,0.00029519768,0.00047030195,0.0002196899,0.000097687735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213761,0.00046875974,0.00046426238,0.00076556834,0.0009856794,0.0020643983,0.00060152455,0.00066956994,0.0031113208],"category_scores_gemma":[0.0035328383,0.00039079084,0.00094423664,0.00054462114,0.005013454,0.004553601,0.0019304289,0.0019031008,0.0005502771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025200556,0.000009412181,0.00032181185,0.000038581366,0.000004666763,0.000076030316,0.00034528633,0.0013213741,0.0035152647,0.98831534,0.00011313596,0.0059139566],"study_design_scores_gemma":[0.0000137911375,0.000059977832,0.0005073111,0.00003141581,0.000014750408,0.0003291669,0.00020939189,0.0123599265,0.014796896,0.95744735,0.014195648,0.000034351764],"about_ca_topic_score_codex":0.00045329958,"about_ca_topic_score_gemma":0.0004435826,"teacher_disagreement_score":0.0031113208,"about_ca_system_score_codex":0.0008346846,"about_ca_system_score_gemma":0.00063756056,"threshold_uncertainty_score":0.010408461},"labels":[],"label_agreement":null},{"id":"W2109357046","doi":"10.3233/fi-2009-205","title":"Toward a General Framework for Polyphonic Comparison","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Music and Audio Processing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"Agence Nationale de la Recherche","keywords":"Polyphony; Chord (peer-to-peer); Computer science; Set (abstract data type); Speech recognition; Point (geometry); Quadratic equation; Mathematics; Programming language; Art","score_opus":0.05044108350393135,"score_gpt":0.3219270887733049,"score_spread":0.27148600526937355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109357046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094360264,0.0002710884,0.9959538,0.00011915786,0.000051797866,0.00003088411,0.00003692927,0.00015780088,0.002434948],"genre_scores_gemma":[0.04194583,0.000709307,0.9521986,0.00020181046,0.0003900158,0.00016493752,0.00020993795,0.00023503124,0.003944595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661475,0.0009745233,0.00024419327,0.0007840296,0.001187978,0.00019460302],"domain_scores_gemma":[0.9972108,0.0010255623,0.00017839632,0.00078937743,0.00065222115,0.00014350236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004258184,0.0012223875,0.001469795,0.002857765,0.0016006671,0.0034932452,0.003802785,0.0016369076,0.008855283],"category_scores_gemma":[0.00832108,0.00064819655,0.0016745452,0.0040239934,0.00339081,0.006930862,0.0037355851,0.0036599715,0.003513004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041830288,0.000038907136,0.00017216179,0.00014938359,0.000019783363,0.00010434674,0.00016316949,0.0145356525,0.0035712286,0.89529234,0.0027126353,0.083198465],"study_design_scores_gemma":[0.000023722636,0.000077320394,0.0001487639,0.000041721887,0.000018996869,0.00018948097,0.000060662627,0.122695275,0.0018030844,0.8416312,0.033275068,0.00003463784],"about_ca_topic_score_codex":0.0014884227,"about_ca_topic_score_gemma":0.0016580187,"teacher_disagreement_score":0.008855283,"about_ca_system_score_codex":0.0014207305,"about_ca_system_score_gemma":0.0017292744,"threshold_uncertainty_score":0.029623866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028182085055141262,"score_gpt":0.28112743774300314,"score_spread":0.2529453526878619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109787457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7848661,0.00034781365,0.20390181,0.0006500295,0.000043847984,0.0001589841,0.00059749524,0.00038034748,0.00905352],"genre_scores_gemma":[0.968072,0.0001759356,0.029388981,0.000042111056,0.000044581844,0.00016691755,0.0004620747,0.0000936594,0.0015537617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960608,0.00072937977,0.00043452377,0.0008101932,0.001280552,0.0006845609],"domain_scores_gemma":[0.9563838,0.034542497,0.0026349055,0.0034207257,0.0020650115,0.0009529662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481428,0.00064104487,0.0010005039,0.001382607,0.0016225775,0.004690788,0.0015849967,0.001109392,0.004652574],"category_scores_gemma":[0.018210346,0.00056373177,0.001826994,0.0011444303,0.0039799027,0.009116131,0.0024586187,0.0029267166,0.00041949053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087359024,0.00027968577,0.006844654,0.00035816428,0.00009338783,0.00048467063,0.0016161829,0.13647822,0.02242806,0.8051473,0.001035707,0.024360437],"study_design_scores_gemma":[0.000046804547,0.00015996798,0.0011193289,0.000020453632,0.000060235245,0.0002450739,0.00020283113,0.2787619,0.016211761,0.7018655,0.0012336513,0.000072504605],"about_ca_topic_score_codex":0.0012344115,"about_ca_topic_score_gemma":0.0012268563,"teacher_disagreement_score":0.004690788,"about_ca_system_score_codex":0.0023363037,"about_ca_system_score_gemma":0.0020676258,"threshold_uncertainty_score":0.016951203},"labels":[],"label_agreement":null},{"id":"W2112117284","doi":"","title":"Towards a Pragmatic Mereology","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mereology; Computer science; Epistemology; Theoretical computer science; Philosophy","score_opus":0.019496393728566312,"score_gpt":0.26909330219370736,"score_spread":0.24959690846514104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112117284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016518502,0.005594469,0.68542755,0.034366984,0.003005001,0.00009605673,0.00020871477,0.0007265068,0.25405622],"genre_scores_gemma":[0.6563463,0.0046726484,0.27491894,0.006414918,0.003452249,0.00035459312,0.0003384277,0.0008041235,0.052697767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953876,0.0023504242,0.00020409498,0.00064615835,0.0011305759,0.00028109882],"domain_scores_gemma":[0.9963546,0.0013699938,0.00019320121,0.0010245057,0.00073669996,0.00032102282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053367824,0.00080707204,0.0010919949,0.0023544233,0.0036064256,0.008479837,0.0016238356,0.0034779743,0.008978806],"category_scores_gemma":[0.008237979,0.00093532214,0.0014437855,0.0014005916,0.016242506,0.019644177,0.006823558,0.007241192,0.0025987902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023178834,0.0000019164247,0.0000100152565,0.000012997468,0.0000013074315,0.000014419481,0.00017465229,0.00006521022,0.0000639864,0.9979321,0.00052748667,0.0011936388],"study_design_scores_gemma":[0.0000036725176,0.0000055502833,0.00001709474,0.00002130049,0.0000022003221,0.000046701825,0.00009994336,0.0007874244,0.00008012032,0.980477,0.018453734,0.0000052981986],"about_ca_topic_score_codex":0.0008995262,"about_ca_topic_score_gemma":0.0007886167,"teacher_disagreement_score":0.008978806,"about_ca_system_score_codex":0.002652093,"about_ca_system_score_gemma":0.0021054328,"threshold_uncertainty_score":0.030037105},"labels":[],"label_agreement":null},{"id":"W2125299458","doi":"10.5555/1366982.1366988","title":"Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interleaving; Computer science; Automaton; Rotation formalisms in three dimensions; Concurrency; Theoretical computer science; Interface (matter); Associative property; Petri net; Component (thermodynamics); Distributed computing; Mathematics; Parallel computing","score_opus":0.10016448150673117,"score_gpt":0.33705320096661073,"score_spread":0.23688871945987955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125299458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006352574,0.00009345411,0.98897666,0.00014938384,0.000034666184,0.00006933571,0.00003333121,0.00050452637,0.003786103],"genre_scores_gemma":[0.30339086,0.00045549864,0.6890493,0.00044548392,0.00013914955,0.0009675267,0.00019723871,0.00057080097,0.0047841445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99006337,0.0034738947,0.0011293686,0.0014556685,0.0030771922,0.0008005227],"domain_scores_gemma":[0.96415275,0.02218617,0.0020623538,0.0074330736,0.003228435,0.00093718537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007352488,0.0014300689,0.0011757951,0.0014681905,0.0019790395,0.0040810267,0.002887554,0.0024923969,0.0045324164],"category_scores_gemma":[0.0312511,0.0014719506,0.0028641326,0.0015672924,0.0075369333,0.012403652,0.006972949,0.0067479233,0.0008990408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061052735,0.00006141726,0.00079719804,0.00011808673,0.000024526134,0.00032615956,0.0009800224,0.022559086,0.0029769645,0.9566241,0.00055059383,0.01492076],"study_design_scores_gemma":[0.000060594768,0.00004489895,0.00014358979,0.00008425115,0.000053429936,0.00024610985,0.00012706278,0.1702741,0.009392851,0.8037095,0.015813189,0.000050302424],"about_ca_topic_score_codex":0.0032463432,"about_ca_topic_score_gemma":0.002727482,"teacher_disagreement_score":0.007352488,"about_ca_system_score_codex":0.0019578144,"about_ca_system_score_gemma":0.002507385,"threshold_uncertainty_score":0.038884103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01021672557051059,"score_gpt":0.21489409888806202,"score_spread":0.20467737331755143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127563728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006708886,0.0020494456,0.9691046,0.0016363965,0.00040391178,0.000120022145,0.0001102395,0.00032874077,0.019537894],"genre_scores_gemma":[0.22334652,0.003018904,0.7584243,0.000865688,0.0008953528,0.000626598,0.00033935715,0.00046541507,0.012017977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868873,0.0035703606,0.0011819334,0.0022417193,0.005350849,0.0007677416],"domain_scores_gemma":[0.98072034,0.01198354,0.0011948916,0.0028359683,0.0026037402,0.0006614759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013939375,0.0012212029,0.0019664685,0.005243349,0.005091372,0.009241391,0.0038503124,0.0028796908,0.005683772],"category_scores_gemma":[0.030214075,0.0012571082,0.0049914,0.0039897403,0.015490138,0.017138258,0.00902401,0.008076289,0.0012801107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019986728,0.00000441478,0.000027184786,0.000021472717,0.000005933002,0.000021204833,0.00011708081,0.0010392857,0.00008556099,0.996636,0.00015740334,0.0018826508],"study_design_scores_gemma":[0.0000061469327,0.0000050381773,0.0000151319755,0.000025464215,0.000005597374,0.000037222726,0.000039868894,0.006357036,0.00024328673,0.9867272,0.0065256315,0.000012362402],"about_ca_topic_score_codex":0.0032531822,"about_ca_topic_score_gemma":0.0024555472,"teacher_disagreement_score":0.013939375,"about_ca_system_score_codex":0.004762081,"about_ca_system_score_gemma":0.0030485408,"threshold_uncertainty_score":0.07371938},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Computer science; Data mining","score_opus":0.028267010144782587,"score_gpt":0.2163878629629516,"score_spread":0.188120852818169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130367040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028879827,0.0011190211,0.95883155,0.00080682425,0.00014545374,0.00011836397,0.00037799787,0.0002460568,0.009474889],"genre_scores_gemma":[0.660763,0.001348452,0.3303546,0.0004155325,0.00046756613,0.00043914453,0.0009886846,0.00019563368,0.00502738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946069,0.001411157,0.0003389245,0.00080035516,0.002568789,0.00027384245],"domain_scores_gemma":[0.992466,0.0044145146,0.00053093367,0.0017806477,0.0006327334,0.00017513108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035191956,0.0009217747,0.0020587563,0.0029789472,0.00095604704,0.002985929,0.0013684637,0.00092554797,0.0020413296],"category_scores_gemma":[0.014052265,0.0005132674,0.0028723574,0.0020148724,0.0028359136,0.0047113965,0.003433751,0.0031988246,0.00031466197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009308819,0.00007331032,0.0010356101,0.00024703826,0.00017679662,0.00025217267,0.00033016226,0.14795534,0.0019326461,0.78612715,0.0029773945,0.05879929],"study_design_scores_gemma":[0.000014475255,0.00004581995,0.0003890393,0.000027716165,0.000039201448,0.00015315163,0.00004052097,0.19333972,0.0013101446,0.80076283,0.0038567048,0.00002072259],"about_ca_topic_score_codex":0.0006653972,"about_ca_topic_score_gemma":0.0005660669,"teacher_disagreement_score":0.0035191956,"about_ca_system_score_codex":0.0015428675,"about_ca_system_score_gemma":0.0008502695,"threshold_uncertainty_score":0.01861149},"labels":[],"label_agreement":null},{"id":"W2135042599","doi":"","title":"Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Gravitational singularity; Exponent; Mathematics; Singularity; Conjecture; Invariant (physics); Cellular automaton; Order (exchange); Pure mathematics; Discrete mathematics; Mathematical analysis; Mathematical physics; Algorithm","score_opus":0.01574680835851277,"score_gpt":0.27103190234987784,"score_spread":0.25528509399136506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135042599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81060225,0.0023169264,0.13415119,0.0013559659,0.00022740835,0.000047510763,0.00015916047,0.00075387384,0.050385702],"genre_scores_gemma":[0.9939885,0.00019505122,0.0044300114,0.000072479546,0.000046534366,0.000011649234,0.00003043239,0.000031776683,0.0011935427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997346,0.000039253493,0.000011409352,0.000049646344,0.00011508441,0.000049926],"domain_scores_gemma":[0.99772936,0.0014548536,0.00022043992,0.00024473254,0.00021874488,0.00013191935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054463075,0.00033992392,0.00042032351,0.00093469897,0.0005610393,0.0011875338,0.000680448,0.0006166835,0.0037245704],"category_scores_gemma":[0.0049925726,0.00011400372,0.00050549366,0.00039320864,0.0014858957,0.0010926328,0.0004932398,0.0007624581,0.00021124267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001952101,0.00012371383,0.007704807,0.0003932885,0.00004935256,0.0013179893,0.0010066625,0.12669045,0.03174778,0.81025666,0.0025658,0.017948383],"study_design_scores_gemma":[0.000038486018,0.00018862556,0.0054128426,0.000073344294,0.000027446256,0.00063845114,0.0002741097,0.35825798,0.017685369,0.6119585,0.005385486,0.000059321468],"about_ca_topic_score_codex":0.0007799381,"about_ca_topic_score_gemma":0.00041467114,"teacher_disagreement_score":0.0037245704,"about_ca_system_score_codex":0.0003559505,"about_ca_system_score_gemma":0.00020838418,"threshold_uncertainty_score":0.012459934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02374613452979048,"score_gpt":0.21739612774407222,"score_spread":0.19364999321428172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135119492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012862747,0.0016430379,0.98100054,0.000653733,0.000072049326,0.000026047397,0.000054123415,0.00011440435,0.0035733124],"genre_scores_gemma":[0.34151283,0.0041479426,0.6501408,0.00025703144,0.0003987632,0.00019835499,0.00022924315,0.000065220425,0.003049756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964748,0.001370041,0.00023265243,0.00046492094,0.0012644914,0.00019300866],"domain_scores_gemma":[0.99489033,0.0028793826,0.0006220774,0.0010142857,0.0004111759,0.00018278528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038065605,0.001138449,0.0014471634,0.0026614177,0.00090296916,0.0048792087,0.0021732447,0.0014374022,0.0012467739],"category_scores_gemma":[0.011517656,0.0007872532,0.0020985173,0.0035649287,0.0047779083,0.010981151,0.0037441843,0.0039456934,0.00043648062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005020902,0.00002993429,0.0005636569,0.00013975882,0.0000636455,0.00020230531,0.0007853585,0.062411945,0.0009290264,0.8984791,0.0009890044,0.035356],"study_design_scores_gemma":[0.000013105065,0.000031208212,0.00020848845,0.000044186767,0.000024078057,0.00009381202,0.00015635954,0.14119439,0.00047648218,0.8531499,0.004588741,0.000019268417],"about_ca_topic_score_codex":0.0017320004,"about_ca_topic_score_gemma":0.0014381703,"teacher_disagreement_score":0.0048792087,"about_ca_system_score_codex":0.0018988296,"about_ca_system_score_gemma":0.00084833376,"threshold_uncertainty_score":0.02013129},"labels":[],"label_agreement":null},{"id":"W2138249341","doi":"10.3233/fi-2011-538","title":"On the Regularity of Iterated Hairpin Completion of a Single Word","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Iterated function; Word (group theory); Mathematics; Arithmetic; Computer science; Linguistics; Natural language processing; Combinatorics; Philosophy; Geometry; Mathematical analysis","score_opus":0.06498363595602971,"score_gpt":0.22817466271495887,"score_spread":0.16319102675892916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138249341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8384648,0.00023807061,0.15282094,0.00019790408,0.000026758102,0.00005754495,0.00020264846,0.00028402678,0.0077072787],"genre_scores_gemma":[0.9629006,0.00015175574,0.03355357,0.00007287232,0.00010581819,0.00008965569,0.00044583442,0.000120116136,0.002559814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839336,0.00039970587,0.00012123377,0.00045263252,0.0004106138,0.00022237585],"domain_scores_gemma":[0.9861043,0.009650188,0.0013361592,0.0012090461,0.0010286141,0.00067173486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364586,0.00035549485,0.00076651847,0.0013216673,0.0008360187,0.0012538951,0.0007272554,0.00064251496,0.0018264002],"category_scores_gemma":[0.013923851,0.00036509265,0.00069222896,0.00063073944,0.0033936407,0.0022817347,0.0013628165,0.0012911409,0.00038782292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009944795,0.00027257172,0.010317958,0.00031922892,0.00006974359,0.001772717,0.0024179984,0.092296444,0.05715648,0.78704786,0.0020520757,0.045282487],"study_design_scores_gemma":[0.00008390723,0.0005456634,0.0032153535,0.000055243912,0.000037324724,0.0008989761,0.00041929173,0.40379032,0.026870852,0.56015086,0.0038278098,0.00010429365],"about_ca_topic_score_codex":0.0006688113,"about_ca_topic_score_gemma":0.00043951644,"teacher_disagreement_score":0.0018264002,"about_ca_system_score_codex":0.00051267404,"about_ca_system_score_gemma":0.0005370045,"threshold_uncertainty_score":0.008125663},"labels":[],"label_agreement":null},{"id":"W2139956811","doi":"10.3233/fi-2015-1206","title":"A Formal Language Model of DNA Polymerase Enzymatic Activity","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"DNA polymerase; Polymerase; Computer science; Enzyme; Computational biology; Chemistry; Biochemistry; Biology","score_opus":0.03267416658293723,"score_gpt":0.274254291025642,"score_spread":0.2415801244427048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139956811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035180293,0.00062422076,0.9395936,0.0018726989,0.00012144177,0.00009316025,0.00030356055,0.00042645275,0.021784585],"genre_scores_gemma":[0.59437597,0.0007715194,0.38921878,0.0005844646,0.0003147185,0.00047751062,0.00052029535,0.00020189832,0.013534852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869823,0.00036988905,0.000101669735,0.00029018696,0.00033940174,0.00020058037],"domain_scores_gemma":[0.99781007,0.0011424175,0.0002254859,0.00027998953,0.00038872325,0.00015333763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017333621,0.00060693355,0.0005333773,0.00097468623,0.0010770193,0.0027175108,0.0018822378,0.0012573753,0.0038396171],"category_scores_gemma":[0.0035499376,0.00041905543,0.0016404393,0.00085664034,0.004523233,0.005744236,0.0017231494,0.002001778,0.000883457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011617152,0.000015173485,0.00007306627,0.00002634297,0.0000035314133,0.00007224458,0.00020050071,0.0058182343,0.000994493,0.9902098,0.0002734557,0.0023015325],"study_design_scores_gemma":[0.00004140294,0.000029447943,0.00005960698,0.00002364298,0.0000128299835,0.000112786074,0.0000834214,0.074180275,0.0012434026,0.9145062,0.009684817,0.000022099535],"about_ca_topic_score_codex":0.0035630846,"about_ca_topic_score_gemma":0.002181812,"teacher_disagreement_score":0.0038396171,"about_ca_system_score_codex":0.0025312654,"about_ca_system_score_gemma":0.0021156652,"threshold_uncertainty_score":0.018365681},"labels":[],"label_agreement":null},{"id":"W2141991092","doi":"10.3233/fi-2009-0028","title":"Toward Formal Models of the Theoretical Framework of Fundamental Economics","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematical economics; Management science; Positive economics; Economics; Epistemology; Philosophy","score_opus":0.02006659471513493,"score_gpt":0.23576478636962941,"score_spread":0.2156981916544945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141991092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061433627,0.0042266063,0.9402282,0.0075103166,0.0003649027,0.000057635258,0.0001958434,0.00015771735,0.04111545],"genre_scores_gemma":[0.44870648,0.011233229,0.5196764,0.002838274,0.0021664014,0.0009318181,0.000544888,0.00022961994,0.013672889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811256,0.0009393121,0.000090130154,0.00018363261,0.00054764614,0.00012678863],"domain_scores_gemma":[0.9946483,0.0034239502,0.00043039603,0.00063153566,0.00067830243,0.00018745264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054079075,0.0010754322,0.0010806056,0.0022267068,0.0012376764,0.004032472,0.0028589065,0.0022879927,0.00500748],"category_scores_gemma":[0.009959939,0.00063846627,0.001457249,0.0017402554,0.007271829,0.008069446,0.0029316342,0.0052212053,0.0012157005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.221773e-7,0.0000033544188,0.000011259048,0.000007245579,0.0000010567858,0.0000049654304,0.000022595808,0.0014360066,0.000022594517,0.9977997,0.0001952289,0.0004953516],"study_design_scores_gemma":[0.0000022924792,0.0000022107592,0.000010521987,0.000011442245,8.475648e-7,0.000006146969,0.000012124115,0.008273991,0.00001758482,0.98875356,0.0029067409,0.000002478546],"about_ca_topic_score_codex":0.0017211386,"about_ca_topic_score_gemma":0.0013334233,"teacher_disagreement_score":0.0054079075,"about_ca_system_score_codex":0.0030819054,"about_ca_system_score_gemma":0.0023914408,"threshold_uncertainty_score":0.028600156},"labels":[],"label_agreement":null},{"id":"W2143276068","doi":"10.3233/fun-2007-761-208","title":"Intercode Regular Languages","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.006680356628731117,"score_gpt":0.25572964456291125,"score_spread":0.24904928793418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143276068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11778607,0.0011783349,0.81864464,0.001085561,0.00047482707,0.00029864348,0.0013872108,0.0027070255,0.05643769],"genre_scores_gemma":[0.74550956,0.0007757677,0.22103482,0.0007635851,0.0003821679,0.00045823125,0.0020233386,0.0006618022,0.028390693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975961,0.00044724965,0.00019579088,0.00080969854,0.0006397428,0.00031150575],"domain_scores_gemma":[0.9956566,0.0016414105,0.00070982473,0.0009007106,0.00087459607,0.00021688563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084413827,0.00060878776,0.00048853934,0.0015202472,0.0010927124,0.0019866053,0.0010377399,0.00088323944,0.0072285538],"category_scores_gemma":[0.00434124,0.0004403428,0.0011288379,0.0009820496,0.0030861848,0.0037334315,0.0016813972,0.0019059731,0.0018254771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119276294,0.000034426444,0.0009712055,0.00015836829,0.000019913423,0.00041041584,0.0008213998,0.0038304373,0.007310323,0.95533323,0.0030385202,0.027952485],"study_design_scores_gemma":[0.000028473727,0.00008287121,0.00074709207,0.00007482372,0.000028794228,0.000938288,0.00030191196,0.024001861,0.010340997,0.9043386,0.059057154,0.00005906288],"about_ca_topic_score_codex":0.0009116451,"about_ca_topic_score_gemma":0.0009021122,"teacher_disagreement_score":0.0072285538,"about_ca_system_score_codex":0.00092917157,"about_ca_system_score_gemma":0.0010429497,"threshold_uncertainty_score":0.024181902},"labels":[],"label_agreement":null},{"id":"W2152857032","doi":"10.3233/fi-2012-750","title":"Sheng Yu (1950–2012) In Memoriam","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Computer science; Philosophy","score_opus":0.01328618173797886,"score_gpt":0.23743671798966437,"score_spread":0.22415053625168552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152857032","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004865008,0.02973055,0.0012808357,0.17619623,0.78659326,0.000019347015,0.00033913902,0.00012464864,0.005229489],"genre_scores_gemma":[0.021551767,0.024572289,0.0015951149,0.11976039,0.64560103,0.00014552976,0.00060334156,0.00030985606,0.18586063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984126,0.0003163159,0.00015110498,0.00049584405,0.00050077215,0.00012335661],"domain_scores_gemma":[0.99635845,0.00096666504,0.0002992776,0.00018499815,0.0016278231,0.0005626818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022406068,0.0013992086,0.0014343297,0.0016013919,0.0020023077,0.002855411,0.0012623401,0.0032475854,0.02123627],"category_scores_gemma":[0.016801221,0.00035376052,0.0009056476,0.0010803981,0.001398599,0.0031209146,0.0038797304,0.0058505316,0.013907388],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064723085,0.0000072002854,0.00022909744,0.00015703017,0.000023858796,0.00029494983,0.00011551481,0.000058033333,0.0002020232,0.0029961364,0.9736067,0.022244686],"study_design_scores_gemma":[0.000011179826,0.00001526643,0.00037939937,0.00011083397,0.00001801029,0.00029897192,0.00006611808,0.000077575256,0.00023675538,0.0017667932,0.99700147,0.000017663575],"about_ca_topic_score_codex":0.001612619,"about_ca_topic_score_gemma":0.0022568754,"teacher_disagreement_score":0.02123627,"about_ca_system_score_codex":0.0028208552,"about_ca_system_score_gemma":0.0016176084,"threshold_uncertainty_score":0.07104242},"labels":[],"label_agreement":null},{"id":"W2153447124","doi":"","title":"Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Prefix; Prefix code; Alphabet; Encoding (memory); Algorithm; Time complexity; Integer (computer science); Function (biology); Generalization; Binary logarithm; Binary number; Mathematics; Computer science; Discrete mathematics; Property (philosophy); Computational complexity theory; Combinatorics; Arithmetic; Block code; Decoding methods; Linear code","score_opus":0.012649683804712356,"score_gpt":0.2293029668300164,"score_spread":0.21665328302530407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153447124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010350945,0.00016440959,0.9875294,0.00012588421,0.00003776303,0.00007667553,0.000055986486,0.0004435881,0.0012153579],"genre_scores_gemma":[0.077119246,0.000204472,0.92053497,0.00010123942,0.000052104642,0.00029662563,0.00025500642,0.000097595075,0.0013387438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986582,0.0003331569,0.000132838,0.00021611391,0.00052684656,0.00013285447],"domain_scores_gemma":[0.99703264,0.0017124399,0.00027269585,0.0005254671,0.00038199133,0.00007478032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011201474,0.0009059065,0.0011612627,0.0012429417,0.00053045363,0.0010816797,0.0010354941,0.0013156997,0.0034263395],"category_scores_gemma":[0.0060604364,0.0005060201,0.00083150325,0.0015655705,0.0006359169,0.0017075943,0.0013699105,0.0011949746,0.0013579302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003543816,0.00021595698,0.00073122414,0.0005368197,0.00010466109,0.00024000269,0.0003331621,0.1990332,0.03864504,0.08496503,0.0055546504,0.6692858],"study_design_scores_gemma":[0.00022870887,0.00030832904,0.0002394612,0.00006236789,0.00005399839,0.0004533678,0.00007485368,0.881032,0.029361581,0.07846546,0.009662862,0.000056911143],"about_ca_topic_score_codex":0.0006543317,"about_ca_topic_score_gemma":0.0008451263,"teacher_disagreement_score":0.0034263395,"about_ca_system_score_codex":0.00061259896,"about_ca_system_score_gemma":0.0018405977,"threshold_uncertainty_score":0.011462271},"labels":[],"label_agreement":null},{"id":"W2156801838","doi":"","title":"Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical proof; Computer science; Axiom; Programming language; Code (set theory); Set (abstract data type); Semantics (computer science); Proof assistant; Theoretical computer science; Mathematics","score_opus":0.044144822373545126,"score_gpt":0.2689546528531281,"score_spread":0.22480983047958297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156801838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015450796,0.0062007043,0.88939244,0.0028404314,0.00074894086,0.00018870966,0.00038113093,0.0029804863,0.095722035],"genre_scores_gemma":[0.039111912,0.011786503,0.8993955,0.0014546658,0.000772674,0.00050647976,0.0011431852,0.0014336985,0.044395402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986325,0.00041579254,0.00012990432,0.00017933859,0.0005111566,0.00013126736],"domain_scores_gemma":[0.9978967,0.0013880308,0.000075370735,0.00022661421,0.00032849394,0.0000847698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981766,0.0013571299,0.00056641555,0.0021996577,0.0011489694,0.002487386,0.0016390091,0.0015071271,0.023235885],"category_scores_gemma":[0.004922632,0.00093329686,0.001272504,0.002374923,0.002670987,0.0043343715,0.0015758609,0.0038994835,0.008062903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024965893,0.0000749338,0.00012705743,0.00062190025,0.000014556089,0.00037479124,0.00062770804,0.0018256471,0.0023357084,0.87009674,0.038235307,0.08564075],"study_design_scores_gemma":[0.000013208273,0.00004414282,0.0003321527,0.00034098228,0.000014705358,0.0011148287,0.0001139143,0.0061449553,0.0024798345,0.4618394,0.52751595,0.000046031422],"about_ca_topic_score_codex":0.0014375097,"about_ca_topic_score_gemma":0.0018577644,"teacher_disagreement_score":0.023235885,"about_ca_system_score_codex":0.0019152081,"about_ca_system_score_gemma":0.0012403617,"threshold_uncertainty_score":0.07773179},"labels":[],"label_agreement":null},{"id":"W2157546665","doi":"10.3233/fun-2008-821-208","title":"Impact of Asynchrony on the Behavior of Rational Selfish Agents","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchrony (computer programming); Psychology; Computer science; Asynchronous communication","score_opus":0.051043548715207034,"score_gpt":0.33711970024765897,"score_spread":0.2860761515324519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157546665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131223,0.00023136484,0.07181572,0.000713852,0.000026100928,0.000034670236,0.0000472342,0.000093436975,0.013915332],"genre_scores_gemma":[0.9977507,0.0000626434,0.0015792751,0.000025130481,0.000007201178,0.000010017029,0.0000067753595,0.000006446174,0.0005518192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981139,0.0009442793,0.00009250236,0.0002862963,0.0003559439,0.00020715447],"domain_scores_gemma":[0.98207194,0.011202986,0.0041468926,0.0011616602,0.0006840314,0.00073246507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466746,0.00044448627,0.00050018827,0.00046258018,0.0005850448,0.0014740693,0.00055286003,0.00084780325,0.0020345934],"category_scores_gemma":[0.02001192,0.00036821893,0.00031650934,0.00023466571,0.0018050848,0.0018392613,0.001119454,0.0008002871,0.0002491598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011217346,0.0002536172,0.02759127,0.00022063704,0.00021540435,0.0025169277,0.0020415373,0.4729524,0.03154754,0.43348688,0.00089201983,0.027160041],"study_design_scores_gemma":[0.00016935948,0.00036220136,0.0077308505,0.000026145533,0.00007402269,0.00043809027,0.00058460876,0.7738021,0.004373368,0.21081318,0.0015660169,0.000060144906],"about_ca_topic_score_codex":0.0016876269,"about_ca_topic_score_gemma":0.001075799,"teacher_disagreement_score":0.002466746,"about_ca_system_score_codex":0.00085094024,"about_ca_system_score_gemma":0.00075015886,"threshold_uncertainty_score":0.013045609},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012633954747108603,"score_gpt":0.25190328031483383,"score_spread":0.23926932556772523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162033093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013578275,0.008802138,0.94784606,0.0015627298,0.00051221787,0.0001261559,0.00046845878,0.00021519703,0.026888803],"genre_scores_gemma":[0.43209285,0.011056243,0.5331118,0.0017779485,0.0020757064,0.0008526477,0.0017199902,0.00026768708,0.01704507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930146,0.0019151982,0.0007703222,0.0019327116,0.0020238964,0.00034331065],"domain_scores_gemma":[0.99340725,0.0037242768,0.0007829752,0.0010242988,0.0007645204,0.00029657118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144716,0.0012297829,0.001862805,0.0055204593,0.0019106942,0.0063315434,0.0025522402,0.0029675472,0.0027838396],"category_scores_gemma":[0.010872046,0.0009597889,0.0034590913,0.00365109,0.010165603,0.0125404075,0.0046685156,0.004350324,0.0010164784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013746488,0.000009274943,0.00022324406,0.00016658644,0.00003235301,0.000104237886,0.00036027085,0.005555694,0.00041252622,0.98295397,0.00088541716,0.009282594],"study_design_scores_gemma":[0.00000973531,0.000047714944,0.00025115025,0.00011295016,0.000034024517,0.00029631282,0.00020451579,0.024261797,0.0005062813,0.9490737,0.025170242,0.00003155077],"about_ca_topic_score_codex":0.0023793776,"about_ca_topic_score_gemma":0.00094965176,"teacher_disagreement_score":0.0063315434,"about_ca_system_score_codex":0.0028998316,"about_ca_system_score_gemma":0.0010528925,"threshold_uncertainty_score":0.021919608},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.033601372998993635,"score_gpt":0.20600116697538332,"score_spread":0.1723997939763897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169200909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26835582,0.00770148,0.61474156,0.0017997549,0.00056429685,0.00015072669,0.0013831636,0.00066998356,0.10463312],"genre_scores_gemma":[0.85389006,0.0044272956,0.12016644,0.000932976,0.0010437198,0.0002942016,0.0009232993,0.00026992772,0.018052215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981427,0.00024655098,0.0001430204,0.0005105552,0.00064936595,0.0003077825],"domain_scores_gemma":[0.99400914,0.0023106958,0.0010238086,0.0010099874,0.0012275315,0.00041891568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091617624,0.00053901086,0.0005493022,0.0027499057,0.002067785,0.001593284,0.000723549,0.001054691,0.0027563416],"category_scores_gemma":[0.006638446,0.00037350922,0.0007888396,0.002575733,0.002620744,0.0040108324,0.002057314,0.002128977,0.00090302253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003835015,0.000015588936,0.0007344791,0.00008090462,0.0000088353345,0.00016035195,0.00046696357,0.00399021,0.0016596974,0.97396415,0.0011190773,0.017761536],"study_design_scores_gemma":[0.000008544954,0.000039523486,0.0007075303,0.00006284311,0.000010536606,0.0007146375,0.0002136752,0.02025121,0.0018114934,0.9532792,0.022859488,0.000041316267],"about_ca_topic_score_codex":0.0021494012,"about_ca_topic_score_gemma":0.0011444199,"teacher_disagreement_score":0.0027563416,"about_ca_system_score_codex":0.0015125609,"about_ca_system_score_gemma":0.0012428724,"threshold_uncertainty_score":0.010974407},"labels":[],"label_agreement":null},{"id":"W2498348315","doi":"10.3233/fun-2008-861-207","title":"Involution Solid and Join codes","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Join (topology); Computer science; Involution (esoterism); Discrete mathematics; Mathematics; Combinatorics; Law","score_opus":0.02241134773385848,"score_gpt":0.2514886468805699,"score_spread":0.2290772991467114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498348315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32991675,0.00085939845,0.6104839,0.00072085566,0.00029620828,0.00007242597,0.0002920259,0.00037083533,0.056987662],"genre_scores_gemma":[0.9153794,0.0004542357,0.066657096,0.00036211027,0.00036421706,0.00010946005,0.00041905377,0.00017503029,0.016079402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981743,0.0002649039,0.00009974356,0.00040804886,0.00070644415,0.0003465608],"domain_scores_gemma":[0.995146,0.0022434203,0.0005446496,0.00079205714,0.0007739364,0.0004999006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231718,0.0003805794,0.0004614125,0.0011720285,0.0014040539,0.0017387402,0.0006551466,0.00078083016,0.0045768656],"category_scores_gemma":[0.0044408916,0.00020757431,0.00067514536,0.0009196229,0.004375545,0.003379489,0.0024691303,0.0017114434,0.0007441768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003534383,0.000009633766,0.00028122007,0.000021334305,0.0000033017463,0.000056875797,0.00016349881,0.0017543482,0.0014132907,0.9889564,0.0002920661,0.00701279],"study_design_scores_gemma":[0.000008334405,0.000051291943,0.00022712817,0.000019102094,0.0000058709247,0.00024484957,0.00015071414,0.014332208,0.0044468883,0.9709416,0.009550283,0.000021823973],"about_ca_topic_score_codex":0.0006771384,"about_ca_topic_score_gemma":0.0005346549,"teacher_disagreement_score":0.0045768656,"about_ca_system_score_codex":0.0006872493,"about_ca_system_score_gemma":0.00074844476,"threshold_uncertainty_score":0.015311122},"labels":[],"label_agreement":null},{"id":"W2531289487","doi":"10.3233/fun-2008-873-401","title":"Characterizing DNA Bond Shapes Using Trajectories","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Computer science; Set (abstract data type); Extension (predicate logic); DNA computing; Bond; Rotation (mathematics); Algorithm; Theoretical computer science; Artificial intelligence; Programming language; Computation","score_opus":0.036337564022386935,"score_gpt":0.2591193400557657,"score_spread":0.22278177603337876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531289487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08938747,0.00047028135,0.9030325,0.00039579344,0.000060883514,0.000105818,0.00051858986,0.00050816184,0.005520605],"genre_scores_gemma":[0.672205,0.0010613159,0.31864056,0.0002003219,0.0001150625,0.00041465843,0.0011954291,0.00039759095,0.005769972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977443,0.0004475286,0.0002452079,0.00073653035,0.0006184966,0.0002078571],"domain_scores_gemma":[0.9916026,0.004366264,0.0015899204,0.0012091306,0.0009388764,0.00029316536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016597908,0.00095157913,0.000650868,0.0025177584,0.0012230485,0.0025061022,0.001714742,0.0014182694,0.0033242602],"category_scores_gemma":[0.011931323,0.0005613907,0.0016523619,0.002219208,0.004529223,0.007858216,0.0021494883,0.0015086684,0.0006464848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001130053,0.00004706666,0.0021140287,0.00017231825,0.000034466117,0.00032850576,0.0006552169,0.13605574,0.01413393,0.8162026,0.0005963221,0.029546747],"study_design_scores_gemma":[0.000016425958,0.000073745054,0.00035836166,0.00006146253,0.000025791483,0.00025782592,0.00021192979,0.2583077,0.015437595,0.7172007,0.007986101,0.000062298626],"about_ca_topic_score_codex":0.0024683457,"about_ca_topic_score_gemma":0.0011919138,"teacher_disagreement_score":0.0033242602,"about_ca_system_score_codex":0.0017431928,"about_ca_system_score_gemma":0.0009076543,"threshold_uncertainty_score":0.012647867},"labels":[],"label_agreement":null},{"id":"W2549381068","doi":"10.3233/fi-2016-1389","title":"Efficacy Analysis of Ratios from Pairwise Comparisons","year":2016,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pairwise comparison; Benchmark (surveying); Mathematics; Matrix (chemical analysis); Decision maker; Eigenvalues and eigenvectors; Statistics; Geometric mean; Algorithm; Operations research; Geography","score_opus":0.23427430563419635,"score_gpt":0.43911681770958916,"score_spread":0.2048425120753928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549381068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029428463,0.0018141626,0.952568,0.0003151478,0.00019276563,0.00085379195,0.0007295957,0.00056018523,0.013537944],"genre_scores_gemma":[0.63185364,0.0011576627,0.35996592,0.00026895548,0.00037106778,0.0022464958,0.001557679,0.0004678513,0.0021106885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8763173,0.08620128,0.005191458,0.0076999217,0.023450311,0.0011396394],"domain_scores_gemma":[0.4934137,0.45470643,0.013483348,0.020864353,0.016561396,0.00097075454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10980748,0.002263875,0.0029109812,0.011110717,0.001069353,0.0032934225,0.0025993513,0.0016770661,0.009792704],"category_scores_gemma":[0.3623287,0.0007487822,0.0031945838,0.0042736772,0.0039389418,0.0058420845,0.003118665,0.0025746613,0.0014393198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003690675,0.00045509016,0.026139421,0.0038771154,0.0025598188,0.00038043648,0.0012208847,0.17044492,0.0049362886,0.23128606,0.00703618,0.5479731],"study_design_scores_gemma":[0.00051927747,0.0057398393,0.02292116,0.00104285,0.0023794477,0.0014408104,0.0009844715,0.6369234,0.026817122,0.27919704,0.021720398,0.0003142964],"about_ca_topic_score_codex":0.00040259882,"about_ca_topic_score_gemma":0.00029910632,"teacher_disagreement_score":0.10980748,"about_ca_system_score_codex":0.0018207497,"about_ca_system_score_gemma":0.0019111526,"threshold_uncertainty_score":0.58072436},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.08714268118305024,"score_gpt":0.35479946860964956,"score_spread":0.2676567874265993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559976948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3709483,0.0032460606,0.58093977,0.0021173214,0.00033971123,0.000061213104,0.0001396357,0.00017014136,0.042037807],"genre_scores_gemma":[0.97218186,0.00091332546,0.015223108,0.00013804843,0.000098665914,0.000045445544,0.000059469312,0.00003321679,0.01130684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982375,0.000058025882,0.000008489709,0.000031362164,0.00004278817,0.00003565848],"domain_scores_gemma":[0.9996921,0.000112613394,0.00006994612,0.000023941931,0.00006497679,0.000036439083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170506,0.00067158305,0.0006497168,0.0006260513,0.00056325184,0.0012592485,0.00060053583,0.0012052583,0.0019918033],"category_scores_gemma":[0.0015510634,0.00022361286,0.00068156596,0.00046917144,0.0014687391,0.0012158933,0.0010500011,0.0011141745,0.00024022818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006662833,0.000055946708,0.0011348166,0.0002260819,0.000057148176,0.0011461016,0.00044345256,0.15550871,0.01914993,0.8102527,0.0014357051,0.010522768],"study_design_scores_gemma":[0.000021085361,0.000036267607,0.00043979523,0.000022206934,0.00001629826,0.0002382446,0.00019355983,0.84264123,0.0021582907,0.15205476,0.0021512504,0.000026998516],"about_ca_topic_score_codex":0.0021918705,"about_ca_topic_score_gemma":0.0016955255,"teacher_disagreement_score":0.0021918705,"about_ca_system_score_codex":0.00078902685,"about_ca_system_score_gemma":0.00048908097,"threshold_uncertainty_score":0.006663263},"labels":[],"label_agreement":null},{"id":"W2604861954","doi":"10.3233/fi-2018-1651","title":"On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Functional dependency; Axiom; Semantics (computer science); Relational database; Database; Independence (probability theory); Theoretical computer science; Relational model; Possible world; Information retrieval; Programming language; Mathematics","score_opus":0.031046352721690713,"score_gpt":0.2388561724885678,"score_spread":0.2078098197668771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604861954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050706398,0.000543967,0.93892556,0.0026039619,0.00007371677,0.00011571657,0.0006082876,0.00032537314,0.0060969773],"genre_scores_gemma":[0.5500097,0.00083426153,0.44339335,0.0009387909,0.0002842284,0.0005392046,0.0013036034,0.00019144038,0.002505378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98807085,0.004763945,0.0016022858,0.0016197929,0.0031979117,0.0007452458],"domain_scores_gemma":[0.9668787,0.020549206,0.0023609297,0.004536858,0.0045247334,0.0011495865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013401919,0.0009805172,0.0011304897,0.002875243,0.0019279289,0.0050253132,0.003011202,0.0024475537,0.0022410164],"category_scores_gemma":[0.031285718,0.0011652363,0.0024059662,0.0035786955,0.004919529,0.016761804,0.0051716794,0.004540293,0.0003997192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004648811,0.000047021746,0.00041414966,0.00010158528,0.000022642218,0.00018703184,0.0006058118,0.009762526,0.0009018107,0.97996706,0.00076451607,0.0071792933],"study_design_scores_gemma":[0.000029680315,0.000045022032,0.00015770171,0.000049763516,0.000022364087,0.00018816661,0.00018652948,0.05701925,0.0007793014,0.9384133,0.0030869283,0.000022071308],"about_ca_topic_score_codex":0.0023554997,"about_ca_topic_score_gemma":0.0022561809,"teacher_disagreement_score":0.013401919,"about_ca_system_score_codex":0.0030448472,"about_ca_system_score_gemma":0.0022087472,"threshold_uncertainty_score":0.070877016},"labels":[],"label_agreement":null},{"id":"W2605185012","doi":"10.3233/fi-2017-1519","title":"SMC4AC: A New Symbolic Model Checker for Intelligent Agent Communication","year":2017,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Model checking; Symbolic communication; Semantics (computer science); Autonomous agent; Human–computer interaction; Intelligent agent; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.1291633609914421,"score_gpt":0.37503862014180495,"score_spread":0.24587525915036285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605185012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067086183,0.00007564947,0.97582096,0.00021985343,0.000101388054,0.00017467169,0.00043033267,0.0144300265,0.0020384805],"genre_scores_gemma":[0.17978063,0.00020671355,0.8104599,0.0004673005,0.000097061886,0.0005752142,0.00198186,0.0018045781,0.0046267454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488443,0.0013548211,0.00040745968,0.00065687543,0.002333511,0.00036276935],"domain_scores_gemma":[0.99206513,0.0043226304,0.0006236308,0.0014049542,0.0014192485,0.00016437417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033204218,0.0014528608,0.0012082303,0.0024456752,0.0010099665,0.0027251327,0.0038784,0.0016546084,0.00634777],"category_scores_gemma":[0.014024474,0.0009298876,0.0023987598,0.0012614081,0.0023923032,0.004105232,0.0030100541,0.0032367231,0.0012106241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008678076,0.00035074554,0.0042531984,0.0011533828,0.000396402,0.00072854577,0.0007364092,0.42932898,0.03163269,0.25652266,0.024353191,0.2496761],"study_design_scores_gemma":[0.00011233947,0.00010021166,0.00017166192,0.00006617374,0.00008522326,0.00010235309,0.000053000516,0.92797846,0.018243559,0.034319356,0.018724669,0.00004296675],"about_ca_topic_score_codex":0.010868032,"about_ca_topic_score_gemma":0.012294415,"teacher_disagreement_score":0.010868032,"about_ca_system_score_codex":0.0024258324,"about_ca_system_score_gemma":0.0071180677,"threshold_uncertainty_score":0.021609545},"labels":[],"label_agreement":null},{"id":"W2742588600","doi":"10.3233/fi-2017-1564","title":"Smart Tile Self-Assembly and Replication","year":2017,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tile; Replication (statistics); Computer science; Replica; Turing machine; Distributed computing; Enhanced Data Rates for GSM Evolution; Simple (philosophy); Regular polygon; Table (database); Turing; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Computation; Geometry; Programming language","score_opus":0.01639877537713156,"score_gpt":0.24792602554584683,"score_spread":0.23152725016871528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742588600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07741299,0.001549802,0.8871577,0.00041647404,0.0003234866,0.000070072,0.000078400604,0.0007974844,0.032193627],"genre_scores_gemma":[0.8416273,0.0011576271,0.13933548,0.00024041554,0.000111201734,0.00025866006,0.00014164239,0.00015345502,0.016974285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967206,0.00005544847,0.000017560615,0.00008872258,0.000115083356,0.000051169674],"domain_scores_gemma":[0.99955565,0.000103059254,0.000068888374,0.00017435865,0.000051904786,0.000046112316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026658512,0.00028077365,0.00048935146,0.00031123805,0.00052301865,0.0008921177,0.0007929002,0.00074412965,0.0019687123],"category_scores_gemma":[0.0009088127,0.00033521047,0.0006107157,0.00023448991,0.0016866479,0.0011587285,0.00146556,0.00065420324,0.000715984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077589226,0.000029638491,0.00045530451,0.00022908367,0.000022601813,0.00038210975,0.000346907,0.11570374,0.08032977,0.77312994,0.001578506,0.027714808],"study_design_scores_gemma":[0.000042059888,0.0002045423,0.00043386553,0.000047963906,0.000024162176,0.000570032,0.00012968089,0.5806364,0.057771374,0.31657934,0.043495882,0.00006465739],"about_ca_topic_score_codex":0.00044295596,"about_ca_topic_score_gemma":0.00033073113,"teacher_disagreement_score":0.0019687123,"about_ca_system_score_codex":0.0003494514,"about_ca_system_score_gemma":0.0003509337,"threshold_uncertainty_score":0.006586015},"labels":[],"label_agreement":null},{"id":"W2791839450","doi":"10.3233/fi-2019-1819","title":"Universal (and Existential) Nulls","year":2019,"lang":"en","type":"preprint","venue":"Fundamenta Informaticae","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Existentialism; Set (abstract data type); Mathematics; Star (game theory); Representation (politics); Discrete mathematics; Combinatorics; Algebra over a field; Computer science; Pure mathematics; Programming language","score_opus":0.015533828793069648,"score_gpt":0.2409121959049102,"score_spread":0.22537836711184056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791839450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057429794,0.0012826172,0.92818534,0.0013425526,0.00013465853,0.00016097761,0.0011737092,0.0013044192,0.008985827],"genre_scores_gemma":[0.6252995,0.0018469631,0.3604153,0.0007315135,0.00024501618,0.00021647464,0.0022109386,0.00044163986,0.008592654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98892015,0.0018021443,0.0016042963,0.0021356037,0.004705402,0.0008323535],"domain_scores_gemma":[0.97997457,0.008405737,0.0013523188,0.0066404385,0.0031746887,0.00045231153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008734024,0.00067963207,0.0014867717,0.0018447418,0.0014725785,0.005310525,0.0029320843,0.0012097291,0.004421897],"category_scores_gemma":[0.021502407,0.000658356,0.0020555945,0.0030505979,0.0046770186,0.01665904,0.0042969617,0.0020938006,0.0007994762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018024616,0.000038970637,0.0024002749,0.0003483403,0.00006625323,0.00045493688,0.0008330247,0.004992286,0.005851672,0.9118175,0.0022981386,0.07071829],"study_design_scores_gemma":[0.000026958376,0.000080316386,0.00094939605,0.00018830097,0.00014403898,0.001034241,0.00064264564,0.053219475,0.024489082,0.8813446,0.037780788,0.00010021621],"about_ca_topic_score_codex":0.0025125495,"about_ca_topic_score_gemma":0.0018262289,"teacher_disagreement_score":0.008734024,"about_ca_system_score_codex":0.0021230015,"about_ca_system_score_gemma":0.0026685428,"threshold_uncertainty_score":0.04619044},"labels":[],"label_agreement":null},{"id":"W2807434009","doi":"10.3233/fi-2018-1684","title":"Deterministic Meeting of Sniffing Agents in the Plane","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Sniffing; Plane (geometry); Computer science; Mathematics; Psychology; Geometry; Neuroscience","score_opus":0.05534727282622702,"score_gpt":0.31303479110933063,"score_spread":0.2576875182831036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807434009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55440855,0.0007872969,0.4232028,0.0017975568,0.00014357486,0.00020436347,0.0011653588,0.0005573743,0.017733186],"genre_scores_gemma":[0.9725776,0.0002708391,0.01644699,0.00010665467,0.0000533266,0.00010943484,0.00057035,0.00004045677,0.009824257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.0003590625,0.00009766191,0.00048755202,0.00026343256,0.00048586298],"domain_scores_gemma":[0.993006,0.0031678225,0.0018110324,0.00056448585,0.0005092228,0.00094141194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015096967,0.0010957452,0.0014805003,0.0007288873,0.0010193426,0.0019362699,0.0033035837,0.002989294,0.0057495404],"category_scores_gemma":[0.0106648505,0.0011556261,0.0011519645,0.00071578915,0.0021265117,0.0027498193,0.0030810048,0.0014773196,0.0011561183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00121852,0.00010914719,0.0114962775,0.00023595316,0.00011066372,0.001447967,0.00068422535,0.8794523,0.005558176,0.08517536,0.0025993048,0.011912192],"study_design_scores_gemma":[0.00006234594,0.000117905984,0.0014132238,0.000017260336,0.000035464986,0.00016231395,0.00017219866,0.9852336,0.00068985106,0.011135145,0.0009200259,0.000040663053],"about_ca_topic_score_codex":0.016331024,"about_ca_topic_score_gemma":0.008909935,"teacher_disagreement_score":0.016331024,"about_ca_system_score_codex":0.0018265228,"about_ca_system_score_gemma":0.0008025989,"threshold_uncertainty_score":0.032471895},"labels":[],"label_agreement":null},{"id":"W2899568612","doi":"10.3233/fi-2018-1746","title":"A Descriptive Tolerance Nearness Measure for Performing Graph Comparison","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Disjoint sets; Bipartite graph; Mathematics; Enumeration; Clique; Combinatorics; Graph; Theoretical computer science; Discrete mathematics; Computer science; Algorithm","score_opus":0.037069702012035785,"score_gpt":0.28832069830113355,"score_spread":0.25125099628909775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899568612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01586125,0.00030499767,0.98107624,0.00009785279,0.00005967769,0.000082254985,0.00012990009,0.00037838914,0.0020094141],"genre_scores_gemma":[0.26494306,0.0002774079,0.7319276,0.00014339028,0.000118385295,0.00032591232,0.00070912234,0.00025999203,0.0012951639],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925793,0.0022210486,0.00059462694,0.0013420242,0.003059437,0.00020367876],"domain_scores_gemma":[0.9852343,0.007593634,0.0016470435,0.002839353,0.0020977005,0.00058798876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040891995,0.000858247,0.001389299,0.0071912347,0.001258941,0.0023977377,0.0026042527,0.0017137163,0.002863382],"category_scores_gemma":[0.0292639,0.0004145711,0.0012344309,0.0047294553,0.002509887,0.006375409,0.0030090555,0.0021898535,0.00079396664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003683831,0.00030456643,0.0076817446,0.00077867904,0.00033660806,0.00036322948,0.00076660933,0.15950394,0.027725486,0.35107702,0.0039026127,0.44719112],"study_design_scores_gemma":[0.000032607964,0.00057341,0.004125022,0.00012262349,0.000097151285,0.0012017785,0.00039921165,0.6193089,0.018209947,0.3425564,0.013217657,0.0001552303],"about_ca_topic_score_codex":0.00084964104,"about_ca_topic_score_gemma":0.00092876796,"teacher_disagreement_score":0.0071912347,"about_ca_system_score_codex":0.0013641722,"about_ca_system_score_gemma":0.0010872466,"threshold_uncertainty_score":0.021626055},"labels":[],"label_agreement":null},{"id":"W2899572362","doi":"10.3233/fi-2018-1750","title":"Approximation Algorithms for Three Dimensional Protein Folding","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hexagonal prism; Lattice (music); Algorithm; Diagonal; Protein structure prediction; Crystal structure; Lattice protein; Hexagonal lattice; Protein structure; Protein folding; Protein secondary structure; Hexagonal crystal system; Mathematics; Computer science; Combinatorics; Crystallography; Physics; Geometry; Chemistry; Condensed matter physics","score_opus":0.014886312020876688,"score_gpt":0.26381062679254036,"score_spread":0.24892431477166366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899572362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057417075,0.0008025226,0.9907031,0.0002153091,0.000064790096,0.000024134537,0.00008526005,0.0004937328,0.0018694691],"genre_scores_gemma":[0.20477624,0.0013414704,0.7868948,0.00021280507,0.000109996996,0.00036395807,0.00096704677,0.00036484963,0.0049688187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.00026173482,0.00005458954,0.0001206964,0.00025626374,0.00008852032],"domain_scores_gemma":[0.99791366,0.0012611633,0.00012719423,0.00030860142,0.00031359398,0.000075865435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760312,0.0010503522,0.0012914317,0.0010761566,0.0007377329,0.0014924613,0.002065542,0.0015955429,0.0032318407],"category_scores_gemma":[0.0063308566,0.000462537,0.0010167094,0.0019581898,0.000940696,0.0016716516,0.0017994797,0.0018491212,0.001277132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011513928,0.00006257961,0.0006773749,0.000151402,0.000059965656,0.00004822845,0.00010444562,0.7971953,0.00097184686,0.085566945,0.0043076016,0.110739216],"study_design_scores_gemma":[0.000009274237,0.0000072056446,0.000039271028,0.000006265802,0.0000034088089,0.000011721397,0.000007593821,0.9668237,0.00016601583,0.032060716,0.00086148374,0.0000033283452],"about_ca_topic_score_codex":0.0059520314,"about_ca_topic_score_gemma":0.003916038,"teacher_disagreement_score":0.0059520314,"about_ca_system_score_codex":0.0018389523,"about_ca_system_score_gemma":0.001153704,"threshold_uncertainty_score":0.013342619},"labels":[],"label_agreement":null},{"id":"W2909151540","doi":"10.3233/fi-2019-1757","title":"Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex hull; Center (category theory); Set (abstract data type); Point (geometry); Regular polygon; Mathematics; Hull; Computer science; Mathematical optimization; Geometry; Engineering","score_opus":0.012166258951016772,"score_gpt":0.24381585005942744,"score_spread":0.23164959110841066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909151540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13508072,0.0014202747,0.8512212,0.0014177684,0.00009129569,0.00015599001,0.0006494262,0.00047467087,0.009488616],"genre_scores_gemma":[0.8385041,0.0011654599,0.14785965,0.00023389136,0.00028418968,0.00024106585,0.0011634721,0.00022960803,0.0103185605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783903,0.0003951342,0.00008999742,0.00072468014,0.0005865195,0.0003645415],"domain_scores_gemma":[0.99596465,0.0016878523,0.00056075066,0.0009846292,0.0003356841,0.00046650742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152568,0.0010035459,0.0018943399,0.0011773446,0.0013875273,0.002614338,0.0036195903,0.0023907379,0.004626689],"category_scores_gemma":[0.0075209276,0.00084413873,0.0012776806,0.0026478148,0.0026666895,0.009385472,0.0033209773,0.0025417905,0.000642907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005694048,0.00019463438,0.003371618,0.0003309193,0.00009694477,0.00074583176,0.0006384653,0.57953066,0.005384884,0.3604289,0.0067207683,0.04198698],"study_design_scores_gemma":[0.000029970886,0.00009425484,0.0005192502,0.000021490143,0.00001975768,0.00033260582,0.00019444308,0.8889699,0.0012766016,0.105256006,0.0032606595,0.000024992725],"about_ca_topic_score_codex":0.005908315,"about_ca_topic_score_gemma":0.0035833966,"teacher_disagreement_score":0.005908315,"about_ca_system_score_codex":0.0022043858,"about_ca_system_score_gemma":0.00085865473,"threshold_uncertainty_score":0.015994012},"labels":[],"label_agreement":null},{"id":"W2912417747","doi":"","title":"Interpreted Trajectories","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Equivalence (formal languages); Operand; Formalism (music); Turing; Computation; Mathematics; Computer science; Algebra over a field; Discrete mathematics; Algorithm; Pure mathematics; Arithmetic","score_opus":0.004391832578533249,"score_gpt":0.1974072551963312,"score_spread":0.19301542261779794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912417747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023768418,0.0010123439,0.91861737,0.0011549704,0.0007338261,0.00021963949,0.0017378652,0.0018175998,0.050937917],"genre_scores_gemma":[0.43533283,0.0019401537,0.50386,0.00094369776,0.00047225878,0.0006665015,0.004078905,0.0012401484,0.051465537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811065,0.00040779254,0.00021142798,0.0005846458,0.00045270287,0.00023279601],"domain_scores_gemma":[0.9980392,0.00046941647,0.00020251433,0.0005890034,0.00056883873,0.0001310817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433989,0.00094567897,0.0005705539,0.0012228703,0.0012350713,0.0032699257,0.0017169662,0.0013956751,0.015019494],"category_scores_gemma":[0.0034724541,0.00054959994,0.0013322002,0.0012712107,0.0032793449,0.0082340455,0.002689309,0.0026838304,0.0025436492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047541656,0.000015609634,0.00021473721,0.000105528896,0.00001410755,0.00029488772,0.000585075,0.0033345984,0.002507649,0.98049647,0.0014771775,0.010906644],"study_design_scores_gemma":[0.000024879166,0.000054014607,0.00016335392,0.000093698975,0.000032130916,0.0002983703,0.00032628266,0.014785057,0.00544205,0.87338567,0.10536139,0.000033149023],"about_ca_topic_score_codex":0.0017134675,"about_ca_topic_score_gemma":0.0013815094,"teacher_disagreement_score":0.015019494,"about_ca_system_score_codex":0.0014837402,"about_ca_system_score_gemma":0.0012257198,"threshold_uncertainty_score":0.050245225},"labels":[],"label_agreement":null},{"id":"W2940631072","doi":"10.3233/fi-2019-1804","title":"Satisfiability Calculus: An Abstract Formulation of Semantic Proof Systems","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Proof theory; Calculus (dental); Structural proof theory; Satisfiability; Mathematics; Relation (database); Logical consequence; Propositional calculus; Computer science; Proof assistant; Algebra over a field; Algorithm; Discrete mathematics; Mathematical proof; Pure mathematics; Artificial intelligence","score_opus":0.021861521427186437,"score_gpt":0.2605556761897468,"score_spread":0.23869415476256034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940631072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035638986,0.003317526,0.95826644,0.0037170353,0.0004091647,0.00009933632,0.00023081676,0.0003661106,0.030029595],"genre_scores_gemma":[0.30989188,0.0064789527,0.662771,0.002266819,0.0020085163,0.00055167655,0.00065975304,0.0003328389,0.015038656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957151,0.0015338416,0.0002783782,0.0005819444,0.0015846415,0.00030607966],"domain_scores_gemma":[0.9976216,0.0013668872,0.00020892914,0.00027537512,0.00040678756,0.00012039534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005202503,0.00080473244,0.00097295165,0.0026132304,0.0017065573,0.0061787874,0.0025587403,0.0026139922,0.0037347192],"category_scores_gemma":[0.006695444,0.00079264067,0.0020138628,0.002594653,0.008534573,0.008872181,0.002868881,0.004814354,0.00090096204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032563134,0.0000035361816,0.000014815291,0.000022931126,0.0000045322927,0.000019630535,0.000066009554,0.0011505209,0.00011988028,0.9961133,0.00038023462,0.0021013026],"study_design_scores_gemma":[0.000014989499,0.000006344647,0.000019655483,0.000024748693,0.000008686166,0.000030904845,0.00002101432,0.008175599,0.00022816718,0.9765885,0.014873864,0.000007664477],"about_ca_topic_score_codex":0.0031770032,"about_ca_topic_score_gemma":0.0018006766,"teacher_disagreement_score":0.0061787874,"about_ca_system_score_codex":0.0030712965,"about_ca_system_score_gemma":0.003810993,"threshold_uncertainty_score":0.027513802},"labels":[],"label_agreement":null},{"id":"W2953124043","doi":"10.3233/fi-2011-617","title":"Pseudopower Avoidance","year":2012,"lang":"en","type":"preprint","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Alphabet; Mathematics; Sigma; Involution (esoterism); Combinatorics; Complementarity (molecular biology); Existential quantification; Discrete mathematics; Combinatorics on words; Word (group theory); Pure mathematics; Algorithm; Genetics; Physics; Biology; Linguistics; Philosophy","score_opus":0.023289971238546123,"score_gpt":0.2659659113730139,"score_spread":0.24267594013446778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953124043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1996761,0.0028928502,0.6825038,0.0012602116,0.0007850728,0.00012391897,0.00023268246,0.00065688684,0.111868456],"genre_scores_gemma":[0.9125825,0.0014763046,0.052355397,0.00062286656,0.00053399033,0.00014237536,0.0002637539,0.0002583992,0.031764377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00017431502,0.000040793824,0.00018761739,0.00031598195,0.00015013057],"domain_scores_gemma":[0.9979583,0.00088374777,0.00023901377,0.00043362824,0.00030153204,0.00018375891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065999257,0.000508855,0.0005925283,0.0008476648,0.0009954083,0.0011233403,0.0010401966,0.0009932923,0.0064954534],"category_scores_gemma":[0.0034469508,0.00025005537,0.00083362893,0.00061078614,0.0022367863,0.0026350804,0.001899389,0.0010302543,0.0012127016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000951604,0.000032500255,0.0005390628,0.00013887399,0.000020607495,0.0005242,0.00023118567,0.008997684,0.009533012,0.94644177,0.0020762922,0.031369604],"study_design_scores_gemma":[0.000030196314,0.00017938725,0.00043980003,0.000049587714,0.000022297048,0.0013150807,0.000116214775,0.065078415,0.007610911,0.9023033,0.022799985,0.00005479367],"about_ca_topic_score_codex":0.00024777727,"about_ca_topic_score_gemma":0.00020692952,"teacher_disagreement_score":0.0064954534,"about_ca_system_score_codex":0.00040552948,"about_ca_system_score_gemma":0.0004810136,"threshold_uncertainty_score":0.02172941},"labels":[],"label_agreement":null},{"id":"W2989980706","doi":"10.3233/fi-2020-1875","title":"Insertions Yielding Equivalent Double Occurrence Words","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Symbol (formal); Palindrome; Mathematics; Computer science; Arithmetic; Characterization (materials science); Combinatorics; Geometry; Physics","score_opus":0.02152212203726644,"score_gpt":0.2566209218273727,"score_spread":0.23509879979010628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989980706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49082622,0.0005160753,0.4605311,0.00032565786,0.00033123515,0.00018730087,0.0005669173,0.0017395192,0.044976067],"genre_scores_gemma":[0.82874876,0.00032727106,0.15150984,0.00028119428,0.00013430882,0.00021124928,0.0010367616,0.00079996267,0.016950808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984693,0.00024982388,0.0001884051,0.0004656028,0.00035309693,0.00027370514],"domain_scores_gemma":[0.9969408,0.0013985706,0.00035336858,0.00065231894,0.0004697572,0.00018521151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006772423,0.0005921958,0.0005587363,0.000898066,0.0009666,0.0016091197,0.0007258118,0.00088573823,0.007193396],"category_scores_gemma":[0.0050955135,0.0005236926,0.0010293291,0.0006490942,0.0014897847,0.0025006498,0.0024220287,0.00097238447,0.0020439355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050423236,0.00018619398,0.0031380947,0.00046403095,0.00004757671,0.0040538106,0.0022781407,0.0059831645,0.07947075,0.80012804,0.0033965798,0.100349486],"study_design_scores_gemma":[0.00010188635,0.00033123998,0.0015477365,0.0001136061,0.00012326885,0.0045387154,0.0008969742,0.026189178,0.08596006,0.81909394,0.06100593,0.00009764239],"about_ca_topic_score_codex":0.00018562534,"about_ca_topic_score_gemma":0.00023862542,"teacher_disagreement_score":0.007193396,"about_ca_system_score_codex":0.0005052899,"about_ca_system_score_gemma":0.00041228923,"threshold_uncertainty_score":0.024064302},"labels":[],"label_agreement":null},{"id":"W2991497250","doi":"10.3233/fi-2020-1877","title":"Word Blending in Formal Languages*","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Word (group theory); Iterated function; Computer science; Binary number; Artificial intelligence; Natural language processing; Mathematics; Arithmetic","score_opus":0.008372549510784335,"score_gpt":0.2555086193009242,"score_spread":0.24713606979013988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991497250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996777,0.00079393387,0.67071545,0.0010535327,0.00012670751,0.000119261014,0.0002227233,0.0006101999,0.02668043],"genre_scores_gemma":[0.88210547,0.00035939767,0.110912204,0.00018082993,0.00012676044,0.00015177677,0.00021066291,0.0001774584,0.0057755588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997982,0.0004866241,0.00022330582,0.0004779165,0.0005107954,0.00031925642],"domain_scores_gemma":[0.99653876,0.001867482,0.00045778102,0.00055436883,0.0003832263,0.0001984827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751638,0.00050153176,0.0005793248,0.001592136,0.0016978387,0.0025455325,0.000942128,0.0010199391,0.003661582],"category_scores_gemma":[0.0047551184,0.00041789876,0.0016073075,0.0011700568,0.005606234,0.008175558,0.0026414555,0.0017991867,0.0005022024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012693933,0.00001044549,0.00015927781,0.00003193605,0.00000415584,0.000059212336,0.0003761083,0.0014754172,0.00092777144,0.9935314,0.00009860412,0.0033129223],"study_design_scores_gemma":[0.000009302578,0.00002144094,0.00009654005,0.000011062498,0.00000565833,0.0000972004,0.000110579254,0.0140978815,0.0014535917,0.9815036,0.002575413,0.000017698841],"about_ca_topic_score_codex":0.0010644413,"about_ca_topic_score_gemma":0.0005920739,"teacher_disagreement_score":0.003661582,"about_ca_system_score_codex":0.0019291259,"about_ca_system_score_gemma":0.0007271113,"threshold_uncertainty_score":0.01399678},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15670553710809962,"score_gpt":0.32620302013973473,"score_spread":0.16949748303163512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006592704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072550853,0.0002728366,0.9911389,0.00012509778,0.000028235705,0.00006716006,0.000101008394,0.00004476923,0.00096689456],"genre_scores_gemma":[0.11958431,0.00143291,0.87372416,0.0003009271,0.00023241072,0.0009749857,0.001105458,0.00017658396,0.0024683352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9709943,0.019343881,0.0011344268,0.0033846628,0.004467936,0.0006748113],"domain_scores_gemma":[0.93476933,0.049330767,0.004640115,0.004620524,0.0057083964,0.00093090057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02120677,0.0019492287,0.0017452262,0.003085814,0.0012822376,0.0038857665,0.0026116522,0.0012697852,0.004547141],"category_scores_gemma":[0.07836735,0.0010624775,0.002027476,0.0039830795,0.0060948343,0.0075401366,0.0064703124,0.0037777796,0.0011847764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017860568,0.00007461799,0.0011086817,0.000391803,0.00015322988,0.00017324764,0.0006884152,0.067491725,0.001556363,0.8539834,0.0013963999,0.07280351],"study_design_scores_gemma":[0.000026087877,0.00019247894,0.0006188259,0.0001354965,0.000029701458,0.00014945981,0.00014588637,0.2100849,0.00089244574,0.784223,0.0034406849,0.00006096163],"about_ca_topic_score_codex":0.001922675,"about_ca_topic_score_gemma":0.0011703689,"teacher_disagreement_score":0.02120677,"about_ca_system_score_codex":0.001690009,"about_ca_system_score_gemma":0.00288968,"threshold_uncertainty_score":0.11215341},"labels":[],"label_agreement":null},{"id":"W3023908378","doi":"","title":"Characterizing DNA Bond Shapes Using Trajectories","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Set (abstract data type); DNA computing; Extension (predicate logic); DNA; Bond; Rotation (mathematics); Mathematics; Algorithm; Computer science; Geometry; Biology; Genetics; Programming language; Computation","score_opus":0.036337564022386935,"score_gpt":0.2591193400557657,"score_spread":0.22278177603337876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023908378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08938747,0.00047028114,0.9030325,0.00039579326,0.000060883573,0.000105818,0.00051858986,0.0005081614,0.00552061],"genre_scores_gemma":[0.6722053,0.001061316,0.31864032,0.0002003216,0.00011506234,0.00041465825,0.0011954282,0.0003975908,0.0057699755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977443,0.0004475286,0.00024520766,0.00073652965,0.0006184966,0.00020785692],"domain_scores_gemma":[0.9916026,0.0043662624,0.0015899211,0.00120913,0.0009388769,0.00029316536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165979,0.00095157913,0.0006508674,0.0025177596,0.0012230474,0.0025061008,0.001714742,0.0014182694,0.0033242602],"category_scores_gemma":[0.011931323,0.0005613907,0.0016523596,0.002219205,0.004529218,0.007858208,0.0021494871,0.001508667,0.00064648513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011300539,0.000047066704,0.0021140305,0.00017231825,0.000034466113,0.00032850588,0.00065521715,0.1360558,0.014133935,0.8162025,0.00059632206,0.029546764],"study_design_scores_gemma":[0.00001642594,0.00007374504,0.0003583616,0.000061462524,0.000025791454,0.00025782565,0.00021192976,0.25830787,0.015437582,0.7172006,0.007986099,0.00006229862],"about_ca_topic_score_codex":0.0024683434,"about_ca_topic_score_gemma":0.0011919128,"teacher_disagreement_score":0.0033242602,"about_ca_system_score_codex":0.0017431913,"about_ca_system_score_gemma":0.0009076535,"threshold_uncertainty_score":0.012647867},"labels":[],"label_agreement":null},{"id":"W3091761631","doi":"10.3233/fi-2020-1956","title":"Algebraic Structure of Step Traces and Interval Traces","year":2020,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Algebraic number; Algebraic structure; Quotient; Mathematics; Algebra over a field; Interval arithmetic; Semantics (computer science); Subject (documents); Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Programming language","score_opus":0.024982280232024416,"score_gpt":0.26311614310968523,"score_spread":0.2381338628776608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091761631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1333617,0.0011074607,0.8030435,0.0010023363,0.0002220236,0.00020776548,0.0009068023,0.0006756298,0.05947284],"genre_scores_gemma":[0.85315144,0.0012957916,0.12036265,0.00035362778,0.00034400102,0.00033385406,0.0010147992,0.0001797706,0.0229642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979394,0.00038029393,0.00021137457,0.0004330644,0.0007805998,0.00025520456],"domain_scores_gemma":[0.99633765,0.0010648129,0.0004412232,0.00049753865,0.0013649401,0.0002938184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014848391,0.00048241817,0.00035945553,0.002095183,0.0009961749,0.0031013063,0.0008046696,0.0007229325,0.008475552],"category_scores_gemma":[0.004981849,0.00035990903,0.0009177077,0.0019246442,0.0035404626,0.0064270217,0.002903452,0.0021047606,0.0011405298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020786694,0.000012586144,0.00023083008,0.00003525965,0.0000055260093,0.000085061016,0.00025939633,0.000681231,0.0006695967,0.9912525,0.00025867228,0.0064884936],"study_design_scores_gemma":[0.000020525156,0.00006417951,0.00031593547,0.000030171239,0.000018569248,0.00023115105,0.00021486879,0.00807505,0.0019075046,0.9751032,0.013996628,0.000022186785],"about_ca_topic_score_codex":0.0013695459,"about_ca_topic_score_gemma":0.0007876581,"teacher_disagreement_score":0.008475552,"about_ca_system_score_codex":0.0008922538,"about_ca_system_score_gemma":0.00118016,"threshold_uncertainty_score":0.028353512},"labels":[],"label_agreement":null},{"id":"W3115014921","doi":"10.3233/fi-2020-1981","title":"Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means","year":2020,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computation; Dimension (graph theory); Mathematics; Theoretical computer science; Discrete mathematics; Graph; Topology (electrical circuits); Computer science; Algorithm; Combinatorics","score_opus":0.022566294091324015,"score_gpt":0.26055473670548457,"score_spread":0.23798844261416055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115014921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03896563,0.00011750889,0.9581547,0.0001279243,0.000021013404,0.000040223047,0.00017153478,0.0008011489,0.0016002399],"genre_scores_gemma":[0.31202558,0.00015238943,0.6855394,0.000048216698,0.000048948586,0.0001053901,0.0005261079,0.00018570099,0.0013682214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00013463438,0.00006537651,0.0002208209,0.00022315492,0.000105309235],"domain_scores_gemma":[0.9966048,0.001893787,0.00022786413,0.0008706291,0.00026338515,0.00013955343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073832297,0.0006488826,0.0008465125,0.0017969811,0.00067360897,0.002231354,0.0012991577,0.0005697884,0.0026180819],"category_scores_gemma":[0.004155338,0.00043215358,0.0011877493,0.0012972419,0.0013596928,0.0039131544,0.0026973176,0.0013878451,0.0006535794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005129676,0.0001555764,0.0074425493,0.00059066707,0.0001284046,0.00024764164,0.0008333097,0.12712666,0.032651935,0.4165306,0.0054783844,0.40830135],"study_design_scores_gemma":[0.000036245972,0.00010020469,0.0015261209,0.000036194368,0.00003311173,0.00022225257,0.0001724012,0.44570652,0.021639287,0.52333075,0.007136569,0.000060282684],"about_ca_topic_score_codex":0.0006651918,"about_ca_topic_score_gemma":0.0014291812,"teacher_disagreement_score":0.0026180819,"about_ca_system_score_codex":0.0011183982,"about_ca_system_score_gemma":0.0009923748,"threshold_uncertainty_score":0.0087583065},"labels":[],"label_agreement":null},{"id":"W3207836044","doi":"10.3233/fi-2015-1174","title":"Preface","year":2015,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.11964299628767443,"score_gpt":0.2810622904625816,"score_spread":0.16141929417490714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207836044","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020029678,0.010150629,0.0069101104,0.034293655,0.10337994,0.00048286925,0.01150753,0.0016611259,0.82961124],"genre_scores_gemma":[0.0095575,0.005786913,0.0036017564,0.0069243275,0.014322591,0.00028923998,0.0101457825,0.00093653717,0.94843537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853015,0.00021807301,0.00011486259,0.00034566456,0.0006271234,0.00016410822],"domain_scores_gemma":[0.99638665,0.0005286283,0.00014536642,0.00045688447,0.0018541042,0.0006283127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001636257,0.0010776252,0.0008981559,0.002256813,0.0030158882,0.0050712554,0.0017926628,0.0021008113,0.48258582],"category_scores_gemma":[0.009138417,0.0003935471,0.0008070486,0.0020517283,0.000978957,0.004176643,0.0031587384,0.003271026,0.3402331],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003778517,0.0000218699,0.00017280225,0.00012876843,0.0000036689632,0.00006622711,0.0001676693,0.00006425769,0.00013436859,0.012616298,0.9385345,0.048051607],"study_design_scores_gemma":[0.0000027206277,0.000011085842,0.00019508849,0.00007603446,0.0000012209617,0.00005827986,0.000081886414,0.000023306175,0.00004939049,0.0018943786,0.99760324,0.0000034277614],"about_ca_topic_score_codex":0.0032755984,"about_ca_topic_score_gemma":0.003953388,"teacher_disagreement_score":0.48258582,"about_ca_system_score_codex":0.002476121,"about_ca_system_score_gemma":0.0029733838,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4229896219","doi":"10.3233/fi-2011-582","title":"Preface","year":2011,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; Queen's University; Universität Wien; Technische Universität Wien; Loughborough University; Friedrich-Schiller-Universität Jena","keywords":"Automaton; Computer science; Cellular automaton; Theoretical computer science; Artificial intelligence","score_opus":0.07323782083805494,"score_gpt":0.21739817564180614,"score_spread":0.1441603548037512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229896219","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002443358,0.01805894,0.010403845,0.057187244,0.2496653,0.0005005868,0.013257936,0.0017437248,0.64673907],"genre_scores_gemma":[0.015104834,0.00893503,0.0036803435,0.010373043,0.041568078,0.00030343034,0.010890447,0.0011295242,0.90801525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899405,0.00014344824,0.00006944594,0.00021982864,0.000476842,0.000096422926],"domain_scores_gemma":[0.9955621,0.00068162405,0.00017781353,0.0003933337,0.0023666578,0.00081862666],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014545372,0.0008472137,0.0006816218,0.0019289898,0.002174248,0.0032957979,0.0012554947,0.0012711672,0.35548067],"category_scores_gemma":[0.010185539,0.0002732255,0.0005121231,0.0015317029,0.0006651249,0.0031392602,0.0021623126,0.0031707047,0.23367119],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035765443,0.000017582026,0.00012451086,0.00011995969,0.000002688483,0.000056643494,0.00010930331,0.00008769954,0.0001975326,0.009838674,0.94750804,0.041901615],"study_design_scores_gemma":[0.0000035977353,0.000011674975,0.0002566029,0.00009112095,0.0000013539767,0.00006170551,0.000050994102,0.000031193686,0.0000821367,0.0031693592,0.99623626,0.0000040546443],"about_ca_topic_score_codex":0.00263235,"about_ca_topic_score_gemma":0.0028201593,"teacher_disagreement_score":0.6445193,"about_ca_system_score_codex":0.0021075015,"about_ca_system_score_gemma":0.0019140891,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4231243824","doi":"10.3233/fi-2011-410","title":"Preface","year":2011,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ninth; Selection (genetic algorithm); Computer science; Concurrency; Library science; Operations research; Political science; Artificial intelligence; Mathematics; Programming language; Physics","score_opus":0.11828248351902687,"score_gpt":0.24566814479212484,"score_spread":0.12738566127309797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231243824","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019917276,0.020752357,0.020294271,0.04670467,0.29254267,0.00093550916,0.014326396,0.0027489814,0.59970343],"genre_scores_gemma":[0.010509956,0.015447934,0.008344685,0.010177611,0.053602025,0.00060823007,0.017303001,0.0017406427,0.882266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998628,0.0002181834,0.000117872536,0.00025137077,0.00068390544,0.00010066714],"domain_scores_gemma":[0.99168915,0.0014002926,0.00028197025,0.0007100802,0.0048333365,0.0010851361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022430965,0.0010870628,0.00082853576,0.0030653512,0.0021444866,0.0040787114,0.0013081521,0.0012375902,0.38086832],"category_scores_gemma":[0.016035886,0.0003560158,0.0006086256,0.002209631,0.00073683495,0.003312997,0.0022955048,0.00328264,0.24336793],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003249761,0.000020051388,0.00008531358,0.00013082668,0.0000023007597,0.000034614517,0.000095057614,0.000102259204,0.00016957587,0.0052710515,0.94280297,0.051253594],"study_design_scores_gemma":[0.000003708129,0.00001819437,0.00018525808,0.00013844064,0.0000016072354,0.000049473652,0.00005374346,0.00003714339,0.00007115732,0.0027640108,0.9966724,0.0000048475927],"about_ca_topic_score_codex":0.0028877708,"about_ca_topic_score_gemma":0.002840626,"teacher_disagreement_score":0.38086832,"about_ca_system_score_codex":0.0020369454,"about_ca_system_score_gemma":0.0023565118,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4235671471","doi":"10.3233/fi-2011-375","title":"Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Loop (graph theory); Constraint (computer-aided design); Aggregate (composite); Mathematics; Computer science; Algorithm; Theoretical computer science; Combinatorics; Geometry; Materials science","score_opus":0.2274904078581922,"score_gpt":0.3111795232392483,"score_spread":0.08368911538105611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235671471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10641238,0.00008968186,0.88227516,0.00044824876,0.000033821747,0.00013527152,0.00026057241,0.0007293173,0.009615515],"genre_scores_gemma":[0.7333889,0.00016353687,0.26005474,0.0003741497,0.00007180784,0.00035498184,0.00057338853,0.00025595046,0.004762613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980558,0.00037296498,0.0001492869,0.00031941617,0.00087141205,0.00023116186],"domain_scores_gemma":[0.99540234,0.003015155,0.00037861298,0.0003680148,0.00072866125,0.000107166095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016408437,0.0004835111,0.00036486142,0.0014172812,0.00052617205,0.002011232,0.0010930351,0.00083912,0.0042132563],"category_scores_gemma":[0.008108766,0.00027938694,0.001154813,0.00092133135,0.0018704071,0.005072374,0.001705976,0.001873595,0.00036339654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079507554,0.000096454576,0.0013749194,0.00013134308,0.000023339782,0.00024357399,0.0007204303,0.013512528,0.0066805254,0.9377059,0.0009292879,0.03850219],"study_design_scores_gemma":[0.00003430615,0.000078052195,0.00041003095,0.000033120716,0.000048331935,0.000189617,0.00021805207,0.14882277,0.013257993,0.8326422,0.0042388174,0.00002681077],"about_ca_topic_score_codex":0.0010407447,"about_ca_topic_score_gemma":0.0012429008,"teacher_disagreement_score":0.0042132563,"about_ca_system_score_codex":0.0015693158,"about_ca_system_score_gemma":0.0009315636,"threshold_uncertainty_score":0.01409471},"labels":[],"label_agreement":null},{"id":"W4239475040","doi":"10.3233/fi-2013-821","title":"Preface","year":2013,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Informatics; Computer science; Cognition; Cognitive computing; Computational intelligence; Cognitive science; Set (abstract data type); Information science; Information processing; Artificial intelligence; Perception; Multidisciplinary approach; Connectionism; Data science; Management science; Artificial neural network; Psychology; Engineering; Cognitive psychology","score_opus":0.011618236346921426,"score_gpt":0.21084369010654946,"score_spread":0.19922545375962802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239475040","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010469848,0.023481818,0.0040007546,0.0535157,0.3517508,0.00036510229,0.010590915,0.0018941232,0.5533537],"genre_scores_gemma":[0.005044692,0.015384972,0.002176449,0.012886569,0.07660888,0.00023802578,0.013641142,0.0016001806,0.872419],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813396,0.00022546231,0.00015310594,0.0003630337,0.0009539117,0.00017046517],"domain_scores_gemma":[0.9943153,0.0010470644,0.00028161742,0.00062503753,0.002744459,0.0009864419],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018891403,0.0012980687,0.0013755156,0.0029441619,0.0022530882,0.0077167843,0.0020091764,0.002353065,0.5514882],"category_scores_gemma":[0.011238582,0.00046838744,0.00092725287,0.0030122215,0.00076777546,0.006136763,0.0030435142,0.0034610464,0.38008395],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014782111,0.000009780997,0.000056419463,0.00012152427,0.0000030204392,0.000021744507,0.000038930637,0.00002749749,0.00007225663,0.0024494391,0.9656217,0.0315629],"study_design_scores_gemma":[0.0000028441013,0.000008118658,0.00014416284,0.00009098968,0.0000016964274,0.000036601778,0.000041914987,0.00002039227,0.00003094602,0.0009909037,0.998628,0.0000034536527],"about_ca_topic_score_codex":0.0016588208,"about_ca_topic_score_gemma":0.0021235228,"teacher_disagreement_score":0.44851178,"about_ca_system_score_codex":0.0017470778,"about_ca_system_score_gemma":0.0028066451,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4241187228","doi":"10.3233/fi-2012-645","title":"Preface","year":2012,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Selection (genetic algorithm); Computer science; Artificial intelligence; Humanities; Philosophy","score_opus":0.03373613158797846,"score_gpt":0.2605661795091102,"score_spread":0.22683004792113176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241187228","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000838122,0.017384572,0.005245439,0.045150083,0.43548295,0.0003949038,0.009461577,0.001309507,0.48473284],"genre_scores_gemma":[0.0033616861,0.008736744,0.0022403942,0.0069955634,0.06084961,0.00021359121,0.0075679254,0.000799554,0.9092348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990526,0.00012636337,0.00007435437,0.00012797196,0.0005467649,0.000071992814],"domain_scores_gemma":[0.9943001,0.0009326275,0.0002084143,0.00048432968,0.0032292388,0.00084528065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014746485,0.0008177548,0.00081227487,0.0029617161,0.0017028885,0.0042617666,0.0011382033,0.001175705,0.4508832],"category_scores_gemma":[0.011418517,0.00027773107,0.00047806025,0.002398121,0.0005013735,0.0029149528,0.0018786052,0.0023229094,0.28913137],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012738159,0.000008389328,0.000034140554,0.00007637395,0.0000012658455,0.000015411997,0.000028908053,0.000032727203,0.00006376421,0.0019385141,0.96262014,0.035167523],"study_design_scores_gemma":[0.0000026387463,0.0000078971725,0.00016678368,0.00008208868,0.0000011358874,0.000023452614,0.0000371929,0.000019479761,0.00004037717,0.0012932036,0.99832267,0.0000030414624],"about_ca_topic_score_codex":0.002686885,"about_ca_topic_score_gemma":0.0033442685,"teacher_disagreement_score":0.5491168,"about_ca_system_score_codex":0.0012527198,"about_ca_system_score_gemma":0.0020076442,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4241990274","doi":"10.3233/fi-2016-1329","title":"Preface","year":2016,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.013466555822514437,"score_gpt":0.23943146367987084,"score_spread":0.2259649078573564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241990274","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013237186,0.009608749,0.006028559,0.02025058,0.088825285,0.00037587533,0.009896954,0.0015340635,0.86215615],"genre_scores_gemma":[0.006564622,0.004788504,0.0026867697,0.004475578,0.010361147,0.0001985463,0.007723656,0.00089189544,0.9623093],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886537,0.00016670702,0.00008437351,0.00027265857,0.000496718,0.000114048526],"domain_scores_gemma":[0.9971909,0.00044369846,0.00012108798,0.00037343282,0.0013706398,0.00050023285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012609571,0.0011107483,0.0008499232,0.0020736696,0.0023765473,0.0049893144,0.001635958,0.0017287575,0.5532851],"category_scores_gemma":[0.0078456085,0.00036620584,0.00075096136,0.0020494782,0.0008767801,0.0041438895,0.0028093583,0.0030224938,0.38920838],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034277233,0.000017459695,0.00013150965,0.00013829043,0.0000036422928,0.00005785092,0.00010653277,0.00007090552,0.00013042527,0.011250901,0.93632615,0.051732104],"study_design_scores_gemma":[0.0000030268027,0.000009438615,0.00018537251,0.000080545455,0.0000013146094,0.000052519354,0.000058664664,0.000025984564,0.000052424024,0.0019463295,0.997581,0.0000034284105],"about_ca_topic_score_codex":0.0030021556,"about_ca_topic_score_gemma":0.0036919776,"teacher_disagreement_score":0.5532851,"about_ca_system_score_codex":0.0024405655,"about_ca_system_score_gemma":0.0023760148,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4246123776","doi":"10.3233/fi-2016-1395","title":"Preface","year":2016,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Libera Università di Bolzano; Universität Bremen; Università della Calabria; Marmara Üniversitesi; Uniwersytet Warszawski; Università degli Studi dell'Aquila; Universidade de Lisboa; Universidad Nacional del Sur; Università degli Studi di Genova; Universidad Politécnica de Madrid; Aalto-Yliopisto; Universidade da Coruña; Universität Potsdam; University of Bath; Texas Tech University; Simon Fraser University; Arizona State University; University of Oxford; University of Alberta; Drexel University","keywords":"Answer set programming; Computer science; Constraint programming; Stable model semantics; Semantics (computer science); Set (abstract data type); Theoretical computer science; Constraint satisfaction; Logic programming; Constraint satisfaction problem; Programming language; Non-monotonic logic; Mathematics; Artificial intelligence; Operational semantics; Mathematical optimization","score_opus":0.01978046628812696,"score_gpt":0.23929596673903886,"score_spread":0.2195155004509119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246123776","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002302769,0.016232809,0.014397232,0.04758934,0.14404388,0.0005960037,0.015341703,0.0022132655,0.7572831],"genre_scores_gemma":[0.013775221,0.00976388,0.006837551,0.010106989,0.023140248,0.00037852844,0.015908102,0.001442214,0.91864735],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987607,0.00018103472,0.00009707665,0.00028476713,0.00055422063,0.00012223564],"domain_scores_gemma":[0.9958151,0.00074072403,0.00017178101,0.00042629772,0.0021384354,0.0007076982],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015790113,0.001073064,0.00083087437,0.0024893817,0.0024002243,0.004219591,0.0016133039,0.0017119307,0.42582887],"category_scores_gemma":[0.0111018615,0.00034827058,0.00077953434,0.0022110539,0.0008275534,0.004091554,0.0027371242,0.0032683625,0.27645984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040074705,0.000024259318,0.00016522677,0.00013511136,0.0000040189966,0.00007093138,0.00011019205,0.00012281808,0.0001632548,0.012412701,0.9309248,0.05582659],"study_design_scores_gemma":[0.000003927855,0.00001063025,0.00021715727,0.00009689827,0.000001716753,0.0000661191,0.000055309312,0.000041754953,0.00007346269,0.0035805912,0.99584794,0.0000045695156],"about_ca_topic_score_codex":0.0035932355,"about_ca_topic_score_gemma":0.0042934725,"teacher_disagreement_score":0.5741711,"about_ca_system_score_codex":0.0028938376,"about_ca_system_score_gemma":0.002733373,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4249396061","doi":"10.3233/fi-2009-156","title":"Swarm Intelligence","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Slime Mold and Myxomycetes Research","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Arthritis Network; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Swarm behaviour; Swarm intelligence; Computer science; Artificial intelligence; Machine learning; Particle swarm optimization","score_opus":0.01349837988432514,"score_gpt":0.24801808892972113,"score_spread":0.23451970904539599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249396061","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005112168,0.17419001,0.20621128,0.022590602,0.027125359,0.00041061811,0.0038835153,0.003570894,0.55690557],"genre_scores_gemma":[0.1352272,0.19750047,0.14617684,0.0065366705,0.017140234,0.00084546633,0.012188855,0.0014168738,0.4829674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985563,0.00034736012,0.0001538035,0.00022301686,0.00065264857,0.00006687922],"domain_scores_gemma":[0.9986797,0.0005375216,0.00009725122,0.00027680182,0.0003269358,0.00008180671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011704392,0.0011576766,0.0012172717,0.002065142,0.0008567411,0.0048189135,0.0013838052,0.0018189438,0.057242744],"category_scores_gemma":[0.0039842506,0.00040120233,0.0007866413,0.0025742843,0.0010812089,0.0034781264,0.0018501185,0.0014929184,0.018119872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052661057,0.000039543906,0.0005209546,0.0013276237,0.00011495181,0.00017779542,0.00029375902,0.0062773745,0.0012322202,0.1618166,0.34023812,0.48790833],"study_design_scores_gemma":[0.000009212983,0.000027619702,0.00027239582,0.00026196524,0.000015208514,0.00023666472,0.000084126914,0.0026871786,0.0003385405,0.05427253,0.9417754,0.000019244937],"about_ca_topic_score_codex":0.0007286064,"about_ca_topic_score_gemma":0.00071097317,"teacher_disagreement_score":0.057242744,"about_ca_system_score_codex":0.00096944656,"about_ca_system_score_gemma":0.0012548591,"threshold_uncertainty_score":0.19149607},"labels":[],"label_agreement":null},{"id":"W4252475047","doi":"10.3233/fi-2009-201","title":"Special Issue on Stringology","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Musicology and Musical Analysis","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.026362307145834048,"score_gpt":0.23979830580178843,"score_spread":0.2134359986559544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252475047","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010642643,0.035221934,0.0062855408,0.051573947,0.5959292,0.000087562905,0.0007902763,0.0004837549,0.30856353],"genre_scores_gemma":[0.009253236,0.016334167,0.0016299578,0.008973472,0.37712926,0.00012450822,0.0012321215,0.00062734546,0.584696],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987268,0.00026318312,0.000097093536,0.00025997852,0.0005440196,0.000108928914],"domain_scores_gemma":[0.99793684,0.00056792726,0.00012403165,0.00038439027,0.000582881,0.00040380642],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014726712,0.0015057729,0.0021769903,0.0049483026,0.0026198095,0.0068314727,0.001513101,0.003926513,0.12653172],"category_scores_gemma":[0.0045408923,0.00041485048,0.0012030625,0.003666531,0.0016507264,0.0064130966,0.0032478124,0.004013195,0.049223743],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023060542,0.000026539281,0.00008827533,0.00020872253,0.000010748537,0.000045820358,0.000046337133,0.00007553492,0.00015814725,0.04211212,0.92389476,0.033309784],"study_design_scores_gemma":[0.000007285681,0.000024908439,0.00028596297,0.00011497495,0.000008512716,0.000102380865,0.000041654555,0.00015479924,0.000077256445,0.028181516,0.9709937,0.0000070865867],"about_ca_topic_score_codex":0.0005748837,"about_ca_topic_score_gemma":0.0013232109,"teacher_disagreement_score":0.8734683,"about_ca_system_score_codex":0.0017343509,"about_ca_system_score_gemma":0.0014641483,"threshold_uncertainty_score":0.4232908},"labels":[],"label_agreement":null},{"id":"W4297251947","doi":"10.3233/fi-222128","title":"Gathering over Meeting Nodes in Infinite Grid*","year":2022,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Grid; Robot; Distributed computing; Upper and lower bounds; Distributed algorithm; Theoretical computer science; Mathematics; Computer network; Artificial intelligence","score_opus":0.01786361352679732,"score_gpt":0.25010612691852246,"score_spread":0.23224251339172514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297251947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18967177,0.00045789708,0.79791963,0.0005519297,0.00007291377,0.00009577198,0.00023735891,0.0004078533,0.010584939],"genre_scores_gemma":[0.83166504,0.0003118831,0.16169205,0.00006557268,0.000022307579,0.00013631233,0.0005364056,0.00008080738,0.0054895906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994293,0.00024252672,0.000026639103,0.00010358281,0.00008732419,0.00011060857],"domain_scores_gemma":[0.99847,0.0009925073,0.00020189563,0.00013042412,0.0000893035,0.00011589965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007812626,0.0004434936,0.0007295676,0.000433886,0.0009077685,0.0009320594,0.0010307014,0.0006900734,0.0020480715],"category_scores_gemma":[0.0028888036,0.00030132913,0.00066346367,0.00082764094,0.0010494691,0.0014208095,0.0016939492,0.0007668363,0.00038609284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031982528,0.000055680375,0.0012401871,0.00018448842,0.00003648416,0.0004084254,0.00019892387,0.85784876,0.0038367764,0.11014502,0.002642298,0.023083124],"study_design_scores_gemma":[0.000040736664,0.000058371166,0.0002822267,0.00001290113,0.0000070949823,0.000104853694,0.000119193865,0.8955332,0.0010578951,0.10055227,0.002215748,0.000015526866],"about_ca_topic_score_codex":0.0025409854,"about_ca_topic_score_gemma":0.0021447765,"teacher_disagreement_score":0.0025409854,"about_ca_system_score_codex":0.00075591693,"about_ca_system_score_gemma":0.0006147121,"threshold_uncertainty_score":0.0068514943},"labels":[],"label_agreement":null},{"id":"W4309867048","doi":"10.3233/fi-222164","title":"String Covering: A Survey","year":2023,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"String (physics); Cover (algebra); Superstring theory; Simple (philosophy); Computer science; Field (mathematics); Theoretical computer science; Theoretical physics; Mathematics; Pure mathematics; Physics; Engineering; Epistemology; Supersymmetry; Philosophy","score_opus":0.04640812418772218,"score_gpt":0.2787424031324345,"score_spread":0.2323342789447123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309867048","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01065753,0.88209224,0.036043394,0.0022827408,0.0009900773,0.0000653527,0.00049637485,0.00030324794,0.06706913],"genre_scores_gemma":[0.045732845,0.92056125,0.020884123,0.0009448777,0.0017497158,0.0000805772,0.0011482119,0.00017024681,0.008728161],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999119,0.00015758179,0.000074883515,0.00020500683,0.00035407854,0.00008937842],"domain_scores_gemma":[0.9980386,0.0013684736,0.000104009145,0.0001883885,0.00021736055,0.000083177474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000830948,0.0008535644,0.0010129893,0.0038632425,0.0007679899,0.00245882,0.0011041057,0.0014047461,0.0072006537],"category_scores_gemma":[0.0036171523,0.00060663687,0.0007331116,0.0070515918,0.0011791443,0.005031614,0.0015532261,0.0013548797,0.0032837852],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061781,0.000085224536,0.0014594591,0.0039684796,0.00004198907,0.00020967366,0.00026030105,0.0035908206,0.0016833906,0.13946423,0.022864709,0.8263099],"study_design_scores_gemma":[0.000011893105,0.00013493636,0.0019661144,0.0017292893,0.00004731542,0.0022569513,0.00019908362,0.005355477,0.0028060745,0.09043271,0.8950157,0.000044444612],"about_ca_topic_score_codex":0.00096052163,"about_ca_topic_score_gemma":0.00059434964,"teacher_disagreement_score":0.0072006537,"about_ca_system_score_codex":0.0010927556,"about_ca_system_score_gemma":0.0010484467,"threshold_uncertainty_score":0.024088621},"labels":[],"label_agreement":null},{"id":"W4400914530","doi":"10.3233/fi-242180","title":"Descriptional Complexity of Finite Automata – Selected Highlights","year":2024,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Queen's University","funders":"","keywords":"DFA minimization; Automaton; Deterministic finite automaton; Computer science; Theoretical computer science; Finite-state machine; Nondeterministic finite automaton; Mathematics; Automata theory; Discrete mathematics; Algorithm","score_opus":0.032925345192854935,"score_gpt":0.25028295416166,"score_spread":0.21735760896880507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400914530","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01909687,0.62894857,0.11880321,0.034857884,0.0062960354,0.000179328,0.0013955914,0.00041512182,0.1900074],"genre_scores_gemma":[0.24346367,0.62291473,0.05349491,0.003933532,0.038333055,0.00043957343,0.0030534875,0.00043865925,0.033928372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978829,0.00050663087,0.00014332435,0.00056209514,0.0007599115,0.00014509668],"domain_scores_gemma":[0.99181366,0.006160783,0.00030345062,0.00039395856,0.0010709707,0.00025714646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025854057,0.0011098556,0.001013388,0.0029596696,0.0008924986,0.0061177867,0.0013335801,0.0010925704,0.010270817],"category_scores_gemma":[0.007795787,0.0007935794,0.0009833848,0.006364044,0.0026290757,0.009094607,0.0021488909,0.0038441464,0.0026540528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069794194,0.00011889683,0.0006744009,0.0018501197,0.000057979407,0.00022000258,0.00038833078,0.010694977,0.0011961915,0.7647432,0.053959496,0.16602665],"study_design_scores_gemma":[0.000012911981,0.00005699745,0.0009162569,0.0007822257,0.00001799468,0.0003660199,0.00018736017,0.009298117,0.00079098984,0.79564095,0.19187444,0.000055752076],"about_ca_topic_score_codex":0.003232291,"about_ca_topic_score_gemma":0.001707752,"teacher_disagreement_score":0.010270817,"about_ca_system_score_codex":0.004771489,"about_ca_system_score_gemma":0.0014779451,"threshold_uncertainty_score":0.03461969},"labels":[],"label_agreement":null},{"id":"W4400915596","doi":"10.3233/fi-242188","title":"Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions","year":2024,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Agence Nationale de la Recherche; Canadian Institute of Steel Construction","keywords":"Asynchronous communication; Asynchrony (computer programming); Computer science; Event (particle physics); Session (web analytics); Semantics (computer science); Interpretation (philosophy); Theoretical computer science; Programming language; Computer network; World Wide Web","score_opus":0.01315893395398323,"score_gpt":0.2649347942192118,"score_spread":0.2517758602652286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400915596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013089827,0.00021337612,0.9748635,0.00035295478,0.00019118213,0.00008176192,0.00016259185,0.00037584276,0.010668929],"genre_scores_gemma":[0.5851085,0.0005826442,0.40085867,0.0004762706,0.00057629566,0.0007429641,0.00046489562,0.00053762866,0.010652102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963922,0.001234705,0.00041492944,0.0006248653,0.0010060597,0.0003272226],"domain_scores_gemma":[0.99610764,0.0014219686,0.00043953693,0.0010960198,0.0006710801,0.00026371639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003955289,0.00076312723,0.0005470854,0.0013118515,0.0013573464,0.0041694525,0.0015147806,0.0017023772,0.0045810556],"category_scores_gemma":[0.0063802716,0.0006022987,0.0015401307,0.0013006787,0.0034036054,0.010689688,0.0028454063,0.0034087836,0.00079896173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017615816,0.0000088158195,0.00010913178,0.000025747993,0.0000063387,0.00006263739,0.00037658904,0.0012719653,0.00058189605,0.99311453,0.00028689098,0.0041378303],"study_design_scores_gemma":[0.000028846835,0.00003231062,0.000106562075,0.00003408886,0.000025777745,0.00015500271,0.00016575592,0.010450891,0.0018863279,0.96958095,0.01751418,0.000019176518],"about_ca_topic_score_codex":0.0005959021,"about_ca_topic_score_gemma":0.00040748337,"teacher_disagreement_score":0.0045810556,"about_ca_system_score_codex":0.0012125861,"about_ca_system_score_gemma":0.0010801649,"threshold_uncertainty_score":0.020917833},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Artificial intelligence; Mathematics; Psychology; Social psychology","score_opus":0.008276264063803971,"score_gpt":0.20870670398314867,"score_spread":0.2004304399193447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405644932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068501313,0.00053330825,0.98917216,0.0002925394,0.00005644238,0.000042237123,0.000020126896,0.00011176977,0.0029212178],"genre_scores_gemma":[0.707848,0.0011442071,0.28478092,0.00023586246,0.00020347706,0.00039276516,0.00011514756,0.00006528118,0.0052142735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976164,0.0013201297,0.00012094572,0.0002651652,0.00053673453,0.00014070979],"domain_scores_gemma":[0.99460816,0.00400992,0.0003714943,0.00040385826,0.0004175708,0.00018894838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033650962,0.001109556,0.0015348317,0.000683462,0.00044773752,0.0017133754,0.0015841617,0.0013239168,0.00260134],"category_scores_gemma":[0.010851099,0.00040228132,0.0009909661,0.0006734062,0.0020840068,0.0019701621,0.0018670148,0.0022829508,0.00037393445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009449006,0.00006826509,0.00058696436,0.00015475892,0.00009829104,0.000068603425,0.0001532294,0.7401604,0.00060324284,0.2140011,0.00069189013,0.043318734],"study_design_scores_gemma":[0.000024878262,0.000065070024,0.000058713533,0.000015451935,0.000010165229,0.000016279146,0.000012799309,0.9232623,0.0002109039,0.075013705,0.0013010165,0.000008798825],"about_ca_topic_score_codex":0.002351146,"about_ca_topic_score_gemma":0.0014511931,"teacher_disagreement_score":0.0033650962,"about_ca_system_score_codex":0.0016117478,"about_ca_system_score_gemma":0.0010957646,"threshold_uncertainty_score":0.017796576},"labels":[],"label_agreement":null},{"id":"W4405647501","doi":"10.3233/fun-2008-851-418","title":"Optimization in Discovery of Compound Granules","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Chromatography in Natural Products","field":"Chemistry","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.015408943159910399,"score_gpt":0.2271043987839429,"score_spread":0.2116954556240325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405647501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04345499,0.0009073078,0.9504938,0.00067029457,0.000052414358,0.00011454169,0.00012332932,0.00015265941,0.00403072],"genre_scores_gemma":[0.39942807,0.0009504344,0.59490037,0.0001635365,0.00006563447,0.00029215487,0.00035348517,0.00014500708,0.0037013802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969799,0.00085009495,0.00030258848,0.0007536037,0.0008448352,0.0002689587],"domain_scores_gemma":[0.9945433,0.0034285865,0.00064914546,0.00056118506,0.0006363731,0.00018132827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00499321,0.00092740834,0.002373466,0.0019350933,0.00089917093,0.0041035563,0.0016445256,0.0014656186,0.0024065604],"category_scores_gemma":[0.014394947,0.000771255,0.002034789,0.0019307267,0.002093953,0.0046635577,0.0032914195,0.0015402561,0.00028159987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003277899,0.00009550894,0.0027643733,0.00053633534,0.00024399078,0.00045449048,0.0004744253,0.38527453,0.006126094,0.51346636,0.0023608333,0.087875254],"study_design_scores_gemma":[0.000026702357,0.000082371815,0.0004067709,0.00005650442,0.00004827155,0.00008815237,0.00011694564,0.7529022,0.002601418,0.2405705,0.0030731938,0.000027046402],"about_ca_topic_score_codex":0.0014914888,"about_ca_topic_score_gemma":0.0012047642,"teacher_disagreement_score":0.00499321,"about_ca_system_score_codex":0.0024870716,"about_ca_system_score_gemma":0.001663161,"threshold_uncertainty_score":0.026406944},"labels":[],"label_agreement":null},{"id":"W50022104","doi":"10.3233/fi-2011-418","title":"Preface","year":2011,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Humanities; Volume (thermodynamics); Mathematics; Philosophy; Calculus (dental); Computer science; Physics; Medicine; Quantum mechanics","score_opus":0.11146373631741309,"score_gpt":0.22514433657497257,"score_spread":0.11368060025755948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50022104","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095927663,0.020859534,0.006294817,0.058578398,0.35847133,0.00047938564,0.014130347,0.0019856181,0.53824127],"genre_scores_gemma":[0.0050725657,0.014126337,0.003306654,0.01193801,0.064364694,0.0003290488,0.015121103,0.0014073604,0.88433427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847287,0.00019807069,0.00014468044,0.00023766239,0.000825245,0.00012148161],"domain_scores_gemma":[0.9927205,0.0015089017,0.0003017141,0.00072321465,0.0038062173,0.000939459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020842964,0.00096704677,0.001009536,0.0033737768,0.002071152,0.005290122,0.0016212998,0.001686991,0.49526134],"category_scores_gemma":[0.013255763,0.0003675992,0.0006521664,0.002925121,0.0007569358,0.004335226,0.0023252224,0.0029581771,0.32499307],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016857255,0.000008851369,0.00004438754,0.0001258653,0.0000019823026,0.000020904059,0.00003831243,0.000037776193,0.00007910144,0.0026401116,0.9653357,0.03165011],"study_design_scores_gemma":[0.0000029485445,0.000007514637,0.00013428273,0.000102808226,0.0000014519785,0.000032596712,0.000035581757,0.000019340485,0.000042587493,0.0012834244,0.9983341,0.0000034328186],"about_ca_topic_score_codex":0.0020028595,"about_ca_topic_score_gemma":0.0022732983,"teacher_disagreement_score":0.49526134,"about_ca_system_score_codex":0.0016913925,"about_ca_system_score_gemma":0.0025201498,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null}]}