{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":20,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":20,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"8458b7f752df","filters":{"venue":"Distributed and Parallel Databases"}},"results":[{"id":"W2078842512","doi":"10.1007/s10619-005-3296-1","title":"Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams","year":2005,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Computer science; Data cube; Data stream mining; Data stream; Data structure; Volume (thermodynamics); Online analytical processing; Computation; Stream processing; Data mining; Algorithm; Parallel computing; Data warehouse","authors":[{"name":"Jiawei Han","is_ca":false},{"name":"Yixin Chen","is_ca":false},{"name":"Guozhu Dong","is_ca":false},{"name":"Jian Pei","is_ca":true},{"name":"Benjamin W. Wah","is_ca":false},{"name":"Jianyong Wang","is_ca":false},{"name":"Yonghua Cai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1019794799530335,"gpt":0.3616370861324058,"spread":0.2596576061793723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416215,0.0008792945,0.001197318,0.001650781,0.0007687686,0.002640029,0.002882491,0.0007365436,0.006929668],"category_scores_gemma":[0.003274651,0.0006357793,0.0008463705,0.003502876,0.000649701,0.002789508,0.002178707,0.001430221,0.002572368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007778517,"about_ca_system_score_gemma":0.002226165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005413161,"about_ca_topic_score_gemma":0.004793311,"domain_scores_codex":[0.9991358,0.0001493765,0.00009149202,0.0001181457,0.0004250769,0.00008014939],"domain_scores_gemma":[0.9981917,0.0004648254,0.00007923576,0.0004784862,0.0006161162,0.0001696427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003534649,0.0004562729,0.006702319,0.000945957,0.0006750419,0.0007056603,0.0008050214,0.05700444,0.04265647,0.05215815,0.1454743,0.6888818],"study_design_scores_gemma":[0.000312147,0.0003500751,0.001276444,0.0001058635,0.0003037711,0.0005064694,0.0002128893,0.8270568,0.04970467,0.06654923,0.05347073,0.0001510083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01080861,0.0006717095,0.9556461,0.0004456774,0.0001952305,0.0001867021,0.001370755,0.02829397,0.002381292],"genre_scores_gemma":[0.1615884,0.002251177,0.8191268,0.0006958062,0.0002826515,0.0006530093,0.006528421,0.001796905,0.007076782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929668,"threshold_uncertainty_score":0.02318203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135133299","doi":"10.1023/b:dapd.0000018572.20283.e0","title":"Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors","year":2004,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Dalhousie University","funders":"","keywords":"Computer science; Online analytical processing; Row; Parallel computing; Data cube; Speedup; Data warehouse; Data structure; Cube (algebra); Database; Data mining; Programming language; Mathematics","authors":[{"name":"Ying Chen","is_ca":true},{"name":"Frank Dehne","is_ca":true},{"name":"Todd Eavis","is_ca":true},{"name":"Andrew Rau‐Chaplin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05168987859294967,"gpt":0.2929623151742056,"spread":0.241272436581256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009755396,0.0005413232,0.001256119,0.001083339,0.001425049,0.002122683,0.003103815,0.0006657274,0.004803591],"category_scores_gemma":[0.002962913,0.0005584235,0.001103587,0.002461729,0.0009190377,0.003111911,0.004362983,0.001162332,0.001317866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007098239,"about_ca_system_score_gemma":0.001894591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004628518,"about_ca_topic_score_gemma":0.005662732,"domain_scores_codex":[0.9985838,0.0002618155,0.00009482989,0.0001902221,0.0005894506,0.0002798672],"domain_scores_gemma":[0.9974622,0.0004638605,0.00009571444,0.00123017,0.0005924018,0.0001556413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001936885,0.0004347858,0.004097954,0.0009201348,0.0002735665,0.0008805731,0.0008853112,0.2039465,0.03706531,0.07864568,0.05212998,0.6187833],"study_design_scores_gemma":[0.0002289852,0.0002527768,0.001054227,0.00006448712,0.0001172908,0.0004597613,0.0008296918,0.7878796,0.07214467,0.1083013,0.02857495,0.00009231224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09916873,0.0006871625,0.8755137,0.0006726076,0.0001985528,0.0002474642,0.001245091,0.01177455,0.01049201],"genre_scores_gemma":[0.4041112,0.0003021795,0.5849125,0.0001875427,0.00005345553,0.0003032589,0.003334221,0.0008084552,0.005987238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004803591,"threshold_uncertainty_score":0.01606965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991438431","doi":"10.1007/s10619-006-6575-6","title":"The cgmCUBE project: Optimizing parallel data cube generation for ROLAP","year":2006,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Concordia University; Carleton University","funders":"","keywords":"Online analytical processing; Computer science; Data cube; Data warehouse; Cube (algebra); Very large database; Database; Data structure; Data mining; Programming language","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Todd Eavis","is_ca":true},{"name":"Andrew Rau‐Chaplin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07826883404703516,"gpt":0.3108956587794033,"spread":0.2326268247323682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192185,0.002439539,0.001785663,0.001443421,0.001292467,0.002170091,0.004148682,0.00130926,0.0138795],"category_scores_gemma":[0.00558696,0.0009932668,0.001476945,0.002944676,0.001189568,0.002750401,0.002956788,0.002202227,0.003642342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001880228,"about_ca_system_score_gemma":0.004020597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02734416,"about_ca_topic_score_gemma":0.02339192,"domain_scores_codex":[0.9978184,0.0005991581,0.00009332442,0.0003381992,0.0008870298,0.0002638531],"domain_scores_gemma":[0.9974223,0.0006357193,0.00007392431,0.0008180538,0.000834422,0.0002154405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002657182,0.0008101522,0.002417006,0.0007650937,0.000448304,0.0003266011,0.0004288127,0.1635914,0.01839018,0.01820965,0.3368922,0.4550634],"study_design_scores_gemma":[0.001088609,0.0002558173,0.0006389589,0.00003160577,0.0001147815,0.00009585804,0.0001799702,0.9315574,0.02617434,0.01344047,0.02634805,0.00007417494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245226,0.002088694,0.6503084,0.002492797,0.001159609,0.001077953,0.01256281,0.1819978,0.02378939],"genre_scores_gemma":[0.1759534,0.0005217138,0.7820124,0.0004774028,0.000147177,0.0008341467,0.02094908,0.01072117,0.008383492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02734416,"threshold_uncertainty_score":0.05436999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070626055","doi":"10.1007/s10619-005-4257-4","title":"Preventive Replication in a Database Cluster","year":2005,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Replica; Computer science; Replication (statistics); Database transaction; Benchmark (surveying); Distributed database; Database; Throughput; Cluster (spacecraft); Consistency (knowledge bases); Data consistency; Distributed computing; Parallel computing; Computer network; Operating system; Mathematics; Artificial intelligence; Geography","authors":[{"name":"Esther Pacitti","is_ca":false},{"name":"Cédric Coulon","is_ca":false},{"name":"Patrick Valduriez","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02299226027484804,"gpt":0.2855527655536087,"spread":0.2625605052787607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253556,0.0003411734,0.000983835,0.0009174201,0.002352735,0.002220259,0.002826814,0.001030862,0.001878176],"category_scores_gemma":[0.006117551,0.0006690131,0.0003587513,0.001592368,0.001040887,0.001751278,0.001996977,0.0009913741,0.000552555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138452,"about_ca_system_score_gemma":0.002497375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004488875,"about_ca_topic_score_gemma":0.003659179,"domain_scores_codex":[0.9982721,0.0003643227,0.0001069399,0.0003425837,0.0006448559,0.0002691964],"domain_scores_gemma":[0.9928476,0.001343451,0.000432802,0.003281719,0.001325478,0.0007689146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005734737,0.00147403,0.02923372,0.0004988849,0.0002972833,0.002086432,0.002092231,0.4561655,0.09211212,0.1389447,0.02320069,0.2481597],"study_design_scores_gemma":[0.00026972,0.0003686012,0.002269906,0.00001175475,0.0001244562,0.0003905015,0.0003424564,0.9494249,0.0135465,0.02662893,0.006571535,0.00005081565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.665119,0.00109021,0.3153157,0.001554862,0.000402871,0.0002075582,0.0001728176,0.0071416,0.008995437],"genre_scores_gemma":[0.948738,0.0001338045,0.04748455,0.00006507943,0.00006731319,0.0000581304,0.0001033999,0.000101115,0.00324856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004488875,"threshold_uncertainty_score":0.01191813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047284331","doi":"10.1007/s10619-007-7018-8","title":"Adaptive processing of historical spatial range queries in peer-to-peer sensor networks","year":2007,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Computer science; Query optimization; Flooding (psychology); Spatial query; Online aggregation; Data mining; Distributed computing; Query expansion; Energy consumption; Web search query; Web query classification; Information retrieval; Search engine","authors":[{"name":"Alexandru Coman","is_ca":true},{"name":"Jörg Sander","is_ca":true},{"name":"Mário A. Nascimento","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02688580865150308,"gpt":0.2612479438544393,"spread":0.2343621352029363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002225367,0.0006350565,0.001923675,0.001115089,0.001054088,0.001443609,0.002606875,0.001061338,0.0007990592],"category_scores_gemma":[0.01129226,0.0006697451,0.0003193388,0.001658902,0.0008588315,0.002906232,0.001530102,0.0008961828,0.0002763952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006041917,"about_ca_system_score_gemma":0.0006477019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002657074,"about_ca_topic_score_gemma":0.003211013,"domain_scores_codex":[0.9978989,0.0003469838,0.0001923474,0.000453234,0.0009441255,0.0001643572],"domain_scores_gemma":[0.9947882,0.002754919,0.0004582687,0.00081637,0.0009674601,0.0002148213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001228724,0.0004172585,0.007201171,0.0002888331,0.0001791493,0.0005954598,0.0009289007,0.5722309,0.04508059,0.01079109,0.004588774,0.3564691],"study_design_scores_gemma":[0.00002391073,0.0001078538,0.001045294,0.000006242195,0.00003498865,0.0002058927,0.0001603664,0.9850552,0.005878828,0.006501196,0.0009629765,0.00001721191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1779164,0.001801513,0.8164073,0.0005285833,0.0002767075,0.0001260183,0.0001517179,0.001242988,0.001548804],"genre_scores_gemma":[0.929632,0.0005295259,0.06772701,0.0001086142,0.0001957186,0.00007674369,0.000238646,0.00009447146,0.001397364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002657074,"threshold_uncertainty_score":0.011769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133443743","doi":"10.1007/s10619-007-7023-y","title":"PnP: sequential, external memory, and parallel iceberg cube computation","year":2008,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Concordia University; Carleton University","funders":"","keywords":"Computer science; Speedup; Cube (algebra); Scalability; Iceberg; Auxiliary memory; Data cube; Computation; Parallel computing; Pruning; Data structure; Algorithm; Data mining; Mathematics; Computer hardware; Database; Operating system; Geology; Combinatorics","authors":[{"name":"Ying Chen","is_ca":false},{"name":"Frank Dehne","is_ca":true},{"name":"Todd Eavis","is_ca":true},{"name":"Andrew Rau‐Chaplin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04727396136730296,"gpt":0.2760956854569131,"spread":0.2288217240896101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008272703,0.0005144625,0.0007908778,0.0006219996,0.001002523,0.001935452,0.00179791,0.000610955,0.004949782],"category_scores_gemma":[0.003623422,0.0003409097,0.0004900451,0.001671736,0.001154411,0.003058064,0.002867545,0.001454125,0.001219265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008661708,"about_ca_system_score_gemma":0.0017616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004235883,"about_ca_topic_score_gemma":0.004593996,"domain_scores_codex":[0.9994141,0.0001250216,0.00002928832,0.00009213549,0.000252494,0.00008705304],"domain_scores_gemma":[0.9990388,0.0002573513,0.00004377695,0.0003360193,0.0002408927,0.00008302947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006380114,0.0001171478,0.001616175,0.0002185739,0.00005553354,0.0001899542,0.0001839041,0.2034124,0.00277407,0.5000144,0.05288073,0.2378991],"study_design_scores_gemma":[0.00004706594,0.00002976144,0.0002156596,0.00001525133,0.00001490934,0.00008510893,0.00003935875,0.6142029,0.002365757,0.3686486,0.01432226,0.00001320123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02732353,0.0008679874,0.9457042,0.001199621,0.0004532706,0.00009460955,0.0006018129,0.002860861,0.02089417],"genre_scores_gemma":[0.4347485,0.001318258,0.5418556,0.0004753692,0.0004100715,0.0003111874,0.001601317,0.0006786659,0.01860106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004949782,"threshold_uncertainty_score":0.01655865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072466548","doi":"10.1007/s10619-006-6284-1","title":"Incremental click-stream tree model: Learning from new users for web page prediction","year":2006,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Clickstream; Tree (set theory); Web log analysis software; Data mining; Process (computing); Online model; Web server; Recommender system; Data stream; Web page; Document Object Model; Machine learning; Database; World Wide Web; Information retrieval; Static web page; The Internet; Web API","authors":[{"name":"Şule Gündüz Öğüdücü","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04072467428157771,"gpt":0.262250113213566,"spread":0.2215254389319883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00274288,0.001008667,0.002957187,0.002593286,0.0006037623,0.001113729,0.004143463,0.002166959,0.002362179],"category_scores_gemma":[0.007665153,0.0006919852,0.001000067,0.003671129,0.0005264181,0.002625938,0.0008054379,0.002020273,0.001492308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008006117,"about_ca_system_score_gemma":0.001353775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01667016,"about_ca_topic_score_gemma":0.0284021,"domain_scores_codex":[0.9992031,0.0002239506,0.00005954769,0.0002071971,0.0002204157,0.00008579579],"domain_scores_gemma":[0.9951085,0.003034913,0.000251095,0.0005778223,0.000774323,0.0002533389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001263489,0.001441681,0.01745861,0.0003075518,0.0003855963,0.0001635407,0.0001875563,0.5003929,0.002753373,0.01007939,0.01615993,0.4494064],"study_design_scores_gemma":[0.0000130086,0.00002630717,0.0002902248,0.000003272115,0.00002116138,0.00001405063,0.000003514956,0.9973558,0.0001785372,0.00191845,0.000170706,0.000005020778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1143959,0.001944404,0.8758866,0.0009805956,0.0002693188,0.0002415325,0.00195518,0.002865489,0.001461014],"genre_scores_gemma":[0.8052143,0.001216091,0.182724,0.0003134787,0.0004860845,0.0003607777,0.002835734,0.000139058,0.006710448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01667016,"threshold_uncertainty_score":0.03314626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016326061","doi":"10.1023/b:dapd.0000013069.97679.62","title":"An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems","year":2004,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Cache; Robustness (evolution); Architecture; Data management; Database; Computer network","authors":[{"name":"Kaladhar Voruganti","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Ronald C. Unrau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09128449405044331,"gpt":0.3214471853140355,"spread":0.2301626912635922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342277,0.0006612741,0.0007916191,0.000948699,0.001333092,0.002150123,0.005543297,0.00107435,0.003746497],"category_scores_gemma":[0.002893007,0.0007766071,0.0004470207,0.001692726,0.0009025387,0.00247484,0.002089574,0.001753068,0.001162846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001680147,"about_ca_system_score_gemma":0.001935883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009625981,"about_ca_topic_score_gemma":0.009864124,"domain_scores_codex":[0.9990877,0.0001591205,0.00009090256,0.0001445844,0.000370866,0.0001468957],"domain_scores_gemma":[0.9970958,0.0003160138,0.0001247888,0.001473435,0.000719919,0.000270017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003373483,0.001302314,0.01184556,0.000403205,0.0003231022,0.0007486968,0.001087937,0.1079361,0.1239492,0.04652232,0.05546553,0.6470426],"study_design_scores_gemma":[0.0001576239,0.0002175635,0.001528961,0.00001908576,0.00013701,0.0002197417,0.00009727926,0.9406896,0.03335939,0.0100779,0.01342045,0.00007540141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1336471,0.0009117297,0.8096563,0.0007026242,0.0002857309,0.0004585639,0.0003254289,0.04567545,0.008336972],"genre_scores_gemma":[0.6057423,0.0004010466,0.3788344,0.0004360614,0.0001337911,0.0002734466,0.0009158886,0.001079427,0.01218359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009625981,"threshold_uncertainty_score":0.01913989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126220026","doi":"10.1007/s10619-009-7043-x","title":"Continuously monitoring top-k uncertain data streams: a probabilistic threshold method","year":2009,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Data stream mining; Computer science; Probabilistic logic; Uncertain data; Quantile; Data mining; Data structure; Algorithm; Artificial intelligence; Mathematics; Statistics","authors":[{"name":"Hua Ming","is_ca":true},{"name":"Jian Pei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07410263996446681,"gpt":0.337478297433059,"spread":0.2633756574685922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00383308,0.0009202566,0.002570082,0.001678552,0.0008430126,0.0027603,0.004254419,0.0017054,0.00165694],"category_scores_gemma":[0.01366929,0.0008094512,0.001399651,0.002856348,0.001310472,0.004960094,0.002616903,0.002453141,0.0003946999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397266,"about_ca_system_score_gemma":0.001798681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004051661,"about_ca_topic_score_gemma":0.002489069,"domain_scores_codex":[0.9968671,0.0005829437,0.0002857062,0.0008765584,0.001115498,0.0002721398],"domain_scores_gemma":[0.9928019,0.0044576,0.0005676,0.0008552819,0.001031507,0.0002860301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000903664,0.0001925173,0.00412098,0.0003257888,0.0003583829,0.0001636582,0.0002457227,0.5255739,0.01073519,0.04419809,0.002801724,0.4103804],"study_design_scores_gemma":[0.00001078582,0.00002475268,0.0001533815,0.000005665315,0.000029942,0.00003307959,0.00001058953,0.9884921,0.001061484,0.009845556,0.0003223778,0.00001018825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003978627,0.0001740627,0.9952342,0.0000863295,0.00002825881,0.00001915259,0.0000297535,0.0002105832,0.000239052],"genre_scores_gemma":[0.4719142,0.00061205,0.524624,0.0001823775,0.0002829063,0.0001556315,0.0002432449,0.0001915123,0.001794154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004254419,"threshold_uncertainty_score":0.02027154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W139568493","doi":"10.1023/a:1019258807615","title":"A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems","year":2001,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Overhead (engineering); Scheme (mathematics); Mathematical optimization; Optimization algorithm; Mathematics","authors":[{"name":"Ken Barker","is_ca":true},{"name":"Subhrajyoti Bhar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02504905354678096,"gpt":0.2473326446568651,"spread":0.2222835911100841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432517,0.000799084,0.0006992935,0.001383201,0.001086479,0.003273319,0.004031214,0.001366342,0.01118852],"category_scores_gemma":[0.004280206,0.0008957552,0.001192115,0.001573583,0.001817485,0.003619215,0.002444275,0.001803018,0.001788042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009799014,"about_ca_system_score_gemma":0.0009788806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004588507,"about_ca_topic_score_gemma":0.009088657,"domain_scores_codex":[0.9988055,0.0003875619,0.00008932815,0.0001601942,0.0004130945,0.0001443417],"domain_scores_gemma":[0.9981844,0.0006767398,0.000107263,0.0006432876,0.000248837,0.0001395691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008693324,0.0002599783,0.001063495,0.0005171138,0.0001175873,0.0004139401,0.000828817,0.1368856,0.02862717,0.4060226,0.01289436,0.4115],"study_design_scores_gemma":[0.0002281204,0.0001935822,0.0003723634,0.0001090304,0.0001934637,0.0003911131,0.0001896545,0.7390787,0.0317519,0.1782856,0.04911197,0.00009458658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002493567,0.00007578188,0.9933764,0.0001269259,0.00002463337,0.00004145477,0.00003834272,0.002349942,0.001472882],"genre_scores_gemma":[0.1022616,0.0002534956,0.8916407,0.0001738006,0.0000426594,0.0001629728,0.0001488664,0.0006202619,0.004695639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01118852,"threshold_uncertainty_score":0.03742939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2299020861","doi":"10.1007/s10619-017-7196-y","title":"TAPER: query-aware, partition-enhancement for large, heterogenous graphs","year":2017,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Newcastle University","keywords":"Computer science; Graph partition; Scalability; Partition (number theory); Workload; Space partitioning; Hash function; Parallel computing; USable; Theoretical computer science; Graph; Algorithm; Database; Mathematics","authors":[{"name":"Hugo Firth","is_ca":false},{"name":"Paolo Missier","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03487313379500431,"gpt":0.29416619769974,"spread":0.2592930639047357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421695,0.001307118,0.0008472218,0.00128349,0.000851031,0.001502237,0.003104963,0.0007546573,0.003286439],"category_scores_gemma":[0.005790427,0.0006189782,0.001001679,0.001487969,0.0008986771,0.003459591,0.002888742,0.0009066815,0.001661609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009187161,"about_ca_system_score_gemma":0.001031014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006634488,"about_ca_topic_score_gemma":0.009993817,"domain_scores_codex":[0.9988043,0.0002936354,0.00006492279,0.0002554628,0.0004435759,0.0001382073],"domain_scores_gemma":[0.9960669,0.001248133,0.0002166316,0.001885661,0.0003893322,0.0001933747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002215709,0.0007030598,0.006097755,0.0009581133,0.0002790519,0.0005196759,0.001132143,0.2488513,0.1056313,0.01568331,0.07224961,0.545679],"study_design_scores_gemma":[0.0002901916,0.0005226019,0.002433427,0.00003155043,0.00006581465,0.0005055854,0.0004040955,0.9222855,0.04014053,0.0122803,0.02097129,0.00006902803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1602533,0.0013264,0.6742944,0.0007007426,0.0002220112,0.0006556988,0.002019888,0.1487029,0.01182476],"genre_scores_gemma":[0.4502732,0.0004713072,0.5340323,0.0003476655,0.000091445,0.0002564793,0.005056041,0.004598227,0.004873315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006634488,"threshold_uncertainty_score":0.0131917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080139625","doi":"10.1007/s10619-011-7085-8","title":"Scaling XML query processing: distribution, localization and pruning","year":2011,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Query optimization; XML database; Query plan; Sargable; Scalability; Query expansion; Query language; Information retrieval; Database; Data mining; XML; Web search query; Search engine; World Wide Web","authors":[{"name":"Patrick Kling","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Khuzaima Daudjee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04172179025022446,"gpt":0.2538881131957413,"spread":0.2121663229455169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004886839,0.001433198,0.002605663,0.003251117,0.001650663,0.003863652,0.004108101,0.001487231,0.003579527],"category_scores_gemma":[0.02865244,0.001202541,0.0009095823,0.005305444,0.001405149,0.006395849,0.00313172,0.002108851,0.001118012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002412351,"about_ca_system_score_gemma":0.003110147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009337986,"about_ca_topic_score_gemma":0.01207816,"domain_scores_codex":[0.9933683,0.001564364,0.0005570019,0.000995848,0.002838932,0.0006754935],"domain_scores_gemma":[0.9768324,0.01142814,0.001047199,0.006909888,0.003153691,0.000628538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001657823,0.001061685,0.0112992,0.0003837397,0.0001532935,0.0002339927,0.0006536415,0.1613299,0.02828935,0.02445721,0.0194799,0.7510003],"study_design_scores_gemma":[0.0001444332,0.0001394685,0.001972594,0.0000224551,0.00009167016,0.0002495499,0.000259651,0.9625918,0.01367619,0.01790041,0.002921816,0.00002996274],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2406487,0.00618151,0.7250597,0.002591463,0.0003949552,0.0003173503,0.000617764,0.01536189,0.008826747],"genre_scores_gemma":[0.6888909,0.001003198,0.3032074,0.000315289,0.0003268042,0.0002179364,0.001019228,0.001368518,0.003650859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009337986,"threshold_uncertainty_score":0.0258444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121550967","doi":"10.1007/s10619-006-0445-0","title":"Parallel Bifold: Large-scale parallel pattern mining with constraints","year":2006,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data mining; Set (abstract data type); Scale (ratio); Cluster (spacecraft); Space (punctuation); Geography","authors":[{"name":"Mohammad El-Hajj","is_ca":true},{"name":"Osmar R. Zai͏̈ane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01781232993566086,"gpt":0.2489065911592234,"spread":0.2310942612235625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961329,0.001719658,0.001644434,0.002001039,0.001206923,0.002410604,0.004040366,0.0007619838,0.01043526],"category_scores_gemma":[0.009506075,0.001092016,0.0009877778,0.0041488,0.0006855054,0.003422177,0.002425138,0.001767852,0.002687264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006957521,"about_ca_system_score_gemma":0.003569142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006471251,"about_ca_topic_score_gemma":0.0125147,"domain_scores_codex":[0.9986268,0.0002845115,0.000148975,0.0002706643,0.0005485757,0.000120481],"domain_scores_gemma":[0.9963195,0.001554281,0.0002048038,0.001027507,0.0006662662,0.000227577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002235325,0.0005070019,0.005232491,0.001237522,0.0003647309,0.000442023,0.000150209,0.09284389,0.0124797,0.02450405,0.09135471,0.7686483],"study_design_scores_gemma":[0.0004383981,0.0001251833,0.0006974468,0.00003568167,0.00008355484,0.0002540932,0.0000601481,0.9346517,0.01129904,0.03788812,0.01442516,0.00004152771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01946862,0.0008050703,0.9437988,0.0006642881,0.000196212,0.0004731791,0.003834532,0.02704843,0.003710785],"genre_scores_gemma":[0.1104248,0.0004044875,0.8775632,0.0002441078,0.00009568212,0.0006359614,0.006436954,0.001327077,0.00286771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01043526,"threshold_uncertainty_score":0.03490943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993755977","doi":"10.1007/s10619-010-7076-1","title":"Query processing in sensor networks","year":2010,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data structure; Programming language","authors":[{"name":"Erik Buchmann","is_ca":false},{"name":"Nesime Tatbul","is_ca":false},{"name":"Mário A. Nascimento","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01437154050121543,"gpt":0.2452749747759609,"spread":0.2309034342747455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003061294,0.0007395448,0.002094516,0.001092676,0.0009319538,0.003188719,0.002076805,0.001328679,0.002757179],"category_scores_gemma":[0.008178885,0.0006840996,0.000531226,0.00309953,0.001504625,0.005013625,0.001318874,0.001461454,0.0007369473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213154,"about_ca_system_score_gemma":0.001084057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003393274,"about_ca_topic_score_gemma":0.002190995,"domain_scores_codex":[0.9969796,0.0008021187,0.0002858237,0.0005147551,0.001218435,0.0001993123],"domain_scores_gemma":[0.9965293,0.002077899,0.0001874403,0.0005989973,0.0004829078,0.0001235151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007627958,0.0003243574,0.00185951,0.001091844,0.0002107934,0.000292973,0.0005293209,0.3513316,0.01206548,0.2368825,0.02403677,0.3706121],"study_design_scores_gemma":[0.00004527533,0.00006188062,0.0003659216,0.00002506152,0.0000511055,0.0001472805,0.0001081419,0.8583559,0.002600875,0.1271066,0.0111144,0.00001752097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02572653,0.01387688,0.9503101,0.00236983,0.0005461208,0.0001443989,0.0002310034,0.001100596,0.005694586],"genre_scores_gemma":[0.6907648,0.01143979,0.2785582,0.0006763541,0.001286075,0.0003831509,0.0009265335,0.0002956434,0.01566946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003393274,"threshold_uncertainty_score":0.01618987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406162498","doi":"10.1007/s10619-024-07452-6","title":"Indexing temporal relations for range-duration queries","year":2025,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Università degli Studi di Padova","keywords":"Search engine indexing; Computer science; Data structure; Range (aeronautics); Duration (music); Information retrieval; Data mining; Programming language","authors":[{"name":"Matteo Ceccarello","is_ca":false},{"name":"Anton Dignös","is_ca":false},{"name":"Johann Gamper","is_ca":false},{"name":"Christina Khnaisser","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02640828025020287,"gpt":0.2848948208440601,"spread":0.2584865405938572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002916074,0.001007759,0.001623389,0.002913419,0.00118407,0.004017375,0.002434154,0.001037443,0.003914461],"category_scores_gemma":[0.01822824,0.0005421446,0.0009431298,0.006167846,0.001092652,0.007940743,0.003415255,0.001616415,0.001588207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126843,"about_ca_system_score_gemma":0.00212199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003733999,"about_ca_topic_score_gemma":0.003590401,"domain_scores_codex":[0.9939992,0.0007638817,0.001040684,0.0008517045,0.002922687,0.0004217902],"domain_scores_gemma":[0.9857918,0.005154022,0.001484387,0.005004544,0.001945587,0.0006197222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00249878,0.001032905,0.02299724,0.001700107,0.0002827847,0.0009321966,0.002383182,0.1031982,0.07632829,0.1673952,0.06934532,0.5519058],"study_design_scores_gemma":[0.0002449497,0.000403966,0.003182613,0.0001670871,0.0001050384,0.0011306,0.0007263387,0.7711482,0.03179445,0.1137617,0.07720368,0.0001312678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08621635,0.003514922,0.8790755,0.000987962,0.00030921,0.0004990244,0.005232171,0.01514415,0.009020805],"genre_scores_gemma":[0.4081625,0.001367169,0.5749975,0.0003910061,0.0004503006,0.0004453617,0.01006355,0.001300513,0.002822063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004017375,"threshold_uncertainty_score":0.01542181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4287307637","doi":"10.1007/s10619-022-07415-9","title":"Scalable probabilistic truss decomposition using central limit theorem and H-index","year":2022,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Probabilistic logic; Computer science; Scalability; Algorithm; Discrete mathematics; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Structural engineering","authors":[{"name":"Fatemeh Esfahani","is_ca":true},{"name":"Mahsa Daneshmand","is_ca":true},{"name":"Venkatesh Srinivasan","is_ca":true},{"name":"Alex Thomo","is_ca":true},{"name":"Kui Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02352944767420543,"gpt":0.2592946132143147,"spread":0.2357651655401093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009613773,0.0006913165,0.001817696,0.001482626,0.0008380573,0.001635729,0.002209426,0.0009503908,0.005468805],"category_scores_gemma":[0.004161977,0.0006647219,0.0008892802,0.001936259,0.0008867917,0.003772615,0.002561056,0.001309898,0.001219343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028136,"about_ca_system_score_gemma":0.001383721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002829303,"about_ca_topic_score_gemma":0.004577346,"domain_scores_codex":[0.9991653,0.0001624207,0.00004071003,0.0001586371,0.0003784722,0.00009438367],"domain_scores_gemma":[0.9979762,0.0006090135,0.000176464,0.0006898076,0.0004135817,0.0001349759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003462147,0.0002368663,0.000809358,0.0001888717,0.0001128137,0.0001170723,0.00013954,0.5953601,0.009983049,0.1492242,0.01234356,0.2311384],"study_design_scores_gemma":[0.00001181578,0.00001675138,0.00006068347,0.000003713433,0.000007244704,0.00002368487,0.00001213093,0.9549565,0.0008092101,0.04336919,0.0007224414,0.000006628179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01166922,0.0001551098,0.9841917,0.0001177231,0.0000381227,0.00004259247,0.0001202022,0.0008191321,0.00284627],"genre_scores_gemma":[0.3831856,0.0002768739,0.6091279,0.0001425997,0.0001032252,0.0001846016,0.0006213535,0.0004434684,0.005914432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005468805,"threshold_uncertainty_score":0.01829499,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4405880184","doi":"10.1007/s10619-024-07450-8","title":"Infomod: information-theoretic machine learning model diagnostics","year":2024,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Automatic summarization; Computer science; SPARK (programming language); Debugging; Process (computing); Machine learning; Artificial intelligence; Ranging; Test data; Data mining; Programming language","authors":[{"name":"Armin Esmaelizadeh","is_ca":false},{"name":"Sunil Cotterill","is_ca":true},{"name":"Liam Hebert","is_ca":true},{"name":"Lukasz Golab","is_ca":true},{"name":"Kazem Taghva","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01595322642870192,"gpt":0.2595854938904334,"spread":0.2436322674617315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005138495,0.001418697,0.001363683,0.002081189,0.0005566264,0.00273288,0.002836804,0.001963186,0.01240654],"category_scores_gemma":[0.02993492,0.0008719405,0.001706366,0.0008952031,0.001228538,0.003338355,0.003251799,0.003248174,0.003271794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093608,"about_ca_system_score_gemma":0.002290945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001317453,"about_ca_topic_score_gemma":0.001223194,"domain_scores_codex":[0.9972691,0.001152565,0.0001421111,0.0003800189,0.0009345331,0.0001216435],"domain_scores_gemma":[0.9890215,0.00745992,0.0006270899,0.001892858,0.0008359735,0.0001627675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007947109,0.0003470592,0.003478945,0.0004906884,0.0003869615,0.0004387731,0.00008515013,0.5007887,0.003502041,0.1846364,0.04187145,0.2631791],"study_design_scores_gemma":[0.00002349188,0.00003391631,0.0001297536,0.00001624272,0.00001533261,0.00006687093,0.000006629534,0.9305277,0.002308945,0.0649524,0.00190691,0.00001181364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004871241,0.0002806037,0.9821751,0.0007284019,0.00009510927,0.00008129604,0.001102216,0.008340497,0.002325528],"genre_scores_gemma":[0.4078665,0.0006090464,0.5774255,0.0009063344,0.0003541858,0.0005318095,0.003752094,0.003021488,0.005533024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01240654,"threshold_uncertainty_score":0.04150397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088726914","doi":"10.1007/s10619-020-07313-y","title":"Introduction to the special issue on Self-managing and Hardware-Optimized Database Systems 2019","year":2020,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo; University of California, Davis; Institute of Computing Technology, Chinese Academy of Sciences; University of Pittsburgh; Chinese Academy of Sciences; Oracle","keywords":"Computer science; Database; Data structure; Computer architecture; Operating system","authors":[{"name":"Shimin Chen","is_ca":false},{"name":"Panos K. Chrysanthis","is_ca":false},{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Meichun Hsu","is_ca":false},{"name":"Mohammad Sadoghi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01679472336439665,"gpt":0.2350329024298379,"spread":0.2182381790654413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245995,0.001673826,0.00184699,0.003307922,0.001148812,0.006399772,0.002056568,0.003169115,0.05384265],"category_scores_gemma":[0.006667159,0.000858532,0.001149322,0.003855851,0.001135142,0.006367992,0.002142086,0.006295943,0.02956954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660497,"about_ca_system_score_gemma":0.001581936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009519695,"about_ca_topic_score_gemma":0.002144462,"domain_scores_codex":[0.9978533,0.0002589503,0.0002410407,0.0004353919,0.001033627,0.0001776904],"domain_scores_gemma":[0.9937583,0.002111266,0.0003005687,0.0004868184,0.002476268,0.0008667824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002681322,0.00004150885,0.0001045932,0.000382126,0.00001684473,0.00006377581,0.00001446594,0.0002614761,0.0004145717,0.004654082,0.9303562,0.0636635],"study_design_scores_gemma":[0.000005836775,0.00003077943,0.0002118047,0.0001831311,0.00001104872,0.0002170689,0.00001168866,0.0004155105,0.0001668062,0.003304011,0.9954276,0.00001464886],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0005575067,0.1590605,0.01958442,0.04278738,0.7325895,0.0001038484,0.0006221026,0.0005268244,0.04416788],"genre_scores_gemma":[0.003116623,0.1006288,0.005694346,0.01551373,0.7642946,0.00006804812,0.001115954,0.0006768332,0.1088912],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.05384265,"threshold_uncertainty_score":0.1801216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7117103606","doi":"10.1007/s10619-025-07455-x","title":"Revisiting shared registers and leaderless consensus in WAN environments","year":2025,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Latency (audio); Throughput; Overhead (engineering); Protocol (science); Process (computing); Communications protocol; Distributed database","authors":[{"name":"Hao Tan","is_ca":true},{"name":"Wojciech Golab","is_ca":true},{"name":"Vivek Alamuri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0292263341903795,"gpt":0.2739984755017218,"spread":0.2447721413113423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005032595,0.0005198108,0.0009316981,0.0008503266,0.001775817,0.003695375,0.003186512,0.001846361,0.004867916],"category_scores_gemma":[0.01945367,0.0005725267,0.0006594996,0.001407889,0.003525713,0.01605428,0.003926725,0.003339825,0.001014054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001196941,"about_ca_system_score_gemma":0.001920239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191395,"about_ca_topic_score_gemma":0.003708448,"domain_scores_codex":[0.9976089,0.0009834323,0.0001216184,0.0003996225,0.0005559567,0.0003303524],"domain_scores_gemma":[0.9889688,0.006286412,0.0003280915,0.002800759,0.001349025,0.0002668202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003806457,0.00009140014,0.0009647949,0.0002445801,0.0000409106,0.0002423869,0.001029404,0.06264488,0.002230282,0.825875,0.005349878,0.1009059],"study_design_scores_gemma":[0.00006976415,0.0001076047,0.000222633,0.00008318076,0.00005711425,0.00007263546,0.0005185762,0.2152239,0.003126138,0.7542859,0.02619576,0.00003662724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07197771,0.004245915,0.8789523,0.007004914,0.001306375,0.00009089119,0.0001126239,0.0008500451,0.03545916],"genre_scores_gemma":[0.8651022,0.003205983,0.1087186,0.0009429807,0.001049836,0.0001062994,0.0001520228,0.0005842589,0.02013782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005032595,"threshold_uncertainty_score":0.02661526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008361063","doi":"10.1007/s10619-009-7052-9","title":"Guest editorial: special issue on ranking in databases","year":2009,"lang":"en","type":"editorial","venue":"Distributed and Parallel Databases","topic":"Web visibility and informetrics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ranking (information retrieval); Database; Information retrieval; Data science","authors":[{"name":"Ihab F. Ilyas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02412881930191082,"gpt":0.2946601032873167,"spread":0.2705312839854059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009578465,0.003930987,0.005263485,0.007115558,0.002845708,0.01009806,0.003855657,0.01424026,0.02124336],"category_scores_gemma":[0.0301631,0.001480655,0.002614002,0.003082587,0.002254987,0.004862401,0.001786167,0.01511224,0.0131181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0032446,"about_ca_system_score_gemma":0.002647817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257976,"about_ca_topic_score_gemma":0.00449617,"domain_scores_codex":[0.9929036,0.001215162,0.0009667571,0.0008413654,0.003606891,0.0004661938],"domain_scores_gemma":[0.9702837,0.009283311,0.002075325,0.0009108218,0.0141162,0.003330718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002134147,0.000008595854,0.00001769257,0.0001196491,0.00001635688,0.00006375794,0.000003382871,0.00001835701,0.00003722999,0.0002479039,0.996124,0.00332176],"study_design_scores_gemma":[0.00006864019,0.00002891918,0.0002731734,0.0002776499,0.00007672959,0.000306491,0.00002211212,0.0003061373,0.0001739532,0.001376419,0.9970694,0.00002040373],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00003024686,0.004496959,0.0002424483,0.02619938,0.9674503,0.00001411171,0.00006241867,0.00006217431,0.001441909],"genre_scores_gemma":[0.0004340225,0.003241747,0.0001900933,0.00884772,0.9780062,0.00001502055,0.0000477379,0.00005831681,0.009159151],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02124336,"threshold_uncertainty_score":0.07106614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}