{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002219024,0.0004786936,0.001378692,0.0001546023,0.000207129,0.0004217849,0.003535477,0.0002884672,0.00001084481],"category_scores_gemma":[0.0001742275,0.0004064941,0.0003411626,0.001168747,0.00002916951,0.0002650442,0.0003517374,0.0004136775,0.0004232716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006902857,"about_ca_system_score_gemma":0.0003143147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007178944,"about_ca_topic_score_gemma":0.00001471128,"domain_scores_codex":[0.99607,0.001291748,0.0008721486,0.0008781143,0.0004089113,0.0004791027],"domain_scores_gemma":[0.9970049,0.0004776024,0.0005183536,0.00175869,0.000127977,0.0001125318],"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":[9.582612e-8,0.00002605409,0.000009735648,0.00247549,0.00003002939,0.00001348093,0.00007620804,0.00003350708,6.160529e-9,0.0001714811,0.001162132,0.9960018],"study_design_scores_gemma":[0.00007122033,0.00001991008,0.00004737384,0.006242502,0.00003026856,0.00006605625,0.000001622356,0.003240663,1.796391e-7,0.0001389439,0.9896556,0.0004856276],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000006087731,0.8588279,0.1386812,0.00003164837,0.0007581447,0.0003970849,0.00002839027,0.0003954497,0.0008741013],"genre_scores_gemma":[0.0002874965,0.9965454,0.002202362,0.00003211475,0.0003619587,0.00002319231,0.0002218177,0.00003924817,0.0002863884],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9955162,"threshold_uncertainty_score":0.9998387,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009082058,0.00005651817,0.00006524208,0.00002265632,0.00006359657,0.0000864279,0.0003288007,0.00002725602,0.0001771068],"category_scores_gemma":[0.000001503444,0.00004762222,0.00003969029,0.0001335775,0.0000128949,0.0004199179,0.00001298186,0.00004854141,0.0003940688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002503376,"about_ca_system_score_gemma":0.00003167287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001577478,"about_ca_topic_score_gemma":0.00002127692,"domain_scores_codex":[0.9994134,0.000009137276,0.0001169257,0.0001644059,0.0001633264,0.0001327594],"domain_scores_gemma":[0.9996638,0.00001107658,0.00001858352,0.0002198744,0.00003206252,0.00005460739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004670166,0.0001588662,0.00006604678,0.000009145346,0.00002529413,0.000007027033,0.0004018311,0.001842992,0.001432727,0.5781522,0.03515403,0.3827451],"study_design_scores_gemma":[0.00066409,0.0000276325,0.00250025,0.00000918655,0.000002182381,0.00007064146,0.00003105056,0.1698311,0.004212701,0.001604059,0.8207728,0.0002743712],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00174793,0.00006091919,0.9104401,0.002794215,0.0002348721,0.00004439096,0.000001962413,0.0001796872,0.08449594],"genre_scores_gemma":[0.9660715,0.00000176674,0.02563272,0.0006731657,0.0001187845,0.000006117731,0.000001387563,0.000002362715,0.007492156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9643236,"threshold_uncertainty_score":0.5065089,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001516074,0.00009712558,0.0001180032,0.00003509174,0.00008407718,0.0001888973,0.00145227,0.00004420535,0.00003634487],"category_scores_gemma":[0.00006850418,0.00008257155,0.00003632011,0.0001770875,0.00001898452,0.0005923026,0.0001874059,0.0000791116,0.000842883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589762,"about_ca_system_score_gemma":0.00002144647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003444729,"about_ca_topic_score_gemma":0.00004397355,"domain_scores_codex":[0.999119,0.00002512444,0.0001674184,0.0002542843,0.0001991475,0.0002350555],"domain_scores_gemma":[0.9989304,0.0001016181,0.00007067953,0.0007806229,0.00003623304,0.00008047585],"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.00001669964,0.0003075145,0.008827047,0.00008130776,0.00008021457,0.0001133555,0.003195398,0.002878663,0.002169182,0.2091263,0.1302429,0.6429614],"study_design_scores_gemma":[0.0004158386,0.00005572742,0.01003877,0.00003809597,0.000006127868,0.00002446366,0.00004312401,0.03666357,0.001572622,0.0008994553,0.9499002,0.0003420583],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4074455,0.003731313,0.4004494,0.03687444,0.003659339,0.0006894187,0.00009669714,0.002093958,0.14496],"genre_scores_gemma":[0.9756184,0.000004609361,0.02269336,0.0006652075,0.0002685111,0.0000056358,0.000004981414,0.000004634409,0.0007346156],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8196572,"threshold_uncertainty_score":0.9999351,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267094,0.0001318681,0.0001836601,0.00004435397,0.0003898634,0.0001750698,0.000827454,0.00006035689,0.000001649331],"category_scores_gemma":[0.00009262704,0.0001012922,0.00008755139,0.0006541482,0.0000502647,0.0001692224,0.0001296233,0.0001327548,0.000007691612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006043773,"about_ca_system_score_gemma":0.00003672708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003153499,"about_ca_topic_score_gemma":0.000003650719,"domain_scores_codex":[0.9982085,0.00006177539,0.0006469056,0.0002648699,0.0004472832,0.000370641],"domain_scores_gemma":[0.9983837,0.0004002952,0.0003854322,0.0004502683,0.0003050618,0.00007526307],"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.00005473757,0.000267071,0.04318874,0.00006713584,0.00008767055,0.00002588793,0.0007121328,0.07189802,0.0004323566,0.7518101,0.003082318,0.1283738],"study_design_scores_gemma":[0.0008236195,0.0001153425,0.4656373,0.0001790201,0.000004328559,0.00003512761,0.0001644194,0.5105296,0.000617619,0.007170006,0.01437641,0.0003472102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02742673,0.00004139248,0.9700186,0.0001648796,0.0002190991,0.001528798,0.00003493496,0.0001358986,0.0004296783],"genre_scores_gemma":[0.9917646,1.577006e-7,0.008006996,0.00003638189,0.00004418573,0.00003733603,0.00009824424,0.000006040924,0.000006034867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9643379,"threshold_uncertainty_score":0.4130577,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002415412,0.000237284,0.0002897597,0.0001550315,0.0002471995,0.0004294205,0.001677285,0.0001089088,0.00001391436],"category_scores_gemma":[0.000003027958,0.0002179234,0.0001492259,0.0004556986,0.0000257838,0.0006380141,0.00002380799,0.000220286,0.0008701165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009680658,"about_ca_system_score_gemma":0.00004275791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005925756,"about_ca_topic_score_gemma":0.00001303602,"domain_scores_codex":[0.9981066,0.0001047058,0.0004551309,0.0005518603,0.0003948503,0.0003868495],"domain_scores_gemma":[0.997867,0.0001120198,0.0001038839,0.001637684,0.0001085582,0.0001708348],"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.00001583038,0.0006709634,0.00004169005,0.0001222869,0.0001834352,0.00004798201,0.001334529,0.1871061,0.0001097816,0.03046874,0.01837727,0.7615213],"study_design_scores_gemma":[0.0007152369,0.0001687029,0.0001947683,0.0001887899,0.000008775208,0.0002005729,0.00002491662,0.5873579,0.000285278,0.00007638684,0.4103377,0.0004410495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000893802,0.0002624765,0.9905936,0.001405939,0.004885478,0.0002874875,0.00002013654,0.0005615212,0.001089551],"genre_scores_gemma":[0.9312487,0.00001235704,0.06573576,0.0004957441,0.001000196,0.00008215402,0.0000038325,0.00001940096,0.001401817],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.930355,"threshold_uncertainty_score":0.9999079,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001964764,0.0008101938,0.001626427,0.0005908941,0.0004465781,0.0007599372,0.003787812,0.0006719683,0.0000106371],"category_scores_gemma":[0.00011946,0.0005829137,0.001408833,0.001016368,0.0003635006,0.0002300382,0.001807215,0.0006723136,0.00001043718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001766099,"about_ca_system_score_gemma":0.0003074133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006621909,"about_ca_topic_score_gemma":0.00002159098,"domain_scores_codex":[0.9946342,0.0001096084,0.002602102,0.0007592104,0.0009292946,0.0009655505],"domain_scores_gemma":[0.9926748,0.0003773716,0.002283645,0.003102191,0.001348596,0.0002134234],"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.002438769,0.006073011,0.005043887,0.04236728,0.05896762,0.00001581661,0.06242848,0.6540467,0.0002579503,0.07826328,0.05320869,0.03688849],"study_design_scores_gemma":[0.002474996,0.0001929381,0.0005622954,0.0002638542,0.0006940164,0.00001667733,0.0005808628,0.9737257,0.0002177695,0.0008214021,0.01976087,0.0006885634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005399509,0.00003878482,0.9102887,0.0003063162,0.000701889,0.0772612,0.004712096,0.0001508796,0.0011406],"genre_scores_gemma":[0.648883,0.000007200707,0.1328948,0.0011382,0.0006183347,0.2129498,0.002648026,0.0001465176,0.0007141788],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7773939,"threshold_uncertainty_score":0.9996622,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009294221,0.00008759632,0.0001001769,0.00003394064,0.0000949812,0.0001211632,0.000376408,0.00004637361,0.00002239519],"category_scores_gemma":[9.253635e-7,0.00008376423,0.00006324866,0.0001791627,0.00002803488,0.0002188306,0.000008455417,0.00007273714,0.0001949361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000356288,"about_ca_system_score_gemma":0.00004424982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001810061,"about_ca_topic_score_gemma":0.0000315147,"domain_scores_codex":[0.9992408,0.00002065538,0.0001648609,0.0002286274,0.000152872,0.0001922063],"domain_scores_gemma":[0.9996006,0.00001784143,0.00004011923,0.000260683,0.00004518081,0.00003553216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001568881,0.0003680165,0.0002789971,0.00004953876,0.00004246967,0.00009570314,0.0003178855,0.002106832,0.7215926,0.03993659,0.2078629,0.02733279],"study_design_scores_gemma":[0.001953143,0.00006425909,0.009977279,0.00006044213,0.00001178222,0.0003234101,0.0000280691,0.01256589,0.327532,0.008976295,0.6376547,0.0008527696],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06126255,0.0002543634,0.9229743,0.000576489,0.001507613,0.00009274509,0.00002501039,0.0001840967,0.01312284],"genre_scores_gemma":[0.9899272,0.000001412257,0.005576509,0.0002002547,0.0002281888,0.000008545114,0.000006022084,0.00000576228,0.004046092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9286647,"threshold_uncertainty_score":0.3415806,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002346419,0.000462003,0.0008568477,0.0001186463,0.0005399209,0.0002857147,0.001537892,0.00023365,0.00000255014],"category_scores_gemma":[0.001192744,0.0004756514,0.0003956437,0.001562261,0.0001426161,0.0003372133,0.0002507809,0.0003156462,0.000007963256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002032465,"about_ca_system_score_gemma":0.0002426369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004339594,"about_ca_topic_score_gemma":0.000004831496,"domain_scores_codex":[0.9951001,0.0003171561,0.00179535,0.001173726,0.0005426154,0.001071089],"domain_scores_gemma":[0.9954721,0.0008823109,0.001028574,0.001505017,0.0008324793,0.0002794753],"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.0005797469,0.003291491,0.03457547,0.001783901,0.0009596645,0.0001154636,0.003914486,0.1165141,0.01169766,0.6792864,0.03321145,0.1140702],"study_design_scores_gemma":[0.007730723,0.0005230135,0.020863,0.0005422675,0.00006716172,0.0001006093,0.0005135322,0.9099503,0.01938593,0.005468548,0.0332696,0.001585331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0701034,0.0002415541,0.9239806,0.0001582736,0.0008600277,0.0007113399,0.00279796,0.0004190751,0.0007277523],"genre_scores_gemma":[0.9647329,0.000001983497,0.03399343,0.00005056236,0.0001029492,0.00001033947,0.001072342,0.00002264625,0.00001283572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8946295,"threshold_uncertainty_score":0.9997695,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978205,0.0001205819,0.0001222955,0.00005181143,0.0001449253,0.0002091077,0.001094896,0.00003293064,0.00003674175],"category_scores_gemma":[0.0000455101,0.00009965023,0.00001521877,0.0004001902,0.00001919178,0.002245635,0.0003429194,0.00006899979,0.000059048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001963269,"about_ca_system_score_gemma":0.00005683388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003941773,"about_ca_topic_score_gemma":0.0002725373,"domain_scores_codex":[0.9985438,0.00004731883,0.0002185538,0.0006959118,0.0002592624,0.0002351323],"domain_scores_gemma":[0.996239,0.00005179616,0.0001199431,0.003469176,0.0000733806,0.00004670395],"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.00004875265,0.0007619601,0.0230365,0.0001075176,0.00003660625,0.0001031139,0.00004752919,0.0002773299,0.003377244,0.1401359,0.8247688,0.007298661],"study_design_scores_gemma":[0.0005923561,0.00004902753,0.01319203,0.00008182238,0.0000129628,0.00003832086,0.00001332776,0.1822129,0.0008913056,0.0001392337,0.8024815,0.0002951558],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00967978,0.000370962,0.9815481,0.0003869559,0.0001598094,0.0001983691,0.005781267,0.0001760215,0.001698709],"genre_scores_gemma":[0.93562,0.00001531892,0.0216064,0.0003319687,0.0002052235,0.00002341185,0.04197833,0.00001114405,0.0002082257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9599417,"threshold_uncertainty_score":0.4063618,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224434,0.000103501,0.0002751823,0.00009195692,0.0001239923,0.00005594218,0.0002963421,0.00006446159,6.752857e-7],"category_scores_gemma":[0.00007591651,0.00008940473,0.00007336124,0.0002884739,0.00003095875,0.0003624646,0.0000547315,0.00009759998,3.74681e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004441871,"about_ca_system_score_gemma":0.0000607404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003331058,"about_ca_topic_score_gemma":8.526167e-7,"domain_scores_codex":[0.9986486,0.00002768647,0.000756179,0.0001288578,0.0002329761,0.0002057409],"domain_scores_gemma":[0.9982255,0.0001544759,0.0008545712,0.0001318628,0.000549487,0.00008411688],"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.0005825761,0.0004827842,0.04239114,0.001394929,0.0002490953,0.00004254832,0.002243269,0.2983942,0.004349878,0.02521218,0.003125486,0.6215319],"study_design_scores_gemma":[0.001546231,0.0003687663,0.03047768,0.0003410826,0.00002015245,0.0001762989,0.0002088422,0.9645787,0.001080466,0.0003184807,0.0007098143,0.0001735092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3249575,0.0002668598,0.6743159,0.00007325821,0.0002231581,0.00008081628,0.000007621039,0.00001107654,0.00006376127],"genre_scores_gemma":[0.972165,0.00002176528,0.02762393,0.00001867052,0.000143521,4.712952e-7,0.00001421228,0.00000417477,0.000008263003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6661845,"threshold_uncertainty_score":0.3645819,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019263,0.0002115714,0.0002701318,0.0001096116,0.0003662662,0.0002860872,0.002940777,0.00006847743,0.000008600126],"category_scores_gemma":[0.0002264319,0.0001978387,0.00005821977,0.0004004269,0.0000319423,0.001570897,0.00003012916,0.0001520894,0.00006759712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000621909,"about_ca_system_score_gemma":0.00007522446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003000261,"about_ca_topic_score_gemma":0.0001027162,"domain_scores_codex":[0.9974681,0.0002114128,0.0004437069,0.001207855,0.0003400608,0.0003289267],"domain_scores_gemma":[0.9898357,0.0002005647,0.000308832,0.009291735,0.0001818246,0.0001813188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002358394,0.005850502,0.0009087333,0.001475437,0.001197891,0.0001539644,0.001832866,0.03085976,0.004745557,0.708931,0.09163543,0.152173],"study_design_scores_gemma":[0.001554626,0.0001926529,0.000128421,0.0003205599,0.00004436214,0.0001406054,0.0006725869,0.32645,0.002342142,0.0006314173,0.6668081,0.0007144853],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000476628,0.000186613,0.9896952,0.0003626711,0.001473604,0.000891305,0.006437166,0.0002152421,0.000261597],"genre_scores_gemma":[0.9465595,0.00003281419,0.05020843,0.0002736149,0.0001567689,0.0007003801,0.00120459,0.00003777323,0.0008261548],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9460828,"threshold_uncertainty_score":0.8067627,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001449486,0.000123455,0.0001531955,0.0000380973,0.00009051675,0.0002550311,0.0007599603,0.00007092866,0.00001004544],"category_scores_gemma":[0.00003692944,0.0001024785,0.00003729713,0.0002387411,0.00004084154,0.0003581321,0.0002847487,0.00009215463,0.00008206348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003104097,"about_ca_system_score_gemma":0.00005005637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002413231,"about_ca_topic_score_gemma":0.00009660239,"domain_scores_codex":[0.9989845,0.00001637103,0.0001947871,0.0003491946,0.0002067518,0.0002484192],"domain_scores_gemma":[0.9990052,0.00002260136,0.00004841503,0.0007184065,0.00006547411,0.0001399325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007687987,0.0001837271,0.001176774,0.00007282836,0.00002975781,0.000151097,0.001342034,0.0002809793,0.0008220127,0.9392338,0.0188329,0.0378664],"study_design_scores_gemma":[0.01496415,0.000804542,0.1894167,0.000703347,0.00003057195,0.0009672788,0.000229776,0.04794582,0.005800058,0.1862193,0.5496742,0.003244229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06640679,0.0006947338,0.8938947,0.005288931,0.0006935669,0.0002452018,0.00001506184,0.0005047784,0.03225618],"genre_scores_gemma":[0.9797336,0.00001492452,0.01784494,0.0005709556,0.00009190406,0.000007835996,0.000002679653,0.000006025016,0.001727129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9133268,"threshold_uncertainty_score":0.4178953,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576579,0.0001498588,0.0002248191,0.00003509383,0.0002112618,0.00007329936,0.001002706,0.0000550194,0.000007378488],"category_scores_gemma":[0.0001446194,0.00009982893,0.0001229257,0.0005594726,0.0001070968,0.0004971574,0.0004543816,0.000155721,0.00002786018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000741856,"about_ca_system_score_gemma":0.00007026755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003974651,"about_ca_topic_score_gemma":0.000001160828,"domain_scores_codex":[0.9984473,0.000008557899,0.0003387552,0.0003205759,0.0005545869,0.0003302435],"domain_scores_gemma":[0.9990719,0.0000360399,0.0002584814,0.0002664722,0.0002662021,0.0001009235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000648429,0.001228532,0.02776888,0.0002313777,0.0001749007,0.00002607135,0.001459321,0.00005134414,0.03679095,0.5540692,0.3743352,0.003799375],"study_design_scores_gemma":[0.00539162,0.0006968215,0.0888715,0.0007559718,0.0001050511,0.002329148,0.0006004749,0.04249629,0.4776981,0.01492701,0.3644607,0.001667369],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5560932,0.0008310526,0.2756563,0.04826988,0.003262614,0.003596234,0.0002148662,0.001165575,0.1109103],"genre_scores_gemma":[0.9893275,0.00002154893,0.009862182,0.0001293186,0.00005450629,0.00004553307,0.000001534617,0.000007172541,0.0005507433],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5391422,"threshold_uncertainty_score":0.4070906,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718746,0.0001396787,0.0001245895,0.00009736826,0.0002537379,0.0006630765,0.0004164203,0.00003853124,0.00000118307],"category_scores_gemma":[0.0000213142,0.0001136025,0.00002421006,0.000509926,0.00004836665,0.005139667,0.00004638548,0.0001246366,0.00007387179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004771828,"about_ca_system_score_gemma":0.0001373377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003072404,"about_ca_topic_score_gemma":0.000002495108,"domain_scores_codex":[0.9988219,0.000009032993,0.0003603386,0.0001509577,0.0003799651,0.0002778459],"domain_scores_gemma":[0.9992697,0.000008783256,0.0002717462,0.0002187472,0.0001639848,0.00006703754],"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.0001116171,0.0001533968,0.001365148,0.001112313,0.00007048393,0.0001263578,0.022367,0.1479543,0.004555457,0.03882858,0.002703867,0.7806515],"study_design_scores_gemma":[0.02258615,0.0006857519,0.01766514,0.00673693,0.00005653234,0.003059762,0.001655837,0.5943952,0.01590413,0.001800177,0.3307933,0.004661006],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04918167,0.00002108739,0.9442424,0.003917927,0.0001097633,0.0001223244,0.000002471654,0.0002993443,0.002103066],"genre_scores_gemma":[0.9511752,4.738042e-7,0.04385436,0.004886436,0.00003704535,0.00001353453,0.00001701385,0.000005108974,0.00001089527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9019935,"threshold_uncertainty_score":0.6394063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001898313,0.0001089099,0.0001382276,0.00006535267,0.00007210123,0.00008755452,0.0003163296,0.00005634923,0.00005897065],"category_scores_gemma":[0.00000688935,0.000100042,0.00005658882,0.0003738808,0.00001978815,0.0005428975,0.00003465208,0.0001110659,0.00007478215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007058634,"about_ca_system_score_gemma":0.0000380399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003492448,"about_ca_topic_score_gemma":0.00008089701,"domain_scores_codex":[0.9988736,0.00004563097,0.0002970575,0.0002931917,0.0002371014,0.0002534567],"domain_scores_gemma":[0.9995956,0.00005254955,0.00005471555,0.0002012327,0.00005165709,0.00004425201],"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.0002375284,0.003114044,0.04002683,0.0004508437,0.00009005839,0.0005858975,0.002551847,0.06441483,0.01200927,0.4732422,0.2507277,0.152549],"study_design_scores_gemma":[0.01027576,0.0001298173,0.07123583,0.0003237712,0.000009845423,0.0001253803,0.0005128317,0.8264558,0.00555353,0.004807965,0.07926643,0.001302979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05903056,0.00007995628,0.9298832,0.0006185058,0.0003972498,0.0001289168,0.00004418171,0.0001441988,0.009673236],"genre_scores_gemma":[0.9977317,0.000001406125,0.00164714,0.00009026753,0.00006360433,0.00001599253,0.00006202599,0.000003801572,0.0003840399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9387012,"threshold_uncertainty_score":0.4079596,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005614794,0.00003246957,0.0000404448,0.00001088609,0.00002012785,0.00003243087,0.0003275635,0.00001428068,0.00005031442],"category_scores_gemma":[0.000006812033,0.00001606399,0.00001771385,0.0000760761,0.000008113236,0.0002264322,0.0000478831,0.000009333206,0.000704681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007913205,"about_ca_system_score_gemma":0.00001047163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005303405,"about_ca_topic_score_gemma":0.00000170679,"domain_scores_codex":[0.9996353,0.000007482251,0.00006388524,0.0001178184,0.00007505053,0.0001005119],"domain_scores_gemma":[0.9996486,0.00001689526,0.00001327993,0.0002629662,0.00002107726,0.00003715443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[2.788609e-7,0.000006897831,0.0003979025,8.921853e-7,0.000001802299,0.000004508111,0.00001384595,1.975644e-7,0.002322264,0.7759175,0.0232886,0.1980454],"study_design_scores_gemma":[0.0005567264,0.00003715759,0.0107935,0.00003867726,6.897706e-7,0.00002919153,0.000004962409,0.002174761,0.007213538,0.01388534,0.9650269,0.0002385811],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002049528,0.00001786196,0.9367023,0.002142431,0.0002034645,0.00002253202,0.000001241605,0.0001441092,0.05871656],"genre_scores_gemma":[0.9846231,0.000001747804,0.004704433,0.0002021434,0.00002026402,0.000003069595,7.689628e-8,0.000001257092,0.01044385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9825736,"threshold_uncertainty_score":0.9057483,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001668138,0.000136107,0.0001550058,0.00002478216,0.0001646169,0.0002393098,0.0008979468,0.00005445935,0.00009006567],"category_scores_gemma":[0.00003379276,0.0001218798,0.00005471947,0.000323193,0.00001908917,0.0005157063,0.0001425643,0.0001085573,0.0003614681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003089592,"about_ca_system_score_gemma":0.000005604938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092874,"about_ca_topic_score_gemma":0.000002336496,"domain_scores_codex":[0.9985541,0.0000284183,0.0002986368,0.0005180459,0.0002551032,0.0003457004],"domain_scores_gemma":[0.9988341,0.00002660618,0.0001284574,0.0008392915,0.00005981819,0.0001117498],"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.000001433496,0.0002092905,0.001015398,0.00005631207,0.00001997822,0.0000252998,0.000756831,0.0002016277,0.01608318,0.01934207,0.4301003,0.5321882],"study_design_scores_gemma":[0.0002863501,0.00002268147,0.0001881786,0.00002288949,0.000001356344,0.0000184096,0.00001935325,0.86331,0.002294498,0.00005679123,0.1335315,0.000247934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01290035,0.0007016331,0.9382669,0.0009280373,0.0003524618,0.0001898964,0.00001176693,0.0005234694,0.0461255],"genre_scores_gemma":[0.9760993,0.00001287148,0.01410326,0.0009263766,0.00006235421,0.00002866769,0.000003133062,0.00000964742,0.008754395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.963199,"threshold_uncertainty_score":0.4970113,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043815,0.0002368283,0.0003377464,0.00008493626,0.000177047,0.0002353098,0.0005576166,0.00008193492,0.0001109923],"category_scores_gemma":[0.00003627714,0.0001774334,0.00007882181,0.0003051957,0.00004377376,0.0004631573,0.00001794456,0.0001856972,0.00009632552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006190594,"about_ca_system_score_gemma":0.0001028836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003388362,"about_ca_topic_score_gemma":0.00001897353,"domain_scores_codex":[0.9980731,0.0001134794,0.0004023029,0.0005774919,0.0004378025,0.0003958267],"domain_scores_gemma":[0.9984007,0.0002264277,0.0002053695,0.0008203775,0.0001890285,0.0001581074],"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.0022094,0.002689089,0.05600209,0.0001340431,0.0004195197,0.0001806053,0.001239766,0.1565513,0.006903751,0.5342209,0.08596732,0.1534821],"study_design_scores_gemma":[0.006017986,0.0005643038,0.003311059,0.00007656481,0.00001053398,0.00001257929,0.000009522842,0.9711002,0.0002091406,0.00004110016,0.01835899,0.0002879834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003747362,0.00007157186,0.9675725,0.005105112,0.0001749643,0.000536009,0.00003018321,0.0002609049,0.02250136],"genre_scores_gemma":[0.9897397,6.987666e-7,0.004557266,0.005355661,0.0001023292,0.00005045121,0.00002666682,0.00001139408,0.0001558494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9859923,"threshold_uncertainty_score":0.7235524,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453586,0.0002291472,0.0003610725,0.00005467453,0.0001387084,0.0001026934,0.001190371,0.00006489713,0.000004073122],"category_scores_gemma":[0.0001750818,0.0001207017,0.000179368,0.0001909494,0.000110221,0.000213188,0.0001275743,0.00007953036,0.000006892104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001150072,"about_ca_system_score_gemma":0.00004643147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006334392,"about_ca_topic_score_gemma":0.000001336979,"domain_scores_codex":[0.9983288,0.00001097251,0.0004317517,0.0004376986,0.0003912149,0.0003995704],"domain_scores_gemma":[0.99866,0.0002108793,0.0004082284,0.0002706223,0.0003541246,0.00009616707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003662731,0.0003741017,0.001573476,0.0002322303,0.0002022657,0.000001499414,0.0003936431,0.0000472342,0.09846205,0.8396074,0.009755659,0.04898416],"study_design_scores_gemma":[0.08865922,0.01068121,0.02884931,0.01110188,0.0007503956,0.0001987048,0.0007438637,0.1768942,0.3712588,0.1887504,0.1167854,0.005326575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2023318,0.001689224,0.7294819,0.03651856,0.005851727,0.009331218,0.001171501,0.0008308275,0.01279321],"genre_scores_gemma":[0.9975842,0.00001640853,0.001159628,0.0002157243,0.00004757536,0.0002776519,7.779945e-7,0.00001341575,0.0006845674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7952524,"threshold_uncertainty_score":0.4922074,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000960242,0.00007753058,0.00009198705,0.00003137321,0.00007737998,0.00003616809,0.0004101541,0.00003401141,0.0001224336],"category_scores_gemma":[0.000005403695,0.00006065001,0.00008142831,0.00007959662,0.00001766386,0.0001020414,0.00001439663,0.00004657094,0.00002756138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008223989,"about_ca_system_score_gemma":0.00002878925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004327105,"about_ca_topic_score_gemma":0.00001898021,"domain_scores_codex":[0.9993623,0.00001236481,0.000124952,0.0002157897,0.0001173989,0.0001671509],"domain_scores_gemma":[0.9995977,0.00002648888,0.00002711555,0.000235258,0.00005340993,0.00006000228],"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.00009665433,0.0003620554,0.0002956116,0.0001403365,0.0001405975,0.00002342128,0.006026002,0.000563408,0.001470416,0.4596145,0.04085789,0.490409],"study_design_scores_gemma":[0.005204043,0.0008985086,0.03685081,0.0001391469,0.00004164233,0.0003492124,0.0005224189,0.1783212,0.08404906,0.09603627,0.595346,0.002241745],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001174237,0.00005033135,0.9699451,0.0001995072,0.0003828753,0.0001552562,0.00002451403,0.000148333,0.02791983],"genre_scores_gemma":[0.9143897,6.301293e-7,0.08219098,0.0003391376,0.00007648848,0.00006120984,0.000003845707,0.000005497761,0.002932505],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9132155,"threshold_uncertainty_score":0.2473236,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001301804,0.0002277237,0.0003349998,0.0000952,0.0003951394,0.001178153,0.001307915,0.00007739885,0.000005212374],"category_scores_gemma":[0.00006619957,0.0001347955,0.0001197831,0.0004636626,0.00006795276,0.0003621806,0.0001053624,0.0004685799,0.0001287524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001578165,"about_ca_system_score_gemma":0.00008498667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009446953,"about_ca_topic_score_gemma":0.000005462363,"domain_scores_codex":[0.9976295,0.0001335617,0.0008295285,0.0002347464,0.0006268904,0.0005457298],"domain_scores_gemma":[0.9984261,0.0002143359,0.0004340346,0.0006482297,0.0001095152,0.0001677259],"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.00002648356,0.0003918067,0.0005786498,0.0002167336,0.00009178919,0.000844835,0.003128169,0.007301121,0.0001241589,0.947147,0.005665727,0.03448357],"study_design_scores_gemma":[0.002980252,0.0009171512,0.001503173,0.004452317,0.00003150236,0.0110409,0.003473543,0.5597692,0.0000640375,0.06630234,0.3480425,0.001423047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02193407,0.003609462,0.9357356,0.002854515,0.001832386,0.0008869268,0.00001232748,0.0001601637,0.03297447],"genre_scores_gemma":[0.9848633,0.0006143589,0.01067755,0.0001086958,0.0003330631,0.00005046199,0.000001734017,0.00003712474,0.00331375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9629292,"threshold_uncertainty_score":0.9998587,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009443681,0.0001130056,0.0001822317,0.00003286855,0.0002271856,0.0001506143,0.006892935,0.0000470771,0.00002231342],"category_scores_gemma":[0.0003099967,0.00005182539,0.0002405823,0.000326077,0.00006080337,0.0004627911,0.0008889864,0.0003330056,0.00003072026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002725296,"about_ca_system_score_gemma":0.00008638518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002853973,"about_ca_topic_score_gemma":0.000002279056,"domain_scores_codex":[0.9986627,0.0001399517,0.0004122699,0.0001209035,0.0004351872,0.0002290031],"domain_scores_gemma":[0.9974392,0.00009439413,0.0004518981,0.001759785,0.0001712812,0.00008341295],"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.0001580409,0.0005399784,0.02582495,0.00008392108,0.0007138806,0.0004086215,0.04034558,0.00485592,0.004766014,0.06362005,0.758585,0.1000981],"study_design_scores_gemma":[0.001704709,0.0002864051,0.01870391,0.0005951216,0.0001089141,0.004242992,0.0008509836,0.01761642,0.008481612,0.0471057,0.8996963,0.000606937],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5970131,0.006028553,0.2653813,0.05884486,0.01068825,0.001007634,0.0000534536,0.0002148326,0.06076802],"genre_scores_gemma":[0.9928918,0.00001569528,0.00436479,0.001946892,0.0003381511,0.000001696038,5.57579e-8,0.000008108875,0.0004327438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3958787,"threshold_uncertainty_score":0.9984803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01377391,0.0007865305,0.00383845,0.0002977974,0.0002173915,0.0001749136,0.004896742,0.000302332,0.000002019194],"category_scores_gemma":[0.002740644,0.0005628616,0.0007321595,0.003294718,0.0001938571,0.00004784817,0.00148403,0.001184302,0.00009714063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006686406,"about_ca_system_score_gemma":0.0005231874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000686554,"about_ca_topic_score_gemma":0.00002789323,"domain_scores_codex":[0.98477,0.009380142,0.002886504,0.00121212,0.000927211,0.0008240521],"domain_scores_gemma":[0.9834173,0.01075378,0.002040865,0.003229435,0.0004529886,0.0001056394],"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":[5.817344e-7,0.00006858401,0.00002421748,0.08705558,0.0001537018,0.0003666502,0.0002221764,0.00001505967,1.747146e-7,0.0007460463,0.008065127,0.9032821],"study_design_scores_gemma":[0.000329172,0.00005198445,0.0003588921,0.2353714,0.0001314549,0.0005835702,0.00003872391,0.002921162,1.674104e-7,0.00006520653,0.75945,0.0006982891],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00001854913,0.9890876,0.006781346,0.0004924064,0.001196708,0.001658366,0.0002077557,0.00025582,0.0003014793],"genre_scores_gemma":[0.0001049014,0.9940837,0.004954146,0.0003257429,0.0001897091,0.00003413461,0.0001989309,0.00006387135,0.00004485701],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9025838,"threshold_uncertainty_score":0.9996823,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005429303,0.0001471088,0.0001657748,0.0001173914,0.0001567756,0.0001207503,0.0006201596,0.00007131563,0.00001382488],"category_scores_gemma":[0.00001476876,0.0001355708,0.00008233138,0.0005899305,0.00001937467,0.0003553855,0.00005737842,0.0001354731,0.0001028296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007338687,"about_ca_system_score_gemma":0.00004646906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006187407,"about_ca_topic_score_gemma":0.00002623974,"domain_scores_codex":[0.998448,0.00001746451,0.0002994126,0.0004546976,0.0003620128,0.0004184871],"domain_scores_gemma":[0.9992357,0.00005256041,0.00004513681,0.0003783487,0.00009205615,0.0001961556],"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.0001104432,0.001730214,0.002202844,0.0003933215,0.0001677765,0.0002581623,0.003831533,0.01961894,0.0121316,0.1877389,0.01422939,0.7575869],"study_design_scores_gemma":[0.003352669,0.0005170546,0.05434595,0.000285638,0.00002865511,0.001023605,0.002645286,0.874827,0.005221543,0.00171515,0.05302544,0.003011957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009389969,0.00007171144,0.9655605,0.0002632145,0.0002908164,0.0002018141,0.00001157644,0.0003717036,0.02383872],"genre_scores_gemma":[0.7437835,6.838328e-7,0.2542503,0.0005201777,0.00005119585,0.00001543366,0.00001034418,0.000008791489,0.00135953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8552081,"threshold_uncertainty_score":0.5528416,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516456,0.0001400501,0.0001973829,0.00005210831,0.00009039453,0.0003618472,0.0015187,0.00006254551,0.0001009269],"category_scores_gemma":[0.00007471314,0.0001230126,0.00007566722,0.0004705204,0.00001173448,0.0004183958,0.000161907,0.0001001382,0.0006938732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002975607,"about_ca_system_score_gemma":0.00003018982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001031541,"about_ca_topic_score_gemma":0.00004684655,"domain_scores_codex":[0.9987774,0.00004283398,0.000173991,0.0004376023,0.0002224975,0.0003456468],"domain_scores_gemma":[0.9984578,0.0000487023,0.00004015068,0.001228197,0.00004923548,0.0001759142],"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.0000100028,0.00003944375,0.0003652778,0.000006566218,0.00001084023,0.00002805899,0.0002431258,0.00004703343,0.0003956968,0.001834035,0.05185544,0.9451645],"study_design_scores_gemma":[0.0003205385,0.0001467255,0.001759814,0.00003440782,0.000002413137,0.00002120596,0.00001406456,0.005285594,0.0004175111,0.002520302,0.9892058,0.0002715771],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3143614,0.000359503,0.6019365,0.03938935,0.002156476,0.0008525256,0.0000388073,0.0008793681,0.04002608],"genre_scores_gemma":[0.9336844,0.00001704862,0.03818214,0.001356589,0.0002670923,0.00005324936,0.000003567182,0.0000140034,0.0264219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9448929,"threshold_uncertainty_score":0.8918567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993028,0.0002284551,0.0003046284,0.00008971951,0.0003263243,0.0002234009,0.003571236,0.00009652421,0.000078312],"category_scores_gemma":[0.00013534,0.0002038107,0.0000493884,0.0004425638,0.00007553284,0.002211044,0.001371255,0.0001125937,0.0002183274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002979019,"about_ca_system_score_gemma":0.0001345889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001771142,"about_ca_topic_score_gemma":0.0002252443,"domain_scores_codex":[0.9979687,0.00003729438,0.0003432321,0.0007421113,0.0003485481,0.0005601427],"domain_scores_gemma":[0.9958624,0.000139189,0.0001447881,0.003561504,0.0001705258,0.00012165],"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.00009532101,0.0002439012,0.004907455,0.0001806104,0.0000575126,0.00002021829,0.0001571629,0.00001580871,0.0002070057,0.002083582,0.9750605,0.01697096],"study_design_scores_gemma":[0.002511477,0.0002331773,0.01231917,0.0001652226,0.00001825344,0.00001377364,0.00002427443,0.4554692,0.001265264,0.000207294,0.5273058,0.0004671343],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245265,0.0003241706,0.852271,0.0007926432,0.002621609,0.0008165466,0.01725882,0.0003724767,0.001016212],"genre_scores_gemma":[0.9879359,0.00002003254,0.008479698,0.0008682191,0.0007962204,0.00007301836,0.00116746,0.0000224285,0.0006370048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8634093,"threshold_uncertainty_score":0.8311158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460365,0.0001170525,0.0002798589,0.00005545192,0.00004847006,0.00005245294,0.0003145525,0.00005284871,0.000008259036],"category_scores_gemma":[0.00003628551,0.0001000356,0.00006615029,0.0001264115,0.00006360745,0.0002941418,0.00003993357,0.0000652378,0.000007095415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002499531,"about_ca_system_score_gemma":0.00009041741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006688466,"about_ca_topic_score_gemma":0.00003340304,"domain_scores_codex":[0.9989882,0.00002731403,0.0003256433,0.0002736512,0.0002279112,0.0001572931],"domain_scores_gemma":[0.9991294,0.0001050443,0.0001218431,0.0002162478,0.0003192521,0.0001082615],"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.001867398,0.00276851,0.01335558,0.0008084349,0.0007927371,0.00003063944,0.05851472,0.01162336,0.01326614,0.5138108,0.2570166,0.126145],"study_design_scores_gemma":[0.003704028,0.001462308,0.002031869,0.000140294,0.00003038311,0.00004320737,0.005025108,0.9292547,0.02026604,0.002045811,0.03542812,0.000568166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04623018,0.0005428331,0.9510559,0.0001774497,0.000450461,0.0002431395,0.0001180835,0.00004952869,0.001132441],"genre_scores_gemma":[0.9423863,0.000003957826,0.05697574,0.00008548935,0.00002100925,0.00002070703,0.00001636881,0.000006380712,0.0004840081],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9176313,"threshold_uncertainty_score":0.4079333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203797,0.0002239309,0.000215415,0.00009775625,0.0002168614,0.0003171628,0.0005887416,0.0001063925,0.00001998096],"category_scores_gemma":[0.000004912332,0.000193502,0.0001115982,0.000551774,0.00004462575,0.0005219994,0.00007262712,0.0001718359,0.0003270047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008746553,"about_ca_system_score_gemma":0.00004051312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003475832,"about_ca_topic_score_gemma":0.00001448858,"domain_scores_codex":[0.9981264,0.00005647909,0.0003134169,0.0005801258,0.00043345,0.0004901653],"domain_scores_gemma":[0.9990564,0.0000295018,0.0001049019,0.0006285188,0.00008682541,0.00009383627],"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.00008479463,0.001199573,0.001867912,0.0001435437,0.0001668886,0.0002458237,0.0006438007,0.01804185,0.07629412,0.5148575,0.3109777,0.07547645],"study_design_scores_gemma":[0.002313168,0.0007976054,0.006242939,0.0001978119,0.00002731813,0.0001520486,0.0000661818,0.4767123,0.059403,0.00857582,0.4438121,0.00169974],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00395247,0.0003324747,0.8798588,0.004749803,0.001873012,0.0003917885,0.00003636894,0.0007119723,0.1080933],"genre_scores_gemma":[0.9721354,0.00002217686,0.008951871,0.0005088505,0.0008665645,0.00008530603,0.00006028111,0.00003427586,0.01733524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.968183,"threshold_uncertainty_score":0.7890782,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000603926,0.0003872932,0.0006577024,0.00004488062,0.0001743246,0.0002373451,0.0004310851,0.0008733916,0.00001148901],"category_scores_gemma":[0.00001166235,0.0003571782,0.00030338,0.00003153491,0.0001073993,0.00006603199,0.0002068776,0.0004331552,0.00001046668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009381562,"about_ca_system_score_gemma":0.00009592346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006481412,"about_ca_topic_score_gemma":0.000005102816,"domain_scores_codex":[0.9981385,0.000004405369,0.0006497151,0.0005466234,0.0003265172,0.0003342351],"domain_scores_gemma":[0.9987901,0.00008966867,0.000481145,0.0004682997,0.00007025733,0.0001004598],"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.00001604713,0.00002861499,0.000001234617,0.0002724482,0.00005728397,6.702824e-7,0.001218227,0.000002642561,0.00003891181,0.9868592,0.006144921,0.005359807],"study_design_scores_gemma":[0.004647712,0.0003199012,0.000004641973,0.001601891,0.00007719134,0.00001319377,0.0002150644,0.005024127,0.0003399989,0.6965898,0.2897772,0.001389217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001965083,0.00006124529,0.1923689,0.0002631131,0.0008635006,0.07088566,0.0006965511,0.0005674649,0.7323285],"genre_scores_gemma":[0.01563138,0.00001286986,0.4730386,0.0003881873,0.005168847,0.03133599,0.0004005799,0.0004203107,0.4736033],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2902694,"threshold_uncertainty_score":0.999888,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001268657,0.00009377681,0.0001187045,0.00002717382,0.0002014695,0.00008277865,0.0002507767,0.00005141458,0.00002237985],"category_scores_gemma":[0.000006653353,0.00006934929,0.00003710129,0.0001151213,0.00004438052,0.0002301739,0.00007211651,0.00003766015,0.0000310774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197328,"about_ca_system_score_gemma":0.00002709615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003869074,"about_ca_topic_score_gemma":0.00001698092,"domain_scores_codex":[0.9992219,0.00001169048,0.0001531224,0.0002738724,0.0001403707,0.0001990901],"domain_scores_gemma":[0.9995602,0.0000266162,0.0000397799,0.0002530007,0.0000505396,0.00006984701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008186802,0.0007825206,0.009512359,0.0002678001,0.00009517057,0.00007813448,0.008337351,0.0001829687,0.01095154,0.4821408,0.4360497,0.05151979],"study_design_scores_gemma":[0.0006796123,0.0001517207,0.0007894657,0.00002735626,0.000001645501,0.00008222116,0.00001069875,0.03546579,0.0004783179,0.0009639594,0.9611464,0.0002028209],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278456,0.0002610614,0.9455004,0.0005179943,0.0004454796,0.0003436885,0.00001378364,0.0001514944,0.01998156],"genre_scores_gemma":[0.9767141,0.000009792875,0.009827361,0.0006371947,0.0001068155,0.00003912727,0.000002329824,0.000009220633,0.01265406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9439296,"threshold_uncertainty_score":0.2827982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002446785,0.000232634,0.0002792634,0.00004716796,0.0001391722,0.001217814,0.003808716,0.00008693292,0.000001514694],"category_scores_gemma":[0.001582997,0.0001558594,0.000175773,0.000872867,0.0001015747,0.0007666022,0.0009656895,0.0002534578,0.000007001512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002579696,"about_ca_system_score_gemma":0.0000248876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002298303,"about_ca_topic_score_gemma":7.142733e-7,"domain_scores_codex":[0.9982486,0.0000123823,0.0002538809,0.0005079155,0.0005456659,0.0004315904],"domain_scores_gemma":[0.9985871,0.00005738787,0.0003363067,0.0006230148,0.0002358828,0.0001603608],"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.00006648613,0.0002898207,0.01657688,0.0006149365,0.000146449,0.00001549599,0.007044231,0.00001143944,0.008397151,0.08677371,0.0151572,0.8649062],"study_design_scores_gemma":[0.002035941,0.001391973,0.007160985,0.001041132,0.000100325,0.00006450422,0.009104584,0.001581724,0.06904337,0.001477357,0.9054982,0.001499895],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7806329,0.002161226,0.008569099,0.1979343,0.001078541,0.004349237,0.00006389122,0.002570499,0.002640384],"genre_scores_gemma":[0.9525996,0.000009419075,0.04631282,0.0005876691,0.0001233656,0.00006221883,0.000001670152,0.00002139826,0.0002818738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.890341,"threshold_uncertainty_score":0.999819,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008079851,0.00003562498,0.00004140015,0.00001377314,0.00003045425,0.00008140047,0.0004162405,0.00002019844,0.0001063774],"category_scores_gemma":[0.0000078146,0.00002677719,0.00001882226,0.0001157111,0.000009472144,0.0001508961,0.00003883561,0.00007120328,0.0003620114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000152955,"about_ca_system_score_gemma":0.00001054716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002457056,"about_ca_topic_score_gemma":0.00005628951,"domain_scores_codex":[0.9996476,0.000004220424,0.00006213094,0.0001143952,0.00007504375,0.00009660021],"domain_scores_gemma":[0.999575,0.000009530864,0.00002172485,0.0003316769,0.00002081157,0.00004125579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[1.46903e-7,0.0000121491,0.0005379395,9.71144e-7,0.000001398813,0.000002411216,0.000030479,8.078082e-7,0.004810158,0.9401087,0.01002793,0.04446693],"study_design_scores_gemma":[0.0001189717,0.000008132641,0.003728817,0.00000213712,3.096774e-7,0.00001568411,0.000003523324,0.01453175,0.002606296,0.00346493,0.975413,0.0001064051],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005818346,0.000007236024,0.7997341,0.0008328118,0.000691643,0.0000309647,7.177871e-7,0.0001765356,0.1927077],"genre_scores_gemma":[0.9702592,2.004116e-7,0.02355597,0.0003608478,0.00005929218,0.000003087599,2.550289e-7,0.000001787472,0.005759397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9653851,"threshold_uncertainty_score":0.4653045,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001143221,0.00006704574,0.00007156419,0.00002275602,0.00006554279,0.00009609089,0.0003787103,0.0000160986,0.000005091814],"category_scores_gemma":[0.000008261134,0.00004816501,0.00001278659,0.0002602212,0.00001430542,0.0004828575,0.00005776998,0.00004216692,0.00005832695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001969854,"about_ca_system_score_gemma":0.00003721467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001915625,"about_ca_topic_score_gemma":0.00009382282,"domain_scores_codex":[0.9992955,0.000006582002,0.0001096877,0.0003147979,0.0001406955,0.0001326894],"domain_scores_gemma":[0.9989781,0.00000681304,0.00003871469,0.0008870509,0.0000510269,0.0000382367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001030227,0.0001257578,0.0007194076,0.00003752823,0.0000184813,0.00004560111,0.0004114868,0.002772743,0.005260784,0.956827,0.0009956752,0.03277522],"study_design_scores_gemma":[0.01140865,0.00108113,0.03378385,0.001504439,0.00003465005,0.001343034,0.000666888,0.145246,0.1136522,0.01402772,0.6738882,0.003363259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01665129,0.00007038539,0.9741582,0.0009184913,0.00005459717,0.0000936045,0.00000413705,0.0002175876,0.00783175],"genre_scores_gemma":[0.9335762,0.00000454683,0.06578675,0.0002112879,0.00002472037,0.00001542092,0.000009642103,0.000003952662,0.0003674291],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9427993,"threshold_uncertainty_score":0.1964112,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002805902,0.0002282791,0.0002707058,0.0002049587,0.0002457917,0.0002851439,0.0023736,0.00006822363,0.00001117467],"category_scores_gemma":[0.00002017996,0.0001695475,0.00004036092,0.002012518,0.001394093,0.0005619597,0.0005920593,0.000269547,0.00004190984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001664464,"about_ca_system_score_gemma":0.0001184019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002098053,"about_ca_topic_score_gemma":0.00002220848,"domain_scores_codex":[0.9967451,0.00005835266,0.0004246474,0.0008581344,0.0008428394,0.001070935],"domain_scores_gemma":[0.9983245,0.000168205,0.00009149135,0.0009111578,0.0001672583,0.0003374379],"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.00002560744,0.0001188609,0.0006691043,0.000006992553,0.000003503378,0.0002154074,0.0003635161,0.007181892,0.00007232917,0.905726,0.0000304129,0.08558636],"study_design_scores_gemma":[0.0006746168,0.0005084846,0.02301141,0.0001344636,0.000002410596,0.0001543835,0.00001859642,0.9694484,0.0005995471,0.004747571,0.0002863309,0.0004137988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06483445,0.00005699651,0.928887,0.0002425099,0.0005443902,0.0002471105,8.099378e-7,0.0001499475,0.005036825],"genre_scores_gemma":[0.9384673,0.000002392025,0.06097027,0.0003900891,0.000144173,0.000006509349,8.194219e-7,0.00000666869,0.00001173541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9622665,"threshold_uncertainty_score":0.6913945,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745727,0.0003257797,0.0005268579,0.0001140934,0.0002913502,0.0001537289,0.0009540268,0.0001712526,0.000006444982],"category_scores_gemma":[0.00007134611,0.0003341535,0.0002381883,0.0009781207,0.00005504428,0.0005919776,0.0001515166,0.0001773976,0.000006523425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532931,"about_ca_system_score_gemma":0.0001206335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007768668,"about_ca_topic_score_gemma":0.000001522634,"domain_scores_codex":[0.9970962,0.0001340678,0.0009247634,0.0004588895,0.0004455534,0.0009404991],"domain_scores_gemma":[0.997484,0.0004579484,0.0006688433,0.0007282303,0.0004125335,0.0002483961],"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.00006517652,0.0009544241,0.01563434,0.0004867624,0.000270036,0.000005401835,0.001180691,0.1787128,0.002292069,0.7693945,0.009006813,0.02199697],"study_design_scores_gemma":[0.001182893,0.0000782453,0.009052184,0.0001523773,0.00002763009,0.000005865738,0.0002471679,0.9819377,0.003654349,0.002154707,0.001133266,0.0003735814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03640945,0.000175838,0.9583027,0.0002482486,0.0006280371,0.0006810318,0.002543866,0.0009861721,0.00002469239],"genre_scores_gemma":[0.8769027,8.277548e-7,0.1205926,0.00008505661,0.0001128269,0.00004525926,0.002239901,0.00002026837,5.267534e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8404933,"threshold_uncertainty_score":0.9999111,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919423,0.000205803,0.0002865211,0.0002152847,0.0001503346,0.000165014,0.0005911699,0.00007451172,0.00002006991],"category_scores_gemma":[0.00007990286,0.0001935257,0.00004022391,0.0006236123,0.00006644613,0.0009343825,0.00001643077,0.0003703104,0.00002410201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006525768,"about_ca_system_score_gemma":0.00005943361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006153391,"about_ca_topic_score_gemma":0.00009857579,"domain_scores_codex":[0.9981222,0.0001621661,0.0004981329,0.000664896,0.0002611463,0.0002915091],"domain_scores_gemma":[0.9978519,0.0001560503,0.0001164689,0.001672389,0.00006724177,0.000135925],"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.000428589,0.004380023,0.004930387,0.0008123831,0.0002625578,0.0006441264,0.002499885,0.005710429,0.0490873,0.2707289,0.01185858,0.6486568],"study_design_scores_gemma":[0.01295401,0.001678945,0.05668557,0.00657548,0.0001401917,0.002595461,0.002579472,0.8087973,0.01193406,0.002152595,0.08901589,0.004891015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01262687,0.0002612675,0.9837021,0.0008128177,0.0004070742,0.0004929023,0.0009301907,0.0001610168,0.000605815],"genre_scores_gemma":[0.9915928,0.00006154989,0.007766127,0.0001551718,0.00002769209,0.00004173311,0.0003123543,0.00000614226,0.00003648481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9789659,"threshold_uncertainty_score":0.789175,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144123,0.0001492795,0.000276194,0.0001951167,0.0001595876,0.0001646795,0.0008927195,0.00005166391,0.00002088],"category_scores_gemma":[0.00008603558,0.0001311166,0.0000583467,0.002334683,0.001092431,0.000485053,0.0004775002,0.0001703791,0.0000319236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007048283,"about_ca_system_score_gemma":0.00002417743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001290684,"about_ca_topic_score_gemma":0.000001077749,"domain_scores_codex":[0.9978043,0.0001174005,0.000454965,0.0005649414,0.0005654837,0.0004929313],"domain_scores_gemma":[0.9987551,0.0001743087,0.0001189026,0.0006262002,0.0001728181,0.0001526746],"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.000002704252,0.0001316402,0.0003983072,0.00001334424,0.000002200096,0.0000350446,0.0004938528,0.001435347,0.0006615291,0.9558064,0.00008458317,0.04093501],"study_design_scores_gemma":[0.0002699638,0.00008382415,0.007249863,0.00007351892,0.000001202599,0.00006922077,0.000006029456,0.9841682,0.001246838,0.006500958,0.0001666773,0.0001637023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1083186,0.00004744997,0.8880826,0.0003245751,0.0004952171,0.0001186485,0.000005578108,0.0001189579,0.002488375],"genre_scores_gemma":[0.9765786,0.00000382901,0.02327584,0.00007895333,0.00005137782,0.000001693439,0.000001017618,0.000004136211,0.000004536947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9827328,"threshold_uncertainty_score":0.534678,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835672,0.000093562,0.0001577936,0.00004861148,0.00007467407,0.0001990319,0.0006425695,0.00006100893,0.000008352034],"category_scores_gemma":[0.00003558217,0.00008327996,0.00002673739,0.0006076041,0.00001695208,0.0004385622,0.00006277567,0.0001065489,0.00007177291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006915843,"about_ca_system_score_gemma":0.00002546393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004983676,"about_ca_topic_score_gemma":0.00005864684,"domain_scores_codex":[0.998928,0.0001343952,0.0003060775,0.0002323633,0.000163067,0.0002360599],"domain_scores_gemma":[0.998912,0.00004560426,0.00007137976,0.0008557856,0.00005650309,0.00005873415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[8.70614e-7,0.0000705675,0.003020964,0.00001394992,0.000003187001,0.000004641503,0.00005706397,0.00132799,0.00006097869,0.9892678,0.005930335,0.0002416987],"study_design_scores_gemma":[0.001574792,0.00006810464,0.01106623,0.0002496184,0.000003193338,0.00006490927,0.0003940343,0.2827905,0.0002316947,0.005415883,0.6975386,0.0006024095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004237621,0.001123301,0.9538879,0.0002089559,0.0003440204,0.0002462273,0.000009462626,0.0001800746,0.03976244],"genre_scores_gemma":[0.9940294,0.00002793678,0.005281464,0.00005218933,0.000005824882,0.00004266735,0.00002629039,0.000004230538,0.0005299788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9897918,"threshold_uncertainty_score":0.3396058,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001469711,0.0004220148,0.0005309588,0.0001550097,0.0006802311,0.0006677269,0.001181139,0.0001852724,0.000006484075],"category_scores_gemma":[0.00009070554,0.0004271433,0.0001323113,0.00101318,0.0001055226,0.0004371368,0.0005847425,0.0004396086,0.00004120814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238267,"about_ca_system_score_gemma":0.00006818712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008675518,"about_ca_topic_score_gemma":0.00001118316,"domain_scores_codex":[0.9963823,0.00009315432,0.0008939746,0.0009682222,0.0005291745,0.001133154],"domain_scores_gemma":[0.997834,0.0003490105,0.000372009,0.0007990343,0.0002647006,0.0003812913],"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.00006265619,0.0005363065,0.02399076,0.0003614804,0.0002288665,0.001446018,0.005230121,0.0173689,0.005201877,0.04775634,0.007355185,0.8904615],"study_design_scores_gemma":[0.001643095,0.0001192678,0.07002632,0.0003556416,0.00001857705,0.0005084412,0.0006129013,0.9139845,0.001429731,0.0003391306,0.009898175,0.001064258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2057257,0.0006058962,0.7904406,0.0002037638,0.0006505979,0.0002460556,0.00008548668,0.0006503998,0.001391534],"genre_scores_gemma":[0.9837412,0.000003500922,0.01543046,0.0003228323,0.000304431,0.00000164955,0.0001453373,0.0000245368,0.00002604052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8966156,"threshold_uncertainty_score":0.999818,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005418903,0.0005089288,0.00109475,0.0001965922,0.00007758306,0.0001247541,0.0009203758,0.0003106225,0.00001813316],"category_scores_gemma":[0.00005521648,0.0004750898,0.0001575224,0.00007323784,0.0000928654,0.0006101808,0.0001879426,0.0003708119,0.00008799366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004783519,"about_ca_system_score_gemma":0.0002068046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001106894,"about_ca_topic_score_gemma":0.000009011869,"domain_scores_codex":[0.9970654,0.00007175265,0.001065622,0.0008422225,0.0006031479,0.000351885],"domain_scores_gemma":[0.997045,0.000196143,0.0008709934,0.001444708,0.0002165399,0.0002266518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002638029,0.00006295837,0.00005105441,0.001096349,0.0002257017,0.0002218172,0.0001418575,0.00002339555,0.00005041915,0.8037191,0.09196528,0.1024157],"study_design_scores_gemma":[0.0007957102,0.0001681537,0.00004314441,0.001602569,0.00005525981,0.00009039318,0.00000752706,0.001249203,0.000002089614,0.0009785694,0.9944175,0.0005898377],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0000141105,0.02782097,0.08491773,0.00008917689,0.003390736,0.001029023,0.005080479,0.0001608128,0.877497],"genre_scores_gemma":[0.02150008,0.02217438,0.00369743,0.0002934066,0.00273181,0.0001229129,0.001694563,0.0001632873,0.9476221],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9024523,"threshold_uncertainty_score":0.9997701,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006008554,0.0001386919,0.0001656949,0.00004122807,0.0001273302,0.0003297536,0.002646454,0.00007805917,0.000002533105],"category_scores_gemma":[0.0002035294,0.00007238064,0.00007337581,0.0005487605,0.0000383505,0.0003061218,0.0004409179,0.0001899454,0.0000164028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003427782,"about_ca_system_score_gemma":0.00002657851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002501833,"about_ca_topic_score_gemma":0.000005489262,"domain_scores_codex":[0.9988001,0.00001389087,0.0002443711,0.0003053274,0.0003498041,0.0002864871],"domain_scores_gemma":[0.99891,0.00005811604,0.000257587,0.0006020024,0.0001446215,0.00002769758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009455621,0.0004131252,0.06807125,0.0006086766,0.00009084085,0.000004223537,0.01096313,0.00006490204,0.01411421,0.5337126,0.01482601,0.3570365],"study_design_scores_gemma":[0.005106194,0.002259731,0.08775471,0.003874126,0.00008640006,0.0001500973,0.03316674,0.01277656,0.1225553,0.1057994,0.6238384,0.002632316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9580981,0.002960375,0.0003740519,0.02886667,0.001163875,0.002132726,0.000008869103,0.0002675451,0.006127788],"genre_scores_gemma":[0.9918721,0.00002305767,0.006718586,0.0002518823,0.0001208964,0.00006519483,8.628038e-7,0.000009047913,0.0009383539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6090124,"threshold_uncertainty_score":0.4917815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563889,0.0002604694,0.0007022837,0.00004547714,0.0004819943,0.0001926503,0.001169692,0.0001012148,0.000003880634],"category_scores_gemma":[0.0005024263,0.0001609085,0.0002254524,0.0007842351,0.0002665587,0.0001592736,0.0002762981,0.0002313452,0.000009650431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000059165,"about_ca_system_score_gemma":0.0001211633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006144887,"about_ca_topic_score_gemma":0.00000264003,"domain_scores_codex":[0.9970387,0.0004809118,0.0009087874,0.0003244502,0.0004725972,0.0007745735],"domain_scores_gemma":[0.9961504,0.001909255,0.0006208143,0.000773053,0.0003675393,0.0001788927],"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.002698973,0.0005897211,0.001972621,0.0001547611,0.0005449711,0.00004239227,0.002450969,0.003833033,0.0002041211,0.1380569,0.0109793,0.8384722],"study_design_scores_gemma":[0.02330962,0.00005249243,0.0006711123,0.0001735176,0.00004014913,0.0001464801,0.0003079181,0.9601002,0.003822225,0.0005570307,0.01037856,0.0004406872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008094969,0.001373904,0.9869502,0.0002863564,0.001978626,0.0006244184,0.0001248466,0.0001763224,0.0003903399],"genre_scores_gemma":[0.9914011,0.000006583343,0.008224578,0.00004290297,0.0002020617,0.00002477542,0.0000376649,0.00001243588,0.00004787568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9833062,"threshold_uncertainty_score":0.6561657,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172962,0.00008410968,0.0001274818,0.00002605487,0.00007396817,0.00007566482,0.001078816,0.0000265587,0.000002507746],"category_scores_gemma":[0.00004494549,0.00005317201,0.00007586957,0.0002391316,0.00002530611,0.000231157,0.0002963919,0.0000629722,0.00001483453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002500387,"about_ca_system_score_gemma":0.000008758345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000192429,"about_ca_topic_score_gemma":4.504925e-7,"domain_scores_codex":[0.9991644,0.000004892761,0.0001885269,0.0001911645,0.0002855265,0.0001654902],"domain_scores_gemma":[0.9994839,0.00001402389,0.0001627259,0.0001847409,0.0001146909,0.00003987816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000007157571,0.0001059234,0.00561211,0.000108151,0.00002694596,1.367419e-7,0.0005112722,0.00003324191,0.04444461,0.8808494,0.01633962,0.05196147],"study_design_scores_gemma":[0.002070665,0.0003582177,0.03465035,0.0005434484,0.00003405881,0.00006159868,0.0002220709,0.04016763,0.445632,0.04928875,0.426241,0.0007302884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.500711,0.0004651298,0.1816962,0.01313686,0.003989565,0.001638644,0.00001327959,0.0006125223,0.2977368],"genre_scores_gemma":[0.9971385,0.000004537841,0.002265825,0.0001539736,0.00006377158,0.00001909656,1.49565e-7,0.000003881318,0.000350253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8315606,"threshold_uncertainty_score":0.2168292,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096019,0.00009849789,0.0001458191,0.00001821722,0.000241338,0.0002126069,0.0005715248,0.00003366253,0.000003814072],"category_scores_gemma":[0.00004695645,0.00005538462,0.00005771357,0.0002567359,0.00005133218,0.0002338367,0.0001242422,0.0007318468,0.00001715716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008479459,"about_ca_system_score_gemma":0.000588253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001634745,"about_ca_topic_score_gemma":0.00003353882,"domain_scores_codex":[0.9984114,0.0001177303,0.0002183005,0.0001784773,0.0002333077,0.0008407695],"domain_scores_gemma":[0.9995461,0.00003327011,0.0001242918,0.0001512991,0.00005541269,0.00008959188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001486292,0.0000264892,0.0002635882,0.00001505033,0.00004901966,0.00001053524,0.0007691347,0.00004039327,0.0003372324,0.9424978,0.002798839,0.05304328],"study_design_scores_gemma":[0.01921043,0.001330988,0.001131811,0.0001082892,0.00003175536,0.003054947,0.00123366,0.133288,0.0002664711,0.2550849,0.5845051,0.0007535528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004536891,0.0009163407,0.9202254,0.05186467,0.000175431,0.02002333,0.000002319588,0.00009888883,0.00215672],"genre_scores_gemma":[0.9926958,0.0001143591,0.0005559364,0.001758325,0.0004523082,0.003581157,4.930837e-7,0.00001234571,0.0008292698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9881589,"threshold_uncertainty_score":0.3179551,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007591964,0.0001039105,0.0001786478,0.00004250091,0.0002071057,0.0000772237,0.0006168469,0.00004191902,0.00001758987],"category_scores_gemma":[0.00005641449,0.00006303952,0.00006470856,0.0001167276,0.0001065214,0.0002150144,0.0001132432,0.0002695606,0.00001046136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002076669,"about_ca_system_score_gemma":0.00002780596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005340633,"about_ca_topic_score_gemma":0.000005464924,"domain_scores_codex":[0.9989874,0.0001088539,0.0002988913,0.0001672533,0.0002308993,0.0002066443],"domain_scores_gemma":[0.9991409,0.00007659063,0.0001846789,0.0003928549,0.0001064082,0.00009858167],"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.0003379835,0.001351066,0.2263721,0.0003046164,0.0002714429,0.0002399675,0.0394766,0.0004193958,0.006198118,0.0324211,0.008517948,0.6840897],"study_design_scores_gemma":[0.002832305,0.0007094773,0.8804856,0.0007618115,0.00003804097,0.001193543,0.001086543,0.08644866,0.008117363,0.01028437,0.007429834,0.0006124443],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9024221,0.0004732939,0.09427904,0.0006294968,0.0007075467,0.0001593118,0.0000175015,0.00004368846,0.001268049],"genre_scores_gemma":[0.9956549,0.00002332106,0.004099907,0.00009033846,0.00007703335,0.000001833157,2.892367e-7,0.000004661394,0.00004767807],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6834772,"threshold_uncertainty_score":0.2570677,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001314665,0.000149493,0.0001266366,0.0001179407,0.0002510529,0.000215678,0.000307437,0.00007901488,0.00003566044],"category_scores_gemma":[0.000005832305,0.0001229153,0.00003153078,0.0003396366,0.00004718131,0.001113136,0.000007448446,0.0003028224,0.00006946213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001781261,"about_ca_system_score_gemma":0.00004082089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008501959,"about_ca_topic_score_gemma":0.0001327442,"domain_scores_codex":[0.9990579,0.00001572641,0.0002116033,0.0002306889,0.0002603826,0.0002236253],"domain_scores_gemma":[0.999178,0.00002559085,0.00008009972,0.000510926,0.0001130028,0.00009239032],"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.00001687644,0.00009248512,0.0000226605,0.00001329371,0.00002757236,0.000002418141,0.0004203891,0.000315585,0.0009103324,0.0004970579,0.00009529811,0.997586],"study_design_scores_gemma":[0.01144678,0.005571713,0.02774808,0.0003293493,0.000164815,0.002467877,0.001536557,0.6627895,0.05643116,0.001356419,0.227021,0.003136709],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01224782,0.00001338802,0.9849361,0.001338581,0.0005125112,0.0002122732,0.00001919505,0.0001383426,0.0005818452],"genre_scores_gemma":[0.907352,0.00001671919,0.09212033,0.0002104011,0.00006224782,0.0000591699,0.00001172978,0.000007335948,0.0001600301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9944493,"threshold_uncertainty_score":0.5012342,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819092,0.0002482141,0.0003709017,0.0001125768,0.000507333,0.000225024,0.0004999982,0.00007943481,0.000001675411],"category_scores_gemma":[0.00006966027,0.0002187931,0.00004471463,0.000815416,0.00008092398,0.0002973297,0.0001921084,0.0002938381,0.00001132855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719111,"about_ca_system_score_gemma":0.00007899533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002459317,"about_ca_topic_score_gemma":0.00001736956,"domain_scores_codex":[0.9975705,0.0001520445,0.0005531738,0.000701753,0.000374319,0.0006482246],"domain_scores_gemma":[0.9986073,0.0002633855,0.0002205118,0.0006378393,0.0001321635,0.0001387669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008880629,0.001063783,0.4587919,0.0005431562,0.0001542523,0.0007066536,0.002366999,0.2851001,0.0003991332,0.228463,0.00581694,0.01650527],"study_design_scores_gemma":[0.001492725,0.0001810557,0.1475854,0.0004490812,0.000006545243,0.000260441,0.00024322,0.8451266,0.00004230222,0.0001758726,0.003941207,0.0004955041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4941354,0.000128404,0.5044112,0.0001287002,0.0001427343,0.0002572876,0.0000688283,0.000176112,0.0005513259],"genre_scores_gemma":[0.9978874,0.000006492966,0.001902556,0.00003280244,0.00005158616,0.0000192246,0.00007317164,0.00001132927,0.00001544631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5600265,"threshold_uncertainty_score":0.8922125,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088446,0.0001129904,0.0001625121,0.00006464709,0.00006722471,0.0001140581,0.0008726115,0.000055597,0.00002183962],"category_scores_gemma":[0.0001257014,0.00009871793,0.00002853885,0.0005092294,0.00002127439,0.0009530176,0.0001418136,0.00008699702,0.0001297823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006618797,"about_ca_system_score_gemma":0.00003397568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001419715,"about_ca_topic_score_gemma":0.00028989,"domain_scores_codex":[0.9988318,0.0000626045,0.0002975037,0.0003355205,0.0002147491,0.000257824],"domain_scores_gemma":[0.9989384,0.00003616685,0.0001180275,0.0007712322,0.00007563573,0.000060537],"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.000009544259,0.00005585477,0.01183109,0.00001213142,0.000002052269,0.000006620261,0.0002256871,0.00001835778,0.0002457571,0.002522697,0.001341909,0.9837283],"study_design_scores_gemma":[0.0006420218,0.0001802608,0.04291657,0.0001403416,9.089796e-7,0.000008791265,0.00002064886,0.007515718,0.0008798569,0.005527375,0.9419156,0.0002519311],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1546269,0.004668736,0.7126225,0.01482768,0.006673182,0.06370661,0.00006797726,0.001909065,0.0408973],"genre_scores_gemma":[0.9550723,0.0002569931,0.03711316,0.0009035137,0.0008913978,0.005357548,0.00002765501,0.00002449777,0.0003528818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9834764,"threshold_uncertainty_score":0.40256,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001040368,0.00007047163,0.00008767716,0.00002804608,0.00005251646,0.0002161067,0.001664275,0.00003232991,0.0001043252],"category_scores_gemma":[0.00001297961,0.00005266827,0.00001724307,0.0002638603,0.00001942879,0.001479861,0.0004657216,0.00006297846,0.000879715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006588893,"about_ca_system_score_gemma":0.0000208096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004088573,"about_ca_topic_score_gemma":0.00001353897,"domain_scores_codex":[0.9992069,0.00002121649,0.0001222363,0.0003340178,0.000146367,0.0001692794],"domain_scores_gemma":[0.998517,0.0000172393,0.00003060322,0.001293804,0.00007159555,0.00006975872],"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":[5.617071e-7,0.00008098331,0.0009852304,0.000008305379,0.00003211243,0.00000722374,0.0002908974,0.00002254342,0.000469492,0.2809827,0.4149815,0.3021384],"study_design_scores_gemma":[0.0004132238,0.00004631484,0.01674546,0.00002187779,0.000003191645,0.00002346293,0.0001374808,0.7989737,0.0003228772,0.02789759,0.1549802,0.0004345386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004685233,0.00006455476,0.9610031,0.001330891,0.000532247,0.0001883625,0.00002053613,0.000204903,0.03197021],"genre_scores_gemma":[0.9107238,0.000003905754,0.0871043,0.0005025332,0.000058274,0.00002226064,0.00002887574,0.000004515316,0.001551535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9060386,"threshold_uncertainty_score":0.9998982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000786978,0.0006456936,0.0006590412,0.0003241037,0.0003036672,0.0007838688,0.003157155,0.000300764,0.00004129217],"category_scores_gemma":[0.00003582645,0.0005135711,0.0001070266,0.0007632438,0.000476511,0.002692248,0.0009443062,0.0006439188,0.0001665917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002936685,"about_ca_system_score_gemma":0.0007395343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001705873,"about_ca_topic_score_gemma":0.0001247379,"domain_scores_codex":[0.9955471,0.00002475068,0.0007707974,0.001179034,0.001571057,0.0009073323],"domain_scores_gemma":[0.9968549,0.00008639165,0.0006314335,0.001617319,0.0006388903,0.000171065],"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.00007958294,0.0001144107,0.0002180415,0.000273905,0.00006778938,0.0001268601,0.00363962,0.02335677,0.0002740518,0.2095924,0.0008637198,0.7613928],"study_design_scores_gemma":[0.003299794,0.001985789,0.0005382536,0.004572909,0.00004485509,0.0005618162,0.000001868834,0.5374287,0.005421574,0.1162161,0.3258116,0.00411667],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007508126,0.0003621139,0.97431,0.0004920355,0.001422329,0.0005599342,0.0000201397,0.0001877175,0.02257069],"genre_scores_gemma":[0.213625,0.0001042602,0.7819817,0.002808564,0.0004869057,0.00004598296,0.00003418518,0.00004675622,0.0008666672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7572762,"threshold_uncertainty_score":0.9997316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}