{"meta":{"query_hash":"a57dbc4bd326","filters":{"venue":"Information Systems"},"cohort_total":34,"direct_labels_cover":0,"predictions_cover":34,"exported":34,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a57dbc4bd326","api":"https://metacan.xera.ac/api/v1/cohort?venue=Information+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01202619647189775,"score_gpt":0.23370759808794234,"score_spread":0.22168140161604458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974941207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31998745,0.0056618564,0.63572735,0.0041590505,0.00052685424,0.0012178347,0.0010704872,0.011549878,0.020099282],"genre_scores_gemma":[0.52379507,0.0031778119,0.46077716,0.0009745029,0.00011870505,0.00031605453,0.002743669,0.0042141243,0.003882959],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.90974927,0.047851797,0.00911972,0.003909966,0.027569994,0.0017992181],"domain_scores_gemma":[0.72105867,0.14052145,0.00613231,0.07479333,0.05620408,0.001290095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05238365,0.0017122648,0.0015801025,0.006165949,0.0016295415,0.012108397,0.004002614,0.0028855447,0.0037874414],"category_scores_gemma":[0.23803125,0.0016618819,0.0020400535,0.005922807,0.002136943,0.019895,0.0065458445,0.0029984487,0.0012821058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021088778,0.0014623234,0.028478298,0.0042634476,0.0012847104,0.0009938839,0.014457335,0.018615901,0.030992184,0.13224618,0.021401413,0.7436955],"study_design_scores_gemma":[0.00077030354,0.0017579272,0.012823671,0.0039159926,0.003939924,0.0024554664,0.01637292,0.30955553,0.18319662,0.25882176,0.20573375,0.0006562054],"about_ca_topic_score_codex":0.007112257,"about_ca_topic_score_gemma":0.0059555504,"teacher_disagreement_score":0.05238365,"about_ca_system_score_codex":0.0029282838,"about_ca_system_score_gemma":0.0049508885,"threshold_uncertainty_score":0.27703452},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03226710671312223,"score_gpt":0.3096500319111106,"score_spread":0.2773829251979884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979660621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10872231,0.0071375,0.8685054,0.0009641273,0.00053489505,0.00087644765,0.005114661,0.0056327684,0.002511916],"genre_scores_gemma":[0.26060247,0.0025411558,0.7215549,0.0002946273,0.00033734983,0.00089155236,0.010851454,0.00034880612,0.0025777535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959578,0.00070044736,0.0008705951,0.0005062127,0.0016729818,0.00029191835],"domain_scores_gemma":[0.9848161,0.0057486882,0.0011535074,0.0056068506,0.0022294028,0.00044538925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005105868,0.0006075951,0.0023208417,0.007284139,0.0015801777,0.0031213672,0.0026492618,0.0017340521,0.003113929],"category_scores_gemma":[0.022673484,0.00054236484,0.000907241,0.012091457,0.0012344351,0.0072798156,0.002940842,0.0014427265,0.0018913856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002105981,0.0006163833,0.0037742106,0.0011635179,0.00016690095,0.00018683821,0.00058453495,0.022907928,0.03455627,0.050480902,0.018655932,0.8648006],"study_design_scores_gemma":[0.0008695814,0.0014674601,0.0059817974,0.00040830416,0.00042050774,0.0020547053,0.0007453673,0.66643983,0.060695905,0.22879152,0.031838484,0.00028664456],"about_ca_topic_score_codex":0.0015773373,"about_ca_topic_score_gemma":0.0022269895,"teacher_disagreement_score":0.007284139,"about_ca_system_score_codex":0.0016005574,"about_ca_system_score_gemma":0.0026488488,"threshold_uncertainty_score":0.027002752},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01253043178690378,"score_gpt":0.20485683220262468,"score_spread":0.1923264004157209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997167079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102919795,0.0003459633,0.88760966,0.0007069831,0.00011053413,0.0003404733,0.000086077824,0.0038062844,0.0040741917],"genre_scores_gemma":[0.5125649,0.000312502,0.48220712,0.000143757,0.000117278694,0.00025826375,0.0002280733,0.00019175948,0.00397644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992219,0.00018489976,0.00004817381,0.00016261019,0.00029634943,0.00008610561],"domain_scores_gemma":[0.99811673,0.00061733025,0.000121842786,0.0003762655,0.000522007,0.00024587044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151087,0.00055930245,0.0011490871,0.0007278014,0.0015536736,0.0011965664,0.0022039632,0.0015805697,0.0013898555],"category_scores_gemma":[0.0033313658,0.0005652792,0.00040544604,0.00084227824,0.000776421,0.002609877,0.0019328246,0.0009382653,0.0009251551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056378206,0.00078270695,0.005031737,0.0005878608,0.00019572715,0.001267894,0.0006203223,0.57861644,0.14084242,0.038034692,0.011899243,0.22155719],"study_design_scores_gemma":[0.00006453468,0.00018534684,0.0004431808,0.000012974034,0.000049597482,0.00028723374,0.00009031688,0.9631565,0.019789027,0.01037286,0.0055215973,0.00002684478],"about_ca_topic_score_codex":0.0023577197,"about_ca_topic_score_gemma":0.002420269,"teacher_disagreement_score":0.0023577197,"about_ca_system_score_codex":0.0007557912,"about_ca_system_score_gemma":0.0011382787,"threshold_uncertainty_score":0.006087601},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Temporal database; Data mining; Database","score_opus":0.09938944203689498,"score_gpt":0.2954013290880879,"score_spread":0.19601188705119293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997651539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039295234,0.0011695743,0.9536576,0.0004082451,0.00036517982,0.00013013861,0.00039614935,0.0020350416,0.0025427602],"genre_scores_gemma":[0.64085805,0.0015651349,0.34712765,0.00020970801,0.0006264362,0.00037997507,0.0017801771,0.00015137494,0.007301472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895656,0.00025584185,0.00016143131,0.00029557818,0.00021120011,0.000119303375],"domain_scores_gemma":[0.99742293,0.001384517,0.00018465718,0.00028814684,0.00065468345,0.00006508539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021266707,0.00087188894,0.0010088197,0.0022068974,0.00072562404,0.001898845,0.0008066284,0.0008827493,0.0028461344],"category_scores_gemma":[0.005629857,0.00033473363,0.0012309989,0.0020127075,0.0002948829,0.0024638975,0.00076265685,0.0013773718,0.0021404629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003219687,0.0002385804,0.00590604,0.00016900501,0.00016489788,0.00010508581,0.00012482773,0.03879577,0.0068175243,0.0046316297,0.00604361,0.93668103],"study_design_scores_gemma":[0.000010979185,0.00008012877,0.0011771714,0.00003397398,0.00007878679,0.00006214315,0.000071352864,0.98504454,0.005676973,0.0055754166,0.0021735493,0.000014836275],"about_ca_topic_score_codex":0.0031870462,"about_ca_topic_score_gemma":0.002421644,"teacher_disagreement_score":0.0031870462,"about_ca_system_score_codex":0.00075847557,"about_ca_system_score_gemma":0.00089102314,"threshold_uncertainty_score":0.011246979},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02576577915017323,"score_gpt":0.2945594008217358,"score_spread":0.26879362167156257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000702636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046011925,0.00079017185,0.89704496,0.0018197868,0.00024872634,0.00050639594,0.0006673249,0.031715356,0.02119537],"genre_scores_gemma":[0.4567355,0.001257897,0.5029233,0.0016031985,0.00013273483,0.00043327807,0.003605245,0.002125891,0.031183058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799156,0.00047594204,0.00021604792,0.0004040285,0.0007254593,0.0001869812],"domain_scores_gemma":[0.998052,0.00039820053,0.00010651445,0.0009216884,0.0002790853,0.00024248763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032097292,0.0007202136,0.00097335456,0.0012874496,0.0019390779,0.0051608593,0.0032314693,0.0020022325,0.0034262615],"category_scores_gemma":[0.005383457,0.00091659185,0.00083666376,0.0014820012,0.0016180697,0.012807243,0.008036429,0.0028849111,0.0013666124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015943669,0.0010776118,0.01232903,0.00090172404,0.00040773107,0.0021610018,0.006259122,0.023184525,0.024201963,0.5205967,0.046352573,0.36093372],"study_design_scores_gemma":[0.000115985924,0.00020237711,0.0036703001,0.00026149614,0.0004146919,0.0016393095,0.0013470749,0.37464207,0.035579786,0.25188786,0.32999808,0.0002408759],"about_ca_topic_score_codex":0.005655793,"about_ca_topic_score_gemma":0.009764382,"teacher_disagreement_score":0.005655793,"about_ca_system_score_codex":0.001463986,"about_ca_system_score_gemma":0.0025198308,"threshold_uncertainty_score":0.016974866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0335790971528764,"score_gpt":0.26375830145697404,"score_spread":0.23017920430409763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006806998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068496317,0.00039796397,0.98975813,0.00021113244,0.000054205924,0.000054138556,0.000111252826,0.0006023777,0.0019610836],"genre_scores_gemma":[0.16038753,0.0011701273,0.83539265,0.00023381707,0.0001240936,0.00013032646,0.0006181472,0.00014549786,0.0017978183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760395,0.00066377874,0.00046410187,0.00026245337,0.0008813445,0.00012436116],"domain_scores_gemma":[0.995854,0.0015515157,0.0002770313,0.0015504705,0.00064553303,0.00012131665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039253565,0.0006044939,0.001037176,0.001829677,0.00076331844,0.004622918,0.0024472764,0.0011389756,0.0019673167],"category_scores_gemma":[0.009761606,0.00063847605,0.0018179631,0.0032012095,0.0009248169,0.0070257937,0.0026077293,0.0014629323,0.00080753554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016670227,0.00020374342,0.0024754417,0.00043107322,0.00021206785,0.00068036583,0.0011119088,0.06487148,0.004231891,0.63009554,0.0037637549,0.29175606],"study_design_scores_gemma":[0.000045818408,0.00006420215,0.00029866298,0.00013335461,0.00015933266,0.00033667538,0.00016019992,0.3846144,0.0043807793,0.5688387,0.040909395,0.000058330592],"about_ca_topic_score_codex":0.0031707725,"about_ca_topic_score_gemma":0.0026038392,"teacher_disagreement_score":0.004622918,"about_ca_system_score_codex":0.0006764531,"about_ca_system_score_gemma":0.0008661176,"threshold_uncertainty_score":0.020759523},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05425727120654508,"score_gpt":0.28254411237563026,"score_spread":0.22828684116908518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046904770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08936387,0.000846025,0.8440689,0.0004295894,0.0002837818,0.00024937006,0.0007193638,0.013227869,0.05081132],"genre_scores_gemma":[0.66897064,0.0006122941,0.27086267,0.0003156308,0.00019920335,0.00015115966,0.0013596393,0.0053086937,0.052220143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716944,0.00053473236,0.00014809651,0.00041506818,0.0011592185,0.0005733658],"domain_scores_gemma":[0.9970306,0.0012061164,0.00015443134,0.0007553387,0.0007591929,0.00009430543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024789176,0.0008546811,0.0011886746,0.0008652375,0.0009860975,0.0033125912,0.0020313999,0.0009422999,0.016997369],"category_scores_gemma":[0.0059226635,0.0005682213,0.0013007784,0.0011102558,0.0015292102,0.0060312375,0.0027480312,0.0010729653,0.003820585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018553166,0.00022831734,0.0022029697,0.0009826524,0.00019835835,0.00080423214,0.0019209394,0.018955505,0.046596497,0.6153318,0.022251999,0.28867137],"study_design_scores_gemma":[0.00021803378,0.000411561,0.0014958235,0.00020086885,0.00045203915,0.00075008435,0.0007588132,0.1419546,0.23825125,0.53517723,0.08009383,0.00023592392],"about_ca_topic_score_codex":0.002252501,"about_ca_topic_score_gemma":0.0026289006,"teacher_disagreement_score":0.016997369,"about_ca_system_score_codex":0.0013901369,"about_ca_system_score_gemma":0.0012160253,"threshold_uncertainty_score":0.056861877},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04397560426400225,"score_gpt":0.27852303754054963,"score_spread":0.23454743327654737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047432893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04516061,0.0011664471,0.94993466,0.0003573234,0.00009768208,0.00017705864,0.00032022689,0.001403016,0.0013830088],"genre_scores_gemma":[0.66974777,0.0006929859,0.32382753,0.00022382053,0.00036419922,0.00022828855,0.0010131804,0.00021302042,0.0036892688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953909,0.0014657126,0.00026961678,0.00087754545,0.0015542313,0.0004420026],"domain_scores_gemma":[0.985284,0.00866417,0.00047801752,0.0028347962,0.0022316808,0.00050741795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005595104,0.00089445116,0.0027364956,0.0030456465,0.0015757693,0.0026502865,0.002619873,0.0018154805,0.0029082417],"category_scores_gemma":[0.023375621,0.00087472977,0.0014402528,0.003256583,0.00078871974,0.005088547,0.002358654,0.002461927,0.0017504676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002611592,0.00086777494,0.010319599,0.00033457176,0.0005087357,0.00028388074,0.0007084322,0.16552635,0.022304002,0.03085907,0.010817864,0.7548581],"study_design_scores_gemma":[0.0000462642,0.0001684728,0.0009801629,0.00001541398,0.00006619277,0.00014036549,0.000095052346,0.97709674,0.00444307,0.015424121,0.0014903492,0.00003385345],"about_ca_topic_score_codex":0.0063377446,"about_ca_topic_score_gemma":0.0065140505,"teacher_disagreement_score":0.0063377446,"about_ca_system_score_codex":0.0012033387,"about_ca_system_score_gemma":0.0015252038,"threshold_uncertainty_score":0.02959007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014124420301371383,"score_gpt":0.2240172048951858,"score_spread":0.20989278459381444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051197250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008476344,0.0042575593,0.9632239,0.0068614506,0.0003698373,0.0007244986,0.0038639172,0.0012854887,0.0109371],"genre_scores_gemma":[0.09427598,0.0049511353,0.88234764,0.0015820826,0.00027755732,0.0015679798,0.011289174,0.0005000887,0.003208311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896568,0.003970571,0.0027179376,0.0009884323,0.0022557853,0.00041044192],"domain_scores_gemma":[0.99130017,0.003627574,0.0010730552,0.0024130323,0.0013199773,0.00026620887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014357171,0.0011605502,0.0017796753,0.0050073895,0.0030066948,0.009788779,0.0040923175,0.0032167137,0.0019343871],"category_scores_gemma":[0.022341974,0.001384113,0.0030843033,0.0073143397,0.0038490344,0.016058195,0.004253264,0.00553496,0.0009488089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025273688,0.000050963914,0.00043978269,0.00029772,0.000054901026,0.00012260063,0.0008190319,0.005822905,0.00065844867,0.9549988,0.0055751586,0.03113434],"study_design_scores_gemma":[0.000029385705,0.000025372101,0.00039868723,0.00069170905,0.00012507752,0.00015891627,0.0006328283,0.03498094,0.0010786557,0.89095265,0.070861965,0.00006374459],"about_ca_topic_score_codex":0.029717395,"about_ca_topic_score_gemma":0.027488653,"teacher_disagreement_score":0.029717395,"about_ca_system_score_codex":0.003313372,"about_ca_system_score_gemma":0.010913027,"threshold_uncertainty_score":0.07592887},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022675814558472313,"score_gpt":0.28088881885195727,"score_spread":0.2582130042934849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053019617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942081,0.00015765625,0.000024242618,0.00035753445,0.000005337879,0.000005224675,0.000050773117,0.0000022003408,0.0051888293],"genre_scores_gemma":[0.99930036,0.00006873482,0.000023493814,0.00003054607,0.0000033128158,0.000001982063,0.0000379331,7.318981e-7,0.0005328442],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99916136,0.00015150828,0.00003747219,0.00005821056,0.0002540066,0.0003373974],"domain_scores_gemma":[0.9984263,0.00039405885,0.0004223196,0.000031758296,0.00041545345,0.00031013935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008010051,0.00017158382,0.0002437143,0.0018153647,0.0013954936,0.0018379829,0.0005356815,0.00052865193,0.0031261826],"category_scores_gemma":[0.0019863292,0.00018376179,0.00029834732,0.003061607,0.000628056,0.0008970333,0.00059904176,0.00062267424,0.00036058095],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006805555,0.0004954282,0.9335013,0.000090076566,0.00009786758,0.0012314602,0.008869711,0.00082766893,0.0010177488,0.008560906,0.0041424595,0.04048475],"study_design_scores_gemma":[0.00004749314,0.00018921804,0.97232765,0.000023527855,0.000044800807,0.00031983102,0.02081342,0.0008506444,0.00030693793,0.00070866017,0.004343846,0.000023939516],"about_ca_topic_score_codex":0.043943588,"about_ca_topic_score_gemma":0.065546066,"teacher_disagreement_score":0.043943588,"about_ca_system_score_codex":0.0039090225,"about_ca_system_score_gemma":0.0035780577,"threshold_uncertainty_score":0.08737558},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010174569598353925,"score_gpt":0.23446209226044487,"score_spread":0.22428752266209095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073984053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15935305,0.0038447385,0.77115124,0.00515351,0.0012820134,0.0004624957,0.00956334,0.0127947945,0.03639489],"genre_scores_gemma":[0.46845323,0.0022291364,0.48164672,0.0009910755,0.0007907649,0.0004993488,0.011930246,0.0025186937,0.030940741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00017781646,0.0002081468,0.00025162307,0.00045545545,0.00019325149],"domain_scores_gemma":[0.98950106,0.006014266,0.00030267524,0.0025912146,0.0014490213,0.00014182937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010720933,0.0008068533,0.0011148396,0.0011172822,0.0010452913,0.0026780537,0.0009422123,0.0015908404,0.01594142],"category_scores_gemma":[0.016597692,0.00044638684,0.0006615922,0.002823147,0.00072201644,0.007163558,0.0017340761,0.0018214136,0.005745178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002044137,0.00020904305,0.0028921613,0.0014603811,0.0000771652,0.0013153724,0.00068330456,0.027127126,0.04701823,0.15578468,0.05761214,0.70377624],"study_design_scores_gemma":[0.00013311017,0.00032419563,0.0015410084,0.00040178737,0.000121705154,0.0019901965,0.000492499,0.24572064,0.116207495,0.56463116,0.06837243,0.000063695545],"about_ca_topic_score_codex":0.00042387203,"about_ca_topic_score_gemma":0.0008422121,"teacher_disagreement_score":0.01594142,"about_ca_system_score_codex":0.00079727406,"about_ca_system_score_gemma":0.0011477848,"threshold_uncertainty_score":0.05332935},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05189589636838759,"score_gpt":0.2570927286918884,"score_spread":0.20519683232350078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075468564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008037723,0.00018908782,0.97817695,0.0019995763,0.000023472681,0.00025323915,0.00014566579,0.00015258206,0.011021614],"genre_scores_gemma":[0.28002512,0.0009330243,0.7145885,0.00025297358,0.000055206263,0.0011237079,0.0005110117,0.00011052815,0.0023999133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898168,0.0072615216,0.00056457083,0.00063122023,0.0012879993,0.0004378362],"domain_scores_gemma":[0.9928711,0.004872774,0.00063246617,0.0006167425,0.0006282167,0.00037868597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006691907,0.0019968809,0.0010277741,0.0042911,0.0019905458,0.0065463902,0.0031687191,0.00383722,0.0032575224],"category_scores_gemma":[0.01089565,0.0015826381,0.002874457,0.0035787225,0.004081102,0.011385767,0.005245446,0.002817512,0.0007183586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044395245,0.00012541693,0.0015627462,0.000425163,0.00013655306,0.00046367222,0.0023848107,0.071629256,0.0010286841,0.90197915,0.0011331226,0.01908712],"study_design_scores_gemma":[0.000051196374,0.00010799499,0.00047148997,0.00030606738,0.00017339691,0.00040307606,0.0024516513,0.30961284,0.002208263,0.66079646,0.023347734,0.000069806585],"about_ca_topic_score_codex":0.00301082,"about_ca_topic_score_gemma":0.00411959,"teacher_disagreement_score":0.006691907,"about_ca_system_score_codex":0.002149833,"about_ca_system_score_gemma":0.003038635,"threshold_uncertainty_score":0.035390615},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021003019347201494,"score_gpt":0.2307467823017295,"score_spread":0.209743762954528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082534709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059212632,0.0014388865,0.9244428,0.0050075017,0.00018194165,0.00021240464,0.0018402331,0.0023232717,0.005340219],"genre_scores_gemma":[0.61084634,0.0008216907,0.3776884,0.0013903532,0.0004402499,0.000291972,0.0054695783,0.00045426047,0.0025971662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97326905,0.010626813,0.0025789784,0.0034203553,0.008542567,0.0015622824],"domain_scores_gemma":[0.9436292,0.03878568,0.001829058,0.009406417,0.005698624,0.00065104075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012425798,0.0009732539,0.003095025,0.0031128398,0.00241791,0.0077587953,0.005411184,0.003629387,0.004793877],"category_scores_gemma":[0.06338204,0.0017532127,0.0018865786,0.0071494165,0.0037363379,0.01759817,0.007204987,0.0036981094,0.0008399488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018372148,0.0006073358,0.0068140477,0.0013563124,0.0006043934,0.0014050718,0.0020403357,0.13435616,0.01189039,0.59885967,0.03006033,0.21016873],"study_design_scores_gemma":[0.00018761936,0.000064034684,0.0004203294,0.00004893835,0.0002011271,0.00033958154,0.0006923791,0.37781715,0.006202701,0.6084172,0.0055607464,0.000048111764],"about_ca_topic_score_codex":0.008964719,"about_ca_topic_score_gemma":0.007472067,"teacher_disagreement_score":0.012425798,"about_ca_system_score_codex":0.0020551435,"about_ca_system_score_gemma":0.0044549117,"threshold_uncertainty_score":0.06571466},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034734958614284876,"score_gpt":0.22833759244706478,"score_spread":0.1936026338327799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101496601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025695747,0.0007250173,0.9656394,0.00048541432,0.00012175734,0.00009080386,0.00087554916,0.0018631609,0.0045031584],"genre_scores_gemma":[0.51760334,0.0008010139,0.47198722,0.00026404476,0.00028478008,0.00014166573,0.0025065728,0.0005685415,0.0058428454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851876,0.00046776354,0.0000766398,0.00026242508,0.0005092515,0.00016519532],"domain_scores_gemma":[0.99784243,0.00088097696,0.00014145132,0.0005150247,0.00046605524,0.00015409246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018060653,0.00075525406,0.0015466661,0.0012814831,0.0009371686,0.0019830274,0.002259243,0.0012577226,0.00816028],"category_scores_gemma":[0.006874705,0.00041889827,0.0008904736,0.0023660767,0.0007839021,0.004737747,0.0022187382,0.0014022774,0.0014839343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016253127,0.00025684954,0.004160427,0.0005859976,0.0001722797,0.00021998544,0.00028215864,0.3279897,0.0069037224,0.10304973,0.049441587,0.5053122],"study_design_scores_gemma":[0.000051229214,0.00009808829,0.0004343964,0.000017684886,0.000026919672,0.00013492261,0.00007030936,0.9042034,0.001727576,0.08794363,0.0052674576,0.00002436758],"about_ca_topic_score_codex":0.0037461447,"about_ca_topic_score_gemma":0.0054668393,"teacher_disagreement_score":0.00816028,"about_ca_system_score_codex":0.0006566031,"about_ca_system_score_gemma":0.0014138926,"threshold_uncertainty_score":0.027298927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05081110230503755,"score_gpt":0.25439577021257526,"score_spread":0.2035846679075377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114146497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32495955,0.0058781654,0.6450179,0.0020409233,0.00044267907,0.0005836992,0.0034645873,0.004814623,0.01279781],"genre_scores_gemma":[0.81247807,0.0010465257,0.17406572,0.00019875349,0.00018048745,0.00012731632,0.00201296,0.00014190922,0.009748261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810636,0.0007340588,0.00013842089,0.000249958,0.00062472373,0.000146462],"domain_scores_gemma":[0.99601716,0.0020033333,0.00021009904,0.00066630094,0.0009313549,0.00017183553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019400229,0.00047449974,0.0015556107,0.0030874189,0.0013944972,0.00236784,0.0014028997,0.0012962945,0.0033344768],"category_scores_gemma":[0.009174962,0.00045885908,0.0007239611,0.003547351,0.00045689044,0.0044512777,0.001030431,0.00096317613,0.0018085067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021780287,0.0018616889,0.021802953,0.0008705513,0.00051135645,0.000403386,0.00093844003,0.09224096,0.015097621,0.0333506,0.03585199,0.79489243],"study_design_scores_gemma":[0.00006625988,0.00021764351,0.0049807406,0.000040840143,0.00014915812,0.00032175536,0.00030969983,0.9591768,0.0070840144,0.021701857,0.0058799405,0.00007130742],"about_ca_topic_score_codex":0.015143823,"about_ca_topic_score_gemma":0.034424856,"teacher_disagreement_score":0.015143823,"about_ca_system_score_codex":0.0011462835,"about_ca_system_score_gemma":0.0011778723,"threshold_uncertainty_score":0.030111313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10078243575120967,"score_gpt":0.2798962895402359,"score_spread":0.17911385378902622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159100004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2091035,0.003487328,0.7596431,0.014121178,0.00027836845,0.00023419544,0.0013347446,0.0015931731,0.0102044735],"genre_scores_gemma":[0.72432476,0.0024643282,0.26457295,0.0011613667,0.0005887968,0.00023900991,0.0016391677,0.00058873784,0.004420809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9763698,0.009628555,0.002018114,0.0029893867,0.0069523156,0.0020418272],"domain_scores_gemma":[0.78063756,0.1849755,0.006889088,0.021304665,0.004352477,0.0018406992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015240541,0.0013909467,0.0045005223,0.0031047417,0.002828511,0.013348566,0.008031937,0.005782464,0.0067871604],"category_scores_gemma":[0.15505262,0.0025727896,0.0042371065,0.0077025937,0.008751255,0.037448615,0.00842388,0.007959457,0.0009261341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024604022,0.00036524222,0.009293603,0.00088659034,0.00035307638,0.00032397485,0.0020274175,0.47284666,0.0019087748,0.36693153,0.007907336,0.1346953],"study_design_scores_gemma":[0.00011136674,0.000057215155,0.0005793527,0.0000678004,0.00013448826,0.00013759645,0.0003155245,0.5049471,0.00096727256,0.4913793,0.0012597146,0.000043298787],"about_ca_topic_score_codex":0.015262619,"about_ca_topic_score_gemma":0.010052606,"teacher_disagreement_score":0.015262619,"about_ca_system_score_codex":0.008160215,"about_ca_system_score_gemma":0.006759237,"threshold_uncertainty_score":0.08060062},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval; Data science; Knowledge management","score_opus":0.011383458715812289,"score_gpt":0.2225070611590267,"score_spread":0.2111236024432144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264573896","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020612807,0.014753312,0.0037993419,0.14955224,0.8219111,0.000042228894,0.00018997668,0.0001741252,0.009371527],"genre_scores_gemma":[0.0014865499,0.011901159,0.0027938227,0.0437197,0.8959339,0.00007110424,0.0004657783,0.00045567076,0.04317227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964102,0.0008612201,0.00049857836,0.00051431713,0.0014050769,0.00031067943],"domain_scores_gemma":[0.9782124,0.009677382,0.0017108265,0.0019526219,0.00589868,0.0025479915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007369379,0.0013586864,0.0027820757,0.003667827,0.0030338056,0.013567004,0.002772989,0.010067702,0.038450435],"category_scores_gemma":[0.018222686,0.0008996332,0.0019420737,0.0029149933,0.003547764,0.015606868,0.0044593634,0.021019025,0.017381439],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012097441,0.000019895117,0.000075107026,0.00010574811,0.0000105807785,0.00005221315,0.000044441207,0.00003148233,0.00008639301,0.0044988147,0.9829044,0.012158946],"study_design_scores_gemma":[0.0000060188786,0.0000142862555,0.00017049634,0.00017282936,0.000011110625,0.00010578991,0.000097824006,0.00011710948,0.000061303625,0.006057019,0.9931716,0.000014716575],"about_ca_topic_score_codex":0.0022163792,"about_ca_topic_score_gemma":0.0056845592,"teacher_disagreement_score":0.038450435,"about_ca_system_score_codex":0.0022523026,"about_ca_system_score_gemma":0.0038254124,"threshold_uncertainty_score":0.12862957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09981051094323912,"score_gpt":0.29717849900780147,"score_spread":0.19736798806456235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532696200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02093351,0.00043892738,0.8276537,0.0006027412,0.00016170969,0.0015857203,0.037276845,0.10214277,0.009204122],"genre_scores_gemma":[0.120073065,0.0005807315,0.79168016,0.00028845153,0.00012420524,0.0018531535,0.061890747,0.00629967,0.01720978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952936,0.00008245569,0.000045028984,0.00008912832,0.00020140003,0.000052608935],"domain_scores_gemma":[0.99939466,0.00018341331,0.0000617714,0.00007342136,0.0002216207,0.00006521916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095845934,0.0012706388,0.0005589731,0.0050981347,0.0008336326,0.0020435893,0.0009048096,0.00051423383,0.0054477733],"category_scores_gemma":[0.0025294577,0.00048877666,0.0012003554,0.002153497,0.00028697608,0.0023359403,0.0018279804,0.0010099501,0.0033357448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005783186,0.00043868204,0.016274327,0.0012373283,0.0007721269,0.0006908299,0.0026694436,0.015047518,0.051160827,0.04666529,0.22256581,0.6418995],"study_design_scores_gemma":[0.00008034973,0.0001992407,0.015938574,0.00024700558,0.00028022676,0.00035010782,0.0014997049,0.626958,0.033015475,0.044887222,0.27635542,0.00018865765],"about_ca_topic_score_codex":0.027856566,"about_ca_topic_score_gemma":0.057887044,"teacher_disagreement_score":0.027856566,"about_ca_system_score_codex":0.0011978928,"about_ca_system_score_gemma":0.0014518484,"threshold_uncertainty_score":0.05538881},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02574336979932961,"score_gpt":0.28147636981620056,"score_spread":0.25573300001687094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549141685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094793685,0.00429001,0.7550429,0.0008074238,0.0009090541,0.0005690697,0.0030034943,0.115853414,0.02473103],"genre_scores_gemma":[0.4888342,0.0011260202,0.47359464,0.0007379436,0.00032386486,0.00043710644,0.0050017266,0.0032337212,0.026710752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993235,0.000050567036,0.000047889924,0.00009250342,0.00038462714,0.00010092821],"domain_scores_gemma":[0.9992924,0.00016049684,0.000042513802,0.00028876733,0.00016350245,0.000052309977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952932,0.0012058216,0.00081866304,0.0015456672,0.00062032684,0.001557556,0.0017501394,0.0005132924,0.016234705],"category_scores_gemma":[0.0014189375,0.0004844578,0.00038357143,0.0020882078,0.00062765385,0.0021452194,0.0020938911,0.0009300984,0.004620404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022170683,0.0003921297,0.0016066418,0.00045279186,0.00011241638,0.00039980788,0.0002077188,0.0077207196,0.07543362,0.027675537,0.090382576,0.793399],"study_design_scores_gemma":[0.00079898664,0.00067298976,0.0014482489,0.00013510729,0.00015873004,0.00089188333,0.0002125303,0.33888078,0.5373127,0.030826297,0.08850489,0.00015695575],"about_ca_topic_score_codex":0.0018879881,"about_ca_topic_score_gemma":0.0030840775,"teacher_disagreement_score":0.016234705,"about_ca_system_score_codex":0.0008709166,"about_ca_system_score_gemma":0.0012674273,"threshold_uncertainty_score":0.05431044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02204375242083717,"score_gpt":0.33013193308135197,"score_spread":0.3080881806605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742330620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15683174,0.000799905,0.81057113,0.0032831838,0.00015734351,0.00052962283,0.0005935263,0.0028615594,0.024372092],"genre_scores_gemma":[0.9239485,0.00025769172,0.070624605,0.00019752955,0.00009533648,0.00020789789,0.00044801956,0.00025764134,0.0039627887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9669716,0.013087359,0.0034446104,0.0040932666,0.010153678,0.0022494746],"domain_scores_gemma":[0.7846711,0.09852003,0.018752778,0.07729222,0.01728471,0.0034790789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026806787,0.00055304135,0.0016739912,0.002695934,0.002559742,0.009941772,0.0036686673,0.0021699746,0.0042560296],"category_scores_gemma":[0.12191899,0.0012414508,0.00093931943,0.0026731752,0.0036315392,0.012427354,0.0070830993,0.0038142947,0.0008710283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010758005,0.00069211767,0.011149497,0.0005283583,0.0002404148,0.00061765895,0.0032086857,0.07357578,0.016497876,0.64555985,0.010088623,0.23676531],"study_design_scores_gemma":[0.00025122645,0.00017000412,0.0031415317,0.00017394556,0.00012387388,0.00035091853,0.0008080603,0.49566263,0.0175709,0.45731607,0.024323763,0.00010710957],"about_ca_topic_score_codex":0.006175734,"about_ca_topic_score_gemma":0.005765916,"teacher_disagreement_score":0.026806787,"about_ca_system_score_codex":0.0031873598,"about_ca_system_score_gemma":0.008604115,"threshold_uncertainty_score":0.14176953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005499075885879379,"score_gpt":0.2368060791239883,"score_spread":0.2313070032381089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909965602","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026037774,0.07527029,0.025884151,0.03655845,0.83705693,0.00009747875,0.00030882252,0.00048716232,0.024076408],"genre_scores_gemma":[0.0016761415,0.052742664,0.007343385,0.01586143,0.8626463,0.00007159046,0.00061109225,0.0006709014,0.058376614],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99685186,0.0005398731,0.0004589109,0.00056480634,0.0013932821,0.00019125656],"domain_scores_gemma":[0.988361,0.0051561934,0.0005263451,0.00078268547,0.003963487,0.0012103248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004865669,0.002203822,0.0027205131,0.004702881,0.0012674859,0.009072854,0.00260553,0.0046687266,0.051550347],"category_scores_gemma":[0.010338178,0.0009609167,0.0018823462,0.00473945,0.0017201115,0.0114531405,0.0031606876,0.008562414,0.024356522],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031176623,0.000053124946,0.00011896241,0.0006044568,0.00003490345,0.0000917425,0.000044351546,0.0002691822,0.00047885854,0.006735391,0.9163671,0.075170815],"study_design_scores_gemma":[0.000006993853,0.000035536214,0.00024460946,0.00028890092,0.000022576434,0.00018123203,0.000029127941,0.00047092655,0.00014979167,0.005582837,0.9929684,0.000019132505],"about_ca_topic_score_codex":0.001002918,"about_ca_topic_score_gemma":0.002028501,"teacher_disagreement_score":0.051550347,"about_ca_system_score_codex":0.0013960414,"about_ca_system_score_gemma":0.0017102136,"threshold_uncertainty_score":0.1724531},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02969100307698083,"score_gpt":0.2777349318460065,"score_spread":0.24804392876902567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912763210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06678615,0.0005022075,0.92060864,0.0008273297,0.000097017495,0.00016268723,0.0014159977,0.006553492,0.0030464188],"genre_scores_gemma":[0.7348038,0.00027538126,0.26171935,0.00022897068,0.000047603742,0.0001374497,0.0015979966,0.00032726576,0.0008622576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968802,0.0009668946,0.00041571798,0.00056427886,0.000944682,0.0002282795],"domain_scores_gemma":[0.9882642,0.006961985,0.00093218306,0.0024354584,0.0011889637,0.00021713536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031244028,0.0006776239,0.0006576527,0.002405155,0.00042629134,0.0034946734,0.0018013238,0.001067556,0.0017115093],"category_scores_gemma":[0.022533434,0.00045431484,0.00067568733,0.0020615228,0.0012782753,0.00610633,0.0020484175,0.0013342199,0.0005836147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001142715,0.000528145,0.012216168,0.00036420187,0.00012792573,0.0007383776,0.001245176,0.16475652,0.010504745,0.072017476,0.0051447023,0.7312139],"study_design_scores_gemma":[0.000030763047,0.00009287058,0.0012440707,0.00011553831,0.000060040824,0.00012544698,0.00016360215,0.87580633,0.019032435,0.09816577,0.00511161,0.000051492858],"about_ca_topic_score_codex":0.005494939,"about_ca_topic_score_gemma":0.005298471,"teacher_disagreement_score":0.005494939,"about_ca_system_score_codex":0.001353055,"about_ca_system_score_gemma":0.0016220849,"threshold_uncertainty_score":0.0165236},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026173696744640453,"score_gpt":0.31558864883407284,"score_spread":0.2894149520894324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936018264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011689094,0.00020631975,0.98673797,0.000053494074,0.000019351684,0.000026399659,0.00015085292,0.00045535117,0.00066122384],"genre_scores_gemma":[0.6856471,0.0008191885,0.31039524,0.000040714767,0.000092143404,0.00025696895,0.0006911969,0.00017334869,0.0018841864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994369,0.00017924578,0.000042932137,0.000121171855,0.00017714805,0.000042572294],"domain_scores_gemma":[0.99868697,0.00074776035,0.00019517138,0.00013496402,0.00019090496,0.000044173838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010797215,0.0006633521,0.0006042551,0.0015939554,0.00032747095,0.0012938929,0.0010724845,0.0005743259,0.0010769858],"category_scores_gemma":[0.0046498436,0.0003050818,0.0006425685,0.0015537633,0.00033946728,0.0021710682,0.0005247481,0.00084653916,0.0002551594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000125739,0.00016345401,0.0023935698,0.00010824566,0.00007173417,0.00009018682,0.00018952698,0.82920945,0.0035437963,0.049765836,0.0011107852,0.11322763],"study_design_scores_gemma":[0.0000013815231,0.0000042173574,0.00015418298,0.0000041043136,0.00000771476,0.000007326072,0.0000072945813,0.99446785,0.00026904966,0.0048067058,0.00026712887,0.0000030263686],"about_ca_topic_score_codex":0.011764265,"about_ca_topic_score_gemma":0.008483201,"teacher_disagreement_score":0.011764265,"about_ca_system_score_codex":0.0008812471,"about_ca_system_score_gemma":0.0008649329,"threshold_uncertainty_score":0.023391545},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0029473387324165457,"score_gpt":0.17828583326221475,"score_spread":0.17533849452979822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979389171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22177036,0.00096397346,0.7741411,0.0005070531,0.0001470721,0.000031675714,0.00019283118,0.0006002605,0.0016456035],"genre_scores_gemma":[0.97675145,0.00032888594,0.021852475,0.000024967692,0.000050135775,0.000017503202,0.00012032891,0.000023834767,0.00083045155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972004,0.0000706106,0.00001671611,0.000068818204,0.00008069954,0.000043198732],"domain_scores_gemma":[0.99790984,0.001503751,0.0001695665,0.00011883652,0.00024070949,0.00005732262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009147875,0.0004927266,0.00058120105,0.00088744046,0.00041518733,0.0005968343,0.0008533323,0.00045297173,0.00044061593],"category_scores_gemma":[0.004785065,0.00039337826,0.00019467666,0.0011347844,0.00044225893,0.001614727,0.00038369137,0.0006411878,0.00008380706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072942144,0.00003947073,0.0035523695,0.00002307048,0.0000189357,0.00003255412,0.000024759323,0.95729077,0.00091744243,0.0036156394,0.0006594353,0.033752672],"study_design_scores_gemma":[4.7496835e-7,0.000002457557,0.00016862762,7.322339e-7,0.0000011214985,0.000002904225,0.0000029688497,0.9986896,0.0001237563,0.00096981,0.000036772963,7.847008e-7],"about_ca_topic_score_codex":0.009404594,"about_ca_topic_score_gemma":0.008494917,"teacher_disagreement_score":0.009404594,"about_ca_system_score_codex":0.0007105542,"about_ca_system_score_gemma":0.00046819728,"threshold_uncertainty_score":0.018699706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07813621063965932,"score_gpt":0.28514965826695304,"score_spread":0.20701344762729373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046491668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01369669,0.0012442175,0.9529346,0.0044466574,0.0005780791,0.0003460038,0.0009246861,0.019330014,0.006498969],"genre_scores_gemma":[0.56561196,0.0016893968,0.41419992,0.0029062026,0.00068705395,0.00027143696,0.003141563,0.001673429,0.00981899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892061,0.0034247488,0.00061541336,0.0013811724,0.0042942925,0.0010783009],"domain_scores_gemma":[0.97030556,0.0052383626,0.0009419652,0.019610014,0.0029467181,0.00095732015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006911087,0.0011342971,0.002246884,0.0018677001,0.0029040524,0.0066663823,0.0043922844,0.003967236,0.0057210904],"category_scores_gemma":[0.01967065,0.0011610261,0.0017265165,0.00354464,0.0019040792,0.008936214,0.009440235,0.004141395,0.004763785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035348493,0.0012366631,0.009614734,0.0010477433,0.0009330538,0.0014831448,0.0014834836,0.039486203,0.047969792,0.16433342,0.15044916,0.57842773],"study_design_scores_gemma":[0.0001610246,0.00021301638,0.0019150615,0.00014244822,0.00022832559,0.0023678986,0.0009532249,0.632851,0.06746525,0.18270476,0.11083897,0.00015900709],"about_ca_topic_score_codex":0.002145149,"about_ca_topic_score_gemma":0.0021879997,"teacher_disagreement_score":0.006911087,"about_ca_system_score_codex":0.0012292396,"about_ca_system_score_gemma":0.004532466,"threshold_uncertainty_score":0.036549747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019253021858057336,"score_gpt":0.2338663340570475,"score_spread":0.21461331219899016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110997203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16906837,0.005695209,0.7946385,0.0012094263,0.0004897703,0.0004128425,0.011663531,0.014670994,0.002151354],"genre_scores_gemma":[0.42092803,0.0014257684,0.55316484,0.00024594116,0.00035265178,0.00018252549,0.019810276,0.0005091312,0.0033807335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704283,0.000261481,0.0005071144,0.00054866483,0.0013370054,0.00030278543],"domain_scores_gemma":[0.9947239,0.0024795888,0.0004668138,0.0009783914,0.0010475937,0.00030378802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014253767,0.0012325775,0.002845907,0.004682842,0.0012957742,0.0038489907,0.0033584214,0.0017721765,0.0024958919],"category_scores_gemma":[0.010548558,0.0008081599,0.0015048283,0.0077216127,0.0004750313,0.0051386016,0.0024857682,0.001050637,0.002210282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026097372,0.0006413876,0.013887471,0.0014187474,0.00035959473,0.0009362742,0.00073703454,0.045128793,0.09054016,0.0061575994,0.025615035,0.8119681],"study_design_scores_gemma":[0.000113654256,0.00017404737,0.0027639144,0.000046332738,0.00017840535,0.0009848824,0.0005407218,0.9563679,0.02068529,0.011993737,0.006093496,0.00005767385],"about_ca_topic_score_codex":0.007799348,"about_ca_topic_score_gemma":0.015633078,"teacher_disagreement_score":0.007799348,"about_ca_system_score_codex":0.0008022858,"about_ca_system_score_gemma":0.0026308645,"threshold_uncertainty_score":0.0155079365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03582749930198761,"score_gpt":0.2545681606306928,"score_spread":0.2187406613287052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121217868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0714076,0.0022949874,0.89361596,0.0022497433,0.0008290017,0.00051508995,0.0028568418,0.017464759,0.008766009],"genre_scores_gemma":[0.391906,0.0009645445,0.5704145,0.0011218663,0.0005521409,0.0003537508,0.010529829,0.0006387031,0.023518821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872607,0.00017825315,0.00008935053,0.00041624374,0.000323773,0.00026642595],"domain_scores_gemma":[0.9975689,0.00076993345,0.00018411057,0.00043387405,0.000845594,0.00019749884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016477808,0.0015950319,0.0015471566,0.00306448,0.0012964087,0.0020419678,0.0036974521,0.0028441916,0.0055184257],"category_scores_gemma":[0.0030750483,0.0006066195,0.0013401596,0.0026552747,0.00066708017,0.0031446218,0.002437753,0.004677767,0.0039038365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036307293,0.0010443057,0.0021973834,0.00017916733,0.00010451057,0.00012943149,0.00011945673,0.017444525,0.01337623,0.003505846,0.03213159,0.9294044],"study_design_scores_gemma":[0.000031882497,0.00007231294,0.0007225749,0.00003942103,0.00005807085,0.00007363729,0.000078434496,0.976003,0.011433428,0.0067452984,0.0047168587,0.000025116911],"about_ca_topic_score_codex":0.0187812,"about_ca_topic_score_gemma":0.03737109,"teacher_disagreement_score":0.0187812,"about_ca_system_score_codex":0.0019930769,"about_ca_system_score_gemma":0.0029349322,"threshold_uncertainty_score":0.03734374},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016549941385575848,"score_gpt":0.23897838599432242,"score_spread":0.22242844460874656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188393868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048492737,0.00031607278,0.9590866,0.0011448408,0.00029580537,0.00013109494,0.003998435,0.011546619,0.018631248],"genre_scores_gemma":[0.18909284,0.0013728858,0.74712247,0.0028485092,0.00052508974,0.0005708287,0.014997976,0.009751908,0.033717476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792236,0.0004842858,0.00027986217,0.00035921446,0.0007831821,0.00017111287],"domain_scores_gemma":[0.99451596,0.0024860417,0.00019173486,0.0017231816,0.00093812164,0.00014502184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028735935,0.00078237866,0.0007049832,0.0013879997,0.00073085463,0.0025634773,0.0018853634,0.00071223185,0.022505974],"category_scores_gemma":[0.012437459,0.0007211524,0.0017637333,0.0019596498,0.0011915165,0.0069295033,0.0038899619,0.0028948616,0.00905147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033928538,0.00016176548,0.0015670111,0.0009707687,0.00008875876,0.00025251208,0.0004386979,0.026882535,0.004272291,0.5664743,0.08643914,0.31211296],"study_design_scores_gemma":[0.00008410302,0.00008475748,0.00045603668,0.00019146352,0.00005108053,0.0002001679,0.00008636614,0.15337509,0.010425676,0.62218064,0.21280801,0.000056567416],"about_ca_topic_score_codex":0.0063300077,"about_ca_topic_score_gemma":0.0075827367,"teacher_disagreement_score":0.022505974,"about_ca_system_score_codex":0.0014301471,"about_ca_system_score_gemma":0.0022978648,"threshold_uncertainty_score":0.075289965},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0531885258814364,"score_gpt":0.2650689567026203,"score_spread":0.2118804308211839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234936942","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077277207,0.0039202464,0.0013379378,0.9705611,0.019238543,0.000036722446,0.00003242627,0.00007708796,0.0040232027],"genre_scores_gemma":[0.046851117,0.0036553578,0.002206304,0.91418785,0.015705358,0.00028524222,0.00003658915,0.00030001684,0.016772145],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97435975,0.017598813,0.00069269387,0.002579014,0.0034283933,0.0013413113],"domain_scores_gemma":[0.89397717,0.08312809,0.0033965146,0.0033789328,0.01034528,0.005774014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018530814,0.0012712404,0.0010991377,0.0016338277,0.016230753,0.00961623,0.006096559,0.03308673,0.012024672],"category_scores_gemma":[0.07397734,0.00071950693,0.0016447385,0.00084975525,0.030545289,0.01922112,0.011227291,0.04066465,0.00434878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005473537,0.000037442325,0.00019447484,0.00064716354,0.000035211535,0.0008515924,0.064395525,0.00010421904,0.00024248066,0.03107,0.88837427,0.013992984],"study_design_scores_gemma":[0.000021737214,0.000029025785,0.00014830682,0.000980988,0.000011936949,0.00043251074,0.020208398,0.00016924352,0.0001728904,0.010428033,0.967351,0.000045930432],"about_ca_topic_score_codex":0.015688393,"about_ca_topic_score_gemma":0.02792486,"teacher_disagreement_score":0.03308673,"about_ca_system_score_codex":0.010182083,"about_ca_system_score_gemma":0.011409493,"threshold_uncertainty_score":0.09800148},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16879239059271806,"score_gpt":0.26119074343866955,"score_spread":0.09239835284595149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388154056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060338527,0.00008168912,0.9365875,0.000075127966,0.000011724644,0.0001674479,0.0006122344,0.001218719,0.0009068972],"genre_scores_gemma":[0.7874886,0.000103639235,0.20937435,0.000080110265,0.000020876198,0.00039385518,0.00198649,0.00016628148,0.00038585922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98303175,0.0045527173,0.0014067526,0.0019227478,0.008427252,0.00065885275],"domain_scores_gemma":[0.93625414,0.0422299,0.006584738,0.006310557,0.008039319,0.00058128947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983394,0.0012652924,0.0012569664,0.0046842587,0.0006653034,0.0037514037,0.0029878092,0.002069547,0.0011080138],"category_scores_gemma":[0.057447344,0.0009250574,0.0020937398,0.0026517715,0.0014886999,0.0048295823,0.0019047499,0.0018140044,0.00049625913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004012806,0.00047533103,0.022720732,0.00031548188,0.0003434057,0.0002643656,0.00034900854,0.8356722,0.011986946,0.024956223,0.0005123947,0.10200259],"study_design_scores_gemma":[0.000010466687,0.0000685574,0.0012223443,0.00001565755,0.000032966178,0.00004516228,0.00002509334,0.98479027,0.0048051123,0.00876691,0.00019500387,0.000022422502],"about_ca_topic_score_codex":0.009925561,"about_ca_topic_score_gemma":0.007410575,"teacher_disagreement_score":0.009925561,"about_ca_system_score_codex":0.0025291496,"about_ca_system_score_gemma":0.0027909307,"threshold_uncertainty_score":0.052007496},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02833699263932253,"score_gpt":0.2800358933909709,"score_spread":0.25169890075164836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389989770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012757953,0.0009562116,0.98749614,0.0021482592,0.0000875109,0.00014704234,0.00014914939,0.0005368044,0.007203062],"genre_scores_gemma":[0.091865905,0.0023571972,0.89719105,0.0014501803,0.0004910065,0.0009972154,0.0006850013,0.0005267527,0.004435726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9491689,0.020078387,0.00501806,0.012375257,0.011619714,0.0017396591],"domain_scores_gemma":[0.8847049,0.08010498,0.0041603083,0.02245845,0.0074536065,0.0011177313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03522725,0.0021709143,0.002674453,0.0064557255,0.0037068333,0.015296676,0.0071553867,0.0063688825,0.008507424],"category_scores_gemma":[0.098422535,0.0028842608,0.0054850276,0.006773642,0.023000117,0.01894177,0.0093934955,0.011470766,0.0051518823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026501397,0.000039151848,0.00047920443,0.00033039684,0.000030161786,0.00009263729,0.00047248718,0.00649332,0.00023339418,0.96628803,0.001252238,0.024262577],"study_design_scores_gemma":[0.000024152108,0.000015089203,0.00008854085,0.00022695115,0.000014339376,0.00012096479,0.000065125925,0.024845378,0.0008127057,0.9563211,0.017437711,0.000027920245],"about_ca_topic_score_codex":0.006437626,"about_ca_topic_score_gemma":0.0019769112,"teacher_disagreement_score":0.03522725,"about_ca_system_score_codex":0.006843619,"about_ca_system_score_gemma":0.0078124544,"threshold_uncertainty_score":0.18630177},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.23930306441577254,"score_gpt":0.5279758031200584,"score_spread":0.2886727387042859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402217170","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004520162,0.0022656554,0.18087095,0.002884552,0.0012694995,0.0012772448,0.24347286,0.5481972,0.015241824],"genre_scores_gemma":[0.08438126,0.005212956,0.50800896,0.0032154843,0.0014063644,0.006525134,0.25829428,0.10801265,0.024942886],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971501,0.00090667326,0.0005577537,0.00041910174,0.0007447061,0.00022161403],"domain_scores_gemma":[0.9734797,0.01780646,0.0022462776,0.0026447095,0.0019255833,0.0018973541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064895237,0.0021774897,0.0018365259,0.008454304,0.00072842307,0.0062673152,0.0028389264,0.0015522061,0.14141767],"category_scores_gemma":[0.03485935,0.0012333216,0.0026996713,0.005373144,0.0005675902,0.0025838679,0.0035512587,0.0031130735,0.036433302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025169693,0.0003847209,0.003929059,0.0064886683,0.0012535842,0.00058067864,0.0008852451,0.007621831,0.005309779,0.022209402,0.7507088,0.19811128],"study_design_scores_gemma":[0.002573616,0.0003889049,0.0060654855,0.0018275048,0.00082603213,0.00079956703,0.00024337998,0.07768751,0.012723847,0.08612073,0.81022495,0.00051844865],"about_ca_topic_score_codex":0.004445441,"about_ca_topic_score_gemma":0.0070893797,"teacher_disagreement_score":0.14141767,"about_ca_system_score_codex":0.0014894245,"about_ca_system_score_gemma":0.0059623094,"threshold_uncertainty_score":0.47308922},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.4319128260972868,"score_gpt":0.47713784578125534,"score_spread":0.045225019683968526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402898151","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4089218,0.2644023,0.15921085,0.021239622,0.001244673,0.005716439,0.029760333,0.008961598,0.10054245],"genre_scores_gemma":[0.62993306,0.17420807,0.13936244,0.004572374,0.00063256576,0.0022101533,0.040444203,0.001238525,0.0073985937],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9803728,0.0068332125,0.0023730653,0.0022824386,0.007389127,0.0007494502],"domain_scores_gemma":[0.8812131,0.07062358,0.0054689203,0.013527876,0.026854841,0.0023115408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024325911,0.0007034467,0.0010172572,0.008929013,0.0017807633,0.005276291,0.003119546,0.0009976042,0.0057779863],"category_scores_gemma":[0.06229267,0.00084043114,0.0011433265,0.025462897,0.0021141183,0.016224952,0.0027685105,0.0017537595,0.0016114272],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012942891,0.0013865127,0.06040701,0.013000318,0.00040429126,0.00015039167,0.0026239117,0.0030824735,0.0050958744,0.029222582,0.059825815,0.8235066],"study_design_scores_gemma":[0.00031512915,0.0035753467,0.07353875,0.0076500294,0.00082907145,0.0014654153,0.01302443,0.01833558,0.029217247,0.008969134,0.84271604,0.0003639748],"about_ca_topic_score_codex":0.008941846,"about_ca_topic_score_gemma":0.007000997,"teacher_disagreement_score":0.024325911,"about_ca_system_score_codex":0.0033815582,"about_ca_system_score_gemma":0.005379243,"threshold_uncertainty_score":0.12864923},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030239839670588683,"score_gpt":0.24362238565523436,"score_spread":0.21338254598464568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403471969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024642171,0.00083787733,0.96085894,0.0016867771,0.00016076263,0.00029545405,0.0007643226,0.005605658,0.00514792],"genre_scores_gemma":[0.33734977,0.00084419467,0.6485621,0.0011134087,0.0003206528,0.0006106692,0.0026991877,0.0045890715,0.00391099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9728175,0.007940743,0.0027008338,0.0035427185,0.010817629,0.0021807132],"domain_scores_gemma":[0.92740273,0.050207183,0.0028866224,0.012352974,0.006096511,0.0010539605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015444594,0.0025059066,0.0026860111,0.004193726,0.0026038191,0.009304522,0.003985394,0.003979808,0.009127742],"category_scores_gemma":[0.07115862,0.0014734567,0.004158119,0.005384861,0.0063707624,0.032870848,0.010081017,0.006178158,0.0028523607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009957505,0.00038193047,0.0048374883,0.001468016,0.00022916246,0.0014576743,0.0053053237,0.08268508,0.013335695,0.7149393,0.015024835,0.1593398],"study_design_scores_gemma":[0.00009708264,0.00018401607,0.00044136684,0.00019618153,0.00013744994,0.0005900834,0.00093607797,0.21719109,0.015886433,0.7429671,0.021241358,0.00013165052],"about_ca_topic_score_codex":0.0050832797,"about_ca_topic_score_gemma":0.0033687477,"teacher_disagreement_score":0.015444594,"about_ca_system_score_codex":0.0038415964,"about_ca_system_score_gemma":0.0034690155,"threshold_uncertainty_score":0.08167976},"labels":[],"label_agreement":null}]}