{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":34,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":34,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a57dbc4bd326","filters":{"venue":"Information Systems"}},"results":[{"id":"W2075468564","doi":"10.1016/s0306-4379(03)00052-8","title":"Designing information systems in social context: a goal and scenario modelling approach","year":2003,"lang":"en","type":"article","venue":"Information Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Human–computer interaction; Information system; Data science; Knowledge management; Process management","retraction":null,"screen_n_in":null,"score":{"opus":0.05189589636838759,"gpt":0.2570927286918884,"spread":0.2051968323235008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653785,0.0001590088,0.0002598687,0.0003485597,0.0001561142,0.0006024028,0.0002398413,0.0001317107,1.048888e-7],"category_scores_gemma":[0.0002390617,0.0001568074,0.00002561604,0.0003926255,0.00002431152,0.007315046,0.00005282616,0.0001872023,0.00001777315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001648165,"about_ca_system_score_gemma":0.00006792188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000903451,"about_ca_topic_score_gemma":3.571989e-7,"domain_scores_codex":[0.9984069,0.0002051485,0.0006972742,0.0001135241,0.0003056531,0.0002715179],"domain_scores_gemma":[0.999138,0.0002060966,0.000283731,0.0001895953,0.0001312764,0.00005129656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000283589,0.000003019294,0.00007543759,0.000183903,0.000005294475,3.246921e-7,0.009358333,0.8918161,0.00000581952,0.09513514,0.00002869889,0.003385053],"study_design_scores_gemma":[0.0005006889,0.00001785417,0.00006468369,0.00008648931,0.000002037132,0.00005933706,0.004111039,0.9884022,0.00003717031,0.0002235231,0.006263735,0.0002312134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001624034,0.0003091408,0.9949603,0.000007406349,0.0005709838,0.0004784804,0.000002489297,0.0003063667,0.001740769],"genre_scores_gemma":[0.8347297,0.000007831035,0.1650799,0.00003408808,0.00002787253,0.00009702465,0.000008138323,0.000004914651,0.00001055696],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8331056,"threshold_uncertainty_score":0.6394419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006806998","doi":"10.1016/s0306-4379(03)00038-3","title":"Extending object-oriented databases for fuzzy information modeling","year":2003,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Fuzzy logic; Object (grammar); Database; Data mining; Measure (data warehouse); Database model; Data model (GIS); Database design; Theoretical computer science; Information retrieval; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0335790971528764,"gpt":0.263758301456974,"spread":0.2301792043040976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008120558,0.0001243634,0.0001291714,0.0003277934,0.0002192514,0.0008189568,0.0003710365,0.00003063488,0.000002130737],"category_scores_gemma":[0.0001541685,0.0001162195,0.00004298429,0.0003852165,0.000007090305,0.02446281,0.00009421431,0.000052358,0.0002232347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005437505,"about_ca_system_score_gemma":0.00004210456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003744769,"about_ca_topic_score_gemma":6.616924e-7,"domain_scores_codex":[0.9986676,0.00003107971,0.000603824,0.0001037958,0.0003454776,0.000248217],"domain_scores_gemma":[0.9989797,0.00004189296,0.0002515236,0.0004447003,0.00022267,0.00005948216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003536002,0.000008521586,0.00003516394,0.0001796598,0.00001838586,2.032277e-7,0.001007204,0.01818222,0.000003646406,0.9558955,0.00376899,0.02089691],"study_design_scores_gemma":[0.0003328686,0.00001335306,0.000004748631,0.00003197039,0.00000380231,0.00000525088,0.0007185534,0.6574239,0.00003486315,0.0001196223,0.3411925,0.0001184696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003322554,0.00003896721,0.9755082,0.00002967883,0.001597189,0.0006388617,0.0000653522,0.0002401749,0.02154936],"genre_scores_gemma":[0.8806694,0.00003602224,0.1159289,0.0006087103,0.0001599707,0.0004465043,0.001842923,0.00001183953,0.0002957573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9557759,"threshold_uncertainty_score":0.9891815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159100004","doi":"10.1016/j.is.2008.01.005","title":"The complexity and approximation of fixing numerical attributes in databases under integrity constraints","year":2008,"lang":"en","type":"article","venue":"Information Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Data integrity; Conjunctive query; Consistency (knowledge bases); Semantics (computer science); Computational complexity theory; Approximation algorithm; Aggregate (composite); Theoretical computer science; Time complexity; Relational database; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1007824357512097,"gpt":0.2798962895402359,"spread":0.1791138537890262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750991,0.00006858188,0.0001371005,0.00006224618,0.0001663983,0.00008947508,0.0002171915,0.00003153693,0.000001289338],"category_scores_gemma":[0.0001688836,0.0000461976,0.00001853242,0.0002141165,0.0002350328,0.001330466,0.000100556,0.00009088418,0.00001159309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003653421,"about_ca_system_score_gemma":0.00006077046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001770017,"about_ca_topic_score_gemma":0.00001427316,"domain_scores_codex":[0.9991244,0.00009177178,0.0004014499,0.00007397008,0.000186074,0.0001222972],"domain_scores_gemma":[0.9991965,0.0002371458,0.0002091763,0.0001922345,0.0001310612,0.00003388204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006915877,0.00003058084,0.03005589,0.0001085892,0.00001122033,9.392084e-7,0.005699186,0.0002295978,0.00001904268,0.9570096,0.0006371082,0.00619136],"study_design_scores_gemma":[0.001191911,0.00007217216,0.1866257,0.0002183942,0.000004346303,0.0003573491,0.004132112,0.7943742,0.000527896,0.002629724,0.009531344,0.0003348739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06342655,0.0001731066,0.9308814,0.0001522721,0.0002520075,0.0002548547,0.00001449741,0.00005392816,0.004791322],"genre_scores_gemma":[0.9983103,0.00001941634,0.001593111,0.00002575644,0.00001459407,0.0000106981,0.00001677004,0.000001023703,0.000008301987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9543799,"threshold_uncertainty_score":0.1883883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121217868","doi":"10.1016/j.is.2021.101718","title":"Multi-label legal document classification: A deep learning-based approach with label-attention and domain-specific pre-training","year":2021,"lang":"en","type":"article","venue":"Information Systems","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Multi-label classification; Domain (mathematical analysis); Training (meteorology); Machine learning; Training set","retraction":null,"screen_n_in":null,"score":{"opus":0.03582749930198761,"gpt":0.2545681606306928,"spread":0.2187406613287052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004799287,0.000196509,0.0002139572,0.0002374666,0.0003335836,0.00156437,0.0003775302,0.0001274306,0.000004134928],"category_scores_gemma":[0.00002346437,0.0001694723,0.0000292433,0.0006576794,0.00008871951,0.003115146,0.00009989538,0.0002179944,0.00005584566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001204263,"about_ca_system_score_gemma":0.0001132541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008880105,"about_ca_topic_score_gemma":0.000002981439,"domain_scores_codex":[0.9981939,0.0001204331,0.00057619,0.0003307719,0.0005142342,0.0002645055],"domain_scores_gemma":[0.9985068,0.00005603382,0.0004582877,0.0005418338,0.0003545514,0.00008245977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005427674,0.000295074,0.003239909,0.0004453867,0.0001070932,0.0000107401,0.009492532,0.004399923,0.003346255,0.7562264,0.0005176134,0.2218647],"study_design_scores_gemma":[0.003862281,0.00019336,0.01247016,0.0001405036,0.00001300107,0.0001597312,0.01561235,0.7643647,0.0003320122,0.000116964,0.2021708,0.0005641083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01468044,0.0003703678,0.9808335,0.0008071798,0.0002119854,0.0004559892,0.000002154409,0.0007042507,0.001934143],"genre_scores_gemma":[0.843629,0.00003499851,0.1554356,0.00008078929,0.00002634424,0.0002681687,0.00009810821,0.000008532191,0.0004184518],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8289486,"threshold_uncertainty_score":0.9994721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912763210","doi":"10.1016/j.is.2019.01.007","title":"From knowledge-driven to data-driven inter-case feature encoding in predictive process monitoring","year":2019,"lang":"en","type":"article","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Toronto","funders":"Eesti Teadusagentuur","keywords":"Computer science; Encoding (memory); Process (computing); Data mining; Event (particle physics); Dimension (graph theory); Feature (linguistics); Representation (politics); Partition (number theory); Machine learning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02969100307698083,"gpt":0.2777349318460065,"spread":0.2480439287690257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003249421,0.0002049534,0.0003248888,0.0006654572,0.0001060374,0.000824979,0.0005317444,0.0001180763,0.00001984625],"category_scores_gemma":[0.0001041892,0.0001866325,0.00003928498,0.001001319,0.000009688442,0.008298428,0.0003180084,0.0002034167,0.001117254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007842464,"about_ca_system_score_gemma":0.00003780617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001707531,"about_ca_topic_score_gemma":0.00006676988,"domain_scores_codex":[0.9986342,0.00001222919,0.0005344655,0.0002904585,0.0002827924,0.0002459082],"domain_scores_gemma":[0.9986211,0.00003669933,0.0003470207,0.0004684157,0.0005033426,0.00002341254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000200363,0.000158516,0.2874202,0.004424475,0.0002881946,0.00007035066,0.02082724,0.653859,0.0002228693,0.0003423767,0.005583538,0.02660292],"study_design_scores_gemma":[0.0004702123,0.000005007859,0.0007203203,0.001082371,0.00004586636,0.000009127786,0.01368681,0.9725068,0.00001303615,0.00002098784,0.01117069,0.0002687425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9636019,0.0001304064,0.01973817,0.0002685759,0.002241799,0.0008014526,0.00007571788,0.0003090661,0.01283283],"genre_scores_gemma":[0.9979537,0.000002806142,0.0001033926,0.00008434782,0.00136342,0.00006391296,0.0003144034,0.00001688952,0.00009719857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3186479,"threshold_uncertainty_score":0.9996605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053019617","doi":"10.1016/j.is.2009.09.002","title":"Competitive advantage of enterprise resource planning vendors in Iran","year":2009,"lang":"en","type":"article","venue":"Information Systems","topic":"ERP Systems Implementation and Impact","field":"Business, Management and Accounting","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Enterprise resource planning; Competitive advantage; Business; Context (archaeology); Globe; Process (computing); Process management; Product (mathematics); Resource (disambiguation); Knowledge management; Industrial organization; Computer science; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.02267581455847231,"gpt":0.2808888188519573,"spread":0.2582130042934849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004275597,0.0001054707,0.0001988705,0.0005145074,0.00004496913,0.0001678624,0.00012296,0.00003580298,0.0000296789],"category_scores_gemma":[0.00005535825,0.00009849647,0.00004048246,0.0003359192,0.00001196196,0.002891814,0.00002019452,0.00006708753,0.0001458241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003976408,"about_ca_system_score_gemma":0.000008313232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001990397,"about_ca_topic_score_gemma":0.000004867054,"domain_scores_codex":[0.9987764,0.00001772543,0.0007109447,0.00006539021,0.0002645931,0.0001648867],"domain_scores_gemma":[0.9992341,0.00002715279,0.0005368486,0.0001242887,0.00006654269,0.00001100499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008482563,0.0003300458,0.4955784,0.002173236,0.00009760354,0.00003331052,0.03235964,0.0108755,0.001839439,0.3831337,0.03366122,0.03906956],"study_design_scores_gemma":[0.003128965,0.00005894053,0.1394884,0.0008381775,0.000008251457,0.00001075581,0.06591675,0.005396744,0.0001345496,0.00004710608,0.7846599,0.000311479],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4473114,0.0001325641,0.00112926,0.0002273556,0.0005717009,0.001023029,0.00002354569,0.0001476532,0.5494335],"genre_scores_gemma":[0.9989167,0.000001519225,0.00001149618,0.0007852394,0.0001399866,0.000009222134,0.00009227519,0.000004660002,0.00003889766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7509987,"threshold_uncertainty_score":0.401657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101496601","doi":"10.1016/j.is.2011.03.008","title":"Ranking uncertain sky: The probabilistic top-k skyline operator","year":2011,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Data mining; Probabilistic logic; Uncertain data; Set (abstract data type); Ranking (information retrieval); Object (grammar); Operator (biology); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03473495861428488,"gpt":0.2283375924470648,"spread":0.1936026338327799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582082,0.00009152188,0.000094917,0.00008018212,0.0001585667,0.0006437968,0.0009618654,0.00002674953,0.00001363585],"category_scores_gemma":[0.00004304675,0.00005717505,0.00002740588,0.0003151764,0.00002263543,0.003522272,0.0002056449,0.00006496299,0.0004926519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000291972,"about_ca_system_score_gemma":0.00003032291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001230104,"about_ca_topic_score_gemma":0.000002291647,"domain_scores_codex":[0.9990392,0.00005131128,0.0003645004,0.00009849581,0.000279015,0.0001675124],"domain_scores_gemma":[0.9991492,0.00002958373,0.0001424102,0.000534079,0.0001086824,0.000036036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000746219,0.00003533987,0.0005050311,0.0001963343,0.00004823233,0.000005301058,0.0159593,0.00127147,0.00000619853,0.885148,0.01422033,0.082597],"study_design_scores_gemma":[0.0004888916,0.00005415541,0.0008817277,0.00007073329,0.00000962486,0.00002073129,0.001119983,0.5740582,0.00006545694,0.0006958671,0.4222712,0.0002634285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002056205,0.00007009943,0.9361157,0.0004337367,0.002002172,0.0009290347,0.00001236163,0.0003178362,0.0580629],"genre_scores_gemma":[0.9928545,0.000006405099,0.005331513,0.0008851432,0.0001655542,0.0001345937,0.00003714024,0.000005160297,0.0005800292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9907982,"threshold_uncertainty_score":0.6332207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000702636","doi":"10.1016/j.is.2005.02.004","title":"PeCAN: An architecture for users’ privacy-aware electronic commerce contexts on the semantic web","year":2005,"lang":"en","type":"article","venue":"Information Systems","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Computer science; World Wide Web; Semantic Web; Social Semantic Web; Semantic Web Stack; Web service; Ontology","retraction":null,"screen_n_in":null,"score":{"opus":0.02576577915017323,"gpt":0.2945594008217358,"spread":0.2687936216715626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386104,0.0001275378,0.0001464884,0.0001067968,0.00093147,0.0004121751,0.0006408486,0.0001231588,0.00002675702],"category_scores_gemma":[0.0003850283,0.00009471942,0.00006181192,0.000193511,0.00007548227,0.001550115,0.00005370884,0.0002284497,0.0001870017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002470926,"about_ca_system_score_gemma":0.0002178613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009564553,"about_ca_topic_score_gemma":0.002745947,"domain_scores_codex":[0.9984662,0.0002693326,0.000350376,0.0001174105,0.0004149061,0.0003817923],"domain_scores_gemma":[0.9988674,0.0002000861,0.0002346595,0.0004445499,0.0001639449,0.00008934541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003651356,0.0001933426,0.0007807559,0.000386174,0.0001254057,4.299212e-7,0.2412917,0.001662619,0.0001547445,0.5732726,0.09403298,0.08773421],"study_design_scores_gemma":[0.0004450786,0.0001425864,0.0002041837,0.0000488514,0.000008868993,0.000003911062,0.009406988,0.006213145,0.00003958961,0.0006387624,0.9826968,0.0001512533],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7544784,0.0006466312,0.09500621,0.0861183,0.003579024,0.01608916,0.0006970468,0.001529799,0.04185544],"genre_scores_gemma":[0.9976704,0.00003245988,0.0000260128,0.001167819,0.0006104681,0.0002154246,0.00009724309,0.000008183845,0.0001720227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8886638,"threshold_uncertainty_score":0.7164208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997651539","doi":"10.1016/j.is.2010.06.006","title":"Temporal data classification using linear classifiers","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Temporal database; Data mining; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.09938944203689498,"gpt":0.2954013290880879,"spread":0.1960118870511929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116295,0.00009117071,0.0001268872,0.0001467807,0.0001920421,0.0005816377,0.001000934,0.00008273302,0.000008631107],"category_scores_gemma":[0.00006919503,0.00007934318,0.00003178342,0.0004000458,0.00002839813,0.005989178,0.0002370389,0.0001601269,0.0001673515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002334696,"about_ca_system_score_gemma":0.00008173251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002195657,"about_ca_topic_score_gemma":0.00001305035,"domain_scores_codex":[0.9988397,0.00002685515,0.0005135263,0.0001561914,0.0003014108,0.0001623316],"domain_scores_gemma":[0.9982355,0.0000235266,0.0003916579,0.001102132,0.0001734852,0.00007372133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002834842,0.0001088775,0.03356986,0.0004031221,0.000255611,0.000006935695,0.008273324,0.01872207,0.01088602,0.6177475,0.02142105,0.2885773],"study_design_scores_gemma":[0.00007315209,0.000005540465,0.0005206575,0.000008257769,0.000004077417,0.00001972368,0.0002984623,0.8426987,0.00001885999,0.00001105859,0.1562546,0.00008694748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01889816,0.0000133714,0.9719565,0.000186308,0.001578837,0.0001685653,0.00002237499,0.0001806317,0.006995253],"genre_scores_gemma":[0.9718392,9.462493e-7,0.02764835,0.00006585105,0.0001862522,0.000003910037,0.0001805532,0.000003868522,0.00007108739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.952941,"threshold_uncertainty_score":0.5608746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402898151","doi":"10.1016/j.is.2024.102460","title":"Data Lakehouse: A survey and experimental study","year":2024,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Survey research; Data science; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.4319128260972868,"gpt":0.4771378457812553,"spread":0.04522501968396853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01029928,0.00007268968,0.0001335367,0.0002126558,0.00008388504,0.003033988,0.0007045482,0.00002174519,0.00004758056],"category_scores_gemma":[0.0005033645,0.00005103362,0.00001045356,0.0003929696,0.00002446288,0.0050951,0.0006615904,0.00004849445,0.001781812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001766996,"about_ca_system_score_gemma":0.00002587341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006114352,"about_ca_topic_score_gemma":0.000206184,"domain_scores_codex":[0.9977377,0.0003096543,0.0006779349,0.0002066723,0.0009724983,0.00009554423],"domain_scores_gemma":[0.9984728,0.00043092,0.00009256496,0.0008833306,0.00006949369,0.00005085908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004683253,0.0002251671,0.01069032,0.0001280961,0.0001331323,0.00001535283,0.02760623,0.0001988152,0.000006657941,0.0163992,0.9057835,0.03876673],"study_design_scores_gemma":[0.000206731,0.00007111867,0.008069685,0.00001566077,0.000003842513,0.000007753752,0.03720115,0.01898548,0.000002871128,0.00002866941,0.935314,0.00009305626],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8863623,0.003334749,0.04689957,0.0005554418,0.009997536,0.003793343,0.008423107,0.0007818808,0.03985211],"genre_scores_gemma":[0.9988675,0.000003024787,0.00001552684,0.00007908206,0.00003815429,0.00002090525,0.0002912172,0.000002830298,0.0006818258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1125052,"threshold_uncertainty_score":0.9989954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114146497","doi":"10.1016/j.is.2011.07.002","title":"Folksonomy-based personalized search and ranking in social media services","year":2011,"lang":"en","type":"article","venue":"Information Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Folksonomy; Computer science; Information retrieval; Social media; Ranking (information retrieval); World Wide Web; Personalized search; Preference; Resource (disambiguation); Annotation; Learning to rank; Topic model; Search engine; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05081110230503755,"gpt":0.2543957702125753,"spread":0.2035846679075377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008056246,0.00008906046,0.0001654384,0.0002585968,0.00009528099,0.0002838729,0.0003108284,0.00007371772,0.000004174467],"category_scores_gemma":[0.000003915849,0.0000795989,0.00002758756,0.0002134403,0.00001782974,0.00181492,0.00006707064,0.0000778235,0.00002008623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004185258,"about_ca_system_score_gemma":0.00003966811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007694269,"about_ca_topic_score_gemma":0.00003358345,"domain_scores_codex":[0.9990277,0.00009481952,0.0003790176,0.00009924277,0.0002344411,0.0001648163],"domain_scores_gemma":[0.9995771,0.00004722227,0.0001126942,0.0001424221,0.00007935009,0.00004119345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004987653,0.00006261122,0.03407508,0.001791636,0.00004593627,0.00001078688,0.4422918,0.00003197785,0.00006094913,0.4370462,0.0007474507,0.08378572],"study_design_scores_gemma":[0.007487247,0.0001902303,0.07705177,0.001259333,0.00001500927,0.0001246893,0.03015816,0.7516056,0.001954789,0.002062979,0.1264752,0.001614957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1353473,0.000336232,0.8239943,0.0002980087,0.001092964,0.001126267,0.00001203886,0.000686164,0.03710672],"genre_scores_gemma":[0.996439,0.000002734843,0.00333365,0.0001076082,0.00004435053,0.00005785621,0.000005611794,0.000003067457,0.000006118341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8610917,"threshold_uncertainty_score":0.3245949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2532696200","doi":"10.1016/j.is.2016.10.004","title":"HarVis: An integrated social media content analysis framework for YouTube platform","year":2016,"lang":"en","type":"article","venue":"Information Systems","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Influencer marketing; Popularity; Social media; Entertainment; World Wide Web; Content analysis; Visualization; Vocabulary; Social network analysis; Exploratory analysis; User-generated content; Globe; Data science; Multimedia","retraction":null,"screen_n_in":null,"score":{"opus":0.09981051094323912,"gpt":0.2971784990078015,"spread":0.1973679880645623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006576584,0.0001330684,0.000309894,0.0004709284,0.0001842901,0.0006188109,0.0005118022,0.0001166744,0.00002678952],"category_scores_gemma":[0.0001503556,0.00008324069,0.0002141351,0.0008471121,0.0000211937,0.003960738,0.00004911828,0.00005210567,0.000123762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008324795,"about_ca_system_score_gemma":0.00004023423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003810559,"about_ca_topic_score_gemma":0.00001202403,"domain_scores_codex":[0.998471,0.00003707849,0.0006995318,0.0001607435,0.0004050799,0.0002265266],"domain_scores_gemma":[0.9984789,0.000239184,0.00042995,0.0003202738,0.0004384451,0.00009318967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004227497,0.00004700228,0.003244458,0.00003929733,0.001247755,5.456802e-7,0.02457894,0.0003444483,0.00009239517,0.779847,0.002498877,0.188017],"study_design_scores_gemma":[0.002824319,0.0001924343,0.01014781,0.0002790168,0.000540078,0.000005761705,0.02701192,0.791619,0.0008366255,0.001799577,0.1636031,0.001140379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01019671,0.00002035266,0.9880557,0.0002096001,0.0008421254,0.0002374943,0.00004570225,0.0001470244,0.0002452646],"genre_scores_gemma":[0.9888011,0.000004535153,0.0104558,0.0001580792,0.000226742,0.0001169102,0.0001601394,0.000004690067,0.00007197456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9786044,"threshold_uncertainty_score":0.5967208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997167079","doi":"10.1016/j.is.2010.08.007","title":"Building a peer-to-peer content distribution network with high performance, scalability and robustness","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Robustness (evolution); Gossip protocol; Computer network; Server; Distributed computing; Locality; Peer-to-peer; Content distribution; Routing protocol; Load balancing (electrical power); Gossip; Routing (electronic design automation); Database","retraction":null,"screen_n_in":null,"score":{"opus":0.01253043178690378,"gpt":0.2048568322026247,"spread":0.1923264004157209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076856,0.0001233869,0.0001607134,0.00005992838,0.0002359559,0.0006423317,0.0002746804,0.00006750334,9.403768e-7],"category_scores_gemma":[0.00006685952,0.00009480404,0.00002079207,0.00028895,0.00003185893,0.00215315,0.0001092046,0.0001931269,0.0000212784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004936142,"about_ca_system_score_gemma":0.00003878564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002630093,"about_ca_topic_score_gemma":0.00001146642,"domain_scores_codex":[0.9986874,0.00003174679,0.0003425758,0.0001535025,0.0005490496,0.0002356566],"domain_scores_gemma":[0.9985722,0.00004506401,0.0001467967,0.0003586973,0.0007541134,0.0001230717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002982661,0.0001066961,0.1332829,0.0006515575,0.0001296034,0.00000621423,0.003201784,0.452427,0.00128745,0.2488935,0.01196604,0.147749],"study_design_scores_gemma":[0.0007235326,0.0001456883,0.09095582,0.000151131,0.000009744906,0.0001309562,0.0001699169,0.8802037,0.0001313939,0.00001604331,0.02703592,0.0003261245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6089522,0.000005127233,0.3894215,0.0003618124,0.0007981122,0.0002167211,0.000009621494,0.000105637,0.0001292392],"genre_scores_gemma":[0.9975097,7.971699e-7,0.002088211,0.00008429188,0.0001241634,0.00004741507,0.00003189997,0.000003148236,0.0001104052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4277767,"threshold_uncertainty_score":0.6194019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979660621","doi":"10.1016/j.is.2007.03.001","title":"Indexing schemes for similarity search in datasets of short protein fragments","year":2007,"lang":"en","type":"article","venue":"Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Fonterra Co-Operative Group; Victoria University; Victoria University of Wellington; University of Ottawa","keywords":"Search engine indexing; Computer science; Nearest neighbor search; Similarity (geometry); Information retrieval; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03226710671312223,"gpt":0.3096500319111106,"spread":0.2773829251979884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629282,0.00006634968,0.0001202761,0.0002009966,0.00005410266,0.0001083002,0.0004350658,0.00006054548,0.000001017926],"category_scores_gemma":[0.00004273279,0.00005857675,0.0000184231,0.0002423091,0.0000120942,0.002729726,0.0001961914,0.00007787595,0.000006248536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005992253,"about_ca_system_score_gemma":0.00006050164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001456489,"about_ca_topic_score_gemma":0.000005693797,"domain_scores_codex":[0.9988152,0.00002040803,0.0005121162,0.00009359821,0.0003608697,0.0001977897],"domain_scores_gemma":[0.9993485,0.0000476039,0.0001063214,0.0003377555,0.0001113045,0.00004854455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000305939,0.000420341,0.03193347,0.004604706,0.0001043504,0.00001646584,0.01308885,0.009815224,0.007388942,0.2189404,0.009799596,0.7035818],"study_design_scores_gemma":[0.0009560005,0.00009284994,0.004776335,0.0004839669,0.000001660749,0.000007505781,0.0005724533,0.8255023,0.01767325,0.000118332,0.1495643,0.0002510381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03761946,0.00002480069,0.9608952,0.00001236146,0.0001569154,0.000712944,0.0001438646,0.00002891566,0.0004055355],"genre_scores_gemma":[0.9781495,8.978228e-7,0.02144306,0.00002746714,0.00002638118,0.00003601036,0.0003071013,0.000002155458,0.00000738623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9405301,"threshold_uncertainty_score":0.2388691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046904770","doi":"10.1016/s0306-4379(01)00054-0","title":"One-pass evaluation of region algebra expressions","year":2003,"lang":"en","type":"article","venue":"Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Operator (biology); Set (abstract data type); Simple (philosophy); Tree (set theory); Algorithm; Theoretical computer science; Algebra over a field; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05425727120654508,"gpt":0.2825441123756303,"spread":0.2282868411690852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086242,0.00008232949,0.0001525803,0.0001408934,0.00009430576,0.00006031653,0.0001796642,0.00005199791,0.000005387555],"category_scores_gemma":[0.0002126394,0.0000753266,0.00003531865,0.0002835919,0.00001949254,0.004143259,0.00004070775,0.00004951861,0.00007039039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006566608,"about_ca_system_score_gemma":0.0001243473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004192847,"about_ca_topic_score_gemma":0.000001412257,"domain_scores_codex":[0.9982691,0.0002194426,0.0005689056,0.0001002738,0.0007124725,0.0001298],"domain_scores_gemma":[0.9983194,0.00004680696,0.000448895,0.0005575209,0.0005749209,0.00005243016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000239718,0.00001467594,0.0001004234,0.00008664942,0.00001075797,1.670773e-7,0.001833272,0.003138272,0.0003293015,0.9860777,0.000722903,0.007683434],"study_design_scores_gemma":[0.002415945,0.0001729582,0.002243626,0.001025408,0.00003992457,0.0001344012,0.004671938,0.1549834,0.01223709,0.002798183,0.8185586,0.0007185361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005370994,0.0001730354,0.9726574,0.0000298748,0.0007536463,0.0004538236,0.000009051337,0.00008281281,0.02046936],"genre_scores_gemma":[0.9916715,0.000007169448,0.008102325,0.00002990737,0.0000238644,0.00009683661,0.00001970683,0.000003068046,0.00004564543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9863005,"threshold_uncertainty_score":0.307173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2742330620","doi":"10.1016/j.is.2017.08.002","title":"Decentralized enforcement of document lifecycle constraints","year":2017,"lang":"en","type":"article","venue":"Information Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Workflow; Scalability; Encryption; Process (computing); Artifact (error); Software engineering; Key (lock); Software; Point (geometry); Hash function; Computer security; Database; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02204375242083717,"gpt":0.330131933081352,"spread":0.3080881806605148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157014,0.00005244822,0.0001302516,0.00003979169,0.0005402335,0.0004127733,0.0002952135,0.00003942677,0.0003160722],"category_scores_gemma":[0.0001651121,0.00004554653,0.00004069419,0.00002632002,0.0002133181,0.001839264,0.00003097228,0.00003020967,0.000128544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005369608,"about_ca_system_score_gemma":0.0001043502,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007300522,"about_ca_topic_score_gemma":0.00009426735,"domain_scores_codex":[0.9990007,0.00004331784,0.0003716033,0.0000390797,0.0003864806,0.0001588204],"domain_scores_gemma":[0.9989953,0.00002823386,0.0005410567,0.0002034431,0.0001559968,0.00007598659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002657164,0.00001394761,0.01190183,0.00006538049,0.000050218,6.427936e-7,0.01182689,0.0001450315,0.000006876224,0.9389621,0.001043039,0.03595745],"study_design_scores_gemma":[0.002472976,0.00002885122,0.007928031,0.0001149985,0.00001996369,0.000001491782,0.01461269,0.0005529107,0.0001530898,0.0005653145,0.9733669,0.0001827539],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03942347,0.00007873202,0.00311724,0.0004626635,0.001681832,0.0008686106,0.00002970195,0.00006114552,0.9542766],"genre_scores_gemma":[0.9995502,0.00004496862,0.00002652433,0.0000444925,0.00006206703,0.0000242251,0.000006551879,0.000001418275,0.0002395034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9723239,"threshold_uncertainty_score":0.99931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046491668","doi":"10.1016/j.is.2020.101608","title":"Privacy-aware data cleaning-as-a-service","year":2020,"lang":"en","type":"article","venue":"Information Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; McMaster University","funders":"","keywords":"Computer science; Service provider; Cloud computing; Data publishing; Service (business); Data as a service; Database; Data modeling; Information privacy; Anonymity; Computer security; Consistency (knowledge bases); Big data; Data mining; Publishing","retraction":null,"screen_n_in":null,"score":{"opus":0.07813621063965932,"gpt":0.285149658266953,"spread":0.2070134476272937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004944844,0.0001715738,0.0002060458,0.0001145782,0.0001386734,0.0008892184,0.05432155,0.0001392587,0.00001260696],"category_scores_gemma":[0.008790473,0.0001639822,0.0000226449,0.0009703677,0.00002461553,0.01063124,0.1112316,0.0002578991,0.003603841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005622177,"about_ca_system_score_gemma":0.0001258517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001719524,"about_ca_topic_score_gemma":0.000001974158,"domain_scores_codex":[0.9980721,0.00005256373,0.0006222811,0.0003505651,0.0006035236,0.0002989714],"domain_scores_gemma":[0.9875538,0.00009099068,0.0003557258,0.01164645,0.0002168897,0.0001361759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008462938,0.00001095591,0.0002509315,0.0003585898,0.00003267113,0.00000775283,0.002186944,0.0001728279,0.00004087175,0.01306149,0.9665228,0.01734575],"study_design_scores_gemma":[0.0002041245,0.00002836174,0.00006179176,0.00004758267,0.00000262942,0.00002805814,0.0004616082,0.6834576,0.0001086414,0.0007907496,0.3146367,0.0001721768],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001726868,0.00009632715,0.9037477,0.08193434,0.0010089,0.0005668299,0.0001997264,0.003427961,0.007291301],"genre_scores_gemma":[0.942595,0.00003160373,0.04791655,0.008567203,0.0001868764,0.00004077533,0.0006288061,0.00001673262,0.00001641978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9408681,"threshold_uncertainty_score":0.9995589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082534709","doi":"10.1016/j.is.2012.08.005","title":"Consistent query answering under spatial semantic constraints","year":2012,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Spatial query; Class (philosophy); Set (abstract data type); Data integrity; Semantics (computer science); Information retrieval; Consistency (knowledge bases); Core (optical fiber); Query optimization; Query language; Theoretical computer science; Database; Web query classification; Web search query; Artificial intelligence; Programming language; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.02100301934720149,"gpt":0.2307467823017295,"spread":0.209743762954528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602696,0.00009118882,0.00010822,0.0001242087,0.00008289126,0.0004917167,0.0003137668,0.00003321637,0.00001187144],"category_scores_gemma":[0.00001260052,0.00008200604,0.00003142762,0.0001377578,0.00003271531,0.00559173,0.000150677,0.00005184911,0.0008481905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003853339,"about_ca_system_score_gemma":0.00002089154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001085078,"about_ca_topic_score_gemma":0.000001561726,"domain_scores_codex":[0.9990241,0.00003068236,0.0003452138,0.00007106919,0.0002848421,0.0002441277],"domain_scores_gemma":[0.9993735,0.00002674241,0.0001522468,0.0003079473,0.0000564992,0.00008307883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000373881,0.00006420144,0.006035706,0.0003836855,0.0001169515,0.000003919314,0.004139316,0.001081149,0.000070104,0.7935723,0.007661781,0.1868672],"study_design_scores_gemma":[0.001941936,0.00008161049,0.03282612,0.0003521066,0.00003980731,0.0002797193,0.005782181,0.5754382,0.0005842492,0.0002402655,0.3812126,0.001221175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002772579,0.00004081293,0.9740746,0.0001167555,0.002506078,0.0002249734,0.000006461018,0.0001757451,0.02008199],"genre_scores_gemma":[0.9981017,0.000003390023,0.001348954,0.0002596895,0.0001268584,0.0000146277,0.00002771848,0.000002524276,0.000114528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9953291,"threshold_uncertainty_score":0.9999298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073984053","doi":"10.1016/j.is.2010.11.001","title":"Suffix trees for inputs larger than main memory","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Generalized suffix tree; Compressed suffix array; Suffix tree; Suffix; Computer science; String (physics); String searching algorithm; Auxiliary memory; Algorithm; Data structure; Tree (set theory); Theoretical computer science; Construct (python library); Mathematics; Combinatorics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01017456959835393,"gpt":0.2344620922604449,"spread":0.224287522662091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522704,0.00009340697,0.0001168924,0.0001133299,0.0001468081,0.0004724083,0.0005499934,0.00008174511,0.000006577681],"category_scores_gemma":[0.0000426964,0.00007233633,0.00004383855,0.0001334295,0.00001371346,0.003369526,0.0001257796,0.00009828924,0.0001831046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001440007,"about_ca_system_score_gemma":0.00005225377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006046483,"about_ca_topic_score_gemma":0.00001383214,"domain_scores_codex":[0.9991078,0.0000201405,0.0003331493,0.0001056887,0.0002504816,0.000182784],"domain_scores_gemma":[0.9990758,0.00006655017,0.0001714061,0.0004868234,0.0001253538,0.00007408697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005297985,0.0001608461,0.00143991,0.0005388308,0.00007715009,0.000006064519,0.01576454,0.002032454,0.008189701,0.4679263,0.2776964,0.2261148],"study_design_scores_gemma":[0.0005124853,0.00003764013,0.001221134,0.00003084345,0.000002092065,0.00003320888,0.0001394318,0.3827564,0.0009959678,0.0001833797,0.6139048,0.0001825719],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009201319,0.00001909196,0.9827647,0.0002455945,0.003179632,0.000438393,0.00007316082,0.0001912557,0.003886893],"genre_scores_gemma":[0.9813427,0.000002128347,0.01723135,0.0003221008,0.0003428839,0.0001249843,0.000110569,0.000005910185,0.000517343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9721414,"threshold_uncertainty_score":0.4555444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979389171","doi":"10.1016/j.is.2019.101444","title":"Speed prediction in large and dynamic traffic sensor networks","year":2019,"lang":"en","type":"article","venue":"Information Systems","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Horizon 2020; Ministero dell’Istruzione, dell’Università e della Ricerca; Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico; University of Alberta","keywords":"Computer science; Context (archaeology); Wireless sensor network; Real-time computing; Distributed computing; Data mining; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.002947338732416546,"gpt":0.1782858332622148,"spread":0.1753384945297982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019281,0.00007633767,0.00009773316,0.0001983245,0.00001552993,0.00006475976,0.00003894508,0.00007673118,0.000006766132],"category_scores_gemma":[0.000002332219,0.00007846698,0.00001394295,0.0001281303,0.000004444752,0.000711544,0.00001035633,0.00009064461,0.00009879633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006060612,"about_ca_system_score_gemma":0.000002305285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000461921,"about_ca_topic_score_gemma":0.000005330138,"domain_scores_codex":[0.999432,0.00001138952,0.0002834981,0.00004956988,0.00009606966,0.0001274323],"domain_scores_gemma":[0.999819,0.000008461644,0.00003350029,0.00009718018,0.00001469254,0.00002717334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005482936,0.000005853336,0.001550184,0.0002217172,0.00001415052,4.355834e-7,0.0006624254,0.9855208,0.00002510963,0.0005165546,0.005148245,0.006329037],"study_design_scores_gemma":[0.0004077512,0.00001267131,0.009576938,0.00005087478,0.000002377262,0.00000602744,0.0004297215,0.9611223,0.000001818575,3.002297e-7,0.02832137,0.00006782625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8298014,0.0001872923,0.1402876,0.00001887781,0.00194547,0.001151193,0.00003609714,0.005594333,0.02097777],"genre_scores_gemma":[0.9996597,0.00007541815,0.00003400671,0.00002387051,0.00002017818,0.00001619527,0.0000594836,0.000007015554,0.0001041047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1698584,"threshold_uncertainty_score":0.319979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2936018264","doi":"10.1016/j.is.2019.04.004","title":"Context-aware temporal network representation of event logs: Model and methods for process performance analysis","year":2019,"lang":"en","type":"article","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Process mining; Bottleneck; Event (particle physics); Context (archaeology); Representation (politics); Process (computing); Data mining; Process modeling; Machine learning; Pairwise comparison; Probabilistic logic; Artificial intelligence; Business process; Business process management; Work in process","retraction":null,"screen_n_in":null,"score":{"opus":0.02617369674464045,"gpt":0.3155886488340728,"spread":0.2894149520894324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000838564,0.0001330692,0.0004272003,0.0004152415,0.0001103253,0.0002143726,0.0001286886,0.00007494381,0.000008007179],"category_scores_gemma":[0.00004372314,0.000114794,0.0001151498,0.001171704,0.00001934885,0.003358287,0.00003750182,0.00005049005,0.00001260173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001419799,"about_ca_system_score_gemma":0.00002587669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000301023,"about_ca_topic_score_gemma":0.000009107569,"domain_scores_codex":[0.9987577,0.00001170683,0.000705834,0.0001505988,0.0002124917,0.0001617085],"domain_scores_gemma":[0.998022,0.00004065902,0.000847324,0.0001917248,0.0008879084,0.00001045191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004179808,0.000008500305,0.05346817,0.001694379,0.0001713634,1.163466e-8,0.0002123624,0.9295907,0.000004905055,0.001017312,0.00007817418,0.0137123],"study_design_scores_gemma":[0.0003865967,0.00000568982,0.0008912068,0.00009924899,0.0003387664,3.513194e-7,0.001241419,0.9957276,0.0000137085,0.000222649,0.0009334389,0.0001393039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3150827,0.0001206629,0.6835558,0.0000583515,0.000148483,0.0004583905,0.00000534517,0.00005400429,0.0005162379],"genre_scores_gemma":[0.9981578,0.00001020354,0.001133549,0.0001565412,0.0001258802,0.0000945601,0.0002258398,0.000008544028,0.00008710133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6830751,"threshold_uncertainty_score":0.4681164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974941207","doi":"10.1016/j.is.2010.08.005","title":"Improving the usability of standard schemas","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Usability; Variety (cybernetics); XML; RDF; Data science; Semantic data model; Software engineering; Semantic Web; Information retrieval; World Wide Web; Human–computer interaction; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01202619647189775,"gpt":0.2337075980879423,"spread":0.2216814016160446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008880612,0.00004566088,0.00009085584,0.00003426906,0.00006838251,0.0001341817,0.000433242,0.00004002601,0.000002430663],"category_scores_gemma":[0.0002473617,0.00002688595,0.00002796885,0.00012397,0.00005270069,0.001245916,0.00008986829,0.00008811591,0.00002803715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009822683,"about_ca_system_score_gemma":0.00006140504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001823815,"about_ca_topic_score_gemma":0.00001046211,"domain_scores_codex":[0.999285,0.00002213162,0.0003189251,0.00004941005,0.0002357454,0.00008876179],"domain_scores_gemma":[0.9990316,0.0001004457,0.0002038848,0.0004702887,0.000175161,0.0000186399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001097129,0.00001303938,0.01194545,0.0003102977,0.00001761284,3.428474e-7,0.007814871,0.0002019216,0.005528006,0.8763526,0.001149499,0.09665535],"study_design_scores_gemma":[0.001555622,0.0002585765,0.04633744,0.0001084095,0.00001771077,0.0001553552,0.00909379,0.5022649,0.09039313,0.001761081,0.3473938,0.0006601611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3161995,0.0000271535,0.6743205,0.0002930193,0.001724154,0.000250249,0.000003780251,0.0001166562,0.007064896],"genre_scores_gemma":[0.9959522,4.525078e-7,0.003960762,0.00003738814,0.00002721016,0.000008712908,5.314953e-7,7.219214e-7,0.00001205587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8745915,"threshold_uncertainty_score":0.1293917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051197250","doi":"10.1016/j.is.2010.01.002","title":"Vocabularies, ontologies, and rules for enterprise and business process modeling and management","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Business process management; Business process; Process (computing); Business process modeling; Process management; Process modeling; Business rule; Artifact-centric business process model; Knowledge management; Data science; Software engineering; Work in process; Business; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01412442030137138,"gpt":0.2240172048951858,"spread":0.2098927845938144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003569989,0.0001709513,0.0002279694,0.000302016,0.0002936581,0.001222139,0.0001030723,0.00009028721,0.000001496035],"category_scores_gemma":[0.00007550279,0.0001455728,0.00001801301,0.0002094263,0.00005135921,0.003310048,0.00009922269,0.00007914462,0.000005577878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005712976,"about_ca_system_score_gemma":0.00001140195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004297656,"about_ca_topic_score_gemma":0.00004443888,"domain_scores_codex":[0.9990756,0.000002493661,0.0003891478,0.0001782738,0.0001690522,0.0001854319],"domain_scores_gemma":[0.9991172,0.00001661536,0.0002205448,0.0001329502,0.0004955029,0.00001721301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000623768,0.0002065593,0.05612713,0.07857148,0.0007133339,0.000009320942,0.004204415,0.05334482,0.0001553047,0.3410667,0.001621894,0.4633553],"study_design_scores_gemma":[0.0007047006,0.000002812519,0.000789971,0.0001722012,0.000110455,0.00001031291,0.001692227,0.9726994,0.000001520209,0.001909725,0.02165232,0.0002543505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7904409,0.0009102555,0.2035638,0.0006461912,0.0005435696,0.0008639914,0.00001587003,0.0002585891,0.002756854],"genre_scores_gemma":[0.9984503,0.0001574011,0.0006902477,0.0002382281,0.0001970905,0.00013564,0.00008590608,0.00001127929,0.00003392819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9193546,"threshold_uncertainty_score":0.9998147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2549141685","doi":"10.1016/j.is.2017.01.002","title":"Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions","year":2017,"lang":"en","type":"article","venue":"Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ","funders":"","keywords":"Computer science; SIMD; Byte; Data compression; Key (lock); Associative array; Parallel computing; Compression (physics); Compression ratio; Database; Operating system; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02574336979932961,"gpt":0.2814763698162006,"spread":0.2557330000168709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004685569,0.0001595662,0.0002243225,0.0002838356,0.0007159567,0.001239471,0.001125915,0.0001115267,0.000003011108],"category_scores_gemma":[0.00007560633,0.0001328808,0.00005040714,0.0001804934,0.00005573003,0.004410977,0.0006376918,0.0002028937,0.00009189754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001676445,"about_ca_system_score_gemma":0.00008730156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001172745,"about_ca_topic_score_gemma":0.00001190179,"domain_scores_codex":[0.9983696,0.00007836588,0.0006213327,0.0001976551,0.0004811343,0.0002518726],"domain_scores_gemma":[0.9979994,0.00003633029,0.0005679476,0.001128756,0.0001623632,0.0001051799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004792132,0.000198721,0.006317354,0.0003822171,0.0000364072,0.00001686679,0.01902263,0.755627,0.0008453743,0.1346837,0.003769106,0.07905264],"study_design_scores_gemma":[0.0005116615,0.00001903634,0.00381918,0.0003955771,0.000002154104,0.00004762936,0.0003530925,0.9707604,0.00007779621,0.00004947537,0.02379719,0.0001668101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1346029,0.00005564319,0.8561882,0.00007747059,0.003485791,0.0004232225,0.000026135,0.0001362212,0.005004411],"genre_scores_gemma":[0.9909252,0.000004175608,0.008853837,0.00003927413,0.0001043689,0.00002137701,0.0000192785,0.000005474914,0.00002703397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8563223,"threshold_uncertainty_score":0.9997973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3110997203","doi":"10.1016/j.is.2020.101687","title":"Efficient top-k recently-frequent term querying over spatio-temporal textual streams","year":2020,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"H2020 Marie Skłodowska-Curie Actions; Norges Forskningsråd","keywords":"Computer science; Index (typography); Window (computing); Task (project management); Social media; Data mining; Information retrieval; Term (time); Data stream mining; Mobile device; Data stream; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01925302185805734,"gpt":0.2338663340570475,"spread":0.2146133121989902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003036916,0.0001532668,0.0001664936,0.0001235653,0.0001175313,0.001001212,0.0007117632,0.00004670868,0.00002349198],"category_scores_gemma":[0.00003195069,0.0001365841,0.00005273824,0.0004058671,0.00001656709,0.002114968,0.0003094371,0.00009575304,0.0006982636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007630474,"about_ca_system_score_gemma":0.00004099881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001350044,"about_ca_topic_score_gemma":0.0000014264,"domain_scores_codex":[0.9983691,0.00004406587,0.0005767677,0.0001946618,0.0005669479,0.0002484861],"domain_scores_gemma":[0.9990585,0.00002155888,0.0002902838,0.0004036736,0.00008586705,0.000140152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006119105,0.0002014407,0.02066724,0.001266406,0.0002158418,0.00005343955,0.03240594,0.06579607,0.00009551537,0.2732959,0.09736519,0.5085759],"study_design_scores_gemma":[0.0004933562,0.00005297497,0.000856237,0.00005380754,0.000004571542,0.000004209027,0.0007513235,0.8116585,0.00006981578,0.000007282023,0.1858249,0.0002230765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03289428,0.00007459897,0.9391429,0.0008402169,0.001743381,0.0008966379,0.00006059965,0.0006293101,0.02371812],"genre_scores_gemma":[0.996806,0.000004426001,0.001892054,0.0007522152,0.0001913885,0.00002926986,0.0002356395,0.000005562171,0.00008350092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9639117,"threshold_uncertainty_score":0.965471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047432893","doi":"10.1016/j.is.2014.09.001","title":"Profile Diversity for Query Processing using User Recommendations","year":2014,"lang":"en","type":"article","venue":"Information Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Information retrieval; Diversity (politics); Web search query; Query optimization; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.04397560426400225,"gpt":0.2785230375405496,"spread":0.2345474332765474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139228,0.00009776789,0.0001485689,0.0001609454,0.0005374941,0.0005325836,0.0003970275,0.00006813928,0.000001906268],"category_scores_gemma":[0.00003167827,0.00008898007,0.00004783347,0.0001938737,0.000009069064,0.004143084,0.0002203292,0.00005387182,0.00002292216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008439468,"about_ca_system_score_gemma":0.00004271095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001983206,"about_ca_topic_score_gemma":0.000002844931,"domain_scores_codex":[0.9990534,0.00006252888,0.0004130522,0.0001158459,0.0001818986,0.0001732583],"domain_scores_gemma":[0.9990085,0.00005361778,0.000338132,0.0002762284,0.0002713309,0.00005221451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001465067,0.00008447734,0.006456701,0.00183906,0.00006360524,3.439853e-7,0.01516305,0.001031792,0.0001965848,0.4041227,0.1038036,0.4672234],"study_design_scores_gemma":[0.0002315149,0.0000323272,0.0001323325,0.0001238047,0.000003907391,0.00001492968,0.0002816895,0.5574669,0.0002502541,0.0002699662,0.4410264,0.0001659919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008131179,0.00001547507,0.9917749,0.0002661966,0.0007837989,0.0006320421,0.00000991176,0.0003521438,0.005352416],"genre_scores_gemma":[0.9174497,0.000001453105,0.08187959,0.0002370397,0.0001205506,0.0001221155,0.00002771714,0.000005624187,0.0001561896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9166366,"threshold_uncertainty_score":0.5135716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388154056","doi":"10.1016/j.is.2023.102312","title":"Measuring rule-based LTLf process specifications: A probabilistic data-driven approach","year":2023,"lang":"en","type":"article","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Probabilistic logic; Data mining; Process (computing); Event (particle physics); Process mining; Context (archaeology); Conformance checking; Temporal logic; Key (lock); Isolation (microbiology); Linear temporal logic; Software engineering; Programming language; Work in process; Artificial intelligence; Business process; Business process modeling","retraction":null,"screen_n_in":null,"score":{"opus":0.1687923905927181,"gpt":0.2611907434386695,"spread":0.09239835284595149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008909209,0.0001890218,0.0002555536,0.0007574039,0.0003254661,0.001225771,0.0006964811,0.00007873831,0.00001333765],"category_scores_gemma":[0.000269207,0.0001676847,0.00005142962,0.001967001,0.00003505296,0.00556732,0.0001215695,0.0001132637,0.002214159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000038889,"about_ca_system_score_gemma":0.00008134962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002183789,"about_ca_topic_score_gemma":0.000003756059,"domain_scores_codex":[0.9981068,0.00001154587,0.0006966423,0.0002713615,0.0006361747,0.0002774808],"domain_scores_gemma":[0.9980513,0.00002960384,0.0005043213,0.0006858735,0.0007110473,0.00001782985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000154932,0.00005237138,0.001722919,0.004139351,0.00004294571,8.074965e-7,0.000216618,0.9836172,0.000006844275,0.004216021,0.002709775,0.003259611],"study_design_scores_gemma":[0.0003000856,9.789359e-7,0.0004710192,0.000132149,0.00005727413,0.000001245106,0.001221095,0.9794169,0.000001432638,0.0001794954,0.01799754,0.0002207991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160251,0.0003837603,0.6925821,0.003052877,0.002670685,0.004629681,0.0002808601,0.008600081,0.1275489],"genre_scores_gemma":[0.9958369,0.000003495966,0.000187005,0.0001882698,0.0006102911,0.0002607805,0.002815439,0.00002052492,0.00007726562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8355859,"threshold_uncertainty_score":0.9998111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389989770","doi":"10.1016/j.is.2023.102339","title":"Foundations and practice of binary process discovery","year":2023,"lang":"en","type":"article","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Process (computing); Binary number; Data science; Business process discovery; Programming language; Work in process; Business process; Business process modeling; Arithmetic; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02833699263932253,"gpt":0.2800358933909709,"spread":0.2516989007516484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947901,0.00007138483,0.0001241886,0.0004325753,0.0001273211,0.0005282609,0.00008073949,0.00003446026,0.00000324602],"category_scores_gemma":[0.0003823572,0.00006178323,0.00002397579,0.001107975,0.00002586668,0.01271265,0.00004688969,0.00003798633,0.0001979417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006110412,"about_ca_system_score_gemma":0.00002059546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003337047,"about_ca_topic_score_gemma":0.000001467946,"domain_scores_codex":[0.9992435,0.000005642138,0.0003528546,0.00006726688,0.0002359938,0.00009471943],"domain_scores_gemma":[0.9989046,0.00006425309,0.0003912781,0.0001030968,0.0005317017,0.000005024743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000396661,0.0002897829,0.03153621,0.03156898,0.0006307669,0.00001099479,0.008256553,0.5982115,0.001445284,0.2671564,0.02132755,0.03916929],"study_design_scores_gemma":[0.000549026,0.000007357215,0.00275257,0.0003241831,0.0001601732,0.00001000894,0.02018114,0.8266062,0.00001031477,0.0006275018,0.1484681,0.0003034349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8600827,0.0003141584,0.03844497,0.004364421,0.001227542,0.0007792395,0.00003819349,0.0009674995,0.09378128],"genre_scores_gemma":[0.9992754,0.00002118367,0.00001937483,0.0002010604,0.0001576623,0.00002906113,0.0001548472,0.000005440605,0.0001359465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2665289,"threshold_uncertainty_score":0.9216363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402217170","doi":"10.1016/j.is.2024.102459","title":"Tri-AL: An open source platform for visualization and analysis of clinical trials","year":2024,"lang":"en","type":"article","venue":"Information Systems","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Computer science; Visualization; Open source; Data science; Human–computer interaction; Information retrieval; Data mining; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.2393030644157725,"gpt":0.5279758031200584,"spread":0.2886727387042859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01400076,0.00008563315,0.0005996565,0.000515464,0.00008118449,0.001100784,0.0005060013,0.00008558687,0.000004207984],"category_scores_gemma":[0.001422008,0.00006858969,0.0001070316,0.0009329992,0.0000151253,0.003590363,0.000136385,0.00008789468,0.000007418374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000243334,"about_ca_system_score_gemma":0.0001266569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003596979,"about_ca_topic_score_gemma":0.00001090199,"domain_scores_codex":[0.9969683,0.0004538487,0.002011389,0.0001763696,0.0002762865,0.0001138452],"domain_scores_gemma":[0.9971631,0.001457382,0.0007212147,0.0003428818,0.0002221877,0.00009326995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008018966,0.00003036593,0.008475353,0.00131348,0.0006487229,4.679756e-7,0.01373571,0.01648563,0.000005988392,0.442407,0.002941354,0.5138757],"study_design_scores_gemma":[0.0002782668,0.0001482779,0.001510813,0.00006003161,0.00006687336,0.000002900694,0.0002763794,0.8827636,0.000004785188,0.00005758058,0.1147614,0.00006908036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0200802,0.0001307374,0.9770061,0.000204822,0.0008399819,0.00106664,0.00004153356,0.000171309,0.0004587298],"genre_scores_gemma":[0.9968504,0.00001720573,0.002357018,0.0002780734,0.0000854357,0.00009446099,0.0002136166,0.000006915686,0.00009683281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9767702,"threshold_uncertainty_score":0.9999362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403471969","doi":"10.1016/j.is.2024.102475","title":"Explaining results of path queries on graphs: Single-path results for context-free path queries","year":2024,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Path (computing); Computer science; Context (archaeology); Path expression; Longest path problem; Theoretical computer science; Graph; Data mining; Shortest path problem; Query language; Computer network; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.03023983967058868,"gpt":0.2436223856552344,"spread":0.2133825459846457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001383213,0.0002105213,0.000282132,0.0003762093,0.0001518227,0.001204156,0.0009039534,0.0000760938,5.260987e-7],"category_scores_gemma":[0.0004400637,0.0001756763,0.000102371,0.0005010177,0.00005682242,0.005708001,0.0002526277,0.00009730693,0.00004671512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000551253,"about_ca_system_score_gemma":0.00006022637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001400921,"about_ca_topic_score_gemma":0.000009593414,"domain_scores_codex":[0.997659,0.00006115508,0.001168088,0.0002794186,0.0005509336,0.0002814417],"domain_scores_gemma":[0.9979908,0.0003318218,0.000469451,0.0009209434,0.0002235385,0.00006338715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002637179,0.00003983355,0.00001019966,0.001026017,0.00007920244,0.000009262326,0.02191425,0.0002776806,0.00003446847,0.7587013,0.135264,0.08238013],"study_design_scores_gemma":[0.002457978,0.0008894347,0.00007032401,0.001989545,0.00001643644,0.0000115972,0.008820411,0.145807,0.0006645699,0.001316172,0.83751,0.0004464844],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004720001,0.0008796713,0.9147851,0.001715835,0.00965446,0.002556787,0.005230343,0.001592317,0.05886551],"genre_scores_gemma":[0.9913693,0.00004506467,0.006670765,0.0001929661,0.0001678254,0.0001698891,0.0006563237,0.00001420612,0.0007136746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9866493,"threshold_uncertainty_score":0.9998327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2264573896","doi":"10.1016/j.is.2013.01.004","title":"Forward to the special issue on vocabularies, ontologies and rules for the enterprise","year":2013,"lang":"en","type":"article","venue":"Information Systems","topic":"Collaboration in agile enterprises","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval; Data science; Knowledge management","retraction":null,"screen_n_in":null,"score":{"opus":0.01138345871581229,"gpt":0.2225070611590267,"spread":0.2111236024432144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002865373,0.0001088837,0.0001096371,0.0001127142,0.0003617438,0.002073731,0.0002380959,0.00003667988,0.0000967603],"category_scores_gemma":[0.0003410771,0.00005936801,0.00002952009,0.0001645944,0.00003184955,0.002011465,0.00009396279,0.00004879145,0.0019484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002595025,"about_ca_system_score_gemma":0.00001153774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005454964,"about_ca_topic_score_gemma":0.0001028519,"domain_scores_codex":[0.9992353,0.000008317223,0.0003233789,0.00007655686,0.0002147919,0.0001416692],"domain_scores_gemma":[0.9990674,0.0001878654,0.0002012811,0.0002239435,0.0003105962,0.000008876167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005502059,0.000007473019,0.001242513,0.0001179821,0.00002734718,9.586912e-8,0.001358771,0.001732953,0.000001416721,0.02676417,0.9272236,0.04146862],"study_design_scores_gemma":[0.0001999442,0.00001182296,0.002457369,0.00003178939,0.00001090019,8.632179e-7,0.004878296,0.008745646,0.00000351112,0.000139399,0.9834398,0.00008064295],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1173147,0.001073591,0.2340171,0.1722061,0.04465761,0.03709698,0.0003278142,0.001450218,0.391856],"genre_scores_gemma":[0.9788945,0.0000122221,0.00007525564,0.007435708,0.01093353,0.001444783,0.00005252913,0.00001224948,0.001139273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8615798,"threshold_uncertainty_score":0.9989622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3188393868","doi":"10.1016/j.is.2022.102156","title":"Extending sticky-Datalog<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e182\" altimg=\"si10.svg\"><mml:msup><mml:mrow/><mml:mrow><mml:mo>±</mml:mo></mml:mrow></mml:msup></mml:math>via finite-position selection functions: Tractability, algorithms, and optimization","year":2022,"lang":"lv","type":"article","venue":"Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo","keywords":"Datalog; Computer science; Oracle; MAGIC (telescope); Modulo; Predicate (mathematical logic); Class (philosophy); Function (biology); Selection (genetic algorithm); Algorithm; Theoretical computer science; Discrete mathematics; Programming language; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01654994138557585,"gpt":0.2389783859943224,"spread":0.2224284446087466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001828842,0.0005457078,0.0003103767,0.0004668182,0.002162128,0.001523422,0.000726586,0.0006592345,0.001321244],"category_scores_gemma":[0.0006191867,0.0008129696,0.0003874531,0.001055449,0.0003659004,0.007138317,0.001079537,0.0008726665,0.0006515319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008074551,"about_ca_system_score_gemma":0.0005860878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001589847,"about_ca_topic_score_gemma":0.000127974,"domain_scores_codex":[0.9941091,0.0003832155,0.001894564,0.0009188104,0.001733892,0.0009604465],"domain_scores_gemma":[0.9955377,0.0007527607,0.001962074,0.001074285,0.0002870144,0.0003861848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002604509,0.0001288212,0.00001165259,0.001195554,0.000262392,0.00006756646,0.003232443,0.1216056,0.0002739666,0.8651016,0.00243044,0.005429565],"study_design_scores_gemma":[0.0008568852,0.000836348,0.00006397268,0.0005086329,0.000256717,0.002276909,0.004083621,0.9743147,0.004201466,0.00001857852,0.01188985,0.0006922979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2494255,0.0008310704,0.7323522,0.000278103,0.005133626,0.0002433139,0.001574717,0.0004478729,0.009713578],"genre_scores_gemma":[0.9827496,0.0003134035,0.009026037,0.0003361522,0.001020396,0.001234473,0.005060591,0.0001340074,0.0001253323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.865083,"threshold_uncertainty_score":0.9995917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2909965602","doi":"10.1016/j.is.2019.01.004","title":"Introduction to the Special Issue on Integrating Process-oriented and Event-based Systems","year":2019,"lang":"en","type":"article","venue":"Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Process (computing); Event (particle physics); Software engineering; Process management; Data science; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005499075885879379,"gpt":0.2368060791239883,"spread":0.2313070032381089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000643595,0.0001525593,0.0001918526,0.0001622943,0.0001892748,0.0003479881,0.0002316194,0.00004771408,0.000008845569],"category_scores_gemma":[0.0001101196,0.0000994752,0.00002429272,0.0004389705,0.00001540991,0.002277528,0.00005743137,0.000122058,0.0009623901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008522325,"about_ca_system_score_gemma":0.00005620337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009366241,"about_ca_topic_score_gemma":0.00000684983,"domain_scores_codex":[0.9985185,0.00008732985,0.0005372232,0.0002127619,0.0004517755,0.0001924449],"domain_scores_gemma":[0.9987444,0.00005873666,0.0003064915,0.0005502977,0.0002688227,0.00007128224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001042363,0.00003866144,0.0005379443,0.001166677,0.00003769531,0.000002058134,0.01688552,0.2525131,0.0001922888,0.6409543,0.06172366,0.0258439],"study_design_scores_gemma":[0.000212087,0.0001147993,0.00005059653,0.0001743598,0.000001473716,0.00002334569,0.003859922,0.1243209,0.0001676017,0.000002147491,0.8709446,0.0001280822],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009509402,0.00004621175,0.9735835,0.00175825,0.009250883,0.001709759,0.00003949025,0.0001816211,0.003920853],"genre_scores_gemma":[0.985692,0.000002261332,0.001460452,0.0005573905,0.01082128,0.0003138502,0.0000914087,0.00001324152,0.001048135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761826,"threshold_uncertainty_score":0.9998155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234936942","doi":"10.29085/9781783302437.012","title":"Increasing social connection through a community-of-practice-inspireddesign","year":2018,"lang":"en","type":"book-chapter","venue":"Information Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cognition; Protocol analysis; Work (physics); Abstraction; Coding (social sciences); Psychology; Computer science; Cognitive science; Social psychology; Engineering; Sociology; Epistemology; Social science","retraction":null,"screen_n_in":null,"score":{"opus":0.0531885258814364,"gpt":0.2650689567026203,"spread":0.2118804308211839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001640872,0.0003201696,0.0005697237,0.0005405145,0.00073704,0.000684477,0.0003068941,0.0004456558,0.0001303722],"category_scores_gemma":[0.0003120104,0.0003166529,0.0001800426,0.0002154749,0.0001110315,0.007417816,0.0001292206,0.0004701448,0.0009819741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007429978,"about_ca_system_score_gemma":0.00006588981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005791108,"about_ca_topic_score_gemma":0.00001629933,"domain_scores_codex":[0.9979278,0.0000420248,0.001089183,0.0001259298,0.0006343486,0.0001806849],"domain_scores_gemma":[0.9945274,0.0001309582,0.002605866,0.0003155522,0.002411919,0.00000833225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005898386,0.0001399199,0.00008245822,0.0127924,0.001465814,0.0000050247,0.01206755,0.002601006,0.00004455593,0.9057891,0.04123403,0.0231883],"study_design_scores_gemma":[0.0004735572,0.00001452621,0.000008203072,0.001006252,0.000550803,0.00001938663,0.004734007,0.01116943,0.000003526605,0.005707673,0.9757847,0.00052798],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0009700251,0.00016007,0.02503696,0.0001883135,0.0009271486,0.0003427228,0.00002214705,0.0002876406,0.972065],"genre_scores_gemma":[0.9847244,0.00004628878,0.0002587864,0.001510417,0.004119465,0.00003193549,0.001040404,0.00007727545,0.008191006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9837544,"threshold_uncertainty_score":0.9999285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}