{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988997,0.0002215685,0.000386401,0.0002208216,0.0001256974,0.00008041713,0.001576912,0.00005266347,0.00001706631],"category_scores_gemma":[0.0001325731,0.0001912545,0.00007159979,0.0005874456,0.0001081581,0.001247656,0.0009794796,0.00009897045,0.000001226999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001229822,"about_ca_system_score_gemma":0.0000593102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003020335,"about_ca_topic_score_gemma":0.001030182,"domain_scores_codex":[0.9982651,0.00006358415,0.0003489541,0.0007975914,0.000230011,0.0002946959],"domain_scores_gemma":[0.9970852,0.0002532401,0.0001717594,0.002234048,0.00009580702,0.0001599799],"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.0002946364,0.003259085,0.0256718,0.0001491125,0.002680881,0.0000338477,0.0004732824,0.01004978,0.001669161,0.04151941,0.07079311,0.8434059],"study_design_scores_gemma":[0.0008478487,0.0001761114,0.009802936,0.00004310677,0.0005436765,0.00001252793,0.00004427719,0.9455583,0.001407113,0.0001586681,0.04097816,0.0004272684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03369131,0.00023517,0.8506371,0.000222375,0.00001939239,0.000197815,0.1148118,0.0001779674,0.000007082804],"genre_scores_gemma":[0.1482135,0.00004034166,0.7219681,0.00008972347,0.00003703253,0.000020206,0.1296145,0.000008435046,0.000008220772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9355085,"threshold_uncertainty_score":0.7799131,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002294167,0.0003253179,0.0003264497,0.00008785153,0.0004876997,0.0001509865,0.0007697438,0.00006350089,0.00001555577],"category_scores_gemma":[0.0002529086,0.0002832254,0.00004053681,0.0003258585,0.000159879,0.003194784,0.0008621407,0.0002397414,0.00005118268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003970029,"about_ca_system_score_gemma":0.0001024177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004202534,"about_ca_topic_score_gemma":0.0001063487,"domain_scores_codex":[0.9977424,0.00005043742,0.0003985777,0.001013428,0.0003461994,0.000448983],"domain_scores_gemma":[0.9976429,0.0001372005,0.0001956753,0.001734138,0.00008038346,0.0002096802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001913626,0.0003227343,0.002430668,0.0002283937,0.0001114629,0.0002237804,0.0007712019,0.0138619,0.0003015333,0.9591617,0.005399644,0.01699564],"study_design_scores_gemma":[0.00583848,0.0002738453,0.00524064,0.0009656288,0.00006327842,0.0005200447,0.001245248,0.03471949,0.0009733905,0.002435504,0.94587,0.001854385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006025551,0.0007575395,0.9755785,0.0009168665,0.0002915357,0.000252473,0.01576518,0.0003056157,0.0001067493],"genre_scores_gemma":[0.1376404,0.0008619745,0.8173422,0.0009045207,0.0002875966,0.00007172326,0.04281357,0.00003785528,0.00004021108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9567262,"threshold_uncertainty_score":0.999962,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004694929,0.0002413218,0.0002262155,0.00003836926,0.001101133,0.0002691194,0.0007215488,0.00004198236,0.000001708551],"category_scores_gemma":[0.0001520038,0.0001687124,0.00004422291,0.0002159929,0.0001076474,0.001777648,0.0007137407,0.0001032611,0.000004448706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001830938,"about_ca_system_score_gemma":0.00009602187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006150111,"about_ca_topic_score_gemma":0.0007213662,"domain_scores_codex":[0.9981128,0.00007824524,0.0004040762,0.0007341669,0.000221007,0.0004496904],"domain_scores_gemma":[0.9976919,0.000303226,0.0001759134,0.001655592,0.0001062402,0.00006718123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006729612,0.00009625475,0.0003464169,0.00006479688,0.00004721899,0.00001510392,0.00005558245,0.002693433,0.0006588929,0.7839752,0.2029935,0.008986319],"study_design_scores_gemma":[0.0005737941,0.00003566188,0.0001771208,0.0000248478,0.00001647048,0.00002626538,0.00009264968,0.2290904,0.0001258223,0.0002810517,0.7692848,0.0002711352],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005737997,0.003048558,0.9804829,0.0007162155,0.0002648957,0.0006284965,0.01405763,0.0001417584,0.00008575857],"genre_scores_gemma":[0.01504986,0.001604178,0.8767207,0.0002282961,0.0009568523,0.0004221757,0.1046456,0.00003289779,0.0003393883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7836941,"threshold_uncertainty_score":0.8469133,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004005386,0.0001702442,0.0002068275,0.00007228922,0.0001034873,0.0001126413,0.0004360329,0.00003984063,0.00001459423],"category_scores_gemma":[0.0001109347,0.0001566334,0.0000358638,0.0003825039,0.00004360262,0.001241983,0.0002793861,0.0001330664,0.00004701633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003729724,"about_ca_system_score_gemma":0.00003795572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001572789,"about_ca_topic_score_gemma":0.0002515737,"domain_scores_codex":[0.998389,0.0000954998,0.000355114,0.0006696022,0.0001813755,0.0003094129],"domain_scores_gemma":[0.9985345,0.00009151983,0.0001102948,0.001092396,0.00005334218,0.0001179214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003404335,0.002578837,0.06182885,0.0004272042,0.0001551113,0.0002096254,0.001786054,0.004019975,0.002356455,0.4625168,0.2373638,0.2264169],"study_design_scores_gemma":[0.002954648,0.00006723877,0.0534653,0.0003454159,0.0000175492,0.0001079317,0.0001498898,0.1825133,0.0007245965,0.0005011811,0.7583556,0.0007974313],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03788013,0.001309393,0.9535551,0.002016387,0.00008755315,0.000416444,0.004162189,0.0001335199,0.0004392555],"genre_scores_gemma":[0.9708322,0.0002442283,0.0216365,0.000471898,0.00009588726,0.0001127824,0.00644124,0.000008659138,0.0001565698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9329521,"threshold_uncertainty_score":0.6387323,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006080201,0.0002238292,0.0003530951,0.0001483352,0.0001171139,0.00005223391,0.0003671933,0.000087942,0.000003961954],"category_scores_gemma":[0.0002056354,0.0002101424,0.00004708743,0.0007018094,0.00008686787,0.000300538,0.0002560441,0.000224973,0.000001593115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213758,"about_ca_system_score_gemma":0.00004517069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001368398,"about_ca_topic_score_gemma":0.001401176,"domain_scores_codex":[0.9979596,0.00007743852,0.0004458662,0.0004971428,0.0005099763,0.0005099521],"domain_scores_gemma":[0.9986967,0.0002893263,0.0001505918,0.0003822077,0.0002900679,0.0001910542],"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.00134275,0.001028299,0.09830993,0.0001338972,0.000066422,0.0007171064,0.002217299,0.7559901,0.0002890055,0.01870667,0.01872814,0.1024703],"study_design_scores_gemma":[0.001993237,0.0003449156,0.09027383,0.0004006255,0.00003268978,0.00005597785,0.0004302229,0.8427085,0.0006008756,0.00004609609,0.06205413,0.001058878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04192122,0.0007696034,0.9559956,0.0005558714,0.0002304793,0.0001586544,0.0001781168,0.00008241025,0.000108011],"genre_scores_gemma":[0.9531768,0.00003058827,0.04593536,0.0001075234,0.0001370751,0.000009301294,0.0004667109,0.0000129119,0.0001237315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9112556,"threshold_uncertainty_score":0.856936,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693974,0.0002264117,0.0002240945,0.00008228196,0.0004134864,0.0002446251,0.0004155506,0.00003402287,0.00002234021],"category_scores_gemma":[0.00002832857,0.0002095387,0.00004001242,0.0002175629,0.000157003,0.001538425,0.0006129684,0.000115969,0.00003155679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001238726,"about_ca_system_score_gemma":0.0000295962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002591245,"about_ca_topic_score_gemma":0.00002569388,"domain_scores_codex":[0.998486,0.000070443,0.0002634962,0.0005626366,0.0002832551,0.0003341343],"domain_scores_gemma":[0.9991719,0.00008473512,0.0001102812,0.0004099729,0.00004919726,0.0001739873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003805238,0.001684575,0.05549067,0.0006750182,0.000712721,0.004146641,0.001991823,0.006216718,0.001236755,0.2090546,0.4569525,0.2614574],"study_design_scores_gemma":[0.008410187,0.0004430893,0.1830273,0.0003155707,0.0001950985,0.001341523,0.00041528,0.5927358,0.0005218074,0.005567924,0.2042838,0.002742706],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04188617,0.001140817,0.9545969,0.0004329301,0.0002002491,0.0001988769,0.001090961,0.0001673793,0.0002857528],"genre_scores_gemma":[0.7403513,0.005464917,0.2373145,0.0009589551,0.0003665762,0.00005946828,0.01467168,0.00003293827,0.0007797514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7172824,"threshold_uncertainty_score":0.8544739,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001329868,0.0001775362,0.0001966212,0.00005049878,0.0002133596,0.0001694371,0.0002619937,0.00005455209,0.000006199919],"category_scores_gemma":[0.00001878956,0.0001624636,0.00006469803,0.0001098547,0.00002249151,0.0006258385,0.0001554592,0.0001016335,0.000002313375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002989479,"about_ca_system_score_gemma":0.00004843322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003711319,"about_ca_topic_score_gemma":0.0005470983,"domain_scores_codex":[0.9988468,0.00004586851,0.0002819525,0.0004226678,0.0001491167,0.0002535681],"domain_scores_gemma":[0.9993393,0.0001022463,0.0001134522,0.0003160903,0.00002907636,0.00009985787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001587731,0.0004564543,0.1345201,0.0000989927,0.000183815,0.00002467328,0.0003770355,0.004323555,0.01285546,0.05143014,0.7570537,0.03851728],"study_design_scores_gemma":[0.001897241,0.0001849244,0.01144134,0.0001024374,0.00004438198,0.00001141145,0.0001258095,0.8818806,0.002431701,0.004356152,0.0970637,0.0004602727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05390324,0.0003216872,0.9404919,0.0002257389,0.00009646932,0.0002847679,0.004029019,0.0004069753,0.0002402487],"genre_scores_gemma":[0.9284468,0.000113555,0.05837097,0.00006251138,0.0001861349,0.00006117373,0.01261954,0.00001284097,0.0001264279],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8821209,"threshold_uncertainty_score":0.6625075,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007326163,0.0003223115,0.0003741734,0.00007738052,0.0004935938,0.0005358897,0.003201032,0.00005796687,0.00000115999],"category_scores_gemma":[0.00004931544,0.0002811015,0.00003534345,0.0002856265,0.00006658804,0.001871883,0.00158681,0.0001812846,0.000006379316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004540224,"about_ca_system_score_gemma":0.00006688944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006214988,"about_ca_topic_score_gemma":0.0001816644,"domain_scores_codex":[0.9970985,0.0001031248,0.000460635,0.001431441,0.0003481441,0.0005581256],"domain_scores_gemma":[0.9954669,0.0001113002,0.0001975859,0.003893221,0.00007385245,0.0002570825],"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.0003160064,0.0009870976,0.0006206861,0.001053025,0.0006409367,0.0003557338,0.0005410095,0.215122,0.0001404119,0.7107523,0.02473415,0.04473662],"study_design_scores_gemma":[0.003463827,0.0002991301,0.001664423,0.0008287836,0.0001408762,0.0001678031,0.001252328,0.6087537,0.00002128378,0.001204905,0.3810396,0.001163299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001507028,0.001635266,0.9282715,0.0002912292,0.0003835821,0.0007963408,0.06684119,0.0001966305,0.00007725989],"genre_scores_gemma":[0.7898236,0.0001712146,0.09334736,0.0001819621,0.0002500827,0.0001170217,0.1160682,0.00002405083,0.00001653285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8349241,"threshold_uncertainty_score":0.9999641,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004787147,0.0002421133,0.0002665288,0.00006607069,0.0002095813,0.0004525881,0.00172618,0.00003392831,0.00001037002],"category_scores_gemma":[0.0001559081,0.0002088347,0.0000316615,0.0003642326,0.00004463297,0.0018312,0.001056327,0.0001436501,0.00001300612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001694725,"about_ca_system_score_gemma":0.00003636783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001334763,"about_ca_topic_score_gemma":0.00001182098,"domain_scores_codex":[0.9980981,0.00006719214,0.0002841405,0.0008507065,0.0002776868,0.0004221818],"domain_scores_gemma":[0.9976954,0.0001477584,0.00009947382,0.001855324,0.00004893459,0.0001530359],"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.00006876405,0.0006856269,0.01818039,0.0001344506,0.0001606991,0.0004845768,0.0001908808,0.0007657888,0.0001677772,0.1630616,0.06739528,0.7487041],"study_design_scores_gemma":[0.00384422,0.0005500984,0.03974839,0.000637117,0.0002768244,0.0001229615,0.0006118724,0.6518872,0.0005676195,0.01925221,0.2801146,0.002386888],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003446047,0.001004873,0.9884417,0.001119445,0.0002056683,0.0003291259,0.004840428,0.0002820589,0.0003306589],"genre_scores_gemma":[0.2343111,0.001120676,0.7247239,0.0006031155,0.000578763,0.00004743572,0.03829883,0.00002417998,0.0002919452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7463173,"threshold_uncertainty_score":0.8516033,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002198045,0.0002842884,0.0003460774,0.0001661585,0.00009249448,0.00008481353,0.0002599589,0.0001026073,0.0000073504],"category_scores_gemma":[0.0001037245,0.0002748852,0.0000446763,0.0006891013,0.00004227494,0.000203075,0.0001104387,0.0002542836,0.000009318905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007494629,"about_ca_system_score_gemma":0.0000150769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000347928,"about_ca_topic_score_gemma":0.00004910807,"domain_scores_codex":[0.9984839,0.00006437889,0.000389978,0.0003731121,0.0001960115,0.0004926412],"domain_scores_gemma":[0.9991423,0.00008332727,0.00003363771,0.0004655657,0.00003514919,0.0002399631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007655207,0.003206569,0.4057593,0.002946313,0.0007766916,0.001417793,0.001282763,0.2701991,0.01960705,0.04082681,0.2417306,0.01148143],"study_design_scores_gemma":[0.005092418,0.0003566656,0.06481698,0.00147052,0.0001738556,0.0005141491,0.003260702,0.7205172,0.001708246,0.0005848915,0.1976752,0.003829187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2191039,0.001557781,0.7714651,0.00006220942,0.0001069968,0.0006812786,0.005441295,0.0007171545,0.0008642562],"genre_scores_gemma":[0.9883974,0.0004701312,0.002646847,0.00004536405,0.00005736347,0.0002494371,0.008095315,0.00002969127,0.000008514507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7692934,"threshold_uncertainty_score":0.9999703,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002627849,0.0001850941,0.0002020856,0.00004058781,0.001404213,0.0003533607,0.0006869503,0.00003620269,0.00002072851],"category_scores_gemma":[0.00004905297,0.0001635899,0.000095837,0.00006422812,0.00009230076,0.0007954099,0.000292699,0.00007497862,0.00001458428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007326878,"about_ca_system_score_gemma":0.00002484106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003903067,"about_ca_topic_score_gemma":0.00004679197,"domain_scores_codex":[0.9987404,0.00004032674,0.0002043003,0.0004491671,0.000140817,0.0004250112],"domain_scores_gemma":[0.9985715,0.0000923273,0.0001468256,0.0009657395,0.00007530998,0.0001483579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008698239,0.0006339782,0.006500429,0.0001157808,0.0001509519,0.00005769216,0.000215612,0.00002990884,0.0002947659,0.9666251,0.01062393,0.01466486],"study_design_scores_gemma":[0.01256458,0.00144169,0.03824291,0.0005400495,0.0002639237,0.000239405,0.0005690995,0.09932504,0.01920813,0.3300534,0.4938019,0.003749842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02767796,0.0003935835,0.9647425,0.0004053062,0.0003038735,0.0002937017,0.006024629,0.00009002161,0.00006835607],"genre_scores_gemma":[0.9866313,0.00033988,0.009311448,0.0002332317,0.0000583866,0.0001576579,0.003200611,0.000008539234,0.00005894295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9589533,"threshold_uncertainty_score":0.9998958,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001884496,0.0001871882,0.0001953769,0.00003718495,0.0004523241,0.0000740509,0.0001419296,0.00004020617,0.00000704672],"category_scores_gemma":[0.0001319949,0.0001635342,0.00002010899,0.0002686632,0.0001424314,0.001525857,0.0002853399,0.00009128649,0.000003587005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001433051,"about_ca_system_score_gemma":0.00004496163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002015326,"about_ca_topic_score_gemma":0.00002332305,"domain_scores_codex":[0.9987922,0.00005371771,0.0002751684,0.0004520446,0.0001484648,0.0002784372],"domain_scores_gemma":[0.9992123,0.00005306655,0.0001303733,0.0003493515,0.0001044039,0.0001504863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006753677,0.0001724919,0.02975982,0.0004088219,0.00004086041,0.00008048478,0.001490836,0.000189833,0.0001542792,0.9232078,0.003529641,0.04089764],"study_design_scores_gemma":[0.002137917,0.0001966464,0.04429245,0.001177471,0.00009314436,0.0004559058,0.002268852,0.1942655,0.002685591,0.003090249,0.7473475,0.00198876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0052334,0.00186384,0.9905394,0.00005741089,0.00007073598,0.0001365016,0.001831821,0.0001767486,0.00009019042],"genre_scores_gemma":[0.8819481,0.000651539,0.1077382,0.0001623601,0.00008177478,0.00004505951,0.009323536,0.00001717865,0.00003226368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9201175,"threshold_uncertainty_score":0.666873,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002124515,0.0003399021,0.0003297501,0.00008127122,0.0004574084,0.0003210173,0.0006744595,0.00006338258,0.00005226793],"category_scores_gemma":[0.00001673809,0.0002832781,0.00005562249,0.0004035862,0.0002300224,0.0007102828,0.0003581071,0.0001662221,0.00004780817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000179445,"about_ca_system_score_gemma":0.00007455934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003776579,"about_ca_topic_score_gemma":0.000383153,"domain_scores_codex":[0.9977764,0.00005461563,0.0003816126,0.0008266956,0.0003120087,0.0006486381],"domain_scores_gemma":[0.998469,0.0001540354,0.0001708965,0.000911841,0.00008353042,0.0002107055],"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.0001816053,0.003494596,0.2849434,0.0003116361,0.000448111,0.0008907637,0.001423338,0.004453674,0.0003335046,0.2121506,0.2947074,0.1966613],"study_design_scores_gemma":[0.009351198,0.0004542967,0.2149667,0.00051517,0.0001980861,0.0007386513,0.001932924,0.312132,0.0001953684,0.001608657,0.4546956,0.00321141],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01616712,0.0004128234,0.9727748,0.0007705698,0.00006015442,0.0002477533,0.008802668,0.0002628821,0.0005011994],"genre_scores_gemma":[0.4184506,0.0001681683,0.5576675,0.0006024899,0.0002136932,0.0002227195,0.02238286,0.00003814906,0.0002538126],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4151073,"threshold_uncertainty_score":0.9999619,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126474,0.000184935,0.0001953185,0.00007934173,0.0001561205,0.0001671713,0.0004007083,0.00008202388,0.000008639234],"category_scores_gemma":[0.0000641143,0.0001692236,0.00002964107,0.0004680357,0.00009645675,0.0004633582,0.0002436385,0.0004065876,0.00000505992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009637759,"about_ca_system_score_gemma":0.00003583749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297607,"about_ca_topic_score_gemma":0.0005025571,"domain_scores_codex":[0.9986295,0.00005488849,0.0002454171,0.0004766745,0.0001593902,0.0004341402],"domain_scores_gemma":[0.9991165,0.0001213202,0.00008181127,0.0004980745,0.00004689633,0.0001353835],"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.00008325194,0.0006458043,0.122297,0.0001015249,0.00002327772,0.0006091582,0.000277039,0.7003681,0.002221604,0.07990862,0.007158909,0.0863057],"study_design_scores_gemma":[0.0004957019,0.00001650739,0.03032274,0.00007132029,0.000005081295,0.00006269255,0.00003277483,0.9551351,0.0001088821,0.00004341681,0.01335006,0.0003557257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1950653,0.0005792924,0.803202,0.0003115066,0.0002998694,0.0001051154,0.00009169037,0.0001885444,0.00015673],"genre_scores_gemma":[0.9552532,0.0001052985,0.04358369,0.0001863054,0.0001251612,0.0000140726,0.0006946647,0.00001093956,0.0000266047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.760188,"threshold_uncertainty_score":0.6900736,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704257,0.0000922367,0.0001001686,0.00007440874,0.0003011941,0.0002109689,0.0002340521,0.00002053422,0.000007252578],"category_scores_gemma":[0.0001099519,0.00008541193,0.00002714769,0.0002615465,0.00003621555,0.001133665,0.0002015796,0.00004573722,0.000004590269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001108426,"about_ca_system_score_gemma":0.00003393817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005865975,"about_ca_topic_score_gemma":0.00007725712,"domain_scores_codex":[0.9993157,0.00002153697,0.000172016,0.0002531282,0.00007450849,0.0001631321],"domain_scores_gemma":[0.9994643,0.000115385,0.00005304766,0.0002904465,0.000042092,0.00003467742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002206678,0.00005312148,0.01800357,0.000058983,0.00004377795,0.000003800843,0.00005555782,0.00006483351,0.00001567703,0.8563251,0.1091013,0.01625218],"study_design_scores_gemma":[0.001113719,0.00003627368,0.01830706,0.00008377077,0.00003840488,0.000001723438,0.0001630081,0.1089634,0.0000940402,0.009143189,0.8617762,0.0002792314],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000678423,0.0002846994,0.9943663,0.001908269,0.0001598794,0.0002355179,0.001816469,0.0001150187,0.0004354329],"genre_scores_gemma":[0.5084632,0.0003656945,0.4135087,0.001178589,0.0002075399,0.0003938648,0.07113906,0.00001736246,0.004726061],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.847182,"threshold_uncertainty_score":0.3482997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002439373,0.0001462294,0.0001552192,0.00005597445,0.0007609848,0.000138761,0.0002717157,0.00001776739,0.00004081539],"category_scores_gemma":[0.00002575158,0.0001376217,0.00003441615,0.0002794221,0.0001075977,0.0004276234,0.0004810639,0.0001429949,0.000001059484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002686671,"about_ca_system_score_gemma":0.00003490879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006012872,"about_ca_topic_score_gemma":0.000005615163,"domain_scores_codex":[0.9987634,0.0001759987,0.0001643519,0.0003959734,0.0001707629,0.0003294529],"domain_scores_gemma":[0.9993517,0.0001267713,0.00006561842,0.0002982117,0.00002270147,0.00013493],"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.0002075815,0.0005250002,0.02029091,0.000106951,0.00008127795,0.0001641909,0.0006178394,0.01873508,0.0008504321,0.946328,0.0008053096,0.01128735],"study_design_scores_gemma":[0.001535854,0.0002122834,0.02320201,0.00005492128,0.00005898236,0.0005314091,0.0005169058,0.9079427,0.0002954263,0.05790239,0.007069741,0.0006773795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4049857,0.000497689,0.592072,0.0001646208,0.0001549918,0.0001865903,0.001800069,0.00009052829,0.00004786251],"genre_scores_gemma":[0.9916641,0.00003866713,0.007060812,0.0001213944,0.00002953606,0.00002137767,0.001047765,0.000006386646,0.00001003065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8892076,"threshold_uncertainty_score":0.5852957,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694633,0.0001987752,0.0001666944,0.0001236965,0.0002813168,0.0004747036,0.0004025266,0.00004753653,0.00002794412],"category_scores_gemma":[0.0007550444,0.0001761761,0.00004511146,0.0003575732,0.00008458475,0.002115711,0.0005146616,0.0004287251,0.00007791847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002517028,"about_ca_system_score_gemma":0.00008031782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006155226,"about_ca_topic_score_gemma":0.000005829277,"domain_scores_codex":[0.9988517,0.00006975053,0.0002718606,0.0002767256,0.0002417773,0.0002881825],"domain_scores_gemma":[0.9988809,0.0005503302,0.000062368,0.0003327411,0.00005259276,0.0001210428],"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.000009948129,0.0000165696,0.001823083,0.000129314,0.00002995886,0.00004264705,0.0005468507,0.3896468,0.000005303645,0.5937361,0.003116011,0.01089747],"study_design_scores_gemma":[0.0001910817,0.00002245593,0.0001576317,0.00007584573,0.00001919463,0.00002769026,0.00003772495,0.9483078,0.00001393846,0.0035454,0.04738162,0.000219679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001533345,0.001474095,0.9942979,0.0006037758,0.0001969384,0.0001084864,0.0008159112,0.0005072372,0.0004623013],"genre_scores_gemma":[0.921962,0.001793106,0.06916732,0.000313899,0.00008437326,0.00002952981,0.006547315,0.00001758493,0.00008489645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9251306,"threshold_uncertainty_score":0.7184252,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002972546,0.0001913949,0.0002082765,0.00004905571,0.0003727312,0.0003356459,0.0004557114,0.00001927052,0.00001271727],"category_scores_gemma":[0.0000988241,0.0001363773,0.00002919721,0.0003223089,0.00003110331,0.00007782555,0.0008115674,0.0001515117,0.00008102456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001651415,"about_ca_system_score_gemma":0.00001216091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001332745,"about_ca_topic_score_gemma":0.000004558121,"domain_scores_codex":[0.9984949,0.0001272967,0.0002107735,0.0006497895,0.0002503439,0.0002668718],"domain_scores_gemma":[0.9989811,0.0001220839,0.0000737382,0.0005915847,0.00003379326,0.0001977498],"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.00008317706,0.0000585783,0.00007739315,0.00007925097,0.00006154649,0.00003334364,0.000625061,0.05723728,0.000009731558,0.01035974,0.921768,0.009606977],"study_design_scores_gemma":[0.0003965056,0.00007638138,0.0002367105,0.00003571679,0.00002155064,0.00001057534,0.0002137966,0.2129392,0.00001191431,0.00000568068,0.785882,0.0001699752],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01343221,0.001434519,0.8370569,0.1416609,0.001986522,0.001223158,0.001788075,0.0006513546,0.0007663863],"genre_scores_gemma":[0.5014858,0.005141387,0.1738794,0.04712746,0.2457956,0.0005170348,0.02088494,0.0002895547,0.004878794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6631775,"threshold_uncertainty_score":0.5561305,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332159,0.0001830411,0.0002832827,0.00007612633,0.0001570488,0.0001757918,0.0002776044,0.00004782351,0.000003199816],"category_scores_gemma":[0.00008429666,0.0001763325,0.00002671535,0.0002812249,0.0001132551,0.0002620543,0.0002737958,0.0001334994,0.000004107217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002877446,"about_ca_system_score_gemma":0.00002959705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000163881,"about_ca_topic_score_gemma":0.00003488134,"domain_scores_codex":[0.9985963,0.000088417,0.0003406742,0.0005323255,0.0001311905,0.0003110942],"domain_scores_gemma":[0.9992031,0.0001449532,0.00009500386,0.0004494225,0.00001492226,0.00009263043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003517175,0.000614934,0.3951297,0.002017568,0.0003349657,0.001453055,0.00171797,0.001110685,0.003751119,0.374354,0.06372298,0.1554413],"study_design_scores_gemma":[0.005893657,0.00006415704,0.4069192,0.002812656,0.00005153451,0.0001444957,0.001626865,0.06395748,0.0003483693,0.0009222291,0.5159166,0.001342741],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2024492,0.01160947,0.7699273,0.006384369,0.000354337,0.0007628359,0.006690975,0.0001831168,0.001638418],"genre_scores_gemma":[0.994939,0.0003385738,0.002942839,0.0003116697,0.00002188114,0.00002656383,0.001224206,0.000005441769,0.0001898685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7924898,"threshold_uncertainty_score":0.719063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001075285,0.0006792401,0.0008893218,0.000552565,0.0002792424,0.0005065714,0.0015298,0.0004943336,0.00004910997],"category_scores_gemma":[0.004433414,0.0006436629,0.0001332562,0.001204831,0.0001273149,0.001641454,0.0007110576,0.001453798,0.000136535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001582724,"about_ca_system_score_gemma":0.0004533327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006737067,"about_ca_topic_score_gemma":0.0004353412,"domain_scores_codex":[0.9952721,0.0001850917,0.0008828603,0.001328024,0.001545669,0.0007862514],"domain_scores_gemma":[0.9952261,0.002246087,0.0003646993,0.001661361,0.0002456543,0.000256119],"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.0001309935,0.0002568542,0.00007221518,0.0001010393,0.0000195835,0.00008205622,0.0000480989,0.00003789445,7.88805e-7,0.001789977,0.9932145,0.004245941],"study_design_scores_gemma":[0.001277866,0.0002172632,0.0002132212,0.0003982384,0.00002435667,0.000002560157,0.00001964415,0.0001901461,0.00002245552,0.0001424055,0.9967716,0.0007202611],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00002231113,0.0004684978,0.007002194,0.000156456,0.968822,0.0003900856,0.0217337,0.0001738639,0.001230872],"genre_scores_gemma":[0.00002034346,0.001961804,0.001769044,0.0001215264,0.9451014,0.00002070876,0.05089046,0.00002161761,0.00009306578],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02915676,"threshold_uncertainty_score":0.9996015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}