{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1063,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":1063,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"bbd21f725eaa","filters":{"topic":"Distributed systems and fault tolerance"}},"results":[{"id":"W2294047952","doi":"10.1145/367701.367728","title":"Process migration","year":2000,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":469,"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; Process migration; Implementation; Process (computing); Software deployment; Locality; Data migration; Workstation; Distributed computing; Process management; Software engineering; Operating system","authors":[{"name":"Dejan Milojičić","is_ca":false},{"name":"Fred Douglis","is_ca":false},{"name":"Yves Paindaveine","is_ca":false},{"name":"Richard Wheeler","is_ca":false},{"name":"Songnian Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05593355483876543,"gpt":0.3473990612163051,"spread":0.2914655063775397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497477,0.001235594,0.000886023,0.001718185,0.001414101,0.00321921,0.003466068,0.002120003,0.03096535],"category_scores_gemma":[0.005046111,0.0005625399,0.001170337,0.002858836,0.0007749829,0.004125204,0.003007262,0.001468475,0.0340635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141236,"about_ca_system_score_gemma":0.002567279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002236028,"about_ca_topic_score_gemma":0.00164914,"domain_scores_codex":[0.9978669,0.000289745,0.0001618654,0.0004426035,0.0009859103,0.0002529998],"domain_scores_gemma":[0.9978404,0.0003446349,0.000148302,0.0006733431,0.0008739485,0.0001193536],"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.0001216013,0.000131829,0.0005034191,0.002003287,0.0000379343,0.0003289765,0.0003899634,0.001640862,0.008397477,0.03651563,0.08226962,0.8676594],"study_design_scores_gemma":[0.00002802787,0.0000794362,0.0003456427,0.0003613106,0.00004446059,0.0008953792,0.0001316017,0.002105083,0.007240381,0.01103006,0.9777141,0.00002447914],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.0103311,0.07615718,0.5244602,0.005122221,0.006817839,0.002248724,0.001586913,0.01945824,0.3538176],"genre_scores_gemma":[0.1256599,0.1208892,0.3604031,0.007249137,0.001908206,0.002066206,0.006825151,0.003189342,0.3718097],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.03096535,"threshold_uncertainty_score":0.1035894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099537990","doi":"10.1109/hpca.2005.41","title":"Unbounded Transactional Memory","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":440,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Research Laboratory; Canadian Institute of Steel Construction","keywords":"Computer science; Transactional memory; Operating system; Memory footprint; Virtual memory; Memory management; Memory map; Parallel computing; Embedded system; Database transaction; Shared memory; Programming language; Overlay","authors":[{"name":"C. Scott Ananian","is_ca":false},{"name":"Krste Asanović","is_ca":false},{"name":"Bradley C. Kuszmaul","is_ca":false},{"name":"Charles E. Leiserson","is_ca":false},{"name":"Sean Lie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00858421625016597,"gpt":0.2195543342874197,"spread":0.2109701180372537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302671,0.0006758844,0.0006235838,0.0004038939,0.0007013361,0.002309903,0.003763881,0.001038483,0.00542004],"category_scores_gemma":[0.007170769,0.0005714418,0.0006331665,0.0008090159,0.001226669,0.004073634,0.001294179,0.001694473,0.001219851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007410376,"about_ca_system_score_gemma":0.001813713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001857267,"about_ca_topic_score_gemma":0.001322934,"domain_scores_codex":[0.9979386,0.0003917003,0.0002174138,0.000314714,0.0008236746,0.0003138337],"domain_scores_gemma":[0.9931453,0.001789566,0.0004378958,0.003244332,0.001201052,0.0001817705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001781461,0.0006232002,0.01537537,0.001515609,0.0003247452,0.001053078,0.0007828352,0.3642667,0.1209651,0.2614337,0.02734044,0.2045378],"study_design_scores_gemma":[0.0002373673,0.0005820427,0.00153189,0.0001105325,0.0001616787,0.0005700449,0.0001139828,0.7749637,0.08836682,0.06148164,0.07177192,0.0001084032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2091879,0.002147755,0.7518956,0.0007415884,0.000577484,0.0004525516,0.00107801,0.01210616,0.02181299],"genre_scores_gemma":[0.8154605,0.0005387723,0.1757921,0.0004634915,0.00008767346,0.0003745646,0.0008835406,0.0007001139,0.005699241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00542004,"threshold_uncertainty_score":0.01813179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242946001","doi":"10.1145/1103845.1094852","title":"X10","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":293,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Uniprocessor system; Computer science; Scalability; Synchronization (alternating current); Programming paradigm; Multiprocessing; Partitioned global address space; Distributed computing; Construct (python library); Node (physics); Parallel computing; Programming language; Operating system; Telecommunications","authors":[{"name":"Philippe Charles","is_ca":false},{"name":"Christian Grothoff","is_ca":false},{"name":"Vijay Saraswat","is_ca":false},{"name":"Christopher Donawa","is_ca":true},{"name":"Allan Kielstra","is_ca":true},{"name":"Kemal Ebci̇oğlu","is_ca":false},{"name":"Christoph von Praun","is_ca":false},{"name":"Vivek Sarkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662160194682793,"gpt":0.2513658921889296,"spread":0.2347442902421016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567425,0.0007791742,0.0003200675,0.0007861108,0.001148741,0.003252088,0.001206216,0.001177815,0.4946111],"category_scores_gemma":[0.002080694,0.0003307122,0.0004382737,0.0008925254,0.0006989281,0.003073917,0.001989358,0.001164026,0.2551121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009650807,"about_ca_system_score_gemma":0.001294488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002766696,"about_ca_topic_score_gemma":0.002584965,"domain_scores_codex":[0.9993346,0.0001111689,0.00004398743,0.0001395513,0.0002858962,0.00008478879],"domain_scores_gemma":[0.9991184,0.0001613822,0.00006331213,0.0001579922,0.0003730957,0.0001257356],"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.0001481437,0.0000662132,0.0008993577,0.0003050747,0.000007933632,0.0002600032,0.0004709049,0.0004494567,0.003136713,0.1132136,0.6638108,0.2172319],"study_design_scores_gemma":[0.000005794308,0.00002359383,0.0001994341,0.00003218924,0.000001455787,0.0001069808,0.00005823712,0.0002294614,0.0004199606,0.002541215,0.9963755,0.000006123834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.003711232,0.0008660269,0.03574886,0.003246396,0.003654956,0.0003286202,0.003463817,0.008431038,0.940549],"genre_scores_gemma":[0.009431582,0.0007565318,0.01061454,0.001033712,0.0004636195,0.0001604733,0.004361719,0.001573677,0.971604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4946111,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123429492","doi":"10.1007/s00446-007-0040-2","title":"The computational power of population protocols","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":272,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Multiset; Communication source; Theory of computation; Theoretical computer science; Population; Predicate (mathematical logic); Computation; State (computer science); Computer network; Discrete mathematics; Mathematics; Algorithm; Programming language","authors":[{"name":"Dana Angluin","is_ca":false},{"name":"James Aspnes","is_ca":false},{"name":"David Eisenstat","is_ca":false},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01301871282599473,"gpt":0.2926498428743762,"spread":0.2796311300483815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004976653,0.0005705881,0.001250712,0.001105668,0.002231963,0.004626979,0.002654004,0.002529253,0.01154602],"category_scores_gemma":[0.04529893,0.0008608248,0.0008815113,0.001801575,0.006089455,0.01202459,0.003745748,0.004494414,0.001842743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778417,"about_ca_system_score_gemma":0.002039216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858921,"about_ca_topic_score_gemma":0.001122927,"domain_scores_codex":[0.9960453,0.001980397,0.0001126933,0.0005129041,0.001002595,0.0003460291],"domain_scores_gemma":[0.9596558,0.0308526,0.0009587056,0.006458024,0.001322048,0.0007529389],"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.0001084006,0.00003625318,0.0005265009,0.00008318244,0.00003054184,0.00004927786,0.0002179477,0.04798079,0.0007336175,0.9195455,0.004413994,0.02627392],"study_design_scores_gemma":[0.0000511738,0.0000197046,0.000172988,0.00002107373,0.00001761384,0.00005339971,0.00005371193,0.1659211,0.0005349307,0.8264191,0.006718992,0.0000162119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07785799,0.00446819,0.7676588,0.02006661,0.001212046,0.0001158454,0.000355436,0.0008777197,0.1273873],"genre_scores_gemma":[0.903626,0.002867626,0.07248335,0.001285514,0.001246759,0.0002742894,0.0002213935,0.0003360731,0.01765893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01154602,"threshold_uncertainty_score":0.0386253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991152532","doi":"10.1145/1113574.1113576","title":"MIDDLE-R","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":173,"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; Replication (statistics); Middleware (distributed applications); Concurrency control; Correctness; Scalability; Distributed computing; Concurrency; Variety (cybernetics); Distributed object; Object (grammar); Operating system; Programming language; Common Object Request Broker Architecture; Database transaction","authors":[{"name":"Marta Patiño-Martı́nez","is_ca":false},{"name":"Bettina Kemme","is_ca":true},{"name":"Gustavo Alonso","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02774426662215443,"gpt":0.2335763803374512,"spread":0.2058321137152967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00270609,0.0009686444,0.0008183386,0.001577724,0.001651098,0.004675694,0.003283489,0.002125202,0.04922209],"category_scores_gemma":[0.006712168,0.0006435973,0.00118747,0.001038304,0.001020639,0.007057968,0.005991506,0.00189094,0.03657914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024564,"about_ca_system_score_gemma":0.001987488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001843134,"about_ca_topic_score_gemma":0.00134087,"domain_scores_codex":[0.9973404,0.0004400778,0.0001940486,0.0006757319,0.0009692279,0.0003805727],"domain_scores_gemma":[0.9963398,0.0004115139,0.0002349716,0.001967669,0.0006197426,0.0004263833],"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.001180923,0.0003699352,0.003398336,0.0007688975,0.0001300836,0.0008509093,0.001176798,0.00377483,0.030931,0.27297,0.1836262,0.5008222],"study_design_scores_gemma":[0.0001491073,0.0003322935,0.001335987,0.0001410118,0.00008786339,0.0009125928,0.0002364325,0.01637025,0.02419843,0.05255362,0.9035368,0.0001455727],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02059324,0.002053491,0.5586576,0.002409033,0.002228619,0.001086604,0.002647579,0.1508879,0.259436],"genre_scores_gemma":[0.2317422,0.00173117,0.4433231,0.003212324,0.0008964562,0.0009429445,0.00859228,0.01533233,0.2942271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04922209,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883173799","doi":"10.4230/lipics.aft.2025.15","title":"A Modular Approach for the Analysis of Blockchain Consensus Protocol Under Churn (Poster)","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Gossip; Computer science; Political science; Law","authors":[{"name":"Ethan Buchman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03124505584141129,"gpt":0.2978693558438446,"spread":0.2666243000024333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200294,0.000635494,0.0004730868,0.001543061,0.0005371289,0.001070123,0.001044667,0.0008511576,0.002446995],"category_scores_gemma":[0.005710979,0.0002859868,0.001133739,0.0007530478,0.001837831,0.00210384,0.002777191,0.001505602,0.0005323247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007457908,"about_ca_system_score_gemma":0.0007835396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005346335,"about_ca_topic_score_gemma":0.0002742276,"domain_scores_codex":[0.9987482,0.0004280609,0.00006422833,0.0001950734,0.0004294212,0.0001349835],"domain_scores_gemma":[0.997677,0.001007935,0.0003494633,0.0003825358,0.0004075495,0.0001754841],"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.0001337152,0.0001055182,0.002047278,0.0002505306,0.0001570495,0.0007472351,0.0007388029,0.271367,0.03132432,0.6428873,0.002639363,0.04760198],"study_design_scores_gemma":[0.00001102884,0.00008208939,0.000419416,0.00002660877,0.0000344071,0.0001467666,0.00005236818,0.7947567,0.003044643,0.1986323,0.002776264,0.00001747239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637573,0.0001890365,0.9805236,0.0001795681,0.0000401845,0.0001011546,0.00004651433,0.0001705665,0.00237359],"genre_scores_gemma":[0.7098916,0.0006817555,0.282765,0.0002203959,0.0002891344,0.0006160814,0.0002412091,0.000242038,0.005052652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002446995,"threshold_uncertainty_score":0.0105927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032204694","doi":"10.1109/mm.2006.26","title":"Unbounded Transactional Memory","year":2006,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Transactional memory; Memory footprint; Transactional leadership; Software transactional memory; Correctness; Transaction processing; Memory management; Architecture; Database transaction; Distributed computing; Parallel computing; Operating system; Database; Overlay; Programming language","authors":[{"name":"C. Scott Ananian","is_ca":false},{"name":"Krste Asanović","is_ca":false},{"name":"Bradley C. Kuszmaul","is_ca":false},{"name":"Charles E. Leiserson","is_ca":false},{"name":"Sean Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00713658722957889,"gpt":0.2049902182503439,"spread":0.1978536310207651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090263,0.0006054527,0.0006266706,0.0005365831,0.0009933903,0.003489141,0.002837192,0.001026195,0.01329525],"category_scores_gemma":[0.005649324,0.0003947957,0.0004568773,0.001185876,0.001136546,0.006536976,0.002844874,0.001454953,0.005538459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005478188,"about_ca_system_score_gemma":0.001172652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004515092,"about_ca_topic_score_gemma":0.0003458292,"domain_scores_codex":[0.9984958,0.0002281566,0.000171587,0.0002371261,0.0006416976,0.0002255602],"domain_scores_gemma":[0.9950916,0.0008317484,0.0002663581,0.002382827,0.001127057,0.000300489],"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.001499178,0.000196693,0.002622755,0.001372203,0.0001085459,0.001046818,0.0004248581,0.01473801,0.06705068,0.4388656,0.0553062,0.4167684],"study_design_scores_gemma":[0.0001640875,0.0004938882,0.00113922,0.0004764334,0.0001386809,0.002473968,0.0002160462,0.0924053,0.09751308,0.3432949,0.4615348,0.0001496228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06213534,0.01731363,0.7980546,0.003623636,0.002742161,0.0004092689,0.001851627,0.01446669,0.09940311],"genre_scores_gemma":[0.7295089,0.0065083,0.2001635,0.002027353,0.001326384,0.0004212495,0.00237435,0.001022639,0.05664738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01329525,"threshold_uncertainty_score":0.04447711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038924034","doi":"10.1007/s00446-003-0091-y","title":"Hundreds of impossibility results for distributed computing","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Impossibility; Variety (cybernetics); Distributed computing; Theory of computation; Theoretical computer science; Resource (disambiguation); Fault tolerance; Resource allocation; Algorithm; Artificial intelligence; Computer network","authors":[{"name":"Faith E. Fich","is_ca":true},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02072866808562297,"gpt":0.2763131975748732,"spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008939336,0.00251168,0.002468864,0.003970305,0.004228515,0.00741259,0.003844103,0.004871828,0.01046457],"category_scores_gemma":[0.04495262,0.002189247,0.003308967,0.004653584,0.009975886,0.02005447,0.00733724,0.01686954,0.002802087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002176426,"about_ca_system_score_gemma":0.001187664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004605965,"about_ca_topic_score_gemma":0.0003476413,"domain_scores_codex":[0.9910572,0.002146513,0.000684143,0.001898667,0.003467156,0.0007463678],"domain_scores_gemma":[0.9208265,0.06435084,0.001071005,0.009906809,0.002566925,0.001277927],"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.0004057715,0.0002478607,0.001651392,0.001717261,0.0003052776,0.0003507829,0.0006332051,0.01630402,0.001675056,0.8296218,0.04513405,0.1019535],"study_design_scores_gemma":[0.00004464392,0.00002104765,0.0002406392,0.0001078784,0.00005404233,0.0001359999,0.00006537158,0.00990284,0.0006434238,0.974703,0.01404701,0.00003416126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04999556,0.06880267,0.6724761,0.06010863,0.00582547,0.0001998953,0.0009797054,0.002897731,0.1387143],"genre_scores_gemma":[0.6609802,0.04966535,0.216995,0.01156868,0.0242804,0.001027559,0.002947852,0.001877685,0.03065731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046457,"threshold_uncertainty_score":0.04727632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041180570","doi":"10.5555/1182635.1164189","title":"Lazy database replication with snapshot isolation","year":2006,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Snapshot (computer storage); Serializability; Distributed computing; Concurrency; Database; Database transaction; Concurrency control; Isolation (microbiology); Data integrity; Transaction processing; Distributed transaction","authors":[{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Kenneth Salem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02553277817671872,"gpt":0.2612185157962632,"spread":0.2356857376195444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003953909,0.0006781252,0.001152098,0.00102969,0.001528816,0.002897722,0.003456958,0.001240224,0.002114192],"category_scores_gemma":[0.01325194,0.0007166082,0.0008290313,0.001713923,0.00186638,0.006081867,0.006638477,0.002140855,0.001303781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008415455,"about_ca_system_score_gemma":0.002071357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007328423,"about_ca_topic_score_gemma":0.0008262879,"domain_scores_codex":[0.9935699,0.001586924,0.000612619,0.001053908,0.002696971,0.0004797567],"domain_scores_gemma":[0.9839048,0.002239767,0.001327405,0.01043766,0.001573651,0.0005166863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001020331,0.0003887771,0.006631492,0.001026598,0.0004698967,0.0009515239,0.001329683,0.136372,0.07063691,0.3163575,0.01557578,0.4492396],"study_design_scores_gemma":[0.0003658333,0.0008035468,0.001557218,0.0001471493,0.0004168316,0.001919421,0.0004220324,0.588038,0.08024549,0.2688582,0.05702726,0.0001989254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01752634,0.001126025,0.9745492,0.0003284289,0.0001344097,0.0001614823,0.00004915777,0.003371442,0.002753461],"genre_scores_gemma":[0.5871381,0.0008472968,0.4053564,0.000389877,0.0003844232,0.0003517557,0.0002397697,0.0004134249,0.004879017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003953909,"threshold_uncertainty_score":0.0209105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148789662","doi":"10.1016/j.jpdc.2007.04.010","title":"Performance of memory reclamation for lockless synchronization","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Land reclamation; Priority inversion; Pointer (user interface); Workload; Concurrency; Data structure; Blocking (statistics); Distributed computing; Parallel computing; Computer network; Operating system; Computer hardware; Dynamic priority scheduling; Quality of service","authors":[{"name":"Paul E. McKenney","is_ca":false},{"name":"Jonathan Walpole","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01227256843782585,"gpt":0.2517639469107619,"spread":0.2394913784729361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117148,0.0006501336,0.0007174337,0.0005335784,0.0007277625,0.00101429,0.001354309,0.0007044708,0.007082657],"category_scores_gemma":[0.005779389,0.0002694129,0.000168506,0.0006717229,0.000634123,0.00133588,0.0008364936,0.0006994611,0.0007465435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006648739,"about_ca_system_score_gemma":0.001156732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248376,"about_ca_topic_score_gemma":0.001875091,"domain_scores_codex":[0.998701,0.0002477985,0.00004808298,0.0002203904,0.0003084672,0.0004741942],"domain_scores_gemma":[0.9943483,0.002907189,0.000382089,0.0009926928,0.0009103552,0.0004594234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.04220624,0.00180953,0.01720704,0.000750742,0.0002598092,0.0009247998,0.001466858,0.1338231,0.5047624,0.008377989,0.01446262,0.273949],"study_design_scores_gemma":[0.001288184,0.003935694,0.0113937,0.00003288662,0.0002317739,0.0002807768,0.0004530607,0.5151666,0.4613982,0.002235157,0.003462308,0.0001216046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830578,0.000577347,0.00836391,0.0001655295,0.0001114089,0.00001890452,0.0001100263,0.004279205,0.003315705],"genre_scores_gemma":[0.997018,0.00004155269,0.001464084,0.00002656432,0.00001291509,0.000006930549,0.0001010512,0.0001339213,0.001194991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007082657,"threshold_uncertainty_score":0.02369392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973115038","doi":"10.1145/937598.937601","title":"Are quorums an alternative for data replication?","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":144,"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; Replication (statistics); Scalability; Overhead (engineering); Replicate; Distributed computing; Consistency (knowledge bases); Eventual consistency; Selection (genetic algorithm); Data access; Data consistency; Consistency model; Database; Programming language; Artificial intelligence","authors":[{"name":"Marta Patiño-Martı́nez","is_ca":false},{"name":"Gustavo Alonso","is_ca":false},{"name":"Bettina Kemme","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1108332601636947,"gpt":0.3436451194508417,"spread":0.232811859287147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01157011,0.0006131641,0.001569866,0.001317472,0.002190847,0.005164957,0.003463542,0.004455815,0.01172012],"category_scores_gemma":[0.03014002,0.0005899933,0.001255195,0.002286652,0.003670238,0.01901526,0.002822037,0.002575668,0.004207607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00167084,"about_ca_system_score_gemma":0.001612587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001064291,"about_ca_topic_score_gemma":0.0007340512,"domain_scores_codex":[0.9887707,0.004638792,0.0006261876,0.001211788,0.004104638,0.0006479465],"domain_scores_gemma":[0.9815678,0.008125682,0.001207764,0.005266093,0.003157219,0.0006754333],"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.0003302291,0.00008145993,0.0008300834,0.0005075659,0.00006909565,0.0001681942,0.000520527,0.005314398,0.002734002,0.8717052,0.01006431,0.1076749],"study_design_scores_gemma":[0.0001748802,0.0003841927,0.0003704764,0.0002695957,0.00006602512,0.0008231697,0.0005621046,0.03209814,0.003582762,0.7969105,0.1646564,0.0001016923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02182115,0.02333485,0.8538089,0.02731874,0.006330821,0.0003146299,0.0002766356,0.0009239999,0.06587033],"genre_scores_gemma":[0.5934011,0.01274791,0.3241893,0.007126458,0.004341282,0.0009666965,0.0004033111,0.000573126,0.05625075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01172012,"threshold_uncertainty_score":0.06118935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136651966","doi":"10.1145/1011767.1011776","title":"Lock-free linked lists and skip lists","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Lock (firearm); Linked list; Mutual exclusion; Traverse; Data structure; Robustness (evolution); Parallel computing; Synchronization (alternating current); Node (physics); Theoretical computer science; Algorithm; Operating system; Computer network","authors":[{"name":"Mikhail Fomitchev","is_ca":true},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007920401738214577,"gpt":0.2170953614075504,"spread":0.2091749596693358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905021,0.0007898366,0.0006534262,0.001572458,0.001694892,0.004362117,0.003355475,0.001585757,0.008845168],"category_scores_gemma":[0.008626421,0.0008672423,0.000839958,0.002375598,0.002328195,0.008994821,0.004456575,0.001732754,0.003355986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291384,"about_ca_system_score_gemma":0.002334408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722453,"about_ca_topic_score_gemma":0.002149489,"domain_scores_codex":[0.9971529,0.0004584751,0.0002851676,0.0003125646,0.001391781,0.0003991527],"domain_scores_gemma":[0.994806,0.001263476,0.0006319663,0.001941859,0.001120113,0.0002366403],"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.0002841183,0.00009285573,0.0008197366,0.0003212782,0.00004593536,0.0001454872,0.0003984921,0.01538215,0.009014769,0.7787342,0.01006355,0.1846975],"study_design_scores_gemma":[0.0002181521,0.0002986103,0.0003046759,0.0001488852,0.0001072357,0.0004377031,0.0001969127,0.1243421,0.05406458,0.6791883,0.1405423,0.0001505904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009169206,0.0004296434,0.9793937,0.000225839,0.0001074035,0.0001505303,0.0001548343,0.002698918,0.007669974],"genre_scores_gemma":[0.1596668,0.0008896838,0.8144295,0.0005950159,0.0001960262,0.0006925779,0.000664503,0.001075772,0.02179017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008845168,"threshold_uncertainty_score":0.02959007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110020044","doi":"10.14778/1453856.1453922","title":"A practical scalable distributed B-tree","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","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; Distributed computing; Scalability; Tree (set theory); Fault tolerance; Distributed transaction; Concurrency; Transaction processing; Database transaction; Operating system; Database","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Wojciech Golab","is_ca":true},{"name":"Mehul A. Shah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02628965727836388,"gpt":0.2516244494746975,"spread":0.2253347921963336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158021,0.0003841064,0.0005687174,0.0006775389,0.001266788,0.001317321,0.002266335,0.001265629,0.01020817],"category_scores_gemma":[0.003908471,0.0003989204,0.000417063,0.001630831,0.0005215264,0.002423637,0.002203713,0.00103567,0.004032465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006705831,"about_ca_system_score_gemma":0.001676923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002046647,"about_ca_topic_score_gemma":0.002254084,"domain_scores_codex":[0.9987914,0.0001578712,0.00009432388,0.0001948594,0.0006473972,0.0001142558],"domain_scores_gemma":[0.9985032,0.0002855576,0.00006812212,0.0003755016,0.0005924118,0.0001752325],"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.0004175011,0.0002523889,0.001450146,0.0006531661,0.000060803,0.0006378749,0.0002455833,0.1139954,0.04514711,0.1540456,0.09570391,0.5873906],"study_design_scores_gemma":[0.0002989906,0.0003298957,0.0004128127,0.00007969943,0.00004566594,0.0009744731,0.0001155121,0.6860753,0.01255356,0.1089796,0.1900767,0.00005788406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00675231,0.0005427831,0.9780831,0.0008433866,0.0001353193,0.0002084628,0.0002916799,0.00399447,0.009148495],"genre_scores_gemma":[0.08324079,0.0004819768,0.9094471,0.0003172563,0.00009595822,0.0002931757,0.0007589291,0.0002483085,0.005116498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01020817,"threshold_uncertainty_score":0.03414971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094285453","doi":"10.1016/j.ipl.2004.10.007","title":"Broadcasting with locally bounded Byzantine faults","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Resilience (materials science); Distributed computing; Broadcasting (networking); Node (physics); Greedy algorithm; Heuristic; Byzantine fault tolerance; Wireless sensor network; Computer network; Fault tolerance; Algorithm","authors":[{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005448011887945285,"gpt":0.1968997007259594,"spread":0.1914516888380141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519158,0.0006926318,0.001640537,0.001203205,0.001622169,0.002434381,0.001284694,0.001894181,0.003396774],"category_scores_gemma":[0.011807,0.0004870438,0.0002787295,0.001568554,0.001753583,0.004792341,0.002873678,0.001925369,0.0006482855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163641,"about_ca_system_score_gemma":0.001149242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001917048,"about_ca_topic_score_gemma":0.002288798,"domain_scores_codex":[0.9987168,0.0003415039,0.00007370397,0.0001754217,0.0003755305,0.0003170526],"domain_scores_gemma":[0.988781,0.006983841,0.0008161111,0.0023655,0.0007696653,0.0002838231],"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.004465342,0.0001549763,0.001889904,0.0008376281,0.00008069442,0.001258355,0.001412695,0.345364,0.04993916,0.4405574,0.01184043,0.1421994],"study_design_scores_gemma":[0.0002626241,0.0003060249,0.0003933468,0.00006814943,0.00006165108,0.000490233,0.000236736,0.6472647,0.02770091,0.3142623,0.00889203,0.00006134569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.357158,0.003073584,0.6061857,0.003742066,0.0004616644,0.0001502223,0.0004197357,0.00367296,0.02513614],"genre_scores_gemma":[0.9559171,0.0005826784,0.03573666,0.0001964379,0.0001559945,0.0000782526,0.0001345851,0.0001770385,0.007021318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003396774,"threshold_uncertainty_score":0.01569831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003895614","doi":"10.1145/1122971.1123002","title":"Exploiting distributed version concurrency in a transactional memory cluster","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Distributed computing; Transactional memory; Linearizability; Consistency model; Serializability; Parallel computing; Software transactional memory; Operating system; Transaction processing; Database; Data consistency; Database transaction; Distributed transaction; Algorithm; Correctness","authors":[{"name":"Kaloian Manassiev","is_ca":true},{"name":"Madalin Mihailescu","is_ca":true},{"name":"Cristiana Amza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007595682322297699,"gpt":0.2135394505841859,"spread":0.2059437682618882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001353645,0.0006603442,0.0005608142,0.0005310379,0.0006911742,0.001421094,0.002171649,0.0005399534,0.0006441465],"category_scores_gemma":[0.004224314,0.0004623803,0.0003012855,0.001036288,0.0008268827,0.00219372,0.001323811,0.0008878599,0.0001477274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008501116,"about_ca_system_score_gemma":0.0009210751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002474559,"about_ca_topic_score_gemma":0.002277647,"domain_scores_codex":[0.9983304,0.0004498353,0.00008896353,0.0002935381,0.0006684136,0.0001687851],"domain_scores_gemma":[0.9971216,0.0008620376,0.00024459,0.0010712,0.0004502433,0.0002502182],"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.00112109,0.000710463,0.01768673,0.0002570272,0.0001546656,0.000633095,0.0007985559,0.5814849,0.1676076,0.01770788,0.002644137,0.2091939],"study_design_scores_gemma":[0.00008595133,0.0002060456,0.001292369,0.000004179251,0.00002719461,0.00008048127,0.00005206018,0.9675907,0.02640707,0.003027645,0.001203725,0.000022552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8684279,0.0004201836,0.1237816,0.0001930988,0.00003543422,0.00009122169,0.00003854301,0.004060624,0.002951446],"genre_scores_gemma":[0.9319782,0.0000786844,0.06691224,0.0000371586,0.00001425284,0.00005239512,0.00007359557,0.0001485827,0.0007048807],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002474559,"threshold_uncertainty_score":0.007158875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2423891596","doi":"10.1145/2882903.2882905","title":"ERMIA","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":125,"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; Massively parallel; Leverage (statistics); Parallel computing; Database transaction; Transaction processing; Overhead (engineering); Distributed computing; Operating system; Database","authors":[{"name":"Kangnyeon Kim","is_ca":true},{"name":"Tianzheng Wang","is_ca":true},{"name":"Ryan Johnson","is_ca":false},{"name":"Ippokratis Pandis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007192279634665803,"gpt":0.2056471178025575,"spread":0.1984548381678917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111662,0.001026355,0.000611481,0.002136503,0.001634215,0.004047497,0.001432194,0.002163195,0.4147835],"category_scores_gemma":[0.003199333,0.000346984,0.0005677755,0.001352561,0.0007547998,0.002262737,0.002894153,0.001667793,0.3160938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001604147,"about_ca_system_score_gemma":0.001879241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002062525,"about_ca_topic_score_gemma":0.002388271,"domain_scores_codex":[0.9987802,0.0001609802,0.00009319326,0.0003119746,0.000484949,0.0001686794],"domain_scores_gemma":[0.9986171,0.0001275982,0.0001166575,0.0002985393,0.0005722324,0.0002678622],"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.0003886579,0.0001673708,0.00252076,0.0006582439,0.00003853084,0.0007470043,0.0004582109,0.0006418705,0.004795794,0.05435974,0.388254,0.5469698],"study_design_scores_gemma":[0.0000161136,0.00003267502,0.0008147293,0.0001043602,0.000008114326,0.0004061507,0.00009425364,0.0002696219,0.000965415,0.003046735,0.9942324,0.000009505781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007581428,0.008046645,0.01416213,0.01117447,0.006515175,0.0003000429,0.005273148,0.004981079,0.9419659],"genre_scores_gemma":[0.0442132,0.005275167,0.009417873,0.00302678,0.001162017,0.0002087614,0.006427351,0.0009189646,0.92935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4147835,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991407706","doi":"10.1145/544862.544917","title":"Improving fault-tolerance by replicating agents","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":118,"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":"Distributed computing; Computer science; Redundancy (engineering); Replication (statistics); Fault tolerance; Consistency (knowledge bases); Synchronization (alternating current); Key (lock); Computer network; Computer security; Artificial intelligence","authors":[{"name":"Alan Fedoruk","is_ca":true},{"name":"Ralph Deters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01836708407344712,"gpt":0.2308340455114102,"spread":0.2124669614379631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149145,0.0005983593,0.0005627496,0.0005857702,0.0005384499,0.001326483,0.001448942,0.0008980994,0.0016392],"category_scores_gemma":[0.005834109,0.0003210424,0.0004364917,0.0005385656,0.0006947129,0.002019575,0.001396082,0.0009612569,0.0007474537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003888278,"about_ca_system_score_gemma":0.0005500807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009346125,"about_ca_topic_score_gemma":0.0007238293,"domain_scores_codex":[0.9985127,0.0005006866,0.000135723,0.0001898624,0.0005013475,0.0001597476],"domain_scores_gemma":[0.9956899,0.001217377,0.0005884609,0.001738132,0.0006183501,0.0001476164],"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.0003752089,0.0002871066,0.00461173,0.0003872524,0.0001118942,0.0005313214,0.0008838756,0.3311402,0.1632208,0.04115138,0.004031045,0.4532681],"study_design_scores_gemma":[0.0001231284,0.0005698957,0.001437225,0.00006965391,0.0001398961,0.0008157292,0.0002322627,0.8122923,0.1063809,0.03517842,0.04268274,0.0000779297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1061052,0.001269417,0.8837557,0.0005174432,0.0001636456,0.0001419751,0.00002344823,0.002838549,0.005184559],"genre_scores_gemma":[0.6502836,0.0009381132,0.3440086,0.0001450567,0.00009759854,0.00009724372,0.00006916392,0.0001986966,0.004161862],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0016392,"threshold_uncertainty_score":0.007887661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168227861","doi":"10.1109/icde.2005.108","title":"Postgres-R(SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":116,"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; Serializability; Concurrency control; Replica; Isolation (microbiology); Correctness; Distributed computing; Concurrency; Non-lock concurrency control; Multiversion concurrency control; Snapshot (computer storage); Distributed concurrency control; Operating system; Workstation; Database; Database transaction; Programming language; Transaction processing; Distributed transaction","authors":[{"name":"Shuqing Wu","is_ca":true},{"name":"Bettina Kemme","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007423690268378923,"gpt":0.2242266101507551,"spread":0.2168029198823762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006341979,0.001179669,0.001000702,0.001096619,0.0006777601,0.002306794,0.005180312,0.0009630939,0.00333041],"category_scores_gemma":[0.008202712,0.001108972,0.00111857,0.001145403,0.001975188,0.004466179,0.004399352,0.002341748,0.002020876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007023642,"about_ca_system_score_gemma":0.001874011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940372,"about_ca_topic_score_gemma":0.003252994,"domain_scores_codex":[0.9959542,0.0008714737,0.0004468739,0.0007507899,0.0016367,0.000340062],"domain_scores_gemma":[0.9887465,0.001721121,0.0007378132,0.006992684,0.001345161,0.0004567865],"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.001616996,0.0008544803,0.008019364,0.0008208076,0.0004574172,0.001167641,0.001609184,0.05886387,0.1415524,0.0879807,0.04100593,0.6560513],"study_design_scores_gemma":[0.00110491,0.001701045,0.002512082,0.00008757214,0.0002319122,0.001702553,0.0002345773,0.6624189,0.1853798,0.04738251,0.09689727,0.0003468517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01318083,0.0002313303,0.948011,0.0002162566,0.0001088485,0.0002824052,0.0001225486,0.03515899,0.002687765],"genre_scores_gemma":[0.2206701,0.0002776391,0.7669798,0.0003763929,0.0001873366,0.0003014856,0.0009482937,0.002879864,0.007379102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006341979,"threshold_uncertainty_score":0.03354001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571118757","doi":"10.14778/3015274.3015276","title":"Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":113,"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; Concurrency control; Server; Parallel computing; Concurrency; Cache; Distributed computing; Cache coherence; Lock (firearm); Deadlock; Out-of-order execution; Serialization; Operating system; CPU cache; Database transaction; Cache algorithms; Database","authors":[{"name":"Tianzheng Wang","is_ca":true},{"name":"Hideaki Kimura","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01018218956139474,"gpt":0.2339998161680842,"spread":0.2238176266066894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577641,0.000656544,0.0004759355,0.0004805995,0.0008446991,0.001114919,0.001577577,0.0002828559,0.001031166],"category_scores_gemma":[0.004224886,0.0003473331,0.0002272773,0.0005930139,0.000811714,0.001372939,0.001015438,0.0007531723,0.0002181784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007770901,"about_ca_system_score_gemma":0.002550749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004818294,"about_ca_topic_score_gemma":0.006544415,"domain_scores_codex":[0.998418,0.0002554427,0.0001228404,0.0002149447,0.0007040303,0.0002848579],"domain_scores_gemma":[0.9966369,0.0009183764,0.0004136282,0.001139216,0.0006372695,0.0002546463],"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.001933364,0.0005367618,0.02545721,0.0003704719,0.000158711,0.0005482102,0.001061992,0.2789944,0.2780093,0.02183542,0.007989328,0.3831048],"study_design_scores_gemma":[0.0001175737,0.0003794762,0.002255775,0.00002523166,0.00004660269,0.0002164148,0.0001661189,0.9101683,0.07673819,0.00549571,0.004342298,0.00004825138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6771111,0.001897215,0.3054152,0.0004502787,0.0001396648,0.0001475149,0.00007773902,0.00788448,0.006876871],"genre_scores_gemma":[0.9693125,0.0001559821,0.02914934,0.00007615101,0.00002284677,0.00003829215,0.00006245211,0.00008965648,0.001092745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004818294,"threshold_uncertainty_score":0.009580493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101209730","doi":"10.1145/2155620.2155655","title":"Hardware transactional memory for GPU architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":103,"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; Transactional memory; Parallel computing; Thread (computing); Cache coherence; Exploit; Instruction set; Cache; Operating system; CPU cache; Database transaction; Programming language","authors":[{"name":"Wilson Wai Lun Fung","is_ca":true},{"name":"Inderpreet Singh","is_ca":true},{"name":"Andrew Brownsword","is_ca":true},{"name":"Tor M. Aamodt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03282252343404647,"gpt":0.2356508613346849,"spread":0.2028283379006384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533941,0.0006433474,0.0005723008,0.0004866403,0.0005476523,0.001528095,0.003139427,0.0006016796,0.00737142],"category_scores_gemma":[0.002350655,0.0004012362,0.0004796608,0.001310663,0.0005004539,0.001815309,0.00118283,0.001775376,0.001713563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000975434,"about_ca_system_score_gemma":0.001146293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001704487,"about_ca_topic_score_gemma":0.002621193,"domain_scores_codex":[0.9992138,0.0001496684,0.00008213853,0.0001237236,0.0003526684,0.00007790578],"domain_scores_gemma":[0.9985477,0.0002707343,0.0001094715,0.0006041112,0.0003955861,0.0000722783],"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.001171894,0.0002277562,0.006156086,0.001568798,0.000256761,0.0006329433,0.0004170223,0.05361148,0.08647921,0.1344335,0.08808926,0.6269553],"study_design_scores_gemma":[0.000305027,0.0009165714,0.002254121,0.0002562607,0.0001888404,0.001058257,0.0002304824,0.5692406,0.09016848,0.07883751,0.2564029,0.0001410002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07542048,0.01850631,0.8542598,0.002190055,0.001237736,0.0003175846,0.001638181,0.01912997,0.02729973],"genre_scores_gemma":[0.5202097,0.004856616,0.4522265,0.001073874,0.0003262724,0.0006623962,0.002769957,0.001083716,0.01679092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00737142,"threshold_uncertainty_score":0.02465987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093347633","doi":"10.1137/s0895480100376022","title":"The Wakeup Problem in Synchronous Broadcast Systems","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Synchronization (alternating current); Computer science; Asynchronous communication; Clock synchronization; Parallel computing; Channel (broadcasting); Distributed computing; Computer network","authors":[{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01245770845899721,"gpt":0.2471855765119259,"spread":0.2347278680529287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299985,0.000797973,0.001347839,0.0006660437,0.001708146,0.001780308,0.001713469,0.001464742,0.003471144],"category_scores_gemma":[0.01263347,0.0007415719,0.0005461461,0.000888176,0.002014326,0.00554116,0.002628473,0.002021701,0.0005595525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001027132,"about_ca_system_score_gemma":0.001300669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160301,"about_ca_topic_score_gemma":0.001299976,"domain_scores_codex":[0.9971821,0.001114704,0.0001500884,0.0004446576,0.0005477752,0.000560651],"domain_scores_gemma":[0.9889121,0.008038743,0.001021351,0.0009294997,0.0005208425,0.000577428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001728531,0.0002946508,0.002927597,0.0007605679,0.0001170175,0.0007097302,0.001680256,0.4509344,0.01279915,0.4142537,0.009495741,0.1042987],"study_design_scores_gemma":[0.0002451331,0.0002125786,0.0004757103,0.00003680314,0.00005366466,0.0001800247,0.0003895779,0.73904,0.003457887,0.2505208,0.005352364,0.00003551949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608662,0.001416461,0.8263732,0.001169069,0.000191895,0.0002021717,0.0001713954,0.0009473175,0.008662314],"genre_scores_gemma":[0.9319667,0.0007673177,0.05896215,0.0002666245,0.0002220481,0.0002635079,0.0002630544,0.0001772452,0.007111236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003471144,"threshold_uncertainty_score":0.01586497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001271834","doi":"10.1145/1989727.1989732","title":"Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Adversary; Computer science; Scalability; Latency (audio); Adversary model; Cryptography; Theoretical computer science; Parallel computing; Algorithm; Discrete mathematics; Mathematics; Computer security","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02488932264454965,"gpt":0.2243628494667722,"spread":0.1994735268222225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941848,0.001431313,0.002219683,0.001098411,0.003345052,0.003427279,0.003895966,0.002305521,0.007312958],"category_scores_gemma":[0.01936636,0.0006657959,0.00149613,0.001030408,0.003820738,0.01043469,0.008190532,0.006539042,0.003830001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724926,"about_ca_system_score_gemma":0.003355883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103903,"about_ca_topic_score_gemma":0.0007958755,"domain_scores_codex":[0.9939178,0.0014436,0.0004163138,0.0008164056,0.002329882,0.001075943],"domain_scores_gemma":[0.9836426,0.005615021,0.002146003,0.006553615,0.001545981,0.0004968769],"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.003042164,0.0006460231,0.003822025,0.001121083,0.0003495796,0.0007057488,0.00270292,0.05361556,0.1471624,0.4894794,0.02102402,0.2763291],"study_design_scores_gemma":[0.0005814562,0.001075133,0.0009813249,0.0003185501,0.000195528,0.001131266,0.0007757517,0.3462787,0.1824556,0.3956091,0.0703501,0.0002474748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0537543,0.0004539896,0.9241758,0.002494776,0.0003052129,0.0004940758,0.0001789719,0.003933665,0.0142092],"genre_scores_gemma":[0.5928252,0.0004756343,0.3914685,0.0006666199,0.0001848067,0.0008353877,0.0003057646,0.001426046,0.0118121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007312958,"threshold_uncertainty_score":0.02613533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389509728","doi":"10.1145/3636553","title":"Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms","year":2023,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":98,"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":"Liveness; Computer science; Byzantine fault tolerance; Algorithm; Consensus algorithm; Latency (audio); Distributed computing; Fault tolerance","authors":[{"name":"Gengrui Zhang","is_ca":true},{"name":"Fei Pan","is_ca":true},{"name":"Yunhao Mao","is_ca":true},{"name":"Sofia Tijanic","is_ca":true},{"name":"Michael Dang’ana","is_ca":true},{"name":"Shashank Motepalli","is_ca":true},{"name":"Shiquan Zhang","is_ca":true},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1499517350762423,"gpt":0.3882971177179539,"spread":0.2383453826417117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851551,0.001157233,0.001511745,0.003090103,0.0006285207,0.00189859,0.001566302,0.001642801,0.003321833],"category_scores_gemma":[0.005198011,0.0006926407,0.0008555285,0.005346671,0.0009520031,0.003579779,0.0009923796,0.001980769,0.002553276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085308,"about_ca_system_score_gemma":0.002470677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001814345,"about_ca_topic_score_gemma":0.001650905,"domain_scores_codex":[0.9989809,0.0002265677,0.0001201471,0.0002211205,0.0003732297,0.00007800634],"domain_scores_gemma":[0.9975563,0.001643525,0.000148862,0.0001180768,0.0004720118,0.00006116705],"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.00006730144,0.00008453285,0.0003942039,0.01285344,0.00008484752,0.00008014224,0.0001619949,0.008000204,0.0008844527,0.05684063,0.01915811,0.9013903],"study_design_scores_gemma":[0.00002934961,0.0002560838,0.0006798137,0.007221612,0.0001787866,0.000696808,0.0001786332,0.008709291,0.001287891,0.04963752,0.9310546,0.00006963798],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000581628,0.9729214,0.01980213,0.0006904758,0.0004132008,0.00003494572,0.00004697029,0.00009042335,0.005418839],"genre_scores_gemma":[0.007924539,0.974538,0.01453318,0.0004913834,0.0006016354,0.00005915721,0.0001410996,0.00004892014,0.00166202],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003321833,"threshold_uncertainty_score":0.01111263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101397060","doi":"10.1109/pact.2007.42","title":"JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":95,"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; Transactional memory; Software transactional memory; Programming language; Rewriting; Parallel computing; Implementation; Operating system; Database transaction","authors":[{"name":"Marek Olszewski","is_ca":true},{"name":"Josh Cutler","is_ca":true},{"name":"J. Gregory Steffan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01089334841262969,"gpt":0.2440988763617894,"spread":0.2332055279491597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722548,0.0004832697,0.0005523686,0.0005133949,0.0005317623,0.00108995,0.002738671,0.0007213008,0.002836454],"category_scores_gemma":[0.00207353,0.0003701102,0.0006579047,0.0005969509,0.0008654229,0.001268541,0.001149985,0.001233898,0.0009765704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006472782,"about_ca_system_score_gemma":0.0007553376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298841,"about_ca_topic_score_gemma":0.001755544,"domain_scores_codex":[0.9990587,0.000223477,0.00008273312,0.0001257628,0.0004256538,0.00008363064],"domain_scores_gemma":[0.999141,0.0002166919,0.00007073113,0.0003714539,0.0001645612,0.0000355167],"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.0002985936,0.0001861026,0.001253638,0.0005226222,0.00008772208,0.0007919103,0.0006545296,0.05828311,0.1173328,0.2169197,0.01538545,0.5882838],"study_design_scores_gemma":[0.0001274648,0.0003711351,0.0006619818,0.00009133911,0.0001473161,0.001618825,0.0001120655,0.6207677,0.1602838,0.08084997,0.1348386,0.0001298968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007808643,0.0004642122,0.9817028,0.0001552252,0.00007805706,0.00007330027,0.00006234449,0.005072935,0.004582471],"genre_scores_gemma":[0.1703466,0.0005284309,0.8170457,0.0002907391,0.00009822291,0.0001903434,0.0003665713,0.001185874,0.009947451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002836454,"threshold_uncertainty_score":0.00948894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126321570","doi":"10.1145/335191.335393","title":"How to roll a join","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Distributed systems and fault tolerance","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; Materialized view; Asynchronous communication; Process (computing); Join (topology); Point (geometry); Refresh rate; Distributed computing; Database; Operating system; Computer hardware; Computer network; View","authors":[{"name":"Kenneth Salem","is_ca":true},{"name":"Kevin Beyer","is_ca":false},{"name":"Bruce G. Lindsay","is_ca":false},{"name":"Roberta Cochrane","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01619001446389559,"gpt":0.2327563099770128,"spread":0.2165662955131172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009820093,0.000683248,0.0005416619,0.00063633,0.001299941,0.003170004,0.001005694,0.001138298,0.02587328],"category_scores_gemma":[0.0044496,0.0005543829,0.0008280737,0.0004450353,0.0007907309,0.003345745,0.001491314,0.001591917,0.00986842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003648243,"about_ca_system_score_gemma":0.0008720218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004000856,"about_ca_topic_score_gemma":0.003881691,"domain_scores_codex":[0.9986048,0.0001880487,0.00008811134,0.0002767307,0.0006453299,0.0001969579],"domain_scores_gemma":[0.9985393,0.0003316136,0.00007168487,0.000598072,0.0002765788,0.0001826424],"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.001002206,0.0003335309,0.002928576,0.0003664983,0.00009890034,0.000743416,0.0007332409,0.01993184,0.03127182,0.0749215,0.1216368,0.7460316],"study_design_scores_gemma":[0.0006258319,0.0006066851,0.004181185,0.0002866685,0.0002253237,0.0013958,0.001726461,0.283461,0.057276,0.1865055,0.4633837,0.0003258177],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0345868,0.001361913,0.8325056,0.004628137,0.002278219,0.0009410121,0.001669659,0.03463146,0.0873972],"genre_scores_gemma":[0.3640887,0.001181577,0.5752281,0.001227578,0.0006115616,0.0003539118,0.002771781,0.003544201,0.0509925],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02587328,"threshold_uncertainty_score":0.08655471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791526170","doi":"10.1145/3164135.3164147","title":"Bztree: a high-performance latch-free range index for non-volatile memory","year":2018,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Non-volatile memory; Block (permutation group theory); Embedded system; Throughput; Computer hardware; Tree (set theory); Semiconductor memory; Code (set theory); Data retention; Parallel computing; Operating system","authors":[{"name":"Joy Arulraj","is_ca":false},{"name":"Justin J. Levandoski","is_ca":false},{"name":"Umar Farooq Minhas","is_ca":false},{"name":"Per-Åke Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02434901392116039,"gpt":0.2591629562395728,"spread":0.2348139423184124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002661118,0.0003602016,0.0003922962,0.001044345,0.000516211,0.00118315,0.001951149,0.0004372377,0.005624222],"category_scores_gemma":[0.001008278,0.0003190074,0.000247334,0.001372143,0.0002902851,0.002321023,0.001294776,0.0006530909,0.002703084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005346498,"about_ca_system_score_gemma":0.000825024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001411638,"about_ca_topic_score_gemma":0.001900243,"domain_scores_codex":[0.9995858,0.00002858638,0.0000335848,0.00004053268,0.000256149,0.00005530733],"domain_scores_gemma":[0.9994018,0.00009540514,0.00007582967,0.0001638327,0.0002018523,0.00006136617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001629246,0.0002555473,0.004006941,0.001019201,0.0001462969,0.000510006,0.000395564,0.009983262,0.2365191,0.02946468,0.1034215,0.6126488],"study_design_scores_gemma":[0.0007020609,0.001745407,0.005103471,0.0001838489,0.0001649908,0.001692691,0.0002781777,0.2274665,0.4081609,0.02468724,0.3294839,0.0003308193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1021134,0.008068644,0.8074611,0.0005135792,0.0006007947,0.0003790111,0.00328325,0.05490519,0.02267504],"genre_scores_gemma":[0.5429686,0.002332236,0.4130854,0.0006378849,0.0002144531,0.0006226764,0.01141077,0.003927645,0.02480036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005624222,"threshold_uncertainty_score":0.01881492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005064465","doi":"10.1145/2749469.2750403","title":"Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Transactional memory; Computer science; IBM; Software transactional memory; Scalability; Operating system; Overhead (engineering); Software; Memory management; Multi-core processor; Parallel computing; Computer architecture; Programming language; Database transaction","authors":[{"name":"Takuya Nakaike","is_ca":false},{"name":"Rei Odaira","is_ca":false},{"name":"Matthew Gaudet","is_ca":true},{"name":"Maged M. Michael","is_ca":false},{"name":"Hisanobu Tomari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09131539780630715,"gpt":0.3441698489587792,"spread":0.2528544511524721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00270001,0.001051729,0.0006980996,0.002733513,0.0005093519,0.001161099,0.002163541,0.0006726419,0.003020801],"category_scores_gemma":[0.01390552,0.000354098,0.0003181184,0.005707,0.0007964863,0.003172529,0.000680071,0.0007411343,0.0007099758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561295,"about_ca_system_score_gemma":0.001109464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003722151,"about_ca_topic_score_gemma":0.005249869,"domain_scores_codex":[0.9945179,0.0007440972,0.0004029172,0.0007757068,0.002934358,0.0006250463],"domain_scores_gemma":[0.9744521,0.01137463,0.001589572,0.002919444,0.008768938,0.0008952829],"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.009145373,0.001679474,0.07538126,0.003796031,0.0006171502,0.0007472946,0.0007691759,0.1541732,0.1686124,0.01350991,0.05853156,0.5130371],"study_design_scores_gemma":[0.0005383781,0.006713886,0.1126432,0.0002057332,0.0005602876,0.0008722952,0.001136591,0.5329085,0.3050394,0.004369594,0.03478118,0.0002309486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9616504,0.005750655,0.01032803,0.0003639791,0.0001982989,0.0001322623,0.003399296,0.005339282,0.0128378],"genre_scores_gemma":[0.9791764,0.0005477509,0.01203616,0.00009281393,0.00005188432,0.0001473983,0.005245593,0.0003537233,0.002348282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003722151,"threshold_uncertainty_score":0.01427925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051837689","doi":"10.5555/1109557.1109667","title":"Scalable leader election","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Leader election; Scalability; Computer science; Protocol (science); Set (abstract data type); Parallel computing; Limit (mathematics); Distributed computing; Computer network; Mathematics; Operating system; Programming language","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Vishal Sanwalani","is_ca":false},{"name":"Erik Vee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0078637736390246,"gpt":0.230137101409632,"spread":0.2222733277706073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119726,0.0006239114,0.001038116,0.0005498779,0.00105257,0.0009292898,0.001816251,0.0008010853,0.01052889],"category_scores_gemma":[0.003144269,0.0003603577,0.0004640617,0.0009683158,0.0006136979,0.002290768,0.002408603,0.001039735,0.00293847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005312379,"about_ca_system_score_gemma":0.0009538793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007092411,"about_ca_topic_score_gemma":0.001486653,"domain_scores_codex":[0.9987332,0.000249477,0.00005207351,0.0002289424,0.0005610005,0.0001753732],"domain_scores_gemma":[0.9986602,0.0004729329,0.0001192417,0.0003298284,0.0002960377,0.0001216278],"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.0005482885,0.0002665207,0.001118372,0.001183463,0.0002435437,0.0007490239,0.0003564585,0.1764959,0.03597578,0.2524824,0.1159946,0.4145856],"study_design_scores_gemma":[0.0003823274,0.0003514561,0.0004583625,0.00009907048,0.0001103645,0.0005903997,0.0002033397,0.6507372,0.01554205,0.2109035,0.1205574,0.00006455812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01395661,0.002488963,0.9280849,0.001253244,0.0007889036,0.0004507815,0.0004846004,0.004444904,0.04804708],"genre_scores_gemma":[0.5429175,0.002927614,0.4120151,0.0009090462,0.0006479044,0.001002721,0.001873376,0.0005256215,0.03718103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01052889,"threshold_uncertainty_score":0.03522265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963943319","doi":"10.1137/1.9781611975031.144","title":"Space-Optimal Majority in Population Protocols","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":76,"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":"Upper and lower bounds; Population; Logarithm; State (computer science); Protocol (science); Monotonic function; Binary logarithm; Mathematics; State space; Constant (computer programming); Computability; Discrete mathematics; Computer science; Combinatorics; Algorithm; Statistics","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"James Aspnes","is_ca":false},{"name":"Rati Gelashvili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0608947133276922,"gpt":0.2741779008733097,"spread":0.2132831875456175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758569,0.0009380052,0.00134677,0.0008380588,0.002095922,0.002302255,0.00209888,0.001789146,0.004683703],"category_scores_gemma":[0.01391473,0.0005731065,0.001075608,0.0009548817,0.003721652,0.005698786,0.005776255,0.002936839,0.0008537744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001738154,"about_ca_system_score_gemma":0.001908452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001449592,"about_ca_topic_score_gemma":0.001697128,"domain_scores_codex":[0.9968767,0.001119178,0.0001579923,0.0007290905,0.0006040325,0.0005130406],"domain_scores_gemma":[0.9895761,0.007376071,0.0006423031,0.00132835,0.0005851851,0.0004919405],"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.0004875944,0.0001217609,0.0008745346,0.0002326318,0.00006831736,0.0002931934,0.0009847429,0.4078194,0.008665551,0.5317823,0.004102767,0.04456728],"study_design_scores_gemma":[0.00009571727,0.0001289293,0.0001164279,0.00003097324,0.00002444218,0.0000819474,0.0001488115,0.5646426,0.004546102,0.4270224,0.003129084,0.00003264903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1316223,0.0006917914,0.8466849,0.001972733,0.0001067602,0.000249951,0.0002540899,0.001086943,0.01733059],"genre_scores_gemma":[0.8469635,0.0006273204,0.1398172,0.0006446876,0.0001081121,0.0005805025,0.0003529236,0.0002649085,0.01064087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004683703,"threshold_uncertainty_score":0.01566857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987782288","doi":"10.1145/1374376.1374410","title":"Tight RMR lower bounds for mutual exclusion and other problems","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Rocky Mountain Research Station","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Encoding (memory); Shared memory; Upper and lower bounds; Synchronization (alternating current); Parallel computing; Concurrency; Bounded function; Reading (process); Conjecture; Class (philosophy); Cache coherence; Theoretical computer science; Cache; CPU cache; Order (exchange); Discrete mathematics; Distributed computing; Mathematics; Computer network","authors":[{"name":"Hagit Attiya","is_ca":false},{"name":"Danny Hendler","is_ca":false},{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02553064880310718,"gpt":0.2379874146707169,"spread":0.2124567658676098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008106572,0.001965764,0.002976546,0.002590735,0.002759385,0.004725211,0.005669551,0.003171556,0.008904463],"category_scores_gemma":[0.06305999,0.001113854,0.002441466,0.002932601,0.004878708,0.01865115,0.006381638,0.008526721,0.001374715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005598148,"about_ca_system_score_gemma":0.002660732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001895084,"about_ca_topic_score_gemma":0.00163226,"domain_scores_codex":[0.986975,0.003501546,0.0004981289,0.002313056,0.004063609,0.002648633],"domain_scores_gemma":[0.8710051,0.1094025,0.004825957,0.00988602,0.002880068,0.002000257],"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.001568596,0.000731982,0.004389472,0.0009228145,0.0001969126,0.0003562841,0.001169949,0.3690311,0.01266126,0.5229876,0.01285653,0.07312746],"study_design_scores_gemma":[0.00009885614,0.0001400937,0.0008648727,0.00006910162,0.00007190449,0.0001806016,0.0001605665,0.5641611,0.006187705,0.4246843,0.003319968,0.00006104958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2140591,0.006450932,0.7210643,0.0140727,0.0003455663,0.0002332743,0.001063037,0.002241702,0.04046932],"genre_scores_gemma":[0.8634593,0.001765344,0.1199801,0.001373778,0.0008496405,0.0005357964,0.001119102,0.0009826631,0.009934279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008904463,"threshold_uncertainty_score":0.04287219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3109383821","doi":"10.1145/3428204","title":"How do programmers use unsafe rust?","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":75,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Rust (programming language); Computer science; Programmer; Compiler; Memory safety; Programming language; Code (set theory); Source code; Abstraction","authors":[{"name":"Vytautas Astrauskas","is_ca":false},{"name":"Christoph Matheja","is_ca":false},{"name":"Federico Poli","is_ca":false},{"name":"Péter Müller","is_ca":false},{"name":"Alexander J. Summers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02775053370188831,"gpt":0.246189855091322,"spread":0.2184393213894337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01064282,0.0004446706,0.0004055096,0.003801482,0.001775169,0.004095004,0.001491282,0.001510125,0.002046274],"category_scores_gemma":[0.107233,0.0009990128,0.00040268,0.004210689,0.005659316,0.01043724,0.003476636,0.002296576,0.001554551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578135,"about_ca_system_score_gemma":0.002663461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004593227,"about_ca_topic_score_gemma":0.005608388,"domain_scores_codex":[0.9833333,0.005352962,0.0008417261,0.002597072,0.006870961,0.00100383],"domain_scores_gemma":[0.8764629,0.06045334,0.02581451,0.01570937,0.01969637,0.001863516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001421769,0.000124158,0.2254928,0.001286233,0.0000984301,0.001433926,0.2942823,0.001012131,0.01035359,0.0325762,0.02814287,0.4050551],"study_design_scores_gemma":[0.00005892012,0.0003637027,0.2749755,0.002367766,0.0001446282,0.008272327,0.1617327,0.006653406,0.01839905,0.04660614,0.480016,0.0004099226],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8982088,0.003874487,0.04428279,0.017355,0.0002070079,0.0001053114,0.0008608329,0.002619089,0.03248673],"genre_scores_gemma":[0.9635151,0.002269609,0.0195791,0.003465301,0.00009602016,0.000136027,0.0009056725,0.002179051,0.007854161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01064282,"threshold_uncertainty_score":0.05628532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132213430","doi":"10.1145/1755913.1755933","title":"Otherworld","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":75,"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; Kernel (algebra); Mathematics; Discrete mathematics","authors":[{"name":"Alex Depoutovitch","is_ca":true},{"name":"Michael Stumm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004016871197081177,"gpt":0.2101956179899264,"spread":0.2061787467928453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008339158,0.001085207,0.0006295863,0.002141669,0.002317222,0.007799531,0.00189082,0.002154522,0.6619001],"category_scores_gemma":[0.004530788,0.000412532,0.0008637634,0.002319764,0.0009280298,0.006226277,0.004261245,0.002095754,0.4360407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001287718,"about_ca_system_score_gemma":0.00156401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005302116,"about_ca_topic_score_gemma":0.007712601,"domain_scores_codex":[0.9990944,0.0001345275,0.00004660438,0.0002096708,0.0003349693,0.0001799703],"domain_scores_gemma":[0.9982517,0.0002063517,0.00008862256,0.0005758588,0.0004965444,0.000380829],"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.00009449447,0.00002944622,0.0004100185,0.0001817703,0.00001157085,0.0001618502,0.0003945853,0.0001161936,0.0003984283,0.0642278,0.8236204,0.1103534],"study_design_scores_gemma":[0.000003387796,0.00000247658,0.00008443105,0.000030294,0.000001830929,0.00004323446,0.00005307862,0.00003041861,0.00005942716,0.00223963,0.9974478,0.000003946784],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0008989698,0.0012307,0.003971164,0.003706706,0.002181576,0.00008297018,0.004878161,0.004593661,0.9784561],"genre_scores_gemma":[0.009953468,0.00151151,0.003344197,0.002872348,0.0005971776,0.0001117806,0.008336044,0.003041454,0.9702321],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6619001,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170907411","doi":"10.1109/icde.2004.1320016","title":"Lazy database replication with ordering guarantees","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":73,"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":"Serializability; Computer science; Two-phase locking; Replication (statistics); Concurrency control; Distributed computing; Isolation (microbiology); Database transaction; Database; Transaction processing; Distributed transaction; Mathematics","authors":[{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Kenneth Salem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01329240840341745,"gpt":0.2400246965180468,"spread":0.2267322881146293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005220178,0.0007030603,0.001162644,0.0009843947,0.001628938,0.003393052,0.003307917,0.001356526,0.002898671],"category_scores_gemma":[0.02643923,0.0009225401,0.0006181691,0.002026941,0.002032506,0.006962982,0.004464455,0.002431202,0.001519423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231247,"about_ca_system_score_gemma":0.002814578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790038,"about_ca_topic_score_gemma":0.002012954,"domain_scores_codex":[0.993081,0.001433285,0.0006562468,0.0007601841,0.003483561,0.0005857277],"domain_scores_gemma":[0.9689627,0.006682377,0.002531458,0.01686171,0.004090317,0.0008713772],"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.001107817,0.0003131884,0.004906214,0.0006555883,0.0001600035,0.0007624455,0.001132214,0.2071404,0.028491,0.4836226,0.02135838,0.2503502],"study_design_scores_gemma":[0.0003898609,0.0003066522,0.0007185728,0.00006937332,0.000142665,0.0005885667,0.0001565988,0.5474474,0.01681919,0.4028128,0.03045421,0.00009398795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03674121,0.001305396,0.9505054,0.0007203692,0.0001314453,0.0001570451,0.0001767333,0.004712719,0.00554967],"genre_scores_gemma":[0.7238281,0.0009115167,0.2653588,0.0003221224,0.0004574578,0.0003064847,0.0004663903,0.0005427028,0.007806425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005220178,"threshold_uncertainty_score":0.02760726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137845880","doi":"10.1016/j.tcs.2007.04.036","title":"Agreement in synchronous networks with ubiquitous faults","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Impossibility; Computer science; Distributed computing; Topology (electrical circuits); Component (thermodynamics); Class (philosophy); Theoretical computer science; Mathematics","authors":[{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004726351572055682,"gpt":0.2285777725980709,"spread":0.2238514210260152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817553,0.0004608536,0.001610945,0.001188179,0.002095618,0.00352154,0.001910727,0.001851554,0.003616503],"category_scores_gemma":[0.02461292,0.000705728,0.0006007287,0.001666317,0.003292926,0.007955719,0.004021118,0.002645177,0.000531668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001513916,"about_ca_system_score_gemma":0.001741467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001426982,"about_ca_topic_score_gemma":0.001285619,"domain_scores_codex":[0.996444,0.001277496,0.000248387,0.0006790871,0.0008159848,0.0005350997],"domain_scores_gemma":[0.9713936,0.01976503,0.002249929,0.003228196,0.001821996,0.00154127],"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.0004175104,0.00007773835,0.0009939123,0.00009494946,0.00002164957,0.000369612,0.0006587041,0.06772644,0.002141807,0.9101035,0.001431778,0.01596233],"study_design_scores_gemma":[0.000107764,0.00006156762,0.000196133,0.0000136833,0.00002959926,0.0001058969,0.0001918437,0.2797875,0.001165314,0.7161804,0.00214202,0.00001838401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1784016,0.0007559537,0.807331,0.001359676,0.0002667676,0.0001107124,0.0001131952,0.0005381943,0.01112292],"genre_scores_gemma":[0.9642468,0.0004025764,0.0288713,0.0001313737,0.0002043141,0.0001343521,0.00007919235,0.00007784676,0.005852326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004817553,"threshold_uncertainty_score":0.02547801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050846431","doi":"10.1007/s00446-012-0168-6","title":"A framework for automated distributed implementation of component-based models","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Distributed computing; Asynchronous communication; Synchronizing; Component (thermodynamics); Implementation; POSIX Threads; Scheduling (production processes); Software deployment; Partition (number theory); Correctness; Distributed algorithm; Programming language; Thread (computing); Operating system; Computer network","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Marius Bozga","is_ca":false},{"name":"Mohamad Jaber","is_ca":false},{"name":"Jean Quilbeuf","is_ca":false},{"name":"Joseph Sifakis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03403358076798483,"gpt":0.326526578156011,"spread":0.2924929973880261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585039,0.001428249,0.0015088,0.00165883,0.001676029,0.005744028,0.005358757,0.002566513,0.007311522],"category_scores_gemma":[0.01195998,0.001717182,0.003014322,0.001417591,0.001779388,0.005850646,0.004876179,0.004208982,0.003026081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588075,"about_ca_system_score_gemma":0.003299807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006819891,"about_ca_topic_score_gemma":0.007800639,"domain_scores_codex":[0.9967591,0.0008425121,0.0003528747,0.0004119153,0.001390301,0.0002432271],"domain_scores_gemma":[0.9952034,0.001666213,0.0002477532,0.002014395,0.0006679595,0.0002004141],"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.0002124352,0.0003338236,0.001066458,0.0004549494,0.0002642461,0.0006290621,0.0008456874,0.1891944,0.009255807,0.5607356,0.01494914,0.2220584],"study_design_scores_gemma":[0.00008048161,0.00003983718,0.0001119102,0.0001009543,0.00009216954,0.0001517661,0.00006854282,0.7573336,0.005899902,0.1973237,0.03873728,0.00005984816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005344294,0.00003268714,0.9936199,0.00006162457,0.00001767662,0.00006946023,0.00004950729,0.004984434,0.0006302029],"genre_scores_gemma":[0.0375741,0.0001514863,0.9591058,0.00007182588,0.00003118758,0.0002761983,0.0004617183,0.001011969,0.001315656],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007311522,"threshold_uncertainty_score":0.02445948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112527958","doi":"10.1145/1538909.1538913","title":"Snapshot isolation and integrity constraints in replicated databases","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Seventh Framework Programme; Federación Española de Enfermedades Raras","keywords":"Computer science; Serializability; Correctness; Replica; Data integrity; Snapshot (computer storage); Database; Isolation (microbiology); Distributed computing; Rollback; Concurrency control; Two-phase locking; Distributed database; Fault tolerance; Database transaction; Distributed transaction; Transaction processing; Programming language","authors":[{"name":"Yi Lin","is_ca":true},{"name":"Bettina Kemme","is_ca":true},{"name":"Marta Patiño-Martı́nez","is_ca":false},{"name":"José Enrique Armendáriz-Íñigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04464981699830389,"gpt":0.2969985777953138,"spread":0.2523487607970099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761039,0.0006814023,0.0007569343,0.001284008,0.001154748,0.003939955,0.002604337,0.001881292,0.001917357],"category_scores_gemma":[0.01512338,0.0007747728,0.0009741287,0.002360591,0.004676317,0.00833667,0.003135661,0.003178799,0.0004947254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131503,"about_ca_system_score_gemma":0.001985819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002052251,"about_ca_topic_score_gemma":0.001319135,"domain_scores_codex":[0.992069,0.002391767,0.00103155,0.001083004,0.002892823,0.0005319468],"domain_scores_gemma":[0.9878407,0.006686011,0.001386865,0.002240202,0.00149998,0.0003462012],"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.00004369821,0.00003834313,0.0003872179,0.0001786209,0.00002275079,0.0005031926,0.0005667345,0.01277136,0.002530899,0.965076,0.001342726,0.01653843],"study_design_scores_gemma":[0.00007298148,0.00009162417,0.0004016838,0.0001195807,0.00005377669,0.0007562116,0.0002860719,0.07632276,0.008460076,0.8764246,0.03695431,0.00005641061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02412757,0.002673093,0.9545694,0.001631581,0.0002090422,0.0001835933,0.0003711981,0.0004134653,0.01582098],"genre_scores_gemma":[0.6112283,0.00335811,0.3743851,0.0008834837,0.0007010823,0.0006294785,0.0007677842,0.0002196213,0.007826959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004761039,"threshold_uncertainty_score":0.02517909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1580076017","doi":"10.1016/s0304-3975(01)00395-4","title":"Sense of direction in distributed computing","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computability; Computer science; Property (philosophy); Theoretical computer science; Graph; Object (grammar); Data science; Epistemology; Artificial intelligence","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Bernard Mans","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01064552619486338,"gpt":0.2326784418675454,"spread":0.222032915672682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003523139,0.0003715877,0.0005881268,0.001609165,0.001748227,0.005326472,0.001161825,0.002424701,0.002961018],"category_scores_gemma":[0.01471113,0.0004764682,0.0004972941,0.0015938,0.008091812,0.01253541,0.002992391,0.002886368,0.0005101288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007401049,"about_ca_system_score_gemma":0.001066501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009342298,"about_ca_topic_score_gemma":0.0007377919,"domain_scores_codex":[0.9974729,0.001033883,0.0002061945,0.0004671299,0.0006487409,0.000171034],"domain_scores_gemma":[0.9927751,0.003592669,0.000657966,0.001251363,0.001107275,0.000615567],"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.00003040188,0.00001209667,0.0003544147,0.00003002334,0.0000050822,0.0000243001,0.0005986657,0.000581457,0.0001885041,0.9886227,0.000685618,0.008866782],"study_design_scores_gemma":[0.00001791086,0.00001083647,0.0001022576,0.000007617452,0.000005706297,0.00003550293,0.0001955917,0.00161152,0.00007516443,0.9931855,0.004746066,0.000006235835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1142244,0.008549692,0.6905624,0.02088338,0.002059009,0.0001297143,0.0003227063,0.0005053517,0.1627633],"genre_scores_gemma":[0.9309105,0.001779325,0.05625368,0.0008019096,0.0007155329,0.0001913736,0.0001505087,0.00009336603,0.009103672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005326472,"threshold_uncertainty_score":0.01863235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142047930","doi":"10.1109/dcs.1988.12546","title":"Reliable group communication in distributed systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":63,"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":"Atomicity; Computer science; Communication in small groups; Overhead (engineering); Distributed computing; Group (periodic table); Property (philosophy); Mechanism (biology); Order (exchange); Transmission (telecommunications); Computer network; Process (computing); Message passing; Programming language; Telecommunications","authors":[{"name":"Srivallipuranandan Navaratnam","is_ca":true},{"name":"Samuel T. Chanson","is_ca":true},{"name":"Gerald Neufeld","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01176803613236109,"gpt":0.225052604666628,"spread":0.213284568534267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328129,0.0006761389,0.0007901679,0.00105852,0.001047551,0.002795883,0.001516148,0.001830954,0.003198037],"category_scores_gemma":[0.006764354,0.0005871335,0.0004252256,0.00186598,0.002518842,0.003041811,0.002042249,0.001793248,0.001903501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069319,"about_ca_system_score_gemma":0.001303784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009196251,"about_ca_topic_score_gemma":0.0005660982,"domain_scores_codex":[0.996783,0.001149639,0.000178127,0.0002922592,0.001388943,0.000207946],"domain_scores_gemma":[0.9977911,0.0009410544,0.0002128273,0.0005451223,0.0004080038,0.0001020203],"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.00006474683,0.00003459816,0.000299925,0.0005028276,0.00003349406,0.0004180547,0.0006530529,0.04182891,0.002149511,0.7975626,0.01688526,0.139567],"study_design_scores_gemma":[0.0001030159,0.0001329188,0.0001594637,0.0002273704,0.00005092713,0.0006280663,0.0001444904,0.1557403,0.002810281,0.6484952,0.1914497,0.0000583741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004389276,0.009817898,0.9604289,0.00174815,0.0007092243,0.0001428628,0.00005479042,0.001252752,0.02145614],"genre_scores_gemma":[0.4321293,0.01900385,0.5206917,0.001008583,0.002285119,0.001186439,0.0003784261,0.0004475159,0.02286902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003198037,"threshold_uncertainty_score":0.01231247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067397086","doi":"10.1007/s00446-007-0042-0","title":"Anonymous and fault-tolerant shared-memory computing","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Identifier; Asynchronous communication; Object (grammar); Distributed computing; Shared memory; Theoretical computer science; Theory of computation; Parallel computing; Programming language; Computer network; Artificial intelligence","authors":[{"name":"Rachid Guerraoui","is_ca":false},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069697413433289,"gpt":0.2478945046766815,"spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176801,0.0003022478,0.0006254021,0.000612196,0.001739087,0.002876005,0.001493636,0.001335305,0.002666078],"category_scores_gemma":[0.007782384,0.0003184434,0.0002901537,0.001238032,0.00218542,0.004790266,0.001805307,0.001361313,0.0005296899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008149726,"about_ca_system_score_gemma":0.0009549237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007916933,"about_ca_topic_score_gemma":0.0009625477,"domain_scores_codex":[0.9985121,0.0003495641,0.00007195456,0.0002018699,0.0006349516,0.0002296828],"domain_scores_gemma":[0.9957138,0.001955689,0.0003135123,0.001147755,0.0006426919,0.00022659],"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.0002397104,0.00007149788,0.0006165053,0.0001138382,0.00002473357,0.0002056089,0.0003614967,0.03987617,0.002370859,0.9024074,0.005995981,0.04771622],"study_design_scores_gemma":[0.00002773485,0.00002346069,0.0001678549,0.00001230144,0.00001907641,0.0001350922,0.00008104888,0.09005065,0.001974403,0.8945238,0.01296742,0.00001709108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1335546,0.005612809,0.8088734,0.005725837,0.001735941,0.00008498644,0.0001630101,0.001246797,0.04300249],"genre_scores_gemma":[0.9396695,0.001340344,0.03910671,0.0003474266,0.0007144848,0.00006588652,0.00008170788,0.00009122365,0.01858277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002876005,"threshold_uncertainty_score":0.008918941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408624168","doi":"10.1007/978-0-387-39940-9_2267","title":"Concurrency Control and Recovery","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency control; Concurrency; Parallel computing; Programming language","authors":[{"name":"University Research Chair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00973584720965117,"gpt":0.2173535442500901,"spread":0.2076176970404389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088752,0.001446301,0.001329403,0.001856446,0.001138822,0.004398158,0.00199218,0.001180718,0.03801816],"category_scores_gemma":[0.00179832,0.0008587059,0.0006263246,0.003413603,0.002553333,0.004146791,0.001914264,0.003141132,0.02665547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443988,"about_ca_system_score_gemma":0.001748071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002390243,"about_ca_topic_score_gemma":0.003698607,"domain_scores_codex":[0.9989858,0.000106736,0.00006369827,0.0002237341,0.000546713,0.00007326097],"domain_scores_gemma":[0.9992905,0.0001939402,0.00003420311,0.0002221802,0.0002038517,0.00005537362],"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.00003828614,0.00005727922,0.0001282679,0.0005121212,0.00002240094,0.0000705543,0.0004116395,0.001497889,0.002005915,0.326128,0.2329818,0.4361458],"study_design_scores_gemma":[0.0000108189,0.00002119484,0.0001758271,0.0002339569,0.0000133562,0.0002574425,0.00004786092,0.001938778,0.0008142104,0.1456755,0.8507912,0.00001988956],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001325664,0.1358439,0.2610479,0.004025719,0.005182542,0.0002834994,0.0008406661,0.003939065,0.5875111],"genre_scores_gemma":[0.0339189,0.08715728,0.1058811,0.002454047,0.004091243,0.0004703141,0.002345783,0.001517982,0.7621634],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03801816,"threshold_uncertainty_score":0.1271834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996703997","doi":"10.1145/3371113","title":"The future is ours: prophecy variables in separation logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":60,"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":"Horizon 2020; Horizon 2020 Framework Programme; Fonds Wetenschappelijk Onderzoek; European Commission","keywords":"Separation logic; Computer science; Hoare logic; Correctness; Axiomatic semantics; Soundness; Programming language; Atomicity; Concurrency; Theoretical computer science; Operational semantics; Semantics (computer science)","authors":[{"name":"Ralf Jung","is_ca":false},{"name":"Rodolphe Lepigre","is_ca":false},{"name":"G. Parthasarathy","is_ca":false},{"name":"Marianna Rapoport","is_ca":true},{"name":"Amin Timany","is_ca":false},{"name":"Derek Dreyer","is_ca":false},{"name":"Bart Jacobs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00815648363780745,"gpt":0.2676606539177327,"spread":0.2595041702799252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388313,0.0004053111,0.0004360895,0.00116692,0.002235444,0.003097752,0.001252296,0.001467014,0.002791732],"category_scores_gemma":[0.004427819,0.0004413451,0.0008059258,0.001210956,0.00867385,0.01012153,0.002588823,0.005820073,0.0004209338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002420167,"about_ca_system_score_gemma":0.001968471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003927835,"about_ca_topic_score_gemma":0.002622782,"domain_scores_codex":[0.997534,0.0008442309,0.00009407479,0.0004512367,0.0007073709,0.0003689463],"domain_scores_gemma":[0.9972532,0.001503738,0.0002424963,0.0004655815,0.0003671894,0.0001676859],"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.00001679604,0.000005556776,0.0001114015,0.00001636678,0.00000361234,0.00003627055,0.0003111892,0.0007455045,0.0001898008,0.992201,0.0005116811,0.005850776],"study_design_scores_gemma":[0.00002050071,0.00002481313,0.0001020469,0.00003344873,0.00001523053,0.00006798832,0.0001507623,0.006893498,0.001029904,0.9670475,0.02459566,0.00001866052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02747683,0.004463881,0.8951297,0.007268141,0.0004586874,0.00008133119,0.0001433661,0.0008289157,0.06414907],"genre_scores_gemma":[0.7777974,0.002489914,0.197356,0.00260567,0.00069091,0.0002167825,0.0001527229,0.0003502206,0.01834029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003927835,"threshold_uncertainty_score":0.01791936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"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":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Sam Toueg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01483399648761171,"gpt":0.2609815734317931,"spread":0.2461475769441814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920202,0.0009542321,0.001647534,0.0008933588,0.002108856,0.002663313,0.003421101,0.002824713,0.008006364],"category_scores_gemma":[0.02077135,0.0007901814,0.001295379,0.001021098,0.003842969,0.005296099,0.005183544,0.004001971,0.002253528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0020653,"about_ca_system_score_gemma":0.004384436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002173639,"about_ca_topic_score_gemma":0.001574627,"domain_scores_codex":[0.992301,0.002952337,0.0003320232,0.001209593,0.002281186,0.0009239303],"domain_scores_gemma":[0.9887263,0.005020905,0.0004345564,0.00305802,0.002440033,0.0003201634],"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.0006743628,0.00009498098,0.0005174791,0.0002727966,0.0001159656,0.0001754846,0.000390482,0.05986957,0.005868649,0.8716545,0.01360328,0.04676249],"study_design_scores_gemma":[0.0003957047,0.0001143064,0.0002524887,0.0000726853,0.00007667776,0.0001210629,0.0001220543,0.3414288,0.009413559,0.6332886,0.01463751,0.00007654683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02979471,0.0005943167,0.9173594,0.005831168,0.0008842833,0.0002594176,0.0002724879,0.001608322,0.04339584],"genre_scores_gemma":[0.7462149,0.0007108263,0.2255464,0.002538193,0.0005460829,0.000544195,0.0005698665,0.00063495,0.0226946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008006364,"threshold_uncertainty_score":0.03130937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098095723","doi":"10.14778/2732977.2732979","title":"Accordion","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":58,"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; Accordion; Partition (number theory); Heuristics; Bottleneck; Server; Distributed computing; Throughput; Distributed database; Database; Parallel computing; Operating system; Embedded system","authors":[{"name":"Marco Serafini","is_ca":false},{"name":"Essam Mansour","is_ca":false},{"name":"Ashraf Aboulnaga","is_ca":false},{"name":"Kenneth Salem","is_ca":true},{"name":"Taha Rafiq","is_ca":false},{"name":"Umar Farooq Minhas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004902096397346088,"gpt":0.1855455746408213,"spread":0.1806434782434752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985298,0.001475038,0.0009447496,0.001538044,0.001201947,0.004556341,0.003207856,0.001792109,0.2288791],"category_scores_gemma":[0.005362922,0.000751793,0.0008381822,0.001365597,0.0007371636,0.00428231,0.004370139,0.002248552,0.1484844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009450336,"about_ca_system_score_gemma":0.001882148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133195,"about_ca_topic_score_gemma":0.002298619,"domain_scores_codex":[0.9978116,0.0003156245,0.0001297797,0.0004723166,0.0009858033,0.0002847965],"domain_scores_gemma":[0.9967727,0.0004588309,0.0001620222,0.0009963633,0.001084622,0.0005253346],"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.001209342,0.0002745814,0.001976469,0.0005380274,0.00005316388,0.0004179681,0.0003106295,0.002743797,0.01005848,0.03331614,0.647711,0.3013904],"study_design_scores_gemma":[0.0001471898,0.0001464569,0.000887865,0.0001020689,0.00002300243,0.0003661808,0.00007912028,0.008552309,0.004479775,0.008482157,0.9766858,0.00004801772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01178072,0.00293048,0.1248691,0.004466131,0.003741567,0.0007818755,0.01421457,0.1674204,0.6697952],"genre_scores_gemma":[0.1045452,0.002944361,0.1208969,0.003665075,0.001413285,0.0009475531,0.0585077,0.03341533,0.6736646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2288791,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235325009","doi":"10.2139/ssrn.3559894","title":"Miner Collusion and the BitCoin Protocol","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Collusion; Protocol (science); Cryptocurrency; Computer security; Business; Internet privacy; Computer science; Medicine; Industrial organization","authors":[{"name":"Alfred Lehar","is_ca":true},{"name":"Christine A. Parlour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007346097033290928,"gpt":0.2272644407451494,"spread":0.2199183437118585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004362086,0.0005762647,0.001337256,0.001432089,0.002214873,0.00378733,0.00130452,0.003562182,0.007844955],"category_scores_gemma":[0.02549637,0.0005609454,0.0004706072,0.002311064,0.004359028,0.01140319,0.005779599,0.003690466,0.001073827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453566,"about_ca_system_score_gemma":0.001385801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001072708,"about_ca_topic_score_gemma":0.0007536163,"domain_scores_codex":[0.9959334,0.001953336,0.0001727929,0.0003353855,0.00110143,0.0005037936],"domain_scores_gemma":[0.9763184,0.01660932,0.001726129,0.003507697,0.001123344,0.0007151144],"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.0009452641,0.00008548106,0.0008998697,0.00007298499,0.00002818627,0.0004303787,0.0005310168,0.01932634,0.001478633,0.9569884,0.003459826,0.01575367],"study_design_scores_gemma":[0.0001047112,0.00003908881,0.0002097384,0.00003040456,0.00001667199,0.00027656,0.0001156116,0.09790045,0.001054083,0.8958277,0.004394844,0.00003016196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3936211,0.004710866,0.4475298,0.01926292,0.0007790856,0.0003366045,0.000446176,0.0009144257,0.1323991],"genre_scores_gemma":[0.9742451,0.000722056,0.01077576,0.0003534316,0.0002061949,0.0001068379,0.00008109283,0.00009417471,0.0134155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007844955,"threshold_uncertainty_score":0.02624398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172197636","doi":"10.1007/s00778-011-0260-8","title":"Scalability of write-ahead logging on multicore and multisocket hardware","year":2011,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","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":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Multi-core processor; Serialization; Operating system; Parallel computing; Database","authors":[{"name":"Ryan Johnson","is_ca":true},{"name":"Ippokratis Pandis","is_ca":false},{"name":"Radu Stoica","is_ca":false},{"name":"Manos Athanassoulis","is_ca":false},{"name":"Anastasia Ailamaki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04511224232357768,"gpt":0.2497341470458297,"spread":0.2046219047222521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332588,0.0008444802,0.0008002491,0.001236411,0.0009047691,0.001653621,0.001595659,0.0006628449,0.004637957],"category_scores_gemma":[0.01095811,0.0004839129,0.0002580027,0.001330553,0.001033298,0.0042172,0.001343323,0.001159931,0.0003651628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252011,"about_ca_system_score_gemma":0.002016804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004870123,"about_ca_topic_score_gemma":0.006298512,"domain_scores_codex":[0.9971671,0.0004607956,0.0001768786,0.0004645162,0.001012444,0.0007183834],"domain_scores_gemma":[0.9876426,0.006438448,0.0007625024,0.002434784,0.001905354,0.0008163844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01293821,0.002268733,0.04639383,0.001214454,0.0003599546,0.0008254221,0.001099338,0.4467735,0.1558176,0.01237715,0.02336645,0.2965653],"study_design_scores_gemma":[0.0003442533,0.0009536664,0.01078879,0.0000590118,0.0001674101,0.0002547102,0.000628337,0.9268247,0.05278238,0.005514705,0.001599621,0.00008241854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782657,0.002033339,0.0106836,0.0005334045,0.000195889,0.00004194151,0.0003331036,0.003159921,0.00475299],"genre_scores_gemma":[0.9958111,0.0001713778,0.002629645,0.00004939362,0.00003510424,0.00001551118,0.0001873854,0.00006505865,0.001035552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004870123,"threshold_uncertainty_score":0.01551551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160685416","doi":"10.1145/1824777.1824788","title":"Fast asynchronous Byzantine agreement and leader election with full information","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","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":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Leader election; Quantum Byzantine agreement; Computer science; Byzantine architecture; Adversary; Protocol (science); Constant (computer programming); Computation; Theoretical computer science; Monte Carlo method; Key (lock); Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Mathematics; Algorithm; Fault tolerance; Statistics","authors":[{"name":"Bruce M. Kapron","is_ca":true},{"name":"David Kempe","is_ca":false},{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Vishal Sanwalani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006362793586701465,"gpt":0.2146225370539929,"spread":0.2082597434672915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003785528,0.0008125292,0.001207542,0.0009053994,0.00167302,0.002413447,0.003298542,0.001845114,0.002382356],"category_scores_gemma":[0.01267453,0.0005796095,0.001028107,0.001201315,0.00340792,0.009725669,0.003930505,0.003648277,0.0007975868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487828,"about_ca_system_score_gemma":0.001529855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009719432,"about_ca_topic_score_gemma":0.000808258,"domain_scores_codex":[0.9961171,0.001276654,0.0001770224,0.0006330102,0.001225492,0.0005706939],"domain_scores_gemma":[0.9893296,0.00558199,0.001096574,0.002965948,0.000679276,0.0003465696],"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.0003579267,0.00009957227,0.0003927235,0.0001432587,0.00003246581,0.000196629,0.0005413103,0.1395553,0.006475946,0.8124792,0.00259265,0.03713309],"study_design_scores_gemma":[0.0001004319,0.0001204393,0.00009643323,0.00002131222,0.00002035528,0.0001084513,0.00005009564,0.4795454,0.007846803,0.5057704,0.006281017,0.00003883079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02558795,0.0002083057,0.9689881,0.0006446706,0.0000847557,0.00008824721,0.00005050156,0.0003883585,0.003959175],"genre_scores_gemma":[0.6287782,0.0005859769,0.3595151,0.0003852743,0.0003144827,0.0005265126,0.0001484758,0.0002853482,0.009460616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003785528,"threshold_uncertainty_score":0.02002001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133718851","doi":"10.1007/s00446-008-0068-y","title":"On implementing omega in systems with weak reliability and synchrony assumptions","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","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":"Lossy compression; Reliability (semiconductor); Computer science; Process (computing); Crash; Core (optical fiber); Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Carole Delporte-Gallet","is_ca":false},{"name":"Hugues Fauconnier","is_ca":false},{"name":"Sam Toueg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01336803634467652,"gpt":0.239738238464348,"spread":0.2263702021196715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009005548,0.001049995,0.001418074,0.0008619538,0.001774014,0.00268388,0.00231568,0.001827276,0.00432013],"category_scores_gemma":[0.03291757,0.0008485015,0.0009474163,0.001085675,0.003906088,0.01272799,0.006934017,0.004710176,0.0008948735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001340715,"about_ca_system_score_gemma":0.00193694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789877,"about_ca_topic_score_gemma":0.001594656,"domain_scores_codex":[0.9955124,0.001665124,0.000336262,0.000383143,0.001275721,0.0008273099],"domain_scores_gemma":[0.9703481,0.01958378,0.001085778,0.006479405,0.001932618,0.000570446],"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.001267342,0.0002155934,0.002765789,0.000258017,0.00006202164,0.000220367,0.001292124,0.1030945,0.006328263,0.763335,0.004111777,0.1170492],"study_design_scores_gemma":[0.0001219853,0.0002232865,0.0002342229,0.00005559176,0.00006544172,0.0000837117,0.0003135777,0.3605182,0.007744813,0.6262851,0.004319922,0.00003418976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06934384,0.0002547417,0.9173099,0.001676543,0.0001353951,0.0001037616,0.00003912962,0.001298693,0.009838074],"genre_scores_gemma":[0.7560529,0.0006133417,0.2312006,0.0007152128,0.0001823797,0.0003508464,0.0001571775,0.0005594593,0.01016804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009005548,"threshold_uncertainty_score":0.04762644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898165178","doi":"10.1145/3289137.3289150","title":"Recent Algorithmic Advances in Population Protocols","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"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; Theoretical computer science; Probabilistic logic; Population; Abstraction; Protocol (science); Graph; Distributed computing; Communications protocol; Wireless network; Wireless; Artificial intelligence; Computer network","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"Rati Gelashvili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.025634826433567,"gpt":0.3262800787899436,"spread":0.3006452523563766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003861179,0.001379779,0.001361884,0.001748899,0.001618023,0.003543909,0.003345049,0.002748443,0.008053949],"category_scores_gemma":[0.01465229,0.0009252434,0.001760172,0.002990758,0.004325238,0.006510296,0.004534166,0.006819522,0.002336762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002635218,"about_ca_system_score_gemma":0.002107915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103117,"about_ca_topic_score_gemma":0.001285031,"domain_scores_codex":[0.9966069,0.001166437,0.0001649098,0.0006890238,0.001124627,0.0002480605],"domain_scores_gemma":[0.9926029,0.00505718,0.0002957562,0.001030173,0.0007694291,0.0002445488],"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.00001993317,0.00002785245,0.0002357471,0.0002262574,0.00003221427,0.00004543859,0.0001526703,0.014278,0.0001660262,0.9391629,0.006185332,0.03946776],"study_design_scores_gemma":[0.00003030674,0.00002619508,0.0001413553,0.0001051075,0.00002111647,0.00009220913,0.00005194917,0.0479811,0.0001645942,0.8780268,0.07334056,0.00001882573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006129992,0.04969748,0.8291168,0.01560486,0.001876245,0.0001411611,0.0003093546,0.0003789619,0.09674516],"genre_scores_gemma":[0.2850692,0.1109496,0.5313735,0.007728835,0.01048533,0.001334989,0.001323547,0.0006846816,0.05105026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008053949,"threshold_uncertainty_score":0.02694315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033942886","doi":"10.1145/2429069.2429086","title":"Inductive data flow graphs","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","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":"","keywords":"Control flow graph; Correctness; Computer science; Data flow diagram; Theoretical computer science; Thread (computing); Graph; Control flow; Data-flow analysis; Program analysis; Algorithm; Programming language; Database","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Zachary Kincaid","is_ca":true},{"name":"Andreas Podelski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03438226618304596,"gpt":0.2497571538607306,"spread":0.2153748876776847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056407,0.001089016,0.000664133,0.002210279,0.001439815,0.001992531,0.002393167,0.001144249,0.005080647],"category_scores_gemma":[0.01125677,0.0006637476,0.0019472,0.001478099,0.003636716,0.00597068,0.002272156,0.002282915,0.001047068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001620152,"about_ca_system_score_gemma":0.002245385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004755816,"about_ca_topic_score_gemma":0.003563994,"domain_scores_codex":[0.9962029,0.0009566059,0.0003089589,0.0008217089,0.00126602,0.0004437101],"domain_scores_gemma":[0.9866884,0.008209181,0.00084178,0.001748491,0.002250349,0.0002617266],"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.000227195,0.0001500514,0.001618069,0.0004032949,0.00004877261,0.0004685063,0.0007269409,0.0476651,0.009834887,0.8451967,0.003965425,0.08969515],"study_design_scores_gemma":[0.00004558985,0.00006800075,0.0002847179,0.00009348463,0.00005762053,0.0001546158,0.0001243887,0.1042132,0.01772869,0.8511038,0.02607491,0.00005096782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006455333,0.00004818007,0.9873059,0.0001869083,0.00003333487,0.0001806333,0.0005245049,0.001412815,0.00385241],"genre_scores_gemma":[0.2834752,0.000382015,0.7036207,0.0006188392,0.0001548192,0.001244928,0.003008279,0.0008959311,0.006599293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005080647,"threshold_uncertainty_score":0.01699644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1760381732","doi":"10.1007/978-3-642-17679-1_18","title":"Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Asynchronous communication; Constant (computer programming); Fraction (chemistry); Byzantine fault tolerance; Quantum Byzantine agreement; Distributed computing; Set (abstract data type); Binary logarithm; Parallel computing; Theoretical computer science; Computer network; Discrete mathematics; Fault tolerance; Mathematics","authors":[{"name":"Valerie King","is_ca":true},{"name":"Steven Lonargan","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Amitabh Trehan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01137290983214445,"gpt":0.2202480344864702,"spread":0.2088751246543258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386234,0.0006591716,0.001557054,0.0007196821,0.00164047,0.001871089,0.002044976,0.0009996397,0.005060635],"category_scores_gemma":[0.002638065,0.0004007201,0.0003683757,0.00116663,0.0007823876,0.003487308,0.003012239,0.001147011,0.001366179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006730346,"about_ca_system_score_gemma":0.001159254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008373209,"about_ca_topic_score_gemma":0.00153367,"domain_scores_codex":[0.9986867,0.0003186415,0.00007864644,0.0002409314,0.0005009721,0.0001740575],"domain_scores_gemma":[0.9983404,0.0005581927,0.0001125367,0.0006367211,0.0002741824,0.00007795848],"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.002431279,0.0005278211,0.0006838324,0.0007996039,0.0001637124,0.0003528726,0.0008881976,0.1615143,0.120588,0.1791914,0.02143331,0.5114258],"study_design_scores_gemma":[0.0002332473,0.0003293705,0.0002641863,0.00004526692,0.0000501061,0.0001593608,0.0001449315,0.8372969,0.0353606,0.1143217,0.01174642,0.00004786144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04857208,0.0008140067,0.9353818,0.0004644732,0.0003179182,0.0003644266,0.0003703887,0.002054814,0.01166001],"genre_scores_gemma":[0.6580291,0.0003909082,0.3239282,0.0001995597,0.0002009642,0.0004625013,0.0005033516,0.0002180102,0.01606731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005060635,"threshold_uncertainty_score":0.01692957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}