{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":585,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":585,"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":"1b68a705d3ad","filters":{"topic":"Advanced Data Storage Technologies"}},"results":[{"id":"W2110322986","doi":"10.1145/2078861.2078864","title":"A study of practical deduplication","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":472,"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; Data deduplication; Backup; Computer file; Versioning file system; Database; Metadata; Operating system; File system; Journaling file system; Torrent file; Redundancy (engineering); Unix file types; Block (permutation group theory); Stub file","retraction":null,"screen_n_in":null,"score":{"opus":0.06082571660711811,"gpt":0.3419166987417186,"spread":0.2810909821346005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958136,0.0001113029,0.0001376202,0.0001742703,0.0001100062,0.00001889547,0.0007880511,0.00006254161,0.00001571376],"category_scores_gemma":[0.0001369063,0.0001050537,0.00003560785,0.0005375689,0.00004778194,0.001290186,0.00004055208,0.0002289246,0.00006744152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006321313,"about_ca_system_score_gemma":0.00002401309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001340181,"about_ca_topic_score_gemma":0.000007078559,"domain_scores_codex":[0.9990178,0.00005531864,0.0001993531,0.0002455818,0.000260589,0.000221303],"domain_scores_gemma":[0.9976996,0.0002326504,0.0001021924,0.001851934,0.00005049169,0.00006309478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001380668,0.02471308,0.001933347,0.0000554769,0.0003104922,0.00006853678,0.01583331,0.003953434,0.01031769,0.08639187,0.001641346,0.8546433],"study_design_scores_gemma":[0.02070662,0.02351654,0.1527471,0.00029057,0.001196522,0.001954351,0.06600766,0.01999517,0.5010775,0.07743838,0.1266074,0.00846222],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1119577,0.00003453527,0.8865945,0.0004677094,0.0001988481,0.0002536333,0.000005291153,0.0003666976,0.000121039],"genre_scores_gemma":[0.8258139,0.000006689319,0.1740101,0.00004973008,0.00001226138,0.00006866473,7.898648e-7,0.000007440556,0.00003049583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8461812,"threshold_uncertainty_score":0.4283966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980726110","doi":"10.1016/j.cpc.2006.11.010","title":"A standard format for Les Houches Event Files","year":2006,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":464,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Computer science; Programming language; XML; Event (particle physics); Fortran; Parsing; Information retrieval; Operating system; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03850612663368104,"gpt":0.2914858382341675,"spread":0.2529797116004864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001117812,0.0001622408,0.0001871751,0.00006360389,0.0005132436,0.0001693373,0.003605036,0.00005252093,8.005997e-7],"category_scores_gemma":[0.0000144511,0.0001621776,0.0001045389,0.0003123881,0.000203004,0.0008022262,0.002336547,0.0001602972,0.00001365508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008382297,"about_ca_system_score_gemma":0.00004515391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002320974,"about_ca_topic_score_gemma":0.00002767655,"domain_scores_codex":[0.999036,0.00003995072,0.0002651985,0.0002593696,0.0001470628,0.0002524007],"domain_scores_gemma":[0.9958814,0.0003710127,0.0001544508,0.003397985,0.0001667392,0.00002844431],"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.000001658003,0.00008977932,0.00003874926,0.00001138333,0.00001148215,2.680912e-7,0.000115332,0.001518724,0.00008120641,0.7676757,0.0121507,0.218305],"study_design_scores_gemma":[0.0002781007,0.00007181494,0.0001968,0.00002807406,0.000007095621,0.000003255067,0.00002377757,0.5431432,0.0008320234,0.3585423,0.09663994,0.0002336277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002372022,0.0005327917,0.9955442,0.001824663,0.00009918272,0.0003326289,0.0001268566,0.0008825243,0.000419966],"genre_scores_gemma":[0.1345049,0.00006733057,0.8648871,0.00008436161,0.00008495905,0.0001728309,0.000158285,0.00001356726,0.0000266153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5416245,"threshold_uncertainty_score":0.6699113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119092821","doi":"10.1145/2366231.2337161","title":"RAIDR","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":449,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Dram; Memory controller; Computer science; Row; Dynamic random-access memory; CAS latency; Embedded system; Universal memory; Static random-access memory; Computer hardware; Overhead (engineering); Memory refresh; Controller (irrigation); Data retention; Semiconductor memory; Operating system; Computer memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01983698611201415,"gpt":0.2647596643035801,"spread":0.244922678191566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002942983,0.0003609313,0.0003230135,0.0003337623,0.0001925388,0.0001465712,0.005187226,0.0001369093,0.00001948426],"category_scores_gemma":[0.0002941919,0.0003024271,0.0001264599,0.0007180988,0.0001738227,0.001047228,0.005303912,0.0006561797,0.0002884722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007140882,"about_ca_system_score_gemma":0.00004663143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691806,"about_ca_topic_score_gemma":0.000009732431,"domain_scores_codex":[0.9973177,0.0001300853,0.000318344,0.0006582415,0.0004960184,0.001079585],"domain_scores_gemma":[0.995487,0.0005580849,0.0001153637,0.003499665,0.00005672851,0.0002831291],"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.000006381702,0.0000845375,0.001315961,0.00001407203,0.00002743816,0.00002404227,0.001234322,0.0004621019,0.0009043938,0.03234402,0.01062567,0.952957],"study_design_scores_gemma":[0.001156747,0.0004671775,0.007675631,0.00006193938,0.00001728825,0.0006520096,0.00003421797,0.005830993,0.009740255,0.1870111,0.7858293,0.001523322],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00665709,0.0004765376,0.9839376,0.004688188,0.001111489,0.0002972287,0.000006344951,0.001859323,0.0009662635],"genre_scores_gemma":[0.2117402,0.00001625932,0.7855853,0.001815913,0.0007097335,0.00003288001,0.000009976137,0.00002584347,0.00006384222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9514337,"threshold_uncertainty_score":0.9999428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103315535","doi":"10.1145/1416944.1416947","title":"An analysis of data corruption in the storage stack","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":284,"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":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; National Science Foundation","keywords":"Checksum; Computer science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.08433212693739993,"gpt":0.3310794201340044,"spread":0.2467472931966045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004890747,0.000168223,0.0002899964,0.0007923603,0.0002076209,0.00003831371,0.005673131,0.00009652583,0.00002997933],"category_scores_gemma":[0.00006882432,0.0001367648,0.00007806792,0.003172958,0.0001813359,0.002266901,0.00007439893,0.0003638344,0.0000138379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008760113,"about_ca_system_score_gemma":0.00005260222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001530236,"about_ca_topic_score_gemma":0.0003837316,"domain_scores_codex":[0.9981834,0.0001670536,0.0003269193,0.0006140639,0.0004689232,0.0002396184],"domain_scores_gemma":[0.9927666,0.0002921829,0.0001397528,0.006706207,0.00005497302,0.00004030119],"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.0001585514,0.003946432,0.002433568,0.00004356106,0.0007881441,0.000794809,0.01362443,0.5685778,0.0051793,0.009063963,0.0008522413,0.3945372],"study_design_scores_gemma":[0.001597577,0.00113976,0.09934744,0.00004083991,0.0006488963,0.0001282634,0.003835082,0.879375,0.002395781,0.002880692,0.007409712,0.001200906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1456865,0.00005549269,0.8531781,0.0002921151,0.00009434967,0.0001582801,0.00027818,0.000221269,0.00003570264],"genre_scores_gemma":[0.9229681,0.0001150728,0.0766274,0.0001289447,0.0000081575,0.00001960489,0.0001000862,0.000008797112,0.00002376955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7772817,"threshold_uncertainty_score":0.9997066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072541977","doi":"10.1109/icde.2013.6544839","title":"Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":271,"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":"National Technical University of Athens; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Translation lookaside buffer; Joins; Parallel computing; Cache; Hash function; Hash join; Join (topology); Computer hardware; Physical address; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.09762164541659316,"gpt":0.3044105359448007,"spread":0.2067888905282076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001661823,0.0001964662,0.0001510136,0.0001472649,0.0003399108,0.0002844424,0.002124702,0.00007198277,0.00006526528],"category_scores_gemma":[0.0002962699,0.000128337,0.00004692975,0.0004762856,0.00007320794,0.0008185611,0.001323535,0.0002904336,0.001682873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008664409,"about_ca_system_score_gemma":0.00003596854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001127151,"about_ca_topic_score_gemma":0.0001343066,"domain_scores_codex":[0.9985278,0.00002577919,0.0001907867,0.0005258433,0.0002820803,0.0004477092],"domain_scores_gemma":[0.9978865,0.0001711322,0.00006395682,0.001726093,0.00006368193,0.00008863579],"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.000004444351,0.0001329148,0.0003117126,0.00002235862,0.00003694121,0.00008648124,0.002586675,0.006642348,0.01055475,0.1696026,0.08891606,0.7211027],"study_design_scores_gemma":[0.00277382,0.001209796,0.02684815,0.0005786081,0.00002559177,0.0002023256,0.02070295,0.708239,0.02737067,0.0470113,0.1614905,0.00354732],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01012975,0.00003762185,0.9773249,0.007883632,0.0003084476,0.0004961121,0.000005674528,0.001480017,0.002333855],"genre_scores_gemma":[0.5227963,0.000005643816,0.4707901,0.003912081,0.00002789255,0.00009893422,0.000002829379,0.00001803531,0.002348281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7175553,"threshold_uncertainty_score":0.9990944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074881976","doi":"10.1145/2806887","title":"The RAMCloud Storage System","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung; Defense Advanced Research Projects Agency; NetApp; National Science Foundation; VMware; Cisco Systems; Semiconductor Research Corporation","keywords":"Computer science; Backup; Polling; Latency (audio); Operating system; Dram; Computer network; Computer data storage; RAID; Storage area network; Auxiliary memory; Server; File server; Converged storage; Data loss; Information repository; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.03451363106089021,"gpt":0.2502271501895691,"spread":0.2157135191286789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221936,0.0002619254,0.0002712655,0.0001546261,0.000552458,0.0006083895,0.003964731,0.0001244723,3.828855e-7],"category_scores_gemma":[0.00003373562,0.0001860783,0.00009301765,0.0006265228,0.0001089848,0.0006757994,0.0001287798,0.0003576258,0.0003167256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003671808,"about_ca_system_score_gemma":0.00009315894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005874124,"about_ca_topic_score_gemma":0.00001253075,"domain_scores_codex":[0.9978217,0.0002022335,0.0004110311,0.0005636074,0.000560811,0.0004406127],"domain_scores_gemma":[0.9955403,0.0004369747,0.0001583623,0.003514751,0.0001814446,0.0001681332],"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.00005027921,0.0002302151,0.00001676804,0.0001394321,0.0002589378,0.0003015637,0.001439195,0.2331366,0.00005521445,0.2558255,0.03590385,0.4726424],"study_design_scores_gemma":[0.001223617,0.0006349955,0.00004312439,0.0002177773,0.00002398148,0.0007411485,0.001415809,0.7140198,0.0004264818,0.001607825,0.2788675,0.000777931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003792779,0.0005048951,0.9839557,0.0009781022,0.01097472,0.0004296129,0.00001386835,0.002487347,0.0002764704],"genre_scores_gemma":[0.8641123,0.00002093419,0.1346343,0.0001009038,0.0004076988,0.0001862548,0.000002813725,0.00003315565,0.0005016654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.863733,"threshold_uncertainty_score":0.7588053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406955896","doi":"10.14778/2732219.2732227","title":"Multi-core, main-memory joins","year":2013,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":247,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Hash join; Joins; Merge sort; Parallel computing; Join (topology); sort; Merge (version control); Hash function; Merge algorithm; SIMD; Theoretical computer science; Sorting algorithm; Database; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02508474588165716,"gpt":0.2397200588904825,"spread":0.2146353130088254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533138,0.0001712422,0.0001798211,0.0001008997,0.0001148744,0.00008625915,0.002377629,0.00005808849,0.00001778731],"category_scores_gemma":[0.0002036774,0.000114009,0.00008094415,0.0004083772,0.0001604684,0.0009050202,0.001970917,0.000181897,0.00008834002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070652,"about_ca_system_score_gemma":0.00002149247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005671849,"about_ca_topic_score_gemma":0.000001836605,"domain_scores_codex":[0.9986787,0.000002545661,0.0002637907,0.0003662337,0.0003469688,0.0003417549],"domain_scores_gemma":[0.9990351,0.00002954086,0.000246015,0.0004837526,0.0001519597,0.00005363136],"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.000005622714,0.000372277,0.002475321,0.000132,0.00006200668,0.00000252169,0.001093522,0.00004898954,0.7358164,0.1632742,0.03409733,0.06261987],"study_design_scores_gemma":[0.00126318,0.0001760992,0.01330714,0.0001462955,0.00001930143,0.00006153323,0.000941706,0.01063828,0.8745214,0.09271867,0.005639162,0.0005671781],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8213486,0.0009483462,0.1331439,0.01520786,0.002027973,0.005024507,0.00004097075,0.003246342,0.01901154],"genre_scores_gemma":[0.7174404,0.00003140084,0.2813375,0.000275948,0.00002286394,0.000148039,3.528418e-7,0.00001224741,0.0007312035],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1481936,"threshold_uncertainty_score":0.4649151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1574055853","doi":"10.5555/1855511.1855519","title":"Extending SSD lifetimes with disk-based write caches","year":2010,"lang":"en","type":"article","venue":"File and Storage Technologies","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":228,"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; Cache; Operating system; Parallel computing; Griffin; Latency (audio); Page cache; CPU cache; Cache algorithms; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008307244006538324,"gpt":0.2178177840751993,"spread":0.209510540068661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001397048,0.0003137605,0.0002980767,0.0003788485,0.0003135099,0.0002212495,0.001642637,0.0002966366,0.00004983261],"category_scores_gemma":[0.0005202545,0.0002379988,0.00003982346,0.0006566343,0.0007735491,0.0009191812,0.0009033871,0.0007273793,0.00002663192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002750793,"about_ca_system_score_gemma":0.00005276761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001701018,"about_ca_topic_score_gemma":0.00004634719,"domain_scores_codex":[0.9983433,0.00001427143,0.0001991589,0.0007084635,0.0002491018,0.0004857269],"domain_scores_gemma":[0.9979312,0.0002564201,0.0001471895,0.001558639,0.00005764711,0.00004895096],"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.00003486226,0.0001631179,0.003820489,0.00009385651,0.0000559914,0.0006232509,0.0002197838,0.0001221973,0.01666336,0.1375475,0.01467454,0.825981],"study_design_scores_gemma":[0.003654359,0.00298707,0.01974958,0.0006248462,0.0001068898,0.0008705898,0.006258252,0.06034394,0.3300888,0.1194745,0.4499306,0.005910528],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2062654,0.001999094,0.7545641,0.006191369,0.0004459405,0.0007089076,0.0004924182,0.02787377,0.001458949],"genre_scores_gemma":[0.6950491,0.00005769751,0.3045412,0.00005586778,0.00001505661,0.0001077641,0.00002476822,0.00001833912,0.0001302531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8200705,"threshold_uncertainty_score":0.9705308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2585172182","doi":"10.5555/1960475.1960476","title":"A study of practical deduplication","year":2011,"lang":"en","type":"article","venue":"File and Storage Technologies","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":193,"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":"Data deduplication; Computer science; Backup; Computer file; Database; Metadata; Versioning file system; Operating system; File system; Redundancy (engineering); Torrent file; Journaling file system","retraction":null,"screen_n_in":null,"score":{"opus":0.05731833433081558,"gpt":0.2888952090245492,"spread":0.2315768746937337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001007146,0.0001251251,0.0001872837,0.0002133636,0.00007537093,0.00002082864,0.0008199154,0.0001276349,0.00002202774],"category_scores_gemma":[0.0006102265,0.0001063203,0.00001741085,0.0004685943,0.000208771,0.0006485566,0.001047222,0.0001948308,0.00001125137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001703791,"about_ca_system_score_gemma":0.00001936884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002513647,"about_ca_topic_score_gemma":0.00001054577,"domain_scores_codex":[0.999081,0.00001931115,0.0002022685,0.0003758167,0.000142133,0.0001795333],"domain_scores_gemma":[0.9985246,0.0001045527,0.0001552162,0.001142235,0.00005709849,0.00001627037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004025848,0.002108176,0.004191218,0.00005257761,0.00009391186,0.0003916921,0.007135938,0.000004057983,0.001981858,0.4212482,0.01723243,0.5455196],"study_design_scores_gemma":[0.003733998,0.01401952,0.08683333,0.0001771156,0.0001427491,0.0008272717,0.1572216,0.006188385,0.1696017,0.5311795,0.02710537,0.002969432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4671253,0.0005661758,0.5216766,0.000513075,0.0001072154,0.0007821167,0.00006010166,0.007160636,0.002008815],"genre_scores_gemma":[0.8018571,0.000039654,0.1979677,0.000009405079,0.000001917227,0.0000969832,0.000002552387,0.000004946992,0.00001973528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5425502,"threshold_uncertainty_score":0.4335614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3207452942","doi":"10.1145/3483840","title":"RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":186,"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; Key (lock); Replication (statistics); Scale (ratio); Associative array; Resource (disambiguation); Computer security; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01274215337074739,"gpt":0.2505925680515165,"spread":0.2378504146807691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001975874,0.0001671705,0.0002261641,0.0003179193,0.0002302594,0.0000349019,0.001029712,0.0001178035,0.00001557862],"category_scores_gemma":[0.00004646368,0.0001916942,0.00005928701,0.001231597,0.00005324894,0.0006470005,0.0001117711,0.0003082681,0.00002175882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005124796,"about_ca_system_score_gemma":0.0003385742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000258187,"about_ca_topic_score_gemma":0.0005274045,"domain_scores_codex":[0.9984807,0.00005899937,0.0003600061,0.000490853,0.0003088846,0.0003005896],"domain_scores_gemma":[0.998112,0.0001199046,0.0001040535,0.001488701,0.0001273051,0.00004798805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008235233,0.004257041,0.002720125,0.0008436777,0.0002140481,0.0002568332,0.02386614,0.1335812,0.03443074,0.1374655,0.0002956259,0.6619868],"study_design_scores_gemma":[0.006719433,0.000560175,0.03900817,0.001393285,0.0001358573,0.000324507,0.0299583,0.07662113,0.4849783,0.1146064,0.2415418,0.004152612],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02125657,0.0004589422,0.9770057,0.0003671948,0.0001365649,0.0002406598,0.00004535655,0.0003634661,0.0001255114],"genre_scores_gemma":[0.5888273,0.0000395751,0.4107378,0.00003706215,0.000008631281,0.0001691599,0.000008266215,0.00001152341,0.000160705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6578341,"threshold_uncertainty_score":0.7817063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2277915713","doi":"","title":"Flash reliability in production: the expected and the unexpected","year":2016,"lang":"en","type":"article","venue":"File and Storage Technologies","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":184,"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; Reliability (semiconductor); Metric (unit); Flash (photography); Field (mathematics); Production (economics); Reliability engineering; Range (aeronautics); Scale (ratio); Real-time computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008727170278136739,"gpt":0.2113058499761565,"spread":0.2025786796980198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003637015,0.0001803402,0.0002231276,0.0001387491,0.0002481667,0.00008173898,0.001226103,0.0001483084,0.00001244538],"category_scores_gemma":[0.003850959,0.00007549809,0.00002564097,0.000782663,0.001935661,0.0005993869,0.001433443,0.0002878488,0.000009716497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005399572,"about_ca_system_score_gemma":0.00002121961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001765559,"about_ca_topic_score_gemma":0.00004683758,"domain_scores_codex":[0.9986502,0.00008596651,0.0002273569,0.000586189,0.00016455,0.0002857619],"domain_scores_gemma":[0.9975211,0.0006736569,0.0001058904,0.001630584,0.00005559579,0.00001319299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009717482,0.00007420188,0.001797095,0.00002863421,0.00002823645,0.00005787348,0.001695248,0.0000131457,0.003160614,0.1765886,0.03743336,0.7790258],"study_design_scores_gemma":[0.004366136,0.0004098761,0.03507878,0.00032756,0.0000255055,0.0003421837,0.01077531,0.002219923,0.03201387,0.7661018,0.1469497,0.001389422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6725746,0.00930959,0.1036655,0.1966174,0.0006913843,0.002294861,0.0001461857,0.01395172,0.0007488268],"genre_scores_gemma":[0.9847454,0.0008958662,0.01355266,0.00004739187,0.00001653936,0.0003448926,0.000002130012,0.000008264064,0.0003868655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7776364,"threshold_uncertainty_score":0.7132024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3146736181","doi":"10.1109/isca.2012.6237001","title":"RAIDR: Retention-aware intelligent DRAM refresh","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Dram; Memory controller; Computer science; Dynamic random-access memory; CAS latency; Universal memory; Row; Embedded system; Memory refresh; Static random-access memory; Data retention; Computer hardware; Overhead (engineering); Controller (irrigation); Semiconductor memory; Computer memory; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03751167548146427,"gpt":0.2803923666801232,"spread":0.2428806911986589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001828996,0.0001130385,0.000102296,0.00009854095,0.00008644207,0.00006210159,0.001123863,0.00007046259,0.00007827472],"category_scores_gemma":[0.0000879166,0.00009302401,0.00004331892,0.0003410486,0.00006389421,0.001575351,0.0008710917,0.0001357322,0.0006836647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006621291,"about_ca_system_score_gemma":0.00001327804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008708224,"about_ca_topic_score_gemma":0.000003808639,"domain_scores_codex":[0.9989739,0.00001927026,0.0001707093,0.0002614282,0.000200278,0.0003744004],"domain_scores_gemma":[0.9986629,0.00004743161,0.00005674711,0.001102778,0.0000472956,0.00008285949],"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.000001991,0.00008263437,0.001292456,0.000009093665,0.00001243133,0.000007886589,0.0002218068,0.00001655534,0.0006512394,0.7447512,0.03452722,0.2184255],"study_design_scores_gemma":[0.0004216937,0.0002183937,0.002765731,0.00005235505,0.00001432371,0.0001188361,0.000844144,0.01182081,0.1240504,0.1249658,0.7335398,0.001187754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001793276,0.0002918409,0.9904369,0.0007379704,0.0005646279,0.0001054031,0.000003369535,0.00153099,0.004535668],"genre_scores_gemma":[0.6788573,0.00004683942,0.3183432,0.0002684593,0.00005840066,0.00001848194,0.000007798894,0.000008337354,0.002391165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6990125,"threshold_uncertainty_score":0.8787355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098130516","doi":"10.1109/sfcs.2000.892128","title":"Cache-oblivious B-trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":157,"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":"Block size; Data structure; Auxiliary memory; Binary logarithm; B-tree; Computer science; Parallel computing; Tree (set theory); Combinatorics; Upper and lower bounds; Block (permutation group theory); Memory hierarchy; Cache; Cache-oblivious algorithm; Amortized analysis; CPU cache; Mathematics; Key (lock); Cache algorithms; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02711836908716011,"gpt":0.2341770090695675,"spread":0.2070586399824074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003878982,0.0000792199,0.00007418079,0.00007835812,0.00005528002,0.00006089804,0.001155207,0.00004052969,0.0001408599],"category_scores_gemma":[0.00006748973,0.00006461705,0.00002147617,0.0003204911,0.00005186714,0.0006574229,0.0004858706,0.00008245694,0.0008163166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002223309,"about_ca_system_score_gemma":0.000002697978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001106279,"about_ca_topic_score_gemma":0.00002050242,"domain_scores_codex":[0.9993248,0.000007898049,0.0000870682,0.0002510237,0.0001289377,0.00020027],"domain_scores_gemma":[0.9990246,0.00003965459,0.00002569792,0.0008593185,0.0000185984,0.0000320912],"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":[2.748363e-7,0.00006793067,0.0003213133,0.000002264602,0.0000069322,0.00007843112,0.0001790987,0.0000628881,0.0007869629,0.4384012,0.06893499,0.4911577],"study_design_scores_gemma":[0.0009934563,0.0004065581,0.002724678,0.00002330296,0.000009196813,0.0002988721,0.0002620792,0.2674094,0.04033962,0.1750647,0.5109098,0.001558304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001665879,0.0003507052,0.9649426,0.00197589,0.000142875,0.0000530807,0.000001287991,0.002319496,0.02854815],"genre_scores_gemma":[0.6656832,0.00004371333,0.3305731,0.000350947,0.00001666263,0.000007308843,4.888292e-7,0.000004610512,0.003319988],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6640173,"threshold_uncertainty_score":0.9999617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1905719725","doi":"10.5555/2750482.2750499","title":"A tale of two erasure codes in HDFS","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Erasure code; Distributed data store; Erasure; Overhead (engineering); Computer data storage; Replication (statistics); Code (set theory); Reliability (semiconductor); Distributed computing; Decoding methods; Operating system; Algorithm; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03712553885389133,"gpt":0.2965676975896702,"spread":0.2594421587357789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001588553,0.00005336836,0.0001040308,0.00009023921,0.000006867551,0.00001309895,0.0007540277,0.00002707489,0.000003640702],"category_scores_gemma":[0.0001466141,0.00004408606,0.00001098118,0.0003683132,0.00006027055,0.0004718071,0.0004118452,0.00006436796,0.0000220197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002715239,"about_ca_system_score_gemma":0.00003785989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000878136,"about_ca_topic_score_gemma":0.0001812365,"domain_scores_codex":[0.9994556,0.00001300573,0.0001159454,0.0001598894,0.0001372492,0.0001182911],"domain_scores_gemma":[0.9993359,0.00003280444,0.00003751343,0.0005282105,0.00004017491,0.00002541768],"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.000007459797,0.000138187,0.01257177,0.00001336673,0.000007418264,0.00007396349,0.0008588932,0.001757932,0.005662666,0.8690928,0.007878528,0.101937],"study_design_scores_gemma":[0.003108673,0.0004302264,0.003600674,0.00006628627,0.000003841526,0.00006033216,0.001058078,0.07293741,0.2297756,0.6717967,0.0164666,0.0006955305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05558479,0.0001590757,0.9380831,0.0003807232,0.00008025239,0.00006824239,0.000003216644,0.000342537,0.005298125],"genre_scores_gemma":[0.7051275,0.000002663433,0.2946853,0.00004137028,0.000003059896,0.000003586012,6.186702e-7,0.000001798834,0.0001341281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6495427,"threshold_uncertainty_score":0.1797777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4295520929","doi":"10.4230/lipics.disc.2023.38","title":"Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Registered memory; Interleaved memory; Operating system; Cache; Memory management; Memory map; Dram; Computer hardware; Embedded system; Scalability; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.1106115477356118,"gpt":0.2236952256091611,"spread":0.1130836778735493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000297959,0.0003246971,0.0002874951,0.0006504974,0.0002071434,0.0001529638,0.002098467,0.000235788,0.00001237594],"category_scores_gemma":[0.0001284054,0.0003942846,0.0001287228,0.001009472,0.00008557406,0.0004975692,0.004570604,0.0006572107,0.00004304239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007938345,"about_ca_system_score_gemma":0.0001330198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001967209,"about_ca_topic_score_gemma":0.0001634497,"domain_scores_codex":[0.9975771,0.00007389079,0.0002735315,0.001363759,0.0001651331,0.0005465448],"domain_scores_gemma":[0.9980711,0.00008814322,0.0002972941,0.001393088,0.00009247645,0.00005788598],"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.00001056204,0.00003179136,0.001764126,0.00007608716,0.00005469385,0.0003207757,0.0003214629,0.8028541,0.00005579037,0.1913538,0.0001554012,0.003001358],"study_design_scores_gemma":[0.0006699316,0.0001337265,0.001557264,0.0003059858,0.00003560742,0.000003497221,0.001015654,0.8857776,0.000241591,0.1085406,0.000962688,0.0007558289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1259341,0.00006091802,0.8714995,0.0001849069,0.000548095,0.0003937634,0.00007033097,0.00101405,0.0002943545],"genre_scores_gemma":[0.9922665,0.0001814006,0.00706496,0.00005707169,0.00003891208,0.000002041761,0.00009959844,0.00002506114,0.0002644001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8663324,"threshold_uncertainty_score":0.9998509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012550338","doi":"10.14778/3389133.3389134","title":"Dash","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hash function; Scalability; Emulation; Hash table; Factor (programming language); Double hashing; Table (database)","retraction":null,"screen_n_in":null,"score":{"opus":0.02138445553614614,"gpt":0.2242101176233977,"spread":0.2028256620872516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007203795,0.0000934175,0.0001155613,0.0000264413,0.00005675162,0.00004124529,0.002319901,0.00002752929,0.000004226365],"category_scores_gemma":[0.0002050888,0.00006256819,0.0000497191,0.0004225217,0.00007289151,0.000439658,0.001797208,0.0001153019,0.00001879037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003003384,"about_ca_system_score_gemma":0.00001177812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002610886,"about_ca_topic_score_gemma":1.164684e-7,"domain_scores_codex":[0.9991623,0.000001513839,0.0001537922,0.0002530019,0.0002625879,0.0001668248],"domain_scores_gemma":[0.9995285,0.00001435676,0.0001436229,0.0002039782,0.00006704888,0.00004251173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009833822,0.00005757588,0.001500656,0.00009057555,0.00002969021,0.000001509741,0.001278287,0.00003327442,0.1765566,0.7617239,0.02259623,0.03612184],"study_design_scores_gemma":[0.0003344827,0.0001359461,0.0005142897,0.00003400526,0.000008792299,0.000008631237,0.0002381814,0.002446759,0.9199743,0.04287207,0.03324641,0.0001861637],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2572214,0.001645049,0.3888936,0.2632277,0.001684886,0.003401158,0.00005580996,0.006458937,0.07741145],"genre_scores_gemma":[0.9240246,0.00002126965,0.07505194,0.0007989347,0.00002745344,0.00001913702,1.603173e-7,0.000005905706,0.0000505319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7434176,"threshold_uncertainty_score":0.4310992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138872609","doi":"10.1145/1837915.1837917","title":"Understanding latent sector errors and how to protect against them","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":135,"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; Redundancy (engineering); Data redundancy; Field (mathematics); Data reliability; RAID; Reliability engineering; Reliability (semiconductor); Risk analysis (engineering); Data science; Data mining; Database; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09323359745007599,"gpt":0.2628923816478992,"spread":0.1696587841978232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001602207,0.0001934467,0.000156217,0.0002199131,0.0003286751,0.0001636982,0.001001814,0.0001188086,0.00001685142],"category_scores_gemma":[0.0001001952,0.0001756635,0.00004622525,0.000507075,0.00009812331,0.0006491905,0.00006840431,0.0005571576,0.00003633671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000131542,"about_ca_system_score_gemma":0.00002860014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006337985,"about_ca_topic_score_gemma":0.00007653549,"domain_scores_codex":[0.9988338,0.00002517087,0.0001036731,0.0005040499,0.0002300084,0.0003033049],"domain_scores_gemma":[0.9983208,0.0001173124,0.00005172536,0.001359581,0.00002887948,0.0001216539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001360109,0.0005784007,0.0002951066,0.0001336932,0.0002394787,0.0004095142,0.005083422,0.008056994,0.3370772,0.07611509,0.002463598,0.5694115],"study_design_scores_gemma":[0.007989707,0.003880618,0.005912422,0.0006130149,0.0001855664,0.0009307247,0.006387199,0.05556318,0.5578302,0.2205646,0.1312722,0.008870655],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08005654,0.000006664321,0.9123327,0.005823895,0.0004447697,0.0003753866,0.0000259497,0.0008127884,0.0001213352],"genre_scores_gemma":[0.8236674,0.00001091082,0.1758921,0.0001963834,0.00001586037,0.00006444164,0.000001034965,0.0000163847,0.0001354367],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7436109,"threshold_uncertainty_score":0.7163351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146532238","doi":"10.1145/1352592.1352598","title":"Parallax","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":120,"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; Storage virtualization; Converged storage; Virtualization; Snapshot (computer storage); Computer data storage; Architecture; Object storage; Cache; Temporal isolation among virtual machines; Embedded system; Operating system; Information repository; Computer hardware; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0303635747919952,"gpt":0.2465893093168184,"spread":0.2162257345248232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000186277,0.00003920799,0.00004181207,0.00003180406,0.00005514922,0.000008854041,0.0007180764,0.00001922474,0.00001504254],"category_scores_gemma":[0.00002790216,0.00003137745,0.00001131977,0.0001635099,0.00004855607,0.0004291464,0.0002926245,0.00003998209,0.0003174133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001009915,"about_ca_system_score_gemma":0.00001097786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003876854,"about_ca_topic_score_gemma":0.000001089773,"domain_scores_codex":[0.9996227,0.000003224117,0.00004897057,0.000141074,0.00007573354,0.0001083249],"domain_scores_gemma":[0.9994102,0.0000165421,0.00001253247,0.0005318115,0.00001154042,0.00001736759],"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":[4.176765e-7,0.00001471331,0.0005878782,7.456009e-7,0.000002260226,0.0001244477,0.00006539356,0.00003802361,0.0004711048,0.9322414,0.0262161,0.04023755],"study_design_scores_gemma":[0.0007324733,0.0002281637,0.0135521,0.000007009446,0.000001756172,0.001185652,0.00006523717,0.02796223,0.08576713,0.3089103,0.5606241,0.0009639252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004829391,0.0000478369,0.9788892,0.0006505057,0.00005820615,0.00002440204,2.596556e-7,0.001367853,0.0141323],"genre_scores_gemma":[0.4368206,0.00002487573,0.5618892,0.0002250681,0.000005570329,0.000002971558,3.085363e-7,0.000001449243,0.001029988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6233311,"threshold_uncertainty_score":0.4079812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071417930","doi":"10.1145/1996130.1996153","title":"VMFlock","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":111,"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; Cloud computing; Scalability; Data deduplication; Virtual machine; Transfer (computing); Set (abstract data type); Distributed computing; Operating system; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.04499896530119912,"gpt":0.2384023861248156,"spread":0.1934034208236165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002856983,0.00003823046,0.00003530848,0.00003548581,0.00002207548,0.00001078251,0.0008916562,0.00002013429,0.00006163253],"category_scores_gemma":[0.00002226602,0.0000301287,0.00000997218,0.0001433942,0.0000266261,0.0004604456,0.0004040371,0.0000378513,0.0003796078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006808511,"about_ca_system_score_gemma":0.000005546413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009646778,"about_ca_topic_score_gemma":0.000002546721,"domain_scores_codex":[0.9996552,0.000003004852,0.00004735072,0.0001387579,0.00005188154,0.0001037315],"domain_scores_gemma":[0.9993566,0.000007624293,0.00001332264,0.0005934762,0.00001203163,0.0000169859],"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":[2.390938e-7,0.000008962464,0.0001500901,4.149386e-7,0.000001086994,0.00001055555,0.00007490291,2.788817e-7,0.0001339145,0.9375641,0.00204606,0.06000937],"study_design_scores_gemma":[0.0002000476,0.0001339614,0.003638487,0.000004139549,0.000001614702,0.00005864248,0.0001049438,0.0043178,0.1530832,0.7838612,0.0542178,0.0003781482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006700986,0.00001966193,0.9165245,0.00009861399,0.00007621705,0.00002253973,2.334022e-7,0.00123211,0.08135597],"genre_scores_gemma":[0.2910169,0.000002909833,0.7083407,0.000137793,0.000003218553,0.000002875776,1.27479e-7,0.000001526956,0.0004939242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2903468,"threshold_uncertainty_score":0.4879217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4246281707","doi":"10.1145/3187009.3164147","title":"Bztree","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":91,"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; Throughput; Block (permutation group theory); Non-volatile memory; Embedded system; Computer hardware; Tree (set theory); Code (set theory); Parallel computing; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01413647543843038,"gpt":0.2361726823367011,"spread":0.2220362068982707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001368277,0.00009753183,0.0001038119,0.00006071629,0.0001029935,0.00004246561,0.002358943,0.00003350996,0.000007083351],"category_scores_gemma":[0.0001487341,0.00006302792,0.00004454205,0.0004111288,0.0002318476,0.0004679766,0.001654632,0.00008501361,0.00003486345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004985317,"about_ca_system_score_gemma":0.00001290803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007601266,"about_ca_topic_score_gemma":0.000001409023,"domain_scores_codex":[0.9991196,0.000001583879,0.0001545431,0.0002483108,0.0002677566,0.0002081783],"domain_scores_gemma":[0.9992897,0.00001548792,0.0001565179,0.0003575581,0.0001554144,0.00002533844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000007385755,0.00006998602,0.001388867,0.00002693118,0.00002279775,5.060123e-7,0.0005411999,0.000001407235,0.1046511,0.8233912,0.01687775,0.05302091],"study_design_scores_gemma":[0.0001933735,0.0001360396,0.0009159349,0.00003526891,0.00000527878,0.00001260552,0.00009483996,0.0004750034,0.8715439,0.1050245,0.0214431,0.000120155],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5111469,0.000836374,0.252809,0.03106158,0.003842427,0.002538745,0.00003087176,0.004373182,0.1933609],"genre_scores_gemma":[0.9075059,0.00001186961,0.0919593,0.0001695065,0.00005144404,0.0000203187,9.228312e-8,0.000005695705,0.000275902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7668928,"threshold_uncertainty_score":0.4383541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111784404","doi":"10.1109/icdcs.1993.287729","title":"Disk cache replacement policies for network fileservers","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Workstation; Cache; Locality of reference; Server; Operating system; File server; TRACE (psycholinguistics); Locality; Cache algorithms; Simple (philosophy); Database; CPU cache; Parallel computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03998559026576486,"gpt":0.2634735135983115,"spread":0.2234879233325466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001083431,0.0001079122,0.000109464,0.00004272081,0.000136756,0.00006869009,0.001035668,0.00004651106,0.00008129104],"category_scores_gemma":[0.0001179175,0.00008943588,0.00004447244,0.0002877714,0.00005439773,0.0004640496,0.0005385521,0.00006287871,0.00005786102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005556077,"about_ca_system_score_gemma":0.000005005479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002343816,"about_ca_topic_score_gemma":0.00002660159,"domain_scores_codex":[0.9990479,0.00001014614,0.0001440978,0.0003101352,0.0001271088,0.0003605896],"domain_scores_gemma":[0.9987904,0.0001188988,0.00005572863,0.0009673809,0.00002886597,0.0000386814],"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.000003589262,0.00003265546,0.0002852245,0.000008504322,0.00001512074,0.000002771237,0.0001707252,0.002020925,0.00003590453,0.4281812,0.5326505,0.03659283],"study_design_scores_gemma":[0.0006805962,0.0003832926,0.000346536,0.0000186129,0.000008238628,0.00001154807,0.0002207509,0.2246345,0.002235651,0.05684614,0.7140983,0.0005157568],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000598155,0.0002447862,0.9890737,0.003708311,0.0001979869,0.0002451051,0.00001180597,0.001025038,0.004895119],"genre_scores_gemma":[0.1107296,0.0000896799,0.8796715,0.001147728,0.0001016462,0.0001345411,0.000009259121,0.00001290232,0.008103185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3713351,"threshold_uncertainty_score":0.364709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119951918","doi":"10.1145/3423137","title":"SSD-based Workload Characteristics and Their Performance Implications","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":88,"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; Workload; File system; Locality; Block (permutation group theory); Cover (algebra); Block size; Sensitivity (control systems); Computer data storage; Operating system; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.02264682567126836,"gpt":0.2452064427306575,"spread":0.2225596170593891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007814979,0.0001747326,0.0001689956,0.0001269901,0.0003523115,0.0001075036,0.000801487,0.00008796303,0.00002215143],"category_scores_gemma":[0.00006224948,0.0001644698,0.00004765468,0.0006036648,0.0001068815,0.0005157099,0.00004909615,0.0002984871,0.00003519834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006749136,"about_ca_system_score_gemma":0.0000895747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001677878,"about_ca_topic_score_gemma":0.000005343452,"domain_scores_codex":[0.998985,0.00003008395,0.0001828432,0.0004539694,0.0001063848,0.0002417129],"domain_scores_gemma":[0.9976725,0.0002081719,0.00006722529,0.001888674,0.00009319737,0.00007024463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000007671298,0.0001585036,0.000199974,0.00002232467,0.00002108871,0.00001740811,0.0001663681,0.0006343423,0.004440781,0.001780458,0.00007060581,0.9924805],"study_design_scores_gemma":[0.004429811,0.001298456,0.1648554,0.0007822562,0.0001500669,0.0008287051,0.001175753,0.1388317,0.4885173,0.03385752,0.160748,0.004525022],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05585645,0.0001797515,0.9397675,0.003142225,0.0001868642,0.00009943034,0.00009140246,0.0005768008,0.00009951927],"genre_scores_gemma":[0.8898857,0.0002643111,0.1091688,0.0004631166,0.00001387928,0.00006036769,0.00001209369,0.0000127169,0.0001189946],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9879555,"threshold_uncertainty_score":0.6706882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966142043","doi":"10.1109/cluster.2013.6702617","title":"Mercury: Enabling remote procedure call for high-performance computing","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Porting; Asynchronous communication; Remote procedure call; Distributed computing; Operating system; Interface (matter); Supercomputer; Network interface; Computer network; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01664069227391344,"gpt":0.2482181233688323,"spread":0.2315774310949188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001565925,0.0001681877,0.0001778169,0.0001089334,0.0002051994,0.0001525269,0.001348895,0.00008924735,0.000007501453],"category_scores_gemma":[0.000190426,0.0001388,0.00002661652,0.0003793659,0.00005585569,0.001460198,0.0006228586,0.0001564562,0.0001127124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000546745,"about_ca_system_score_gemma":0.00003928522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006902163,"about_ca_topic_score_gemma":0.000004811948,"domain_scores_codex":[0.9986423,0.000008022633,0.0002357876,0.0004882297,0.0001687732,0.0004569028],"domain_scores_gemma":[0.9988211,0.0001168734,0.0001059365,0.0007500278,0.0001533777,0.00005271612],"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.000003429054,0.00002651366,0.0001396597,0.0001260045,0.00001658454,0.000002957043,0.0001828678,0.001501597,0.006193085,0.08034018,0.00916743,0.9022997],"study_design_scores_gemma":[0.0004087466,0.000158066,0.0007252732,0.00006186845,0.000004025936,0.00002209821,0.00006881842,0.9199845,0.05184155,0.02149183,0.004792722,0.000440479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07439885,0.00006831323,0.9211111,0.001735359,0.0001915281,0.0005119786,0.000001725874,0.001619127,0.0003620175],"genre_scores_gemma":[0.504647,0.00001072929,0.4947364,0.0002991875,0.00003448829,0.0000114812,0.000003275634,0.000008796009,0.0002486851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9184829,"threshold_uncertainty_score":0.56601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238631751","doi":"10.1145/2820615","title":"RAIDShield","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"RAID; Computer science; Reliability (semiconductor); Reliability engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05061019071836591,"gpt":0.2835157450749115,"spread":0.2329055543565456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001667109,0.0001428297,0.0001354411,0.0002025971,0.0001152358,0.00006998049,0.001801838,0.00009071783,0.00002363627],"category_scores_gemma":[0.0001544559,0.0001355966,0.00005380659,0.0005845734,0.00007196923,0.0009167964,0.00004871959,0.0002910044,0.0004201934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083005,"about_ca_system_score_gemma":0.00005753672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001453711,"about_ca_topic_score_gemma":0.00001142918,"domain_scores_codex":[0.9989184,0.00003211428,0.0001453003,0.000370844,0.0002872566,0.0002460689],"domain_scores_gemma":[0.9976274,0.0001185058,0.00004466872,0.002030226,0.00005802493,0.0001211504],"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.00003851099,0.0003583382,0.00001803844,0.00001005273,0.00005207452,0.0002112451,0.001174438,0.00960164,0.0008362129,0.04050047,0.01047425,0.9367247],"study_design_scores_gemma":[0.00386587,0.002022752,0.0002654328,0.00007492263,0.00005479591,0.0003284398,0.001731258,0.01545644,0.07346743,0.3263264,0.5742157,0.002190575],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001782723,0.00008936052,0.9921748,0.002335585,0.0006178429,0.0001071502,0.00001338007,0.001398366,0.001480762],"genre_scores_gemma":[0.6482399,0.00001564568,0.3504592,0.0004146945,0.00002238527,0.00003527665,0.000001991455,0.00001264913,0.0007982454],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9345341,"threshold_uncertainty_score":0.5529469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144425137","doi":"10.1109/tst.2013.6522585","title":"Erasure coding for cloud storage systems: A survey","year":2013,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":69,"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":"Erasure; Computer science; Cloud computing; Cloud storage; Erasure code; Coding (social sciences); Operating system; Algorithm; Decoding methods; Mathematics; Programming language; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03159143285073643,"gpt":0.2828868283690719,"spread":0.2512953955183355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001401674,0.0002967783,0.0003925884,0.001560281,0.0007408877,0.0005669657,0.00539264,0.0002547757,0.000005320922],"category_scores_gemma":[0.001494583,0.0002458756,0.00003519189,0.006065007,0.002522538,0.00239614,0.001239037,0.0003659854,0.0001111017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000360468,"about_ca_system_score_gemma":0.0003457754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073754,"about_ca_topic_score_gemma":0.00003417101,"domain_scores_codex":[0.9967443,0.00004058199,0.0003636348,0.001196529,0.0005246004,0.001130306],"domain_scores_gemma":[0.9965124,0.0002626679,0.0002748064,0.002142229,0.0006955439,0.000112419],"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.00001439368,0.0001180433,0.003577329,0.00006345151,0.00002451692,0.00003791801,0.0002711535,0.001152065,0.06824885,0.8757243,0.003123179,0.04764482],"study_design_scores_gemma":[0.004422733,0.004365064,0.01031376,0.0006994584,0.00005502901,0.0017186,0.004433353,0.5084109,0.1510781,0.226726,0.08210862,0.005668389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07886256,0.0002717464,0.9134513,0.002475723,0.0007440501,0.0009702076,0.0000182199,0.00303805,0.0001681071],"genre_scores_gemma":[0.8438792,0.000009986066,0.1555802,0.00007927429,0.00002646864,0.0002849486,0.000003776246,0.00001879074,0.0001172874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7650167,"threshold_uncertainty_score":0.9999993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162634718","doi":"10.1109/wpc.2002.1021337","title":"Compression techniques to simplify the analysis of large execution traces","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Compression (physics); Data compression; Parallel computing; Algorithm; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.01720121962418062,"gpt":0.3068113514850135,"spread":0.2896101318608329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814092,0.00007885919,0.0001548461,0.0002567039,0.00008802766,0.00002907202,0.0008964595,0.00004771406,0.00001900415],"category_scores_gemma":[0.0001367989,0.00004738933,0.00005506472,0.001799316,0.00004032661,0.0003025692,0.0002785958,0.00007251526,0.000005195593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001949335,"about_ca_system_score_gemma":0.000009252527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367674,"about_ca_topic_score_gemma":0.0000294296,"domain_scores_codex":[0.9992198,0.00004736294,0.000167994,0.0002296202,0.0001779692,0.0001572742],"domain_scores_gemma":[0.9988409,0.00009469414,0.00007675908,0.0009077538,0.00005672053,0.0000231197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000003397367,0.0001043974,0.000628333,0.000005124703,0.00009864986,0.000002709882,0.0003534723,0.0007035031,0.03106566,0.8891434,0.004943784,0.07294755],"study_design_scores_gemma":[0.000096437,0.00009694848,0.003638549,0.00001429756,0.00008564785,0.00000289998,0.0004863132,0.01379511,0.8754001,0.01743523,0.08870479,0.0002436792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01192024,0.00006485375,0.9850153,0.0006271698,0.00002624684,0.0001426415,0.00000884842,0.0005021387,0.001692512],"genre_scores_gemma":[0.7534602,0.00001245466,0.2462207,0.0002277542,0.000001792187,0.00001550741,0.000002251568,0.000002134434,0.00005720172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8717082,"threshold_uncertainty_score":0.1932481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052678402","doi":"10.1109/infocom.2014.6847953","title":"Cooperative repair with minimum-storage regenerating codes for distributed storage","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":61,"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; Distributed data store; Construct (python library); Bandwidth (computing); Maintenance engineering; Computer data storage; Distributed computing; Computer network; Reliability engineering; Computer hardware; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01569603938885384,"gpt":0.2511052586258648,"spread":0.235409219237011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643636,0.0002601084,0.0003049703,0.00008607723,0.0003492943,0.0001577801,0.0009898532,0.00009848371,0.000007101046],"category_scores_gemma":[0.0006615866,0.0001928419,0.00005959545,0.0004621772,0.0001757894,0.0009132397,0.0003670353,0.000157378,0.0000128716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009616085,"about_ca_system_score_gemma":0.00006164114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001092224,"about_ca_topic_score_gemma":0.00006879128,"domain_scores_codex":[0.9982891,0.00006811705,0.0002706903,0.0007229649,0.0002281563,0.0004209529],"domain_scores_gemma":[0.9978552,0.000396178,0.0001502786,0.001258028,0.000260142,0.00008012538],"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.0000464995,0.00009833041,0.0001456036,0.00004188521,0.00006316901,0.00002545413,0.0003012379,0.01546372,0.003796615,0.9472023,0.02034741,0.01246773],"study_design_scores_gemma":[0.00141007,0.001379222,0.0001254264,0.00006467372,0.00001892603,0.00004275292,0.0003657035,0.9067249,0.0512642,0.003304691,0.034445,0.0008544713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.010907,0.00008514448,0.9844099,0.0006080648,0.0001246968,0.0004443737,0.0001152413,0.002742351,0.0005632328],"genre_scores_gemma":[0.403046,0.000002494744,0.5961418,0.0002377055,0.00004761231,0.0001199606,0.00007644157,0.00001652098,0.000311459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9438977,"threshold_uncertainty_score":0.7863864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157953951","doi":"10.1016/j.ipl.2007.08.034","title":"Compact Hilbert indices: Space-filling curves for domains with unequal side lengths","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Hilbert space; Dimension (graph theory); Mathematics; Hilbert manifold; Representation (politics); Grid; Reproducing kernel Hilbert space; Space (punctuation); Rigged Hilbert space; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01501040566804906,"gpt":0.2603718954116698,"spread":0.2453614897436208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005260255,0.0002000143,0.0001832653,0.0003346469,0.0003118305,0.0003187366,0.000773643,0.00006706703,9.39463e-7],"category_scores_gemma":[0.0001867155,0.0001660904,0.0000341851,0.0006076421,0.0001364395,0.008582957,0.00008772465,0.000199398,0.00001493871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001300907,"about_ca_system_score_gemma":0.00007886955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000128908,"about_ca_topic_score_gemma":0.000009886084,"domain_scores_codex":[0.9985164,0.000009525035,0.0004230453,0.0002050976,0.0003974451,0.0004484273],"domain_scores_gemma":[0.9987265,0.0002018088,0.0004805237,0.0003914232,0.0001351425,0.0000645691],"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.0002731575,0.0001243903,0.001875808,0.003507549,0.0001283907,0.00005290129,0.02087218,0.03737059,0.005920687,0.03704459,0.01829896,0.8745308],"study_design_scores_gemma":[0.01224632,0.001546316,0.007070099,0.008734868,0.0001826177,0.0005424321,0.01160329,0.2862026,0.1838399,0.009997192,0.4712189,0.006815449],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847613,0.0001236824,0.9731841,0.006396667,0.0000986366,0.0003366523,0.00001186418,0.0008425626,0.0005297109],"genre_scores_gemma":[0.6509243,0.0000141754,0.3404562,0.00845791,0.0000403113,0.00001416665,0.00007129673,0.00001347933,0.000008105495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8677154,"threshold_uncertainty_score":0.6772972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120546611","doi":"10.1109/mcom.2005.1404599","title":"Reliability and availability assessment of storage area network extension solutions","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Reliability (semiconductor); Extension (predicate logic); Reliability engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04949572754347941,"gpt":0.3121210339585831,"spread":0.2626253064151037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635651,0.0001460831,0.0002433784,0.00008703946,0.000358753,0.00003676552,0.002199503,0.00008162943,0.00001086489],"category_scores_gemma":[0.0003271728,0.0001420016,0.00004597178,0.000587941,0.0006590566,0.0008054017,0.002264824,0.0003364502,0.00001953804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001587921,"about_ca_system_score_gemma":0.00008130777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001111188,"about_ca_topic_score_gemma":0.0001154109,"domain_scores_codex":[0.9985083,0.0001901146,0.0004480068,0.0003982205,0.0001908647,0.000264486],"domain_scores_gemma":[0.9920477,0.0004892201,0.00022541,0.00689913,0.0002769063,0.00006168858],"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.00002394213,0.003108876,0.009999302,0.0001343746,0.00008997058,0.000005290084,0.0006084477,0.09608299,0.03632839,0.4664108,0.06963702,0.3175706],"study_design_scores_gemma":[0.0004646697,0.0001344636,0.1168238,0.00006545632,0.0000260765,0.00002141632,0.00003055478,0.7644624,0.0002743035,0.02913242,0.08818365,0.0003807434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02131728,0.001512885,0.9680144,0.006012206,0.000151528,0.0003667199,0.00003260912,0.0005481067,0.002044316],"genre_scores_gemma":[0.5411462,0.0004737478,0.4582227,0.00005465679,0.00001413251,0.00002907179,0.00001058797,0.000004621681,0.00004424854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6683794,"threshold_uncertainty_score":0.5790656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2418598077","doi":"10.1145/2908557","title":"Write Skew and Zipf Distribution","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Storage","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":56,"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":"Zipf's law; Computer science; Skew; Workload; Benchmark (surveying); Block (permutation group theory); Class (philosophy); Variety (cybernetics); Parallel computing; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01648730979935262,"gpt":0.2471854480837103,"spread":0.2306981382843577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009877777,0.0001372421,0.0001189694,0.00009191086,0.0001961716,0.00005293458,0.0007606256,0.00008305671,0.00002182132],"category_scores_gemma":[0.00008181501,0.0001004549,0.00003767958,0.0002870713,0.0001314715,0.000945597,0.00004670416,0.0001348132,0.00009779324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009940597,"about_ca_system_score_gemma":0.00001776483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006353173,"about_ca_topic_score_gemma":0.000007149531,"domain_scores_codex":[0.9990373,0.0000266088,0.0001374432,0.000402027,0.0001668997,0.0002296826],"domain_scores_gemma":[0.9984092,0.000186047,0.00004705958,0.001256287,0.00003523551,0.00006621284],"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.000009838845,0.00006352244,0.00001907534,0.000005791644,0.00001322962,0.00002297243,0.00005112758,0.00002013357,0.003859916,0.02134228,0.0004456442,0.9741465],"study_design_scores_gemma":[0.005640647,0.001620176,0.01122907,0.0004317242,0.00009423251,0.0004697603,0.0002213556,0.002676843,0.1563363,0.3208208,0.4977325,0.002726616],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008243836,0.00009594767,0.9866135,0.003723158,0.000212521,0.0001044735,0.0001600827,0.0007820768,0.00006448037],"genre_scores_gemma":[0.9345832,0.0002105366,0.06469554,0.0001040622,0.00001450264,0.00003012308,0.000004746073,0.000009269182,0.000348048],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9714199,"threshold_uncertainty_score":0.4096433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740361432","doi":"","title":"Cache Modeling and Optimization using Miniature Simulations.","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Computer science; Cache; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05473180800002823,"gpt":0.3096117099209188,"spread":0.2548799019208906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004160796,0.00005609374,0.0000550496,0.00004293002,0.0003785811,0.0002578871,0.0005074224,0.00005273353,0.000002212443],"category_scores_gemma":[0.0001628374,0.0000497052,0.000007022158,0.00004185786,0.00003594256,0.001512336,0.000506717,0.00005818984,7.30241e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001512673,"about_ca_system_score_gemma":0.00001128393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001907426,"about_ca_topic_score_gemma":0.000006210794,"domain_scores_codex":[0.9995847,0.000004546167,0.0000672392,0.0001886075,0.00006574637,0.00008911384],"domain_scores_gemma":[0.9991501,0.00001573138,0.00005492392,0.0007238642,0.000037705,0.00001765563],"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":[2.914251e-7,0.000002215451,0.00009799089,0.000001233761,0.000001307312,0.000001272502,0.00002745418,0.9870084,0.0001317126,0.008136827,0.000006690741,0.004584624],"study_design_scores_gemma":[0.00007029941,0.000003574968,0.00001978231,0.000004549903,0.000001665996,0.000003702226,0.00001205952,0.9955301,0.0001851882,0.004071743,0.00003096716,0.00006637401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01358349,0.00006095192,0.9854575,0.000397567,0.0000562254,0.00004945694,0.000001905639,0.0002236191,0.0001692124],"genre_scores_gemma":[0.4762143,0.000005015394,0.5237334,0.00002241643,0.000006092288,3.272052e-7,9.022482e-7,0.000001877485,0.00001573339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4626308,"threshold_uncertainty_score":0.2911778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098881120","doi":"10.1109/hotos.1999.798369","title":"Elephant: the file system that never forgets","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":56,"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":"Unix file types; File Control Block; Versioning file system; Computer science; Computer file; Stub file; File system; Operating system; File system fragmentation; Virtual file system; Self-certifying File System; SSH File Transfer Protocol; Directory; Fork (system call); Database; Device file; File server; Torrent file; Journaling file system","retraction":null,"screen_n_in":null,"score":{"opus":0.01822259221060348,"gpt":0.2212282270985724,"spread":0.2030056348879689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394011,0.0001018451,0.00009165169,0.00003774193,0.0001563803,0.00008094859,0.00127121,0.00004634866,0.0001199847],"category_scores_gemma":[0.0001060688,0.00005853352,0.00003229022,0.0002663427,0.00005364738,0.0008783333,0.0003229505,0.00009699172,0.0002714736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004534619,"about_ca_system_score_gemma":0.00002015619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009241692,"about_ca_topic_score_gemma":0.000007923856,"domain_scores_codex":[0.9991776,0.00003272997,0.00009575894,0.0002610126,0.0001766666,0.0002562819],"domain_scores_gemma":[0.9985978,0.0001430185,0.00005010979,0.001158479,0.00002439995,0.00002621283],"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":[3.236387e-7,0.000006789879,0.00003150961,0.000005391216,0.000004984999,0.00001568025,0.00004806406,0.00001615466,0.00005366209,0.9251723,0.06610593,0.0085392],"study_design_scores_gemma":[0.0002151361,0.00004283717,0.000292561,0.00002492268,0.000004036661,0.0001681095,0.001076701,0.007609564,0.03037697,0.01417082,0.9456972,0.0003210892],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000220961,0.0001981743,0.9686413,0.0005374098,0.0002622973,0.0001515504,0.00001688426,0.001356194,0.02861527],"genre_scores_gemma":[0.7291657,0.00001390633,0.2663599,0.0007095894,0.00001644062,0.00007142348,0.0000050207,0.00001181573,0.003646235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9110015,"threshold_uncertainty_score":0.3489335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001122975","doi":"10.5555/1251028.1251037","title":"Second-tier cache management using write hints","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":56,"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; Cache; Cache algorithms; Server; Cache invalidation; Operating system; Online transaction processing; Smart Cache; Cache pollution; Cache coloring; Database; Page cache; Computer network; Transaction processing; CPU cache; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.02654347480167777,"gpt":0.2700641872325278,"spread":0.24352071243085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001003902,0.0001083397,0.00009286244,0.0001234937,0.00007619989,0.0000772515,0.001056377,0.00004317726,0.0002399385],"category_scores_gemma":[0.000008661294,0.0000955439,0.0000267414,0.0002751547,0.00004124393,0.00107266,0.001035898,0.00009583744,0.0003729889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106592,"about_ca_system_score_gemma":0.000007429259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003954273,"about_ca_topic_score_gemma":0.00002083234,"domain_scores_codex":[0.9990885,0.00001012583,0.0001425689,0.0003408384,0.0001608882,0.0002570455],"domain_scores_gemma":[0.9989874,0.00001418962,0.00004313522,0.0008996982,0.00001986736,0.00003568573],"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.000001535493,0.00005534438,0.0001079835,0.00001516622,0.00003309902,0.00007181533,0.00009719563,0.001266709,0.001108309,0.2783712,0.01164037,0.7072313],"study_design_scores_gemma":[0.0005764029,0.00003959902,0.0006720474,0.00002359865,0.00001218145,0.00004826653,0.0002224383,0.1994082,0.02585087,0.02147141,0.7510036,0.0006713581],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008824881,0.00009811574,0.9626239,0.000595422,0.0001171613,0.0001038336,0.000002225119,0.0008597671,0.02677469],"genre_scores_gemma":[0.1664533,0.00001100726,0.8285246,0.0006395891,0.00002505027,0.000004893335,0.000001162724,0.000006291585,0.004334154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7393633,"threshold_uncertainty_score":0.4794143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886216368","doi":"","title":"Remote regions: a simple abstraction for remote memory","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Remote direct memory access; Remote procedure call; Abstraction; Operating system; Host (biology); Interface (matter); Memory map; Memory management; Registered memory; Shared memory; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.03903986553302542,"gpt":0.3095498869239078,"spread":0.2705100213908824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001841291,0.0001125741,0.0001116253,0.0001101455,0.0001706147,0.0000655988,0.0008794128,0.00008815144,0.0000162489],"category_scores_gemma":[0.0003914058,0.0001004893,0.00004531976,0.0002908327,0.0001256898,0.0008979187,0.000296481,0.00009192058,0.0001843203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006244455,"about_ca_system_score_gemma":0.00003190392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008565275,"about_ca_topic_score_gemma":0.00009396012,"domain_scores_codex":[0.9989781,0.00001029608,0.000176675,0.0004258374,0.0001346709,0.0002744148],"domain_scores_gemma":[0.9984095,0.0001257951,0.0001002651,0.001189898,0.0001332343,0.00004127882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001248976,0.00001251919,8.930162e-7,0.000009000893,0.000008271055,0.000006348379,0.00007174595,0.00001467106,0.002843464,0.06329776,0.04206813,0.8916547],"study_design_scores_gemma":[0.0003526012,0.0002558145,0.0000674523,0.00001478215,0.000004910569,0.00005459022,0.0001230976,0.1234806,0.04779,0.5894495,0.238132,0.0002747003],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007341852,0.00003245558,0.9890463,0.002121161,0.0003132702,0.0002630475,0.000004020937,0.001540881,0.005944675],"genre_scores_gemma":[0.05435364,0.00001992193,0.9432079,0.0005269404,0.0001434113,0.000002751753,0.000006240447,0.00001107485,0.001728158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.89138,"threshold_uncertainty_score":0.4097837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2793353921","doi":"10.1145/3158644","title":"Survey and Analysis of Kernel and Userspace Tracers on Linux","year":2018,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Linux kernel; User space; Overhead (engineering); Tracing; Operating system; Kernel (algebra); Stack (abstract data type); System call; Legacy system; Software; Embedded system; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09269364725147568,"gpt":0.35807121965084,"spread":0.2653775723993643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005370798,0.0005209869,0.002251378,0.0009992076,0.0001391625,0.0001359821,0.002588206,0.0003503219,0.000001513909],"category_scores_gemma":[0.003635109,0.0004512497,0.0002248004,0.003060106,0.0003975684,0.0002064878,0.003021073,0.000450643,0.000007978867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007478459,"about_ca_system_score_gemma":0.00009977924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000220348,"about_ca_topic_score_gemma":0.0002052677,"domain_scores_codex":[0.9955763,0.001783716,0.0006647013,0.001236352,0.0003323371,0.0004066275],"domain_scores_gemma":[0.9905185,0.005591735,0.0008856169,0.002742243,0.0001659302,0.00009604438],"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":[8.7461e-7,0.00002232708,0.001592372,0.0007208828,0.00067918,0.00000855406,0.00008065964,0.00002718276,8.164937e-8,0.0002784024,0.0001974506,0.996392],"study_design_scores_gemma":[0.002043993,0.002537026,0.3625016,0.02370374,0.009257202,0.0001567686,0.0001701664,0.1078044,0.00002867723,0.002254687,0.4795825,0.009959207],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0008089007,0.8075264,0.1906233,0.00002138734,0.0002118361,0.0002629219,0.0002011157,0.000320534,0.000023607],"genre_scores_gemma":[0.001874163,0.9540013,0.04382844,0.00001760518,0.00003077581,0.000003757153,0.0001665894,0.00003867456,0.00003870678],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9864329,"threshold_uncertainty_score":0.9997939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740127658","doi":"","title":"Proactive error prediction to improve storage system reliability","year":2017,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Advanced Data Storage Technologies","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":"University of Toronto","funders":"","keywords":"Reliability engineering; Computer science; Reliability (semiconductor); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03018740501013244,"gpt":0.2953837169928771,"spread":0.2651963119827447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005659557,0.0003184894,0.0003965507,0.0001316724,0.0006267584,0.000443253,0.004603156,0.0003075529,0.000006055579],"category_scores_gemma":[0.002403327,0.0002832709,0.00008618827,0.0002305225,0.0004169412,0.002562861,0.003242543,0.0006189838,0.000150633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003918656,"about_ca_system_score_gemma":0.0001616845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007733204,"about_ca_topic_score_gemma":0.00003072552,"domain_scores_codex":[0.9971317,0.0000720771,0.0004385145,0.001283904,0.0005226934,0.0005511345],"domain_scores_gemma":[0.9942353,0.0001156902,0.0003243665,0.004614791,0.0005183534,0.0001914479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00018437,0.0004337294,0.001054845,0.0001845726,0.00005275817,0.0002177104,0.0009785285,0.0001675099,0.03444136,0.7989787,0.005741155,0.1575648],"study_design_scores_gemma":[0.006340684,0.0112544,0.3068515,0.001797908,0.0002588005,0.0006486984,0.005441751,0.1546492,0.229056,0.1617087,0.1131291,0.008863233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02981686,0.000009971694,0.9590597,0.00203435,0.0006427237,0.001141758,0.0004630383,0.003813485,0.003018165],"genre_scores_gemma":[0.8787538,0.000002789234,0.1206684,0.00005334468,0.00005945428,0.0002371864,0.000005464901,0.0000159658,0.0002035754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8489369,"threshold_uncertainty_score":0.999962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024499203","doi":"10.1145/2656045.2656049","title":"Building high-performance smartphones via non-volatile memory","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":51,"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":"Ministry of Science and Technology of the People's Republic of China; Ministry of Education of the People's Republic of China; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Computer science; NAND gate; Embedded system; Non-volatile memory; Mobile device; Pace; Memory management; Factor (programming language); Flash memory; Operating system; Computer hardware; Semiconductor memory; Logic gate","retraction":null,"screen_n_in":null,"score":{"opus":0.007075853948216137,"gpt":0.2183643512071312,"spread":0.2112884972589151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020601,0.0001600228,0.0001733163,0.0001323375,0.0001323546,0.0000712144,0.001504599,0.00007346723,0.00002522197],"category_scores_gemma":[0.00006466883,0.0001356026,0.0000244868,0.000398853,0.00008017051,0.001359011,0.0008180175,0.0001504698,0.0003183218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003918795,"about_ca_system_score_gemma":0.00002287344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004054738,"about_ca_topic_score_gemma":0.000007907259,"domain_scores_codex":[0.9988348,0.00001525545,0.0001878571,0.0004202609,0.0002069468,0.0003348698],"domain_scores_gemma":[0.9985228,0.00009599826,0.00007882324,0.001208992,0.0000431611,0.00005027167],"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.000004785416,0.00003944925,0.0005155819,0.00003240078,0.00001198742,0.00000739653,0.0000840145,0.001992229,0.03470171,0.1669562,0.004213292,0.791441],"study_design_scores_gemma":[0.0003858161,0.0001638336,0.004092766,0.0000262416,0.000003749476,0.00002427036,0.00001167252,0.624111,0.3244922,0.03420697,0.01198711,0.0004943004],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1407223,0.0000161612,0.8531538,0.000255228,0.0004328092,0.0000796017,6.93048e-7,0.001169003,0.004170441],"genre_scores_gemma":[0.5573727,0.000003955724,0.4420382,0.0002271265,0.00003502989,0.000006088048,9.423516e-7,0.000006748394,0.0003091456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7909467,"threshold_uncertainty_score":0.5529714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987787762","doi":"10.1109/lcomm.2014.2332491","title":"An Efficient Binary Locally Repairable Code for Hadoop Distributed File System","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Distributed data store; Overhead (engineering); Code (set theory); Reliability (semiconductor); Locality; Binary number; Distributed computing; File system; Reduction (mathematics); Computational complexity theory; Distributed database; Parallel computing; Operating system; Algorithm; Arithmetic; Mathematics; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.02538186307851424,"gpt":0.2726882428469606,"spread":0.2473063797684464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004334497,0.000170792,0.0002035855,0.0001332858,0.0005798156,0.0001350826,0.00578893,0.0000771541,0.000002824107],"category_scores_gemma":[0.0001992747,0.0001739061,0.00006937013,0.0004929705,0.0002745336,0.0004260057,0.0006569237,0.0002094809,0.00004830831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079288,"about_ca_system_score_gemma":0.00003498697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002003761,"about_ca_topic_score_gemma":0.00001688333,"domain_scores_codex":[0.9985455,0.000178382,0.0003255703,0.0004352886,0.0001715517,0.0003436627],"domain_scores_gemma":[0.9916,0.0005786745,0.0001882685,0.007428827,0.0001282814,0.00007598251],"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.0000355882,0.0008196055,0.0001030962,0.0002008657,0.00008871064,0.0000134229,0.0005487893,0.2663165,0.06012159,0.2410322,0.4043917,0.02632795],"study_design_scores_gemma":[0.0002623587,0.00009772264,0.000108505,0.00006587901,0.000008923807,0.00001165366,0.00007805269,0.9142385,0.001407793,0.0001961204,0.08328299,0.000241525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003539346,0.00005787508,0.9851164,0.007372336,0.0001909014,0.0004215692,0.001044808,0.00216115,0.00009559252],"genre_scores_gemma":[0.5033386,0.000005271665,0.4949526,0.0007342253,0.00001920042,0.0003466577,0.0005757374,0.00001663616,0.0000111304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6479219,"threshold_uncertainty_score":0.9995902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574861468","doi":"10.14778/3025111.3025123","title":"Skipping-oriented partitioning for columnar layouts","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Flexibility (engineering); Workload; Column (typography); Big data; Analytics; Database; Data access; Distributed computing; Tuple; Data science; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01434291533108535,"gpt":0.2347680747610557,"spread":0.2204251594299704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020751,0.0001168111,0.0001429627,0.00006379831,0.000151284,0.00003933007,0.00121482,0.0000423013,0.000003604061],"category_scores_gemma":[0.0004520733,0.00006839052,0.00007458227,0.0002821614,0.0001203588,0.0006330317,0.0007509695,0.00005197767,0.000006788177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046297,"about_ca_system_score_gemma":0.0000190427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003421165,"about_ca_topic_score_gemma":0.00000130598,"domain_scores_codex":[0.9989153,0.00000251132,0.0002306744,0.0003165781,0.0002465552,0.0002884025],"domain_scores_gemma":[0.999144,0.00007436513,0.0002523761,0.0002830488,0.0002113429,0.0000349192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002438151,0.00009930131,0.002957184,0.00007087794,0.00004292425,3.314782e-7,0.0003836491,0.00001156037,0.1741098,0.7808163,0.007551595,0.03393211],"study_design_scores_gemma":[0.001039003,0.0002085707,0.001089435,0.0002735975,0.00001531098,0.00001033928,0.0001594625,0.0004493846,0.857893,0.09713539,0.04149269,0.0002338058],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1172576,0.0001903499,0.8644633,0.01286276,0.000805689,0.001603239,0.00006381884,0.001028609,0.001724616],"genre_scores_gemma":[0.8936551,0.000022689,0.1055004,0.0001239434,0.00003544641,0.0002452632,5.232312e-7,0.00001072776,0.0004059721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7763975,"threshold_uncertainty_score":0.2788885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313065965","doi":"10.14778/3551793.3551853","title":"Spooky","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":50,"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":"Merge (version control); Computer science; Granularity; Associative array; Data structure; Parallel computing; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01181195605712601,"gpt":0.215747017196516,"spread":0.20393506113939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001735932,0.00008467878,0.00009937819,0.00007083087,0.0002138981,0.00002799912,0.002764718,0.00001294998,0.0000314626],"category_scores_gemma":[0.00006500297,0.00006269378,0.00005383142,0.0004877373,0.00006093732,0.0002997795,0.004226783,0.0001706701,0.000006500994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152127,"about_ca_system_score_gemma":0.000009302494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000617123,"about_ca_topic_score_gemma":1.299954e-7,"domain_scores_codex":[0.9990152,0.000003293912,0.0001488963,0.0002361255,0.0004123539,0.0001841278],"domain_scores_gemma":[0.9994491,0.0000170466,0.0001701526,0.0003016744,0.00004272123,0.00001925978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000006709241,0.0001511817,0.001043803,0.0000292247,0.00002361626,0.000002089613,0.0007865943,0.0001489124,0.04491715,0.8988926,0.02176615,0.03223196],"study_design_scores_gemma":[0.000829141,0.0004080886,0.001024244,0.00002966553,0.00001959575,0.0001353698,0.001463115,0.005643093,0.53638,0.2322176,0.2213652,0.0004848736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6994852,0.004030131,0.07107375,0.07065836,0.006296491,0.005331377,0.0001759512,0.006597687,0.136351],"genre_scores_gemma":[0.9700024,0.00001504657,0.02909995,0.0002041601,0.0000114256,0.0001138935,2.362407e-7,0.000006437783,0.0005464444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.666675,"threshold_uncertainty_score":0.5268383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098666492","doi":"10.1145/545214.545244","title":"Experiences with VI communication for database storage","year":2002,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":50,"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; Implementation; Exploit; Database; Kernel (algebra); Software deployment; Operating system; Linux kernel; Distributed computing; Embedded system; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02720468784387153,"gpt":0.2631199432918902,"spread":0.2359152554480187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002040456,0.0003425991,0.0003142325,0.0002628404,0.0003925612,0.0002448143,0.006149531,0.0000875558,0.00002111472],"category_scores_gemma":[0.000211661,0.0002656215,0.00007503011,0.0006086989,0.0003512239,0.0008956022,0.00274414,0.000441263,0.00002356173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005863605,"about_ca_system_score_gemma":0.00003026453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002221868,"about_ca_topic_score_gemma":0.00008870973,"domain_scores_codex":[0.9976904,0.0001233888,0.0003057084,0.000863736,0.0004341522,0.0005825908],"domain_scores_gemma":[0.9939864,0.0009063891,0.0001710078,0.004691896,0.0001080074,0.0001363058],"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.00004836375,0.000214558,0.00009307529,0.00005931298,0.00005887663,0.00005757789,0.02471785,0.003066414,0.0009282482,0.00938558,0.01763029,0.9437398],"study_design_scores_gemma":[0.005858546,0.004390411,0.0003377612,0.000485864,0.00005777254,0.0008083544,0.003034999,0.5929214,0.01385943,0.05687588,0.3176985,0.003671075],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01784961,0.0005455558,0.9746678,0.00481347,0.0001764021,0.0007235789,0.00002518915,0.001042222,0.0001561966],"genre_scores_gemma":[0.2338038,0.00003720298,0.7648203,0.0007952903,0.0001067597,0.0003310842,0.00003798554,0.00002354654,0.00004403319],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9400688,"threshold_uncertainty_score":0.9999796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1262434878","doi":"","title":"HyLog: a high performance approach to managing disk layout","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Server; Overhead (engineering); Hard disk drive performance characteristics; Operating system; Workload; File system; File system fragmentation; Random access; Disk array; Parallel computing; Device file; Computer file","retraction":null,"screen_n_in":null,"score":{"opus":0.01472487617403643,"gpt":0.2235979900876728,"spread":0.2088731139136363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009419323,0.0001390367,0.0001278501,0.0001484337,0.0001150554,0.00009259398,0.001680684,0.00004379787,0.000002438198],"category_scores_gemma":[0.00002897033,0.0001159997,0.00002034067,0.0006084762,0.00004826866,0.0009032238,0.001096442,0.0001328917,0.000235317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009754217,"about_ca_system_score_gemma":0.00002092908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004114081,"about_ca_topic_score_gemma":0.000003455131,"domain_scores_codex":[0.9988283,0.000005968338,0.0001362776,0.0004753634,0.0002022658,0.000351843],"domain_scores_gemma":[0.9987922,0.00001250939,0.00003363186,0.00107223,0.00002451634,0.00006487616],"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.000002886585,0.00006633566,0.0001613441,0.00001608971,0.000006733037,0.00001155375,0.0003136293,0.03350301,0.0002390851,0.8605615,0.0002967714,0.104821],"study_design_scores_gemma":[0.0044427,0.001379071,0.0298178,0.0002332506,0.00003259937,0.000402932,0.001812729,0.2828262,0.09304002,0.5485038,0.03279147,0.004717482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05047407,0.00002544913,0.9339302,0.001416301,0.0001094747,0.0001585145,0.000001826108,0.001458177,0.01242595],"genre_scores_gemma":[0.5357574,0.000006054145,0.4636641,0.0003471773,0.00001103091,0.0000211799,0.000001693616,0.000005201004,0.0001862039],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4852833,"threshold_uncertainty_score":0.473033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949519087","doi":"10.1017/9781009283403.008","title":"Locally Repairable Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":49,"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; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0203643416039389,"gpt":0.2046927585368278,"spread":0.1843284169328889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000102936,0.0004445287,0.0004243352,0.000331869,0.0001700335,0.0001580191,0.002721178,0.0004625508,0.000001884304],"category_scores_gemma":[0.00001766032,0.0005070143,0.0002055155,0.00002567007,0.0003910843,0.0003886309,0.003389995,0.000786404,0.000149853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003402602,"about_ca_system_score_gemma":0.0001436998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004600615,"about_ca_topic_score_gemma":0.000002639483,"domain_scores_codex":[0.9980018,0.00001383021,0.0002049704,0.001061277,0.000343351,0.0003747843],"domain_scores_gemma":[0.9974853,0.00007911232,0.0001723291,0.002004948,0.0001372077,0.0001210418],"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.000008758037,0.000003594116,7.093167e-8,0.00007708315,0.00008157477,0.001787774,0.00001386979,0.000009301501,0.00002811994,0.9275259,0.06645086,0.004013122],"study_design_scores_gemma":[0.0001489745,0.00006052911,2.867556e-7,0.0002469177,0.00007142983,0.00005265107,0.00001206644,0.001483224,0.0005407034,0.001973694,0.9948707,0.0005388655],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000002043986,0.0005214381,0.1584449,0.00005079687,0.0003730181,0.0002508933,0.0002437307,0.002786585,0.8373266],"genre_scores_gemma":[0.0000928107,0.0001932121,0.01637191,0.0000654502,0.00005361051,9.726388e-7,0.00002965991,0.00004618746,0.9831462],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9284198,"threshold_uncertainty_score":0.9997382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403310488","doi":"10.22331/q-2024-10-10-1498","title":"Decoding algorithms for surface codes","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Photon Etc (Canada)","funders":"Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad; European Commission","keywords":"Decoding methods; Computer science; Algorithm; List decoding; Sequential decoding; Concatenated error correction code; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.04933901699950013,"gpt":0.3259667094915187,"spread":0.2766276924920186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812319,0.0000985766,0.0001066627,0.00006438539,0.00007877211,0.0001676622,0.0007653626,0.00005054396,0.000003503241],"category_scores_gemma":[0.00008968094,0.00008693514,0.00004435235,0.0003009326,0.00004588404,0.0006471545,0.0002570716,0.00009675961,0.00008650705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004413624,"about_ca_system_score_gemma":0.00003345011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000515081,"about_ca_topic_score_gemma":0.000002150938,"domain_scores_codex":[0.9991482,0.000008340999,0.0001204793,0.0003641684,0.0001092436,0.0002495154],"domain_scores_gemma":[0.9991807,0.0002714093,0.00002150716,0.0004697917,0.000027918,0.00002868941],"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.000001034873,0.000007182944,0.00000661737,0.00003520625,0.000009685327,0.00002955129,0.00008596766,0.00009814827,0.002006595,0.8283913,0.005725383,0.1636034],"study_design_scores_gemma":[0.0000593492,0.00005606787,0.00001025893,0.00003416278,0.000003070421,0.00001464022,0.00004013819,0.778694,0.01018535,0.1540937,0.05666487,0.000144357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003068078,0.002464265,0.9900669,0.001155885,0.0008915483,0.0001346915,0.00003348341,0.002061286,0.0001238875],"genre_scores_gemma":[0.2226496,0.00009547635,0.7768412,0.00006951445,0.00004934016,0.00002180882,0.000007413536,0.00001495222,0.0002506866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7785959,"threshold_uncertainty_score":0.3545112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3017302221","doi":"10.1109/hpca47549.2020.00055","title":"Griffin: Hardware-Software Support for Efficient Page Migration in Multi-GPU Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; CUDA; Parallel computing; Scalability; General-purpose computing on graphics processing units; Demand paging; Programmer; Cache; GPU cluster; Operating system; Memory management; Graphics; Virtual memory; Overlay","retraction":null,"screen_n_in":null,"score":{"opus":0.04441728940581071,"gpt":0.2718763423651543,"spread":0.2274590529593436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536184,0.0001547447,0.0002077049,0.0001039874,0.00006087284,0.0001130623,0.0009740482,0.00009000797,0.000005190651],"category_scores_gemma":[0.0005217837,0.0001359062,0.00004647104,0.0004727968,0.00003215012,0.000415745,0.0003807253,0.0001200088,0.00006295224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007528337,"about_ca_system_score_gemma":0.00004661814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003543244,"about_ca_topic_score_gemma":0.00005493169,"domain_scores_codex":[0.9986288,0.00002096146,0.0003091879,0.0005445143,0.0001955071,0.0003010438],"domain_scores_gemma":[0.9991032,0.0001114493,0.000092946,0.000548941,0.00007242565,0.00007100032],"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.0001904241,0.001462263,0.01892834,0.001768551,0.0001087022,0.0007426935,0.01145801,0.355159,0.02861639,0.29994,0.1217907,0.1598349],"study_design_scores_gemma":[0.0008510867,0.0002137393,0.0005492111,0.00002418474,0.000003233177,0.000007297365,0.0003631224,0.966204,0.005557815,0.0001223379,0.02577449,0.0003294671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00415066,0.0001005525,0.9917305,0.001594312,0.0002590438,0.0006969701,0.00004754999,0.001386857,0.00003357427],"genre_scores_gemma":[0.4447831,0.000008571826,0.5543038,0.0004556805,0.00002539541,0.0001827889,0.00004575973,0.00001389301,0.0001810407],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.611045,"threshold_uncertainty_score":0.5542095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480033117","doi":"10.1023/a:1015185802583","title":"Integrating Web Prefetching and Caching Using Prediction Models","year":2001,"lang":"en","type":"article","venue":"World Wide Web","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03065098892257655,"gpt":0.259374212231979,"spread":0.2287232233094024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821195,0.0001720212,0.0001660894,0.0003178787,0.0002942875,0.0001929231,0.0005594926,0.00005114493,0.000003324132],"category_scores_gemma":[0.0001609209,0.0001628211,0.00002851645,0.0006132541,0.00006201194,0.002503658,0.0006401492,0.0003597054,0.000003277017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259758,"about_ca_system_score_gemma":0.00004980126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007165765,"about_ca_topic_score_gemma":0.0003975505,"domain_scores_codex":[0.9987255,0.00004405662,0.0002540062,0.0004625623,0.0001975499,0.0003163683],"domain_scores_gemma":[0.999064,0.0001450654,0.0001235958,0.0005766603,0.00003311686,0.0000576019],"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.00002929329,0.0001013087,0.03080932,0.00007375921,0.00007146502,0.0002390725,0.002374328,0.2278337,0.06578244,0.2711029,0.00158836,0.399994],"study_design_scores_gemma":[0.0001666868,0.00001632411,0.0001213595,0.0001090623,0.000005864516,0.00006348025,0.00009118988,0.9707122,0.0003267243,0.02489436,0.003327805,0.0001649172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1767364,0.0003094827,0.8192689,0.0003813558,0.0002064676,0.0001226549,0.000007311048,0.0009579622,0.002009445],"genre_scores_gemma":[0.7455701,0.00004245704,0.2540923,0.0001242297,0.00004018531,0.000006352263,0.000002967363,0.00001205937,0.0001093999],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7428785,"threshold_uncertainty_score":0.6639652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388264823","doi":"10.1145/3630614.3630616","title":"The Dirty Secret of SSDs: Embodied Carbon","year":2023,"lang":"en","type":"article","venue":"ACM SIGEnergy Energy Informatics Review","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":44,"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":"Scalability; Computer science; Sustainability; Reuse; Greenhouse gas; Process engineering; Nanotechnology; Engineering; Waste management; Operating system; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.02349750933761285,"gpt":0.2706835783539496,"spread":0.2471860690163368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007127997,0.0002547817,0.0004721433,0.0001482957,0.0001898099,0.00006104603,0.004635777,0.0001007395,0.00000357819],"category_scores_gemma":[0.001137033,0.0001670224,0.0001342939,0.001877127,0.0001789133,0.0005584504,0.002641868,0.0001488333,0.00002826888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000533571,"about_ca_system_score_gemma":0.0001056572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005209701,"about_ca_topic_score_gemma":0.00004041035,"domain_scores_codex":[0.9976791,0.00007100254,0.00104826,0.0001866783,0.0005297451,0.0004851913],"domain_scores_gemma":[0.9952775,0.0005198559,0.0006192811,0.003360309,0.0001489971,0.00007411702],"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.000001463041,0.00001103512,0.000009480328,0.0006291161,0.0000611077,0.000007975096,0.0001544174,0.0009897518,0.00006535929,0.4848103,0.008705049,0.504555],"study_design_scores_gemma":[0.0001538854,0.00007440903,0.00001495355,0.000826996,0.00002716614,0.0000178285,0.0001169445,0.02594808,0.00515576,0.03273819,0.9345349,0.0003908632],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002301978,0.304165,0.5945863,0.01211934,0.002796733,0.001260457,0.0001040378,0.007901438,0.07476471],"genre_scores_gemma":[0.02574732,0.9005314,0.06943872,0.002808714,0.00007070835,0.0003350661,0.0001628091,0.00004801153,0.0008572502],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9258299,"threshold_uncertainty_score":0.8614505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W8439785","doi":"10.5555/2616448.2616472","title":"Bolt: data management for connected homes","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":43,"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; Overhead (engineering); Encryption; Computer data storage; Granularity; Data management; Cloud computing; Database; Class (philosophy); Computer network; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03584029722273756,"gpt":0.2842307635040174,"spread":0.2483904662812798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817593,0.00008132662,0.0000954366,0.00006972349,0.00006477517,0.00007385793,0.003303369,0.00002833829,0.00000785812],"category_scores_gemma":[0.0001494926,0.00006719645,0.00001260329,0.000182424,0.00003587047,0.0007192131,0.002452547,0.00003538175,0.00005087756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001223823,"about_ca_system_score_gemma":0.000004361214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000263502,"about_ca_topic_score_gemma":0.00000727094,"domain_scores_codex":[0.9991339,0.000008887078,0.0001043467,0.0004512951,0.0001026531,0.0001988507],"domain_scores_gemma":[0.9971812,0.000120099,0.0000377807,0.002612104,0.00002461823,0.00002414247],"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.000001007103,0.00000998388,0.000009832559,0.00001041465,0.000007850674,0.000001263224,0.000004795712,0.000007285073,0.00004498745,0.7433978,0.02631774,0.2301871],"study_design_scores_gemma":[0.0005594651,0.00008131105,0.0003246781,0.00000906171,0.000007482644,0.000003999513,0.00006023932,0.1616501,0.002543146,0.156336,0.6781668,0.000257728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001303349,0.00003683258,0.9924332,0.001391544,0.0001588479,0.0002132983,0.00002058899,0.001296323,0.00431905],"genre_scores_gemma":[0.06194396,0.00001681743,0.9367464,0.0003923555,0.00001891195,0.00002967708,0.00006687203,0.000005897575,0.0007790714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6518491,"threshold_uncertainty_score":0.6138536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2584388001","doi":"10.5555/2208461.2208468","title":"Recon: verifying file system consistency at runtime","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":43,"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; File system; Versioning file system; Journaling file system; Unix file types; Operating system; Computer file; Self-certifying File System; File Control Block; Metadata; Device file; Consistency (knowledge bases); Database; Stub file","retraction":null,"screen_n_in":null,"score":{"opus":0.02579415529279486,"gpt":0.23764791434289,"spread":0.2118537590500952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001443973,0.0001168467,0.000148498,0.00006628539,0.0001665135,0.00004470208,0.000805437,0.00007152129,0.0005544353],"category_scores_gemma":[0.00009392331,0.00009995575,0.00003696274,0.0002299997,0.0000604403,0.001192465,0.001041533,0.00008908439,0.002021654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001757913,"about_ca_system_score_gemma":0.00001544414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001038467,"about_ca_topic_score_gemma":0.000003167364,"domain_scores_codex":[0.9990246,0.00002040961,0.0001731448,0.0002573974,0.0001427895,0.0003816043],"domain_scores_gemma":[0.9987056,0.0001230757,0.00007794127,0.0009909567,0.00002994858,0.00007246141],"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.000004413066,0.00005856056,0.001812587,0.00009920711,0.00003219028,0.00004503688,0.000372984,0.00001023332,0.001994572,0.6974522,0.2092814,0.0888366],"study_design_scores_gemma":[0.0006895031,0.0001462625,0.003392594,0.0001937677,0.00002081684,0.0009706584,0.001414891,0.01427422,0.03556713,0.001456667,0.9404179,0.00145561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005427066,0.001495279,0.7780299,0.0004479927,0.001802939,0.0002219859,0.00009863144,0.006791026,0.2056852],"genre_scores_gemma":[0.5270535,0.000009032593,0.4677655,0.0001612126,0.00006122288,0.00004141122,0.00001790963,0.00001164018,0.004878561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7311364,"threshold_uncertainty_score":0.9987554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1780371484","doi":"10.5555/1960475.1960478","title":"Capo: recapitulating storage for virtual desktops","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":42,"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; Operating system; Virtual machine; Computer data storage; File system; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.05886634402512243,"gpt":0.2617266948326815,"spread":0.202860350807559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001747928,0.0001162104,0.0001199915,0.00008170574,0.0001154171,0.00003842891,0.001136136,0.00006842794,0.00003117218],"category_scores_gemma":[0.0002081008,0.0001018902,0.00004024231,0.0001997707,0.00006025852,0.0008953791,0.0004687683,0.00008837681,0.00004473203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003854746,"about_ca_system_score_gemma":0.00002413972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002486986,"about_ca_topic_score_gemma":0.00001531962,"domain_scores_codex":[0.9990569,0.00001244701,0.0001683273,0.0003680176,0.0001100083,0.0002843352],"domain_scores_gemma":[0.9989106,0.00009773723,0.00007310238,0.0008205044,0.00005462522,0.0000434412],"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.000003712667,0.0000273803,0.00006218567,0.000004522135,0.000006902696,0.00001002728,0.0005986326,0.00003052033,0.001826772,0.8226867,0.001302794,0.1734399],"study_design_scores_gemma":[0.001769293,0.001538528,0.002525253,0.00005013351,0.00002043722,0.00007556899,0.001879218,0.1564877,0.266591,0.5317087,0.03552407,0.001829975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007383641,0.00003826993,0.9864559,0.00008292044,0.0002776196,0.0001863218,0.000005371015,0.001322258,0.004247685],"genre_scores_gemma":[0.3876265,0.000002176771,0.6118665,0.00009801853,0.00001493666,0.00002938533,0.000001915619,0.000006890391,0.0003536967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3802428,"threshold_uncertainty_score":0.4154961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}