{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19782142,0.000113494374,0.79011256,0.00023440062,0.00036357838,0.0003466429,0.000025990228,0.00011941866,0.010862529],"genre_scores_gemma":[0.8892636,0.0000047352473,0.11029081,0.00031854314,0.000025323634,0.000009078586,0.00003922717,0.000004971353,0.000043713473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987848,0.00001992344,0.0005193309,0.0001089872,0.0003565787,0.00021042832],"domain_scores_gemma":[0.9991277,0.000042029948,0.00016354099,0.00044628547,0.00010432364,0.00011611862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820259,0.0000987984,0.00021337124,0.000108574684,0.000033539436,0.00006134709,0.000655505,0.00004133343,0.000021726572],"category_scores_gemma":[0.00006226837,0.000083948486,0.000021115891,0.00048444927,0.000033464472,0.0012418608,0.00054982875,0.00011841198,0.00009744281],"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.00015058019,0.0019334725,0.2155956,0.0004707541,0.00008459502,0.00001796905,0.07510878,0.016715938,0.0004874618,0.07605865,0.1551847,0.45819148],"study_design_scores_gemma":[0.0012167834,0.00021547737,0.0020933703,0.000052196905,0.000002861156,0.0000033487652,0.0012749843,0.90560335,0.0021335988,0.0010387634,0.08615928,0.00020600417],"about_ca_topic_score_codex":0.00013999829,"about_ca_topic_score_gemma":0.0000089958185,"teacher_disagreement_score":0.8888874,"about_ca_system_score_codex":0.00004427382,"about_ca_system_score_gemma":0.00009133909,"threshold_uncertainty_score":0.34233198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857865,0.00013834929,0.001419593,0.00006173769,0.00004452348,0.00021134414,0.000016446384,0.00002491883,0.012296583],"genre_scores_gemma":[0.99878365,0.000091371,0.00029496863,0.00025978507,0.000041816635,0.000006207826,0.000088333174,0.0000060278635,0.00042784627],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992824,0.000013396783,0.00022202381,0.0001348019,0.00011394073,0.00023340336],"domain_scores_gemma":[0.9996223,0.000009520144,0.00007798362,0.00016145632,0.00002890879,0.00009987064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012029902,0.00013446536,0.00014487309,0.000021133848,0.00010652717,0.0000384617,0.00011133168,0.000085187516,0.00007145782],"category_scores_gemma":[0.000006462093,0.00008874739,0.00003322084,0.00006073543,0.000104018676,0.00001722974,0.000047679438,0.000070655384,0.000015746758],"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.005487174,0.0027928292,0.4930348,0.0071653607,0.004117574,0.00029354283,0.012493013,0.0076622926,0.32879102,0.02466301,0.010042854,0.103456505],"study_design_scores_gemma":[0.021346029,0.013500766,0.07665423,0.00057488447,0.00048976816,0.0011872165,0.01300112,0.18445638,0.04192637,0.00007152424,0.64212424,0.00466746],"about_ca_topic_score_codex":0.000018847026,"about_ca_topic_score_gemma":0.000008189538,"teacher_disagreement_score":0.6320814,"about_ca_system_score_codex":0.000010321975,"about_ca_system_score_gemma":0.000008025393,"threshold_uncertainty_score":0.36190134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21515073,0.000032083342,0.762154,0.0014417006,0.00018702216,0.00045538275,0.00000583165,0.00021449209,0.020358788],"genre_scores_gemma":[0.9849878,0.000003920359,0.013912957,0.00084792695,0.000017805067,0.00004779543,0.0000066743714,0.0000053000886,0.00016984329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990012,0.0000122032025,0.00031557464,0.00013882683,0.0002373812,0.00029480524],"domain_scores_gemma":[0.99947745,0.000012976368,0.000096359676,0.000304033,0.000041035913,0.00006815013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018060021,0.000121407335,0.00014837239,0.00010466861,0.00007215319,0.00021317118,0.0003663403,0.000048049504,0.000010635489],"category_scores_gemma":[0.0000072702815,0.00009776781,0.000028863751,0.0005153503,0.00003137597,0.0015197487,0.000060310194,0.00015178273,0.00018474116],"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.00012987522,0.0013788226,0.017074913,0.00078038574,0.00019899724,0.00014814272,0.04920606,0.016200168,0.0016379424,0.8436782,0.00483481,0.06473172],"study_design_scores_gemma":[0.04859844,0.005646357,0.14562011,0.0057172617,0.000068480775,0.0020327813,0.009230351,0.13251728,0.060112637,0.026102038,0.557775,0.006579251],"about_ca_topic_score_codex":0.0001767527,"about_ca_topic_score_gemma":0.000095195675,"teacher_disagreement_score":0.8175761,"about_ca_system_score_codex":0.00018023865,"about_ca_system_score_gemma":0.00008023649,"threshold_uncertainty_score":0.39868554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40964752,0.00011840299,0.2211269,0.004980915,0.0006304406,0.0013973425,0.0000033144718,0.00041832155,0.36167684],"genre_scores_gemma":[0.91072464,0.000015345713,0.088129014,0.00080843904,0.000021236932,0.00009330208,0.0000061955657,0.0000038506596,0.00019797408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897814,0.000020984515,0.00033417667,0.00011876846,0.000265287,0.00028266158],"domain_scores_gemma":[0.99942213,0.00004519025,0.00009358598,0.00034260904,0.000028834556,0.000067623856],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019960354,0.00011056128,0.00012747767,0.00013870088,0.00007210312,0.0006152382,0.00057166454,0.00004580515,0.00019379059],"category_scores_gemma":[0.000025129719,0.00008631907,0.000030976567,0.0002889647,0.000033072145,0.0028985064,0.00022101434,0.00010049717,0.001647057],"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.000008321176,0.00036126593,0.025073742,0.00032224177,0.000046659363,0.000007884531,0.043301247,0.0007427738,0.00036572196,0.46498948,0.034789417,0.42999125],"study_design_scores_gemma":[0.0013852093,0.00028758938,0.14136632,0.000108670945,0.0000058472774,0.000046227873,0.0063304217,0.7644591,0.000658801,0.05429635,0.03024694,0.00080856006],"about_ca_topic_score_codex":0.0001537795,"about_ca_topic_score_gemma":0.000018542014,"teacher_disagreement_score":0.7637163,"about_ca_system_score_codex":0.000058923226,"about_ca_system_score_gemma":0.000027187767,"threshold_uncertainty_score":0.99913025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3218025,0.000017368295,0.6748054,0.0003572544,0.00016677153,0.0003458337,0.000009246901,0.000053326756,0.002442314],"genre_scores_gemma":[0.8812908,0.000010367609,0.11765087,0.00095666293,0.0000123752325,0.000040547624,0.000031686242,0.0000022253262,0.0000044701546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990658,0.000020735211,0.00045664317,0.0000836439,0.0002204717,0.00015266736],"domain_scores_gemma":[0.99936783,0.00003922512,0.00015973143,0.00026484588,0.00007303318,0.000095337826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011238417,0.000106100226,0.00014903497,0.0001598355,0.00006176021,0.00039316606,0.000308198,0.000038455128,0.000054566874],"category_scores_gemma":[0.000033193082,0.00008809491,0.0000310691,0.00022742744,0.00003285951,0.0051514725,0.00016598379,0.000054368684,0.0004245997],"study_design_candidate":"design_other","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.000022294857,0.00005741559,0.00242992,0.00012620831,0.000032050102,2.8374822e-7,0.04393191,0.00025416835,0.0005406551,0.019250432,0.0045797876,0.9287749],"study_design_scores_gemma":[0.0010231974,0.0006519904,0.10150287,0.00017086328,0.000023538061,0.000009798444,0.004044927,0.82911694,0.0010245017,0.054230925,0.0076893936,0.0005110226],"about_ca_topic_score_codex":0.00041160357,"about_ca_topic_score_gemma":0.0000028846425,"teacher_disagreement_score":0.92826384,"about_ca_system_score_codex":0.000029208202,"about_ca_system_score_gemma":0.00001285054,"threshold_uncertainty_score":0.5457512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1598993,0.00007590298,0.8348328,0.00008625364,0.000088208486,0.00056045497,0.000031696327,0.000080888225,0.004344498],"genre_scores_gemma":[0.8545311,0.000010609446,0.14435263,0.0009854325,0.000042317744,0.000009872851,0.000043213728,0.0000057741463,0.000019034698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835145,0.000023238488,0.000832814,0.00013493524,0.00031148433,0.00034606046],"domain_scores_gemma":[0.9972539,0.0016057952,0.0005020238,0.00014636814,0.00037408396,0.0001178269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047986445,0.00020884411,0.00033151286,0.0001622613,0.00021830117,0.00019142855,0.0002932222,0.000067865534,0.000005781489],"category_scores_gemma":[0.00023499638,0.00019817574,0.00008311873,0.0002850103,0.0001210356,0.00070704636,0.00016612512,0.00013944646,0.000014762874],"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.000067586996,0.00030013765,0.00070092344,0.00045271975,0.0001908144,0.0000016726314,0.037712358,0.00017891185,0.000020004061,0.10073718,0.00053173513,0.85910594],"study_design_scores_gemma":[0.002582379,0.0008210897,0.0067034494,0.0009979839,0.00009293385,0.00006269432,0.004598484,0.97115743,0.00089163065,0.011439433,0.00022781717,0.0004246444],"about_ca_topic_score_codex":9.4959927e-7,"about_ca_topic_score_gemma":4.1665214e-7,"teacher_disagreement_score":0.97097856,"about_ca_system_score_codex":0.000022298946,"about_ca_system_score_gemma":0.00006955503,"threshold_uncertainty_score":0.8081372},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037800368,0.00005173125,0.7404715,0.0021580947,0.0007282084,0.0010045378,0.00005516884,0.0011537987,0.21657662],"genre_scores_gemma":[0.5548413,0.000011684061,0.43959588,0.0036239736,0.00019348439,0.000036305002,0.00033065438,0.000014475755,0.0013522563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842614,0.000022232269,0.00044207997,0.0002160559,0.00045396545,0.00043951636],"domain_scores_gemma":[0.99893034,0.000028666687,0.00018576355,0.000698482,0.00002937332,0.00012739205],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033808424,0.00019311975,0.0001873035,0.00015185478,0.00020261163,0.000834118,0.001066726,0.000035327725,0.00044371578],"category_scores_gemma":[0.000018908599,0.00017675484,0.00006219386,0.00032993648,0.000047508758,0.004518323,0.00076734554,0.00011842383,0.001084053],"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.000028154573,0.00034970263,0.009235772,0.0002836419,0.00017750134,0.000021559808,0.00903388,0.00046912883,0.000040914412,0.3224774,0.21466665,0.4432157],"study_design_scores_gemma":[0.00066812563,0.000055013184,0.0035477723,0.000035554032,0.00000789856,0.000007817239,0.00017705277,0.6471873,0.00012203078,0.00042653142,0.3474691,0.00029585222],"about_ca_topic_score_codex":0.000028629674,"about_ca_topic_score_gemma":0.000018391625,"teacher_disagreement_score":0.64671814,"about_ca_system_score_codex":0.00008881593,"about_ca_system_score_gemma":0.000028689823,"threshold_uncertainty_score":0.9996937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.771664,0.00013386835,0.19718516,0.00081564736,0.0014650881,0.00082931714,0.00018873956,0.000082428916,0.02763574],"genre_scores_gemma":[0.97899586,0.0000017443299,0.020277444,0.00047762424,0.000017125409,0.000025084337,0.000011589384,0.0000096997,0.0001838496],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944174,0.00022615929,0.0024176973,0.0002975751,0.002244997,0.00039616437],"domain_scores_gemma":[0.9959885,0.0013756861,0.000772172,0.0010699917,0.00048277288,0.00031087283],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0038041251,0.00022329293,0.0006354733,0.0006354201,0.00007116909,0.00024759118,0.0012400672,0.00008576146,0.0011898337],"category_scores_gemma":[0.0038212885,0.00017583618,0.0001338342,0.0013177152,0.00030813264,0.0010049354,0.00032559826,0.00019178983,0.0010589841],"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.00054285495,0.00062476494,0.8558449,0.00009052348,0.00002796758,0.000026837375,0.0122069,0.0052447757,0.00019454726,0.0074417153,0.07907032,0.038683876],"study_design_scores_gemma":[0.007888927,0.00047099736,0.10857764,0.00055618124,0.000028461649,0.000016917993,0.04296709,0.62545884,0.0014847586,0.012761443,0.19878879,0.0009999422],"about_ca_topic_score_codex":0.000095506366,"about_ca_topic_score_gemma":0.00020418252,"teacher_disagreement_score":0.74726725,"about_ca_system_score_codex":0.00018273211,"about_ca_system_score_gemma":0.0003561307,"threshold_uncertainty_score":0.9997232},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035904765,0.00037013335,0.8890097,0.0015796787,0.006297456,0.00042456444,0.000047403762,0.0005632106,0.06580309],"genre_scores_gemma":[0.99424154,0.0000031276813,0.0044402312,0.00066782505,0.00008843864,0.000023478582,0.000027701024,0.0000050490676,0.0005026229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988416,0.00002112197,0.00039457838,0.00012436592,0.00035527037,0.00026307817],"domain_scores_gemma":[0.99912035,0.000018142246,0.00015678685,0.0003950196,0.00010159242,0.00020809236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028603149,0.00012407481,0.00017638571,0.000051049654,0.00008879836,0.0003853036,0.00056625827,0.000036092282,0.000015611995],"category_scores_gemma":[0.000035444795,0.00010832552,0.000041422692,0.00019088275,0.000040184797,0.0016924815,0.00018473718,0.00009058757,0.00047939204],"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.000019213252,0.00034519954,0.0048385393,0.00028345082,0.00009299298,0.00003244542,0.053564675,0.000054397366,0.00015481327,0.5554182,0.14046052,0.24473552],"study_design_scores_gemma":[0.00071768474,0.00009146143,0.0008659576,0.000048663995,0.0000033617603,0.000035144105,0.00060331274,0.016437376,0.00015325527,0.00029203217,0.9805158,0.00023598607],"about_ca_topic_score_codex":0.000014118729,"about_ca_topic_score_gemma":0.0000011131726,"teacher_disagreement_score":0.9583368,"about_ca_system_score_codex":0.0001934739,"about_ca_system_score_gemma":0.00009646817,"threshold_uncertainty_score":0.6161775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011571407,0.000008740927,0.9632296,0.00034904605,0.0000467169,0.0001387389,5.0039e-7,0.00015548883,0.024499785],"genre_scores_gemma":[0.80136776,8.346701e-7,0.19792089,0.0002561613,0.000031376017,0.000024109839,0.000029044719,0.000003821547,0.00036600468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895716,0.0000141813325,0.00029143042,0.00011949235,0.0004052864,0.0002124234],"domain_scores_gemma":[0.99954456,0.00007899568,0.000113402,0.00014621041,0.00006693719,0.00004990974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118679185,0.000108908054,0.00009905733,0.00007482338,0.00017756593,0.00036179702,0.00024091588,0.000020643178,0.00003971625],"category_scores_gemma":[0.000011332895,0.00008335957,0.000021971577,0.00020325588,0.000030441006,0.0009048261,0.000095868425,0.00009360667,0.00017701759],"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.000008853525,0.000024471885,0.00038942517,0.000036632773,0.000011499972,0.0000021190335,0.0007049811,0.32872242,0.000016019667,0.6585971,0.00041973652,0.011066738],"study_design_scores_gemma":[0.00032831,0.00013245111,0.00116893,0.000027991455,0.00000439618,0.0000122804295,0.00011307912,0.9818024,0.00014534146,0.013375322,0.0027436507,0.000145862],"about_ca_topic_score_codex":0.00004809687,"about_ca_topic_score_gemma":0.000002125806,"teacher_disagreement_score":0.78979635,"about_ca_system_score_codex":0.000049888902,"about_ca_system_score_gemma":0.000034770765,"threshold_uncertainty_score":0.3488817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96577495,0.000036913556,0.03316618,0.00011419401,0.00015514376,0.00035617454,0.000028162242,0.00007144569,0.00029680645],"genre_scores_gemma":[0.94571054,0.000006987796,0.053883962,0.00031801948,0.000029250537,0.000016272726,0.000015058522,0.0000063529815,0.000013552058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991347,0.000023780107,0.00032070265,0.00019164507,0.00012116801,0.00020800288],"domain_scores_gemma":[0.99899065,0.000110601046,0.00014866992,0.00052592,0.00007294088,0.0001512367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843516,0.00012922443,0.00018650055,0.000059366794,0.00014252182,0.00024018653,0.00037316585,0.00006389619,0.000016801137],"category_scores_gemma":[0.00005517006,0.00010303616,0.000025605026,0.00007112452,0.000117111806,0.0020745923,0.00018604878,0.0000979036,0.0000020677817],"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.00011735601,0.0002745776,0.00044228078,0.00038861088,0.00003536524,8.654934e-7,0.0073123276,0.000006943855,0.28167185,0.53960365,0.00021166561,0.16993454],"study_design_scores_gemma":[0.0010496202,0.0009798466,0.0061685448,0.000029609546,0.000015064844,0.000039714978,0.0003906882,0.9501228,0.018788956,0.021322241,0.0008379751,0.00025497572],"about_ca_topic_score_codex":0.000012404625,"about_ca_topic_score_gemma":0.00001350856,"teacher_disagreement_score":0.9501158,"about_ca_system_score_codex":0.000006448718,"about_ca_system_score_gemma":0.000027535087,"threshold_uncertainty_score":0.42016926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47882,0.0003470849,0.45006597,0.002882289,0.00034743326,0.0013763623,0.00008982829,0.00061617186,0.06545486],"genre_scores_gemma":[0.9561318,0.0000073511324,0.042563852,0.0006213179,0.000014233108,0.00010145043,0.000031837004,0.0000050685267,0.0005230776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.000019057097,0.0003547233,0.00008523229,0.00022087239,0.0002576642],"domain_scores_gemma":[0.9992477,0.0000843171,0.00013753583,0.00039842783,0.000044554075,0.000087425564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014213721,0.00009938115,0.00012803248,0.000075048854,0.00011363402,0.00018477949,0.00057090167,0.000036975922,0.0005960756],"category_scores_gemma":[0.0000284002,0.00007623602,0.000048654325,0.00020259693,0.000069799724,0.0023017733,0.00021188735,0.00007804128,0.00033625116],"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.0000044052817,0.00057713455,0.0018995418,0.00028585512,0.00011701452,0.0000025142658,0.012484165,0.000028691305,0.016597409,0.3817879,0.19452056,0.3916948],"study_design_scores_gemma":[0.004392972,0.0018154101,0.026883477,0.0008292351,0.000095800715,0.00021811605,0.021942817,0.6625804,0.1327509,0.04376441,0.10225813,0.0024683536],"about_ca_topic_score_codex":0.000026599886,"about_ca_topic_score_gemma":7.830635e-7,"teacher_disagreement_score":0.6625517,"about_ca_system_score_codex":0.000015824051,"about_ca_system_score_gemma":0.000029129742,"threshold_uncertainty_score":0.65266097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031304263,0.0000040758027,0.71822184,0.00010147818,0.00016409799,0.0006896558,0.00001800697,0.00078231684,0.24871424],"genre_scores_gemma":[0.5717153,0.0000036951897,0.42759508,0.00038746116,0.000060593327,0.00005644337,0.000016560256,0.000046845627,0.00011806044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981526,0.00004068454,0.00068288087,0.00016978213,0.00038042484,0.0005736293],"domain_scores_gemma":[0.9987693,0.00033314226,0.00012536638,0.0003912489,0.00009876815,0.00028218675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007819809,0.00027347155,0.00032762467,0.00039402005,0.00015144603,0.0002175888,0.00025774393,0.00006712192,0.0000832939],"category_scores_gemma":[0.00023172685,0.0002569943,0.000045829085,0.0011543923,0.00007717412,0.00033444545,0.00009391862,0.00026365687,0.00032854333],"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.000046073135,0.00010376828,0.020601446,0.0007484017,0.00025345906,0.000010619253,0.005479844,0.71370655,0.00045609797,0.0330214,0.003593711,0.22197863],"study_design_scores_gemma":[0.0013737038,0.00025346357,0.008500695,0.00027842753,0.00007884534,0.000026795506,0.00066235545,0.97545725,0.0019079396,0.00017468802,0.010498654,0.00078720634],"about_ca_topic_score_codex":0.000027701755,"about_ca_topic_score_gemma":0.000027434498,"teacher_disagreement_score":0.540411,"about_ca_system_score_codex":0.00022203544,"about_ca_system_score_gemma":0.000038149155,"threshold_uncertainty_score":0.99998826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019967062,0.000028453152,0.96771824,0.00022936006,0.0003383017,0.0001871121,0.000017398394,0.00013354255,0.011380521],"genre_scores_gemma":[0.9621478,0.00004971291,0.03726471,0.00037889156,0.000019537409,0.0000037144223,0.000050080143,0.0000034693314,0.000082107224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894893,0.000020394276,0.00039136055,0.000112274814,0.0003368133,0.00019019985],"domain_scores_gemma":[0.9991534,0.000038192204,0.00018001387,0.000471287,0.00008175945,0.000075358796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013952471,0.00011934643,0.00016437651,0.00012094181,0.00009339966,0.00011826322,0.00064667955,0.000055429384,0.000024531293],"category_scores_gemma":[0.0000234698,0.0001011676,0.000040479877,0.00034079095,0.000029954099,0.0016932192,0.0001978899,0.00009328814,0.000035590376],"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.000014064544,0.00026146663,0.0014158568,0.00007659846,0.000018989651,0.00000302204,0.0038291996,0.00010425555,0.0008650884,0.84929657,0.004511991,0.13960291],"study_design_scores_gemma":[0.004038208,0.0030477005,0.09090699,0.0004376288,0.000041247404,0.000055593322,0.0018174769,0.4874293,0.04541993,0.18632899,0.17878099,0.0016959604],"about_ca_topic_score_codex":0.000013746678,"about_ca_topic_score_gemma":3.1329103e-7,"teacher_disagreement_score":0.9421807,"about_ca_system_score_codex":0.000045715336,"about_ca_system_score_gemma":0.000046742487,"threshold_uncertainty_score":0.4125495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061014,0.000019287616,0.9678443,0.00016991344,0.0002056505,0.000628794,0.0000021619887,0.00023233015,0.02479618],"genre_scores_gemma":[0.98604,3.7072527e-7,0.013364485,0.000117970885,0.00005280511,0.00007135873,0.00003535739,0.0000061981136,0.00031142865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867016,0.00002234143,0.00040870585,0.00016070472,0.0004596091,0.0002784626],"domain_scores_gemma":[0.99916,0.000044602835,0.00020279195,0.00036563334,0.00012610473,0.00010089593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005372106,0.00012318813,0.000122036254,0.00012687087,0.00024251103,0.00035347015,0.0003493297,0.000046997655,0.000017216349],"category_scores_gemma":[0.0000079771535,0.00008898808,0.000038046644,0.00030052912,0.000058017256,0.001073568,0.00005969911,0.00008211587,0.00022882874],"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.000010683582,0.00006070752,0.0009034903,0.00015840726,0.000026721293,0.00000687009,0.0021801973,0.000060373677,0.00005493683,0.9908765,0.00036893343,0.0052921697],"study_design_scores_gemma":[0.008056109,0.0036973117,0.09804886,0.00047861662,0.00019326723,0.0027533749,0.025479713,0.58686423,0.010780442,0.0108804125,0.2492242,0.00354344],"about_ca_topic_score_codex":0.000029246135,"about_ca_topic_score_gemma":0.00001727946,"teacher_disagreement_score":0.9799961,"about_ca_system_score_codex":0.00015636266,"about_ca_system_score_gemma":0.0000907274,"threshold_uncertainty_score":0.36288285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033008136,0.000030548326,0.90677583,0.004485997,0.00055611995,0.0013400082,0.000016553744,0.00028750658,0.053499278],"genre_scores_gemma":[0.7557779,0.000008256251,0.24012372,0.0031803504,0.000087156615,0.00028541623,0.00006174006,0.000009263656,0.00046617753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880385,0.000023164906,0.00044301132,0.00016195881,0.00023984506,0.00032818745],"domain_scores_gemma":[0.9990558,0.00011240663,0.00015346972,0.00050903414,0.000062070394,0.00010722336],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027085358,0.00013566225,0.00015233552,0.000053344065,0.00020356468,0.0005172253,0.00054097775,0.000061750565,0.000154902],"category_scores_gemma":[0.000051145307,0.00010482715,0.00008279484,0.00017122609,0.000040138762,0.0029269096,0.00020425385,0.00008565025,0.0009462538],"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.000011749631,0.000095017764,0.0027982178,0.00017075767,0.00006992143,8.32281e-7,0.0070505315,0.00019345853,0.000048882837,0.75822675,0.06883744,0.16249646],"study_design_scores_gemma":[0.0017842853,0.0005262711,0.089367814,0.000057835496,0.00002374328,0.000019001394,0.0004814787,0.54762465,0.0003216222,0.19692758,0.16204748,0.000818232],"about_ca_topic_score_codex":0.00003915395,"about_ca_topic_score_gemma":0.0000015543395,"teacher_disagreement_score":0.7227698,"about_ca_system_score_codex":0.00005785176,"about_ca_system_score_gemma":0.000028140958,"threshold_uncertainty_score":0.9998316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22022066,0.00015367795,0.7470119,0.0005561155,0.00022354325,0.0003331067,0.0000048670872,0.0002566577,0.031239465],"genre_scores_gemma":[0.85208577,0.00014343168,0.14558738,0.0014035874,0.00004993636,0.000025315998,0.000007824065,0.000015201082,0.00068156724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982305,0.0000366517,0.00047379587,0.0002671481,0.00055075524,0.00044115045],"domain_scores_gemma":[0.99877316,0.00009133188,0.00017113118,0.0007100866,0.0000750619,0.00017921528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031904344,0.000224529,0.00024540056,0.00018768565,0.00021538221,0.0004826458,0.000603644,0.00006793391,0.000030373883],"category_scores_gemma":[0.000014626543,0.00017674216,0.000034691184,0.00047958022,0.000055724824,0.0028642078,0.00046131606,0.00015569812,0.00010781899],"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.0005274991,0.00075750845,0.014449738,0.0011594811,0.0005066221,0.0006155114,0.12562612,0.17884131,0.0008490559,0.15621664,0.01901379,0.5014367],"study_design_scores_gemma":[0.0009154625,0.0001781303,0.00019693519,0.0001463988,0.000007946913,0.0005686867,0.00029925755,0.97059196,0.00008027349,0.0008114141,0.025890458,0.00031305227],"about_ca_topic_score_codex":0.000039787123,"about_ca_topic_score_gemma":0.000005749607,"teacher_disagreement_score":0.79175067,"about_ca_system_score_codex":0.00008594075,"about_ca_system_score_gemma":0.00004802157,"threshold_uncertainty_score":0.7207336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8768467,0.00005279445,0.08809157,0.00036204743,0.00043162567,0.00035111525,0.000042417425,0.000032922024,0.033788808],"genre_scores_gemma":[0.9554873,0.0000061867318,0.04348887,0.0004069827,0.000029854451,0.000004729141,0.000017697372,0.0000059681975,0.0005524207],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.996863,0.000047121102,0.0013978662,0.00018551206,0.0012911718,0.0002153407],"domain_scores_gemma":[0.99704593,0.0015435853,0.0004955895,0.00043946996,0.00035506103,0.000120383236],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052008852,0.00010826277,0.00022340346,0.00041171513,0.00012760042,0.0002528618,0.0003652811,0.000063747364,0.0016301319],"category_scores_gemma":[0.0022523084,0.000084561594,0.000047840575,0.0005260825,0.00011432863,0.001068432,0.00016277005,0.00008227208,0.0005323985],"study_design_candidate":"design_other","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.00024829572,0.0001573115,0.04274137,0.0000612137,0.000040702722,0.00000357153,0.007922448,0.000086837994,0.0064834147,0.018867513,0.030192725,0.8931946],"study_design_scores_gemma":[0.0035698018,0.00034519177,0.5102243,0.00020671112,0.0000413782,0.0001242894,0.01716682,0.05992238,0.018110681,0.08351715,0.30591622,0.0008551188],"about_ca_topic_score_codex":0.0000073683846,"about_ca_topic_score_gemma":0.000009775677,"teacher_disagreement_score":0.89233947,"about_ca_system_score_codex":0.000036628775,"about_ca_system_score_gemma":0.000043021915,"threshold_uncertainty_score":0.99928254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10276925,0.000024886891,0.8644661,0.00008845705,0.00010509155,0.00019943439,0.0000031174843,0.00004488768,0.032298822],"genre_scores_gemma":[0.7810226,0.000008001644,0.21877916,0.00014207208,0.000008188077,0.0000022736863,0.0000046705395,0.0000031563416,0.000029835604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875337,0.000011716407,0.0005511818,0.00010640067,0.0003646974,0.00021262464],"domain_scores_gemma":[0.99897003,0.00006282988,0.00032096848,0.00048093323,0.00010402685,0.000061185725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063228403,0.00010005387,0.0001953555,0.00013386676,0.000048897455,0.000037744354,0.0004263541,0.000054343964,0.000009528227],"category_scores_gemma":[0.00003903823,0.00008105531,0.000056500565,0.0003258755,0.00006359007,0.00085406937,0.00019708053,0.00007177715,0.000020099991],"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.0001433483,0.0007025369,0.0014389554,0.001356546,0.00008282477,0.0000061244978,0.04745864,0.030716266,0.009447738,0.6867129,0.0020724833,0.2198616],"study_design_scores_gemma":[0.0004188503,0.00014717698,0.0018081868,0.00006446792,0.0000068594504,0.000007253631,0.0008143044,0.97854406,0.011541018,0.0062581487,0.0002535423,0.00013614823],"about_ca_topic_score_codex":0.00001624622,"about_ca_topic_score_gemma":0.0000018228549,"teacher_disagreement_score":0.94782776,"about_ca_system_score_codex":0.000031110892,"about_ca_system_score_gemma":0.000044117074,"threshold_uncertainty_score":0.33053398},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4691753,0.0015068961,0.4546387,0.0027542247,0.00087806047,0.0018093657,0.000082282815,0.0008159043,0.068339266],"genre_scores_gemma":[0.96648586,0.00006388088,0.032715484,0.00029920822,0.00009312552,0.000031412423,0.0000634871,0.0000091054335,0.00023846715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998795,0.000028587574,0.00038833288,0.00015451074,0.00029869258,0.00033491515],"domain_scores_gemma":[0.9991832,0.00011282332,0.00010277271,0.00049647747,0.000024950781,0.00007981793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026241297,0.0001438036,0.00013564178,0.00004661697,0.0007175284,0.0008141992,0.0007152876,0.000040332856,0.000009313734],"category_scores_gemma":[0.0000039072934,0.000091115595,0.00003086275,0.0001176707,0.00009497559,0.0014143357,0.0008832684,0.00015000936,0.000042725376],"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.000068620415,0.00039438147,0.024196543,0.00023104559,0.00008788493,0.000032255633,0.004744041,0.0014969232,0.0057836287,0.49035537,0.028986514,0.4436228],"study_design_scores_gemma":[0.0014794433,0.0003194015,0.053195372,0.00018141136,0.00001884508,0.00012011813,0.0005702108,0.5100512,0.0008948502,0.017011946,0.41541162,0.0007455581],"about_ca_topic_score_codex":0.00012089423,"about_ca_topic_score_gemma":0.000015975631,"teacher_disagreement_score":0.5085543,"about_ca_system_score_codex":0.00004098706,"about_ca_system_score_gemma":0.000019522593,"threshold_uncertainty_score":0.78513414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9504839,0.000041638406,0.034252662,0.00023173304,0.00011781429,0.00014804563,0.000009960465,0.00004269778,0.014671512],"genre_scores_gemma":[0.98448956,0.0000024661556,0.013873241,0.0012430347,0.000086741726,0.000010000813,0.00014815255,0.0000064032874,0.00014037137],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993435,0.000013425833,0.0002276481,0.00011544958,0.00009340686,0.00020655581],"domain_scores_gemma":[0.9996548,0.000011530573,0.00006519348,0.00017329534,0.00002529498,0.00006987163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011813251,0.00010456451,0.00008365609,0.000032431235,0.00013659232,0.00004115778,0.00013423053,0.00008798722,0.000089383495],"category_scores_gemma":[0.000058922287,0.00008530946,0.00007589712,0.00007750713,0.000052962863,0.0000070402148,0.000058382713,0.00007825644,0.00015304895],"study_design_candidate":"bench_or_experimental","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.0004633095,0.001142961,0.04384431,0.00032301384,0.00045039316,0.000021962747,0.0018510962,0.17505583,0.70930725,0.016659046,0.015628891,0.035251964],"study_design_scores_gemma":[0.01054079,0.0041066185,0.031831156,0.00032484074,0.00012252804,0.000081610684,0.0021515626,0.014531811,0.40663514,0.0033880903,0.5238247,0.0024611682],"about_ca_topic_score_codex":0.000004247229,"about_ca_topic_score_gemma":0.0000031518375,"teacher_disagreement_score":0.5081958,"about_ca_system_score_codex":0.000030430781,"about_ca_system_score_gemma":0.000060224353,"threshold_uncertainty_score":0.34788188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28674594,0.0001756447,0.63371754,0.00035843576,0.00065584626,0.00053975626,0.000023217075,0.0005142406,0.077269405],"genre_scores_gemma":[0.65901995,0.00009482821,0.3387782,0.0015665761,0.000047083035,0.00003326493,0.000023333027,0.000013739556,0.0004230359],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990521,0.0000170534,0.00030756704,0.00017504221,0.0001929462,0.0002552734],"domain_scores_gemma":[0.99909997,0.00003151542,0.00010851957,0.00057648367,0.000032345994,0.00015116156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020022619,0.00013179821,0.000133403,0.000087609704,0.00013219481,0.00017566457,0.0005881523,0.00005179878,0.00010589114],"category_scores_gemma":[0.000011695767,0.000108267086,0.000028098797,0.00014477539,0.000058633887,0.001828538,0.00069470255,0.00010901952,0.00017058762],"study_design_candidate":"design_other","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.00008987086,0.0004216173,0.014979713,0.0003691515,0.000118469885,0.00011398076,0.051775374,0.000003040607,0.00084045477,0.297991,0.036342926,0.5969544],"study_design_scores_gemma":[0.007036255,0.002344778,0.1497464,0.0008699483,0.00009005928,0.0010940296,0.0041673873,0.20334278,0.04267928,0.12798198,0.45676225,0.003884856],"about_ca_topic_score_codex":0.000035468824,"about_ca_topic_score_gemma":0.0000012752096,"teacher_disagreement_score":0.59306955,"about_ca_system_score_codex":0.00002251261,"about_ca_system_score_gemma":0.000026929634,"threshold_uncertainty_score":0.44150037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026001967,0.00016460253,0.9480133,0.00085312926,0.0035652253,0.0010430655,0.00041617316,0.00016742745,0.019775122],"genre_scores_gemma":[0.56009525,0.000093124334,0.43458945,0.0027092742,0.000558063,0.00029618142,0.0001699679,0.000045359717,0.0014433694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984716,0.000039317176,0.00063384493,0.0001954945,0.00042819005,0.00023153587],"domain_scores_gemma":[0.9971436,0.000039751572,0.00061228307,0.0020243635,0.00011220527,0.00006777428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002831434,0.00020635551,0.0002971672,0.00007842098,0.00012359192,0.00008361912,0.001509012,0.0000980962,0.000064380845],"category_scores_gemma":[0.000052252424,0.00013307469,0.0001422883,0.00019101884,0.00020817172,0.00064771395,0.004642189,0.00026827614,0.000106448526],"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.000018294075,0.00015549157,0.0014804181,0.0029270437,0.00025701555,0.00000503915,0.013312406,0.00028543506,0.00008312471,0.9063316,0.050624754,0.024519356],"study_design_scores_gemma":[0.00063099427,0.000121158446,0.0017418262,0.0014388192,0.00003268162,0.00003299608,0.0005616487,0.02806606,0.0069579505,0.009978165,0.94972277,0.0007149176],"about_ca_topic_score_codex":0.000050962324,"about_ca_topic_score_gemma":0.00000771341,"teacher_disagreement_score":0.89909804,"about_ca_system_score_codex":0.00006135698,"about_ca_system_score_gemma":0.00019029982,"threshold_uncertainty_score":0.5786156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985636,0.00006154774,0.013395396,0.00022651452,0.000069529764,0.00023469415,0.000044849083,0.0000219997,0.00030949307],"genre_scores_gemma":[0.98187876,0.00009427071,0.017866658,0.00009622404,0.0000033459617,0.0000052110577,0.000012382982,0.0000028480301,0.00004029097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888235,0.000052127638,0.0005883736,0.00007171229,0.00027801568,0.00012744726],"domain_scores_gemma":[0.99909323,0.00014522918,0.00023824417,0.00035126583,0.00013412378,0.00003789667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044924885,0.00008170673,0.00018368888,0.0000637494,0.00014957755,0.00003180852,0.00039307322,0.000015802401,0.000012998478],"category_scores_gemma":[0.00003964096,0.00005807372,0.000032242457,0.00017881063,0.00044780655,0.0007096348,0.00019627904,0.000055255274,0.0000035546227],"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.00017283203,0.00043133687,0.0038173466,0.00056231534,0.00025311872,0.0000029570867,0.060311552,0.0009582615,0.012711004,0.90754855,0.0019876463,0.011243085],"study_design_scores_gemma":[0.0042462028,0.0011192292,0.047790926,0.00019849095,0.000030457804,0.00003200144,0.0031312204,0.8376162,0.05613612,0.04844951,0.0008591126,0.00039050076],"about_ca_topic_score_codex":0.00022393325,"about_ca_topic_score_gemma":0.000026674506,"teacher_disagreement_score":0.85909903,"about_ca_system_score_codex":0.000021917791,"about_ca_system_score_gemma":0.00006913815,"threshold_uncertainty_score":0.23681776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026599398,0.0000070837878,0.9345371,0.0038550633,0.00017212109,0.00054806983,0.0000070653673,0.00029756624,0.033976503],"genre_scores_gemma":[0.93941313,0.0000011355256,0.05608811,0.0042084754,0.00001749521,0.000108590844,0.000017106064,0.0000052261767,0.00014073777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986726,0.00005930233,0.00042091616,0.00021413348,0.00035132788,0.00028172295],"domain_scores_gemma":[0.9987113,0.00015198455,0.0001293434,0.00073881075,0.00011992776,0.00014865813],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003441011,0.00015805023,0.00014704735,0.000079354395,0.00013916889,0.0004224129,0.0006657443,0.00006396408,0.00027983706],"category_scores_gemma":[0.00008279803,0.00012882789,0.000051009087,0.00020931294,0.00006665905,0.0011435742,0.00009602639,0.00019464978,0.0022119384],"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.000033579174,0.0006803102,0.0032817074,0.00021350135,0.000035182824,0.0000014593269,0.0024292443,0.0014542179,0.00041106224,0.6626674,0.011369164,0.3174232],"study_design_scores_gemma":[0.00033185264,0.00016876639,0.0057308376,0.000031492324,0.0000034333261,0.0000018843234,0.00005124936,0.98375267,0.00017190685,0.007812045,0.0017738271,0.00017001989],"about_ca_topic_score_codex":0.000055580076,"about_ca_topic_score_gemma":0.0000027913395,"teacher_disagreement_score":0.9822985,"about_ca_system_score_codex":0.00009151002,"about_ca_system_score_gemma":0.00007904216,"threshold_uncertainty_score":0.99856496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014347459,0.00025475989,0.9547266,0.0017224442,0.00029581948,0.00030239718,0.0000028464865,0.00021872723,0.028128942],"genre_scores_gemma":[0.9729052,0.000015443436,0.025876047,0.00058824214,0.000088017456,0.000016272348,0.0000070592255,0.0000042922397,0.000499427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913675,0.000020641832,0.00028550863,0.00011421315,0.00023344213,0.0002094491],"domain_scores_gemma":[0.999376,0.00006466388,0.00009888909,0.00031146713,0.0000471093,0.000101861704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028138762,0.00011063495,0.00011707714,0.00006180076,0.00019720595,0.00021679679,0.00029474593,0.000051526193,0.000053963482],"category_scores_gemma":[0.000029338033,0.00007790409,0.00003463033,0.00011248392,0.000048577964,0.0010463133,0.00023972041,0.00009748134,0.00026643267],"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.0000019687113,0.000053857006,0.0017709526,0.000041375737,0.000028905853,0.0000012017615,0.00853741,0.00006589603,0.00010618215,0.93492943,0.0056597586,0.04880306],"study_design_scores_gemma":[0.00043939066,0.000067567715,0.001305656,0.000013847267,0.000004970226,0.000041489344,0.00074151723,0.07727617,0.0005536609,0.009817199,0.9095099,0.00022865403],"about_ca_topic_score_codex":0.000004989333,"about_ca_topic_score_gemma":0.0000037634622,"teacher_disagreement_score":0.9585577,"about_ca_system_score_codex":0.00003727726,"about_ca_system_score_gemma":0.00003565168,"threshold_uncertainty_score":0.3424542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11587607,0.000074794974,0.79204124,0.00037565024,0.00023407652,0.00038562148,0.000014285863,0.00025663245,0.09074161],"genre_scores_gemma":[0.9790637,0.000023155488,0.018364333,0.00239692,0.00004281296,0.0000047129424,0.00001728773,0.0000032230503,0.00008383999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.000025528332,0.00072102295,0.00009416144,0.00034936282,0.00033445153],"domain_scores_gemma":[0.99877995,0.00027007246,0.00032123408,0.0003193787,0.00019355786,0.00011578124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033303734,0.00016671408,0.00025297404,0.00018143072,0.00009858449,0.00013043325,0.00057557604,0.00005330749,0.000042046322],"category_scores_gemma":[0.00011783104,0.0001484829,0.00009007354,0.00054154266,0.00005931713,0.0008617809,0.00023030005,0.00017611728,0.0002006238],"study_design_candidate":"design_other","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.00004374376,0.0002377326,0.00057403854,0.00007983173,0.00006959508,0.000004869186,0.011745725,0.00011860901,0.000027726988,0.037449352,0.0041745408,0.9454742],"study_design_scores_gemma":[0.008380412,0.0045389845,0.033580583,0.0025990608,0.00013363766,0.00025083547,0.0047794976,0.88659316,0.009775269,0.018681146,0.028706994,0.001980431],"about_ca_topic_score_codex":0.0000023981797,"about_ca_topic_score_gemma":4.0529565e-7,"teacher_disagreement_score":0.9434938,"about_ca_system_score_codex":0.000030946663,"about_ca_system_score_gemma":0.000059840742,"threshold_uncertainty_score":0.6054957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062660393,0.000035045752,0.9552984,0.00012925359,0.0006627993,0.00038687626,0.000014020244,0.0007784965,0.036429044],"genre_scores_gemma":[0.2961221,0.0000094271445,0.7020909,0.0015176226,0.00004818085,0.000045774028,0.00005023573,0.000013294628,0.000102448445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984992,0.00004155832,0.0004317111,0.0002178613,0.0004295523,0.00038007274],"domain_scores_gemma":[0.9985622,0.000053823307,0.0001808813,0.00093900965,0.000059075253,0.00020497883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023247422,0.00019616817,0.00018906409,0.00013239481,0.00024114459,0.00021483067,0.001278912,0.000076169184,0.0002801978],"category_scores_gemma":[0.000012431379,0.00015373691,0.000073509436,0.0002586793,0.000042832253,0.0017882143,0.00058629067,0.00016551735,0.0006550656],"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.0002755629,0.0037785566,0.013569129,0.0010985091,0.00030116955,0.0001425446,0.035028055,0.00018518888,0.00088257034,0.2831717,0.09996286,0.56160414],"study_design_scores_gemma":[0.0018895017,0.0003714121,0.0064359386,0.00014309154,0.000018760398,0.000022776921,0.00019254592,0.79388416,0.0073210876,0.0029628577,0.1861156,0.00064228225],"about_ca_topic_score_codex":0.000035563855,"about_ca_topic_score_gemma":0.000001263792,"teacher_disagreement_score":0.79369897,"about_ca_system_score_codex":0.000055937046,"about_ca_system_score_gemma":0.00007597244,"threshold_uncertainty_score":0.8419761},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044494674,0.00004493361,0.9525392,0.00054688327,0.00037400893,0.0006253374,0.000028686049,0.00016770643,0.001178586],"genre_scores_gemma":[0.5428582,0.0000046696687,0.45576644,0.0011848246,0.000069540394,0.000017293205,0.000042923344,0.0000051487514,0.000050979303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983318,0.000025004616,0.00058149,0.00027399446,0.00030068296,0.00048705383],"domain_scores_gemma":[0.99904156,0.00016736383,0.00016347396,0.00046114475,0.000051864576,0.00011457677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036930334,0.00019664198,0.00024099016,0.0001616616,0.00020258315,0.00036632165,0.0008625237,0.00006730699,0.000013157172],"category_scores_gemma":[0.000051013547,0.00016574313,0.0000716581,0.000248187,0.000038760383,0.0020037026,0.0002801082,0.00014027042,0.00005828126],"study_design_candidate":"design_other","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.000027534936,0.00017969377,0.001891144,0.000054351032,0.000012309364,0.000011822465,0.0047008153,0.0008093731,0.00028655925,0.0043193377,0.0014560168,0.98625106],"study_design_scores_gemma":[0.0012953626,0.00022970348,0.007494742,0.00009784119,0.0000025053434,0.00001762364,0.00029598636,0.98156136,0.00059506873,0.001179316,0.006972005,0.0002584802],"about_ca_topic_score_codex":0.000035253863,"about_ca_topic_score_gemma":0.000005910141,"teacher_disagreement_score":0.98599255,"about_ca_system_score_codex":0.00008155261,"about_ca_system_score_gemma":0.000043547447,"threshold_uncertainty_score":0.67588085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5773094,0.000028361499,0.1814404,0.016175767,0.000437777,0.0024202047,0.00006325977,0.00019923807,0.22192556],"genre_scores_gemma":[0.9902735,0.000001804754,0.0049093734,0.0047028237,0.000010142151,0.00006146237,0.000015322024,0.0000028851766,0.000022702137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889207,0.0001391565,0.00038033418,0.00010051472,0.00028840415,0.00019953976],"domain_scores_gemma":[0.9989123,0.0003050206,0.0001339893,0.00057029125,0.000036217196,0.00004220262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069647067,0.00010437252,0.00013068228,0.000073497074,0.000074806994,0.00015428154,0.0005856852,0.000041495186,0.0003447448],"category_scores_gemma":[0.000046243327,0.00006265267,0.00005165837,0.000257748,0.00006265369,0.00073756167,0.00012522435,0.00011975841,0.00027591333],"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.00003940917,0.00035454752,0.00320599,0.00019788784,0.00002422358,0.0000030331664,0.011695304,0.0024294623,0.000057331607,0.9150577,0.012754549,0.054180562],"study_design_scores_gemma":[0.0013004345,0.00070340093,0.078625165,0.00022631633,0.000008773843,0.00000558959,0.0023558664,0.80884165,0.0010763124,0.10214928,0.004273542,0.00043366058],"about_ca_topic_score_codex":0.00006449465,"about_ca_topic_score_gemma":0.0000023400726,"teacher_disagreement_score":0.8129084,"about_ca_system_score_codex":0.000048112637,"about_ca_system_score_gemma":0.0000316823,"threshold_uncertainty_score":0.3774714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98824114,0.00008671354,0.0022967274,0.000016742955,0.000038606388,0.000080950835,0.00004372548,0.000012944072,0.009182481],"genre_scores_gemma":[0.99742746,0.0000032149674,0.0015269956,0.00022815916,0.000065919594,0.000003268281,0.0005570884,0.000003567034,0.00018431299],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923766,0.0000163865,0.00032619608,0.00009879408,0.00011065842,0.00021033078],"domain_scores_gemma":[0.99959886,0.000010845872,0.00013147868,0.00019900707,0.000026443973,0.00003338849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011619597,0.00010284921,0.00017841998,0.000086731,0.000052828713,0.000024025954,0.0001618576,0.00007810565,0.000102353384],"category_scores_gemma":[0.00002150943,0.00007614493,0.00015420449,0.00021318255,0.00006163119,0.000008389458,0.0001375849,0.00004344357,0.000005912719],"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.00026170135,0.00020356342,0.078380674,0.0001489007,0.001649458,0.000004668207,0.00064331864,0.0026873865,0.88233393,0.0071298433,0.0045335386,0.022023024],"study_design_scores_gemma":[0.0016859036,0.001082468,0.4136734,0.000026728694,0.00078914245,0.000015296506,0.0020184699,0.008534556,0.53495246,0.00050957146,0.03588553,0.000826507],"about_ca_topic_score_codex":0.00005879279,"about_ca_topic_score_gemma":0.00004013759,"teacher_disagreement_score":0.34738147,"about_ca_system_score_codex":0.000007684574,"about_ca_system_score_gemma":0.00001293401,"threshold_uncertainty_score":0.31051},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10537922,0.000046353438,0.88339645,0.00059593504,0.00010013613,0.00046912127,0.000022104572,0.00022376582,0.009766915],"genre_scores_gemma":[0.8979328,0.0000074436352,0.101320766,0.00045638118,0.000037604,0.00008484429,0.000014123743,0.000004466358,0.00014156483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994206,0.000008334497,0.0001750394,0.00011539961,0.00012008601,0.00016058589],"domain_scores_gemma":[0.9993623,0.00008602269,0.00008003105,0.000365757,0.00002687162,0.0000790228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006371306,0.00010923128,0.000092164824,0.0000523829,0.00024816304,0.00020482088,0.0002848064,0.000033814056,0.00003236362],"category_scores_gemma":[0.000008814778,0.00006988932,0.00001587863,0.00012296917,0.00013819797,0.0010502859,0.00013250981,0.0001577455,0.000023492476],"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.0000021704234,0.00000775374,0.0013445633,0.000018940756,0.000012052278,2.6317392e-7,0.002450826,0.00003267136,0.000092772425,0.9650582,0.00005979407,0.030919991],"study_design_scores_gemma":[0.0021030323,0.00036995663,0.07181369,0.00004731788,0.000034286917,0.0002888224,0.0072476673,0.04587956,0.002981265,0.5157206,0.35220426,0.0013095686],"about_ca_topic_score_codex":0.0000042190277,"about_ca_topic_score_gemma":0.000013115304,"teacher_disagreement_score":0.7925536,"about_ca_system_score_codex":0.000007566493,"about_ca_system_score_gemma":0.000021972564,"threshold_uncertainty_score":0.28500035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23362257,0.000081343605,0.75592816,0.00029506045,0.000021476788,0.00041371505,0.0000016818285,0.00008250907,0.009553514],"genre_scores_gemma":[0.96510535,0.0000075364924,0.034402434,0.00038429024,0.000001283139,0.000068292116,0.0000028332056,0.000003337775,0.00002461467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921,0.000034761055,0.00035745534,0.000118807584,0.00010153658,0.00017744649],"domain_scores_gemma":[0.9994519,0.00009901068,0.00011527817,0.0002510335,0.000035215664,0.000047582907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431883,0.000085960935,0.00015522246,0.00017733836,0.000015971942,0.0001346208,0.00039109544,0.000050398932,0.000011241249],"category_scores_gemma":[0.000049557624,0.00008019992,0.0000121428275,0.00027168848,0.00015388669,0.0019439448,0.0002585546,0.00008661021,0.00003496288],"study_design_candidate":"design_other","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.000024839463,0.00017679246,0.019937223,0.00031308035,0.0000075049884,0.0000029142113,0.0048777196,0.000031503117,0.0014863351,0.09595075,0.0005069022,0.8766844],"study_design_scores_gemma":[0.002591917,0.0004478175,0.1018648,0.00056711934,0.00000814146,0.00011084007,0.0024088563,0.35579085,0.051810324,0.47976857,0.0037669623,0.000863782],"about_ca_topic_score_codex":0.00015628574,"about_ca_topic_score_gemma":0.000022778515,"teacher_disagreement_score":0.87582064,"about_ca_system_score_codex":0.000049576924,"about_ca_system_score_gemma":0.00005100073,"threshold_uncertainty_score":0.32704577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044115376,0.00018395249,0.94731057,0.00021263206,0.00048669885,0.00042179387,0.000010017386,0.00017960227,0.0070793857],"genre_scores_gemma":[0.5015795,0.0000395834,0.49766642,0.00060123805,0.000035388948,0.000032359643,0.000008027585,0.000012149565,0.000025314746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974666,0.00003441155,0.0006441593,0.0002619861,0.000748929,0.00084386434],"domain_scores_gemma":[0.9977899,0.0004023909,0.00019664963,0.0011003913,0.000081120015,0.00042953997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062488706,0.0003157593,0.00030291855,0.0001654634,0.00041094024,0.0004659497,0.0011835657,0.00009576776,0.00014172104],"category_scores_gemma":[0.000052871892,0.00021024258,0.00010744523,0.0004756554,0.00011192668,0.002545046,0.0005633847,0.00024243537,0.0013551738],"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.00012251393,0.0011902432,0.0086031845,0.00008959818,0.00021295313,0.00003320059,0.022980604,0.17635798,0.0000064885057,0.38473698,0.005619074,0.40004718],"study_design_scores_gemma":[0.0009252253,0.00016535506,0.0012667443,0.00012653427,0.000022294787,0.00007853642,0.00024544532,0.9764056,0.00002947959,0.009901117,0.010407629,0.0004260079],"about_ca_topic_score_codex":0.000021787275,"about_ca_topic_score_gemma":0.000007538802,"teacher_disagreement_score":0.80004764,"about_ca_system_score_codex":0.000119523735,"about_ca_system_score_gemma":0.00007026147,"threshold_uncertainty_score":0.9994224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2269834,0.000019412239,0.7168291,0.0002910085,0.0002630449,0.00025682434,0.000027229558,0.0002535706,0.05507641],"genre_scores_gemma":[0.9279596,0.0000028485342,0.07128171,0.000708993,0.000011764966,0.000007354517,0.000009769099,0.000003906473,0.0000140561115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990312,0.000031870957,0.00041667165,0.000101833706,0.00021825562,0.0002001747],"domain_scores_gemma":[0.99924815,0.000031374504,0.00014953584,0.000461547,0.00003788898,0.00007152784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828,0.00010714135,0.00017575751,0.00009520011,0.000072981675,0.00004121562,0.0006648705,0.000033621807,0.00035603187],"category_scores_gemma":[0.000007189779,0.00009434686,0.00007067362,0.00019762556,0.00017323105,0.0010550515,0.00015448047,0.000072494084,0.00018431996],"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.000017181728,0.00013684909,0.00016242954,0.00011584878,0.00003498853,0.000002572379,0.02143325,0.0000043369464,0.00073307095,0.9614336,0.0006122714,0.015313588],"study_design_scores_gemma":[0.0031187248,0.0012405749,0.04878751,0.00033264857,0.000056162855,0.00014830731,0.0041981814,0.32690054,0.059604667,0.5462902,0.008063998,0.0012584915],"about_ca_topic_score_codex":0.000048326427,"about_ca_topic_score_gemma":0.000002721139,"teacher_disagreement_score":0.7009762,"about_ca_system_score_codex":0.000023699467,"about_ca_system_score_gemma":0.000022593058,"threshold_uncertainty_score":0.38982993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004103047,0.000020695088,0.9880195,0.0012032067,0.00013211287,0.0002174641,0.00005497897,0.00076906255,0.0054799155],"genre_scores_gemma":[0.36790988,0.00001936909,0.62827426,0.0024890355,0.000047653153,0.000024607252,0.00083956344,0.0000064178703,0.00038924228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998546,0.000050706596,0.0004897123,0.00023666416,0.00040200053,0.00027490128],"domain_scores_gemma":[0.99869394,0.0001538878,0.00023550933,0.00074359844,0.00006864288,0.00010441702],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002382674,0.0001625923,0.0001608457,0.00013561902,0.00021589108,0.00024465896,0.00081607007,0.000052327752,0.00014087952],"category_scores_gemma":[0.00016575785,0.00015624454,0.000047166093,0.00027604116,0.000048058297,0.0030468248,0.00022474807,0.00026092076,0.000837977],"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.000028631795,0.00047491223,0.008075081,0.00002962369,0.00007904951,0.000009298775,0.004922016,0.0004591991,0.0058870283,0.68504846,0.04554539,0.24944133],"study_design_scores_gemma":[0.0012195433,0.00020606643,0.09642136,0.00009613608,0.000013591072,0.000011424345,0.00028513887,0.5409125,0.007944359,0.0034128823,0.34885344,0.0006235428],"about_ca_topic_score_codex":0.000023721337,"about_ca_topic_score_gemma":0.000002414229,"teacher_disagreement_score":0.68163556,"about_ca_system_score_codex":0.00010683467,"about_ca_system_score_gemma":0.000064384934,"threshold_uncertainty_score":0.99994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29669866,0.00032174843,0.65360343,0.00078590144,0.00040720173,0.00082250073,0.000036536087,0.00065038307,0.0466736],"genre_scores_gemma":[0.96379364,0.000071569426,0.035188936,0.00041372637,0.000034092685,0.00004076862,0.000035496905,0.000008485119,0.00041330018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987138,0.000021563148,0.00054332963,0.00014401434,0.00032657618,0.00025075316],"domain_scores_gemma":[0.99874234,0.000055934637,0.00019377381,0.0008506923,0.000048406997,0.00010882521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656726,0.00013274606,0.00024686957,0.000093966235,0.00016058644,0.000060647057,0.0009493083,0.000046606285,0.000120569726],"category_scores_gemma":[0.0000149063435,0.00012270822,0.00009507722,0.00034742238,0.00012283056,0.00071102334,0.00028298146,0.00008705287,0.0006217335],"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.000022728795,0.0013389733,0.0030882994,0.0007268337,0.00026513063,0.000085693224,0.023275767,0.00011776663,0.02516149,0.6143495,0.076053225,0.25551462],"study_design_scores_gemma":[0.002297318,0.00031269138,0.0056000375,0.00010122178,0.000035756657,0.0003294597,0.0002607884,0.15051828,0.054487016,0.0019509639,0.7833418,0.00076464965],"about_ca_topic_score_codex":0.00002051855,"about_ca_topic_score_gemma":6.210191e-7,"teacher_disagreement_score":0.7072886,"about_ca_system_score_codex":0.000030100842,"about_ca_system_score_gemma":0.00008645575,"threshold_uncertainty_score":0.79913336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26900506,0.00006177877,0.6423065,0.0006585402,0.00017736472,0.0012989223,0.000025183668,0.0007207728,0.085745856],"genre_scores_gemma":[0.47916394,0.0000023208586,0.52009445,0.00058147294,0.000003618651,0.0000672079,0.0000138237465,0.000010004503,0.00006315809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809134,0.0000346666,0.0007251611,0.00023478041,0.0004494243,0.00046464827],"domain_scores_gemma":[0.99871343,0.000051819734,0.0002406827,0.00074145134,0.00011935337,0.00013328157],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040922724,0.00021551474,0.0003017969,0.00023141268,0.00009119703,0.0014414511,0.0013729177,0.000076552606,0.00008966199],"category_scores_gemma":[0.000081743834,0.00019281807,0.000085708976,0.0009523033,0.00025610506,0.0044919774,0.00063757907,0.00019236213,0.00024842276],"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.000047114576,0.0030802349,0.024286611,0.0022902316,0.00016465127,0.000019308716,0.07575471,0.00083814596,0.00043686703,0.095138125,0.037687976,0.76025605],"study_design_scores_gemma":[0.0006076416,0.00023068419,0.003637585,0.00014802415,0.0000052012456,0.000026778493,0.00037946348,0.9745401,0.0015587901,0.016320815,0.002150701,0.00039422183],"about_ca_topic_score_codex":0.00010212435,"about_ca_topic_score_gemma":0.0000012156885,"teacher_disagreement_score":0.97370195,"about_ca_system_score_codex":0.00006570462,"about_ca_system_score_gemma":0.00012595278,"threshold_uncertainty_score":0.99959517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924439,0.000013743278,0.0027644057,0.00005921142,0.00014762247,0.00029401673,0.0000061361457,0.000039351595,0.0042315996],"genre_scores_gemma":[0.9942101,0.000007651527,0.0055471063,0.000082142666,0.000009155936,0.000016049475,0.000008202053,0.000008537688,0.000111007685],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806476,0.00004408105,0.00079903967,0.00018084302,0.0005955148,0.00031577714],"domain_scores_gemma":[0.99908555,0.0002000769,0.0002818064,0.00031446214,0.000007495868,0.00011061272],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027716087,0.00016115677,0.00031443016,0.00017021758,0.000075747885,0.000039936025,0.0003218855,0.00009972249,0.003967926],"category_scores_gemma":[0.00010812966,0.00013047138,0.000061979066,0.00068202044,0.00016487532,0.00031268646,0.00018591277,0.0001966721,0.0013825388],"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.00002875519,0.0012286109,0.7654996,0.00004114102,0.000011499938,0.0000016705782,0.005265353,0.009099679,0.00544009,0.000045873785,0.0053516766,0.20798606],"study_design_scores_gemma":[0.00062656903,0.0002877915,0.20500137,0.000042983735,0.000009827927,0.0000015939136,0.00021011605,0.7889846,0.0022084168,0.00012501565,0.002321227,0.00018052528],"about_ca_topic_score_codex":0.000082309336,"about_ca_topic_score_gemma":0.000054876826,"teacher_disagreement_score":0.7798849,"about_ca_system_score_codex":0.00039639132,"about_ca_system_score_gemma":0.0000023923028,"threshold_uncertainty_score":0.999395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53443193,0.00010908168,0.07752853,0.013415667,0.0020751897,0.003932374,0.000035505927,0.00087684067,0.36759487],"genre_scores_gemma":[0.99598426,0.00002922682,0.0007562251,0.00056435954,0.00022128724,0.00023966131,0.00034541462,0.0000067420287,0.0018528178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986808,0.000042385527,0.0004528417,0.00007141961,0.00039392794,0.00035862648],"domain_scores_gemma":[0.9991764,0.00010138996,0.0002734973,0.00009974874,0.00029937105,0.000049580376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058753707,0.000101954654,0.00011222638,0.00014392841,0.00081994955,0.00040622367,0.00015223492,0.000078692225,0.00030455808],"category_scores_gemma":[0.00019588029,0.000101895406,0.000050138395,0.00039495583,0.000062900246,0.0029625045,0.000009499162,0.00010908238,0.00027114997],"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.000042563483,0.0001139947,0.027643768,0.00008628018,0.000019627121,2.6527562e-8,0.05179246,0.0014693805,0.000026084082,0.8619821,0.029407337,0.027416384],"study_design_scores_gemma":[0.00047838752,0.00005519108,0.008420959,0.000008402284,0.0000088787965,2.1251775e-7,0.030254109,0.0007106316,0.00009004535,0.0071892184,0.9526211,0.00016289139],"about_ca_topic_score_codex":0.00011183367,"about_ca_topic_score_gemma":0.00018721465,"teacher_disagreement_score":0.9232137,"about_ca_system_score_codex":0.00038658924,"about_ca_system_score_gemma":0.0003784041,"threshold_uncertainty_score":0.6306472},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65651757,0.00015878906,0.3201168,0.0016870513,0.00014544008,0.00034758568,0.000103339255,0.000430693,0.02049272],"genre_scores_gemma":[0.94927686,0.000014466723,0.049298942,0.0010022789,0.00009626436,0.000012343185,0.000097560616,0.0000037636435,0.00019752969],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978598,0.000054405646,0.0005495991,0.00032523688,0.0006676669,0.0005433266],"domain_scores_gemma":[0.9987235,0.000080581434,0.00016495981,0.00074349536,0.00006002361,0.0002274624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122631,0.00022031055,0.00038151455,0.00022842016,0.00034050172,0.000743189,0.0016437883,0.00008788518,0.00007748392],"category_scores_gemma":[0.00007455304,0.00017040622,0.00014011552,0.0013798682,0.000115583636,0.0018472888,0.00032092596,0.0002582877,0.00031913858],"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.00005451402,0.0009651137,0.11693088,0.00012994536,0.00034731094,0.000040984945,0.028068552,0.00183566,0.00004546638,0.028193397,0.03557144,0.7878167],"study_design_scores_gemma":[0.0035321463,0.0023674285,0.72296405,0.00018550354,0.00030430788,0.00010672571,0.0050043077,0.14472234,0.00078694656,0.0070465486,0.109956406,0.0030232891],"about_ca_topic_score_codex":0.00007452283,"about_ca_topic_score_gemma":0.0000017464039,"teacher_disagreement_score":0.78479344,"about_ca_system_score_codex":0.000070006754,"about_ca_system_score_gemma":0.000038254333,"threshold_uncertainty_score":0.7166589},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00436182,0.000022285694,0.98628354,0.00016604572,0.00003596681,0.00041425397,0.0000055002856,0.000058088117,0.00865248],"genre_scores_gemma":[0.45411697,0.0000094317365,0.54507697,0.0007152457,0.000010274518,0.00004913114,0.0000065617637,0.0000031736179,0.000012255365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880135,0.00016180266,0.00049835857,0.00013780915,0.00017907559,0.00022159031],"domain_scores_gemma":[0.9990804,0.0001348048,0.000118476506,0.00057364226,0.000023127703,0.00006953297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091134314,0.00010716281,0.00020303659,0.00008783091,0.00004462699,0.00008985889,0.0007015443,0.000053804837,0.00011916296],"category_scores_gemma":[0.000011367018,0.00009005457,0.000035119265,0.00033705842,0.0000395686,0.0011487142,0.00003267287,0.0000851757,0.00010979732],"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.000030419758,0.00012719168,0.0006568247,0.000028398332,0.000012816047,9.808024e-7,0.0040870635,0.01178236,0.0002721324,0.0138786305,0.00027688872,0.9688463],"study_design_scores_gemma":[0.0007992778,0.00024655333,0.0037495089,0.000010477665,0.0000048992197,0.00000622452,0.00010406433,0.98015636,0.000561117,0.0060734963,0.00814049,0.00014752318],"about_ca_topic_score_codex":0.000057969675,"about_ca_topic_score_gemma":0.0000019502857,"teacher_disagreement_score":0.9686988,"about_ca_system_score_codex":0.000040279352,"about_ca_system_score_gemma":0.0000323113,"threshold_uncertainty_score":0.36723188},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04219209,0.00021973933,0.57080585,0.00869406,0.0010580749,0.0012536155,0.000034279936,0.0009134671,0.37482882],"genre_scores_gemma":[0.81783074,0.00011886084,0.16332848,0.018002843,0.0001088816,0.00003816179,0.000038488215,0.000010410234,0.0005231422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981783,0.000017674092,0.0005580483,0.00023203478,0.0004895284,0.0005243861],"domain_scores_gemma":[0.9985048,0.00012960666,0.00011625591,0.00094544643,0.00006228382,0.00024159187],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002500523,0.00021950001,0.00024499185,0.00013058778,0.00028193922,0.0005963932,0.001356121,0.00008557597,0.00019449998],"category_scores_gemma":[0.00005823675,0.00017507665,0.00011561174,0.00050347624,0.000035971116,0.0018270763,0.00026978573,0.0001812632,0.0013742885],"study_design_candidate":"design_other","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.000014102296,0.00019546883,0.00026779962,0.000010271049,0.000024893887,0.000017233493,0.003527809,0.00066118507,0.000046675057,0.16978355,0.027703414,0.7977476],"study_design_scores_gemma":[0.00281386,0.0010054302,0.020554483,0.00017624881,0.000029351202,0.00015031462,0.00060650456,0.44199497,0.00042168805,0.086241394,0.44474974,0.0012560048],"about_ca_topic_score_codex":0.000008996675,"about_ca_topic_score_gemma":0.0000020582388,"teacher_disagreement_score":0.79649156,"about_ca_system_score_codex":0.000091073845,"about_ca_system_score_gemma":0.00005067483,"threshold_uncertainty_score":0.99940324},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035009176,0.00018692377,0.44649455,0.002025526,0.0004715801,0.0005183627,0.000009293831,0.00064594595,0.51463866],"genre_scores_gemma":[0.8709465,0.000016384653,0.12580718,0.0023164502,0.00014398698,0.000021552594,0.000085816515,0.000009156184,0.0006529383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987843,0.000024964973,0.0004527501,0.00015088332,0.0003061553,0.00028095528],"domain_scores_gemma":[0.99920195,0.000046254507,0.00015062741,0.00050624646,0.000036816968,0.00005810465],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022137274,0.00013205966,0.0001418047,0.00009530397,0.00016552609,0.0003736366,0.00051507785,0.000060116818,0.00011302645],"category_scores_gemma":[0.000016970598,0.00010959503,0.000061135055,0.00039560653,0.000031046577,0.0016912449,0.0001785343,0.00010976497,0.0011323377],"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.0000056367867,0.0000824444,0.0037772593,0.000050902327,0.000017932065,0.000007757567,0.0008847667,0.0003656147,0.000042387834,0.8938307,0.055829085,0.04510552],"study_design_scores_gemma":[0.001584716,0.00029578854,0.13902839,0.00011120959,0.000025758696,0.0000795864,0.000101405516,0.24812947,0.00037175007,0.09388431,0.5154816,0.0009060032],"about_ca_topic_score_codex":0.000037672107,"about_ca_topic_score_gemma":0.0000016998849,"teacher_disagreement_score":0.8359374,"about_ca_system_score_codex":0.00006818255,"about_ca_system_score_gemma":0.000023786191,"threshold_uncertainty_score":0.9996454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069934735,0.000005782245,0.7264317,0.0021947194,0.00034381033,0.00045789493,0.00001545273,0.00021340167,0.26334372],"genre_scores_gemma":[0.79695535,0.0000013011463,0.18780062,0.014973015,0.000044194876,0.000024204272,0.000042323143,0.000011564134,0.00014744242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983164,0.000019203646,0.00044542586,0.00022423355,0.00047221786,0.0005225137],"domain_scores_gemma":[0.9987161,0.00014577094,0.00010522459,0.00075389957,0.000024183906,0.00025482886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067501486,0.00020409035,0.00019311563,0.00019768882,0.00016221248,0.0003402906,0.0009101815,0.00007567579,0.000039339135],"category_scores_gemma":[0.00003176927,0.0001670302,0.00007335705,0.00045454447,0.00003970064,0.00055811176,0.00022511769,0.00016221536,0.0007463682],"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.00009752421,0.00042456566,0.0022175335,0.00012479929,0.000047298345,0.000036894202,0.006952237,0.009018663,0.000004660637,0.5676674,0.011183612,0.40222478],"study_design_scores_gemma":[0.00056413613,0.00047280084,0.007164771,0.000035760888,0.000005113569,0.000009858358,0.00030068203,0.9347502,0.0001229175,0.00069769163,0.055513293,0.00036279252],"about_ca_topic_score_codex":0.000012630498,"about_ca_topic_score_gemma":0.000007589099,"teacher_disagreement_score":0.92573154,"about_ca_system_score_codex":0.00019726776,"about_ca_system_score_gemma":0.000045814697,"threshold_uncertainty_score":0.95933026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9376699,0.0000056709778,0.05919347,0.000021779393,0.000084769934,0.000094031224,0.000012431322,0.000015747955,0.002902233],"genre_scores_gemma":[0.946433,0.0000019329182,0.053339884,0.0001946486,0.0000056964914,0.000004403107,0.000012879455,0.000002821877,0.000004755018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877644,0.000024837109,0.0006588859,0.00011633296,0.00025005173,0.000173449],"domain_scores_gemma":[0.9992737,0.000033722947,0.00034798885,0.00024205433,0.000054613105,0.00004788012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923855,0.00010199749,0.00030708234,0.0004767985,0.000035116154,0.00003696034,0.0003068218,0.000038959544,0.0003403627],"category_scores_gemma":[0.000025590825,0.00008951954,0.000095123214,0.00093436224,0.000075157484,0.0008655102,0.00016048529,0.00006589901,0.0000079970705],"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.00016203527,0.0015381589,0.3704737,0.0015691473,0.001686679,0.000017094584,0.16204944,0.00025544415,0.0053588185,0.009358222,0.00016631257,0.44736493],"study_design_scores_gemma":[0.0020322509,0.00062885275,0.3070896,0.00048781635,0.00080395554,0.00002702701,0.0023851937,0.6501173,0.027594665,0.0077557345,0.0002467578,0.0008308911],"about_ca_topic_score_codex":0.00019881141,"about_ca_topic_score_gemma":0.000050080736,"teacher_disagreement_score":0.6498618,"about_ca_system_score_codex":0.000042298543,"about_ca_system_score_gemma":0.0000628792,"threshold_uncertainty_score":0.37267327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5012472,0.0017120604,0.32538122,0.0019629567,0.0014683001,0.0017969043,0.00019645182,0.0003956213,0.16583925],"genre_scores_gemma":[0.99038655,0.000003987189,0.0094141,0.00008259152,0.000008126624,0.000019416684,0.000024223385,0.0000038536614,0.00005718133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983891,0.00013396017,0.0007843395,0.00010803809,0.00035676244,0.00022777375],"domain_scores_gemma":[0.99855465,0.00008000494,0.00035527654,0.00076313847,0.00013735681,0.00010956757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000871954,0.00011591157,0.00029751146,0.000103576276,0.000060695438,0.00019705459,0.0007480505,0.000054995802,0.000004041257],"category_scores_gemma":[0.0000536224,0.00010791453,0.000033967,0.0003708254,0.00016421116,0.00055812096,0.00024285544,0.00012203218,0.000045206987],"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.00007638798,0.0009233373,0.017291022,0.0010918633,0.00010601969,0.000029279288,0.0335331,0.0057567465,0.00028106215,0.8923738,0.033158053,0.015379331],"study_design_scores_gemma":[0.004802986,0.0002362485,0.010662362,0.0010021728,0.000012095642,0.00013210539,0.009787253,0.92470306,0.00045725738,0.004268115,0.043297138,0.00063918164],"about_ca_topic_score_codex":0.00051711843,"about_ca_topic_score_gemma":0.00003502,"teacher_disagreement_score":0.9189463,"about_ca_system_score_codex":0.0001387478,"about_ca_system_score_gemma":0.00010972962,"threshold_uncertainty_score":0.44006267},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08744628,0.000086433174,0.38600084,0.00036881224,0.00037165912,0.00028690594,0.0000027531496,0.00038499435,0.5250513],"genre_scores_gemma":[0.95334905,0.000044490782,0.042993702,0.0011138215,0.00010377195,0.0000455402,0.000012153864,0.000014617683,0.0023228778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985325,0.000023747953,0.0003386758,0.00021534273,0.00035955448,0.0005301932],"domain_scores_gemma":[0.9988357,0.00010543774,0.0001623006,0.0006311063,0.00008712815,0.00017832367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033682102,0.00023359484,0.00023461277,0.00011799272,0.00032092188,0.00056431047,0.00085002667,0.0000648651,0.00014753414],"category_scores_gemma":[0.000047039575,0.00016523384,0.000059248232,0.0005045962,0.0001298155,0.0017471557,0.00032152582,0.00018880365,0.0010827992],"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.00006632389,0.00012401707,0.044964276,0.000068043715,0.00009406841,0.000058353155,0.017003493,0.000056372028,0.000023371136,0.9071319,0.00477863,0.02563111],"study_design_scores_gemma":[0.0074338345,0.003220616,0.08041442,0.0009827415,0.00013784492,0.0021171584,0.007133685,0.12972505,0.0021990254,0.051147405,0.71195155,0.0035366572],"about_ca_topic_score_codex":0.000024686766,"about_ca_topic_score_gemma":0.000022042219,"teacher_disagreement_score":0.8659027,"about_ca_system_score_codex":0.00007179465,"about_ca_system_score_gemma":0.0001080207,"threshold_uncertainty_score":0.99969494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5095377,0.000009238911,0.47037956,0.00065250794,0.0007355964,0.00094980496,0.00009928495,0.00007805626,0.017558234],"genre_scores_gemma":[0.9695258,8.989831e-7,0.029327046,0.00075096043,0.000033830464,0.00004991598,0.000026961368,0.000013346509,0.0002712147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959168,0.00013181848,0.0018974475,0.00025460467,0.0015137807,0.00028556155],"domain_scores_gemma":[0.99345595,0.0041625155,0.001064413,0.000889412,0.00027190812,0.00015580733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034631083,0.00019107711,0.00050259416,0.0010173736,0.0002014194,0.00027246863,0.0008709554,0.00009562595,0.00084554433],"category_scores_gemma":[0.0073630456,0.00014323882,0.00017755473,0.0008717532,0.00009847905,0.000600205,0.0001868206,0.00009473405,0.00058678805],"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.0004674455,0.0006674924,0.04665196,0.0002556363,0.00011049507,6.786973e-7,0.008564514,0.0019651498,0.0005515922,0.23744865,0.2647782,0.4385382],"study_design_scores_gemma":[0.0055079907,0.0014058648,0.052196037,0.00042026842,0.000074673444,0.000009385131,0.0048278472,0.5159513,0.0039858874,0.10088476,0.3138285,0.0009075127],"about_ca_topic_score_codex":0.0000065640525,"about_ca_topic_score_gemma":0.000008803281,"teacher_disagreement_score":0.5139862,"about_ca_system_score_codex":0.00010631698,"about_ca_system_score_gemma":0.00005705853,"threshold_uncertainty_score":0.9258117},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12408224,0.0011106817,0.27901676,0.0015589267,0.0038153513,0.0009990233,0.000013662118,0.0008529656,0.5885504],"genre_scores_gemma":[0.9860933,0.000005974191,0.011608415,0.001618297,0.00013887038,0.00006380578,0.000003678823,0.000004932587,0.0004627471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878407,0.00003858851,0.00033150782,0.000093411945,0.0002969132,0.00045549645],"domain_scores_gemma":[0.99905354,0.00004700535,0.00008181842,0.0005388957,0.000027329253,0.00025141405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032465253,0.00012817125,0.00015733347,0.00006318116,0.00018744073,0.00020915261,0.0007030688,0.00005177986,0.000087829794],"category_scores_gemma":[0.00002895179,0.00009448098,0.000059071535,0.0001886465,0.000029281022,0.002302316,0.00029578875,0.000098636105,0.0016903933],"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.0000059954295,0.00019764724,0.012757062,0.00006183671,0.000065799766,0.000003210364,0.010191234,0.00003348081,0.0008555228,0.91897666,0.03962263,0.017228939],"study_design_scores_gemma":[0.0019258844,0.00021308742,0.010247316,0.00013419948,0.000025799707,0.00007224384,0.0034112,0.012165792,0.0022823487,0.0040981174,0.9643917,0.0010323223],"about_ca_topic_score_codex":0.000011541056,"about_ca_topic_score_gemma":3.4717644e-7,"teacher_disagreement_score":0.92476904,"about_ca_system_score_codex":0.000047904585,"about_ca_system_score_gemma":0.000031416457,"threshold_uncertainty_score":0.9990869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21405089,0.000116771465,0.6675501,0.0046051624,0.0032341958,0.00086921005,0.000029137962,0.0004495486,0.10909498],"genre_scores_gemma":[0.9898086,0.0000021349554,0.007248972,0.0028256616,0.000043527292,0.000030847015,0.0000042729052,0.0000065911513,0.00002935947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985315,0.00010322222,0.0003726659,0.00012825606,0.0004611236,0.00040319256],"domain_scores_gemma":[0.99818367,0.00025300906,0.0002022698,0.0011241481,0.00008051099,0.00015636932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733754,0.0001614698,0.00015400873,0.00033357317,0.00034045565,0.00014584317,0.00084516814,0.00005580496,0.00018809896],"category_scores_gemma":[0.000100422,0.00010835272,0.00026476718,0.0012772295,0.0001489129,0.0011791505,0.00025835022,0.00018221639,0.00014440116],"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.000036738,0.00062240567,0.019854313,0.00007437341,0.00005862686,2.654219e-7,0.0025730042,0.000105802304,0.00036285107,0.9437842,0.011094461,0.021432986],"study_design_scores_gemma":[0.003798295,0.0016809251,0.20372932,0.0005922048,0.00018983617,0.000058922873,0.0022146243,0.087504834,0.008742683,0.039441466,0.6503283,0.0017186443],"about_ca_topic_score_codex":0.000003457969,"about_ca_topic_score_gemma":0.0000010207391,"teacher_disagreement_score":0.9043427,"about_ca_system_score_codex":0.000028227969,"about_ca_system_score_gemma":0.000048281552,"threshold_uncertainty_score":0.44184956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2941502,0.00031366578,0.6976016,0.00013455191,0.0001480229,0.0015578388,0.000043693515,0.000111023546,0.0059393877],"genre_scores_gemma":[0.9930726,0.000051790903,0.0065715527,0.0001192261,0.000016754637,0.00012782912,0.00002655134,0.000008048126,0.000005615086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988164,0.000028880964,0.0006609795,0.00006637137,0.0002286414,0.00019876078],"domain_scores_gemma":[0.9994263,0.00007271033,0.000064114996,0.00036479067,0.000041332227,0.000030731695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003284131,0.0001395643,0.00020332675,0.00015564606,0.000031983225,0.000029885176,0.000304115,0.000058504793,0.00006537101],"category_scores_gemma":[0.000015121108,0.00011042671,0.000036780093,0.00036632246,0.00005512324,0.00054742,0.0000131463075,0.00013155043,0.000058482474],"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.00011796857,0.0007992468,0.006660719,0.0011496599,0.000137487,0.0000045342085,0.054065935,0.70478874,0.020200735,0.01635291,0.004640519,0.19108152],"study_design_scores_gemma":[0.0015122693,0.00069293915,0.03058304,0.00020359117,0.000055180913,0.00001597717,0.001396633,0.950875,0.011414968,0.000529966,0.0022555126,0.00046493651],"about_ca_topic_score_codex":0.000015259298,"about_ca_topic_score_gemma":0.000005341533,"teacher_disagreement_score":0.6989224,"about_ca_system_score_codex":0.00007094899,"about_ca_system_score_gemma":0.000033016753,"threshold_uncertainty_score":0.45030704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747845,0.000032084918,0.20082068,0.00022528463,0.00054787286,0.000105331506,0.000009424613,0.0003469696,0.02312784],"genre_scores_gemma":[0.92188144,0.0000022849858,0.076257095,0.0016048226,0.000110944675,0.000010199786,0.000016974383,0.000007844189,0.00010838679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.00004643285,0.00036783965,0.00017101984,0.00020722407,0.0002900452],"domain_scores_gemma":[0.998855,0.00021964575,0.00015346464,0.00065697334,0.0000129172495,0.00010202274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038950605,0.00013900212,0.00018180833,0.00008418635,0.00012064096,0.00034844698,0.0008295349,0.000051582603,0.0002951652],"category_scores_gemma":[0.00006803982,0.00012290267,0.00006214501,0.00016668343,0.000046415655,0.0010037133,0.00031384354,0.00013617492,0.000907967],"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.000010061216,0.00005464457,0.0036507377,0.0000578907,0.00008353584,0.000008658676,0.029918876,0.00002668473,0.002182671,0.13921519,0.0023282305,0.82246286],"study_design_scores_gemma":[0.0018690629,0.0001591121,0.0023756756,0.0002659811,0.000025508762,0.00011085109,0.006833069,0.9180266,0.009150293,0.037442762,0.022817863,0.0009231873],"about_ca_topic_score_codex":0.000060315906,"about_ca_topic_score_gemma":0.0000034321895,"teacher_disagreement_score":0.9179999,"about_ca_system_score_codex":0.000042143864,"about_ca_system_score_gemma":0.000023216653,"threshold_uncertainty_score":0.99986994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95965713,0.000043956385,0.020170674,0.0019528001,0.00032397412,0.001036809,0.000036439164,0.00016519896,0.016612995],"genre_scores_gemma":[0.9867702,0.000017187724,0.011354895,0.0013362764,0.00003101813,0.00013992781,0.000022762979,0.000008004818,0.000319703],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99835193,0.000059768096,0.00045485998,0.00024149496,0.00037398378,0.000517991],"domain_scores_gemma":[0.999056,0.000052991665,0.00011297981,0.00056300947,0.000048710644,0.00016633692],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024370557,0.00022670926,0.00026142155,0.0001452237,0.00013135921,0.00049134064,0.00076567935,0.00008362516,0.00036360146],"category_scores_gemma":[0.000028509834,0.00017330106,0.00007407836,0.00027550576,0.0000558086,0.0028194638,0.00048349568,0.0001873859,0.0011647191],"study_design_candidate":"observational","study_design_consensus":"observational","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.00008707253,0.0010417211,0.46908963,0.0007231041,0.0002747814,0.00008994725,0.2316169,0.0008921873,0.00036947563,0.0333639,0.06502575,0.19742554],"study_design_scores_gemma":[0.0037207387,0.0010559907,0.61570054,0.00026730134,0.000026530206,0.00010012579,0.010729974,0.3402624,0.0008902455,0.0072665866,0.018361157,0.001618398],"about_ca_topic_score_codex":0.0010698007,"about_ca_topic_score_gemma":0.00043229142,"teacher_disagreement_score":0.33937022,"about_ca_system_score_codex":0.000294961,"about_ca_system_score_gemma":0.000041171228,"threshold_uncertainty_score":0.999613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010980169,0.000021029693,0.98343545,0.00022648413,0.00024874005,0.0016904282,0.00030838436,0.0002342774,0.012737217],"genre_scores_gemma":[0.14316984,0.0000056638487,0.85019547,0.0006817762,0.00012195284,0.002757892,0.00056727126,0.00001530414,0.0024848017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987558,0.000011052407,0.0006123981,0.00010914378,0.00021775253,0.00029381082],"domain_scores_gemma":[0.99903905,0.00013620236,0.00018177283,0.00043116516,0.00013263855,0.0000791622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031369826,0.00013762948,0.00017469487,0.000104413026,0.00039371368,0.0002039198,0.00030963446,0.000052110587,0.000036470312],"category_scores_gemma":[0.000057404683,0.000118737495,0.00008488946,0.00018211054,0.000029094797,0.006861811,0.00005779695,0.000044293083,0.00020733221],"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.00004090384,0.000020361711,0.00003518824,0.00074330874,0.0000328136,1.8179341e-7,0.0041834502,0.000862414,0.000013725967,0.8834784,0.010501933,0.100087315],"study_design_scores_gemma":[0.00078457507,0.00014233662,0.000046316032,0.00009553077,0.000009991347,0.000021796313,0.001193464,0.094277695,0.00058146165,0.0005644669,0.9020877,0.00019465064],"about_ca_topic_score_codex":0.000009889062,"about_ca_topic_score_gemma":0.0000075217845,"teacher_disagreement_score":0.89158577,"about_ca_system_score_codex":0.00012174676,"about_ca_system_score_gemma":0.00008506666,"threshold_uncertainty_score":0.49746472},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19344997,0.0006087797,0.2837024,0.009265529,0.0019424226,0.0011708887,0.000049694765,0.0042374274,0.5055729],"genre_scores_gemma":[0.96218216,0.00007818404,0.031543363,0.004560407,0.00009418575,0.000035054276,0.000015217945,0.000018801295,0.0014726095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983229,0.00003451738,0.00048514985,0.00022112153,0.00045759662,0.000478735],"domain_scores_gemma":[0.99846756,0.00008051684,0.00014568573,0.0011005065,0.000031067953,0.00017468478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002694629,0.00019678034,0.00023080583,0.00015083296,0.00019307909,0.0005316814,0.0014302968,0.0000697254,0.00076495216],"category_scores_gemma":[0.000026706819,0.00018512145,0.00008986813,0.0003422316,0.000065452965,0.0019969195,0.00051664957,0.00013505877,0.0056101596],"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.0000067813294,0.000424874,0.00043785258,0.0001730465,0.0001301282,0.000025663863,0.01123347,0.000028562796,0.0005737647,0.23692144,0.06775298,0.68229145],"study_design_scores_gemma":[0.0016811953,0.00033693388,0.0034425047,0.00013924493,0.000027742468,0.00011025317,0.00039467297,0.792526,0.0027841183,0.009344134,0.18828651,0.0009267066],"about_ca_topic_score_codex":0.000009171502,"about_ca_topic_score_gemma":0.000001719869,"teacher_disagreement_score":0.7924974,"about_ca_system_score_codex":0.0000800569,"about_ca_system_score_gemma":0.00001423477,"threshold_uncertainty_score":0.9951641},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24498738,0.00024394745,0.35356292,0.001811281,0.00080467534,0.0022000463,0.000032565214,0.0008521299,0.39550507],"genre_scores_gemma":[0.83922756,0.000018859324,0.15938525,0.0011011384,0.000019587278,0.000059736918,0.0000073752644,0.000008213794,0.00017227618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984367,0.000033386685,0.0005476712,0.00022398705,0.0002955618,0.00046272052],"domain_scores_gemma":[0.99901825,0.000034517037,0.00011781772,0.0006875307,0.00003383081,0.00010806867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035248432,0.00019620272,0.00024901418,0.00014731825,0.00008298106,0.00019615814,0.00097252853,0.00005208626,0.00008333027],"category_scores_gemma":[0.000035720463,0.00015967911,0.000057740916,0.00036372014,0.00006842462,0.0015483602,0.00040986537,0.00016260931,0.00050629367],"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.000049628576,0.00067666353,0.0060567018,0.00046249424,0.000063247615,0.00007542401,0.13240142,0.01085952,0.000021529011,0.81582665,0.007508579,0.025998114],"study_design_scores_gemma":[0.00057912356,0.00011974217,0.0012976831,0.000054758366,0.0000060569746,0.000019587203,0.0003211665,0.92628866,0.00004193247,0.070006356,0.0009947408,0.0002701749],"about_ca_topic_score_codex":0.00021156095,"about_ca_topic_score_gemma":0.000046860194,"teacher_disagreement_score":0.9154292,"about_ca_system_score_codex":0.00007926146,"about_ca_system_score_gemma":0.0000663617,"threshold_uncertainty_score":0.65115255},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472272,0.000068901645,0.18553683,0.0003790029,0.00082741765,0.00041940066,0.00000857381,0.0005199699,0.7775172],"genre_scores_gemma":[0.89316577,0.000025378087,0.10391818,0.0026572128,0.000027757018,0.000027495342,0.000008157731,0.000008869874,0.00016116121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986648,0.00003056189,0.00040552721,0.0001792567,0.0002948206,0.0004250336],"domain_scores_gemma":[0.99889416,0.000037474023,0.00012601972,0.0007533292,0.000034642817,0.00015440126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002605114,0.00017498888,0.0001762911,0.00009161278,0.00010811482,0.0002122223,0.0011335094,0.00006195287,0.0005053796],"category_scores_gemma":[0.000017967328,0.00013723248,0.00007823249,0.0002669409,0.00010262134,0.0013372828,0.0003983199,0.00013628385,0.0023157313],"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.000014557216,0.00016444476,0.0013630379,0.000092017755,0.00004545942,0.000026574175,0.026816338,0.000012138824,0.0000055598616,0.8731214,0.0060935155,0.092245],"study_design_scores_gemma":[0.0034972727,0.0018985831,0.032487113,0.00024689964,0.000073255054,0.00044066343,0.0021144107,0.19910675,0.0020261488,0.53960556,0.21600619,0.0024971275],"about_ca_topic_score_codex":0.00002008246,"about_ca_topic_score_gemma":0.0000010559708,"teacher_disagreement_score":0.8584431,"about_ca_system_score_codex":0.000045294622,"about_ca_system_score_gemma":0.000038650312,"threshold_uncertainty_score":0.99846107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52835405,0.00006788262,0.43341592,0.0010153984,0.0015599815,0.0020182978,0.000019886733,0.00045113018,0.033097465],"genre_scores_gemma":[0.8695591,0.000009939344,0.12900496,0.0007388408,0.00010878351,0.00016172856,0.00002261779,0.0000113828155,0.00038265405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984542,0.000015462287,0.00047841825,0.0002611047,0.0002196611,0.00057116797],"domain_scores_gemma":[0.99882305,0.00012518813,0.00023763461,0.00045909855,0.00012128951,0.00023374526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049621036,0.0002471276,0.0002725638,0.00012779106,0.00031232444,0.0005911132,0.00066464586,0.000144283,0.000039026567],"category_scores_gemma":[0.00011454818,0.00019199787,0.00009343545,0.00021724086,0.0001640707,0.0011439873,0.00037324204,0.0002788806,0.000105908024],"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.000010824641,0.00012231762,0.0015456213,0.00022709636,0.000064735264,0.0000045222455,0.00635052,3.8268817e-7,0.0024201816,0.48050958,0.0006960391,0.5080482],"study_design_scores_gemma":[0.015002911,0.0032863212,0.013146152,0.0007742345,0.00013517604,0.0012067074,0.0045669265,0.31627345,0.03036632,0.17928585,0.43171704,0.004238903],"about_ca_topic_score_codex":0.000010006952,"about_ca_topic_score_gemma":0.000028454582,"teacher_disagreement_score":0.5038093,"about_ca_system_score_codex":0.000039155853,"about_ca_system_score_gemma":0.00010916609,"threshold_uncertainty_score":0.78294456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97273016,0.00008046011,0.022853645,0.00012639067,0.00019128699,0.000099840465,0.0000058864775,0.00012269047,0.003789628],"genre_scores_gemma":[0.9580797,0.0000021756423,0.04172292,0.00011284797,0.00003317812,0.000002718004,0.0000019205884,0.000004536635,0.00004003387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00002086315,0.00034277397,0.00012561356,0.000195772,0.00021573945],"domain_scores_gemma":[0.99917835,0.00019368119,0.00017044727,0.0003674651,0.00003090934,0.000059150363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046773843,0.000111813744,0.00017352011,0.00006918251,0.00013355032,0.00016178493,0.0004207032,0.000040553303,0.00003134948],"category_scores_gemma":[0.00007799662,0.000093912124,0.000037131584,0.00011871854,0.00018986092,0.00075646985,0.00029885783,0.00015043451,0.000007818908],"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.00001948779,0.000095003976,0.012129006,0.0009882386,0.000080869424,0.0000088722645,0.059719943,0.00003804306,0.025838332,0.56817454,0.00034876703,0.3325589],"study_design_scores_gemma":[0.003052335,0.0008717963,0.073370606,0.0008185868,0.00006722026,0.0005147844,0.10925492,0.6007536,0.13020635,0.06268207,0.016244953,0.0021627771],"about_ca_topic_score_codex":0.00003263121,"about_ca_topic_score_gemma":0.000012875071,"teacher_disagreement_score":0.6007156,"about_ca_system_score_codex":0.000010464736,"about_ca_system_score_gemma":0.000016531356,"threshold_uncertainty_score":0.38296252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4629759,0.00014553961,0.4524672,0.000069246016,0.001110652,0.00059209,0.000008416609,0.00022194306,0.08240902],"genre_scores_gemma":[0.8347075,0.000009350517,0.1649041,0.00018874097,0.00002449103,0.00001234739,0.000005401094,0.000014126249,0.00013391457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972034,0.00015961695,0.0010261076,0.00030730863,0.0008463335,0.0004572259],"domain_scores_gemma":[0.9977902,0.00026987703,0.0006026176,0.0010608698,0.00013750624,0.00013891616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408148,0.0002367706,0.000375017,0.0004290323,0.00019477805,0.00025460622,0.0007402176,0.000093657036,0.000039705927],"category_scores_gemma":[0.00044053796,0.00023067441,0.00012210174,0.0010829626,0.000052989362,0.0016020971,0.00020367581,0.00019140536,0.00011604727],"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.000084497224,0.00034354406,0.002388464,0.0004652799,0.0002004668,0.000032625605,0.016990436,0.079491965,0.0038203474,0.875148,0.0020211656,0.019013228],"study_design_scores_gemma":[0.0031955768,0.0005339936,0.0009770645,0.0011243824,0.00006077093,0.0003858955,0.002416544,0.9456124,0.020873317,0.020064635,0.0036351867,0.0011202826],"about_ca_topic_score_codex":0.000035843936,"about_ca_topic_score_gemma":0.000001134626,"teacher_disagreement_score":0.8661204,"about_ca_system_score_codex":0.00024351705,"about_ca_system_score_gemma":0.00013569332,"threshold_uncertainty_score":0.940663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13684413,0.00071687304,0.48376215,0.0009864629,0.0019865187,0.00051128084,0.0000055516125,0.00049131823,0.37469572],"genre_scores_gemma":[0.88707703,0.000021881282,0.11144697,0.0012681165,0.00008755543,0.000010521607,0.000003050517,0.000005220671,0.00007968049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899936,0.000017588749,0.0002916867,0.00009536568,0.0001870269,0.0004090024],"domain_scores_gemma":[0.99936754,0.000067788096,0.00009808577,0.0002953184,0.000013107563,0.00015817868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067172,0.000121649486,0.00012854565,0.000055483943,0.00019106914,0.00028025958,0.00030627768,0.000044333934,0.00002841372],"category_scores_gemma":[0.000024797575,0.00009998604,0.0000289496,0.00014535003,0.000035872232,0.0024425252,0.00051694724,0.00011883479,0.00024566258],"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.000011463364,0.00014115925,0.053831816,0.00025315708,0.0000699071,0.00000546919,0.049524687,0.00033390973,0.00005840759,0.213683,0.005977498,0.67610955],"study_design_scores_gemma":[0.001928372,0.00038070796,0.07832482,0.00019497686,0.000035764435,0.00048937945,0.0029509084,0.7308579,0.0001397923,0.006086755,0.17726187,0.0013487381],"about_ca_topic_score_codex":0.000011791667,"about_ca_topic_score_gemma":9.246693e-7,"teacher_disagreement_score":0.7502329,"about_ca_system_score_codex":0.000035550896,"about_ca_system_score_gemma":0.0000106545185,"threshold_uncertainty_score":0.40773126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81216794,0.00005846649,0.012013646,0.0016176865,0.0010852322,0.0010581205,0.000086953514,0.00028868954,0.17162323],"genre_scores_gemma":[0.98521125,0.0000027011852,0.0115929395,0.00025935564,0.0001171755,0.00013125075,0.000057404468,0.000020602563,0.0026073393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983102,0.00005453445,0.0006383617,0.000115173534,0.00038287512,0.0004988326],"domain_scores_gemma":[0.9986947,0.00050442474,0.0001387642,0.00044498482,0.00006251193,0.00015461018],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007251865,0.0001774647,0.00022107159,0.00024417526,0.00013113393,0.00005367717,0.0001551383,0.00009398788,0.0013431716],"category_scores_gemma":[0.00087386,0.0001675549,0.00007734618,0.00044472486,0.000083873914,0.0010175608,0.00009933451,0.000252625,0.002061775],"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.00029108068,0.0034330972,0.123251505,0.00094465405,0.00022571691,0.0000042605843,0.020482467,0.00041547607,0.00034619117,0.76207036,0.081113495,0.0074217133],"study_design_scores_gemma":[0.012247324,0.00090207846,0.20517536,0.0005746543,0.00035743142,0.00036433284,0.029180795,0.017725961,0.0014849254,0.3636002,0.36515513,0.0032317955],"about_ca_topic_score_codex":0.00007279729,"about_ca_topic_score_gemma":0.000073864285,"teacher_disagreement_score":0.39847013,"about_ca_system_score_codex":0.00041926748,"about_ca_system_score_gemma":0.00006812463,"threshold_uncertainty_score":0.9995697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30129427,0.000060933526,0.5286955,0.00841585,0.0011851311,0.0007702321,0.000027708562,0.0011859649,0.15836434],"genre_scores_gemma":[0.96429867,0.0000133384565,0.031436667,0.0040092906,0.00005583893,0.000021999733,0.000016250915,0.0000094474835,0.00013847447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985578,0.00001566673,0.0004989434,0.00019404369,0.0003767012,0.00035680947],"domain_scores_gemma":[0.99901927,0.00008381771,0.000106591215,0.0006336354,0.00002276345,0.00013394539],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004004955,0.0001760569,0.00016463628,0.0001420352,0.00021211925,0.0002822794,0.0008632284,0.000058158825,0.000026001862],"category_scores_gemma":[0.0000381347,0.00014584683,0.00008082806,0.0002890322,0.00005461234,0.0015304806,0.00013233298,0.00016149222,0.0010719511],"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.00006562893,0.0001759285,0.00001020714,0.000086111686,0.000038646667,0.000020293144,0.029392902,0.0007948687,0.00061702216,0.7717733,0.0018821412,0.19514297],"study_design_scores_gemma":[0.01811233,0.0037486006,0.0015508357,0.0015317354,0.000049358183,0.00026329944,0.005931375,0.054729585,0.120529845,0.39097393,0.39959845,0.0029806478],"about_ca_topic_score_codex":0.000034032833,"about_ca_topic_score_gemma":0.0000055308183,"teacher_disagreement_score":0.6630044,"about_ca_system_score_codex":0.00015288247,"about_ca_system_score_gemma":0.000067966044,"threshold_uncertainty_score":0.99970585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12312933,0.00003789574,0.82450914,0.0038227101,0.0010597649,0.000790576,0.000042974396,0.00026990965,0.0463377],"genre_scores_gemma":[0.9248821,9.761739e-7,0.06679486,0.007847934,0.00009231184,0.0000150223905,0.000016106535,0.000013096951,0.00033759556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377173,0.00017786429,0.0020499537,0.0004331213,0.002890684,0.00067662186],"domain_scores_gemma":[0.9956359,0.0017933138,0.000580396,0.0013536621,0.00026308306,0.0003735914],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0032577268,0.00033388217,0.0006776073,0.000652892,0.0004196588,0.0014063134,0.0016152454,0.00012217415,0.004560727],"category_scores_gemma":[0.0021281976,0.00025297012,0.00029134308,0.0012530559,0.00011004746,0.0013531793,0.00022860376,0.00033699488,0.005728303],"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.00042485204,0.0006807661,0.020984553,0.000026487805,0.000046327747,0.000051139283,0.0043999283,0.0055949762,0.0009990413,0.0028264076,0.43420002,0.5297655],"study_design_scores_gemma":[0.0021670775,0.00025741762,0.050630998,0.000097859556,0.000020955345,0.000019228051,0.0013251221,0.6790147,0.0004573438,0.0028960682,0.26259205,0.00052117486],"about_ca_topic_score_codex":0.000010334674,"about_ca_topic_score_gemma":0.0000025218021,"teacher_disagreement_score":0.80175275,"about_ca_system_score_codex":0.00013671962,"about_ca_system_score_gemma":0.00012558153,"threshold_uncertainty_score":0.99999225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360278,0.00011398676,0.4694559,0.0022602123,0.0011753944,0.0008607231,0.00005397255,0.00046242413,0.4320146],"genre_scores_gemma":[0.9487036,0.00003146109,0.03885583,0.012191514,0.00004558851,0.000017184011,0.0000092880555,0.000008797259,0.00013678256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985408,0.000055924447,0.00034887524,0.00023753,0.00047604204,0.0003408083],"domain_scores_gemma":[0.9984847,0.0005554555,0.000107710424,0.0006762495,0.000029991206,0.00014592288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040748398,0.00021108314,0.00019081307,0.00014018614,0.0002263872,0.00038774754,0.0005882949,0.00008633479,0.00026696228],"category_scores_gemma":[0.00011595937,0.00015101573,0.000060396025,0.00022782043,0.000071362265,0.00064508343,0.00020095112,0.0001946134,0.0008340157],"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.00010639924,0.00031925336,0.00026228122,0.000048554666,0.000021946398,0.00002530341,0.0030773242,0.006988261,0.00000277981,0.53157,0.03573738,0.4218405],"study_design_scores_gemma":[0.0011788753,0.0011199425,0.001360453,0.00008219077,0.0000068842173,0.000012574776,0.000108201515,0.87698907,0.000029858144,0.105217166,0.013553048,0.00034177178],"about_ca_topic_score_codex":0.0000022172226,"about_ca_topic_score_gemma":4.6971408e-7,"teacher_disagreement_score":0.8700008,"about_ca_system_score_codex":0.00006250118,"about_ca_system_score_gemma":0.000012056004,"threshold_uncertainty_score":0.999944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86250675,0.00017265712,0.11949875,0.0003412521,0.00011166066,0.0004631274,0.000015593743,0.00029715005,0.016593078],"genre_scores_gemma":[0.9594067,0.000008192682,0.04002769,0.00035962,0.000027011085,0.0000207742,0.000026156542,0.000007088051,0.00011680792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999188,0.000017011793,0.00021258934,0.00014486791,0.00022576175,0.00021177111],"domain_scores_gemma":[0.99954164,0.000052404353,0.000076523975,0.00027228176,0.000013739933,0.00004340343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001233742,0.0001195047,0.000119765864,0.00012492755,0.0000866022,0.0001901094,0.00022510368,0.000030728228,0.000014041188],"category_scores_gemma":[0.0000036594379,0.000083792,0.0000110019355,0.00021378302,0.000022792736,0.00086915836,0.00017735786,0.00011183398,0.000040034618],"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.00015595488,0.0016187544,0.050099466,0.0010029359,0.0001474669,0.0001754163,0.0454403,0.008351886,0.0011048284,0.7999558,0.008674065,0.08327316],"study_design_scores_gemma":[0.015205381,0.0045459615,0.25115642,0.0038999796,0.000069862326,0.000593983,0.0052828533,0.62433803,0.0037260184,0.03813955,0.049340308,0.0037016913],"about_ca_topic_score_codex":0.00033400528,"about_ca_topic_score_gemma":0.000050229035,"teacher_disagreement_score":0.7618162,"about_ca_system_score_codex":0.00003482049,"about_ca_system_score_gemma":0.000022670207,"threshold_uncertainty_score":0.34169385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852544,0.00042624248,0.0022378948,0.0006571067,0.000039020055,0.0006022847,0.000013350676,0.000038542676,0.0107311215],"genre_scores_gemma":[0.9959232,0.00010236226,0.0014384077,0.0020192324,0.000029864917,0.00011121364,0.0000039827946,0.0000066378057,0.00036505575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984774,0.00015915456,0.0004750732,0.00024704915,0.00042415527,0.00021719806],"domain_scores_gemma":[0.9981014,0.0011146282,0.00012316028,0.0003354569,0.000100925055,0.0002244455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016244916,0.00016958179,0.0002546413,0.0001343154,0.0009669075,0.00046652317,0.00029602592,0.00009512733,0.00053672213],"category_scores_gemma":[0.00035185623,0.00009585779,0.000022727907,0.00020421424,0.000697729,0.0009949945,0.0015965303,0.00016660034,0.00013845289],"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.00033876,0.000096628966,0.07637248,0.00010799346,0.00007384596,0.0000049371024,0.035339832,0.0000026290309,0.00031892612,0.47097334,0.0029473251,0.4134233],"study_design_scores_gemma":[0.0021280013,0.0011129822,0.122594476,0.000112967246,0.000060617378,0.00026750885,0.05611576,0.000491593,0.0003222227,0.75407743,0.061966117,0.0007503236],"about_ca_topic_score_codex":0.00001541897,"about_ca_topic_score_gemma":0.000009048391,"teacher_disagreement_score":0.41267297,"about_ca_system_score_codex":0.00001778018,"about_ca_system_score_gemma":0.000021355077,"threshold_uncertainty_score":0.74367684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02449833,0.00005960371,0.9742586,0.00028666185,0.00010297264,0.00036741403,0.000060017697,0.000051382576,0.00031501258],"genre_scores_gemma":[0.8714512,0.000052468167,0.12806706,0.00024036094,0.000018986006,0.00006615387,0.00009431291,0.000004294435,0.000005177185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99896926,0.000026140719,0.0004347097,0.00014670777,0.00024318442,0.00017999303],"domain_scores_gemma":[0.99860865,0.00037983424,0.00029231538,0.0005462493,0.00011302296,0.000059943686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046144408,0.000112735375,0.00017785163,0.00020277342,0.00015525318,0.00011334331,0.0004695679,0.000055124645,0.0000735516],"category_scores_gemma":[0.00010717204,0.00008375825,0.00013316415,0.0011852696,0.00013622947,0.0007918499,0.00010586059,0.000093371185,0.000012175027],"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.00003772633,0.00007447452,0.0029251687,0.000054443004,0.00040459202,1.4117636e-7,0.0053393776,0.000039957456,0.00021490752,0.96706855,0.00034371155,0.02349692],"study_design_scores_gemma":[0.00073621626,0.00041443875,0.47367248,0.00007288531,0.0009609504,0.0000046434993,0.0011922413,0.40529355,0.005410949,0.10643866,0.0053697526,0.00043323182],"about_ca_topic_score_codex":0.000026476788,"about_ca_topic_score_gemma":0.0000042698334,"teacher_disagreement_score":0.8606299,"about_ca_system_score_codex":0.000038614206,"about_ca_system_score_gemma":0.000021366304,"threshold_uncertainty_score":0.34155622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008836353,0.000015462268,0.95077693,0.000069235146,0.0003551407,0.0011616539,0.0000068160803,0.00038727632,0.046343837],"genre_scores_gemma":[0.72544336,7.6924056e-7,0.2734599,0.000107519096,0.000571586,0.00023655516,0.0000085815045,0.000010692807,0.00016099995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981725,0.0000750089,0.0008496246,0.00018708894,0.00045140856,0.0002643577],"domain_scores_gemma":[0.9986473,0.000088195724,0.00033478296,0.000722178,0.00012344394,0.00008413009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006116398,0.00016159192,0.00027487383,0.00021758524,0.00007129309,0.00012694953,0.0009495908,0.00007096533,0.000013808382],"category_scores_gemma":[0.000016523905,0.00015354427,0.000056375495,0.00048507302,0.000032917924,0.0007208448,0.00017565125,0.00007394938,0.0004986824],"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.000015749105,0.00009787093,0.0004921826,0.0005207392,0.000020270085,0.000002626298,0.002764323,0.00031946722,0.0047488147,0.83907086,0.10829162,0.0436555],"study_design_scores_gemma":[0.0020193295,0.0019139788,0.0025285264,0.0011205887,0.00006111649,0.00016611746,0.0017981462,0.27196205,0.34637746,0.011232412,0.35878086,0.0020394137],"about_ca_topic_score_codex":0.00011723098,"about_ca_topic_score_gemma":0.0000028257668,"teacher_disagreement_score":0.8278384,"about_ca_system_score_codex":0.00020620751,"about_ca_system_score_gemma":0.00005652651,"threshold_uncertainty_score":0.64097196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019923044,0.0000153929,0.9638697,0.0008675503,0.00024778943,0.0006651546,0.00006504401,0.00036890706,0.013977445],"genre_scores_gemma":[0.6250567,0.000008557012,0.3697688,0.0021157227,0.00031984333,0.00012794766,0.0011392664,0.00002561059,0.0014375632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985173,0.00002205453,0.0003923773,0.00021915714,0.0003326782,0.00051642914],"domain_scores_gemma":[0.9990982,0.000052736927,0.00009389729,0.0005965217,0.000044823148,0.00011384517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052570296,0.00016293637,0.00015721297,0.00014281599,0.00026509727,0.0009783991,0.0010409452,0.000051274874,0.000051292856],"category_scores_gemma":[0.000013931938,0.00015110336,0.000055316374,0.0003279709,0.00006346872,0.004528009,0.00032808635,0.0001161438,0.00008536272],"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.000015195131,0.00022881021,0.0011037345,0.00016383332,0.000049193095,0.0000055319388,0.0006829863,0.00031931672,0.00004908087,0.9107477,0.015344952,0.071289636],"study_design_scores_gemma":[0.0010990693,0.0002146332,0.0018826746,0.000027674787,0.000012923455,0.0000048950496,0.0002819437,0.6223895,0.0011362229,0.010317137,0.3622212,0.00041212954],"about_ca_topic_score_codex":0.000054424156,"about_ca_topic_score_gemma":0.000015273532,"teacher_disagreement_score":0.9004306,"about_ca_system_score_codex":0.000042172425,"about_ca_system_score_gemma":0.00005095407,"threshold_uncertainty_score":0.94347245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005807681,0.000048583333,0.9877551,0.0008081365,0.0002500092,0.00018426271,0.000079325386,0.00024297168,0.0048239334],"genre_scores_gemma":[0.30877328,0.00005396546,0.68865293,0.0014631102,0.000117573145,0.000019361125,0.0007538148,0.00001510192,0.00015086729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987682,0.000012302348,0.00027403134,0.00024374119,0.00045008416,0.0002516188],"domain_scores_gemma":[0.9981694,0.000029755434,0.0001206503,0.0015229317,0.000042655956,0.00011459835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013850715,0.00014604339,0.0001410505,0.00007571678,0.0003283489,0.00043459176,0.0017286524,0.000037041442,0.000045188255],"category_scores_gemma":[0.000009882538,0.0000993696,0.00001630313,0.00023559663,0.00008540896,0.0048748567,0.0016369063,0.0001314502,0.00023831139],"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.00021586311,0.0013342196,0.0056221006,0.0004066934,0.00030971773,0.00013011761,0.013853765,0.011912003,0.0008078062,0.44694856,0.09137269,0.42708647],"study_design_scores_gemma":[0.0064007062,0.0009383421,0.014612247,0.000981745,0.00004272589,0.000504744,0.0016070851,0.38618106,0.0037520898,0.0074978066,0.5761257,0.0013557514],"about_ca_topic_score_codex":0.00005427011,"about_ca_topic_score_gemma":0.000005339071,"teacher_disagreement_score":0.484753,"about_ca_system_score_codex":0.00004298165,"about_ca_system_score_gemma":0.00010251565,"threshold_uncertainty_score":0.41907784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18963519,0.00017521532,0.8055703,0.00011038675,0.00026650858,0.0006683543,0.0000010805596,0.0002566901,0.003316267],"genre_scores_gemma":[0.9909314,0.0000056839694,0.008738084,0.0001576085,0.00003239437,0.00002403968,0.00001783167,0.0000072685025,0.00008570508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840504,0.00006493397,0.0006180011,0.00017184553,0.00041214706,0.00032802072],"domain_scores_gemma":[0.9992062,0.000031127718,0.00028799754,0.00024341649,0.00013101546,0.00010026705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172439,0.00017150126,0.00030004216,0.000071841285,0.00024257232,0.00015097324,0.00046028616,0.000057133744,0.000005188981],"category_scores_gemma":[0.000021084565,0.00012997877,0.00007510878,0.0003453612,0.00015826793,0.0007692786,0.00020375564,0.0001190385,0.000099158366],"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.000057515314,0.0021146433,0.042359505,0.0016589952,0.00057885447,0.000024744313,0.2959149,0.0009043865,0.0038701731,0.22681981,0.015139925,0.41055655],"study_design_scores_gemma":[0.0033435533,0.0026237185,0.0039250148,0.00017376072,0.000039594324,0.0005750165,0.006330624,0.9311695,0.021168686,0.0021469255,0.026929347,0.001574238],"about_ca_topic_score_codex":0.000095828385,"about_ca_topic_score_gemma":7.7604716e-7,"teacher_disagreement_score":0.9302651,"about_ca_system_score_codex":0.000058107664,"about_ca_system_score_gemma":0.000077692224,"threshold_uncertainty_score":0.53003806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11880448,0.000013256572,0.86281323,0.000253373,0.00015316786,0.00029011987,0.00001596489,0.000113307215,0.017543107],"genre_scores_gemma":[0.88698906,0.000003701763,0.11256497,0.0003659124,0.000010218954,0.000019841285,0.000019151665,0.0000037502714,0.000023396915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984665,0.00003863356,0.0006287876,0.00018210267,0.0004056514,0.00027831996],"domain_scores_gemma":[0.99820036,0.00041437036,0.00023244882,0.000937561,0.000090868365,0.00012439537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047825195,0.00014357381,0.00037342263,0.00036752273,0.00011309615,0.00015058432,0.00092525734,0.000054696113,0.00011550072],"category_scores_gemma":[0.00032159098,0.000106547915,0.00017980587,0.0014815376,0.000082622006,0.0005169599,0.0003317845,0.00009102367,0.0001581403],"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.00003116291,0.0005546278,0.013697243,0.0001240429,0.001535842,0.00000287578,0.009319263,0.023944441,0.00017428551,0.38610697,0.0024129318,0.5620963],"study_design_scores_gemma":[0.00032038728,0.00013470033,0.033041168,0.000020598207,0.00014561844,0.000001548201,0.00006741845,0.95778656,0.00003787897,0.0047346754,0.0035534664,0.00015595774],"about_ca_topic_score_codex":0.000038519258,"about_ca_topic_score_gemma":0.00004544728,"teacher_disagreement_score":0.9338421,"about_ca_system_score_codex":0.000038897066,"about_ca_system_score_gemma":0.000028246404,"threshold_uncertainty_score":0.4344898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058394715,0.000063783235,0.8403194,0.00093949237,0.0012270996,0.0005509979,0.000032916374,0.0007678476,0.09770378],"genre_scores_gemma":[0.7581169,0.00019598668,0.22837573,0.0026347348,0.00026149314,0.000090107525,0.00023147684,0.00002223092,0.010071355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998828,0.000017725155,0.0003131193,0.00015880167,0.00038345766,0.00029889986],"domain_scores_gemma":[0.9990941,0.000017093787,0.00009591764,0.00067410676,0.00002868674,0.0000900657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013715625,0.00013830476,0.0001386916,0.00009669363,0.00024618546,0.0002762364,0.0009769344,0.000030682026,0.00017673423],"category_scores_gemma":[0.0000137909465,0.00011952809,0.000054205702,0.00022455772,0.00008400081,0.0032790664,0.0006680859,0.00008527993,0.0008439628],"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.00002274489,0.0003040479,0.0027541216,0.00021091034,0.00018720826,0.00006195681,0.010383198,0.0000308314,0.00011896692,0.5573291,0.31365556,0.11494134],"study_design_scores_gemma":[0.0011806152,0.00024974789,0.0073083052,0.000049895436,0.000016685803,0.00007530245,0.0004091726,0.03746018,0.0014912876,0.0034234887,0.9477103,0.0006250611],"about_ca_topic_score_codex":0.000011772969,"about_ca_topic_score_gemma":0.0000010478847,"teacher_disagreement_score":0.6997222,"about_ca_system_score_codex":0.00003036361,"about_ca_system_score_gemma":0.00003418219,"threshold_uncertainty_score":0.999934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47155908,0.0009546766,0.1753555,0.021240333,0.0015958111,0.0014979356,0.00022166639,0.0010158636,0.32655916],"genre_scores_gemma":[0.8839068,0.00009511602,0.10892762,0.005702524,0.00013310275,0.000008984155,0.00005920524,0.000009633008,0.0011570175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992163,0.0000058109927,0.00022327111,0.00018415159,0.0001685248,0.00020192857],"domain_scores_gemma":[0.99899036,0.00008859702,0.00008110563,0.00073629606,0.00001906462,0.00008459826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014876101,0.000111456095,0.00010375744,0.000055835146,0.00015156293,0.0001713964,0.0007091636,0.00003792473,0.0005117624],"category_scores_gemma":[0.000036365534,0.00008773226,0.000011613076,0.00012571643,0.00003791448,0.0021003964,0.00045628543,0.00011829111,0.00077031826],"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.00004417064,0.0002738383,0.0005635255,0.00024271895,0.000061745886,0.0000105072095,0.0047884434,0.0008688404,0.00005437766,0.14278819,0.06550018,0.78480345],"study_design_scores_gemma":[0.0004714485,0.00015007272,0.0045465603,0.000051854164,0.00000396362,0.000021555727,0.000103906634,0.04910703,0.0002120897,0.0026605213,0.9424333,0.00023768833],"about_ca_topic_score_codex":0.0000018239236,"about_ca_topic_score_gemma":0.000021844075,"teacher_disagreement_score":0.87693316,"about_ca_system_score_codex":0.000028589655,"about_ca_system_score_gemma":0.000019416273,"threshold_uncertainty_score":0.990114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80781716,0.00046362632,0.00627755,0.00006982305,0.0010969515,0.0005647279,0.000015331856,0.00061547203,0.18307936],"genre_scores_gemma":[0.9967382,0.00005118379,0.00020674996,0.00009878893,0.00012682132,0.000041977622,0.000039139428,0.000014875052,0.0026822856],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991215,0.0000061004016,0.00042052878,0.000065870816,0.00013041035,0.00025558306],"domain_scores_gemma":[0.9996175,0.000020667585,0.000033852713,0.00023562636,0.000014064639,0.00007827068],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012930913,0.00011630727,0.00016118753,0.000051802308,0.00009404429,0.00017068996,0.00012977097,0.000054005413,0.002057892],"category_scores_gemma":[0.0000029240932,0.00011506157,0.000045819717,0.00013735682,0.000014234915,0.00045619815,0.00001011783,0.00009989719,0.0021752815],"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.000043227377,0.000063882144,0.0023290536,0.0003857244,0.00020888694,0.0000033010292,0.0028940341,0.33061957,0.0011503148,0.001230477,0.59983325,0.061238274],"study_design_scores_gemma":[0.00037129686,0.00001509464,0.0016991606,0.00004820839,0.000011034008,0.000006118454,0.00014371697,0.67291224,0.00010721152,0.000019534533,0.32450563,0.00016075902],"about_ca_topic_score_codex":0.000016344531,"about_ca_topic_score_gemma":0.000005367218,"teacher_disagreement_score":0.34229267,"about_ca_system_score_codex":0.00007807464,"about_ca_system_score_gemma":0.0000060579036,"threshold_uncertainty_score":0.99885434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6463177,0.0011569489,0.28501272,0.028526159,0.0027667542,0.0038149417,0.00015774426,0.0012279534,0.03101908],"genre_scores_gemma":[0.96397346,0.00002589911,0.017935894,0.01674822,0.00051138503,0.00032658322,0.00017851299,0.000033048414,0.000267021],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818385,0.000049160903,0.0005126652,0.00026144503,0.00045402817,0.00053886656],"domain_scores_gemma":[0.998985,0.000074412426,0.00019430077,0.00047991323,0.00010047729,0.00016593297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047108272,0.0002448206,0.000298748,0.0002285625,0.00014847638,0.00039989073,0.0015282102,0.0000948142,0.000033220087],"category_scores_gemma":[0.0000046885316,0.00021469411,0.00008058375,0.00042188627,0.00002794459,0.0017967789,0.00070976664,0.00014526403,0.00018821702],"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.00011433461,0.00045669498,0.015316171,0.0037150355,0.00014501429,0.000019997497,0.66862917,0.00009073117,0.00008959412,0.016202997,0.008651674,0.28656858],"study_design_scores_gemma":[0.0055359006,0.0005544634,0.008904282,0.00034520283,0.00003362454,0.000020473964,0.016497133,0.09411904,0.0012793364,0.013966116,0.85764956,0.0010948712],"about_ca_topic_score_codex":0.00041338932,"about_ca_topic_score_gemma":0.0004682345,"teacher_disagreement_score":0.8489979,"about_ca_system_score_codex":0.00008069107,"about_ca_system_score_gemma":0.00006164416,"threshold_uncertainty_score":0.87549716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9265958,0.000092251365,0.045852993,0.00087077916,0.0007911801,0.0009815469,0.0000063363095,0.0004865583,0.02432252],"genre_scores_gemma":[0.9488549,0.000024035095,0.049210545,0.0016139983,0.000059501024,0.00001937153,0.000015155952,0.000017355449,0.00018509],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715006,0.00011188727,0.000805347,0.0004928057,0.00067923643,0.0007606769],"domain_scores_gemma":[0.9978613,0.00021932059,0.00021023481,0.001242048,0.00022991697,0.00023713335],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068263075,0.00036959603,0.00045930242,0.00025300914,0.00016984408,0.000407265,0.0013043557,0.00012321008,0.00052393513],"category_scores_gemma":[0.000059747585,0.00031053077,0.000075798,0.001651433,0.00019735954,0.0017191955,0.00081132684,0.00038295705,0.00092602754],"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.00080218486,0.003220985,0.6704302,0.0006825456,0.00024206181,0.0003484409,0.047755074,0.008242469,0.00015972226,0.011017615,0.0072499784,0.24984872],"study_design_scores_gemma":[0.0043705516,0.002448783,0.34419972,0.00020690555,0.000041193194,0.00053509173,0.00196949,0.5837115,0.000993126,0.0056439475,0.053943813,0.0019358397],"about_ca_topic_score_codex":0.00022429742,"about_ca_topic_score_gemma":0.0001672571,"teacher_disagreement_score":0.5754691,"about_ca_system_score_codex":0.0003207311,"about_ca_system_score_gemma":0.00024750424,"threshold_uncertainty_score":0.9999347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23531899,0.000055833607,0.733525,0.00024894252,0.0002119819,0.00024624335,0.00000812889,0.000058803525,0.030326115],"genre_scores_gemma":[0.89218694,0.000065908185,0.107412934,0.00026991748,0.000009177888,0.000006695129,0.000012651135,0.000002618778,0.00003313659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913526,0.00001786484,0.00039000137,0.000085447056,0.00020986599,0.00016158956],"domain_scores_gemma":[0.99950695,0.000045590048,0.000115390976,0.00028166757,0.000019828192,0.000030556046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011670944,0.000082951956,0.0001536535,0.000121685254,0.00006248689,0.00006943288,0.00041010504,0.00003004067,0.000014830974],"category_scores_gemma":[0.000012708417,0.000068444635,0.00003710674,0.00028923454,0.00007665854,0.0017769147,0.00014452946,0.000060350223,0.000023308306],"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.00013082048,0.0018134626,0.16273667,0.00071115606,0.00013047186,0.00014337225,0.05387311,0.3606768,0.00023509857,0.37292424,0.010856301,0.035768513],"study_design_scores_gemma":[0.0017213483,0.00028226702,0.05214117,0.00010015511,0.000005367917,0.00010428866,0.00048819807,0.9390016,0.00053612667,0.0027367119,0.002466651,0.00041607986],"about_ca_topic_score_codex":0.000037029946,"about_ca_topic_score_gemma":0.0000037353036,"teacher_disagreement_score":0.656868,"about_ca_system_score_codex":0.000033775756,"about_ca_system_score_gemma":0.00003711074,"threshold_uncertainty_score":0.27910912},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0756402,0.00021737968,0.632714,0.05790695,0.0012591113,0.00313128,0.00012963696,0.0011092379,0.22789223],"genre_scores_gemma":[0.2858123,0.00042179786,0.7016532,0.008890871,0.00010230094,0.000109307366,0.00013134287,0.00003242212,0.0028464976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987881,0.000031855416,0.0004219529,0.00020482395,0.00025275175,0.000300525],"domain_scores_gemma":[0.9991613,0.00003458619,0.00016110163,0.00044468037,0.000042408523,0.00015594266],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005465134,0.00013813472,0.00017883755,0.000070004426,0.00023508101,0.0010726164,0.0009904748,0.000024685367,0.000024763349],"category_scores_gemma":[0.000047375335,0.000114164715,0.000019077499,0.0002432407,0.000078232326,0.0013532104,0.0011633668,0.0001836199,0.0002030695],"study_design_candidate":"design_other","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.00006912709,0.00030451769,0.00050086406,0.00021390944,0.00009598708,0.000020102701,0.036126483,0.0046452265,0.000039405957,0.16298419,0.006620643,0.78837955],"study_design_scores_gemma":[0.008221929,0.0009534177,0.0063134935,0.00029795282,0.000010499047,0.00014233246,0.00044135697,0.1028723,0.0004089465,0.107474685,0.7720472,0.00081585086],"about_ca_topic_score_codex":0.00029109317,"about_ca_topic_score_gemma":0.000026215803,"teacher_disagreement_score":0.7875637,"about_ca_system_score_codex":0.0000646387,"about_ca_system_score_gemma":0.00007607306,"threshold_uncertainty_score":0.99996436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01210951,0.00004987639,0.97825086,0.0009858848,0.000119666205,0.0003496534,0.0002460421,0.00022237652,0.0076661543],"genre_scores_gemma":[0.35811687,0.000011707727,0.63787746,0.003108152,0.000082968116,0.000016464855,0.0007125258,0.0000064646156,0.00006736172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985878,0.00002090325,0.00045618802,0.00028297427,0.00027087558,0.00038128087],"domain_scores_gemma":[0.9984139,0.000121096826,0.00016859407,0.0011310035,0.000035831792,0.00012954613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032827287,0.00017604754,0.00022837083,0.00007775817,0.00027781658,0.0005417502,0.0019785815,0.000042967025,0.000025846797],"category_scores_gemma":[0.00006233383,0.00014854521,0.000057173165,0.00012140426,0.00003140143,0.0022032573,0.00060523,0.00015343106,0.00017304292],"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.000088771805,0.00039580918,0.000096239295,0.00004578545,0.000082479484,0.000006993834,0.008581321,0.013494567,0.00021159438,0.12744261,0.020006359,0.82954746],"study_design_scores_gemma":[0.0015741638,0.00021013181,0.000075015276,0.000019382156,0.000010628991,0.0000031271015,0.00010198427,0.9524678,0.000014746843,0.028009377,0.01731523,0.00019843213],"about_ca_topic_score_codex":0.000025051344,"about_ca_topic_score_gemma":0.000003810154,"teacher_disagreement_score":0.9389732,"about_ca_system_score_codex":0.0000398056,"about_ca_system_score_gemma":0.000060590883,"threshold_uncertainty_score":0.6057497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6792971,0.001798982,0.27870497,0.0047797034,0.0005711459,0.0008493148,0.0000069457164,0.00024814674,0.03374372],"genre_scores_gemma":[0.9923198,0.00002244067,0.0063974047,0.001153783,0.000040955896,0.0000038688804,0.0000022385386,0.0000017085081,0.000057787252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.000039755458,0.00023969074,0.00008833414,0.00017289167,0.00022393861],"domain_scores_gemma":[0.9993356,0.00022736553,0.00012220223,0.000217052,0.00005611176,0.000041694348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036931274,0.00009850386,0.0001561953,0.000052301322,0.0001374885,0.000114444316,0.00036802114,0.000023882516,0.0000045741917],"category_scores_gemma":[0.000059663416,0.00006115285,0.000052778574,0.00017729445,0.00014744577,0.0006224156,0.00021959678,0.0001451728,0.000008593924],"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.00008572044,0.000038377475,0.00015015833,0.000028130147,0.000049337395,0.0000025621616,0.012244757,0.000019791962,0.00003261184,0.1968651,0.0010305027,0.78945297],"study_design_scores_gemma":[0.012885999,0.0015525273,0.08160299,0.00071091234,0.00015041811,0.0006262808,0.013272484,0.8206567,0.005630537,0.05299626,0.008523943,0.0013909207],"about_ca_topic_score_codex":0.000010626649,"about_ca_topic_score_gemma":0.0000016620467,"teacher_disagreement_score":0.8206369,"about_ca_system_score_codex":0.000014110591,"about_ca_system_score_gemma":0.000018743503,"threshold_uncertainty_score":0.2493741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012997168,0.00002428137,0.9824973,0.00035675272,0.000050439045,0.00047706644,0.000020232237,0.00040154377,0.00317524],"genre_scores_gemma":[0.43859074,0.000018935203,0.5599973,0.0009396789,0.000019486106,0.00005283005,0.000045820892,0.000008603544,0.00032657955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896383,0.000020385889,0.0003664508,0.00020505284,0.00019637885,0.00024792473],"domain_scores_gemma":[0.99935675,0.00010653914,0.00011921588,0.00025066466,0.00007650385,0.0000903089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002608931,0.00014118811,0.0001629785,0.00009278402,0.0002372516,0.00034705002,0.00030034487,0.000047659207,0.0000041487733],"category_scores_gemma":[0.000014997439,0.00011855342,0.000025179525,0.00015859114,0.000041568324,0.0020496196,0.00007960714,0.00006825278,0.00001601342],"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.00047831875,0.00019259268,0.00023374241,0.00024038076,0.00008150071,0.0000041110216,0.009130065,0.7543185,0.000016420701,0.023461655,0.013657436,0.19818531],"study_design_scores_gemma":[0.0015037953,0.00019964868,0.00008242739,0.00004892605,0.0000047804515,0.000015060897,0.000023755832,0.9877465,0.00038638685,0.0042463876,0.005561127,0.00018120494],"about_ca_topic_score_codex":0.000017336779,"about_ca_topic_score_gemma":0.0000022642691,"teacher_disagreement_score":0.42559358,"about_ca_system_score_codex":0.000033683595,"about_ca_system_score_gemma":0.000041663065,"threshold_uncertainty_score":0.4834468},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914307,0.000036876976,0.0033007322,0.000056391247,0.00005027542,0.00014523078,0.000018982892,0.000014914024,0.004945896],"genre_scores_gemma":[0.99496937,0.000011230025,0.0045080734,0.00030207017,0.00003099272,0.000005469359,0.00011312219,0.0000054489337,0.000054246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933326,0.000008712148,0.00025061463,0.000096314136,0.00011568673,0.00019540198],"domain_scores_gemma":[0.99961543,0.00000926089,0.00010501377,0.0001610693,0.00005037591,0.000058866255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009556713,0.00011644412,0.00013737546,0.000022446557,0.00005622172,0.0000198199,0.00014538954,0.000071512004,0.000019459965],"category_scores_gemma":[0.000026809475,0.00007716108,0.000049184215,0.00007506719,0.00015133593,0.000008762835,0.00007540488,0.000058564325,0.000010341689],"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.004746546,0.0019967,0.12890182,0.0014403495,0.0020045072,0.000047256235,0.009234845,0.0053798775,0.59049135,0.09881566,0.0038560694,0.15308498],"study_design_scores_gemma":[0.011560584,0.015927209,0.029444635,0.0003629779,0.0001265823,0.00024494145,0.011186433,0.00018980456,0.83323663,0.0034125939,0.09260143,0.0017061448],"about_ca_topic_score_codex":0.000021342392,"about_ca_topic_score_gemma":0.00002141765,"teacher_disagreement_score":0.24274528,"about_ca_system_score_codex":0.000014802335,"about_ca_system_score_gemma":0.0000553985,"threshold_uncertainty_score":0.31465375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80817986,0.00001941906,0.18977731,0.0003871201,0.00014785856,0.0001872426,0.000016733753,0.00008126486,0.0012031879],"genre_scores_gemma":[0.96863925,0.000005522299,0.030906996,0.00034866095,0.000010434765,0.00000735028,0.000013264282,0.0000039238907,0.0000645935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.000043800283,0.00027583283,0.000073437084,0.00016178329,0.00019422334],"domain_scores_gemma":[0.9994376,0.0000370129,0.0000815362,0.0002846658,0.00005808493,0.0001011003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035070186,0.00009614957,0.000135539,0.00007599552,0.000118487456,0.000094285286,0.00022788813,0.000017867173,0.0000504417],"category_scores_gemma":[0.000010853983,0.00007396863,0.000017034072,0.00017959463,0.00018632195,0.0018538296,0.00018021833,0.00007102406,0.000020508101],"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.00008529065,0.00044804846,0.019357873,0.00027107756,0.00020270563,0.000001364693,0.055099163,0.0001811028,0.0011715246,0.9098322,0.0037926827,0.009556958],"study_design_scores_gemma":[0.010760406,0.0045990106,0.34133312,0.00077584665,0.00014125102,0.0003672018,0.02384539,0.53434885,0.025328135,0.03203844,0.024114288,0.0023480477],"about_ca_topic_score_codex":0.00007235669,"about_ca_topic_score_gemma":0.00002236798,"teacher_disagreement_score":0.8777938,"about_ca_system_score_codex":0.000035504603,"about_ca_system_score_gemma":0.000027776283,"threshold_uncertainty_score":0.30163532},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6890252,0.00013580525,0.28736186,0.001737962,0.00015885204,0.00028567945,0.0000026025352,0.00010939199,0.0211826],"genre_scores_gemma":[0.94318247,0.000006596032,0.056472342,0.00023641395,0.0000059822846,0.00001024225,0.0000028129261,0.0000012306732,0.00008192811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99949235,0.000020291589,0.00022571669,0.000058195616,0.00010250621,0.00010091289],"domain_scores_gemma":[0.9995389,0.00011459552,0.00009495028,0.0001772303,0.000037276634,0.000037054448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096530304,0.000053373067,0.00009063381,0.000051588446,0.000062198174,0.00011203768,0.00019606856,0.00002587093,0.000116676914],"category_scores_gemma":[0.000019629113,0.00004336185,0.000017474795,0.000085005035,0.00007456549,0.0013920638,0.000113505375,0.000037237573,0.00013871123],"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.000003239202,0.00015083255,0.060043532,0.0002061662,0.00012141023,0.0000016743215,0.032186825,0.00013367916,0.0014622491,0.6462981,0.0153642865,0.24402797],"study_design_scores_gemma":[0.0012564056,0.00040975632,0.7356635,0.00014419339,0.000032725264,0.00005037958,0.0042104,0.20615372,0.006467807,0.04008254,0.005084789,0.0004437825],"about_ca_topic_score_codex":0.000050070357,"about_ca_topic_score_gemma":0.0000020606028,"teacher_disagreement_score":0.67561996,"about_ca_system_score_codex":0.000009480895,"about_ca_system_score_gemma":0.000012265341,"threshold_uncertainty_score":0.17828985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083666,0.00002428417,0.893209,0.00007872731,0.00025655597,0.00020938193,0.0000029016467,0.00012625496,0.022426926],"genre_scores_gemma":[0.5881626,0.000008611657,0.411382,0.00018138031,0.000011653672,0.000013933527,0.0000058922506,0.000003939867,0.00022998286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878865,0.000081109065,0.00054194615,0.00010484567,0.00031543596,0.0001680129],"domain_scores_gemma":[0.99874216,0.00021605495,0.00024947713,0.0006429726,0.00008747193,0.00006183553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055933493,0.00009640548,0.00013683057,0.00018834475,0.00018189554,0.000031169337,0.0005730076,0.00005158479,0.00010290686],"category_scores_gemma":[0.0002321724,0.00008881191,0.000061163075,0.00052086817,0.00013050647,0.0017428526,0.00014503983,0.00010053023,0.000238168],"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.000006574341,0.000041180872,0.0023259388,0.000025654508,0.000017172528,5.1775487e-7,0.0060278694,0.00049448735,0.00007488575,0.9816779,0.00038353333,0.008924308],"study_design_scores_gemma":[0.0015925986,0.0004132391,0.27604306,0.00011077486,0.00003071988,0.00015652369,0.0007838669,0.5689717,0.0075952834,0.12161206,0.021972748,0.00071741885],"about_ca_topic_score_codex":0.000002974393,"about_ca_topic_score_gemma":1.7993091e-7,"teacher_disagreement_score":0.8600658,"about_ca_system_score_codex":0.00004777337,"about_ca_system_score_gemma":0.00007382685,"threshold_uncertainty_score":0.36216447},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09536953,0.000370813,0.19445427,0.000593045,0.00078292267,0.0004611009,0.00001142727,0.00042780425,0.70752907],"genre_scores_gemma":[0.95283854,0.000046977195,0.045889508,0.000497568,0.000048814767,0.000022580078,0.000008510716,0.00000766111,0.0006398616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869996,0.000048315804,0.0004476106,0.00017543817,0.00026313195,0.0003655476],"domain_scores_gemma":[0.99883115,0.00003910033,0.00020491375,0.0006943866,0.000075106684,0.00015536169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027844243,0.00015779653,0.00027124796,0.00011197964,0.00009514408,0.00011479304,0.0009800225,0.00008406168,0.00045431496],"category_scores_gemma":[0.00005737553,0.00012909288,0.000073605464,0.00025227305,0.000101543636,0.001314616,0.0002650225,0.00011509104,0.00037685558],"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.000012637531,0.0005062484,0.0022665462,0.00020878843,0.000060358867,0.000009136968,0.029020734,0.00001559925,0.00012228763,0.6771304,0.007734655,0.2829126],"study_design_scores_gemma":[0.0028599992,0.002150778,0.0098322965,0.00013547149,0.000049666116,0.00028213992,0.001584439,0.8337727,0.006275035,0.021471642,0.12044624,0.00113956],"about_ca_topic_score_codex":0.000036772264,"about_ca_topic_score_gemma":0.000012032137,"teacher_disagreement_score":0.85746896,"about_ca_system_score_codex":0.000053287393,"about_ca_system_score_gemma":0.000029026209,"threshold_uncertainty_score":0.5264255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15903673,0.0000027766228,0.8000451,0.00005967579,0.00043296348,0.0003044536,0.00001309776,0.000096092335,0.040009137],"genre_scores_gemma":[0.67848855,0.00000459231,0.32112813,0.00027261453,0.000010186538,0.000034902037,0.000008689551,0.0000052422242,0.000047092508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896204,0.000036895013,0.00045175524,0.000113189395,0.00026925007,0.00016684475],"domain_scores_gemma":[0.9989265,0.000069263944,0.00032316893,0.0005434965,0.00007768917,0.000059850092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029411237,0.00011236997,0.00015142985,0.00015115409,0.0000768195,0.000048830938,0.00082458404,0.000037774334,0.0001573674],"category_scores_gemma":[0.00008512402,0.00009813916,0.00004545035,0.0002757613,0.00008359007,0.0014042675,0.00013142556,0.00009207169,0.00018763421],"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.000025295889,0.00014314988,0.000505289,0.000030441135,0.000026029491,4.319503e-7,0.0077852886,0.000011779538,0.0002431437,0.9764913,0.00007588109,0.014661988],"study_design_scores_gemma":[0.0026063814,0.0035213123,0.20715863,0.00030205506,0.00004295736,0.00001938024,0.0008086018,0.42752922,0.19631672,0.15823549,0.0024778794,0.0009813702],"about_ca_topic_score_codex":0.000014922186,"about_ca_topic_score_gemma":0.0000014054807,"teacher_disagreement_score":0.8182558,"about_ca_system_score_codex":0.000034833338,"about_ca_system_score_gemma":0.000027585613,"threshold_uncertainty_score":0.40019986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019274274,0.000059699654,0.9756024,0.00040017455,0.00025705472,0.0005611677,0.000010409312,0.000085484695,0.0037493254],"genre_scores_gemma":[0.56819445,0.000012471339,0.42998704,0.0015973892,0.000044069475,0.0000462949,0.000011167469,0.0000053628974,0.00010178003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887127,0.000008120691,0.00035279582,0.00017684259,0.00019359797,0.00039738746],"domain_scores_gemma":[0.999311,0.00012010575,0.000100954145,0.00029143633,0.00004006891,0.00013644791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830171,0.00014441654,0.00015869095,0.000079942576,0.00018695247,0.0002148669,0.00040331457,0.000049599803,0.000016406979],"category_scores_gemma":[0.000026846994,0.000110755514,0.000048273283,0.00013499925,0.00006772261,0.000663596,0.00028147723,0.00006603782,0.000041222236],"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.00016563672,0.0006953067,0.011518987,0.00064995233,0.00015664264,0.00002659094,0.014618106,0.000113777096,0.0005535964,0.42988804,0.0031980928,0.53841525],"study_design_scores_gemma":[0.012089946,0.0027012494,0.19850945,0.0002191438,0.000081717866,0.00016111632,0.0075032553,0.5775069,0.0018727179,0.026781427,0.17035861,0.0022144578],"about_ca_topic_score_codex":0.0000083534005,"about_ca_topic_score_gemma":0.000007660958,"teacher_disagreement_score":0.5773931,"about_ca_system_score_codex":0.000057607893,"about_ca_system_score_gemma":0.000021130267,"threshold_uncertainty_score":0.45164788},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24870697,0.000028427918,0.70870316,0.00017700074,0.00028614135,0.0004186519,0.00007487225,0.0004289982,0.041175798],"genre_scores_gemma":[0.9792048,0.000022188433,0.020345017,0.00021907079,0.00002016841,0.00003685747,0.000038590482,0.000011462649,0.000101865175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979833,0.000050960483,0.00092711434,0.0001735287,0.00045874738,0.00040640184],"domain_scores_gemma":[0.99848014,0.000113447764,0.00026525787,0.0009140334,0.00005567982,0.0001714362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033174612,0.0002460668,0.00039215075,0.00023393225,0.00013910951,0.00010583677,0.0014325931,0.00009110749,0.0001472676],"category_scores_gemma":[0.000010676383,0.00019841448,0.00016079989,0.00031948282,0.00011144969,0.0029413742,0.0002487264,0.00017459794,0.00012800805],"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.000032240485,0.00038363913,0.0011555029,0.00039883313,0.00027081277,0.0000024588417,0.0698547,0.000036891266,0.0003652754,0.7702101,0.0022200516,0.15506952],"study_design_scores_gemma":[0.004348758,0.0007747734,0.029386517,0.00035906793,0.00016883799,0.000032850938,0.0026187357,0.7322903,0.0296408,0.19731848,0.0018188593,0.0012419992],"about_ca_topic_score_codex":0.000033061544,"about_ca_topic_score_gemma":0.0000041969524,"teacher_disagreement_score":0.73225343,"about_ca_system_score_codex":0.00005302585,"about_ca_system_score_gemma":0.000051912702,"threshold_uncertainty_score":0.80911076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04774429,0.000015193778,0.928903,0.00051283994,0.00014006815,0.0009402679,0.000019943043,0.000116125084,0.021608263],"genre_scores_gemma":[0.83489525,0.00000267316,0.1638646,0.0006680789,0.00006345144,0.00008525488,0.000041238643,0.0000088164115,0.00037061077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985931,0.00002883161,0.00051170046,0.00015387648,0.0003513714,0.00036113954],"domain_scores_gemma":[0.99898624,0.0001131087,0.00020354251,0.00058014906,0.000054778437,0.00006214907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047954815,0.00012659591,0.00018991927,0.0001229932,0.00010768845,0.00015569356,0.0007972267,0.000025094056,0.000049690472],"category_scores_gemma":[0.000012668498,0.00011953634,0.000097048716,0.0002601914,0.00015708577,0.0006160355,0.00041209345,0.00007110414,0.000094565796],"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.000023339588,0.00018158715,0.00045298383,0.00060823397,0.000055802917,0.0000019808665,0.0011475981,0.027262464,0.00015496911,0.89061046,0.057740867,0.02175971],"study_design_scores_gemma":[0.00097468385,0.00020000254,0.0015873326,0.000060384882,0.000012085361,9.251847e-7,0.00014840618,0.92218506,0.0017529775,0.017233765,0.05562979,0.00021459993],"about_ca_topic_score_codex":0.00008111809,"about_ca_topic_score_gemma":0.000015993483,"teacher_disagreement_score":0.89492255,"about_ca_system_score_codex":0.000098185235,"about_ca_system_score_gemma":0.000042280637,"threshold_uncertainty_score":0.48745504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05579898,0.000063964355,0.87565905,0.001588934,0.00019087737,0.0003059961,0.000005341905,0.00025364512,0.06613321],"genre_scores_gemma":[0.8752705,0.0000063726256,0.12196075,0.002650116,0.00001623819,0.000003282441,0.0000057399643,0.0000023205346,0.00008469193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893486,0.000015812257,0.0004133997,0.000114226095,0.0002664473,0.00025527322],"domain_scores_gemma":[0.9991955,0.00004977512,0.00015453262,0.00046943448,0.000042085616,0.00008864927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012358092,0.00011935101,0.00019728183,0.00010449066,0.00007201875,0.00006966543,0.0007130841,0.000032663986,0.00011857829],"category_scores_gemma":[0.000025231953,0.00010006481,0.00006346744,0.0003200031,0.0000571258,0.0008862977,0.00011947261,0.00008508313,0.00019614426],"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.0000054894635,0.00011614648,0.00024533898,0.00003186332,0.000014744513,0.0000035368007,0.0013209672,0.000096235635,0.00084021955,0.85867137,0.002045932,0.13660815],"study_design_scores_gemma":[0.003209974,0.0025685334,0.13809882,0.00015800835,0.000038248534,0.000169483,0.0008319347,0.13212211,0.013178266,0.62289405,0.085369535,0.0013610094],"about_ca_topic_score_codex":0.0000016498203,"about_ca_topic_score_gemma":3.6040962e-7,"teacher_disagreement_score":0.8194715,"about_ca_system_score_codex":0.00002769259,"about_ca_system_score_gemma":0.000026660955,"threshold_uncertainty_score":0.40805244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22149079,0.000043910673,0.7529937,0.0009885493,0.000104484,0.00023391619,0.000027748914,0.00021806288,0.023898847],"genre_scores_gemma":[0.9467951,0.0000016345871,0.051987782,0.00058000226,0.000035043347,0.000020716032,0.00003943763,0.0000052641362,0.0005350071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925065,0.000019153013,0.00025603172,0.00011459711,0.00019704513,0.00016251691],"domain_scores_gemma":[0.99933934,0.00025128026,0.000096132746,0.00023934027,0.000024175113,0.00004975518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015309514,0.00011056938,0.000103155464,0.00008996767,0.00020693093,0.00029573555,0.00021936836,0.00002666477,0.00006354435],"category_scores_gemma":[0.0000179917,0.000083518375,0.00001886275,0.00017013059,0.00009107975,0.00095791975,0.00010486841,0.00006916084,0.00011650598],"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.000018744095,0.00010185117,0.014153647,0.00005818313,0.00003118681,0.000015792615,0.0014468135,0.0009962101,0.0001720677,0.9690583,0.0052640815,0.008683139],"study_design_scores_gemma":[0.001547573,0.00029140565,0.06650646,0.000086815664,0.000024100615,0.00019582162,0.00021594572,0.84928495,0.0001914368,0.06132163,0.019828081,0.0005058026],"about_ca_topic_score_codex":0.000014226537,"about_ca_topic_score_gemma":0.000009301702,"teacher_disagreement_score":0.90773666,"about_ca_system_score_codex":0.000021670898,"about_ca_system_score_gemma":0.00003948146,"threshold_uncertainty_score":0.34057805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01086284,0.000109182656,0.9779986,0.004810917,0.00035906432,0.00025467118,0.0000032682458,0.00018815453,0.005413302],"genre_scores_gemma":[0.49657562,0.00000302373,0.49117902,0.011953622,0.00012439232,0.000017903722,0.0000063792872,0.000004008618,0.00013603263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873054,0.000010153427,0.00043236688,0.00016451481,0.00024971424,0.00041269616],"domain_scores_gemma":[0.9992208,0.00006941185,0.00017462796,0.0003734531,0.000040605337,0.0001211114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018169208,0.00015213054,0.00022371583,0.00007840282,0.00019964734,0.0004918053,0.00072938885,0.00007337928,0.000048569047],"category_scores_gemma":[0.000043558244,0.00013311942,0.000088871624,0.00023025276,0.000029318633,0.0009942274,0.00010158389,0.00014720192,0.00011894142],"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.000017366545,0.000107889435,0.00018518773,0.00009636698,0.000023622775,0.0000013655374,0.008797288,0.00011226041,0.00015443667,0.59682536,0.02797221,0.36570665],"study_design_scores_gemma":[0.0017903823,0.0009696766,0.0029071616,0.00031813246,0.000032822758,0.000043341868,0.0006838716,0.515227,0.009222226,0.23810142,0.22966681,0.0010371454],"about_ca_topic_score_codex":0.00000239885,"about_ca_topic_score_gemma":2.7800922e-7,"teacher_disagreement_score":0.5151147,"about_ca_system_score_codex":0.00006284458,"about_ca_system_score_gemma":0.00007948214,"threshold_uncertainty_score":0.54284525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26177803,0.00006835662,0.7284241,0.0017201325,0.00020176765,0.00089373236,0.00027518478,0.00027394952,0.006364768],"genre_scores_gemma":[0.86801946,0.000004728909,0.13016099,0.0013993838,0.000027547076,0.000031364074,0.000045372373,0.0000060008865,0.0003051525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890965,0.000024628298,0.00045848754,0.00013629351,0.00022079224,0.00025016148],"domain_scores_gemma":[0.99879795,0.00009415905,0.00011621604,0.0008507189,0.00006572893,0.00007522966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980712,0.00013145606,0.00021339866,0.00009159611,0.0001336529,0.00016893072,0.000989921,0.000030431618,0.000039130085],"category_scores_gemma":[0.000085179454,0.00011390911,0.000077660756,0.00015370858,0.00010514044,0.00082296523,0.00017296155,0.00005874732,0.00002665941],"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.000034755252,0.0002726824,0.00006462984,0.00026048825,0.00005773559,0.0000041361436,0.008692528,0.00038853305,0.0033821922,0.9101135,0.0075992364,0.06912958],"study_design_scores_gemma":[0.0037277106,0.0019318806,0.0092970515,0.00026358294,0.000055951,0.000058450565,0.0016751713,0.68123025,0.030654136,0.2614016,0.008819663,0.0008845738],"about_ca_topic_score_codex":0.000008405586,"about_ca_topic_score_gemma":0.0000061830697,"teacher_disagreement_score":0.6808417,"about_ca_system_score_codex":0.000032679545,"about_ca_system_score_gemma":0.00005255685,"threshold_uncertainty_score":0.46450785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033377435,0.000057610916,0.8293319,0.0003700371,0.00075782556,0.00032338974,4.88691e-7,0.00027127707,0.16554978],"genre_scores_gemma":[0.96605045,0.000004111478,0.03180601,0.0013565772,0.000084325664,0.000024152669,0.000007608587,0.0000068356694,0.00065993064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834883,0.000034219593,0.00057582656,0.00015923976,0.00035330065,0.000528575],"domain_scores_gemma":[0.9989283,0.000088852146,0.00019686972,0.0005606447,0.00005979515,0.00016552105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011402196,0.00015804062,0.00022061098,0.00015269546,0.000135214,0.00022074736,0.0008395776,0.000085727355,0.00012302585],"category_scores_gemma":[0.000068570866,0.00012437615,0.00007445806,0.00034193092,0.0000771316,0.00081742555,0.00030971304,0.00013668476,0.0014187859],"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.0000043777495,0.000051419924,0.0008464483,0.00008912861,0.000034569963,0.000014679408,0.005157603,0.000002173352,0.000023995417,0.88718927,0.0023045144,0.1042818],"study_design_scores_gemma":[0.0017668271,0.0007365911,0.006474464,0.000021613305,0.00002992594,0.00047051045,0.0022886489,0.013047059,0.0015904488,0.090460114,0.88225716,0.0008566629],"about_ca_topic_score_codex":0.00006188879,"about_ca_topic_score_gemma":0.000022398737,"teacher_disagreement_score":0.9627127,"about_ca_system_score_codex":0.000082646424,"about_ca_system_score_gemma":0.00007227613,"threshold_uncertainty_score":0.9993587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20470436,0.000023284712,0.77707523,0.00045134666,0.00034664283,0.00049338833,0.0000064996375,0.00070381525,0.016195454],"genre_scores_gemma":[0.58181214,0.000017622697,0.41770625,0.00025901909,0.000017493932,0.000050400005,0.0000091469665,0.000011673968,0.00011625931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974695,0.000134685,0.00095323,0.00036265873,0.0005071061,0.0005728534],"domain_scores_gemma":[0.9979842,0.00018478071,0.00041088153,0.0011920105,0.0000880258,0.0001401013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073287974,0.00031314732,0.0003516127,0.00040979098,0.00029806935,0.0003473468,0.0016902037,0.00008866807,0.00007420899],"category_scores_gemma":[0.00019433156,0.00028313012,0.000058034515,0.0008414074,0.00020719871,0.0045269993,0.0008494164,0.0004572873,0.00027972666],"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.00077254244,0.0026539434,0.030632736,0.002126702,0.00059520325,0.00019945319,0.21947551,0.016677838,0.009888789,0.13319708,0.021702545,0.56207764],"study_design_scores_gemma":[0.001515085,0.0005122173,0.019627688,0.0005947803,0.000009877974,0.0007576413,0.0029337283,0.94837296,0.007062877,0.00017577522,0.01780554,0.00063182344],"about_ca_topic_score_codex":0.000051853476,"about_ca_topic_score_gemma":0.000018891473,"teacher_disagreement_score":0.9316951,"about_ca_system_score_codex":0.0004367272,"about_ca_system_score_gemma":0.000109982844,"threshold_uncertainty_score":0.9999621},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09654742,0.00007429445,0.67838633,0.00092498696,0.00029910542,0.00033955649,0.000008818181,0.00017953456,0.22323994],"genre_scores_gemma":[0.8784811,0.000003857498,0.12111316,0.00022288931,0.00003189989,0.000010089221,0.000014194105,0.0000027345723,0.00012009156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916005,0.000012036841,0.00033949089,0.00007994951,0.00024291231,0.00016555261],"domain_scores_gemma":[0.9994489,0.000028586848,0.00015564523,0.00030287937,0.00003235286,0.000031664764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001512808,0.00008149177,0.00012179045,0.00007424654,0.000058750556,0.00013571698,0.0003893926,0.000032562522,0.000035044322],"category_scores_gemma":[0.0000082748875,0.00006383466,0.000043790067,0.00021795047,0.000044550117,0.0008385464,0.00012204779,0.0000455874,0.00011823354],"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.0000072790717,0.00020216111,0.0026650866,0.00021424991,0.000023980181,0.000002560821,0.0039035873,0.00082438183,0.0003529306,0.9233332,0.017230982,0.05123959],"study_design_scores_gemma":[0.0023802652,0.00065950956,0.053476386,0.00014466913,0.00003257528,0.00005671853,0.0012099535,0.70737696,0.0123193655,0.081392415,0.13992308,0.0010281018],"about_ca_topic_score_codex":0.00008374583,"about_ca_topic_score_gemma":0.0000036227777,"teacher_disagreement_score":0.8419408,"about_ca_system_score_codex":0.000024329207,"about_ca_system_score_gemma":0.000021114607,"threshold_uncertainty_score":0.26031017},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02735689,0.00041010499,0.24577728,0.0065118703,0.0018762014,0.00088575337,0.000016016222,0.0011727596,0.7159931],"genre_scores_gemma":[0.71197724,0.00012918956,0.28183895,0.0045809755,0.00010214678,0.00004658893,0.000010974922,0.000013009647,0.0013008896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987608,0.00001904973,0.00034756417,0.00016158936,0.0003111913,0.00039976963],"domain_scores_gemma":[0.9990789,0.00002808156,0.00010776054,0.0006229582,0.000026522652,0.00013572916],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001408138,0.0001455698,0.00015261535,0.00008455255,0.00015831838,0.00040324358,0.00083649403,0.000044326818,0.00074259774],"category_scores_gemma":[0.000020663876,0.000115766714,0.000058435857,0.000287622,0.00005201172,0.0012575303,0.00028143032,0.000115157614,0.002627925],"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.0000070818646,0.00036924423,0.0005182143,0.00014941802,0.000076810975,0.000033622382,0.013372188,0.000120889854,0.00023076522,0.5760646,0.2095775,0.1994797],"study_design_scores_gemma":[0.0010698461,0.00024389313,0.0006098047,0.00004017544,0.000011366651,0.000121161596,0.00042793466,0.7477345,0.0006831319,0.00817348,0.24029411,0.00059061195],"about_ca_topic_score_codex":0.0000039169054,"about_ca_topic_score_gemma":1.2921556e-7,"teacher_disagreement_score":0.7476136,"about_ca_system_score_codex":0.00003910928,"about_ca_system_score_gemma":0.000009603928,"threshold_uncertainty_score":0.9981486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7202002,0.000028789636,0.2169161,0.0032036384,0.00039691455,0.0017870978,0.00023707053,0.00019414809,0.057036094],"genre_scores_gemma":[0.9818419,0.0000033579875,0.015825447,0.0020316278,0.000022440589,0.0000981239,0.0000683549,0.000008774893,0.00009997801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982579,0.000045674133,0.00070607325,0.00019304862,0.00041646295,0.0003808616],"domain_scores_gemma":[0.9983093,0.00056093157,0.00014144214,0.00082515227,0.000066673914,0.00009651032],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008924809,0.00015884617,0.00018444587,0.00017038906,0.00013248129,0.000106561914,0.0009348397,0.00006461412,0.0012103472],"category_scores_gemma":[0.00009095949,0.00012310117,0.000056154404,0.00056353136,0.00014478451,0.0006311471,0.00034788574,0.00023699416,0.00022728139],"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.000042758038,0.0022047067,0.002945823,0.00020965423,0.00009286893,0.000106530024,0.01056607,0.000011995846,0.0126452735,0.88522214,0.027556632,0.058395576],"study_design_scores_gemma":[0.006343775,0.0016369206,0.25686517,0.000830892,0.00016973077,0.0001705768,0.01142078,0.12296463,0.3711293,0.013583259,0.21235949,0.0025254725],"about_ca_topic_score_codex":0.000027056156,"about_ca_topic_score_gemma":0.000050802657,"teacher_disagreement_score":0.87163883,"about_ca_system_score_codex":0.000084477186,"about_ca_system_score_gemma":0.0000729099,"threshold_uncertainty_score":0.9997027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43513274,0.0003078038,0.510561,0.0035432202,0.0002872135,0.001288612,0.00016321361,0.00014618934,0.048570037],"genre_scores_gemma":[0.9668088,0.00006279815,0.032763906,0.00024099323,0.000004606056,0.000021765361,0.000048518526,0.0000031834036,0.00004542424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00002428155,0.00047468828,0.00011268819,0.00024213616,0.00018380574],"domain_scores_gemma":[0.99943775,0.000038490623,0.00016363709,0.00029152108,0.000009074782,0.00005950812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016340641,0.00010615588,0.0001553474,0.00010742918,0.00006251398,0.00007766395,0.00026395972,0.00005657419,0.000096521435],"category_scores_gemma":[0.00003171814,0.00009478338,0.000025615107,0.00027381594,0.000067888126,0.0012756546,0.00018932283,0.00009501017,0.000088148765],"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.00003777862,0.0017395836,0.058439285,0.0005556449,0.00018549198,0.000033281725,0.07741479,0.0076073525,0.00026155126,0.16844405,0.01704493,0.66823626],"study_design_scores_gemma":[0.0014280983,0.00019377933,0.105807416,0.00006881529,0.00001082313,0.000025473379,0.00036416034,0.8709123,0.00016425614,0.0049788025,0.015744112,0.000301947],"about_ca_topic_score_codex":0.000018825654,"about_ca_topic_score_gemma":0.0000017197692,"teacher_disagreement_score":0.863305,"about_ca_system_score_codex":0.00007039656,"about_ca_system_score_gemma":0.000008694345,"threshold_uncertainty_score":0.3865154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37371188,0.000024557952,0.59571725,0.0003405197,0.00044776784,0.00050718145,0.00005427938,0.00009464083,0.029101925],"genre_scores_gemma":[0.96532047,0.0000019379604,0.03429193,0.000298239,0.0000068464133,0.000007051701,0.000016211226,0.0000029806033,0.000054333388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907273,0.000044522738,0.0003904974,0.00008560432,0.0002781354,0.00012851515],"domain_scores_gemma":[0.99891436,0.0000896629,0.0002596651,0.0006219968,0.00007803485,0.000036294008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027712848,0.00008583881,0.00014769309,0.000067422996,0.00007457861,0.000042922526,0.00065620936,0.00003150821,0.00021950631],"category_scores_gemma":[0.000037878453,0.000054456836,0.000043881213,0.00022961221,0.00008800404,0.00056446705,0.00029047622,0.000076375545,0.000034834957],"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.00018318245,0.0013854714,0.0007050278,0.000263441,0.00010813086,0.0000033013082,0.023530472,0.000054799453,0.0063972278,0.8711096,0.028444607,0.06781472],"study_design_scores_gemma":[0.0035308911,0.003852556,0.06494534,0.0018977441,0.00005652535,0.00004354273,0.0017869521,0.6224344,0.20147504,0.06741751,0.031442083,0.0011174435],"about_ca_topic_score_codex":0.00004895966,"about_ca_topic_score_gemma":0.0000017841538,"teacher_disagreement_score":0.8036921,"about_ca_system_score_codex":0.000020266232,"about_ca_system_score_gemma":0.000019717836,"threshold_uncertainty_score":0.24034403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823393,0.00006114847,0.008651569,0.00004922084,0.000050069295,0.0001352312,0.000027932037,0.000016464497,0.00866907],"genre_scores_gemma":[0.9970026,0.000004306268,0.0022517587,0.00038013936,0.000048563437,0.0000075508847,0.000059358183,0.0000059651425,0.00023973236],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992239,0.000024652312,0.000257822,0.000098016964,0.00014864473,0.00024696853],"domain_scores_gemma":[0.99946207,0.000010595169,0.00013152961,0.00023375232,0.000039049755,0.00012297703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062042,0.000119763434,0.00015527089,0.000030947776,0.000040387065,0.000020002266,0.00018066063,0.00008492,0.000016218168],"category_scores_gemma":[0.00007570063,0.00009160033,0.00007336095,0.00005897146,0.00006492369,0.00002091164,0.00023711118,0.00006466776,0.000021483542],"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.0003397384,0.0002538663,0.0012803522,0.00016359019,0.00009618243,0.0000018432042,0.0020632849,0.0009044064,0.96788615,0.00059909845,0.0027654232,0.023646092],"study_design_scores_gemma":[0.0017742076,0.001077531,0.0003976073,0.000039419836,0.000032612286,0.000019102246,0.0019514312,0.08236178,0.9097479,0.00018722255,0.002003938,0.00040723913],"about_ca_topic_score_codex":0.000012728626,"about_ca_topic_score_gemma":0.0000029843086,"teacher_disagreement_score":0.08145737,"about_ca_system_score_codex":0.000014807968,"about_ca_system_score_gemma":0.00006666,"threshold_uncertainty_score":0.3735353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3233721,0.0000497183,0.65244895,0.0009107891,0.00040945536,0.00028283,0.000013313786,0.000054489472,0.022458369],"genre_scores_gemma":[0.97641146,0.000022820559,0.022232354,0.0012717493,0.000040466417,0.0000029741202,0.0000021918725,0.0000042602837,0.000011745958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985962,0.00004091562,0.0006378108,0.00013850663,0.0002404317,0.0003461334],"domain_scores_gemma":[0.99877334,0.00021785991,0.000299125,0.0005554701,0.00007368746,0.00008051702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037458315,0.00015585776,0.0002641465,0.00006596248,0.00010600713,0.000078050245,0.0011296442,0.00008627965,0.000040619478],"category_scores_gemma":[0.000040025097,0.000113040966,0.0001805784,0.00024645563,0.0002637867,0.00078369887,0.0005472729,0.00023151973,0.000010979433],"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.0000182738,0.00007318832,0.00020411643,0.000021746617,0.000021521299,2.0843132e-7,0.0027814072,0.0015304955,0.00000786337,0.94847995,0.00014754997,0.046713706],"study_design_scores_gemma":[0.00048582465,0.00035200402,0.0028644283,0.00021466322,0.000017848282,0.00001936899,0.0003757605,0.6074622,0.0019242862,0.38576546,0.00030666575,0.00021146984],"about_ca_topic_score_codex":0.0000019595404,"about_ca_topic_score_gemma":2.2215306e-7,"teacher_disagreement_score":0.65303934,"about_ca_system_score_codex":0.00004795935,"about_ca_system_score_gemma":0.00007293422,"threshold_uncertainty_score":0.4609677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297616,0.000099245764,0.7874043,0.0005066836,0.00034043065,0.00015343222,0.000003240587,0.00048676814,0.08124431],"genre_scores_gemma":[0.9414586,0.00000626088,0.054376405,0.0032440948,0.00007344459,0.0000056059503,0.0000083239565,0.000007982371,0.0008192728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998965,0.0000136452545,0.00032735028,0.00011901705,0.00023998215,0.0003349992],"domain_scores_gemma":[0.99914145,0.00009165632,0.00008628329,0.0005526723,0.00002207442,0.00010586989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993034,0.000114405804,0.00011848872,0.0001188286,0.000085101055,0.00020402265,0.0008075253,0.000042249678,0.00012744374],"category_scores_gemma":[0.000029807057,0.00009567845,0.00005486189,0.00021214769,0.000046494908,0.001056631,0.00031679508,0.00010039315,0.00069411926],"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.000012205327,0.00008324019,0.0005963342,0.000071435345,0.00004608227,0.00004896156,0.008699308,0.000008088846,0.001999388,0.6626354,0.013979312,0.3118203],"study_design_scores_gemma":[0.0036139446,0.0007999262,0.020918299,0.0005258826,0.00004600236,0.0006787804,0.023006486,0.09457386,0.13142085,0.062058896,0.6598577,0.0024994097],"about_ca_topic_score_codex":0.000007752241,"about_ca_topic_score_gemma":0.0000031547322,"teacher_disagreement_score":0.811697,"about_ca_system_score_codex":0.000050923503,"about_ca_system_score_gemma":0.00001598064,"threshold_uncertainty_score":0.89217305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56513315,0.0011985748,0.23433563,0.0034087526,0.014156482,0.0012609323,0.000019603889,0.0012785494,0.1792083],"genre_scores_gemma":[0.97660416,0.000016707336,0.019712463,0.0029866095,0.0003214457,0.000037254173,0.000008202299,0.000010338791,0.00030281578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998496,0.000041757587,0.00044070964,0.000118406606,0.0003052802,0.0005978264],"domain_scores_gemma":[0.999006,0.000114287745,0.00010478996,0.00058618013,0.00001611738,0.00017265782],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007729043,0.00015806366,0.00018734002,0.00017097486,0.00008406918,0.00018961425,0.0008079284,0.00006036066,0.0003111452],"category_scores_gemma":[0.00003264602,0.00013669433,0.0000542197,0.00035805904,0.00003993306,0.0044577047,0.0004107475,0.00016378143,0.0013895473],"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.000020414598,0.00057591015,0.01909864,0.00023197675,0.00006470859,0.000011910765,0.039742496,0.000058561967,0.00039312674,0.73986566,0.0702501,0.12968652],"study_design_scores_gemma":[0.003252092,0.00024576188,0.06882788,0.0002903248,0.000025099644,0.00017196263,0.0040914374,0.09487398,0.0032537668,0.017820217,0.8054358,0.0017117132],"about_ca_topic_score_codex":0.000014118102,"about_ca_topic_score_gemma":0.0000038042535,"teacher_disagreement_score":0.7351857,"about_ca_system_score_codex":0.00010130118,"about_ca_system_score_gemma":0.000030797557,"threshold_uncertainty_score":0.999388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030039249,0.000022154689,0.9934957,0.0003697396,0.00020230433,0.0005620244,0.00011904601,0.00017573527,0.002049366],"genre_scores_gemma":[0.008902159,0.0000014578864,0.98870534,0.0015043089,0.00021362542,0.00013997221,0.00015456871,0.000018167868,0.0003604103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825066,0.000027753442,0.00046220716,0.0002766233,0.00046317134,0.0005195759],"domain_scores_gemma":[0.9986615,0.00015004615,0.00019423327,0.0007950633,0.000093581046,0.00010558483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026981704,0.00025254663,0.00024366372,0.00011338207,0.00028636918,0.0006706013,0.0011071279,0.00006900134,0.000029781288],"category_scores_gemma":[0.000010193308,0.00018680561,0.000061980885,0.00018267447,0.00007574542,0.0024546587,0.00056281197,0.00013573522,0.00006824345],"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.00013881037,0.00043232887,0.0007259273,0.00021878682,0.00016842356,0.000037207148,0.0023518242,0.0039361613,0.00063173566,0.023447564,0.30620846,0.66170275],"study_design_scores_gemma":[0.0028613387,0.00062129437,0.0004124246,0.00016285396,0.000025182859,0.00003969649,0.00018305841,0.9051784,0.004300634,0.0004557791,0.08518252,0.00057680777],"about_ca_topic_score_codex":0.0000573399,"about_ca_topic_score_gemma":0.0000066105636,"teacher_disagreement_score":0.90124226,"about_ca_system_score_codex":0.00009902658,"about_ca_system_score_gemma":0.000057469384,"threshold_uncertainty_score":0.7617712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013296239,0.000013245238,0.9466818,0.000121771736,0.0015243491,0.0007585221,0.00000216185,0.00006918761,0.037532724],"genre_scores_gemma":[0.9761753,2.881965e-7,0.023039848,0.0002725492,0.00021003168,0.00002853975,0.0000068182976,0.000005620945,0.00026097742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834365,0.00003308221,0.0005546084,0.00015459981,0.00058627746,0.00032776647],"domain_scores_gemma":[0.99897563,0.00010078315,0.00022149686,0.00051666435,0.00009181729,0.00009359523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010646449,0.00012707399,0.00017296946,0.000090763664,0.00020047551,0.00022869602,0.0009587183,0.00005151129,0.00001246771],"category_scores_gemma":[0.00008541025,0.00008476054,0.00007883518,0.0004174918,0.00007007386,0.00052948034,0.00038366058,0.00010060285,0.00006477089],"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.000015628846,0.00014242464,0.003716582,0.00023651021,0.00005543272,5.9288084e-7,0.013234122,0.00023498115,0.0002073501,0.9579526,0.0015424053,0.022661373],"study_design_scores_gemma":[0.0032197526,0.00069217343,0.030451741,0.00011915429,0.00007695937,0.00017273286,0.004911166,0.06262763,0.012963528,0.036792252,0.8465436,0.0014293222],"about_ca_topic_score_codex":0.000054521475,"about_ca_topic_score_gemma":0.000017979291,"teacher_disagreement_score":0.96287906,"about_ca_system_score_codex":0.000080948186,"about_ca_system_score_gemma":0.00009635562,"threshold_uncertainty_score":0.34564346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9515718,0.0000054873026,0.00009212268,0.00015124252,0.000065006934,0.00034057826,0.00003629122,0.000012688175,0.04772477],"genre_scores_gemma":[0.9989902,0.000024407727,0.00007897517,0.00013427458,0.00004023625,0.000039526603,0.00002281471,0.0000025621132,0.000667014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990484,0.00010946128,0.0002939361,0.000043561366,0.00038262797,0.00012201147],"domain_scores_gemma":[0.99942297,0.00014673913,0.00015251533,0.00013396065,0.00010196178,0.000041878895],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041039076,0.000062431216,0.00009526683,0.000043030028,0.00038304046,0.000012175018,0.0001770028,0.000038039292,0.0032718147],"category_scores_gemma":[0.0001059396,0.000042877513,0.00008580549,0.00016464212,0.000364132,0.00037803428,0.000020932708,0.00006379586,0.00008973888],"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.00028629217,0.001476191,0.22893487,0.00004181535,0.00023608386,0.0000029137123,0.11180172,0.001688039,0.0009545525,0.6118855,0.03651434,0.006177661],"study_design_scores_gemma":[0.0011150506,0.0012763672,0.9709028,0.00008753413,0.00006719508,0.0000123291275,0.010093486,0.0011339526,0.0013844564,0.002210608,0.011381153,0.00033504053],"about_ca_topic_score_codex":0.00015424482,"about_ca_topic_score_gemma":0.000022218144,"teacher_disagreement_score":0.741968,"about_ca_system_score_codex":0.00011136933,"about_ca_system_score_gemma":0.00025873084,"threshold_uncertainty_score":0.99763936},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19485202,0.00010660535,0.19484544,0.0001863929,0.0017512302,0.0005009288,0.000015225796,0.00020301584,0.6075392],"genre_scores_gemma":[0.91850656,0.000016514026,0.07948768,0.0014977177,0.000299415,0.0000059343,0.000011112172,0.000010536349,0.00016455584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837977,0.000033671018,0.0005806156,0.00014784491,0.00042448778,0.00043362376],"domain_scores_gemma":[0.99884266,0.0001694097,0.00022313805,0.0005715789,0.00005800818,0.00013522113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010749345,0.00015692203,0.00023153679,0.000101812155,0.00016601711,0.00023714728,0.0008827582,0.000075606775,0.00025726377],"category_scores_gemma":[0.000050041996,0.00012699443,0.000089802656,0.00038655562,0.00017116139,0.0008921673,0.0003360281,0.00014995802,0.00040556386],"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.00009005222,0.00020597166,0.002176976,0.00018067259,0.00007374401,0.00002894173,0.030852566,0.00014710882,0.000037791488,0.42910162,0.006620551,0.530484],"study_design_scores_gemma":[0.0075620483,0.0025203892,0.18376169,0.0005293649,0.00011094551,0.00031144838,0.013132926,0.094428055,0.0091097625,0.15516096,0.53019,0.003182414],"about_ca_topic_score_codex":0.000013170114,"about_ca_topic_score_gemma":0.0000059550644,"teacher_disagreement_score":0.7236545,"about_ca_system_score_codex":0.000050377053,"about_ca_system_score_gemma":0.00008748773,"threshold_uncertainty_score":0.5212838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11079495,0.00007504017,0.8180546,0.00018405264,0.00019282923,0.00015271772,0.000009402088,0.00025985544,0.070276536],"genre_scores_gemma":[0.96291417,0.000022910197,0.035832684,0.0011357375,0.000014114428,0.000015710697,0.0000045133106,0.000003688197,0.000056488992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.000026094873,0.00017751782,0.00008671424,0.000067401124,0.00015655578],"domain_scores_gemma":[0.9994785,0.00003856119,0.000051781262,0.00033371654,0.000021644692,0.00007580306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017533281,0.00009300535,0.00009055729,0.00009462576,0.000183026,0.00013847201,0.00039967222,0.000024858158,0.00010791692],"category_scores_gemma":[0.0000079652145,0.000071608614,0.000036634716,0.00020770048,0.000076442,0.00074524584,0.00022543376,0.000051830422,0.00004953882],"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.0000030152905,0.000030053963,0.0018808861,0.000013593934,0.000023285083,4.605435e-7,0.014520749,0.0000015262942,0.000051274437,0.96092916,0.0008015827,0.021744441],"study_design_scores_gemma":[0.0017916888,0.0008088769,0.032563124,0.00014436846,0.000043029002,0.00017610402,0.005773008,0.07993834,0.01473541,0.67498296,0.18755683,0.001486271],"about_ca_topic_score_codex":0.000009064336,"about_ca_topic_score_gemma":0.0000034001303,"teacher_disagreement_score":0.8521192,"about_ca_system_score_codex":0.000006886849,"about_ca_system_score_gemma":0.0000111720265,"threshold_uncertainty_score":0.29201144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925643,0.00014578665,0.0010985906,0.00006769393,0.000051955896,0.00008751361,0.00000613643,0.000017395832,0.005960589],"genre_scores_gemma":[0.9971855,0.00015238859,0.0013350128,0.0008722641,0.00007846698,0.000004935718,0.000079249956,0.0000034633226,0.00028866602],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948144,0.000016135018,0.0001787027,0.00009549185,0.00006642053,0.00016182411],"domain_scores_gemma":[0.99975306,0.00000800743,0.00005057089,0.000106394386,0.000021170514,0.000060792383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009111381,0.00008408702,0.00008858203,0.00001869934,0.00014598596,0.00001848753,0.000071815426,0.00006969124,0.000020849306],"category_scores_gemma":[0.000037596317,0.00006541396,0.000029977336,0.000035807177,0.00011627076,0.000006878989,0.00013455746,0.000049143924,0.00003222622],"study_design_candidate":"bench_or_experimental","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.00031382378,0.00031762672,0.23641084,0.00021531607,0.00020870051,0.000017889835,0.0018576988,0.0001494724,0.66844225,0.0028745225,0.051300224,0.03789165],"study_design_scores_gemma":[0.0032514571,0.003156813,0.26958495,0.00009826886,0.000045705332,0.00077787525,0.0014473504,0.009349134,0.24351668,0.0008714167,0.4664881,0.0014122513],"about_ca_topic_score_codex":0.000005043297,"about_ca_topic_score_gemma":0.0000020293003,"teacher_disagreement_score":0.42492554,"about_ca_system_score_codex":0.0000074735967,"about_ca_system_score_gemma":0.000016088276,"threshold_uncertainty_score":0.26675037},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938765,0.00007310525,0.0008543149,0.000038873433,0.0001329496,0.00011493975,0.000012112016,0.000029758912,0.004867438],"genre_scores_gemma":[0.9961192,0.000035269004,0.0023950574,0.0009883464,0.00024225221,0.0000046188848,0.00008252743,0.000008887666,0.0001238438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914557,0.000016302942,0.00029238997,0.00014473745,0.00011517982,0.0002858395],"domain_scores_gemma":[0.9996406,0.000011570794,0.00010034616,0.00013850695,0.000031700958,0.000077275676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102652084,0.00014865177,0.00014679132,0.000030062562,0.00024452095,0.00004007683,0.00016490128,0.000096176074,0.00005398802],"category_scores_gemma":[0.000043939803,0.0001195362,0.000080175494,0.00007425388,0.000108020395,0.000016638809,0.00015549196,0.00007652541,0.00003479298],"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.000046193538,0.000044724562,0.010155399,0.000034852324,0.000047366495,0.0000054772268,0.00048249602,0.000015406275,0.9860668,0.00010265334,0.00066491344,0.0023336818],"study_design_scores_gemma":[0.0013920078,0.0010565255,0.05077474,0.0000919283,0.00004189119,0.0005110736,0.0015262731,0.0025061707,0.71688694,0.00008526636,0.22397925,0.0011479632],"about_ca_topic_score_codex":0.0000067672595,"about_ca_topic_score_gemma":0.0000010512348,"teacher_disagreement_score":0.26917994,"about_ca_system_score_codex":0.000017091901,"about_ca_system_score_gemma":0.000037069312,"threshold_uncertainty_score":0.48745447},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81848896,0.000023928531,0.17547564,0.0006382945,0.00033816177,0.0002885215,0.00044352922,0.000056813824,0.0042461692],"genre_scores_gemma":[0.9848974,0.0000046752634,0.014089255,0.0004105116,0.000036257894,0.000012459369,0.000029190058,0.00000895965,0.0005112985],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9946367,0.00020472542,0.0023336567,0.00034162553,0.0021568062,0.0003264456],"domain_scores_gemma":[0.99043673,0.006541703,0.0009366817,0.0015525859,0.00032255577,0.00020974626],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019769522,0.00021416231,0.0008474656,0.0011690401,0.00013155969,0.00034728475,0.0013196181,0.0000857167,0.015940117],"category_scores_gemma":[0.004009698,0.00012140326,0.00041746613,0.0020779225,0.00020059408,0.0011057679,0.00041916542,0.00008650276,0.0024281542],"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.0005305988,0.00060488697,0.39862013,0.000012019825,0.002366583,0.000007751485,0.009902203,0.00087683613,0.009561578,0.003834891,0.14670652,0.426976],"study_design_scores_gemma":[0.004400359,0.00015309712,0.6878294,0.00015663488,0.0008653195,0.0000017983625,0.003810174,0.11063471,0.0037334815,0.0031008008,0.18465398,0.00066026265],"about_ca_topic_score_codex":0.000058266603,"about_ca_topic_score_gemma":0.00006290435,"teacher_disagreement_score":0.42631572,"about_ca_system_score_codex":0.00007964502,"about_ca_system_score_gemma":0.00006219064,"threshold_uncertainty_score":0.9983486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031173063,0.0000075462567,0.9627468,0.00058345357,0.00047369936,0.00093565823,0.0004783321,0.000117564734,0.0034838857],"genre_scores_gemma":[0.9394584,0.000009952979,0.05456708,0.000096232005,0.00052704744,0.00046217442,0.00091311306,0.000060975988,0.0039050505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726415,0.000030237883,0.0010259341,0.00030779367,0.0006241608,0.0007476975],"domain_scores_gemma":[0.996624,0.00060418044,0.00081954186,0.0013571717,0.00036272162,0.00023236977],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039017538,0.00036172388,0.0005314854,0.0002845094,0.002998538,0.00078944035,0.00081387855,0.00017969818,0.0024417238],"category_scores_gemma":[0.0008498614,0.00033686598,0.00044037393,0.00013828141,0.0003109506,0.0011502793,0.00040731742,0.000281043,0.0004452522],"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.00046702524,0.0071776337,0.0047923154,0.0020426481,0.00522103,0.000004802011,0.0040494865,0.0020158775,0.0026499883,0.84750706,0.08753515,0.036536958],"study_design_scores_gemma":[0.002546405,0.00014379018,0.003206397,0.00010281725,0.0008069332,0.0000047116805,0.00074790267,0.93735844,0.000607001,0.046178564,0.007663578,0.00063345634],"about_ca_topic_score_codex":0.000116295996,"about_ca_topic_score_gemma":0.00020109508,"teacher_disagreement_score":0.93534255,"about_ca_system_score_codex":0.00022946774,"about_ca_system_score_gemma":0.00018135343,"threshold_uncertainty_score":0.9999083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02803076,0.000002035377,0.94746184,0.00013132778,0.00025490083,0.0002474529,0.000080673264,0.000092821385,0.02369816],"genre_scores_gemma":[0.81762916,0.000009409609,0.17812113,0.0032196988,0.000090244845,0.000026810148,0.0005003397,0.000010597843,0.00039262103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869245,0.000013821278,0.00036816302,0.0001056155,0.0005965042,0.0002234369],"domain_scores_gemma":[0.9989763,0.000072659146,0.00022857795,0.0005706466,0.000094850446,0.000056974302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024334542,0.00013837044,0.00013717657,0.00018638477,0.00015721483,0.00023381111,0.00052091514,0.000019153136,0.000515601],"category_scores_gemma":[0.000034155306,0.00010626659,0.000026721225,0.00036665617,0.00012665229,0.006728293,0.0004783852,0.00007202205,0.0007115132],"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.00019515939,0.00024436845,0.0053255428,0.0004407469,0.00021748953,0.0000040399414,0.0026342098,0.0007548471,0.00008594707,0.82536024,0.12138733,0.043350097],"study_design_scores_gemma":[0.0046226108,0.0031871481,0.053049386,0.0006076301,0.000095959615,0.000048505663,0.0011884997,0.5706326,0.006953308,0.0065194312,0.35179427,0.0013006425],"about_ca_topic_score_codex":0.000042675656,"about_ca_topic_score_gemma":0.0000165405,"teacher_disagreement_score":0.8188408,"about_ca_system_score_codex":0.00004142495,"about_ca_system_score_gemma":0.000041233525,"threshold_uncertainty_score":0.91453004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002834573,0.000048727543,0.9830236,0.00085793703,0.0003368541,0.00077139505,0.000007961128,0.00013917481,0.011979768],"genre_scores_gemma":[0.080304965,0.00007364277,0.9172083,0.00090610393,0.000043177428,0.00016819859,0.000020788504,0.000012722148,0.0012621011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.000032780816,0.00058652944,0.00019534964,0.00030981287,0.00035166263],"domain_scores_gemma":[0.9962709,0.00003747024,0.00051973504,0.0028794685,0.000107046784,0.00018539267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622933,0.00018343453,0.00020916369,0.00010024651,0.0007552805,0.0009861343,0.0031155313,0.00008525605,0.000024069543],"category_scores_gemma":[0.00029658238,0.00017382353,0.00011239339,0.00007666966,0.00010493558,0.0027777106,0.0008307997,0.00015270789,0.00026648815],"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.000020755768,0.000070448594,0.00012312832,0.00007513183,0.00004058304,1.4573047e-7,0.00815758,0.000734704,0.00006307736,0.8293892,0.009344355,0.15198089],"study_design_scores_gemma":[0.00043313784,0.000066879235,0.0007440687,0.000053955388,0.0000134206575,0.0000047506187,0.000141664,0.94573814,0.004232787,0.013906949,0.034436993,0.0002272292],"about_ca_topic_score_codex":0.00004327249,"about_ca_topic_score_gemma":0.000006140683,"teacher_disagreement_score":0.94500345,"about_ca_system_score_codex":0.00017522911,"about_ca_system_score_gemma":0.00014305707,"threshold_uncertainty_score":0.95093155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8593495,0.00010140949,0.016985845,0.000246742,0.0004113692,0.00035187276,0.000010582329,0.0004412497,0.12210146],"genre_scores_gemma":[0.9963941,0.00013595611,0.0030995633,0.000100521414,0.000031328127,0.000023882563,0.00000779128,0.000010860761,0.00019598917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994595,0.0000029575567,0.0002000794,0.000084253974,0.000100152465,0.00015306374],"domain_scores_gemma":[0.9991012,0.000012070051,0.000052061245,0.0007473126,0.000017215796,0.00007013647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013645795,0.00009154521,0.000095515126,0.000029965826,0.00022179764,0.0002715163,0.0002088971,0.000040550723,0.00006808839],"category_scores_gemma":[0.00002443945,0.000084811436,0.000019213318,0.000017332473,0.000026642785,0.00054772105,0.00006738761,0.0000729189,0.00026533232],"study_design_candidate":"design_other","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.000027742468,0.00015925705,0.04234873,0.0018348128,0.00046077592,0.000012700983,0.015040131,0.0019870317,0.0067430884,0.043814838,0.06136314,0.82620776],"study_design_scores_gemma":[0.0006400966,0.00012995637,0.097224735,0.00013395249,0.000053636304,0.000058721016,0.0004845506,0.46259704,0.034198508,0.0010481976,0.40264434,0.0007862624],"about_ca_topic_score_codex":0.000016563507,"about_ca_topic_score_gemma":0.000005385157,"teacher_disagreement_score":0.8254215,"about_ca_system_score_codex":0.0000326764,"about_ca_system_score_gemma":0.000005942413,"threshold_uncertainty_score":0.345851},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072282306,0.00024165743,0.9567531,0.0003287839,0.0021319776,0.0006978288,0.00019163052,0.00023642344,0.032190364],"genre_scores_gemma":[0.21853817,0.0007216779,0.76386994,0.0025353343,0.00046479618,0.0001519657,0.0007719075,0.00007707941,0.01286912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849194,0.000033672655,0.0004842094,0.00033487377,0.00033976033,0.00031556524],"domain_scores_gemma":[0.9981994,0.000060197253,0.00033163972,0.0012183186,0.00005798232,0.00013245847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020501253,0.00028486637,0.00038155032,0.00014106846,0.00011359777,0.00031963928,0.00069980463,0.0001427198,0.00006691666],"category_scores_gemma":[0.000018715606,0.00025953446,0.00008955824,0.000092218754,0.00008965705,0.0014691984,0.003947072,0.00036146565,0.00043859606],"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.000018707835,0.00005073524,0.0004963355,0.0020530897,0.00019769874,0.000023812057,0.0076049725,0.00079924276,0.000042325555,0.9544982,0.014826434,0.019388469],"study_design_scores_gemma":[0.00081888115,0.00011932348,0.00047868912,0.0006927933,0.000034333312,0.00006215802,0.0012752647,0.04627399,0.00021081908,0.002794358,0.94634825,0.00089113024],"about_ca_topic_score_codex":0.000075647455,"about_ca_topic_score_gemma":0.0000053476315,"teacher_disagreement_score":0.95170385,"about_ca_system_score_codex":0.00010350994,"about_ca_system_score_gemma":0.0001491438,"threshold_uncertainty_score":0.9999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33977544,0.000022444783,0.33813685,0.0021494497,0.00067812396,0.0013055328,0.000011957425,0.00016481557,0.31775537],"genre_scores_gemma":[0.97834885,0.000004046957,0.020374533,0.0011811756,0.00001932429,0.000009839476,0.0000035267149,0.000002328894,0.000056355126],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904335,0.000051042876,0.00035783806,0.00007114008,0.00028137496,0.0001952471],"domain_scores_gemma":[0.99939567,0.00012312582,0.000110641115,0.0002938843,0.00004360894,0.000033096694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061362516,0.00006345692,0.00008821857,0.00009909982,0.00008991947,0.00015265502,0.000740644,0.000021054122,0.00007116063],"category_scores_gemma":[0.00009058766,0.000044483648,0.000019931615,0.00029916043,0.00007150092,0.0004813396,0.00017183728,0.00007289502,0.00012311769],"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.00008550752,0.0009175739,0.034770884,0.0011485902,0.00013074347,0.00005391719,0.33060187,0.004659953,0.00072839804,0.29931667,0.022963474,0.30462244],"study_design_scores_gemma":[0.00096611277,0.0004417374,0.00938137,0.00021256032,0.0000051790976,0.000028930825,0.0017140125,0.96698046,0.0007755126,0.0015537333,0.017710013,0.00023035226],"about_ca_topic_score_codex":0.000017412964,"about_ca_topic_score_gemma":0.000011283938,"teacher_disagreement_score":0.9623205,"about_ca_system_score_codex":0.000018498185,"about_ca_system_score_gemma":0.00003657009,"threshold_uncertainty_score":0.18139905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07217985,0.000082080216,0.9230404,0.00025349704,0.0009615043,0.0007345591,0.0000065595286,0.00026864576,0.0024729427],"genre_scores_gemma":[0.87037367,0.00000395404,0.12824458,0.0009654629,0.00017466386,0.00012959407,0.00000722367,0.000014320049,0.000086518034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812216,0.00003073837,0.00055490923,0.00028911413,0.0003850496,0.00061801524],"domain_scores_gemma":[0.9985928,0.0001284887,0.0002583841,0.00060796784,0.000249716,0.00016264978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033194956,0.0002485338,0.0003124913,0.00014017007,0.00054780795,0.00031775716,0.0010330265,0.00007988904,0.000020284237],"category_scores_gemma":[0.000053747317,0.00022267636,0.00012590764,0.00061562797,0.00021430038,0.00247931,0.00024933042,0.00020910002,0.00010938297],"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.000549989,0.00041565296,0.015139711,0.00047117274,0.00028110106,0.0000069524126,0.062447555,0.0035342476,0.0010893374,0.24686676,0.029895732,0.6393018],"study_design_scores_gemma":[0.0024460007,0.0014500784,0.0029565394,0.00032022645,0.000034863715,0.000047310317,0.001867408,0.906488,0.00808665,0.017841669,0.057415944,0.0010453311],"about_ca_topic_score_codex":0.0000056728895,"about_ca_topic_score_gemma":0.000017876266,"teacher_disagreement_score":0.90295374,"about_ca_system_score_codex":0.00008445738,"about_ca_system_score_gemma":0.000048849866,"threshold_uncertainty_score":0.90804785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955393,0.000049981107,0.40002123,0.00014299116,0.0002462728,0.0013871724,0.000069014786,0.000033654578,0.002510391],"genre_scores_gemma":[0.8924652,0.0000011400143,0.10520721,0.0006073436,0.0005721613,0.00028189342,0.0005199508,0.000020950054,0.00032420125],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921507,0.0000075285125,0.00025391582,0.00014743094,0.00014112733,0.00023495793],"domain_scores_gemma":[0.9994781,0.0000069797447,0.00010565501,0.00024600874,0.00010269865,0.00006054831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016305779,0.00013041076,0.00010279958,0.000036379817,0.00017037959,0.000049195132,0.00014772126,0.000105547115,0.000036745972],"category_scores_gemma":[0.000056802022,0.000113988746,0.000065537024,0.000055206598,0.00008991183,0.000018662502,0.000107748834,0.000045729437,0.000031434305],"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.0008433685,0.00016183461,0.0011176498,0.0004928215,0.00038808482,0.000001057167,0.0006142741,0.00015889997,0.76422733,0.023228884,0.012350705,0.19641508],"study_design_scores_gemma":[0.0042227837,0.0037429614,0.0012729745,0.00014620739,0.0000742347,0.000054500328,0.000223675,0.16950126,0.6435791,0.023562783,0.15246102,0.0011584811],"about_ca_topic_score_codex":0.000004606581,"about_ca_topic_score_gemma":0.00001760031,"teacher_disagreement_score":0.29692584,"about_ca_system_score_codex":0.000021270373,"about_ca_system_score_gemma":0.000046480855,"threshold_uncertainty_score":0.4648326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7527221,0.000013832868,0.2453171,0.00014771965,0.00007332375,0.0002194499,0.000021662861,0.000013275613,0.0014715597],"genre_scores_gemma":[0.9780363,0.000005880757,0.02154649,0.00024139024,0.000003066117,0.000004226274,0.000012447598,0.0000029814028,0.00014723069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911904,0.000019666271,0.00037357962,0.00010133546,0.00026711027,0.00011926006],"domain_scores_gemma":[0.99930257,0.000051022118,0.00021178069,0.0003193311,0.00007952293,0.000035752877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012357248,0.00008657954,0.00013978798,0.00009854519,0.000044788954,0.00004168992,0.00030683415,0.00002639303,0.000009117083],"category_scores_gemma":[0.000014358691,0.00006508717,0.00004294711,0.00024161473,0.000038355305,0.0005816479,0.00028567377,0.00006872473,0.000006536953],"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.00002646628,0.0001059594,0.0019629088,0.00020923567,0.000052196574,1.9273496e-7,0.006703507,0.9124899,0.0074118944,0.06435194,0.00023035862,0.006455437],"study_design_scores_gemma":[0.0006006765,0.000048209902,0.0011843123,0.00004520869,0.00000542307,0.000005023482,0.00012360483,0.9946605,0.0007965721,0.0024388556,0.000024249277,0.000067367786],"about_ca_topic_score_codex":0.000007515391,"about_ca_topic_score_gemma":0.0000029648952,"teacher_disagreement_score":0.22531421,"about_ca_system_score_codex":0.00003202737,"about_ca_system_score_gemma":0.000084286374,"threshold_uncertainty_score":0.26541778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26314765,0.000097090655,0.6069908,0.0006298582,0.0009324443,0.00026021097,0.000011685819,0.001029904,0.12690035],"genre_scores_gemma":[0.98235524,0.0000017289356,0.01629951,0.0007968638,0.000060314018,0.000015804699,0.00001234938,0.0000054383318,0.0004527811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908465,0.000017859853,0.00031945627,0.00011399036,0.00020788464,0.00025612878],"domain_scores_gemma":[0.9993539,0.00006705926,0.000082726096,0.0004245057,0.000023073728,0.000048747443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015866535,0.00011937016,0.00012346641,0.000084075735,0.00009886129,0.0003288381,0.0006669754,0.000035701607,0.00013106687],"category_scores_gemma":[0.000012555159,0.000100153164,0.000055870918,0.00023044596,0.000051021263,0.0012981029,0.00019596983,0.00007841449,0.00043625614],"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.000007657281,0.00007911963,0.00128043,0.000049931863,0.000024718163,0.0000074189747,0.0026861005,0.00004076978,0.0009267125,0.93815863,0.024465544,0.032272957],"study_design_scores_gemma":[0.002788145,0.0006034523,0.028898535,0.00027231508,0.000036184738,0.00023225494,0.00225778,0.42409277,0.033789426,0.21418303,0.2908304,0.0020157206],"about_ca_topic_score_codex":0.000038275502,"about_ca_topic_score_gemma":0.0000038616377,"teacher_disagreement_score":0.7239756,"about_ca_system_score_codex":0.000047153862,"about_ca_system_score_gemma":0.000024807667,"threshold_uncertainty_score":0.56073356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6618084,0.00006570923,0.31554398,0.00006941423,0.0012152256,0.0021495237,0.000005356073,0.00022117974,0.018921236],"genre_scores_gemma":[0.9982255,0.0000011045513,0.0014936901,0.00004721692,0.000032600405,0.000030408728,0.00001922792,0.000006544524,0.0001437127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815917,0.000058976006,0.0007744145,0.0001987315,0.000512707,0.0002959947],"domain_scores_gemma":[0.9984196,0.000096406555,0.0004065692,0.0008418328,0.00012931507,0.00010631506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010410955,0.000153745,0.00029648966,0.00009791466,0.00008096757,0.00025135162,0.00057545886,0.000099218545,0.000055904427],"category_scores_gemma":[0.00004148969,0.00012125693,0.00007288698,0.0002202989,0.00003262434,0.002146925,0.00013475215,0.00013457413,0.00029342173],"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.00002166109,0.00034695628,0.069117576,0.003502141,0.000090890426,0.0000020994637,0.01685642,0.001077708,0.00058148603,0.8795973,0.00022118133,0.028584592],"study_design_scores_gemma":[0.0024567943,0.0018903844,0.11114328,0.0001718552,0.000043919004,0.000072610346,0.0038530265,0.842324,0.0036850718,0.012342434,0.020916881,0.0010997147],"about_ca_topic_score_codex":0.00034216236,"about_ca_topic_score_gemma":0.000017645014,"teacher_disagreement_score":0.86725485,"about_ca_system_score_codex":0.00008743383,"about_ca_system_score_gemma":0.00008919135,"threshold_uncertainty_score":0.49447143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001639939,0.00062319695,0.9645638,0.0008819575,0.004329048,0.0005234653,0.00010211876,0.0004739282,0.026862552],"genre_scores_gemma":[0.31269765,0.00028546265,0.67856574,0.0048670187,0.0009459046,0.0002794776,0.00048890704,0.000054195938,0.0018156185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977863,0.000044530734,0.0006364667,0.00034086054,0.0006171307,0.00057470484],"domain_scores_gemma":[0.99712694,0.00006292078,0.0004023671,0.0020689266,0.000075137985,0.00026371682],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004024888,0.00036909326,0.00036620887,0.00013713661,0.00018100954,0.00076565007,0.0026050913,0.00023885732,0.00026065297],"category_scores_gemma":[0.000023841903,0.00031327218,0.00014322167,0.00014983866,0.00006309336,0.0020586897,0.007162992,0.00073449925,0.0020098824],"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.000030639887,0.0007675297,0.0016275293,0.0019987077,0.00035338837,0.000030016223,0.017413527,0.00077643874,0.00009634478,0.33697253,0.3444603,0.295473],"study_design_scores_gemma":[0.00087715447,0.000095576266,0.0031786906,0.0008845267,0.00005262306,0.00007659951,0.00016717728,0.21419056,0.00080680184,0.02160283,0.7561428,0.0019246646],"about_ca_topic_score_codex":0.00003619325,"about_ca_topic_score_gemma":9.670455e-7,"teacher_disagreement_score":0.4116825,"about_ca_system_score_codex":0.00013095583,"about_ca_system_score_gemma":0.00013432297,"threshold_uncertainty_score":0.99993193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968753,0.00008081254,0.14011644,0.00084929523,0.001748221,0.0005467778,0.000017566854,0.0005650969,0.059200488],"genre_scores_gemma":[0.99101573,0.000013519826,0.0068270257,0.0015340056,0.00002972532,0.000030496522,0.000014826135,0.0000049327905,0.00052973256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.000016820175,0.0003885705,0.00019133063,0.00033959546,0.00039074448],"domain_scores_gemma":[0.99887156,0.00009177666,0.00012775644,0.00075940375,0.00003148476,0.00011800021],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003307932,0.00015292304,0.0001665642,0.00012957245,0.00013717845,0.0004007799,0.0010409788,0.000047988193,0.000675451],"category_scores_gemma":[0.000012414748,0.0001337689,0.00007673408,0.00036462076,0.00003523203,0.002054526,0.0005487218,0.00015801542,0.0035108046],"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.0000457872,0.00028362215,0.009932475,0.00035804696,0.00009943642,0.000007962419,0.015339555,0.0005046773,0.0024112535,0.8748114,0.019661859,0.076543905],"study_design_scores_gemma":[0.0085413195,0.0012026491,0.008071205,0.0012569835,0.000063616346,0.0002226151,0.006668586,0.53564215,0.027437573,0.028162712,0.37941915,0.003311432],"about_ca_topic_score_codex":0.000010639098,"about_ca_topic_score_gemma":9.929295e-7,"teacher_disagreement_score":0.8466487,"about_ca_system_score_codex":0.00007656136,"about_ca_system_score_gemma":0.00005949169,"threshold_uncertainty_score":0.9972651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524821,0.000050181432,0.00017291335,0.000038934493,0.0001032179,0.00016367163,0.0000037282207,0.000014279967,0.04697095],"genre_scores_gemma":[0.9974851,0.000011305758,0.00075325917,0.000719414,0.00006281018,0.000006328066,0.00008481825,0.0000053494223,0.00087161764],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992482,0.000017073286,0.0002344369,0.000114115785,0.00008230574,0.00030386235],"domain_scores_gemma":[0.99970657,0.000013011711,0.000055800592,0.00017023555,0.000010319897,0.000044092776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021024722,0.000098778124,0.00010788708,0.000042833224,0.000031827112,0.000033602082,0.00016234856,0.00008029174,0.00026108304],"category_scores_gemma":[0.000027134409,0.0000784475,0.0000478553,0.00007924606,0.000020170777,0.000015243009,0.00020692365,0.000089225585,0.00027207163],"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.0003404952,0.00021059654,0.38143042,0.00029358247,0.00010084976,0.000013104121,0.0009931473,0.00042939043,0.43770063,0.0037405775,0.003206119,0.17154106],"study_design_scores_gemma":[0.006012474,0.0024566476,0.14419222,0.00028603032,0.000022549753,0.00008895666,0.0075789746,0.004935449,0.12444455,0.00028587025,0.7080572,0.0016390607],"about_ca_topic_score_codex":0.0000063914904,"about_ca_topic_score_gemma":0.000004551778,"teacher_disagreement_score":0.7048511,"about_ca_system_score_codex":0.000016907612,"about_ca_system_score_gemma":0.000014917059,"threshold_uncertainty_score":0.34970212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94472873,0.000020777992,0.0003920074,0.025704816,0.00018261552,0.0008845925,0.00019905274,0.00007598831,0.02781142],"genre_scores_gemma":[0.9961902,0.000012735742,0.0017978838,0.0015986039,0.00005620025,0.000044880624,0.000027248088,8.2334606e-7,0.0002714446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860907,0.00015137889,0.0003207796,0.00014523986,0.0005340843,0.00023943465],"domain_scores_gemma":[0.9982283,0.0013046517,0.00016673996,0.0000956816,0.00006365815,0.00014098432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052733073,0.000110900764,0.00016219387,0.000016621525,0.00030898422,0.00008761718,0.0003440605,0.00003152565,0.0009793178],"category_scores_gemma":[0.00049800164,0.000033877826,0.00010030957,0.0005626036,0.00020466857,0.00014526956,0.00011168731,0.00020694305,0.00024626762],"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.0009198299,0.0012470515,0.0070796637,0.00023928205,0.00024813408,0.00000854455,0.0071231676,0.0021150652,0.07557333,0.27930713,0.50172794,0.12441088],"study_design_scores_gemma":[0.0010291098,0.006555939,0.052028883,0.00029958715,0.00006316747,0.0000131387405,0.03943437,0.017810091,0.0327492,0.004789126,0.8443301,0.0008973249],"about_ca_topic_score_codex":0.000013846325,"about_ca_topic_score_gemma":0.000015188619,"teacher_disagreement_score":0.34260213,"about_ca_system_score_codex":0.000028110197,"about_ca_system_score_gemma":0.000019745214,"threshold_uncertainty_score":0.9999339},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938765,0.00007310525,0.0008543149,0.000038873433,0.0001329496,0.00011493975,0.000012112016,0.000029758912,0.004867438],"genre_scores_gemma":[0.9961192,0.000035269004,0.0023950574,0.0009883464,0.00024225221,0.0000046188848,0.00008252743,0.000008887666,0.0001238438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914557,0.000016302942,0.00029238997,0.00014473745,0.00011517982,0.0002858395],"domain_scores_gemma":[0.9996406,0.000011570794,0.00010034616,0.00013850695,0.000031700958,0.000077275676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102652084,0.00014865177,0.00014679132,0.000030062562,0.00024452095,0.00004007683,0.00016490128,0.000096176074,0.00005398802],"category_scores_gemma":[0.000043939803,0.0001195362,0.000080175494,0.00007425388,0.000108020395,0.000016638809,0.00015549196,0.00007652541,0.00003479298],"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.000046193538,0.000044724562,0.010155399,0.000034852324,0.000047366495,0.0000054772268,0.00048249602,0.000015406275,0.9860668,0.00010265334,0.00066491344,0.0023336818],"study_design_scores_gemma":[0.0013920078,0.0010565255,0.05077474,0.0000919283,0.00004189119,0.0005110736,0.0015262731,0.0025061707,0.71688694,0.00008526636,0.22397925,0.0011479632],"about_ca_topic_score_codex":0.0000067672595,"about_ca_topic_score_gemma":0.0000010512348,"teacher_disagreement_score":0.26917994,"about_ca_system_score_codex":0.000017091901,"about_ca_system_score_gemma":0.000037069312,"threshold_uncertainty_score":0.48745447},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900067,0.00012793601,0.40666115,0.0010509108,0.00021632764,0.00028100045,0.0000236737,0.000114539405,0.0015177615],"genre_scores_gemma":[0.6470198,0.000009923766,0.35230738,0.0006266293,0.000019422298,0.0000026914481,0.0000030323622,0.0000035769895,0.0000075474577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892277,0.000048088506,0.00046147258,0.00014228103,0.0002603467,0.00016505636],"domain_scores_gemma":[0.99929,0.000060982595,0.00022665561,0.00026975622,0.00003763855,0.00011495144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016395286,0.00012474053,0.00020151799,0.000060689297,0.0000570506,0.00014328954,0.0006288253,0.000053621217,0.00006887915],"category_scores_gemma":[0.00009659446,0.0001058618,0.00003768248,0.00024655287,0.000104596846,0.0016463816,0.00022797882,0.00013529026,0.000018795181],"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.00009272958,0.0000826709,0.0031954423,0.00152373,0.00014814417,0.0000029454163,0.081717096,0.000111658555,0.014823582,0.32808477,0.002739603,0.56747764],"study_design_scores_gemma":[0.0020986255,0.0018668756,0.029797845,0.00020242158,0.00006205192,0.00008614399,0.006856415,0.77902323,0.1379034,0.0062065236,0.034944687,0.0009517694],"about_ca_topic_score_codex":0.0000048064735,"about_ca_topic_score_gemma":0.0000013405448,"teacher_disagreement_score":0.7789116,"about_ca_system_score_codex":0.000016150212,"about_ca_system_score_gemma":0.000025616648,"threshold_uncertainty_score":0.43169188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27186254,0.000020240266,0.7262743,0.00047093342,0.000048966394,0.00021115836,0.0000039070733,0.00009620835,0.0010117693],"genre_scores_gemma":[0.88794935,9.761458e-7,0.11127824,0.00075726456,0.000004509183,0.0000028651355,9.885063e-7,0.0000046534533,0.0000011611556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991132,0.000032133026,0.0002924058,0.00012730509,0.00027965792,0.00015529613],"domain_scores_gemma":[0.9994097,0.000034789533,0.00020208526,0.00018351187,0.000110735135,0.00005922818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016710858,0.00010444199,0.00013003836,0.000057684847,0.00013176129,0.00018265785,0.0003588056,0.000028748464,0.0000019776278],"category_scores_gemma":[0.0000856599,0.00007463895,0.000031839987,0.0005572908,0.00016725504,0.0005432758,0.0006302261,0.00009380353,0.0000037603625],"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.000094797244,0.00087830896,0.0074349227,0.0024562771,0.00021926584,0.000008536129,0.17232944,0.016637288,0.019427717,0.6649552,0.0011334614,0.114424795],"study_design_scores_gemma":[0.00025805127,0.000092856775,0.00036169591,0.00012888823,0.000011920725,0.000008011436,0.00043046204,0.9808925,0.0087662265,0.008850143,0.00007842644,0.000120825265],"about_ca_topic_score_codex":0.0000045418465,"about_ca_topic_score_gemma":2.6395958e-7,"teacher_disagreement_score":0.9642552,"about_ca_system_score_codex":0.000026592908,"about_ca_system_score_gemma":0.0000431882,"threshold_uncertainty_score":0.3043688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025448726,0.0012727305,0.097837865,0.006039791,0.005926177,0.0012464363,0.000072009505,0.0005318086,0.8616245],"genre_scores_gemma":[0.8727094,0.00015496211,0.109847434,0.009889612,0.00058133446,0.00005833466,0.000056133536,0.00004147852,0.006661322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710613,0.00008252486,0.00081665174,0.0003109802,0.0008938078,0.00078991445],"domain_scores_gemma":[0.99763715,0.00007253084,0.00030014294,0.0011451878,0.00014721049,0.00069778523],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00080790336,0.00035534412,0.0003780881,0.00013248125,0.00020219949,0.0012377424,0.0015821788,0.00015913567,0.0003078969],"category_scores_gemma":[0.00010281835,0.00029804924,0.0001250242,0.00052797684,0.00016321846,0.0023394553,0.0010509177,0.00031894378,0.011092185],"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.00008915086,0.000641384,0.0027801238,0.00043513643,0.00024819915,0.00007474528,0.07266475,0.001035815,0.000011201897,0.1461744,0.54057384,0.23527126],"study_design_scores_gemma":[0.0017828502,0.0008627824,0.0013379744,0.00012900402,0.00003981328,0.000090247304,0.0027096362,0.15660524,0.00007757044,0.005246248,0.83038205,0.0007365714],"about_ca_topic_score_codex":0.00007163774,"about_ca_topic_score_gemma":0.0000045716733,"teacher_disagreement_score":0.8549631,"about_ca_system_score_codex":0.0002436648,"about_ca_system_score_gemma":0.00038372545,"threshold_uncertainty_score":0.9999472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16369225,0.00076975574,0.15255722,0.00060037116,0.0042609945,0.0011661694,0.000080462814,0.0009459083,0.67592686],"genre_scores_gemma":[0.95313525,0.00010461396,0.03836547,0.0037613378,0.00014510883,0.000038908347,0.0000147960745,0.000031463667,0.004403033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746037,0.00007966826,0.0008408031,0.0003240472,0.0005118035,0.00078332645],"domain_scores_gemma":[0.9978511,0.0000890849,0.00034284827,0.0013297122,0.000067114546,0.0003201516],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006319469,0.00037229416,0.00035325377,0.00016024314,0.0002686293,0.0004937306,0.0018948154,0.00015064591,0.004062138],"category_scores_gemma":[0.00003958801,0.00033375047,0.00016560443,0.00042592606,0.00021505529,0.002708952,0.0010082452,0.00030124534,0.010222655],"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.00007213405,0.000723005,0.0017826246,0.00060344243,0.00031483464,0.000057487516,0.12536128,0.000008309013,0.00021573869,0.65779424,0.03641239,0.1766545],"study_design_scores_gemma":[0.005789402,0.003060381,0.04226717,0.0017749007,0.00035848413,0.0005659095,0.016736893,0.33533996,0.02166614,0.07716112,0.4901833,0.0050963573],"about_ca_topic_score_codex":0.0000693156,"about_ca_topic_score_gemma":0.0000028673414,"teacher_disagreement_score":0.789443,"about_ca_system_score_codex":0.000103572216,"about_ca_system_score_gemma":0.00012824073,"threshold_uncertainty_score":0.9999114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00733154,0.00033631444,0.44675013,0.00017007822,0.001644008,0.0015791188,0.000029970748,0.0012177478,0.54094106],"genre_scores_gemma":[0.77788347,0.00008134889,0.21390073,0.0017646375,0.00014260488,0.00015493983,0.0000090180865,0.00004850335,0.006014747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996366,0.00018165016,0.0013660444,0.0004143908,0.00077502045,0.0008968602],"domain_scores_gemma":[0.9968393,0.0000968106,0.0005989237,0.0019365099,0.0001586393,0.00036983384],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010705632,0.0004800796,0.00050886825,0.00028632657,0.0002467221,0.00056133315,0.0025473877,0.00026723015,0.0015259291],"category_scores_gemma":[0.00006458734,0.0004540155,0.0001939005,0.0005867894,0.00021252513,0.0033443137,0.0010178708,0.00042631006,0.0073887617],"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.000084772066,0.00084918004,0.0038765664,0.0018531034,0.00049044524,0.00010580055,0.22404273,0.000003868347,0.0006981002,0.53121644,0.1531877,0.083591275],"study_design_scores_gemma":[0.00480336,0.0067143994,0.014558241,0.004526447,0.0004129954,0.0011560298,0.011676197,0.1076506,0.1516826,0.051185578,0.63809144,0.007542094],"about_ca_topic_score_codex":0.00019514133,"about_ca_topic_score_gemma":0.0000067426513,"teacher_disagreement_score":0.7705519,"about_ca_system_score_codex":0.00025334232,"about_ca_system_score_gemma":0.00021190285,"threshold_uncertainty_score":0.99979115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066940725,0.00002418164,0.92229426,0.00012796532,0.00039164853,0.0011696176,0.000008906847,0.00020308333,0.008839606],"genre_scores_gemma":[0.19762552,0.000009768951,0.80154204,0.00050684315,0.000023344912,0.00019899836,0.0000113537335,0.000008806946,0.000073315685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846035,0.0000357506,0.0005905649,0.00023202682,0.00022594127,0.00045536575],"domain_scores_gemma":[0.99885005,0.0000626088,0.0003158386,0.00051228196,0.00010466202,0.00015454697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078970124,0.00020806235,0.00022429337,0.000152533,0.00021123397,0.00023929637,0.0006559196,0.000104121296,0.000026374875],"category_scores_gemma":[0.00010156593,0.00017822812,0.0000659409,0.0002547543,0.00014234243,0.0018405741,0.00028924187,0.00014345847,0.000060520724],"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.000017564176,0.000072978786,0.00041675678,0.00019438205,0.00004241541,0.0000013444536,0.008497757,3.5728854e-7,0.00045259696,0.45965856,0.00009066924,0.53055465],"study_design_scores_gemma":[0.009024795,0.0044724434,0.021821216,0.0010564771,0.00012562262,0.0006548787,0.008154131,0.56962353,0.105543084,0.217809,0.05818749,0.0035273156],"about_ca_topic_score_codex":0.000013189322,"about_ca_topic_score_gemma":0.0000020695136,"teacher_disagreement_score":0.5696232,"about_ca_system_score_codex":0.00007311349,"about_ca_system_score_gemma":0.000061940154,"threshold_uncertainty_score":0.72679317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20357026,0.0012198575,0.44351184,0.00562926,0.0055452343,0.0026350904,0.000027060056,0.00092690054,0.33693448],"genre_scores_gemma":[0.9735256,0.000100138146,0.01375741,0.0051157763,0.00039029765,0.00007186777,0.000018772129,0.000024542454,0.0069956076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972146,0.00010352179,0.0008247543,0.00036720006,0.00055738975,0.0009325282],"domain_scores_gemma":[0.99784005,0.0003199613,0.00031154507,0.0008758971,0.00026507172,0.00038747463],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040705546,0.00038794108,0.00036201414,0.00014745425,0.0003912457,0.001764781,0.001279217,0.00015424876,0.002588347],"category_scores_gemma":[0.00007761492,0.00035980644,0.00016302774,0.0005653603,0.00016845511,0.00208694,0.0012611568,0.00047579792,0.026495257],"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.0000081911085,0.00021049191,0.0014263897,0.00022833153,0.00015206724,0.000006434584,0.008789955,0.00019486218,0.000038104816,0.008797955,0.20274346,0.7774038],"study_design_scores_gemma":[0.0012220254,0.0004803823,0.018838959,0.0006761191,0.000048030935,0.00006134892,0.000945621,0.8105116,0.00032934843,0.002737023,0.16312596,0.0010235759],"about_ca_topic_score_codex":0.000104428866,"about_ca_topic_score_gemma":0.0000026465254,"teacher_disagreement_score":0.81031674,"about_ca_system_score_codex":0.00012403897,"about_ca_system_score_gemma":0.00012983328,"threshold_uncertainty_score":0.9998854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0626756,0.0035838238,0.097913876,0.0035114556,0.009624881,0.0015171465,0.00008975936,0.000564139,0.8205193],"genre_scores_gemma":[0.94954115,0.00016738268,0.042953547,0.0046155085,0.000579973,0.000032708598,0.000022630922,0.000020916596,0.0020661857],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698496,0.00007624338,0.0007787862,0.00021314158,0.0006519507,0.001294892],"domain_scores_gemma":[0.9979166,0.000109855326,0.00029829057,0.0010547816,0.00005224544,0.0005682657],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007561697,0.00036395263,0.0003508958,0.00012424137,0.0003459919,0.00076431275,0.0012428967,0.00016438519,0.0012762591],"category_scores_gemma":[0.000047509646,0.00030348182,0.00015685354,0.00045702283,0.00014183004,0.0041945498,0.0009221754,0.00033448188,0.013342189],"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.0000462374,0.0013890831,0.024582194,0.0009002915,0.00035810668,0.000011597069,0.08736254,0.00011803075,0.00005579467,0.3207292,0.19327939,0.37116754],"study_design_scores_gemma":[0.00089820597,0.00033431605,0.02191583,0.00013939009,0.00006107573,0.00009189832,0.0014281659,0.029833969,0.00021285014,0.0008122106,0.943404,0.00086806767],"about_ca_topic_score_codex":0.00003088129,"about_ca_topic_score_gemma":0.0000011151442,"teacher_disagreement_score":0.88686556,"about_ca_system_score_codex":0.00016254699,"about_ca_system_score_gemma":0.00009281943,"threshold_uncertainty_score":0.9999417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.199207,0.0006676995,0.0016344083,0.0011047408,0.0013842371,0.0002931238,0.0008042755,0.00029017794,0.7946144],"genre_scores_gemma":[0.7039598,0.00047568037,0.0017124176,0.0010102807,0.00060577795,0.00007392803,0.000070146314,0.00006813616,0.2920238],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729383,0.00001821016,0.0009787327,0.00034868284,0.00057746953,0.0007830818],"domain_scores_gemma":[0.9978862,0.00019777738,0.00042632752,0.0010618797,0.000067491055,0.00036032914],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020677125,0.00046207506,0.00038361133,0.000046014702,0.00029706839,0.00010265818,0.0007029353,0.00027854615,0.05304558],"category_scores_gemma":[0.0001663296,0.0003430642,0.00018020699,0.00011776085,0.00040057953,0.0009986864,0.00031729578,0.0002904747,0.008831862],"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.00040891732,0.0009886397,0.0035520673,0.0056988364,0.00088924204,0.000060241466,0.0059585627,0.000011566389,0.5318454,0.0039576893,0.19832435,0.24830447],"study_design_scores_gemma":[0.0014736615,0.000038579215,0.000019330126,0.0008430396,0.000056818168,0.00001883868,0.00063930533,0.000019315781,0.22933723,0.00015703551,0.7669166,0.00048028698],"about_ca_topic_score_codex":0.0000027029755,"about_ca_topic_score_gemma":7.581046e-7,"teacher_disagreement_score":0.5685922,"about_ca_system_score_codex":0.0007735624,"about_ca_system_score_gemma":0.00015836181,"threshold_uncertainty_score":0.9999021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047419626,0.0009892895,0.31243113,0.0053862417,0.00536992,0.0012033688,0.00008942838,0.000701218,0.62640977],"genre_scores_gemma":[0.94884324,0.00032102957,0.007825515,0.0017754222,0.00040780043,0.000050101524,0.0000065911663,0.000029019191,0.040741257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970425,0.0000936941,0.00084556354,0.00040409697,0.0006205454,0.000993641],"domain_scores_gemma":[0.9974792,0.0003051783,0.00037374956,0.001256437,0.00014738916,0.00043801722],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006037535,0.00042232822,0.00041646606,0.00015352185,0.00033676645,0.0006830646,0.0017599748,0.00019102774,0.0022558477],"category_scores_gemma":[0.00020147531,0.0002619621,0.00020447772,0.00039914757,0.00027892066,0.0027374832,0.0010997468,0.000199681,0.024553165],"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.000052618518,0.0004134224,0.0060730246,0.00042733675,0.00024918403,0.00002633584,0.022428535,0.0000044317844,0.00062033423,0.3738943,0.12082787,0.47498262],"study_design_scores_gemma":[0.0027658534,0.0007313379,0.007419959,0.0007614776,0.00006292819,0.00009155571,0.0005337044,0.006648273,0.0032337294,0.0054124943,0.97122127,0.0011174183],"about_ca_topic_score_codex":0.000019056099,"about_ca_topic_score_gemma":0.000009329389,"teacher_disagreement_score":0.90142363,"about_ca_system_score_codex":0.0002896858,"about_ca_system_score_gemma":0.00026663693,"threshold_uncertainty_score":0.99998325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46059647,0.00030465174,0.0053308243,0.0004318563,0.00047610275,0.0004571885,0.000013659023,0.0010082839,0.53138095],"genre_scores_gemma":[0.9976462,0.000097109965,0.0014472926,0.00042340535,0.00004941155,0.0000082082715,0.000009418322,0.0000072522735,0.00031167152],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992156,0.000004171794,0.0002250602,0.000051850413,0.00019733963,0.00030595786],"domain_scores_gemma":[0.9996339,0.000026383093,0.000011423675,0.00020287272,0.000017486134,0.00010794112],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009227373,0.00010101078,0.0000991933,0.000089208246,0.000045189463,0.00008305408,0.00020783326,0.000037410493,0.0005116343],"category_scores_gemma":[0.000015789883,0.00009148301,0.000037976606,0.000165022,0.000022831215,0.00030609398,0.000023332968,0.00014366899,0.0016620491],"study_design_candidate":"design_other","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.000024729881,0.00009562063,0.0021545815,0.00024735363,0.00009904797,0.000020015146,0.004837377,0.011393701,0.0027634613,0.017530734,0.053305365,0.907528],"study_design_scores_gemma":[0.0007319927,0.0006367489,0.023651194,0.00017255265,0.00002700166,0.00007209215,0.0021324644,0.23603702,0.12979287,0.006504985,0.5991005,0.0011405798],"about_ca_topic_score_codex":0.0000020965313,"about_ca_topic_score_gemma":5.0804493e-7,"teacher_disagreement_score":0.90638745,"about_ca_system_score_codex":0.00006168466,"about_ca_system_score_gemma":0.000009354944,"threshold_uncertainty_score":0.9991153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05434165,0.0000026147497,0.000006235618,0.0030343803,0.0010282006,0.00010655131,0.000012420271,0.000059853,0.9414081],"genre_scores_gemma":[0.8371732,0.000008882768,0.00013172776,0.06833791,0.038461797,0.000016815271,0.000082974795,0.000009883613,0.055776805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992418,0.00001722099,0.0002767533,0.00009207476,0.00013416568,0.00023796022],"domain_scores_gemma":[0.9996096,0.000047632202,0.00007380945,0.00017133921,0.00002703962,0.00007059204],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008482041,0.00011636888,0.00018541653,0.000110153014,0.0002691203,0.000112842754,0.00015366575,0.00004667748,0.0799493],"category_scores_gemma":[0.00002215994,0.00009030766,0.00008430663,0.000034699096,0.00014558723,0.00022074458,0.000023530112,0.00014647456,0.005735267],"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.000033202625,0.00010313507,0.00001821534,0.000005806339,0.000031919273,0.0000029521264,0.009864393,0.0000052002842,0.0000017794404,0.5451603,0.39498442,0.04978871],"study_design_scores_gemma":[0.00026517606,0.00040402226,0.00041393682,0.000007478741,0.000026029327,0.000001393043,0.0011384034,0.0000705847,0.0000288336,0.0025223217,0.9950068,0.00011503888],"about_ca_topic_score_codex":0.000011119,"about_ca_topic_score_gemma":0.00007536377,"teacher_disagreement_score":0.88563126,"about_ca_system_score_codex":0.000030036688,"about_ca_system_score_gemma":0.000011993618,"threshold_uncertainty_score":0.99503887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329917,0.00014588494,0.2538017,0.0037184765,0.0019106815,0.0016629836,0.000043957036,0.00094467786,0.30477992],"genre_scores_gemma":[0.9257753,0.000026927126,0.068253085,0.004913557,0.000043312568,0.0002077522,0.000027416016,0.00001713589,0.0007355528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987437,0.000062779385,0.0003703924,0.00012040638,0.00040399114,0.00029873036],"domain_scores_gemma":[0.99946314,0.00007470931,0.00009181208,0.00028450214,0.000019276093,0.00006657576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063606823,0.00009051787,0.00010870697,0.00021270494,0.00023954613,0.00026054215,0.0006308823,0.000015861306,0.0005925485],"category_scores_gemma":[0.000036559028,0.000092580274,0.000033714547,0.00056328735,0.0000207268,0.0011212908,0.000933419,0.00022018311,0.0000830371],"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.000043437707,0.0004943366,0.05663962,0.00031549268,0.00007509133,0.000048204274,0.08355668,0.55335265,0.00061527663,0.20535895,0.008685228,0.090815015],"study_design_scores_gemma":[0.00075726525,0.00007909443,0.002715973,0.000030726376,0.0000011586878,0.000011150357,0.001138453,0.9063405,0.000077633886,0.0007819496,0.08784465,0.00022145332],"about_ca_topic_score_codex":0.00004717544,"about_ca_topic_score_gemma":0.0000067843966,"teacher_disagreement_score":0.49278355,"about_ca_system_score_codex":0.00013389009,"about_ca_system_score_gemma":0.000060034647,"threshold_uncertainty_score":0.64879906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21189606,0.000026601145,0.77530557,0.00033900258,0.0012972223,0.00035497517,0.00011085737,0.0013914878,0.0092782425],"genre_scores_gemma":[0.96141464,0.000060276456,0.03590392,0.0009614968,0.00008954419,0.000039810307,0.00033147936,0.000017417808,0.0011814428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998975,0.000026244847,0.0002612557,0.00013353274,0.00030789198,0.00029611352],"domain_scores_gemma":[0.9991399,0.00012908982,0.00007139708,0.00053040136,0.000029597395,0.0000996159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049561117,0.000098876975,0.00011341825,0.00012439529,0.00015358052,0.0003569,0.00076927774,0.000030678966,0.0000519193],"category_scores_gemma":[0.000058741272,0.00008523805,0.00003076023,0.0006245916,0.000018398283,0.0015085272,0.0009461889,0.000089758236,0.0018989681],"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.000041420706,0.00017522149,0.037360042,0.0002947138,0.00014054264,0.00007025485,0.008491366,0.0022491699,0.00042528906,0.16356076,0.34948507,0.43770614],"study_design_scores_gemma":[0.0007257303,0.00011219937,0.1714005,0.00007762915,0.0000032024589,0.000015211141,0.0002101651,0.65697885,0.0005883446,0.0015183361,0.16794474,0.00042507533],"about_ca_topic_score_codex":0.00007117014,"about_ca_topic_score_gemma":0.000004770065,"teacher_disagreement_score":0.7495186,"about_ca_system_score_codex":0.0000347868,"about_ca_system_score_gemma":0.00003829841,"threshold_uncertainty_score":0.9988782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14696161,0.0003921222,0.82073426,0.0032037362,0.0019970357,0.00051289285,0.00017683371,0.0024124251,0.023609104],"genre_scores_gemma":[0.9593539,0.000017112761,0.039887134,0.00038478032,0.00004606355,0.000015225899,0.00006461383,0.000008663471,0.00022247367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860984,0.000037423866,0.00049808546,0.0001776376,0.00040455995,0.00027245464],"domain_scores_gemma":[0.99907607,0.0001920838,0.000089751,0.0004789221,0.00007353334,0.00008965372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030075936,0.00015393629,0.00019633374,0.0002044776,0.000097628516,0.00034596235,0.00078780117,0.000051564777,0.00029719662],"category_scores_gemma":[0.000034790985,0.00012639016,0.00007739797,0.00071726734,0.00015828213,0.001535458,0.00030645693,0.00012398967,0.00058790925],"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.000006499764,0.000061108796,0.000049086888,0.00021920112,0.00006115524,0.0000069744083,0.0016278928,0.000025767009,0.0007545275,0.98203903,0.008452316,0.006696427],"study_design_scores_gemma":[0.00036509108,0.0001940764,0.0045877863,0.00024886368,0.000016586073,0.000056846824,0.00007489876,0.9031163,0.0035640702,0.043183625,0.04429981,0.00029205086],"about_ca_topic_score_codex":0.000013383599,"about_ca_topic_score_gemma":0.0000019986787,"teacher_disagreement_score":0.9388554,"about_ca_system_score_codex":0.000067266956,"about_ca_system_score_gemma":0.00012554113,"threshold_uncertainty_score":0.75565803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76350254,0.0019064073,0.2199758,0.005642159,0.0017774649,0.00096339284,0.00032711265,0.0008512205,0.005053893],"genre_scores_gemma":[0.99626607,0.000022638877,0.0018775014,0.0010706158,0.00044483837,0.000023597286,0.00015303779,0.00001571813,0.0001260092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.0000021117949,0.00032376492,0.00017706677,0.00018277287,0.00025537223],"domain_scores_gemma":[0.99960554,0.000032544798,0.000087938366,0.00014881643,0.00010439963,0.00002077773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001300125,0.00018220097,0.00020006901,0.0001305144,0.00025057746,0.00087117054,0.00013303374,0.00007163111,0.00015445694],"category_scores_gemma":[0.000054924963,0.00013915684,0.000081192826,0.0003890758,0.00004808606,0.0013048529,0.00013535825,0.00007795448,0.00007894298],"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.00020788211,0.00038251057,0.045056246,0.030447252,0.0017554142,0.000026851489,0.0020623517,0.03206836,0.00039469614,0.26920995,0.07516976,0.54321873],"study_design_scores_gemma":[0.00038236112,0.000010286896,0.0012231794,0.00030115916,0.00033830042,0.000006895301,0.0005237432,0.8926285,0.000013041938,0.010714375,0.09356173,0.00029644475],"about_ca_topic_score_codex":0.00007558594,"about_ca_topic_score_gemma":0.0000436669,"teacher_disagreement_score":0.8605601,"about_ca_system_score_codex":0.000041270574,"about_ca_system_score_gemma":0.000037687652,"threshold_uncertainty_score":0.84007174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027022278,0.000011853754,0.92611855,0.0009601215,0.00004073188,0.00029898688,3.4078886e-7,0.00022859515,0.04531856],"genre_scores_gemma":[0.96125364,0.000004193728,0.036984615,0.000320762,0.00004974787,0.00007265987,0.000027445465,0.000004859728,0.0012821014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991802,0.000009662685,0.00024218077,0.00010925924,0.00024614582,0.0002125537],"domain_scores_gemma":[0.9994957,0.000028536058,0.00013940803,0.0002597607,0.00003233471,0.00004428566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009789869,0.000101174155,0.00008630443,0.000052784115,0.00021566842,0.00037556957,0.000298026,0.000021274609,0.00003276028],"category_scores_gemma":[0.0000022429028,0.00007594528,0.000023208844,0.00027391402,0.000030569357,0.0009862207,0.00009911841,0.00009861193,0.00016214579],"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.000010941695,0.00007663742,0.0019824603,0.00006950934,0.000024212997,0.0000023355549,0.0014406093,0.1945301,0.0002692868,0.7649245,0.010437863,0.02623154],"study_design_scores_gemma":[0.00057852344,0.00022019439,0.0023595183,0.00004682375,0.0000090603735,0.000022413114,0.00021585531,0.86522806,0.001551619,0.0024889377,0.12696454,0.00031448697],"about_ca_topic_score_codex":0.000035994985,"about_ca_topic_score_gemma":0.0000052437445,"teacher_disagreement_score":0.93423134,"about_ca_system_score_codex":0.000036387766,"about_ca_system_score_gemma":0.000017632725,"threshold_uncertainty_score":0.3621626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760189,0.00012323743,0.00024358612,0.000051857533,0.00007662613,0.00009375907,0.000034241566,0.000045649762,0.023312166],"genre_scores_gemma":[0.9954975,0.00010437338,0.0040289313,0.000056354565,0.000027105725,0.000008066689,0.0001218622,0.000009334268,0.00014647386],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890465,0.0000073996193,0.00053453987,0.00010241574,0.0002631624,0.00018783663],"domain_scores_gemma":[0.99939317,0.00006483906,0.00017809932,0.00029536875,0.000034246616,0.000034310273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071719325,0.0001274816,0.00021120957,0.00013409751,0.00005767122,0.000027311726,0.00019862634,0.000065589295,0.0003321213],"category_scores_gemma":[0.000051376683,0.00011811321,0.00006661865,0.00027916237,0.00017797136,0.0009023971,0.00007074715,0.00014015648,0.000016730797],"study_design_candidate":"bench_or_experimental","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.0008586494,0.002506359,0.7705855,0.008879768,0.00058597786,0.00013917124,0.027383996,0.071162194,0.08311864,0.0095077185,0.02038118,0.0048908987],"study_design_scores_gemma":[0.016710566,0.00033483875,0.07955729,0.0023821634,0.00015980013,0.0009962533,0.008923816,0.08220797,0.7884554,0.002341952,0.0146493865,0.0032805563],"about_ca_topic_score_codex":0.00005025019,"about_ca_topic_score_gemma":0.0000048106617,"teacher_disagreement_score":0.70533675,"about_ca_system_score_codex":0.00006164521,"about_ca_system_score_gemma":0.000034589855,"threshold_uncertainty_score":0.4816517},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017680932,0.00039534233,0.060836338,0.0005349963,0.0025549906,0.00078951457,0.000041567342,0.00032904345,0.9168373],"genre_scores_gemma":[0.8565605,0.00021479503,0.1352561,0.0047966833,0.000186369,0.000045788893,0.000017933658,0.000029114432,0.002892673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739635,0.000063156454,0.00085125957,0.0003278215,0.0005403935,0.0008210289],"domain_scores_gemma":[0.9979816,0.00005374324,0.0003259156,0.0012211554,0.00007373101,0.0003438675],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045152433,0.00036821765,0.0003572621,0.00014053645,0.00030275382,0.0005451031,0.001760139,0.00016371044,0.0028419823],"category_scores_gemma":[0.000032595093,0.00030942645,0.00016290805,0.00044844655,0.00019572639,0.0021720964,0.0009365358,0.0003215317,0.010082899],"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.000108970475,0.0011940951,0.0056958483,0.0007731892,0.00041355577,0.000102973165,0.1780094,0.000029957408,0.000028343975,0.37374243,0.07925083,0.3606504],"study_design_scores_gemma":[0.0036825517,0.0031946823,0.058597192,0.0006129669,0.00021216518,0.00028433712,0.006198946,0.13878694,0.0014275034,0.023277052,0.7605917,0.0031340055],"about_ca_topic_score_codex":0.00012019314,"about_ca_topic_score_gemma":0.000005399677,"teacher_disagreement_score":0.9139446,"about_ca_system_score_codex":0.00010297943,"about_ca_system_score_gemma":0.00013681978,"threshold_uncertainty_score":0.9999358},"labels":[],"label_agreement":null}]}