{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"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":"ea3402be1ff5","filters":{"venue":"Very Large Data Bases"}},"results":[{"id":"W2041180570","doi":"10.5555/1182635.1164189","title":"Lazy database replication with snapshot isolation","year":2006,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Snapshot (computer storage); Serializability; Distributed computing; Concurrency; Database; Database transaction; Concurrency control; Isolation (microbiology); Data integrity; Transaction processing; Distributed transaction","authors":[{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Kenneth Salem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02553277817671872,"gpt":0.2612185157962632,"spread":0.2356857376195444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003953909,0.0006781252,0.001152098,0.00102969,0.001528816,0.002897722,0.003456958,0.001240224,0.002114192],"category_scores_gemma":[0.01325194,0.0007166082,0.0008290313,0.001713923,0.00186638,0.006081867,0.006638477,0.002140855,0.001303781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008415455,"about_ca_system_score_gemma":0.002071357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007328423,"about_ca_topic_score_gemma":0.0008262879,"domain_scores_codex":[0.9935699,0.001586924,0.000612619,0.001053908,0.002696971,0.0004797567],"domain_scores_gemma":[0.9839048,0.002239767,0.001327405,0.01043766,0.001573651,0.0005166863],"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.001020331,0.0003887771,0.006631492,0.001026598,0.0004698967,0.0009515239,0.001329683,0.136372,0.07063691,0.3163575,0.01557578,0.4492396],"study_design_scores_gemma":[0.0003658333,0.0008035468,0.001557218,0.0001471493,0.0004168316,0.001919421,0.0004220324,0.588038,0.08024549,0.2688582,0.05702726,0.0001989254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01752634,0.001126025,0.9745492,0.0003284289,0.0001344097,0.0001614823,0.00004915777,0.003371442,0.002753461],"genre_scores_gemma":[0.5871381,0.0008472968,0.4053564,0.000389877,0.0003844232,0.0003517557,0.0002397697,0.0004134249,0.004879017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003953909,"threshold_uncertainty_score":0.0209105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118326624","doi":"10.5555/1182635.1164140","title":"Efficient secure query evaluation over encrypted XML databases","year":2006,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Database; Encryption; Database security; Metadata; View; XML database; XML Encryption; Information retrieval; XML; Computer security; Database design; World Wide Web","authors":[{"name":"Hui Wang","is_ca":true},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03633933031643261,"gpt":0.2968752340972579,"spread":0.2605359037808253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004934669,0.0007589792,0.001517884,0.0007413275,0.0009234383,0.002481638,0.001853585,0.001053615,0.001450283],"category_scores_gemma":[0.01377619,0.0005003082,0.0009924505,0.001272961,0.001145362,0.005229879,0.003285064,0.001410986,0.0004731725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632389,"about_ca_system_score_gemma":0.001678207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001891118,"about_ca_topic_score_gemma":0.001627897,"domain_scores_codex":[0.9903555,0.002240235,0.001323455,0.0009771566,0.004263247,0.0008404659],"domain_scores_gemma":[0.9826225,0.008430656,0.001432513,0.005415978,0.001742577,0.0003558203],"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.00570805,0.001051212,0.01561959,0.0006394408,0.0003534362,0.001830166,0.002354416,0.3993197,0.1320525,0.08125668,0.007703283,0.3521116],"study_design_scores_gemma":[0.0001123902,0.0001644959,0.0007520957,0.00001568398,0.00004509863,0.0004090489,0.000254961,0.9330346,0.03945662,0.02434301,0.001390265,0.00002171025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2920678,0.000589723,0.700386,0.0009532759,0.00004625768,0.0002488137,0.0004024777,0.002744163,0.002561392],"genre_scores_gemma":[0.8817077,0.0002139585,0.1160021,0.0001301677,0.00004457253,0.00007487452,0.0003255963,0.0001345857,0.001366538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004934669,"threshold_uncertainty_score":0.02609736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784053634","doi":"10.1145/3164135.3164139","title":"The ubiquity of large graphs and surprising challenges of graph processing","year":2017,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Suite; Visualization; Graph; Software; Data science; Call graph; Theoretical computer science; Data visualization; World Wide Web; Data mining; Programming language; Database","authors":[{"name":"Siddhartha Sahu","is_ca":true},{"name":"Amine Mhedhbi","is_ca":true},{"name":"Semih Salihoğlu","is_ca":true},{"name":"Jimmy Lin","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07621659304314052,"gpt":0.3534706649777041,"spread":0.2772540719345635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01665007,0.0005647455,0.0006027501,0.00383631,0.001943211,0.005126248,0.001875094,0.002001041,0.002525181],"category_scores_gemma":[0.09797047,0.0009414402,0.0007068611,0.005139848,0.003871364,0.01391352,0.003082968,0.002705615,0.0007653342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132996,"about_ca_system_score_gemma":0.001086869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014195,"about_ca_topic_score_gemma":0.002927428,"domain_scores_codex":[0.981712,0.00960679,0.0007187931,0.002233666,0.005285201,0.0004436028],"domain_scores_gemma":[0.7985132,0.1728275,0.006979656,0.01091679,0.00853043,0.002232422],"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.0003794027,0.0001734384,0.0684664,0.007079237,0.0003123878,0.003048769,0.09182882,0.01105089,0.01797997,0.1034337,0.05955552,0.6366914],"study_design_scores_gemma":[0.00005084462,0.0003356877,0.05832219,0.0017204,0.0001243535,0.009872593,0.08603596,0.03705144,0.01026969,0.317145,0.4786808,0.0003910153],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5417594,0.02318249,0.3535745,0.0526655,0.0007267293,0.0003623113,0.001896974,0.003624843,0.02220725],"genre_scores_gemma":[0.7660667,0.01230464,0.2094789,0.003797355,0.0008154043,0.0002850702,0.001863942,0.002015052,0.003373004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01665007,"threshold_uncertainty_score":0.08805501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791526170","doi":"10.1145/3164135.3164147","title":"Bztree: a high-performance latch-free range index for non-volatile memory","year":2018,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Non-volatile memory; Block (permutation group theory); Embedded system; Throughput; Computer hardware; Tree (set theory); Semiconductor memory; Code (set theory); Data retention; Parallel computing; Operating system","authors":[{"name":"Joy Arulraj","is_ca":false},{"name":"Justin J. Levandoski","is_ca":false},{"name":"Umar Farooq Minhas","is_ca":false},{"name":"Per-Åke Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02434901392116039,"gpt":0.2591629562395728,"spread":0.2348139423184124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002661118,0.0003602016,0.0003922962,0.001044345,0.000516211,0.00118315,0.001951149,0.0004372377,0.005624222],"category_scores_gemma":[0.001008278,0.0003190074,0.000247334,0.001372143,0.0002902851,0.002321023,0.001294776,0.0006530909,0.002703084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005346498,"about_ca_system_score_gemma":0.000825024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001411638,"about_ca_topic_score_gemma":0.001900243,"domain_scores_codex":[0.9995858,0.00002858638,0.0000335848,0.00004053268,0.000256149,0.00005530733],"domain_scores_gemma":[0.9994018,0.00009540514,0.00007582967,0.0001638327,0.0002018523,0.00006136617],"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.001629246,0.0002555473,0.004006941,0.001019201,0.0001462969,0.000510006,0.000395564,0.009983262,0.2365191,0.02946468,0.1034215,0.6126488],"study_design_scores_gemma":[0.0007020609,0.001745407,0.005103471,0.0001838489,0.0001649908,0.001692691,0.0002781777,0.2274665,0.4081609,0.02468724,0.3294839,0.0003308193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1021134,0.008068644,0.8074611,0.0005135792,0.0006007947,0.0003790111,0.00328325,0.05490519,0.02267504],"genre_scores_gemma":[0.5429686,0.002332236,0.4130854,0.0006378849,0.0002144531,0.0006226764,0.01141077,0.003927645,0.02480036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005624222,"threshold_uncertainty_score":0.01881492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169424245","doi":"10.5555/1182635.1164177","title":"Answering tree pattern queries using views","year":2006,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Rewriting; Schema (genetic algorithms); Computer science; Time complexity; Tree (set theory); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Programming language; Information retrieval","authors":[{"name":"Laks V. S. Lakshmanan","is_ca":true},{"name":"Hui Wang","is_ca":true},{"name":"Zheng Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06735454525073631,"gpt":0.2970910055120431,"spread":0.2297364602613068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002397149,0.0005957028,0.001196431,0.0009056213,0.000649592,0.002240557,0.001732051,0.00136615,0.00168213],"category_scores_gemma":[0.01256705,0.0005686567,0.001251964,0.002328224,0.001149134,0.008404446,0.002025141,0.001882181,0.0004800105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009253065,"about_ca_system_score_gemma":0.0006984763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002420461,"about_ca_topic_score_gemma":0.001839007,"domain_scores_codex":[0.9962342,0.001308668,0.0002647163,0.000796939,0.00108937,0.000306034],"domain_scores_gemma":[0.9880779,0.008647798,0.0006863074,0.00163551,0.0007711956,0.0001812128],"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.0009308414,0.0004938488,0.008150309,0.001055804,0.0003035599,0.001003729,0.002413639,0.1915429,0.04237095,0.3395259,0.01367466,0.3985339],"study_design_scores_gemma":[0.00009180736,0.0002930944,0.0009046685,0.0000461338,0.0001078695,0.0006821129,0.0004246247,0.6291592,0.02105513,0.3356611,0.01152642,0.00004773899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06990268,0.000971986,0.9240083,0.0006985263,0.00004466183,0.00012597,0.0004141753,0.001225105,0.002608736],"genre_scores_gemma":[0.5307316,0.001366465,0.4616051,0.0005156415,0.0002152057,0.0002401015,0.002171617,0.0003971329,0.002757269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002420461,"threshold_uncertainty_score":0.01267749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108075439","doi":"","title":"Approximate joins: concepts and techniques","year":2005,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Joins; Multitude; Computer science; Database; Quality (philosophy); Data quality; Character (mathematics); Service (business); Relational database; Missing data; Data science; Data mining; World Wide Web; Business; Marketing","authors":[{"name":"Nick Koudas","is_ca":true},{"name":"Divesh Srivastava","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2365840025725053,"gpt":0.4607702635409333,"spread":0.224186260968428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006040103,0.00137238,0.001788235,0.005530413,0.002078511,0.007529389,0.004463063,0.002123612,0.007152562],"category_scores_gemma":[0.01431196,0.001345527,0.002086507,0.01196514,0.003817465,0.01411243,0.006193004,0.003942075,0.003818381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001649705,"about_ca_system_score_gemma":0.001604082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001865614,"about_ca_topic_score_gemma":0.001032387,"domain_scores_codex":[0.9927654,0.001666073,0.0006580524,0.001411758,0.003171111,0.0003276386],"domain_scores_gemma":[0.994006,0.003192716,0.0005770659,0.001216381,0.000822228,0.0001855755],"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.00008230271,0.00005709942,0.0006265952,0.0005938731,0.00009858916,0.0001568789,0.0006541516,0.01140397,0.0007031186,0.8232879,0.01116253,0.151173],"study_design_scores_gemma":[0.00001921954,0.00004485867,0.0001972327,0.0001340253,0.00005167186,0.000463908,0.0001446096,0.02946806,0.0007158418,0.9121346,0.05660031,0.00002572359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002688452,0.01004041,0.9739386,0.0007543589,0.0002603334,0.0001092527,0.0003528027,0.0007315455,0.01112419],"genre_scores_gemma":[0.09598676,0.01611122,0.8736335,0.0006923281,0.002030222,0.0004926331,0.001382469,0.0004471985,0.009223702],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007529389,"threshold_uncertainty_score":0.03194344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W145033769","doi":"","title":"The Long-Term Preservation of Authentic Electronic Records","year":2001,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Digital and Traditional Archives Management","field":"Arts and Humanities","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Term (time); Computer science; Phase (matter); Data science","authors":[{"name":"Luciana Duranti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0536414918134093,"gpt":0.2481834449299291,"spread":0.1945419531165198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02908105,0.0002177698,0.0004086574,0.002450252,0.005962349,0.01729005,0.003523673,0.00273679,0.003486513],"category_scores_gemma":[0.08869656,0.0004659056,0.00029708,0.00422262,0.01560374,0.02252215,0.01577667,0.003430791,0.001364428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299756,"about_ca_system_score_gemma":0.006041354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028754,"about_ca_topic_score_gemma":0.001096295,"domain_scores_codex":[0.9698648,0.01751906,0.001515384,0.001819777,0.00808911,0.001191837],"domain_scores_gemma":[0.8688199,0.04327181,0.01641787,0.05060521,0.01719236,0.003692906],"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.0001494701,0.0001221338,0.008690615,0.0005233974,0.00002511581,0.0002943336,0.02168778,0.0009300313,0.001733759,0.755517,0.004481291,0.2058452],"study_design_scores_gemma":[0.00005046928,0.0005461091,0.01233999,0.001936678,0.0001077615,0.002793935,0.06421522,0.005219808,0.01005121,0.5321887,0.3704345,0.0001156248],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2827854,0.01204398,0.4347984,0.04633716,0.0008463392,0.0005210074,0.000729156,0.0007547812,0.2211839],"genre_scores_gemma":[0.931049,0.002547228,0.05291867,0.0007578116,0.0004972903,0.0001895988,0.0003626348,0.00008012361,0.01159768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02908105,"threshold_uncertainty_score":0.1537971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400761516","doi":"","title":"Towards Dynamic Green-Sizing for Database Servers.","year":2015,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Frequency scaling; Memory management; Exploit; Workload; Database server; Power (physics); Dynamic demand; Database; Transaction processing; Operating system; Database transaction; Semiconductor memory","authors":[{"name":"Mustafa Korkmaz","is_ca":true},{"name":"Alexey Karyakin","is_ca":true},{"name":"Martin Karsten","is_ca":true},{"name":"Kenneth Salem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07489147399189085,"gpt":0.3030708951274435,"spread":0.2281794211355527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722166,0.0007674354,0.000537954,0.0005513064,0.0005591747,0.00141148,0.00148351,0.0003854945,0.003972895],"category_scores_gemma":[0.00118361,0.000338988,0.0002614347,0.0006692624,0.0004823037,0.001887241,0.0008425813,0.0007563463,0.00103343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008829962,"about_ca_system_score_gemma":0.001043219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001557897,"about_ca_topic_score_gemma":0.004382722,"domain_scores_codex":[0.9996477,0.00005001058,0.00001277795,0.00007149611,0.0001699829,0.00004803186],"domain_scores_gemma":[0.9995946,0.0001422488,0.0000407349,0.00008093395,0.0001080543,0.00003340704],"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.000308686,0.0003589224,0.002334008,0.000339982,0.00007097162,0.0001549384,0.0002433178,0.3112327,0.1264146,0.05829107,0.0123714,0.4878795],"study_design_scores_gemma":[0.000041076,0.0001044416,0.0007912749,0.00002741632,0.00002673794,0.0001503036,0.0001508227,0.9059783,0.02709703,0.04266125,0.02294763,0.00002369126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04580961,0.00211655,0.9313641,0.0008195053,0.000163811,0.0001071751,0.0001688474,0.002131717,0.01731865],"genre_scores_gemma":[0.614623,0.001005819,0.3734222,0.0004725941,0.00008202497,0.00009422901,0.0002862412,0.0005457956,0.009468121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003972895,"threshold_uncertainty_score":0.01329064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889053599","doi":"10.5555/3236187.3269462","title":"Efficient construction of approximate ad-hoc ML models through materialization and reuse","year":2018,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Online analytical processing; Reuse; Dimension (graph theory); Cluster analysis; Data warehouse; Data mining; Construct (python library); Variety (cybernetics); Mixture model; Data modeling; Machine learning; Artificial intelligence; Database; Programming language","authors":[{"name":"Sona Hasani","is_ca":false},{"name":"Saravanan Thirumuruganathan","is_ca":false},{"name":"Abolfazl Asudeh","is_ca":false},{"name":"Nick Koudas","is_ca":true},{"name":"Gautam Das","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04435581347020066,"gpt":0.2676946544767879,"spread":0.2233388410065872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005564487,0.002129485,0.002567809,0.001993426,0.001317107,0.004627422,0.004590313,0.001905928,0.00334876],"category_scores_gemma":[0.02663322,0.001818752,0.003146503,0.003299475,0.002278772,0.008489148,0.006687189,0.003700565,0.001626874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002661781,"about_ca_system_score_gemma":0.003800732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009461256,"about_ca_topic_score_gemma":0.01184294,"domain_scores_codex":[0.9944278,0.001888928,0.0004198019,0.0009655513,0.001800718,0.0004972133],"domain_scores_gemma":[0.9821231,0.009989939,0.0009999617,0.005292078,0.001231597,0.0003634155],"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.0001697883,0.0001949274,0.002363377,0.0001232735,0.0001107807,0.0002026261,0.0003685901,0.8129876,0.002688573,0.03874538,0.003974192,0.1380709],"study_design_scores_gemma":[0.00001250512,0.00001854849,0.00005762854,0.000004064723,0.00001035434,0.00002758663,0.00005189094,0.9792669,0.001092299,0.0186411,0.0008088931,0.000008232639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01375913,0.0001238022,0.9825075,0.0002482537,0.0000126769,0.00008296494,0.0001310182,0.002357139,0.0007774842],"genre_scores_gemma":[0.2288459,0.0001985333,0.7668522,0.0002110931,0.00006104561,0.0002463768,0.001187121,0.0008229409,0.001574758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009461256,"threshold_uncertainty_score":0.02942812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1489499991","doi":"","title":"Personalizing XML text search in PIMENT","year":2005,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Advanced Database Systems and Queries","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":"University of British Columbia","funders":"","keywords":"Computer science; Information retrieval; Web search query; Ranking (information retrieval); Personalization; Query expansion; Web query classification; XML; World Wide Web; Search engine","authors":[{"name":"Sihem Amer-Yahia","is_ca":false},{"name":"Irini Fundulaki","is_ca":false},{"name":"Prateek Jain","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05606628651388298,"gpt":0.314073539819003,"spread":0.2580072533051201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984667,0.0005597528,0.0009483109,0.002111426,0.0007684338,0.001868805,0.001440682,0.0008267991,0.002398943],"category_scores_gemma":[0.008237071,0.0005019248,0.0006928549,0.001721826,0.0005085737,0.002984568,0.002000002,0.0007569488,0.001831209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006620699,"about_ca_system_score_gemma":0.0007425213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002501847,"about_ca_topic_score_gemma":0.004151931,"domain_scores_codex":[0.9972198,0.0008176783,0.000265376,0.000535253,0.0009824252,0.0001794839],"domain_scores_gemma":[0.9971547,0.0009407081,0.0001788455,0.001151214,0.0004603746,0.0001140828],"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.001718101,0.0006866833,0.008517252,0.0004789566,0.000262359,0.001235759,0.00251842,0.02384502,0.07991637,0.02845253,0.04895141,0.8034171],"study_design_scores_gemma":[0.0001992604,0.000443885,0.007595148,0.00007206354,0.0002434384,0.001911586,0.0008297662,0.6380879,0.1608295,0.03739826,0.1521383,0.0002507887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1213038,0.0008991062,0.7918171,0.0006876909,0.00009227661,0.0007707912,0.001766215,0.06979152,0.01287157],"genre_scores_gemma":[0.4514003,0.0005329584,0.521467,0.0007933828,0.0001396319,0.0004175411,0.007012989,0.001570844,0.01666529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002984667,"threshold_uncertainty_score":0.01578462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204354173","doi":"","title":"Enabling NUMA-aware Main Memory Spatial Join Processing: An Experimental Study.","year":2020,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Join (topology); Parallel computing; Computer architecture","authors":[{"name":"Suprio Ray","is_ca":true},{"name":"Catherine Higgins","is_ca":false},{"name":"Vaishnavi Anupindi","is_ca":false},{"name":"Saransh Gautam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08098202661924112,"gpt":0.3075131336643204,"spread":0.2265311070450793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595146,0.0005570193,0.0005833193,0.0003803747,0.0009271509,0.001460159,0.002264723,0.0007407466,0.005949197],"category_scores_gemma":[0.004254949,0.0002908305,0.0002195829,0.0008764104,0.0006511972,0.002041416,0.001063653,0.0008973322,0.00122363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005484652,"about_ca_system_score_gemma":0.0009520483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002557833,"about_ca_topic_score_gemma":0.002392969,"domain_scores_codex":[0.9990436,0.0001906132,0.00004401775,0.0001789809,0.0003711189,0.0001715198],"domain_scores_gemma":[0.9967919,0.001379726,0.0001814314,0.0008735945,0.0004966701,0.0002766092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01530062,0.007038577,0.00943735,0.001585287,0.0004102657,0.0007484042,0.0008917885,0.07948508,0.6688377,0.01288812,0.0186902,0.1846866],"study_design_scores_gemma":[0.0008542577,0.00430965,0.007810457,0.00004895022,0.0002528544,0.0004154318,0.0007222652,0.5452675,0.4193237,0.006187319,0.01471329,0.00009423065],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9265066,0.001496189,0.04968131,0.0005412762,0.0003938492,0.0002365303,0.0007536702,0.006816961,0.01357358],"genre_scores_gemma":[0.9594269,0.0002407281,0.03630263,0.0001181028,0.00004615891,0.000097944,0.0004826852,0.0002644107,0.003020339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005949197,"threshold_uncertainty_score":0.01990205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398890672","doi":"","title":"Towards Adaptive Resource Allocation for Database Workloads.","year":2015,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workload; Scalability; Resource allocation; Distributed computing; Performance tuning; Performance metric; Real-time computing; Database; Operating system","authors":[{"name":"Cong Guo","is_ca":true},{"name":"Martin Karsten","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09405781546455771,"gpt":0.2961469118723735,"spread":0.2020890964078157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118088,0.0008601705,0.0005408033,0.0006871102,0.0003371389,0.001000471,0.001187873,0.0006456757,0.0008124681],"category_scores_gemma":[0.00498716,0.0003843597,0.0002725166,0.0005515374,0.0006117013,0.001064898,0.000892778,0.001190886,0.0004126364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007273798,"about_ca_system_score_gemma":0.0007755676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001655826,"about_ca_topic_score_gemma":0.00180623,"domain_scores_codex":[0.999138,0.0002206343,0.00004706343,0.0001710849,0.0003461598,0.0000770854],"domain_scores_gemma":[0.9985859,0.0006914492,0.0001853357,0.0001956242,0.0002850061,0.00005672335],"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.0002438185,0.0002095204,0.002722282,0.0002505653,0.00006940521,0.0001372629,0.0002426342,0.5308194,0.07923748,0.03187937,0.003607346,0.350581],"study_design_scores_gemma":[0.000007950195,0.00003431517,0.000249585,0.00001139932,0.00000523573,0.00003948028,0.00001742536,0.987633,0.004292199,0.00649564,0.001205362,0.000008544881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01238081,0.0004653163,0.9843531,0.0001652394,0.0000421595,0.00007163581,0.00001835858,0.0006037851,0.001899678],"genre_scores_gemma":[0.6872973,0.0004808925,0.3095969,0.0002509154,0.00007638262,0.0001976039,0.00007277625,0.0001142968,0.001912961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001655826,"threshold_uncertainty_score":0.005913138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144006311","doi":"","title":"MIX: a meta-data indexing system for XML","year":2005,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"XPath; Computer science; XML database; Information retrieval; Streaming XML; XML validation; Efficient XML Interchange; XML Encryption; Document Structure Description; XML Schema (W3C); Database; XML Schema Editor; Search engine indexing; Simple API for XML; XML Signature; XML; Data mining; World Wide Web","authors":[{"name":"SungRan Cho","is_ca":false},{"name":"Nick Koudas","is_ca":true},{"name":"Divesh Srivastava","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1406926542850825,"gpt":0.3255385009971596,"spread":0.1848458467120771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752828,0.0009682679,0.001180956,0.003324938,0.001065948,0.005422274,0.003573545,0.001304418,0.01183923],"category_scores_gemma":[0.005526408,0.001245591,0.001067552,0.003496989,0.0009825493,0.009650578,0.005644654,0.002219605,0.007391897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001241704,"about_ca_system_score_gemma":0.001422925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340294,"about_ca_topic_score_gemma":0.001261978,"domain_scores_codex":[0.9974757,0.0003117606,0.0003541363,0.000387836,0.001328933,0.0001417281],"domain_scores_gemma":[0.9976005,0.0005757527,0.0002235296,0.001021478,0.0003610101,0.0002176453],"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.002076575,0.0003025886,0.005368117,0.001578296,0.0003509223,0.0006181509,0.001527621,0.007286623,0.0719251,0.1230133,0.1486704,0.6372823],"study_design_scores_gemma":[0.0004787336,0.0004389742,0.002027913,0.0002882265,0.0003052323,0.001571185,0.0003870929,0.1492498,0.1352948,0.08170447,0.6279255,0.0003282929],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007136484,0.001077145,0.8383787,0.0004031832,0.0001769898,0.0003567263,0.004882897,0.1393512,0.008236703],"genre_scores_gemma":[0.1114688,0.001267026,0.8288536,0.001166944,0.0004175558,0.001251547,0.02351833,0.01314844,0.01890769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01183923,"threshold_uncertainty_score":0.03960621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400133291","doi":"","title":"Robust concurrency control in main-memory DBMS: What main memory giveth, the application taketh away.","year":2014,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency control; Multiversion concurrency control; Non-lock concurrency control; Concurrency; Database; Optimistic concurrency control; Memory management; Distributed concurrency control; Parallel computing; Programming language; Operating system; Database transaction; Overlay","authors":[{"name":"Ryan Johnson","is_ca":true},{"name":"Kangnyeon Kim","is_ca":false},{"name":"Tianzheng Wang","is_ca":true},{"name":"Ippokratis Pandis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02795687589826629,"gpt":0.2522051176409221,"spread":0.2242482417426558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003904853,0.0005264324,0.000865498,0.0004330458,0.000782549,0.004481284,0.002542871,0.001776049,0.00411653],"category_scores_gemma":[0.02011588,0.0007530269,0.0005249267,0.0005178711,0.003653837,0.01229751,0.002841995,0.004740397,0.001083658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009284053,"about_ca_system_score_gemma":0.001477104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002900196,"about_ca_topic_score_gemma":0.002003579,"domain_scores_codex":[0.9972069,0.0007361827,0.0001520414,0.0003682455,0.001130802,0.0004059456],"domain_scores_gemma":[0.992453,0.002724254,0.0003474038,0.002682819,0.001290837,0.0005016149],"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.0009655048,0.0002548091,0.004619846,0.0009577934,0.0002405728,0.0002753458,0.001401454,0.07101655,0.02079394,0.4464516,0.03453606,0.4184866],"study_design_scores_gemma":[0.0001145926,0.0002389335,0.001137522,0.0003519886,0.0001310325,0.0002844229,0.0005678135,0.3165948,0.01956395,0.6127646,0.04810461,0.0001456355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06354129,0.03829704,0.8436385,0.03015547,0.002940093,0.0001034009,0.0001815319,0.004583232,0.01655953],"genre_scores_gemma":[0.8988123,0.007834743,0.07454379,0.002617292,0.002170021,0.0001019587,0.000155339,0.001106867,0.01265766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004481284,"threshold_uncertainty_score":0.02065104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204354299","doi":"","title":"A Data Discovery Platform Empowered by Knowledge GraphTechnologies: Challenges and Opportunities.","year":2021,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Knowledge extraction; Computer science; Data science; Knowledge management; Data mining","authors":[{"name":"Essam Mansour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2241899612295714,"gpt":0.3216368435572881,"spread":0.09744688232771662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01121473,0.0006647691,0.00113427,0.005595871,0.002279375,0.009866868,0.004000295,0.002536079,0.004012374],"category_scores_gemma":[0.01930998,0.0009371614,0.001182715,0.00732282,0.002171891,0.02057065,0.008293849,0.003648631,0.003478923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302148,"about_ca_system_score_gemma":0.005060351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00369212,"about_ca_topic_score_gemma":0.007509429,"domain_scores_codex":[0.9951439,0.001799107,0.0005061556,0.0006586167,0.001665306,0.0002268442],"domain_scores_gemma":[0.9811611,0.007809654,0.0006707755,0.006627701,0.002302397,0.00142837],"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.0003453619,0.0006385803,0.003486076,0.0009616516,0.0003266308,0.0007264086,0.000825921,0.008588339,0.009651171,0.4417422,0.09571669,0.436991],"study_design_scores_gemma":[0.00005338806,0.00006572019,0.0006128025,0.0003495199,0.00009962491,0.0003862936,0.0004718232,0.07500941,0.006944548,0.6422229,0.2737059,0.00007812567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006681268,0.001746543,0.9553997,0.01026071,0.0005118823,0.0002858862,0.0026212,0.01287586,0.009616979],"genre_scores_gemma":[0.04848458,0.002164298,0.931251,0.001904643,0.0002211382,0.0002742599,0.009752192,0.001114258,0.004833531],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01121473,"threshold_uncertainty_score":0.0593099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W10721341","doi":"10.5694/j.1326-5377.1999.tb123814.x","title":"Letter from the Research Track Co-Chair.","year":2011,"lang":"en","type":"letter","venue":"Very Large Data Bases","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Track (disk drive); Operating system","authors":[{"name":"Nick Koudas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2888122786995828,"gpt":0.3825250955688818,"spread":0.09371281686929894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632482,0.0006564482,0.0009884194,0.000663878,0.004548812,0.00531431,0.001250008,0.02795562,0.03298968],"category_scores_gemma":[0.01279811,0.0006876264,0.0009392108,0.000743677,0.00125689,0.00393425,0.001482468,0.02026253,0.0405535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003523317,"about_ca_system_score_gemma":0.006680154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01455444,"about_ca_topic_score_gemma":0.03216796,"domain_scores_codex":[0.9974647,0.0005245795,0.0001726883,0.0004434325,0.0008663308,0.0005283472],"domain_scores_gemma":[0.9959744,0.001525494,0.0001699151,0.0001548965,0.001242372,0.0009329679],"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.00003117084,0.000008076226,0.0001148649,0.000005940316,0.000002187307,0.0000799016,0.000009893104,0.00001415886,0.00003107535,0.0005947556,0.9970762,0.002031964],"study_design_scores_gemma":[0.00005957926,0.00003625079,0.0009757918,0.00007538638,0.00001168295,0.0002480699,0.0002592639,0.0003327095,0.0002356304,0.003091172,0.9946393,0.00003514107],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"editorial","genre_scores_codex":[0.0004362123,0.001196214,0.0003143848,0.944141,0.01967332,0.00005076905,0.0008773917,0.0001488818,0.03316186],"genre_scores_gemma":[0.003988091,0.0008336246,0.0005520818,0.8109338,0.008468904,0.0001193468,0.0004401849,0.0001237594,0.1745403],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.03298968,"threshold_uncertainty_score":0.1103615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400495833","doi":"","title":"Composing Scalability for Transactions on Multicore Platforms.","year":2013,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Multi-core processor; Scalability; Computer science; Distributed computing; Computer architecture; Parallel computing; Database","authors":[{"name":"Anastasia Ailamaki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05550861582558886,"gpt":0.2846928815528709,"spread":0.229184265727282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004450101,0.001072083,0.001250161,0.0007368455,0.00170799,0.002384457,0.002650805,0.001215741,0.004334752],"category_scores_gemma":[0.01310141,0.0009499743,0.001089841,0.001028913,0.001507243,0.005898638,0.003380731,0.002621416,0.001366515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081835,"about_ca_system_score_gemma":0.00196962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003300982,"about_ca_topic_score_gemma":0.005313986,"domain_scores_codex":[0.9960532,0.001038915,0.0003971663,0.0005562151,0.001382007,0.0005724023],"domain_scores_gemma":[0.9899675,0.003304717,0.0003384571,0.004390729,0.001365198,0.0006335147],"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.001865035,0.0007306879,0.0102917,0.001082996,0.0007152211,0.0009832988,0.00156483,0.2306527,0.08514099,0.1835541,0.04523125,0.4381871],"study_design_scores_gemma":[0.0001706631,0.0002846106,0.001270347,0.00008147021,0.0001717717,0.0002297869,0.0003593428,0.7785963,0.029275,0.1707567,0.01874625,0.00005763488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.126474,0.00286221,0.8392584,0.001591834,0.0009278546,0.0005051701,0.0004709817,0.008802064,0.01910733],"genre_scores_gemma":[0.6199003,0.0009074069,0.3671966,0.0003468246,0.0004912307,0.0005109014,0.00136159,0.001163828,0.008121309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004450101,"threshold_uncertainty_score":0.02353466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}