{"meta":{"query_hash":"bbd21f725eaa","filters":{"topic":"Distributed systems and fault tolerance"},"cohort_total":1063,"direct_labels_cover":3,"predictions_cover":1063,"exported":1063,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/bbd21f725eaa","api":"https://metacan.xera.ac/api/v1/cohort?topic=Distributed+systems+and+fault+tolerance"},"results":[{"id":"W105746118","doi":"10.1007/978-3-642-45249-9_14","title":"A TimeStamp Based Multi-version STM Algorithm","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Transactional memory; Garbage collection; Software transactional memory; Correctness; Timestamp; Concurrency control; Concurrency; Atomicity; Database transaction; Serializability; Algorithm; Parallel computing; Programming language; Transaction processing; Garbage; Real-time computing; Distributed transaction","score_opus":0.01220957497665111,"score_gpt":0.23332118979528807,"score_spread":0.22111161481863695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105746118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029582264,0.000587351,0.9612148,0.00014208988,0.00035971458,0.00015356854,0.00019808894,0.0038959722,0.0038660944],"genre_scores_gemma":[0.27423465,0.0002231001,0.7170042,0.00011626587,0.00011379678,0.00012919088,0.00062845874,0.00023784627,0.0073124995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999328,0.00009136739,0.0000757661,0.00014383267,0.0002825668,0.000078425575],"domain_scores_gemma":[0.9986129,0.00029129084,0.00009246162,0.0005536725,0.00037054447,0.00007899676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875584,0.00052173226,0.0010840446,0.0010343726,0.0006221466,0.0010990844,0.0018194745,0.0008105963,0.008969999],"category_scores_gemma":[0.002569285,0.00038848197,0.00048496254,0.0014680716,0.00028085022,0.0018622262,0.0013481902,0.0010789433,0.0017584412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009335012,0.00022770559,0.001024032,0.00018304407,0.0000811434,0.00010132281,0.00006552944,0.043513194,0.03281181,0.015587768,0.008623571,0.89684737],"study_design_scores_gemma":[0.00025336852,0.00048050322,0.0008002077,0.000031696494,0.00008687991,0.00048676715,0.00005484979,0.94189435,0.028102415,0.018392373,0.009374163,0.000042389358],"about_ca_topic_score_codex":0.001138315,"about_ca_topic_score_gemma":0.0015306569,"teacher_disagreement_score":0.008969999,"about_ca_system_score_codex":0.00050838396,"about_ca_system_score_gemma":0.0012315654,"threshold_uncertainty_score":0.0300076},"labels":[],"label_agreement":null},{"id":"W106139257","doi":"10.1007/978-0-387-74483-4","title":"Scheduling in Distributed Computing Systems","year":2008,"lang":"en","type":"book","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.017465549878484837,"score_gpt":0.23154046469276188,"score_spread":0.21407491481427704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106139257","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004804233,0.07211642,0.58344394,0.002604447,0.009636914,0.00024254674,0.0003641002,0.004471562,0.3223158],"genre_scores_gemma":[0.060936395,0.054458015,0.24587096,0.0015038211,0.0056032287,0.00039055003,0.0012191392,0.0017217683,0.6282961],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973446,0.000038180635,0.000012274111,0.000038312966,0.00015502745,0.000021698457],"domain_scores_gemma":[0.9996239,0.00014936696,0.00001605272,0.00008903701,0.00008819898,0.000033389708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038999162,0.0011285905,0.0009344759,0.0006401998,0.0005734527,0.0012552908,0.0009150116,0.0005387946,0.0127705615],"category_scores_gemma":[0.0009823673,0.00050690764,0.00031813115,0.0017382719,0.0006012228,0.001606606,0.00055347534,0.0016293941,0.008133078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100800156,0.00009862884,0.00010737533,0.00045653776,0.000024390616,0.0000726614,0.00014620351,0.022236617,0.0051907627,0.16584489,0.22845876,0.5772624],"study_design_scores_gemma":[0.000042182677,0.00006515088,0.00028267238,0.00016442598,0.00002748696,0.00017797753,0.000036925612,0.0455605,0.0021676014,0.1612618,0.7901881,0.00002515765],"about_ca_topic_score_codex":0.0016675695,"about_ca_topic_score_gemma":0.0018743506,"teacher_disagreement_score":0.0127705615,"about_ca_system_score_codex":0.0009792676,"about_ca_system_score_gemma":0.0012020842,"threshold_uncertainty_score":0.042721808},"labels":[],"label_agreement":null},{"id":"W108489294","doi":"","title":"Hardware acceleration for lock-free data structures and software-transactional memory","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Transactional memory; Software transactional memory; Computer science; Software; Thread (computing); Lock (firearm); Parallel computing; Embedded system; Operating system; Data structure; Scaling; Computer hardware; Programming language; Engineering","score_opus":0.057893715580371166,"score_gpt":0.2710026077961819,"score_spread":0.21310889221581075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108489294","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6118875,0.0023621994,0.37317905,0.0004394729,0.00036984394,0.000104988176,0.00009766739,0.0038584743,0.007700815],"genre_scores_gemma":[0.83935213,0.00036572097,0.1565572,0.00010163581,0.00010175705,0.0000906964,0.00021717754,0.0001479636,0.0030657088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937516,0.00008962048,0.00003191661,0.000064788655,0.0003255034,0.00011302133],"domain_scores_gemma":[0.998933,0.00031445362,0.000099596684,0.00030019516,0.00026957504,0.00008322948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047470268,0.00036398647,0.00033240582,0.0004957429,0.00032870114,0.00050606614,0.0018922988,0.00040131458,0.0034076953],"category_scores_gemma":[0.0017925311,0.00021292309,0.00031842853,0.0007471834,0.0003713881,0.0017347323,0.00076471455,0.00078633963,0.00043669413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020259283,0.00066475564,0.011580002,0.0008771256,0.00017393408,0.0005008383,0.00054388965,0.030482508,0.3812432,0.055170022,0.011644179,0.50509363],"study_design_scores_gemma":[0.00060927763,0.005650726,0.009391945,0.000078678015,0.0002266667,0.001777874,0.00025147278,0.4886875,0.40697163,0.015241829,0.07099105,0.000121354984],"about_ca_topic_score_codex":0.00061253615,"about_ca_topic_score_gemma":0.0010163771,"teacher_disagreement_score":0.0034076953,"about_ca_system_score_codex":0.0004830919,"about_ca_system_score_gemma":0.00047350503,"threshold_uncertainty_score":0.011399865},"labels":[],"label_agreement":null},{"id":"W111879427","doi":"","title":"Debugging Distributed Computations by Reverse Search","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Debugging; Computation; Enumeration; Predicate (mathematical logic); Parallel computing; Theoretical computer science; Distributed memory; Shared memory; Algorithm; Programming language; Mathematics","score_opus":0.014361040849173307,"score_gpt":0.2500858621280149,"score_spread":0.23572482127884162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111879427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01727864,0.00009359732,0.97741425,0.000116714036,0.000018673747,0.00006438607,0.000044015604,0.0028851086,0.0020845216],"genre_scores_gemma":[0.3117044,0.00013751346,0.6844804,0.00013381857,0.000021929129,0.000231579,0.00023506753,0.00048532453,0.00257001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979153,0.0007538159,0.000115395116,0.00038807528,0.00066418474,0.00016323899],"domain_scores_gemma":[0.9929376,0.0037352934,0.00044911064,0.0022401416,0.0005303601,0.000107421736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885716,0.00072712236,0.0008032749,0.00071696006,0.00051174103,0.0014351603,0.0020396216,0.00089981547,0.0032462212],"category_scores_gemma":[0.0093448525,0.0004384717,0.0005591484,0.0008081167,0.0013302413,0.0036544427,0.0024943433,0.0015089989,0.0009578422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010264678,0.0003527304,0.004561818,0.00033053107,0.000099821875,0.00033444638,0.0008028432,0.19740729,0.028008323,0.15963537,0.0066122795,0.6008281],"study_design_scores_gemma":[0.00011280042,0.00018784704,0.0002673111,0.00003561667,0.0000390565,0.00023790677,0.00010002288,0.8724103,0.03263469,0.08431333,0.009627647,0.000033399978],"about_ca_topic_score_codex":0.0015049021,"about_ca_topic_score_gemma":0.0022054843,"teacher_disagreement_score":0.0032462212,"about_ca_system_score_codex":0.0006491353,"about_ca_system_score_gemma":0.0012115621,"threshold_uncertainty_score":0.010859668},"labels":[],"label_agreement":null},{"id":"W113335647","doi":"","title":"A Lazy Replication Scheme for Loosely Synchronized UDDI Registries.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Session (web analytics); Scalability; Replication (statistics); Scheme (mathematics); Failover; Web service; High availability; Distributed computing; Computer network; Database; World Wide Web","score_opus":0.020597982225951928,"score_gpt":0.2746282626516152,"score_spread":0.2540302804256633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113335647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003790443,0.00026906744,0.9905806,0.00022426435,0.00019189264,0.00031000678,0.00009418468,0.002766554,0.0017730023],"genre_scores_gemma":[0.18107045,0.000396216,0.80654776,0.00027632542,0.00018629088,0.00059321005,0.0006816635,0.0004448075,0.009803265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540967,0.0014217894,0.00069489627,0.0007531889,0.0014002833,0.00032018358],"domain_scores_gemma":[0.99202067,0.0008617488,0.0007362385,0.004747103,0.0012041853,0.00042997667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057480494,0.00054102496,0.0008204217,0.0012392062,0.0027836636,0.0028293678,0.0037232898,0.001241708,0.0033092506],"category_scores_gemma":[0.011411855,0.00066173467,0.0007506029,0.0014404415,0.0012176504,0.0043763155,0.0055656633,0.0017959158,0.0021004686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000928047,0.000256828,0.0031240906,0.0005257987,0.00022319588,0.00048312946,0.0016279534,0.049224507,0.03606284,0.37311763,0.04049843,0.49392745],"study_design_scores_gemma":[0.00053041324,0.0005969056,0.0008703685,0.00013602439,0.0002304131,0.0013720695,0.00040890084,0.579999,0.037615746,0.13578197,0.24213652,0.00032159014],"about_ca_topic_score_codex":0.0025192366,"about_ca_topic_score_gemma":0.002746163,"teacher_disagreement_score":0.0057480494,"about_ca_system_score_codex":0.0017354856,"about_ca_system_score_gemma":0.0034827923,"threshold_uncertainty_score":0.030398965},"labels":[],"label_agreement":null},{"id":"W116622556","doi":"10.4018/978-1-59140-553-5.ch010","title":"Adaptive Mobile Applications","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless; Mobile device; Variety (cybernetics); Telecommunications; Hotspot (geology); Computer network; World Wide Web","score_opus":0.014717815519949733,"score_gpt":0.24292568228714037,"score_spread":0.22820786676719063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116622556","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009182045,0.019947805,0.43475857,0.0018394658,0.0017656118,0.0005459232,0.0014927663,0.02211122,0.50835663],"genre_scores_gemma":[0.11758639,0.022098774,0.1653827,0.0018922662,0.001092461,0.00054617244,0.0034343586,0.001829673,0.68613726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998118,0.000022524559,0.000011663709,0.00003701728,0.000094246265,0.000022704491],"domain_scores_gemma":[0.99977416,0.00005766048,0.000011849731,0.00006852695,0.00006665915,0.000021279433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019832466,0.0009120721,0.0003823907,0.0006616457,0.00040521668,0.0016264514,0.0015271555,0.0011029358,0.03934674],"category_scores_gemma":[0.0009421153,0.0002887468,0.00038838125,0.000997761,0.00027090756,0.00179258,0.0012716758,0.0010945012,0.027549632],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006176749,0.000101674734,0.0003323504,0.0006987452,0.000027078078,0.00036307998,0.00029988185,0.0041816584,0.01611749,0.0589972,0.14691883,0.7719002],"study_design_scores_gemma":[0.000016258577,0.0000456345,0.0004427918,0.00017012027,0.000020751293,0.00082958763,0.000069369096,0.01054623,0.0044291113,0.021785084,0.96162444,0.000020495807],"about_ca_topic_score_codex":0.00034498834,"about_ca_topic_score_gemma":0.0005024495,"teacher_disagreement_score":0.03934674,"about_ca_system_score_codex":0.000302732,"about_ca_system_score_gemma":0.00022146052,"threshold_uncertainty_score":0.13162792},"labels":[],"label_agreement":null},{"id":"W120956543","doi":"","title":"The HAS architecture : a highly available and scalable cluster architecture for Web servers","year":2006,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Failover; Space-based architecture; Server; Scalability; Redundancy (engineering); Distributed computing; Applications architecture; Web server; Computer network; Software architecture; Operating system; The Internet; Software","score_opus":0.016465678023555624,"score_gpt":0.23978722728678045,"score_spread":0.22332154926322484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120956543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08145448,0.001484367,0.84336954,0.0011946079,0.00045257856,0.0006585683,0.00058420026,0.022738613,0.048063047],"genre_scores_gemma":[0.5489747,0.0012185547,0.41526052,0.0004315862,0.00027054467,0.00041322203,0.0017825239,0.0009865446,0.030661862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993717,0.000105182866,0.000041805033,0.000069611386,0.0003119445,0.00009983141],"domain_scores_gemma":[0.9994253,0.0000623553,0.00003963737,0.00016286554,0.00021657445,0.000093254705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007199596,0.00031485522,0.00027963184,0.0005563004,0.0008113119,0.0017272752,0.0017249886,0.0005401601,0.004014909],"category_scores_gemma":[0.0010500946,0.0003422675,0.00035762857,0.00052174344,0.00053843786,0.001857066,0.0013647291,0.00094178296,0.0014156097],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008528984,0.00037616017,0.005775575,0.0009130852,0.00024369542,0.0006463977,0.0010309949,0.11587158,0.13552658,0.20457491,0.07279797,0.4613902],"study_design_scores_gemma":[0.00019397176,0.0008574142,0.0064843036,0.00017884222,0.00017185218,0.00070197677,0.0005290629,0.5486779,0.06514233,0.046484858,0.33038408,0.00019348421],"about_ca_topic_score_codex":0.0024767052,"about_ca_topic_score_gemma":0.0034159266,"teacher_disagreement_score":0.004014909,"about_ca_system_score_codex":0.00096529815,"about_ca_system_score_gemma":0.0015032422,"threshold_uncertainty_score":0.013431191},"labels":[],"label_agreement":null},{"id":"W124832896","doi":"10.1007/978-3-642-21470-7_23","title":"Table-Driven Detection and Resolution of Operation-Based Merge Conflicts with Mirador","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Merge (version control); Table (database); Computer graphics (images); Data mining; Information retrieval","score_opus":0.016007842068081812,"score_gpt":0.21648233303449835,"score_spread":0.20047449096641654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124832896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1398549,0.0009776478,0.83175397,0.00061223644,0.0004246864,0.00030240172,0.00032185827,0.016353808,0.009398487],"genre_scores_gemma":[0.6089119,0.00012433188,0.38580626,0.00019205967,0.0000685991,0.000088065855,0.00048129325,0.00047437815,0.0038531837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727124,0.00060594565,0.00024717062,0.00045582606,0.0010640876,0.00035573126],"domain_scores_gemma":[0.9942536,0.0025888067,0.00055443286,0.0013030341,0.0010906754,0.00020943422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025435765,0.00068786263,0.0012567418,0.0017377291,0.0008159773,0.0021504937,0.0027440954,0.001038683,0.0053404667],"category_scores_gemma":[0.009086965,0.00058761414,0.0005864216,0.001056871,0.0008697809,0.0028200615,0.0024550287,0.0011377665,0.0012813824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040008943,0.0004688235,0.009563653,0.00060439477,0.00025278953,0.0010001071,0.0011844499,0.038789522,0.105331495,0.0352529,0.013511952,0.79003906],"study_design_scores_gemma":[0.00016663049,0.0004933658,0.0018813567,0.00006291151,0.00014691155,0.0006451342,0.0005006658,0.7979648,0.16710669,0.018154886,0.012774456,0.00010224867],"about_ca_topic_score_codex":0.000935106,"about_ca_topic_score_gemma":0.0019147097,"teacher_disagreement_score":0.0053404667,"about_ca_system_score_codex":0.0005738884,"about_ca_system_score_gemma":0.0012721221,"threshold_uncertainty_score":0.017865598},"labels":[],"label_agreement":null},{"id":"W128328625","doi":"10.1007/978-1-4020-6264-3_5","title":"A Simple and Efficient Solution for Room Synchronization Problem in Distributed Computing","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Concurrency; Computer science; Distributed computing; Synchronization (alternating current); Simple (philosophy); Concurrency control; Data sharing; Parallel computing; Computer network; Database","score_opus":0.019477108538414823,"score_gpt":0.253556488565995,"score_spread":0.23407938002758016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128328625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022617283,0.00011397516,0.99181855,0.00009833889,0.00011539457,0.00006775454,0.00007172854,0.00085885084,0.0045935693],"genre_scores_gemma":[0.04911582,0.00024653852,0.9356888,0.00009738589,0.00009913492,0.00023346563,0.00023911173,0.0003254147,0.01395425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975425,0.00003572373,0.000012429705,0.000049568076,0.00011405535,0.00003406069],"domain_scores_gemma":[0.99978536,0.00007689004,0.000013456781,0.000062605846,0.000044375054,0.000017397022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821618,0.0011455794,0.0014160776,0.0005649649,0.000884528,0.0007994084,0.0023500244,0.0016788186,0.014189171],"category_scores_gemma":[0.0012323679,0.00047578558,0.0010224539,0.0008762822,0.000627974,0.0015816061,0.0022573487,0.0016060056,0.0029408827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002510024,0.00021876916,0.00028069387,0.0005702884,0.00009132762,0.00026076337,0.00022746267,0.26234478,0.035463594,0.1209847,0.033247173,0.5460594],"study_design_scores_gemma":[0.00010609547,0.00006896413,0.0001373543,0.00002081777,0.000043478,0.00015319299,0.000070942224,0.89555985,0.00637062,0.07678185,0.020655505,0.000031309493],"about_ca_topic_score_codex":0.0017563642,"about_ca_topic_score_gemma":0.0027821271,"teacher_disagreement_score":0.014189171,"about_ca_system_score_codex":0.00034087425,"about_ca_system_score_gemma":0.0007287675,"threshold_uncertainty_score":0.04746753},"labels":[],"label_agreement":null},{"id":"W131555684","doi":"","title":"Fault tolerance in the mobile environment","year":2009,"lang":"en","type":"article","venue":"Journal of Multimedia","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Fault tolerance; Process (computing); Distributed computing; Wireless; Embedded system; Implementation; Fault (geology); Computer network; Operating system","score_opus":0.009183619956368627,"score_gpt":0.23916955992694722,"score_spread":0.2299859399705786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131555684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045399044,0.039079126,0.79247487,0.010794016,0.0024029044,0.00020191634,0.000304668,0.0028653904,0.10647806],"genre_scores_gemma":[0.7649905,0.023958322,0.14611854,0.0019752253,0.0012224617,0.00025585154,0.00039894733,0.0003395953,0.060740672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930227,0.00012884424,0.00003414342,0.00012109881,0.00026931232,0.00014429128],"domain_scores_gemma":[0.9992649,0.00022462025,0.00011636654,0.00016832858,0.00016124644,0.00006449689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040328078,0.00047898394,0.0006253777,0.0004975084,0.0009814216,0.0021124755,0.0010355356,0.0015803605,0.004157801],"category_scores_gemma":[0.0015663755,0.00017923104,0.00034001077,0.0006875569,0.0013605503,0.002561263,0.0017802472,0.0011312368,0.0019422291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015406286,0.000058283204,0.0016945357,0.0011314529,0.00006690363,0.0013853434,0.0011211311,0.08712419,0.01759679,0.537627,0.03431469,0.31772563],"study_design_scores_gemma":[0.000039683724,0.00031217866,0.0013405354,0.000539107,0.00004822143,0.0026323062,0.0006918401,0.07684221,0.011850429,0.3692029,0.5364004,0.00010032234],"about_ca_topic_score_codex":0.0012493113,"about_ca_topic_score_gemma":0.0006930435,"teacher_disagreement_score":0.004157801,"about_ca_system_score_codex":0.0008219465,"about_ca_system_score_gemma":0.0007353808,"threshold_uncertainty_score":0.01390928},"labels":[],"label_agreement":null},{"id":"W1455550877","doi":"10.2316/p.2010.676-052","title":"A Wait-Free Dynamic Storage Allocator by Adopting the Helping Queue Pattern","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Allocator; Queue; Operating system; Computer network","score_opus":0.004837392620360122,"score_gpt":0.21460570756073702,"score_spread":0.2097683149403769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1455550877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021735199,0.00028076395,0.9661651,0.00028800048,0.00020943611,0.00023484201,0.00015293853,0.0068223528,0.004111336],"genre_scores_gemma":[0.21185209,0.00019243338,0.7747242,0.0003621864,0.00008903457,0.00041883785,0.0002960026,0.00078587193,0.011279335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929833,0.00009390232,0.00009424441,0.00016719651,0.00022265025,0.00012364068],"domain_scores_gemma":[0.998613,0.00018747505,0.0001116621,0.00053851446,0.00041051343,0.00013887657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411443,0.00048750523,0.0005161114,0.0008357135,0.00094104337,0.0015130962,0.0034837157,0.00075743656,0.0046484005],"category_scores_gemma":[0.0023093687,0.00045698823,0.00049701467,0.0008983322,0.0009501259,0.0019147942,0.0018698259,0.0010064968,0.001969281],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015179488,0.00045511135,0.0049693296,0.000708071,0.00015917465,0.00042908438,0.0011736989,0.041970428,0.18275239,0.21335448,0.026981723,0.52552855],"study_design_scores_gemma":[0.00070566894,0.0008605622,0.0014294895,0.00011570179,0.000262998,0.0009818879,0.00023596387,0.6176804,0.14708363,0.06675783,0.16366208,0.00022391068],"about_ca_topic_score_codex":0.0029204683,"about_ca_topic_score_gemma":0.004119199,"teacher_disagreement_score":0.0046484005,"about_ca_system_score_codex":0.0008189237,"about_ca_system_score_gemma":0.002430528,"threshold_uncertainty_score":0.015550435},"labels":[],"label_agreement":null},{"id":"W1482472825","doi":"10.1007/978-3-642-03367-4_10","title":"A Distribution-Sensitive Dictionary with Low Space Overhead","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Overhead (engineering); Sequence (biology); Data structure; Space (punctuation); Algorithm; Theoretical computer science; Programming language","score_opus":0.00661822233043657,"score_gpt":0.21343378547618191,"score_spread":0.20681556314574534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482472825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021108808,0.00046560293,0.96498424,0.00032077174,0.00049645465,0.00013290554,0.00041813092,0.006090369,0.005982698],"genre_scores_gemma":[0.23761544,0.0005360749,0.73306215,0.0006276895,0.00048546217,0.0002148868,0.0016330997,0.0012556567,0.024569618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897027,0.00013005415,0.00008599628,0.00019170852,0.0004913381,0.00013063166],"domain_scores_gemma":[0.9978555,0.00036901183,0.000114852875,0.0010815065,0.00043261066,0.00014646794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042089686,0.0006555223,0.0011327913,0.0008815747,0.00089231244,0.0013205117,0.0018057672,0.0007845534,0.009433936],"category_scores_gemma":[0.00284083,0.00042906837,0.00042173106,0.0018385138,0.0006701618,0.0025273485,0.0032997944,0.0011005695,0.004576025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013320108,0.00027204226,0.00060701376,0.0002630036,0.000059936516,0.00023735256,0.00016315507,0.014578637,0.06895385,0.046836015,0.034665495,0.8320315],"study_design_scores_gemma":[0.0009064751,0.0012061883,0.0010204545,0.00010546715,0.00020122874,0.0024423045,0.00038605736,0.54762423,0.18716876,0.15118587,0.107550316,0.00020258722],"about_ca_topic_score_codex":0.0008582899,"about_ca_topic_score_gemma":0.0020465525,"teacher_disagreement_score":0.009433936,"about_ca_system_score_codex":0.0004069403,"about_ca_system_score_gemma":0.0012479406,"threshold_uncertainty_score":0.031559646},"labels":[],"label_agreement":null},{"id":"W1488252274","doi":"10.3233/fun-2004-59402","title":"Leader Election in Rings with Nonunique Labels","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Mathematics; Artificial intelligence","score_opus":0.006780213110684829,"score_gpt":0.2129740249290568,"score_spread":0.20619381181837196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488252274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1558294,0.0009177585,0.83512294,0.00093255215,0.000111421985,0.00011033129,0.00007746018,0.0004633007,0.0064347787],"genre_scores_gemma":[0.71862906,0.0007579077,0.27251768,0.000114869756,0.00020095966,0.0002334392,0.00014453461,0.000080228354,0.0073213866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978854,0.0009360547,0.00008448435,0.00041755577,0.0003187482,0.00035776084],"domain_scores_gemma":[0.99394715,0.004107091,0.0007908118,0.0006076122,0.00027605082,0.00027127287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026936003,0.0004227067,0.001003156,0.00044979947,0.0015041842,0.0015324835,0.0017310987,0.0012845864,0.0017412058],"category_scores_gemma":[0.0061984276,0.00043282,0.0005436857,0.0008237228,0.0012666362,0.004231945,0.0018122083,0.0010329044,0.0006557966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014877985,0.00030309198,0.0026554484,0.0005057535,0.00008161342,0.0009979989,0.0010307978,0.5628001,0.020202521,0.31468743,0.0043065143,0.09094088],"study_design_scores_gemma":[0.0002306976,0.00026776784,0.00045047776,0.00001662376,0.00004007826,0.00021511874,0.00022952944,0.8252045,0.008023503,0.15970059,0.005584781,0.000036349196],"about_ca_topic_score_codex":0.00044496218,"about_ca_topic_score_gemma":0.0004937231,"teacher_disagreement_score":0.0026936003,"about_ca_system_score_codex":0.0005649256,"about_ca_system_score_gemma":0.0004418868,"threshold_uncertainty_score":0.014245272},"labels":[],"label_agreement":null},{"id":"W1493499543","doi":"10.1007/978-3-540-30555-2_14","title":"A Nested Transaction Model for LDAP Transactions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Lightweight Directory Access Protocol; Computer science; Directory service; Database; Server; Nested transaction; Database transaction; Transaction processing; Distributed transaction; Relational database; Directory; Computer network; Operating system; Distributed computing","score_opus":0.022404242735198622,"score_gpt":0.24891958793680424,"score_spread":0.22651534520160563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493499543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065112454,0.0004310156,0.98386717,0.0003743523,0.0001228543,0.00019872554,0.0004151738,0.0019019748,0.0061774147],"genre_scores_gemma":[0.30967903,0.00088138354,0.66319925,0.00045624303,0.0003048203,0.0010148016,0.0015429631,0.0009220578,0.021999536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959785,0.0009923098,0.00048292457,0.00042851878,0.0017605328,0.00035726352],"domain_scores_gemma":[0.99584645,0.0010232623,0.00018891733,0.0018711843,0.00080841716,0.00026176398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002947788,0.0008035145,0.0012392098,0.0010294836,0.001598279,0.0052511566,0.0034808693,0.00206054,0.006238763],"category_scores_gemma":[0.008518799,0.0013234288,0.0012749571,0.0019776141,0.001761214,0.008377347,0.0028498364,0.0029844958,0.0034197925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029126933,0.00021358774,0.0011039707,0.00022861142,0.000049725488,0.00036333228,0.0009855676,0.06507972,0.0052897264,0.8191776,0.015352399,0.091864474],"study_design_scores_gemma":[0.00008250556,0.00009395727,0.00012391011,0.00006612498,0.000057511497,0.00031774907,0.000106069245,0.5186321,0.002847292,0.4363719,0.041246224,0.0000547324],"about_ca_topic_score_codex":0.0044134897,"about_ca_topic_score_gemma":0.004769191,"teacher_disagreement_score":0.006238763,"about_ca_system_score_codex":0.001498924,"about_ca_system_score_gemma":0.002164877,"threshold_uncertainty_score":0.020870745},"labels":[],"label_agreement":null},{"id":"W1493666959","doi":"","title":"Система миграции виртуальных серверов в режиме реального времени","year":2008,"lang":"ru","type":"article","venue":"Вестник Новосибирского государственного университета. Серия: Информационные технологии","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Operating system; Computer science; Library science; Software engineering","score_opus":0.029932699232222162,"score_gpt":0.23381453295417007,"score_spread":0.2038818337219479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493666959","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08501453,0.046175387,0.33219713,0.0074695842,0.0033385982,0.0004348885,0.001592598,0.00154504,0.52223223],"genre_scores_gemma":[0.66045463,0.028430987,0.20956239,0.0005554818,0.000872425,0.0009074778,0.000722985,0.00080615823,0.09768747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985191,0.00021484436,0.00006829936,0.00029543438,0.0007675539,0.00013472699],"domain_scores_gemma":[0.9984199,0.0003895384,0.00020153058,0.0003154142,0.0005346197,0.00013907818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012240484,0.00046317122,0.0004795454,0.0021895648,0.0016967681,0.0038961526,0.0006598727,0.0010915602,0.03080337],"category_scores_gemma":[0.0033574225,0.0008337104,0.00046622747,0.0018607537,0.002465044,0.0025034633,0.0014904615,0.0017515887,0.010117089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024142355,0.00009414464,0.0016507071,0.0006042333,0.000037239988,0.0008213177,0.0015426179,0.0027681303,0.047929157,0.6821674,0.014037723,0.24810584],"study_design_scores_gemma":[0.000058102618,0.00013689706,0.0022252216,0.00029595848,0.000059558875,0.0016856436,0.0009130985,0.004485062,0.038419243,0.20611055,0.7454502,0.00016043658],"about_ca_topic_score_codex":0.0024903612,"about_ca_topic_score_gemma":0.003315524,"teacher_disagreement_score":0.03080337,"about_ca_system_score_codex":0.0012655135,"about_ca_system_score_gemma":0.0019314123,"threshold_uncertainty_score":0.10304761},"labels":[],"label_agreement":null},{"id":"W1496432666","doi":"10.1007/978-3-642-17653-1_31","title":"On the Message Complexity of Global Computations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Upper and lower bounds; Computer science; Node (physics); Class (philosophy); Tree traversal; Identifier; Discrete mathematics; Combinatorics; Communication complexity; Degree (music); Theoretical computer science; Mathematics; Algorithm; Computer network; Physics; Artificial intelligence","score_opus":0.0265782751493129,"score_gpt":0.26425465287326083,"score_spread":0.23767637772394792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496432666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16044824,0.013198708,0.601114,0.018335158,0.0015604121,0.00023642041,0.0010974914,0.0013004259,0.20270917],"genre_scores_gemma":[0.84425735,0.007970415,0.09643675,0.0016300984,0.004041375,0.00067849585,0.001137888,0.0015668619,0.04228074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938226,0.0017578087,0.00021775768,0.00064976286,0.002548633,0.0010034771],"domain_scores_gemma":[0.9366119,0.05432708,0.0012471041,0.005024421,0.0017400519,0.0010496022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048702382,0.0017579768,0.0029217766,0.0028156117,0.0021514734,0.005828795,0.0039796247,0.0027407163,0.015894968],"category_scores_gemma":[0.040259715,0.0013408152,0.0016725472,0.004100307,0.0056931125,0.020451091,0.0047021555,0.009349493,0.0019326333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045871027,0.000106016334,0.0007816924,0.00027444863,0.000056575973,0.000100906065,0.00030495704,0.0447683,0.0019781336,0.90622073,0.011204261,0.03374529],"study_design_scores_gemma":[0.000046033576,0.000026751415,0.00036844253,0.000041167146,0.0000283337,0.000056613033,0.000045620924,0.11753204,0.00064667774,0.87863386,0.0025561312,0.000018447256],"about_ca_topic_score_codex":0.0023378457,"about_ca_topic_score_gemma":0.0017789004,"teacher_disagreement_score":0.015894968,"about_ca_system_score_codex":0.0045411293,"about_ca_system_score_gemma":0.0022060354,"threshold_uncertainty_score":0.05317402},"labels":[],"label_agreement":null},{"id":"W1498104397","doi":"10.3233/fi-2015-1224","title":"Characterising Concurrent Histories","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Semaphore; Interleaving; Partially ordered set; Invariant (physics); Causality (physics); Set (abstract data type); Computer science; Mathematics; Sequence (biology); Intersection (aeronautics); Theoretical computer science; Discrete mathematics; Programming language","score_opus":0.04913518201304213,"score_gpt":0.25703201312074914,"score_spread":0.20789683110770701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498104397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1233708,0.0013196326,0.8571363,0.00025044472,0.00007400703,0.00028960864,0.00058612454,0.0006403239,0.016332736],"genre_scores_gemma":[0.82093424,0.00085233967,0.1700421,0.000114184295,0.0001923169,0.00041697468,0.0008156404,0.00015925958,0.006473039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743134,0.00069940154,0.00028152394,0.0004582756,0.00084817305,0.0002813471],"domain_scores_gemma":[0.9939142,0.0031586401,0.0009630869,0.0009527103,0.0007319215,0.0002795991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606938,0.0007186702,0.0004528698,0.0026696168,0.0010305704,0.0024653582,0.00087046943,0.000902573,0.0031740977],"category_scores_gemma":[0.008410121,0.00055433036,0.0008613917,0.0017127017,0.002992021,0.0051113134,0.0023102819,0.0011331053,0.0003770981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008215725,0.000036534882,0.0024916525,0.00013740969,0.00003152124,0.0007395736,0.0016891086,0.027215295,0.0046239374,0.9347091,0.00042466735,0.027819121],"study_design_scores_gemma":[0.000020041323,0.0000870123,0.0010108717,0.00008810003,0.000030090008,0.00059692474,0.0004813795,0.054541197,0.004534193,0.9210785,0.017496813,0.000034936922],"about_ca_topic_score_codex":0.0014716014,"about_ca_topic_score_gemma":0.0011137304,"teacher_disagreement_score":0.0031740977,"about_ca_system_score_codex":0.00088730897,"about_ca_system_score_gemma":0.00078662485,"threshold_uncertainty_score":0.010618389},"labels":[],"label_agreement":null},{"id":"W1499151993","doi":"10.1109/hicss.1998.649276","title":"A transactional activity model for organizing open-ended cooperative activities","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Transactional leadership; Transactional analysis; Psychology","score_opus":0.06425526513386685,"score_gpt":0.27611282100415513,"score_spread":0.21185755587028826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499151993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002857716,0.0004629855,0.9860095,0.00059743656,0.00010201143,0.00023599845,0.00019179769,0.0004427639,0.009099801],"genre_scores_gemma":[0.15537778,0.0011164715,0.82969254,0.0003410743,0.00015221657,0.00122619,0.0006841608,0.000130409,0.011279234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997022,0.00091725955,0.00050014304,0.0005280204,0.00082433975,0.00020822884],"domain_scores_gemma":[0.9966484,0.001092503,0.00036356298,0.0008894383,0.00068623904,0.00031985948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029210297,0.0010376455,0.0008168883,0.0018355735,0.0013121958,0.00480299,0.0037323018,0.0020997778,0.0053590727],"category_scores_gemma":[0.0058666375,0.0007089413,0.0017647201,0.0023953712,0.002649112,0.008333024,0.0021708338,0.0022726506,0.0021850648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006846995,0.00009839777,0.0006744498,0.00020397363,0.000044253502,0.00030994628,0.0010006567,0.041544937,0.0020108335,0.9115057,0.002932669,0.039605647],"study_design_scores_gemma":[0.00010392875,0.00018240708,0.00041665087,0.00022641795,0.00011188529,0.00068712205,0.00051285507,0.3194093,0.0031811888,0.53708357,0.1379833,0.00010133784],"about_ca_topic_score_codex":0.0040713595,"about_ca_topic_score_gemma":0.0036911273,"teacher_disagreement_score":0.0053590727,"about_ca_system_score_codex":0.0023084844,"about_ca_system_score_gemma":0.0029881557,"threshold_uncertainty_score":0.017927945},"labels":[],"label_agreement":null},{"id":"W1501306102","doi":"10.1007/3-540-40026-5_3","title":"Bounds for Mutual Exclusion with only Processor Consistency","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Consistency (knowledge bases); Sequential consistency; Computer science; Consistency model; Upper and lower bounds; Weak consistency; Type (biology); Corollary; Algorithm; Strong consistency; Data consistency; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Distributed computing; Statistics","score_opus":0.0128336601059376,"score_gpt":0.23772800462850088,"score_spread":0.2248943445225633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501306102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017804883,0.0064576846,0.85717934,0.0043836916,0.0017347231,0.00014653793,0.00050724496,0.0023252286,0.10946074],"genre_scores_gemma":[0.7006796,0.004873562,0.23964877,0.0031348832,0.005084656,0.0013643148,0.0008916057,0.0027528869,0.04156984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98810357,0.0028751746,0.00051641057,0.0016340404,0.0046873423,0.002183391],"domain_scores_gemma":[0.93426734,0.04744494,0.0018396986,0.010774445,0.0040123397,0.0016612995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008977445,0.002564097,0.0037533932,0.0032415374,0.0037020752,0.007695425,0.007518426,0.003745008,0.016577344],"category_scores_gemma":[0.049164325,0.00199069,0.002263986,0.003881151,0.005839529,0.0282225,0.0097363945,0.014856215,0.0036588225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040663278,0.00009937131,0.00021584267,0.0002610745,0.000057025085,0.00005188921,0.00027513548,0.019541275,0.0010854938,0.9352931,0.010084949,0.032628328],"study_design_scores_gemma":[0.000036961694,0.00003764788,0.00011335806,0.000076632954,0.000055745226,0.00004600234,0.000028798318,0.05320522,0.0010790394,0.93945163,0.00583907,0.000029891133],"about_ca_topic_score_codex":0.0015428336,"about_ca_topic_score_gemma":0.0015713224,"teacher_disagreement_score":0.016577344,"about_ca_system_score_codex":0.0046691652,"about_ca_system_score_gemma":0.002642628,"threshold_uncertainty_score":0.055456698},"labels":[],"label_agreement":null},{"id":"W1502963061","doi":"10.1109/iscc.2004.1358512","title":"Performance analysis of a hybrid push-pull algorithm with QoS adaptations in wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Broadcasting (networking); Computer network; Queue; Queueing theory; Scheme (mathematics); Wireless; Push and pull; Distributed computing; Wireless network; Telecommunications; Engineering; Mathematics","score_opus":0.007357597342599136,"score_gpt":0.2061715776530178,"score_spread":0.19881398031041866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502963061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42811725,0.0014033392,0.56355375,0.00042711355,0.000095727024,0.00013151538,0.000054818753,0.00068573153,0.0055307294],"genre_scores_gemma":[0.95391744,0.00021953565,0.044589177,0.00004132958,0.000035515222,0.00005426307,0.000029985726,0.00004247167,0.0010702563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853444,0.00057257526,0.00005600073,0.00012483237,0.00052522874,0.00018703584],"domain_scores_gemma":[0.9944666,0.0039185034,0.00033441687,0.0003578176,0.0007732849,0.00014936327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027917589,0.00073774485,0.00076072355,0.00069745356,0.00071327825,0.0010117866,0.0010415278,0.0008762986,0.0011648828],"category_scores_gemma":[0.009098367,0.00031537405,0.00021607631,0.0006734084,0.0007486583,0.0015223215,0.00078554166,0.00056483323,0.00024072523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006853384,0.00012562609,0.0022353814,0.00011413171,0.00008780525,0.00009774146,0.00012428264,0.9052221,0.020378813,0.0092567075,0.00070925796,0.06096275],"study_design_scores_gemma":[0.000011666103,0.000070645925,0.00018734194,0.0000025121747,0.000009637748,0.00003352954,0.000014726424,0.99734926,0.0013458031,0.00082847674,0.00014117984,0.000005194982],"about_ca_topic_score_codex":0.0015083237,"about_ca_topic_score_gemma":0.0009715501,"teacher_disagreement_score":0.0027917589,"about_ca_system_score_codex":0.0010424556,"about_ca_system_score_gemma":0.0006723336,"threshold_uncertainty_score":0.014764428},"labels":[],"label_agreement":null},{"id":"W1506291714","doi":"10.1007/3-540-48035-8_15","title":"Distributed Deadlock Detection in Mobile Agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Deadlock; Distributed computing; Deadlock prevention algorithms; Mobile agent; Asynchronous communication; Locality; Fault tolerance; Multi-agent system; Computer network; Artificial intelligence","score_opus":0.014690913300679464,"score_gpt":0.22763569678847612,"score_spread":0.21294478348779666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506291714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028881136,0.0019251015,0.96246374,0.00026647636,0.00015899698,0.00006819774,0.000021736008,0.0015451779,0.0046694726],"genre_scores_gemma":[0.7546381,0.0007617336,0.2374867,0.00011405554,0.00010098922,0.00016084807,0.00008644082,0.00024665028,0.0064045326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850583,0.0005096968,0.00009299147,0.00024259904,0.00046174042,0.00018726302],"domain_scores_gemma":[0.9958982,0.0028869542,0.00018790275,0.00045201654,0.00044017457,0.00013460961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024958076,0.00059380545,0.0012164477,0.0009942274,0.0008173146,0.0017807218,0.0021046414,0.0011046638,0.0016834979],"category_scores_gemma":[0.006584667,0.00075939804,0.00053195923,0.00065114064,0.0012408072,0.002192179,0.0019902096,0.0017310032,0.0003023628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011218709,0.00026434346,0.0025571263,0.0006201299,0.00017333639,0.00047782864,0.0008953223,0.30450273,0.026659431,0.16817681,0.006645395,0.48790568],"study_design_scores_gemma":[0.00009628202,0.000111521986,0.00032755514,0.000050371804,0.00005772535,0.00018050744,0.00007988761,0.8720934,0.011409892,0.11035913,0.005204528,0.000029203942],"about_ca_topic_score_codex":0.0010640759,"about_ca_topic_score_gemma":0.0010142723,"teacher_disagreement_score":0.0024958076,"about_ca_system_score_codex":0.00084611,"about_ca_system_score_gemma":0.0007782302,"threshold_uncertainty_score":0.01319927},"labels":[],"label_agreement":null},{"id":"W1508051368","doi":"10.1007/3-540-45508-6_11","title":"Distributed Resource Management to Support Distributed Application-Specific Quality of Service","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Quality of service; Computer science; Mobile QoS; Resource allocation; Resource (disambiguation); Key (lock); Distributed computing; Service (business); Resource management (computing); Quality (philosophy); Architecture; Computer network; Computer security; Service provider","score_opus":0.024575646089857482,"score_gpt":0.27073809193308324,"score_spread":0.24616244584322575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508051368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069793696,0.0008818812,0.96344113,0.00041891154,0.0005126841,0.00013414734,0.000092933034,0.00641474,0.021124145],"genre_scores_gemma":[0.31341845,0.0014841121,0.6170297,0.0008408228,0.0004598881,0.00046845365,0.0010186675,0.0013773885,0.06390255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996282,0.000056486148,0.000023802168,0.00005672778,0.00018960364,0.000045106462],"domain_scores_gemma":[0.99951804,0.00011144814,0.000022822149,0.00018880563,0.000119780394,0.00003910713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077259965,0.0004439701,0.00043799757,0.00044739328,0.0005302055,0.0011467213,0.0016640519,0.00062713603,0.0052302084],"category_scores_gemma":[0.0013045328,0.00031742858,0.00034710814,0.00068756146,0.0004088386,0.0011895705,0.0009851317,0.0017864039,0.0017994137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020467673,0.00031356886,0.00063670793,0.00031900586,0.000103665,0.00029483406,0.0005050052,0.043216273,0.07184484,0.21956764,0.07528374,0.58770996],"study_design_scores_gemma":[0.0001425988,0.00018065087,0.0010522346,0.000109055305,0.00012498806,0.000631251,0.00007613723,0.46344668,0.058225267,0.1222446,0.35369036,0.000076214455],"about_ca_topic_score_codex":0.0010619779,"about_ca_topic_score_gemma":0.0017575426,"teacher_disagreement_score":0.0052302084,"about_ca_system_score_codex":0.00070546,"about_ca_system_score_gemma":0.000543356,"threshold_uncertainty_score":0.017496824},"labels":[],"label_agreement":null},{"id":"W1511791001","doi":"10.1007/11549468_7","title":"Fast Convex Closure for Efficient Predicate Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Predicate (mathematical logic); Algorithm; Closure (psychology); Regular polygon; Event (particle physics); Debugging; Theoretical computer science; Mathematics; Programming language","score_opus":0.011646446237777603,"score_gpt":0.2326366543931749,"score_spread":0.2209902081553973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511791001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028121,0.00018832817,0.99302775,0.00012555989,0.00008205125,0.00006171248,0.00016495284,0.0017953039,0.001742231],"genre_scores_gemma":[0.12935472,0.0003767573,0.8599411,0.00019475559,0.00020964982,0.0003143659,0.0012363584,0.0010833348,0.007288942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968087,0.0006599533,0.00019309195,0.00058395864,0.0013726198,0.00038166507],"domain_scores_gemma":[0.9941115,0.0035747567,0.00024375235,0.0011211935,0.00077579526,0.00017301863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022069982,0.001982183,0.002900862,0.0015994925,0.0009774333,0.0029333155,0.0022803294,0.0012591921,0.01086566],"category_scores_gemma":[0.009098187,0.0013101196,0.0017146841,0.0017184312,0.0016563998,0.004647688,0.0045205047,0.0045999666,0.0033578246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087830384,0.0002508795,0.00048705048,0.0004251354,0.00008038777,0.00021336148,0.00021267931,0.11825991,0.018752385,0.1856182,0.03499899,0.6398228],"study_design_scores_gemma":[0.00003772232,0.000056603876,0.00010194977,0.00002454315,0.00001071436,0.00009970272,0.000039776154,0.8796621,0.00804623,0.10739763,0.004500683,0.000022373937],"about_ca_topic_score_codex":0.0027675168,"about_ca_topic_score_gemma":0.0030224791,"teacher_disagreement_score":0.01086566,"about_ca_system_score_codex":0.001439707,"about_ca_system_score_gemma":0.0017974842,"threshold_uncertainty_score":0.036349237},"labels":[],"label_agreement":null},{"id":"W1517128672","doi":"10.1184/r1/6608174","title":"Optimistic Intra-Transaction Parallelism on Chip Multiprocessors","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Online transaction processing; Parallel computing; Database transaction; Programmer; Parallelism (grammar); Transaction processing; Multiprocessing; Parsec; Chip; Transaction processing system; Distributed transaction; Database; Operating system","score_opus":0.03104471969754954,"score_gpt":0.2618073208997221,"score_spread":0.23076260120217254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517128672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75509,0.0011067915,0.22479245,0.0006013752,0.00019833878,0.00008264033,0.00015296382,0.003058318,0.014917132],"genre_scores_gemma":[0.9699155,0.00011166159,0.02788776,0.00007727649,0.00002133248,0.000038842943,0.00007475037,0.00005236913,0.001820527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909353,0.00026194786,0.00004465938,0.00012463453,0.00027975487,0.00019545168],"domain_scores_gemma":[0.997439,0.0008749761,0.00016572005,0.00089812226,0.00046193736,0.00016014097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086521107,0.00042187417,0.00043789006,0.00036488476,0.0006636702,0.0009610641,0.0012616802,0.00042699068,0.0027971007],"category_scores_gemma":[0.0022182635,0.00042502963,0.0002245388,0.00062159984,0.0006570948,0.001409432,0.00087380176,0.00089639425,0.00046725565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025944056,0.0005100856,0.012097042,0.00027289224,0.00018151985,0.00092251675,0.00052817154,0.7346408,0.101349436,0.041977946,0.010870589,0.09405464],"study_design_scores_gemma":[0.00011481,0.00027684506,0.0009727369,0.0000102625545,0.00003905502,0.00011308621,0.00007115409,0.9589453,0.026578557,0.009252024,0.003602719,0.000023463188],"about_ca_topic_score_codex":0.0012028189,"about_ca_topic_score_gemma":0.002076549,"teacher_disagreement_score":0.0027971007,"about_ca_system_score_codex":0.0006358909,"about_ca_system_score_gemma":0.00082227745,"threshold_uncertainty_score":0.009357214},"labels":[],"label_agreement":null},{"id":"W1517862690","doi":"10.1109/spdp.1990.143633","title":"Fault tolerant distributed shared memory algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Fault tolerance; Distributed computing; Algorithm","score_opus":0.0232656275415867,"score_gpt":0.2288458561410511,"score_spread":0.2055802285994644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517862690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009832304,0.0014097712,0.97367823,0.00060871075,0.0002594069,0.00017590287,0.00015394199,0.002575959,0.011305791],"genre_scores_gemma":[0.418321,0.0015802133,0.5590005,0.0004629631,0.00023575433,0.00054049166,0.0007771843,0.00041542074,0.01866642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00027378186,0.00010790403,0.00018671207,0.0005531068,0.00020657924],"domain_scores_gemma":[0.99805117,0.0007236507,0.00013653844,0.000527974,0.0004532755,0.000107298285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114876,0.0008615469,0.0011967728,0.0010819115,0.0013475862,0.002542181,0.0029006868,0.0016060155,0.0078025586],"category_scores_gemma":[0.0066915327,0.00047988395,0.000639882,0.0015151716,0.0011186065,0.0030643477,0.002820556,0.0015384591,0.0023453003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003504607,0.00015399,0.00093300163,0.00037698867,0.00010583173,0.00019474013,0.00033838904,0.38943055,0.0033831373,0.25976384,0.02006519,0.32490394],"study_design_scores_gemma":[0.00015750335,0.00008298823,0.00010239766,0.000054145446,0.000039259787,0.00016265702,0.00010439535,0.72741956,0.0041201925,0.23919527,0.028535547,0.000026193993],"about_ca_topic_score_codex":0.0012655769,"about_ca_topic_score_gemma":0.0012460295,"teacher_disagreement_score":0.0078025586,"about_ca_system_score_codex":0.0011379946,"about_ca_system_score_gemma":0.0014183032,"threshold_uncertainty_score":0.026102126},"labels":[],"label_agreement":null},{"id":"W1517869332","doi":"","title":"Leader Election in Rings with Nonunique Labels.","year":2003,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Leader election; Upper and lower bounds; Ring (chemistry); Computer science; Node (physics); Combinatorics; Time complexity; Binary logarithm; Identifier; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Computer network","score_opus":0.009252120761576041,"score_gpt":0.2432098328081127,"score_spread":0.23395771204653665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517869332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08772923,0.0014381357,0.90080357,0.0011769724,0.0002098237,0.0001687303,0.00010424996,0.00052252994,0.007846798],"genre_scores_gemma":[0.60645103,0.0011666188,0.38033623,0.0002107822,0.0002898305,0.00031055213,0.00025066145,0.00008789592,0.010896406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983323,0.00071500463,0.000059919777,0.0003103747,0.0002725066,0.00030993336],"domain_scores_gemma":[0.9947149,0.0035745532,0.00071866007,0.00046124944,0.00027095678,0.00025961245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242355,0.00048930274,0.00090004056,0.00040935646,0.0015794255,0.0014265234,0.0015799995,0.0012179287,0.0021179595],"category_scores_gemma":[0.005653482,0.00041266458,0.00052576297,0.0006872686,0.0011116883,0.0040385304,0.0016397131,0.0011231697,0.0008535246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001478937,0.00035695583,0.0030792344,0.0008005651,0.00012408699,0.0011203405,0.0010763586,0.4563,0.022888292,0.3597689,0.010627328,0.14237903],"study_design_scores_gemma":[0.00027060538,0.00032839086,0.00049970415,0.000029088766,0.00005426087,0.00037016728,0.00031712084,0.78561115,0.009967062,0.18982425,0.012688161,0.000040060084],"about_ca_topic_score_codex":0.00045211948,"about_ca_topic_score_gemma":0.00061613537,"teacher_disagreement_score":0.00242355,"about_ca_system_score_codex":0.00055109884,"about_ca_system_score_gemma":0.00052182155,"threshold_uncertainty_score":0.012817144},"labels":[],"label_agreement":null},{"id":"W1518330464","doi":"","title":"Scalable database replication through dynamic multiversioning","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency control; Scalability; Eventual consistency; Distributed database; Database; Distributed computing; Serialization; Optimistic concurrency control; Timestamp-based concurrency control; Asynchronous communication; Parallel computing; Distributed concurrency control; Data consistency; Operating system; Consistency model; Computer network; Database transaction","score_opus":0.016745924858385598,"score_gpt":0.2786805545766656,"score_spread":0.26193462971827997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518330464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29475543,0.0011803231,0.6887339,0.00043415054,0.00020825685,0.00026720035,0.00013425815,0.0098842075,0.004402279],"genre_scores_gemma":[0.7856421,0.0001655655,0.21158734,0.000114351875,0.00009799894,0.00016744241,0.0002206226,0.0002328293,0.0017717053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998099,0.00031871337,0.00017193182,0.00052699214,0.0006519604,0.00023149331],"domain_scores_gemma":[0.99488115,0.00080559,0.00046789163,0.0028785435,0.0006344148,0.00033242334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015109234,0.0007044184,0.00075601233,0.0008263458,0.0007721555,0.0013633675,0.0037308356,0.0005416142,0.0012033357],"category_scores_gemma":[0.0042798035,0.0004654426,0.00039155397,0.0009796633,0.0009402757,0.0025463353,0.0028957247,0.0011473824,0.00048022237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010773772,0.0007331061,0.012005442,0.00025910867,0.00017740186,0.00036531154,0.0009320224,0.19879645,0.37121147,0.025325466,0.005790043,0.3833268],"study_design_scores_gemma":[0.00020445354,0.0005155858,0.0018480892,0.000021674083,0.00008714587,0.00041544368,0.00012664191,0.84658635,0.12448157,0.016035553,0.009588602,0.00008879596],"about_ca_topic_score_codex":0.0016318022,"about_ca_topic_score_gemma":0.0012386829,"teacher_disagreement_score":0.0037308356,"about_ca_system_score_codex":0.00088428275,"about_ca_system_score_gemma":0.0009755145,"threshold_uncertainty_score":0.007990599},"labels":[],"label_agreement":null},{"id":"W1518639337","doi":"10.47749/t/unicamp.2006.415450","title":"Arquiteturas de redes de armazenamento de dados","year":2006,"lang":"pt","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Smiths Detection (Canada)","funders":"","keywords":"Physics; Backup; Humanities; Computer science; Database; Art","score_opus":0.011578958838725886,"score_gpt":0.2769104752533951,"score_spread":0.26533151641466923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518639337","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10633924,0.002290244,0.85238856,0.0015427741,0.00059446826,0.0010283424,0.0019938978,0.016156508,0.017665911],"genre_scores_gemma":[0.37958163,0.0017219426,0.5952635,0.0005281626,0.00013669576,0.0008580307,0.0036688698,0.0018528398,0.016388439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933616,0.0018156912,0.00091199746,0.0012570929,0.0022600684,0.00039346414],"domain_scores_gemma":[0.9630087,0.012150841,0.0017725155,0.016725428,0.0056673447,0.0006751774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086683165,0.0011156736,0.000997849,0.0023675505,0.0015823133,0.0053531663,0.0025262032,0.0015662862,0.010594664],"category_scores_gemma":[0.034017973,0.0013169773,0.0014923427,0.002200488,0.0019349091,0.007940619,0.003135703,0.0029765747,0.0018866784],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033495354,0.00068984425,0.014883132,0.0027774593,0.00030285993,0.0011660033,0.008413936,0.035471134,0.07144091,0.11077978,0.014441442,0.73628396],"study_design_scores_gemma":[0.0006484964,0.0017164084,0.015430645,0.0015178075,0.00073434773,0.0027053508,0.0037863294,0.26290908,0.22807069,0.10414929,0.3778023,0.0005292389],"about_ca_topic_score_codex":0.004484251,"about_ca_topic_score_gemma":0.0044669844,"teacher_disagreement_score":0.010594664,"about_ca_system_score_codex":0.0019549746,"about_ca_system_score_gemma":0.0019271848,"threshold_uncertainty_score":0.045843005},"labels":[],"label_agreement":null},{"id":"W1520949886","doi":"10.1007/978-3-540-30075-5_51","title":"Characterizing Database User’s Access Patterns","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Database; Computer science","score_opus":0.027890663845458668,"score_gpt":0.27446015496738385,"score_spread":0.2465694911219252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520949886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933774,0.00032413087,0.06015665,0.0002190324,0.00002207167,0.00006897716,0.0016784879,0.0011117603,0.0026448902],"genre_scores_gemma":[0.9814218,0.00014551412,0.0152372625,0.000045515248,0.000033798005,0.000036811,0.0014330753,0.00011114188,0.0015351204],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973972,0.00035471848,0.00032714428,0.00048152378,0.0011454483,0.000293971],"domain_scores_gemma":[0.98447084,0.007663805,0.0017316443,0.002644169,0.0027878361,0.0007017775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011521758,0.00036234592,0.00061410165,0.004093449,0.0005268762,0.0018377386,0.00086931855,0.0007791154,0.0014350243],"category_scores_gemma":[0.0129799135,0.00040460643,0.0004086654,0.0035457704,0.0004124614,0.003079826,0.0007581059,0.00065881736,0.0006360448],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014612188,0.0007288296,0.64261943,0.00020317303,0.00021357878,0.0005358441,0.000858862,0.011215023,0.043548636,0.0072152107,0.0043611247,0.28703913],"study_design_scores_gemma":[0.00006165498,0.0006955757,0.27752632,0.00005201797,0.000234979,0.005926091,0.0010044524,0.62176204,0.06086075,0.022811221,0.008957449,0.000107452855],"about_ca_topic_score_codex":0.0022016817,"about_ca_topic_score_gemma":0.003454899,"teacher_disagreement_score":0.004093449,"about_ca_system_score_codex":0.0004741141,"about_ca_system_score_gemma":0.0006351804,"threshold_uncertainty_score":0.006093323},"labels":[],"label_agreement":null},{"id":"W1523988964","doi":"10.1007/978-3-540-76848-7_12","title":"Acquaintance Based Consistency in an Instance-Mapped P2P Data Sharing System During Transaction Processing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Distributed transaction; Database transaction; Transaction processing; Consistency (knowledge bases); Distributed computing; Data consistency; Compensating transaction; Atomicity; Peer-to-peer; Database; Rollback; Semantics (computer science); Data sharing; Programming language","score_opus":0.04947759509804384,"score_gpt":0.28548041638453703,"score_spread":0.2360028212864932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523988964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33044988,0.0005971676,0.65761846,0.0005332719,0.00014969299,0.00026994664,0.00017802439,0.0039849197,0.0062186928],"genre_scores_gemma":[0.86914366,0.000114273775,0.12672126,0.0000792661,0.000042033844,0.00008642619,0.00018777921,0.00020764105,0.0034176973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00077131484,0.00021774531,0.00046749538,0.0008620483,0.00031214798],"domain_scores_gemma":[0.9949904,0.0017770398,0.00021838376,0.0019837797,0.0007780897,0.00025233446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025311632,0.00036274668,0.0009830652,0.00057755917,0.0017902394,0.0029021988,0.0031910844,0.0011172822,0.002335226],"category_scores_gemma":[0.006901916,0.0008760773,0.0004590352,0.0014051414,0.0008967966,0.0031299356,0.002147737,0.0017001801,0.00044938785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00419633,0.0011911663,0.018183215,0.00045051804,0.00028993937,0.0024623987,0.0040057856,0.32906857,0.08598598,0.09575923,0.011054226,0.44735274],"study_design_scores_gemma":[0.00008385812,0.00021774718,0.0012658027,0.000012021638,0.00007851969,0.0003761356,0.00026280858,0.9490924,0.02137593,0.02428183,0.0029141863,0.000038809136],"about_ca_topic_score_codex":0.006117598,"about_ca_topic_score_gemma":0.0056546,"teacher_disagreement_score":0.006117598,"about_ca_system_score_codex":0.00071669905,"about_ca_system_score_gemma":0.0018637272,"threshold_uncertainty_score":0.01338619},"labels":[],"label_agreement":null},{"id":"W1536395354","doi":"10.1007/3-540-40026-5_24","title":"Short Headers Suffice for Communication in a DAG with Link Failures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queue; Directed acyclic graph; Link (geometry); Computer network; Enhanced Data Rates for GSM Evolution; Graph; Telecommunications network; Theoretical computer science; Distributed computing; Parallel computing; Algorithm; Telecommunications","score_opus":0.018298761677425807,"score_gpt":0.25196729811038265,"score_spread":0.23366853643295685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536395354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03730184,0.002272498,0.78731054,0.0055474457,0.023579286,0.0014873552,0.022669876,0.040386193,0.079445004],"genre_scores_gemma":[0.29635474,0.002952427,0.4712228,0.005900404,0.0056981174,0.0026989286,0.035040848,0.027379515,0.15275224],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988017,0.0002381882,0.00024699979,0.00023063434,0.00019425582,0.00028833994],"domain_scores_gemma":[0.9824425,0.007398204,0.0014283789,0.0052261227,0.0027965272,0.0007083451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102354,0.0020713443,0.001223873,0.0014582416,0.0019878906,0.0026435242,0.0011404847,0.002515302,0.053982075],"category_scores_gemma":[0.013859405,0.0012580401,0.0007714034,0.0022997698,0.0012682605,0.006521588,0.00255866,0.0034582927,0.027125534],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002729826,0.00046935378,0.00148076,0.0021801337,0.00008576939,0.0016692717,0.0010323218,0.0129404785,0.036877107,0.25013435,0.31115952,0.3792411],"study_design_scores_gemma":[0.00018844784,0.00047646833,0.00065315445,0.00043641476,0.000128486,0.0007716354,0.00040339504,0.013034008,0.033599272,0.19559714,0.7545989,0.00011271736],"about_ca_topic_score_codex":0.0004985126,"about_ca_topic_score_gemma":0.0005965002,"teacher_disagreement_score":0.053982075,"about_ca_system_score_codex":0.0005642255,"about_ca_system_score_gemma":0.0010418136,"threshold_uncertainty_score":0.18058807},"labels":[],"label_agreement":null},{"id":"W1538876986","doi":"10.4271/2000-01-0746","title":"New Developments for Surviving Aggressive Environments with HNBR","year":2000,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bayer Canada","keywords":"Computer science","score_opus":0.009888090918189324,"score_gpt":0.22855172747359545,"score_spread":0.21866363655540613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538876986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09086544,0.08392325,0.5424835,0.012681507,0.004486225,0.0005249054,0.00040678302,0.011005517,0.25362292],"genre_scores_gemma":[0.28460082,0.044466946,0.41109914,0.0029515766,0.0021979548,0.000420577,0.0011014068,0.0011379699,0.2520236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937016,0.00008407044,0.00002415843,0.00010440438,0.00033043636,0.00008671506],"domain_scores_gemma":[0.99941134,0.00008071964,0.000053460757,0.000111887646,0.00023839675,0.00010422523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097230775,0.0006673065,0.000455748,0.0007441442,0.000690149,0.0012591897,0.0016271431,0.0010430331,0.015262031],"category_scores_gemma":[0.00083143666,0.0003243966,0.00046441174,0.00040543385,0.0006937244,0.0025034654,0.0013309531,0.001123748,0.007570528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027396352,0.00032864904,0.0010713342,0.0010027699,0.000035657657,0.0004874947,0.0008862305,0.0041361796,0.19363122,0.04926123,0.028159464,0.7207259],"study_design_scores_gemma":[0.00005770199,0.0009007167,0.0012541866,0.0001884301,0.000050339277,0.0014588987,0.0005546551,0.011267116,0.05717493,0.009592593,0.9174344,0.00006589523],"about_ca_topic_score_codex":0.0011735936,"about_ca_topic_score_gemma":0.002041792,"teacher_disagreement_score":0.015262031,"about_ca_system_score_codex":0.0004510201,"about_ca_system_score_gemma":0.0005302815,"threshold_uncertainty_score":0.051056623},"labels":[],"label_agreement":null},{"id":"W1544328073","doi":"10.1007/3-540-44472-6_29","title":"Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computation; Database transaction; Distributed computing; Concurrency control; Cache; State (computer science); Concurrency; Parallel computing; Database; Algorithm","score_opus":0.010775949276477044,"score_gpt":0.23718565007381281,"score_spread":0.22640970079733577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544328073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10709699,0.0014355489,0.87786126,0.00028428895,0.00018799692,0.0000998846,0.00006270034,0.004479364,0.008491981],"genre_scores_gemma":[0.8698292,0.00030244797,0.12484204,0.00007499739,0.000068829286,0.000070729,0.00008468206,0.00036688914,0.0043602064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987043,0.00019794851,0.00010453251,0.00017222618,0.0005433481,0.00027757708],"domain_scores_gemma":[0.99731785,0.0007881663,0.00017686891,0.0011217844,0.0003784642,0.00021690819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776354,0.0005452374,0.0006806906,0.0004668886,0.00083890295,0.0023791704,0.0021698847,0.0006398735,0.002181976],"category_scores_gemma":[0.004358488,0.00090314855,0.0003583379,0.0005526672,0.0009101749,0.0027519176,0.0026248954,0.001501441,0.00068526046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002314452,0.00044617415,0.005074418,0.00027727798,0.00014251901,0.00057467166,0.001728436,0.16667068,0.107482105,0.093755454,0.0051048105,0.61642903],"study_design_scores_gemma":[0.0002108569,0.0003461354,0.0012627295,0.00008081025,0.00014173244,0.00037855736,0.00032719743,0.85219914,0.0549749,0.07017867,0.019780789,0.00011852979],"about_ca_topic_score_codex":0.0014659342,"about_ca_topic_score_gemma":0.0028256476,"teacher_disagreement_score":0.0023791704,"about_ca_system_score_codex":0.00041065863,"about_ca_system_score_gemma":0.00083669205,"threshold_uncertainty_score":0.009930015},"labels":[],"label_agreement":null},{"id":"W1545979834","doi":"10.2172/1001015","title":"Increasing fault resiliency in a message-passing environment.","year":2009,"lang":"en","type":"report","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Bundle; Distributed computing; Timeout; Downtime; Rework; Computation; Node (physics); Redundancy (engineering); Fault tolerance; Computer network; Serviceability (structure); Embedded system; Operating system","score_opus":0.0205379983910259,"score_gpt":0.26989390958061255,"score_spread":0.24935591118958664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545979834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44209552,0.0022256402,0.46830088,0.0028895729,0.00040054304,0.00025364698,0.0005557045,0.055815488,0.027463071],"genre_scores_gemma":[0.7847498,0.0010589459,0.1911106,0.00029109503,0.00014116631,0.00019585867,0.0010904458,0.001500257,0.019861894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992387,0.00018470196,0.000025191855,0.00006475189,0.00033221123,0.00015452645],"domain_scores_gemma":[0.9978739,0.0007494488,0.00026470478,0.0005297328,0.00035447735,0.0002277971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685052,0.0006619889,0.0003450495,0.0008885027,0.0008119773,0.00109514,0.00091365125,0.00053145696,0.006087046],"category_scores_gemma":[0.00527929,0.00028665943,0.0003687724,0.00080066745,0.00058917346,0.002430612,0.0011532595,0.0008606517,0.002539049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010012581,0.00090377074,0.01487677,0.0009977637,0.00017470974,0.00078268524,0.0011016132,0.10212652,0.20647492,0.050825287,0.060203068,0.5605316],"study_design_scores_gemma":[0.00021366957,0.001153758,0.0119770365,0.00012676416,0.00023525047,0.0015635666,0.0003170436,0.43760806,0.34682506,0.035059422,0.16477083,0.00014951063],"about_ca_topic_score_codex":0.0011080644,"about_ca_topic_score_gemma":0.0016369466,"teacher_disagreement_score":0.006087046,"about_ca_system_score_codex":0.00047508517,"about_ca_system_score_gemma":0.0006984783,"threshold_uncertainty_score":0.020363152},"labels":[],"label_agreement":null},{"id":"W1546134733","doi":"10.1007/11890393_22","title":"Association-Rules Mining Based Broadcasting Approach for XML Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Broadcasting (networking); XML; Association rule learning; Software portability; Flexibility (engineering); Mobile device; XML database; Scalability; Database; Data mining; World Wide Web; Computer network; Programming language","score_opus":0.03879452689165791,"score_gpt":0.26191958306383156,"score_spread":0.22312505617217365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546134733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021721989,0.00067849597,0.9702593,0.0003499553,0.00009554581,0.00023508604,0.00094260497,0.0037035581,0.0020133937],"genre_scores_gemma":[0.114565745,0.0007553616,0.87504375,0.00019054307,0.00012397845,0.0002652828,0.0028835244,0.00025368854,0.005918064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814093,0.00034186943,0.00019706142,0.0003429563,0.00087949925,0.00009764183],"domain_scores_gemma":[0.99550974,0.0025466203,0.00019469543,0.0008321717,0.00079657853,0.000120223456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257132,0.00053736725,0.001294007,0.003732988,0.0012244974,0.0015889223,0.0024745527,0.0009695783,0.0033726303],"category_scores_gemma":[0.0059197024,0.0005234984,0.0013111064,0.0049352706,0.0005139141,0.0021876008,0.0011335673,0.0014679589,0.0014867788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004465748,0.00053310534,0.003485203,0.00039269455,0.00028472417,0.0005605415,0.0003967915,0.02407674,0.020421274,0.015238645,0.010092,0.92407155],"study_design_scores_gemma":[0.0001451134,0.00028360335,0.002967868,0.00008912698,0.00048447313,0.0013046352,0.00046956094,0.87146276,0.034983702,0.059981305,0.02774782,0.00008003705],"about_ca_topic_score_codex":0.0047207344,"about_ca_topic_score_gemma":0.007618149,"teacher_disagreement_score":0.0047207344,"about_ca_system_score_codex":0.0006079192,"about_ca_system_score_gemma":0.0019045451,"threshold_uncertainty_score":0.011937022},"labels":[],"label_agreement":null},{"id":"W1558322003","doi":"10.1007/978-3-540-30566-8_18","title":"A Fault-Tolerant Multi-agent Development Framework","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"JADE (particle detector); Fault tolerance; Computer science; Protocol (science); Distributed computing; Software fault tolerance; Embedded system","score_opus":0.021880487145487654,"score_gpt":0.25589391400805633,"score_spread":0.23401342686256868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558322003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026378306,0.00023463108,0.9900809,0.00017545809,0.00003774099,0.00009561477,0.000046582656,0.0031689126,0.0035222515],"genre_scores_gemma":[0.08275557,0.00050955726,0.90910655,0.00011035492,0.000030225483,0.00027550568,0.00023955942,0.00039777096,0.006574899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928844,0.00016635779,0.000063140185,0.000113696675,0.00028549207,0.000082801416],"domain_scores_gemma":[0.9993343,0.00024191257,0.00005913263,0.0001485401,0.00011502626,0.00010106714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015914509,0.0007266163,0.00066822994,0.00067301927,0.001090711,0.002170368,0.0030171503,0.0013610207,0.0036140673],"category_scores_gemma":[0.0019982564,0.00076149957,0.00083621265,0.0005303101,0.0009084243,0.0020878033,0.0023263774,0.0016562429,0.0012408025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025425176,0.00031480734,0.00096167484,0.00057931815,0.00013461107,0.00088606845,0.0007553229,0.22057727,0.020375086,0.39383647,0.015557689,0.3457675],"study_design_scores_gemma":[0.0001396274,0.00011677715,0.00020869522,0.00009344605,0.00010057129,0.00056947634,0.00007299523,0.75450677,0.01482135,0.13698046,0.09232962,0.000060184924],"about_ca_topic_score_codex":0.0023748407,"about_ca_topic_score_gemma":0.0029605662,"teacher_disagreement_score":0.0036140673,"about_ca_system_score_codex":0.00067575136,"about_ca_system_score_gemma":0.0016361759,"threshold_uncertainty_score":0.012090266},"labels":[],"label_agreement":null},{"id":"W1559493324","doi":"10.1007/978-3-540-39724-3_21","title":"On the Correctness of an Intrusion-Tolerant Group Communication Protocol","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Intrusion tolerance; Correctness; Byzantine fault tolerance; Computer science; Fault tolerance; Robustness (evolution); Quantum Byzantine agreement; Intrusion; Distributed computing; Protocol (science); Theoretical computer science; Computer security; Algorithm; Intrusion detection system","score_opus":0.016371806604547744,"score_gpt":0.2594534385205328,"score_spread":0.24308163191598509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559493324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047637634,0.0012687725,0.90666455,0.0048440224,0.0009585755,0.0002627494,0.0001801517,0.0013951848,0.036788363],"genre_scores_gemma":[0.82527447,0.0020208245,0.15581055,0.0010810918,0.0008843408,0.00053017325,0.0005321173,0.00060681213,0.013259585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931786,0.0018100945,0.00047537094,0.00054235064,0.0033419007,0.00065171666],"domain_scores_gemma":[0.97925997,0.013400905,0.000881866,0.003713062,0.0024019945,0.00034230054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410686,0.0009648974,0.0015048254,0.0010862486,0.0022241974,0.004147723,0.0030154726,0.0029878644,0.0032204234],"category_scores_gemma":[0.026960036,0.0011592568,0.0009920468,0.0015067324,0.0067461687,0.008965117,0.0050193896,0.0053517194,0.0011122015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005053005,0.00007499559,0.00077988696,0.0002436977,0.000054291115,0.00036444448,0.0008422397,0.04780936,0.004445584,0.89670545,0.0058719637,0.042302743],"study_design_scores_gemma":[0.00020972414,0.00013342554,0.0002356681,0.000087728535,0.0000776942,0.0002303635,0.00013937795,0.15163723,0.0055705323,0.8286699,0.012966897,0.000041465013],"about_ca_topic_score_codex":0.0017667734,"about_ca_topic_score_gemma":0.000827566,"teacher_disagreement_score":0.005410686,"about_ca_system_score_codex":0.0014431896,"about_ca_system_score_gemma":0.0018365434,"threshold_uncertainty_score":0.02861476},"labels":[],"label_agreement":null},{"id":"W1563147155","doi":"10.1007/978-3-642-16023-3_4","title":"Systematic Correct Construction of Self-stabilizing Systems: A Case Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Atomicity; Computer science; Distributed computing; Scheduling (production processes); Synchronization (alternating current); Self-stabilization; Set (abstract data type); Component (thermodynamics); Theoretical computer science; Algorithm; Distributed algorithm; Mathematical optimization; Programming language; Mathematics","score_opus":0.012459667894372297,"score_gpt":0.24065144332217722,"score_spread":0.22819177542780492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563147155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46354678,0.00022860743,0.51632684,0.00045744824,0.000032866865,0.00033105488,0.00013974658,0.000980187,0.017956482],"genre_scores_gemma":[0.8890859,0.000114026705,0.10757621,0.000028000984,0.000007687116,0.00011018317,0.000083909,0.00009596308,0.002898131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.9984738,0.000656287,0.000069037305,0.00009014644,0.00055139617,0.00015918902],"domain_scores_gemma":[0.9929503,0.004062493,0.00027139182,0.0017538315,0.0008441533,0.000117798176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018863094,0.00035584398,0.00042333436,0.0005294391,0.0011156587,0.00091399427,0.00070752774,0.0016133339,0.0018567035],"category_scores_gemma":[0.008536434,0.00026573476,0.0006426892,0.0006952878,0.0016192002,0.0008067991,0.001172459,0.0008356491,0.00024450867],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005773774,0.00068041775,0.011474613,0.0007095842,0.000094855335,0.006653069,0.0036078403,0.40640867,0.02267996,0.3492415,0.0037870666,0.19408517],"study_design_scores_gemma":[0.00032275522,0.00083318574,0.002383517,0.00008134182,0.00012859429,0.001949836,0.0009940461,0.7667521,0.04649287,0.1660382,0.013972963,0.000050521652],"about_ca_topic_score_codex":0.0017560851,"about_ca_topic_score_gemma":0.0025991066,"teacher_disagreement_score":0.0018863094,"about_ca_system_score_codex":0.00045655936,"about_ca_system_score_gemma":0.0012114698,"threshold_uncertainty_score":0.009975851},"labels":[],"label_agreement":null},{"id":"W1564201006","doi":"10.1007/978-3-642-02138-1_5","title":"On Model-Checking Optimistic Replication Algorithms","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Convergence (economics); Exploit; Model checking; Counterexample; Collaborative editing; Replication (statistics); Algorithm; Property (philosophy); Theoretical computer science; Distributed computing; Computer security; World Wide Web","score_opus":0.02399841025047516,"score_gpt":0.2661182656709419,"score_spread":0.2421198554204667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564201006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017336057,0.0006642812,0.9682548,0.0010172311,0.00026943587,0.0001824858,0.00018707433,0.0038482184,0.008240343],"genre_scores_gemma":[0.5488449,0.0009066702,0.43637103,0.0010550882,0.00051097566,0.00045853652,0.0010475395,0.0019217707,0.008883535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98880285,0.004079986,0.00064841047,0.0013745117,0.0040241894,0.0010699396],"domain_scores_gemma":[0.9512408,0.034240272,0.0014004558,0.0103006475,0.0022940973,0.00052375125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008821981,0.0023085987,0.0025151812,0.0019473102,0.0023579167,0.004786909,0.0076484755,0.0029410154,0.008481577],"category_scores_gemma":[0.043477148,0.0025471044,0.0034827674,0.0033168287,0.005341125,0.014095326,0.0077725486,0.0074020186,0.0013959063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012094154,0.0003471552,0.0016819822,0.00042434596,0.00025193702,0.00019753803,0.00043435165,0.39598945,0.004197825,0.4459903,0.009242329,0.14003335],"study_design_scores_gemma":[0.000101960846,0.000056970566,0.00010950137,0.00006087449,0.00006666609,0.000055829398,0.000044430875,0.48933512,0.0024538166,0.505612,0.0020684747,0.000034416396],"about_ca_topic_score_codex":0.0070677195,"about_ca_topic_score_gemma":0.007850784,"teacher_disagreement_score":0.008821981,"about_ca_system_score_codex":0.003857078,"about_ca_system_score_gemma":0.0038966693,"threshold_uncertainty_score":0.046655655},"labels":[],"label_agreement":null},{"id":"W1568228276","doi":"10.1007/978-3-642-12133-3_7","title":"Application-Specific Signatures for Transactional Memory in Soft Processors","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transactional memory; Field-programmable gate array; Scalability; Overhead (engineering); Signature (topology); Throughput; Synchronization (alternating current); Network packet; Embedded system; Parallel computing; Computer hardware; Computer network; Operating system; Channel (broadcasting); Database transaction","score_opus":0.0110799913782468,"score_gpt":0.2366334224644085,"score_spread":0.2255534310861617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568228276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032955233,0.0020138365,0.9416964,0.00043798436,0.000561982,0.00017415234,0.00029452727,0.005043273,0.016822634],"genre_scores_gemma":[0.55733544,0.0018023376,0.40535685,0.0005788866,0.00038586516,0.00037299635,0.0010342766,0.0016729767,0.03146029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840933,0.00035612364,0.00021812813,0.00016558918,0.00064550387,0.00020531108],"domain_scores_gemma":[0.99623704,0.000889142,0.00026649926,0.0019938042,0.00048274183,0.0001306901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013735214,0.0006009907,0.00093759823,0.00077877473,0.00090024254,0.0032543144,0.002177135,0.0013743732,0.004372021],"category_scores_gemma":[0.0048897006,0.00066493417,0.00051511417,0.0017184232,0.0013399777,0.004774776,0.0023192733,0.0032053066,0.0023349149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006393903,0.0001721193,0.000804906,0.00070912356,0.000049659026,0.00029757633,0.00080748816,0.01755526,0.02888704,0.5550114,0.013734953,0.38133106],"study_design_scores_gemma":[0.00009608109,0.00026872914,0.0004181253,0.00021774795,0.00009121272,0.0010159293,0.00035471725,0.16404432,0.106488906,0.60318476,0.12370781,0.000111674126],"about_ca_topic_score_codex":0.00016304907,"about_ca_topic_score_gemma":0.00031963483,"teacher_disagreement_score":0.004372021,"about_ca_system_score_codex":0.0006963295,"about_ca_system_score_gemma":0.0011546083,"threshold_uncertainty_score":0.014625907},"labels":[],"label_agreement":null},{"id":"W1569436757","doi":"10.1007/3-540-44681-8_8","title":"Self-Organizing Hierarchical Cluster Timestamps","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Scalability; Locality; Cluster (spacecraft); Data mining; Theoretical computer science; Distributed computing; Algorithm; Database; Real-time computing","score_opus":0.010887172364410783,"score_gpt":0.22895458117689022,"score_spread":0.21806740881247944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569436757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032096844,0.0008647135,0.9539472,0.00021861651,0.00033022612,0.00013873178,0.00036810408,0.0031476829,0.008887864],"genre_scores_gemma":[0.6075442,0.0009585157,0.37585548,0.00011424928,0.00031631635,0.00017871363,0.0011531684,0.00042194524,0.01345731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918014,0.00014123469,0.00007946656,0.00014938995,0.00036452516,0.00008530886],"domain_scores_gemma":[0.9961081,0.0007278843,0.00036333717,0.0016224427,0.0009233695,0.00025483343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012571537,0.0003485104,0.0006292408,0.0016625222,0.0009985104,0.0016261014,0.0017197267,0.000481593,0.0033079172],"category_scores_gemma":[0.005137135,0.00045702024,0.00023503003,0.0025329262,0.0005519768,0.0024735546,0.0016284775,0.0007823164,0.0011927714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010677977,0.00017837594,0.0033274726,0.0004021447,0.00008774677,0.00018701484,0.0006909082,0.1233843,0.03285426,0.21593206,0.01913047,0.60275745],"study_design_scores_gemma":[0.00014203029,0.000316185,0.0019775317,0.00008550998,0.00011097995,0.00044277057,0.00032365735,0.7539304,0.045099646,0.12234733,0.075121574,0.00010241419],"about_ca_topic_score_codex":0.00096624455,"about_ca_topic_score_gemma":0.0015108731,"teacher_disagreement_score":0.0033079172,"about_ca_system_score_codex":0.0007459945,"about_ca_system_score_gemma":0.001056926,"threshold_uncertainty_score":0.011066079},"labels":[],"label_agreement":null},{"id":"W1577536172","doi":"10.1109/hpcsim.2015.7237083","title":"Identifying patterns towards Algorithm Based Fault Tolerance","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fault tolerance; Computer science; Overhead (engineering); Transparency (behavior); Distributed computing; File Transfer Protocol; Parallel computing; Software fault tolerance; Algorithm; Operating system; The Internet; Computer security","score_opus":0.045172427792662166,"score_gpt":0.2834508006956996,"score_spread":0.23827837290303744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577536172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034106784,0.00020123567,0.9614964,0.0005474056,0.000040059724,0.00011838882,0.000045007982,0.0006871953,0.0027574995],"genre_scores_gemma":[0.28363267,0.00034234373,0.7131265,0.00020035324,0.000034312965,0.00024974954,0.00019135552,0.00019484572,0.0020278387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819916,0.00043215463,0.00019006617,0.00031395035,0.0006711476,0.0001936176],"domain_scores_gemma":[0.99670035,0.0007044531,0.0004977696,0.0013855658,0.00060342246,0.00010845637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013604707,0.0007307589,0.0006121236,0.0010645904,0.000609602,0.0016964799,0.0013514927,0.0013918332,0.0014346391],"category_scores_gemma":[0.006087156,0.00045101476,0.00059278455,0.0013820662,0.0017015241,0.0026400227,0.0020019028,0.0017312065,0.0005743289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003601577,0.0004017861,0.011351708,0.0008068739,0.00009707421,0.0005021419,0.00079849706,0.12504956,0.043704722,0.31072664,0.005116769,0.501084],"study_design_scores_gemma":[0.000079725534,0.00034205883,0.001347196,0.00012051315,0.00005543723,0.0008556859,0.00040273392,0.5836218,0.034951862,0.35778144,0.020399543,0.000041911164],"about_ca_topic_score_codex":0.0005413773,"about_ca_topic_score_gemma":0.00050784345,"teacher_disagreement_score":0.0016964799,"about_ca_system_score_codex":0.00058881333,"about_ca_system_score_gemma":0.0014002569,"threshold_uncertainty_score":0.007194996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010645526194863385,"score_gpt":0.23267844186754535,"score_spread":0.22203291567268196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580076017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114224434,0.008549692,0.6905624,0.020883376,0.0020590092,0.00012971427,0.00032270627,0.0005053517,0.16276328],"genre_scores_gemma":[0.9309105,0.0017793247,0.056253683,0.0008019096,0.00071553286,0.0001913736,0.0001505087,0.000093366034,0.009103672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747294,0.0010338828,0.00020619448,0.00046712992,0.00064874085,0.000171034],"domain_scores_gemma":[0.9927751,0.0035926686,0.00065796595,0.0012513632,0.0011072749,0.000615567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035231388,0.00037158767,0.00058812683,0.0016091649,0.0017482267,0.005326472,0.0011618254,0.002424701,0.002961018],"category_scores_gemma":[0.014711131,0.00047646815,0.00049729407,0.0015937999,0.008091812,0.012535414,0.002992391,0.002886368,0.0005101288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030401876,0.000012096666,0.00035441466,0.000030023339,0.0000050822,0.000024300101,0.0005986657,0.000581457,0.00018850413,0.9886227,0.00068561797,0.008866782],"study_design_scores_gemma":[0.00001791086,0.000010836469,0.00010225764,0.000007617452,0.0000057062966,0.000035502926,0.0001955917,0.0016115202,0.000075164426,0.9931855,0.0047460664,0.0000062358354],"about_ca_topic_score_codex":0.00093422976,"about_ca_topic_score_gemma":0.00073779194,"teacher_disagreement_score":0.005326472,"about_ca_system_score_codex":0.00074010494,"about_ca_system_score_gemma":0.0010665008,"threshold_uncertainty_score":0.018632352},"labels":[],"label_agreement":null},{"id":"W1582180905","doi":"10.1007/978-3-642-15769-1_16","title":"Compositional Bitvector Analysis for Concurrent Programs with Nested Locks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reachability; Synchronization (alternating current); Parallel computing; Algorithm; Concurrent data structure; Concurrency; Nested loop join; Data-flow analysis; Data flow diagram; Theoretical computer science; Distributed computing; Database","score_opus":0.015812295680514437,"score_gpt":0.24675884321214553,"score_spread":0.2309465475316311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582180905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016601453,0.00014099987,0.9788392,0.00009496013,0.000041808467,0.000048235426,0.00006587464,0.0010481809,0.0031192817],"genre_scores_gemma":[0.4859473,0.0004030205,0.5009245,0.0002150548,0.00014091725,0.0002250927,0.0004938749,0.0013914162,0.010258697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980312,0.00037710907,0.0001294915,0.00022300461,0.0009458107,0.00029342432],"domain_scores_gemma":[0.9973604,0.0012337269,0.00018758324,0.0006194667,0.0005146409,0.00008407911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031008,0.0008058513,0.00083832716,0.001552717,0.0009012114,0.0022682382,0.002007158,0.0007727304,0.0055640615],"category_scores_gemma":[0.0054112454,0.000660118,0.0014893487,0.0016699551,0.002131576,0.005218115,0.0027249698,0.0019101513,0.0010384416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002705458,0.00008387338,0.0010668574,0.00024848303,0.00004495614,0.00014985923,0.00049267913,0.030061916,0.015466187,0.85321385,0.002050479,0.09685034],"study_design_scores_gemma":[0.000028263421,0.000038248796,0.00020403259,0.000045761495,0.000050863924,0.0000878296,0.0000962393,0.24670248,0.014266778,0.733443,0.0050026528,0.000033788518],"about_ca_topic_score_codex":0.0016858132,"about_ca_topic_score_gemma":0.002456858,"teacher_disagreement_score":0.0055640615,"about_ca_system_score_codex":0.0011333935,"about_ca_system_score_gemma":0.0014326308,"threshold_uncertainty_score":0.018613636},"labels":[],"label_agreement":null},{"id":"W1583435469","doi":"10.1109/mwscas.1994.519225","title":"On concurrent error detection of finite state machine systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Finite-state machine; Computer science; Key (lock); Sequence (biology); State (computer science); Bounded function; Algorithm; Error detection and correction; Fault detection and isolation; Signature (topology); Mathematics; Artificial intelligence","score_opus":0.02326949391678227,"score_gpt":0.2334544530415316,"score_spread":0.21018495912474933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583435469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018279718,0.0009774854,0.9772195,0.0003056615,0.00016732009,0.00010430639,0.000028933031,0.00078253966,0.0021344484],"genre_scores_gemma":[0.7426336,0.0014899657,0.25145477,0.00031665526,0.00053399795,0.00028947365,0.00014093835,0.00018186567,0.0029587485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98956597,0.0028040279,0.0006984474,0.0013299393,0.0049429736,0.0006586233],"domain_scores_gemma":[0.9663933,0.022150988,0.0021672754,0.004601397,0.0043295478,0.00035742726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059490497,0.0011367011,0.0012714948,0.0019170135,0.0007603108,0.00265695,0.0023403831,0.001362204,0.0014403969],"category_scores_gemma":[0.034973595,0.00060548104,0.00068663264,0.0019631446,0.0030950676,0.0052856645,0.0030158611,0.0027010285,0.00032100445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011820353,0.00025116294,0.0044797403,0.0007052303,0.00018960964,0.0013289435,0.0015371282,0.29595473,0.020659078,0.3347011,0.0022035823,0.33680764],"study_design_scores_gemma":[0.00008673384,0.00017588385,0.00027293066,0.000100610516,0.000051163057,0.0003744728,0.00006016558,0.8294613,0.014097182,0.15033728,0.004934088,0.000048163685],"about_ca_topic_score_codex":0.0019557916,"about_ca_topic_score_gemma":0.00093148643,"teacher_disagreement_score":0.0059490497,"about_ca_system_score_codex":0.0011944489,"about_ca_system_score_gemma":0.0012735595,"threshold_uncertainty_score":0.031461954},"labels":[],"label_agreement":null},{"id":"W1588132789","doi":"10.1007/3-540-38093-0_15","title":"Building Test Constraints for Testing Middleware-Based Distributed Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Constraint (computer-aided design); Test harness; System under test; Middleware (distributed applications); Test case; Test (biology); Test Management Approach; Distributed computing; Model-based testing; Programming language; Software; Software development; Machine learning","score_opus":0.03461666272034649,"score_gpt":0.24977118570043283,"score_spread":0.21515452298008633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588132789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017749228,0.00028118852,0.9749894,0.0002826309,0.0000551637,0.00027893405,0.00045743567,0.0029486974,0.0029573063],"genre_scores_gemma":[0.25367314,0.0003307887,0.74051136,0.00027238938,0.000099603254,0.00061864563,0.002105377,0.0009850928,0.0014036489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98976713,0.0035632052,0.0010651485,0.0012228775,0.003306594,0.0010751942],"domain_scores_gemma":[0.95747185,0.03335495,0.0020071133,0.0028022574,0.0035344756,0.0008293951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006187909,0.0023225911,0.0021798841,0.00336278,0.0010560357,0.0034160013,0.005715335,0.0022283134,0.005004803],"category_scores_gemma":[0.03567148,0.0021314593,0.0022664939,0.002356669,0.0028204084,0.006614723,0.0046105417,0.0038405163,0.0010064658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005206436,0.00051467115,0.004908767,0.0010569545,0.00024969058,0.0012621962,0.0006322792,0.5705659,0.01554689,0.16923374,0.0103831375,0.22512513],"study_design_scores_gemma":[0.00010870264,0.00010230442,0.00034950272,0.00012817906,0.0000702601,0.00018251722,0.00011881958,0.8565694,0.01089187,0.12705018,0.0043788096,0.000049415587],"about_ca_topic_score_codex":0.01008305,"about_ca_topic_score_gemma":0.011072102,"teacher_disagreement_score":0.01008305,"about_ca_system_score_codex":0.0019747778,"about_ca_system_score_gemma":0.0028362873,"threshold_uncertainty_score":0.032725215},"labels":[],"label_agreement":null},{"id":"W1589264773","doi":"10.1007/978-3-642-35551-6_4","title":"Abstracting Context in Event-Based Software","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Event (particle physics); Ubiquitous computing; Software deployment; Context (archaeology); Communications protocol; Software system; Software; Mobile device; Distributed computing; Software engineering; Human–computer interaction; Computer network; Operating system","score_opus":0.01853502410088839,"score_gpt":0.25120466252222323,"score_spread":0.23266963842133484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589264773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041559,0.002781722,0.9741088,0.00031352564,0.000239057,0.000037804617,0.00004209606,0.0007186494,0.011716771],"genre_scores_gemma":[0.50557536,0.0066607725,0.46278203,0.0002946907,0.0005665234,0.00017190976,0.00032815483,0.00040383215,0.023216773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991708,0.00023127117,0.00009202088,0.00016507572,0.0002602085,0.00008053907],"domain_scores_gemma":[0.9987735,0.00074281904,0.000064565706,0.00025534726,0.00009716922,0.00006662083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335344,0.0009505248,0.0006517569,0.0006098267,0.0006380788,0.00295461,0.0013193231,0.0008868162,0.0033936277],"category_scores_gemma":[0.0034693205,0.00055870356,0.0008293778,0.0010756539,0.0019182722,0.005262769,0.0022156064,0.0025857105,0.00070213364],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009082208,0.00003980575,0.0002851042,0.00024976896,0.000032564505,0.0002496511,0.0008656842,0.024085393,0.003331633,0.85462713,0.0016644858,0.114478],"study_design_scores_gemma":[0.000025993033,0.00004117516,0.00012874168,0.000095480915,0.000057748857,0.00015722816,0.00011956157,0.06108645,0.0033717698,0.8987294,0.03616135,0.000025075378],"about_ca_topic_score_codex":0.0010114406,"about_ca_topic_score_gemma":0.00094865565,"teacher_disagreement_score":0.0033936277,"about_ca_system_score_codex":0.0005321928,"about_ca_system_score_gemma":0.00045641098,"threshold_uncertainty_score":0.0113527775},"labels":[],"label_agreement":null},{"id":"W1589398787","doi":"10.1007/978-0-387-21599-0_12","title":"Building Parallel Applications Using Design Patterns","year":2002,"lang":"en","type":"book-chapter","venue":"Advances in Software Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workstation; Graphics; Parallel processing; Computer architecture; Parallel computing; Supercomputer; Domain (mathematical analysis); Mainstream; Distributed computing; Computer graphics (images); Operating system","score_opus":0.020309446962790675,"score_gpt":0.24522536750265436,"score_spread":0.2249159205398637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589398787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008538971,0.00057610765,0.97107744,0.00023022747,0.00009534325,0.00011563412,0.00008395706,0.003389711,0.015892653],"genre_scores_gemma":[0.044108022,0.0017650331,0.93161595,0.00015427836,0.000051348026,0.00026131622,0.00039329726,0.0015115085,0.02013932],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995691,0.00007333144,0.000043952878,0.000077791665,0.00019925795,0.00003658868],"domain_scores_gemma":[0.9993837,0.00023980548,0.000035851455,0.00024260864,0.00007591779,0.00002216786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982972,0.0011110684,0.0005804697,0.00060832314,0.00051687617,0.0012717649,0.0014147438,0.00082152913,0.0059041856],"category_scores_gemma":[0.0017671856,0.0012424758,0.0008874011,0.0012910222,0.0007342107,0.002951722,0.0013298311,0.0017424844,0.0025336733],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006358351,0.000103927436,0.00073633867,0.0009687624,0.00010042902,0.00037705523,0.00067043316,0.036967654,0.031165127,0.16813585,0.017923838,0.742787],"study_design_scores_gemma":[0.00009938813,0.00021510976,0.0005708891,0.00030133902,0.00021758105,0.0016315685,0.00018667881,0.17797941,0.053696886,0.40033624,0.36470675,0.000058122547],"about_ca_topic_score_codex":0.000516462,"about_ca_topic_score_gemma":0.0008666645,"teacher_disagreement_score":0.0059041856,"about_ca_system_score_codex":0.00030699876,"about_ca_system_score_gemma":0.00047816895,"threshold_uncertainty_score":0.01975149},"labels":[],"label_agreement":null},{"id":"W1590126042","doi":"10.1109/pacrim.1995.519454","title":"An integrity checking system for satellite telemetry","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Telemetry; Correctness; Computer science; Satellite; Real-time computing; Data integrity; Relevance (law); Completeness (order theory); Set (abstract data type); Sampling (signal processing); Reliability engineering; Data mining; Algorithm; Database; Engineering; Telecommunications; Detector","score_opus":0.03916646247364545,"score_gpt":0.26891188932733834,"score_spread":0.2297454268536929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590126042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005429822,0.0013867957,0.9202506,0.0008433847,0.000664639,0.00063544104,0.0013064556,0.04564392,0.023838993],"genre_scores_gemma":[0.20445174,0.0022981511,0.7208949,0.001830989,0.0009790737,0.0014126938,0.008919873,0.004031081,0.05518155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950334,0.00094980287,0.00046647387,0.0006611554,0.0025215284,0.00036762934],"domain_scores_gemma":[0.99374926,0.0009899999,0.0004198857,0.0024720593,0.002121804,0.00024701774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033714445,0.0011508442,0.0012700895,0.0021258532,0.0019872105,0.0044498374,0.0023526128,0.002096144,0.019234145],"category_scores_gemma":[0.008662471,0.0006871678,0.00090879574,0.002129284,0.0014111283,0.0042184833,0.0031517341,0.0027293658,0.012142394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009808213,0.0003405896,0.0039926437,0.0010674247,0.00024455902,0.0019133555,0.00097651355,0.02189402,0.04937738,0.26125303,0.15745912,0.5005005],"study_design_scores_gemma":[0.0001988155,0.0003921271,0.0012069832,0.00029469025,0.00021495811,0.0030766246,0.00013205312,0.1396687,0.049934663,0.062143154,0.7425447,0.00019247763],"about_ca_topic_score_codex":0.0021470545,"about_ca_topic_score_gemma":0.0012542283,"teacher_disagreement_score":0.019234145,"about_ca_system_score_codex":0.0012975945,"about_ca_system_score_gemma":0.0023293654,"threshold_uncertainty_score":0.064344645},"labels":[],"label_agreement":null},{"id":"W159231793","doi":"10.5555/2349508.2349538","title":"Priority-based scheduling with adaptive speculative locking in distributed real-time transaction processing","year":2009,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Workload; Concurrency control; Distributed computing; Transaction processing; Database transaction; Scheduling (production processes); Earliest deadline first scheduling; Optimistic concurrency control; Two-phase locking; Serializability; Distributed transaction; Real-time computing; Dynamic priority scheduling; Computer network; Rate-monotonic scheduling; Operating system; Distributed concurrency control; Database; Mathematical optimization","score_opus":0.029131858376327372,"score_gpt":0.2747924999949116,"score_spread":0.24566064161858425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159231793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33932647,0.0020416833,0.65459263,0.0005304609,0.0002186808,0.00010145278,0.000024377872,0.0005127487,0.0026515487],"genre_scores_gemma":[0.952546,0.00024485585,0.04656658,0.00003942637,0.00005889882,0.000034122764,0.000010667066,0.000022078382,0.0004773677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986203,0.00064866315,0.00009732002,0.000106942956,0.00041009462,0.000116662806],"domain_scores_gemma":[0.99635184,0.0021116133,0.00040206464,0.00054177805,0.00044839695,0.00014436856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030627165,0.00028175724,0.00039351688,0.00035432607,0.0005355505,0.0009226679,0.0012623401,0.000451273,0.00043421928],"category_scores_gemma":[0.0072281705,0.00044788484,0.00022808918,0.00063832424,0.0010501697,0.00166582,0.00061217294,0.00063657755,0.00008198763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001239716,0.00037224474,0.004153124,0.00024076234,0.00007608388,0.00041347768,0.00057890237,0.7583225,0.029048074,0.071579255,0.0013172327,0.1326586],"study_design_scores_gemma":[0.00010804779,0.00026802722,0.00025873605,0.00000696707,0.000022295984,0.00007348822,0.0000401872,0.98125285,0.004929035,0.012250538,0.00077218824,0.000017585242],"about_ca_topic_score_codex":0.0021442294,"about_ca_topic_score_gemma":0.0017871582,"teacher_disagreement_score":0.0030627165,"about_ca_system_score_codex":0.00062453514,"about_ca_system_score_gemma":0.0012877887,"threshold_uncertainty_score":0.016197324},"labels":[],"label_agreement":null},{"id":"W1592959639","doi":"10.1007/978-3-540-77096-1_24","title":"Secretive Birds: Privacy in Population Protocols","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Obfuscation; Population; Adversary; Theoretical computer science; Exploit; Protocol (science); Computation; Secure multi-party computation; Computer security; Algorithm","score_opus":0.023627836335923417,"score_gpt":0.27587543418574706,"score_spread":0.25224759784982365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592959639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008261818,0.003082812,0.9466918,0.0039502066,0.00034254295,0.00007542006,0.0001119917,0.00037300406,0.037110403],"genre_scores_gemma":[0.6029965,0.008025027,0.30313596,0.0021279966,0.0015223275,0.00056606875,0.00032598953,0.00043377915,0.08086625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981875,0.0007565873,0.000086570646,0.00020570698,0.0006403663,0.00012313103],"domain_scores_gemma":[0.99596715,0.002569897,0.00014800868,0.0010510779,0.00017476914,0.00008901927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378113,0.00045445774,0.0007801574,0.00056553923,0.0010840223,0.003417612,0.0016848304,0.0020925824,0.0043260003],"category_scores_gemma":[0.0071043354,0.0006291593,0.0006525774,0.0010935492,0.004633602,0.008267316,0.0024109157,0.0046186084,0.0010750925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027409606,0.00001525295,0.00011178773,0.00006395025,0.000010194841,0.000045052886,0.00026182047,0.0051469826,0.00063021446,0.9573722,0.0044976794,0.03181743],"study_design_scores_gemma":[0.00001362873,0.000017719261,0.00006393542,0.000030868858,0.000010248208,0.000148373,0.00005011877,0.029761713,0.0014661266,0.94639695,0.022029024,0.000011330445],"about_ca_topic_score_codex":0.00037969448,"about_ca_topic_score_gemma":0.00034615194,"teacher_disagreement_score":0.0043260003,"about_ca_system_score_codex":0.001059899,"about_ca_system_score_gemma":0.00072802574,"threshold_uncertainty_score":0.014471889},"labels":[],"label_agreement":null},{"id":"W1593611082","doi":"10.1007/11924661_20","title":"A Localized Tracing Scheme Applied to Garbage Collection","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Garbage collection; Uniprocessor system; Tracing; Heap (data structure); Garbage; Memory hierarchy; Queue; Virtual memory; Locality of reference; TRACE (psycholinguistics); Parallel computing; Locality; Real-time computing; Multiprocessing; Operating system; Algorithm; Memory management; Computer network; Programming language; Cache; Overlay","score_opus":0.011332127949011558,"score_gpt":0.22935500544950735,"score_spread":0.2180228775004958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593611082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01848911,0.00021529997,0.97093123,0.00010969549,0.00011119026,0.00011564472,0.000078922436,0.0071136355,0.002835219],"genre_scores_gemma":[0.39038405,0.0004026253,0.5923187,0.00013486322,0.0000914486,0.00025533242,0.0002605973,0.0012587886,0.014893506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992519,0.00016844814,0.00006494916,0.00013345476,0.00025750932,0.00012376824],"domain_scores_gemma":[0.9975164,0.00044673588,0.00009336811,0.0014902413,0.00034168595,0.00011166549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427269,0.000757799,0.001346279,0.0013854766,0.0018386994,0.0016541468,0.0019605937,0.0010092013,0.0068789776],"category_scores_gemma":[0.0029582318,0.00060842896,0.0006695572,0.0018093024,0.001493293,0.0018457404,0.002950731,0.0012551736,0.001626179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013523952,0.0002604756,0.001053587,0.00045436108,0.00007679469,0.00031827512,0.0012811756,0.035304435,0.13574593,0.11875794,0.009096126,0.69629854],"study_design_scores_gemma":[0.00034453723,0.00075318146,0.0010259296,0.00016286975,0.00033414672,0.0006965956,0.0002773601,0.64789265,0.20173562,0.10472634,0.04187129,0.0001795421],"about_ca_topic_score_codex":0.0025018428,"about_ca_topic_score_gemma":0.0025308018,"teacher_disagreement_score":0.0068789776,"about_ca_system_score_codex":0.0011843838,"about_ca_system_score_gemma":0.0019284217,"threshold_uncertainty_score":0.02301246},"labels":[],"label_agreement":null},{"id":"W1596940311","doi":"10.1109/hicss.1990.205207","title":"An optimistic algorithm for consistent replicated shared data","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.10256019077901982,"score_gpt":0.30443134759138424,"score_spread":0.20187115681236442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596940311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020475823,0.0005252426,0.98897374,0.00038189045,0.00019350978,0.00023589867,0.00012472941,0.0021476648,0.005369746],"genre_scores_gemma":[0.07153697,0.0005799971,0.91515875,0.0002691761,0.00014690308,0.0005379673,0.00060131686,0.0005503707,0.010618497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969783,0.0007032525,0.00028218725,0.00030334244,0.0014331909,0.00029982495],"domain_scores_gemma":[0.99733716,0.00069781125,0.00018867129,0.0008045189,0.0008119477,0.00015992821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028042172,0.0010480552,0.001164981,0.0015819601,0.0019410979,0.0039056856,0.0034862193,0.0012677105,0.008859254],"category_scores_gemma":[0.0073332465,0.001031675,0.0008428689,0.001837479,0.0011232584,0.0042974125,0.0044118934,0.0022181273,0.0037664298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000806102,0.00013459411,0.0008321164,0.00038133524,0.00019027054,0.00035227678,0.00048662387,0.12602985,0.0056700674,0.41047356,0.04110831,0.41353488],"study_design_scores_gemma":[0.00034435504,0.00014514427,0.00014601907,0.000104322884,0.00011318527,0.00037724973,0.00018494928,0.6226525,0.01164529,0.25113326,0.11303457,0.000119269054],"about_ca_topic_score_codex":0.0021982433,"about_ca_topic_score_gemma":0.002897978,"teacher_disagreement_score":0.008859254,"about_ca_system_score_codex":0.0016965768,"about_ca_system_score_gemma":0.0034740716,"threshold_uncertainty_score":0.029637158},"labels":[],"label_agreement":null},{"id":"W1599332826","doi":"10.1007/3-540-36261-4_17","title":"Distributed Transaction Management in a Peer-to-Peer Process-Oriented Environment","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Personalization; Database transaction; Population; Process (computing); Domain (mathematical analysis); Knowledge management; World Wide Web; Internet privacy","score_opus":0.0119713758978158,"score_gpt":0.23188803591684357,"score_spread":0.21991666001902777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599332826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025830247,0.0023024245,0.9469119,0.0005768882,0.00029950525,0.00021024108,0.00008864586,0.0028227335,0.020957477],"genre_scores_gemma":[0.4754888,0.0032036044,0.47444788,0.00027431425,0.00042381787,0.00038631272,0.0005409504,0.00057088933,0.044663496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.0002672386,0.00012429693,0.00016682092,0.00063804135,0.00010285608],"domain_scores_gemma":[0.99881196,0.00047933933,0.000060718015,0.00031276443,0.00023541786,0.00009981928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112466,0.00045300237,0.00094150746,0.0005452987,0.0011452695,0.002707846,0.0024927787,0.0013904864,0.0032913256],"category_scores_gemma":[0.0025761654,0.0006194297,0.00036471747,0.0016911203,0.0008616282,0.00325727,0.0012148473,0.0012497702,0.0018400731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087306416,0.00043753735,0.0013196114,0.0006796312,0.00014049247,0.0017391791,0.0015451984,0.07236599,0.0488667,0.21322118,0.024165554,0.6346459],"study_design_scores_gemma":[0.00035322504,0.00055710285,0.0009593479,0.00012886304,0.00022317303,0.0024107653,0.00034615793,0.55773056,0.042157732,0.2608446,0.13416734,0.00012111649],"about_ca_topic_score_codex":0.0007189257,"about_ca_topic_score_gemma":0.00067521865,"teacher_disagreement_score":0.0032913256,"about_ca_system_score_codex":0.00046611193,"about_ca_system_score_gemma":0.0007194963,"threshold_uncertainty_score":0.011010647},"labels":[],"label_agreement":null},{"id":"W1600118664","doi":"","title":"A framework algorithm for dynamic, centralized dimension-bounded timestamps","year":2000,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Dimension (graph theory); Computation; Scalability; Context (archaeology); Bounded function; Theoretical computer science; Algorithm; Mathematics; Real-time computing","score_opus":0.008643373809848117,"score_gpt":0.2627661234968226,"score_spread":0.25412274968697446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600118664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009483802,0.00007371064,0.99686486,0.00007091218,0.000025916777,0.000067064146,0.000055086755,0.0013359238,0.0005580522],"genre_scores_gemma":[0.040681154,0.00014244407,0.95672405,0.000054422828,0.00003798348,0.00019982022,0.0002956829,0.000244342,0.001620037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976634,0.00041956868,0.00021662874,0.0005253809,0.00088628073,0.00028884696],"domain_scores_gemma":[0.99785775,0.00058784086,0.00012688615,0.0006282474,0.0006490827,0.00015004893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002980286,0.001123734,0.001186367,0.0018449929,0.0015201689,0.002839265,0.0028227188,0.0013639508,0.004954773],"category_scores_gemma":[0.0074545443,0.0006728163,0.0011987716,0.0018752614,0.0015673311,0.004883019,0.0037955802,0.0027014897,0.0018892472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050761126,0.00012435777,0.0006705212,0.00022174933,0.0000563412,0.0001241401,0.00045763617,0.058422066,0.009316399,0.44655788,0.012760081,0.47078124],"study_design_scores_gemma":[0.00032423157,0.00022286978,0.00021484747,0.00008889283,0.000068611385,0.00028087798,0.00020630077,0.65827376,0.013366136,0.2633575,0.06349572,0.00010028957],"about_ca_topic_score_codex":0.004479713,"about_ca_topic_score_gemma":0.004512643,"teacher_disagreement_score":0.004954773,"about_ca_system_score_codex":0.002457735,"about_ca_system_score_gemma":0.0035828706,"threshold_uncertainty_score":0.01783222},"labels":[],"label_agreement":null},{"id":"W162658627","doi":"10.1007/978-3-642-41527-2_4","title":"An $O(\\sqrt n)$ Space Bound for Obstruction-Free Leader Election","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leader election; Upper and lower bounds; Combinatorics; Binary logarithm; Randomized algorithm; Mathematics; Asynchronous communication; Discrete mathematics; Time complexity; Algorithm; Computer science; Theoretical computer science; Computer network","score_opus":0.015740228830314625,"score_gpt":0.24694280037527394,"score_spread":0.23120257154495932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162658627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019202793,0.0025707965,0.86481464,0.0050224666,0.001615063,0.0002867946,0.00061387697,0.005686155,0.10018735],"genre_scores_gemma":[0.5353004,0.0018769271,0.37971225,0.0022994585,0.0014585016,0.0012794613,0.0014644488,0.0024035552,0.07420502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581534,0.00088101876,0.00016679628,0.00069119746,0.0014334016,0.0010121855],"domain_scores_gemma":[0.99188507,0.004425872,0.0002807427,0.0024997948,0.00046783246,0.00044064497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023733217,0.001953773,0.002233294,0.0015054854,0.0030175836,0.0039548627,0.00450543,0.0021781726,0.043182064],"category_scores_gemma":[0.012302959,0.0008691732,0.0017649225,0.0026363502,0.002788861,0.009845881,0.0077460385,0.00724281,0.010278279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016282011,0.00047466546,0.0006233314,0.0006959855,0.0001484325,0.0001540144,0.00051330135,0.08182092,0.010830867,0.51521313,0.10046834,0.28742886],"study_design_scores_gemma":[0.0003429272,0.00024628427,0.00046036538,0.000115996016,0.00013316992,0.00017988922,0.00014237782,0.38970548,0.0037372906,0.57670534,0.02814813,0.000082720835],"about_ca_topic_score_codex":0.0031936807,"about_ca_topic_score_gemma":0.007229388,"teacher_disagreement_score":0.043182064,"about_ca_system_score_codex":0.0029706173,"about_ca_system_score_gemma":0.0036367087,"threshold_uncertainty_score":0.14445841},"labels":[],"label_agreement":null},{"id":"W1635884043","doi":"10.1007/978-3-642-33651-5_19","title":"RMR-Efficient Randomized Abortable Mutual Exclusion","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mutual exclusion; Asynchronous communication; Abort; Adversary model; Critical section; Swap (finance); Logarithm; Scheduling (production processes); Deterministic algorithm; Randomized algorithm; Theoretical computer science; Algorithm; Adversary; Operating system; Mathematics; Computer network; Computer security","score_opus":0.011702931723900205,"score_gpt":0.23608553280424469,"score_spread":0.22438260108034447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1635884043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030773124,0.00059631787,0.92911464,0.0006632882,0.00043038788,0.0003416064,0.00058753876,0.012894681,0.024598395],"genre_scores_gemma":[0.5399341,0.000310611,0.42332295,0.0005378295,0.00024057111,0.0006017936,0.0015129205,0.001499891,0.03203934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960085,0.0011656645,0.00016394674,0.00050228304,0.0013487325,0.0008107965],"domain_scores_gemma":[0.99533856,0.0018601026,0.0002733496,0.0018184427,0.0004983631,0.00021120966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019712725,0.0010252114,0.002104926,0.0007795577,0.0015643174,0.0020530783,0.0041675144,0.0012440095,0.012939594],"category_scores_gemma":[0.0059647034,0.0006930471,0.0008727749,0.0012166701,0.0010991085,0.002582224,0.0043223626,0.0023326022,0.003762417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003487617,0.0007684063,0.00066403946,0.0006196516,0.00011946643,0.00031466628,0.00036166646,0.1856869,0.03610229,0.23941986,0.05421736,0.47823805],"study_design_scores_gemma":[0.00050812843,0.00035165422,0.00031729857,0.00004324957,0.000058439535,0.00019735629,0.00007074597,0.85501474,0.015838541,0.11263788,0.014876167,0.00008574692],"about_ca_topic_score_codex":0.0017775206,"about_ca_topic_score_gemma":0.0038428886,"teacher_disagreement_score":0.012939594,"about_ca_system_score_codex":0.0014076874,"about_ca_system_score_gemma":0.0033569024,"threshold_uncertainty_score":0.043287277},"labels":[],"label_agreement":null},{"id":"W1640529447","doi":"10.3233/fi-2015-1181","title":"Communication Complexity of Consensus in Anonymous Message Passing Systems","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Message passing; Uniform consensus; Theoretical computer science; Distributed computing; Computer security; Computer network; Consensus; Artificial intelligence; Multi-agent system","score_opus":0.07983935127487378,"score_gpt":0.287115616522844,"score_spread":0.20727626524797022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640529447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41983092,0.0006982131,0.5611465,0.002957544,0.00012388629,0.00020130929,0.00044592025,0.0006322266,0.013963531],"genre_scores_gemma":[0.9597518,0.0003118332,0.03627025,0.00011796773,0.00011221788,0.00023802629,0.0002692583,0.00010729361,0.002821218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963103,0.0012616684,0.0001890338,0.00053343724,0.0011039686,0.0006015313],"domain_scores_gemma":[0.9665317,0.02874526,0.0016425294,0.0013217024,0.0011766907,0.0005820715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00264551,0.000641332,0.00125784,0.00092170667,0.0013600807,0.0024760375,0.0018841539,0.0015247363,0.0031603815],"category_scores_gemma":[0.02302542,0.0004461558,0.0006496685,0.0012024095,0.0019648045,0.00494125,0.0025027785,0.0017925996,0.0003233921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004219068,0.000101656646,0.0014922629,0.00019372033,0.00006214034,0.00022846392,0.00039427992,0.888037,0.0028171213,0.08699825,0.0019955817,0.017257651],"study_design_scores_gemma":[0.000030921612,0.000026367436,0.00022950029,0.000004924101,0.0000104707415,0.000031873762,0.000049089213,0.9204423,0.00086357474,0.07795021,0.00035035904,0.000010458497],"about_ca_topic_score_codex":0.0028405155,"about_ca_topic_score_gemma":0.0014311369,"teacher_disagreement_score":0.0031603815,"about_ca_system_score_codex":0.0028112666,"about_ca_system_score_gemma":0.0017779742,"threshold_uncertainty_score":0.020397246},"labels":[],"label_agreement":null},{"id":"W164668433","doi":"10.1007/978-3-642-39718-9_19","title":"Finitary Fairness in Action Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Finitary; Computer science; Implementation; Action (physics); Theoretical computer science; Protocol (science); Discrete mathematics; Mathematics; Programming language","score_opus":0.023403778723008355,"score_gpt":0.24568324778230813,"score_spread":0.22227946905929977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164668433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019138347,0.004804597,0.80722886,0.0033857846,0.00087869493,0.00007512239,0.00017598284,0.0004898832,0.16382268],"genre_scores_gemma":[0.7999531,0.0029593802,0.1215712,0.0009085629,0.0013672275,0.0003830232,0.0003023748,0.00034390244,0.07221124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996228,0.0015233856,0.00025554386,0.0005417016,0.00097484025,0.00047644952],"domain_scores_gemma":[0.9948133,0.0034485003,0.00017771132,0.00085712183,0.00050885754,0.00019441529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004798297,0.00073393964,0.00094529433,0.0008503088,0.0021569089,0.0039571268,0.001656048,0.0014780295,0.006055148],"category_scores_gemma":[0.009160854,0.0007406856,0.0009667497,0.0014966612,0.0056651626,0.0063576754,0.002162713,0.0048843324,0.0009970755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001193152,0.0000050418525,0.000037428814,0.000018909515,0.0000035020043,0.000010147805,0.000112078626,0.0014221991,0.00010651287,0.9929542,0.0006998968,0.004618125],"study_design_scores_gemma":[0.00000517291,0.000003982536,0.000026557116,0.00001203426,0.0000037417176,0.0000104038645,0.000012493713,0.004006812,0.00012057449,0.9919892,0.0038050697,0.000003906304],"about_ca_topic_score_codex":0.0025938805,"about_ca_topic_score_gemma":0.001980022,"teacher_disagreement_score":0.006055148,"about_ca_system_score_codex":0.004047639,"about_ca_system_score_gemma":0.002169382,"threshold_uncertainty_score":0.029367745},"labels":[],"label_agreement":null},{"id":"W1673294103","doi":"10.1109/icinfa.2015.7279289","title":"An infection algorithm for leader election: Experimental results for a chain","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Leader election; Probabilistic logic; Pairwise comparison; Computer science; Graph; Algorithm; Node (physics); Population; Protocol (science); Distributed algorithm; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.047229042871276224,"score_gpt":0.32245694757298526,"score_spread":0.27522790470170905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673294103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.848693,0.0011997303,0.13390629,0.0004707679,0.00023750299,0.00085653446,0.00051658106,0.0023177844,0.011801822],"genre_scores_gemma":[0.91413116,0.00035767086,0.08142029,0.000065876615,0.00003104887,0.00037929084,0.0006387475,0.00017088739,0.002805096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99697113,0.0009993073,0.00018929219,0.0003050699,0.0011077656,0.00042736402],"domain_scores_gemma":[0.9823636,0.010680537,0.00097416143,0.0031557009,0.002105425,0.00072051835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003945789,0.00075622776,0.00097485847,0.00087886734,0.0010269573,0.00076796644,0.0015531664,0.0011651042,0.0042689233],"category_scores_gemma":[0.01237427,0.00031648064,0.00038416497,0.0012224714,0.0010850013,0.0018566453,0.0012307462,0.0012294397,0.00063694414],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064947573,0.0092278,0.0072192536,0.001003151,0.00038149316,0.0005572236,0.00088596717,0.6992415,0.083625935,0.0115745915,0.008197694,0.17159072],"study_design_scores_gemma":[0.0005577083,0.0035747413,0.0011881642,0.000034295754,0.00007376181,0.00012189168,0.00015385528,0.95011145,0.036755268,0.005335276,0.0020559975,0.00003767744],"about_ca_topic_score_codex":0.0021427763,"about_ca_topic_score_gemma":0.0010997673,"teacher_disagreement_score":0.0042689233,"about_ca_system_score_codex":0.0008931341,"about_ca_system_score_gemma":0.0008874248,"threshold_uncertainty_score":0.020867527},"labels":[],"label_agreement":null},{"id":"W1689287514","doi":"10.1007/978-3-642-25873-2_34","title":"Optimal Instrumentation of Data-flow in Concurrent Data Structures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instrumentation (computer programming); Observability; Debugging; Set (abstract data type); Data flow diagram; Programming language; Data structure; Debugger; TRACE (psycholinguistics); Algorithm; Real-time computing; Database","score_opus":0.06410625513981336,"score_gpt":0.3004619759425863,"score_spread":0.23635572080277292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1689287514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034647044,0.0003311935,0.96138364,0.00016908952,0.000052088577,0.000041123407,0.0000316575,0.0016698312,0.0016743599],"genre_scores_gemma":[0.7627129,0.00030926743,0.23521309,0.00007804694,0.000060307757,0.000089834386,0.000089053385,0.00028270006,0.0011648323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972487,0.0007008431,0.00015656576,0.00043175096,0.0009801639,0.00048189927],"domain_scores_gemma":[0.9918447,0.0049866796,0.0005108347,0.0018486858,0.00057218136,0.00023702614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715876,0.00071791856,0.00114476,0.000736111,0.00086178456,0.0014642571,0.0016560607,0.0009881068,0.0017153494],"category_scores_gemma":[0.011050618,0.0009358998,0.0005150941,0.0008989041,0.0019310585,0.0025364114,0.0030756725,0.001974806,0.0003137552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019159948,0.00037532378,0.0028229114,0.00043747737,0.000055610755,0.00013019684,0.00047476962,0.28753448,0.08654249,0.13586828,0.0024989233,0.4813436],"study_design_scores_gemma":[0.0000873094,0.00015877865,0.000359251,0.00003983532,0.000027465134,0.000055861656,0.000053066702,0.85821235,0.041313313,0.097752295,0.0019141936,0.000026269468],"about_ca_topic_score_codex":0.0011372312,"about_ca_topic_score_gemma":0.0012993284,"teacher_disagreement_score":0.0020715876,"about_ca_system_score_codex":0.0015283825,"about_ca_system_score_gemma":0.0020255367,"threshold_uncertainty_score":0.011089265},"labels":[],"label_agreement":null},{"id":"W1693269807","doi":"10.1109/ccece.1996.548317","title":"A fail safe temporary reorganization procedure for STARMAP routing tables in the event of a primary hub or link failure","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Routing table; Computer network; Computer science; Routing (electronic design automation); Network packet; Table (database); Link (geometry); Interconnectivity; Simple (philosophy); Event (particle physics); Static routing; Source routing; Policy-based routing; Routing protocol; Database","score_opus":0.02250639763578004,"score_gpt":0.23288314077311348,"score_spread":0.21037674313733343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1693269807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043141246,0.00025074166,0.9305321,0.0004727418,0.0003334534,0.00048406128,0.0003150312,0.016343988,0.00812667],"genre_scores_gemma":[0.7121712,0.0002651609,0.2678791,0.0005704322,0.00017274666,0.00047809872,0.0010646344,0.0015018319,0.015896756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980751,0.00032532625,0.00016325392,0.00030607075,0.00087297615,0.00025727646],"domain_scores_gemma":[0.9913191,0.0009890823,0.00072783744,0.0057276185,0.0009608646,0.0002754764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026267187,0.0004973026,0.00068134733,0.0009135394,0.0013244635,0.001932704,0.0016107231,0.00069695164,0.0041897795],"category_scores_gemma":[0.006887857,0.0006621081,0.00060748594,0.0006095445,0.0014090033,0.0031063538,0.0022731102,0.0018168689,0.002614849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021985201,0.00041147525,0.008803894,0.00047997953,0.00016175359,0.001438535,0.0015220123,0.054616883,0.12793878,0.098480314,0.039039593,0.6649082],"study_design_scores_gemma":[0.00029966992,0.0022788479,0.010408983,0.00017852125,0.00020785362,0.0038212286,0.001337544,0.3973211,0.29522258,0.109015994,0.17934737,0.0005603314],"about_ca_topic_score_codex":0.0007085159,"about_ca_topic_score_gemma":0.0009354335,"teacher_disagreement_score":0.0041897795,"about_ca_system_score_codex":0.00050433644,"about_ca_system_score_gemma":0.001724272,"threshold_uncertainty_score":0.014016271},"labels":[],"label_agreement":null},{"id":"W1708297604","doi":"10.1007/3540139095_126","title":"Centralization and decentralization in the TRIUMF Control System","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in physics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TRIUMF","funders":"","keywords":"Computer Automated Measurement and Control; Decentralization; Control (management); Computer science; Node (physics); Software; Control system; Software engineering; Operating system; Distributed computing; Engineering; Artificial intelligence; Data acquisition; Political science; Electrical engineering","score_opus":0.010632769125313631,"score_gpt":0.20832405567336879,"score_spread":0.19769128654805515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1708297604","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09737638,0.0016198462,0.86417764,0.0010519035,0.00028932205,0.000068300156,0.000078482284,0.0015587219,0.033779446],"genre_scores_gemma":[0.9254057,0.00041487566,0.056660693,0.00012990447,0.00017384512,0.00009217502,0.000066582914,0.00013107984,0.016925182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932766,0.00016992001,0.000032706663,0.00012370187,0.00018663984,0.00015929568],"domain_scores_gemma":[0.99929714,0.00022542753,0.00006347848,0.00020980177,0.0001483446,0.000055825225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020373,0.00028019975,0.0008019036,0.0005044306,0.00089588104,0.0018237645,0.0009315729,0.0008963814,0.0037206213],"category_scores_gemma":[0.0023344674,0.000225762,0.00040026658,0.0005141792,0.0011393131,0.001979452,0.001060751,0.0012626715,0.00052697887],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006545721,0.00012979186,0.00084194244,0.00010945259,0.00005591459,0.00025371453,0.0006373727,0.22191605,0.011111317,0.5180718,0.007931998,0.23828611],"study_design_scores_gemma":[0.00007577104,0.00011811268,0.0005152734,0.000017942632,0.000019929728,0.00017218578,0.00006348185,0.8629064,0.00469228,0.121439256,0.0099359555,0.00004334688],"about_ca_topic_score_codex":0.002776834,"about_ca_topic_score_gemma":0.0019649672,"teacher_disagreement_score":0.0037206213,"about_ca_system_score_codex":0.00095725694,"about_ca_system_score_gemma":0.00081204966,"threshold_uncertainty_score":0.0124467015},"labels":[],"label_agreement":null},{"id":"W1713951430","doi":"10.1007/978-3-540-27796-5_22","title":"Optimal Decision Strategies in Byzantine Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Correctness; Computer science; Probability distribution; Expected value; Optimal decision; Set (abstract data type); Mathematical optimization; Markov decision process; Value (mathematics); Decision rule; Decision problem; Mathematics; Algorithm; Decision tree; Artificial intelligence; Markov process; Machine learning; Statistics","score_opus":0.010876317040672745,"score_gpt":0.23847969486264273,"score_spread":0.22760337782197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1713951430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14017221,0.00093317835,0.81841147,0.0012306994,0.00008659055,0.00014456491,0.00017668077,0.0004406461,0.03840394],"genre_scores_gemma":[0.7990749,0.0009724998,0.18200675,0.00015415235,0.00006791069,0.00018425848,0.00014739258,0.00017739071,0.017214818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857676,0.00078160135,0.00006149001,0.00014886908,0.00017938229,0.00025186344],"domain_scores_gemma":[0.9973911,0.0019985305,0.00016059972,0.00015672705,0.00014677875,0.00014622536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159408,0.00088687916,0.0011254642,0.0006298675,0.0008257208,0.0029186641,0.0011653167,0.0013480297,0.0046419343],"category_scores_gemma":[0.0063149747,0.0004986397,0.0003590103,0.001014224,0.0012344851,0.003850181,0.0016850302,0.0016488628,0.0006815617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050383026,0.00008868866,0.0002847773,0.000192597,0.000039922572,0.00010831082,0.0004088134,0.19749103,0.0022092403,0.7214961,0.004355269,0.07282143],"study_design_scores_gemma":[0.00007710985,0.0000830345,0.00008409834,0.000022784912,0.000016807271,0.000042091957,0.00009548029,0.35115528,0.0012265221,0.6441327,0.003048284,0.000015910317],"about_ca_topic_score_codex":0.0009930634,"about_ca_topic_score_gemma":0.001422907,"teacher_disagreement_score":0.0046419343,"about_ca_system_score_codex":0.000997186,"about_ca_system_score_gemma":0.00089674315,"threshold_uncertainty_score":0.015528798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01137290983214445,"score_gpt":0.2202480344864702,"score_spread":0.20887512465432576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760381732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048572082,0.00081400666,0.9353818,0.00046447315,0.00031791817,0.00036442664,0.0003703887,0.0020548138,0.011660013],"genre_scores_gemma":[0.65802914,0.00039090822,0.32392824,0.00019955968,0.00020096416,0.00046250134,0.0005033516,0.0002180102,0.016067311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868673,0.00031864145,0.00007864644,0.00024093136,0.00050097215,0.00017405745],"domain_scores_gemma":[0.99834037,0.00055819267,0.000112536654,0.0006367211,0.00027418236,0.00007795848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862336,0.00065917155,0.0015570542,0.00071968214,0.0016404698,0.0018710892,0.0020449765,0.0009996397,0.0050606346],"category_scores_gemma":[0.0026380648,0.00040072014,0.0003683757,0.0011666302,0.00078238756,0.0034873078,0.003012239,0.001147011,0.001366179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024312788,0.00052782113,0.00068383245,0.00079960393,0.00016371241,0.00035287262,0.0008881976,0.16151428,0.12058795,0.17919143,0.021433314,0.5114258],"study_design_scores_gemma":[0.00023324725,0.00032937046,0.00026418632,0.00004526692,0.0000501061,0.00015936083,0.00014493152,0.8372969,0.035360605,0.11432172,0.01174642,0.00004786144],"about_ca_topic_score_codex":0.00083732087,"about_ca_topic_score_gemma":0.0015336695,"teacher_disagreement_score":0.0050606346,"about_ca_system_score_codex":0.00067303464,"about_ca_system_score_gemma":0.0011592535,"threshold_uncertainty_score":0.016929567},"labels":[],"label_agreement":null},{"id":"W1765763648","doi":"10.1007/3-540-46093-4_15","title":"View Serializable Updates of Concurrent Index Structures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Serialization; Theoretical computer science; Database transaction; Algorithm; Programming language; Transaction processing; Distributed transaction","score_opus":0.01774141678288299,"score_gpt":0.2455220773606002,"score_spread":0.2277806605777172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765763648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07967256,0.0014420677,0.82786006,0.00031479713,0.00062129414,0.00019484744,0.0010684057,0.010767365,0.07805868],"genre_scores_gemma":[0.67795545,0.0019054761,0.22050658,0.00023253156,0.00051676587,0.00022682025,0.0026085884,0.002692331,0.09335545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962616,0.000049236336,0.000023514656,0.000042118325,0.00022089166,0.000038010297],"domain_scores_gemma":[0.99899536,0.00027139141,0.000057211644,0.00045798288,0.00017046898,0.000047732603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189857,0.00043412636,0.0004979432,0.00070242945,0.0003822609,0.0018884372,0.0009999069,0.0003869647,0.013153764],"category_scores_gemma":[0.0018016881,0.00046508643,0.0002489309,0.0010910867,0.0005159948,0.0026501126,0.0009420876,0.0009015601,0.0016230034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012020462,0.00018763235,0.0013819865,0.00043795153,0.00006825894,0.00066838507,0.0010910644,0.02687687,0.06327014,0.4187945,0.039606534,0.44641465],"study_design_scores_gemma":[0.0003194465,0.00039404188,0.001831844,0.00009193691,0.00018070471,0.0009273533,0.00043730898,0.22816117,0.11553877,0.44392803,0.20811656,0.00007282053],"about_ca_topic_score_codex":0.0011885217,"about_ca_topic_score_gemma":0.001957301,"teacher_disagreement_score":0.013153764,"about_ca_system_score_codex":0.00040032057,"about_ca_system_score_gemma":0.00029890562,"threshold_uncertainty_score":0.044003725},"labels":[],"label_agreement":null},{"id":"W1777307785","doi":"10.1109/mrd.1992.242621","title":"High availability is not enough (distributed systems)","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Replication (statistics); Scalability; High availability; Exploit; Latency (audio); Distributed computing; Throughput; Computer security; Database; Operating system; Telecommunications; Biology","score_opus":0.016543539474846217,"score_gpt":0.22785503738765467,"score_spread":0.21131149791280845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777307785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064143864,0.09620424,0.20671381,0.19315006,0.022524659,0.0001327402,0.00039322907,0.002457132,0.47200975],"genre_scores_gemma":[0.33139732,0.06912319,0.11555993,0.08987142,0.02839801,0.00075255596,0.0006299301,0.001350899,0.36291683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953963,0.0015054758,0.00034893423,0.00074268406,0.0017183418,0.00028821258],"domain_scores_gemma":[0.9926449,0.0037572095,0.00049407844,0.0013011332,0.0013635485,0.00043917872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036302696,0.0006426463,0.00090434117,0.00084081205,0.0019629148,0.0072880737,0.0009741542,0.002490887,0.013363482],"category_scores_gemma":[0.008071149,0.0004993234,0.0003365196,0.0012954102,0.007684727,0.010943959,0.0027075862,0.0052834083,0.008344912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029598443,0.000017323267,0.0003462327,0.00037666142,0.000028237646,0.00013678848,0.0008938268,0.0006427343,0.00077375147,0.78865546,0.119837835,0.08826149],"study_design_scores_gemma":[0.000010371431,0.00003797549,0.00021065398,0.00020633364,0.000012825208,0.0003341083,0.00022426478,0.00065073697,0.00036128704,0.32922363,0.66871274,0.000015053619],"about_ca_topic_score_codex":0.0010689517,"about_ca_topic_score_gemma":0.0011460088,"teacher_disagreement_score":0.013363482,"about_ca_system_score_codex":0.0024953303,"about_ca_system_score_gemma":0.0018322617,"threshold_uncertainty_score":0.04470527},"labels":[],"label_agreement":null},{"id":"W1793726452","doi":"10.1007/978-3-642-17226-7_16","title":"Distributed Group Communication System for Mobile Devices Based on SMS","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Overhead (engineering); Communication in small groups; Short Message Service; Exploit; Multicast; Computer network; Service (business); Mobile device; Distributed computing; Computer security; Operating system","score_opus":0.012214481466605531,"score_gpt":0.24282956478741283,"score_spread":0.2306150833208073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793726452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33257523,0.0012569408,0.58603644,0.00069257757,0.00090796174,0.00089986424,0.000833673,0.041181564,0.03561576],"genre_scores_gemma":[0.903471,0.00019948377,0.06092133,0.00020919958,0.00017337535,0.0004161665,0.000777362,0.00035122407,0.033480812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.0001139719,0.000027281587,0.00007590855,0.00012310581,0.00007371215],"domain_scores_gemma":[0.9994541,0.000111838024,0.00003437973,0.00015645206,0.00015590934,0.00008719171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039567493,0.0005701983,0.0008787203,0.00068294205,0.0009937638,0.00062821765,0.0010865285,0.00068309635,0.010337417],"category_scores_gemma":[0.0006753008,0.00020709769,0.00031555753,0.0004729085,0.00024222405,0.0006200759,0.000959239,0.0006280581,0.0026853331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067955577,0.0010678053,0.0074030417,0.00066074624,0.0002560573,0.0018290841,0.0021055923,0.014577719,0.32989788,0.015680036,0.08092918,0.5387973],"study_design_scores_gemma":[0.0026885204,0.005760688,0.01548793,0.00024928345,0.0011160779,0.0028470464,0.0013253739,0.51756215,0.24298847,0.015960697,0.19370791,0.0003058517],"about_ca_topic_score_codex":0.0012847938,"about_ca_topic_score_gemma":0.0013564683,"teacher_disagreement_score":0.010337417,"about_ca_system_score_codex":0.00041863284,"about_ca_system_score_gemma":0.00049184606,"threshold_uncertainty_score":0.03458208},"labels":[],"label_agreement":null},{"id":"W180087852","doi":"","title":"Validation of Remote Object Invocation and Object Migration in CORBA GIOP using Promela/Spin","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Promela; Common Object Request Broker Architecture; Computer science; Protocol (science); Interoperability; Object (grammar); Programming language; Model checking; Operating system; Artificial intelligence","score_opus":0.03411696030592919,"score_gpt":0.26400748725439765,"score_spread":0.22989052694846845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180087852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27938822,0.00012596775,0.7070567,0.00066293037,0.00009177275,0.00056473806,0.00020372016,0.005651363,0.0062545966],"genre_scores_gemma":[0.83652997,0.0001548763,0.15911105,0.00025292445,0.000016399676,0.00049651903,0.0003485413,0.00043880884,0.0026508672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9861799,0.0071336264,0.00080502965,0.0006940047,0.004419955,0.00076741556],"domain_scores_gemma":[0.9633107,0.018876778,0.0022719186,0.01096441,0.004241472,0.00033479097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014962919,0.0005991646,0.0006217572,0.0007264473,0.0013586819,0.00218857,0.0018860158,0.0012466367,0.0011909248],"category_scores_gemma":[0.035890922,0.00081545615,0.000947248,0.0003700448,0.0033068277,0.0024312772,0.0021039415,0.0022311672,0.00029382852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017617197,0.0009104392,0.017696975,0.0011883616,0.00022980705,0.0018996638,0.0052216128,0.5027818,0.119772986,0.2700993,0.0031230426,0.0753142],"study_design_scores_gemma":[0.00022864403,0.0003661161,0.0014814741,0.00020398523,0.000080540165,0.00024562085,0.00032442415,0.81849396,0.13894606,0.029768556,0.009758004,0.00010255556],"about_ca_topic_score_codex":0.0052199177,"about_ca_topic_score_gemma":0.004687107,"teacher_disagreement_score":0.014962919,"about_ca_system_score_codex":0.0022490763,"about_ca_system_score_gemma":0.004503516,"threshold_uncertainty_score":0.07913244},"labels":[],"label_agreement":null},{"id":"W1803408867","doi":"10.1007/3-540-47922-8_20","title":"Using Agent Replication to Enhance Reliability and Availability of Multi-agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Dependability; Replication (statistics); Software deployment; Computer science; Reliability (semiconductor); Distributed computing; Mainstream; Multi-agent system; Software engineering; Artificial intelligence","score_opus":0.04064489282384873,"score_gpt":0.29467508070047665,"score_spread":0.2540301878766279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803408867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123308465,0.002583779,0.8588205,0.0004928069,0.0005757561,0.00010479324,0.00003379438,0.0034862643,0.010593882],"genre_scores_gemma":[0.805527,0.00080045074,0.18918775,0.000070287715,0.0002584731,0.00006602428,0.000042586467,0.00020064336,0.003846811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.0002019508,0.00004190722,0.00007959421,0.00018996905,0.000057599464],"domain_scores_gemma":[0.9964043,0.0018218938,0.00023406243,0.0009444148,0.0004612641,0.00013408082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012989505,0.0004937332,0.00060976594,0.00051612046,0.0006627533,0.0009109431,0.0011631637,0.00069491385,0.0018437955],"category_scores_gemma":[0.0050920458,0.00039922624,0.00042341303,0.0004718769,0.00040031882,0.002163973,0.0011284369,0.0010869587,0.0004831041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007914283,0.0004265498,0.001872124,0.0005528755,0.00017369009,0.0007889269,0.00079938746,0.21540502,0.24580449,0.045769323,0.005353436,0.4822628],"study_design_scores_gemma":[0.00016578639,0.00048692166,0.0009352716,0.000042211774,0.00019437406,0.0007982343,0.00011063308,0.8594991,0.074791975,0.045889262,0.017028404,0.00005774873],"about_ca_topic_score_codex":0.00044951658,"about_ca_topic_score_gemma":0.00070435094,"teacher_disagreement_score":0.0018437955,"about_ca_system_score_codex":0.00028195235,"about_ca_system_score_gemma":0.00037303753,"threshold_uncertainty_score":0.0068695545},"labels":[],"label_agreement":null},{"id":"W1807555227","doi":"","title":"Tardigrade: leveraging lightweight virtual machines to easily and efficiently construct fault-tolerant services","year":2015,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sandbox (software development); Computer science; Fault tolerance; Service (business); Replication (statistics); Virtual machine; Distributed computing; Process (computing); Operating system; Embedded system; Biology","score_opus":0.025244271863491183,"score_gpt":0.2749679163606518,"score_spread":0.24972364449716064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807555227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11707879,0.00069387833,0.7858767,0.00036568913,0.00028888555,0.0003690344,0.00014532561,0.08825481,0.0069269547],"genre_scores_gemma":[0.6096458,0.00032813617,0.3775992,0.00033662547,0.000060132952,0.00021621081,0.0006613764,0.004186267,0.0069662174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.0001933644,0.00007387387,0.0001475563,0.0003177395,0.00015416411],"domain_scores_gemma":[0.99802566,0.00038766576,0.00018308977,0.000895019,0.00023696515,0.00027161944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011913123,0.0008154099,0.0005045819,0.00068940484,0.0007123177,0.0014096126,0.002331188,0.0007373534,0.0017152448],"category_scores_gemma":[0.0037245103,0.00067898526,0.00062927656,0.00039419383,0.0013616068,0.0027703107,0.003907224,0.0015662281,0.00096002995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032195242,0.00089079083,0.01561922,0.0010836932,0.0003565075,0.0018938503,0.0024895666,0.16160803,0.2103133,0.086801715,0.04874212,0.46698174],"study_design_scores_gemma":[0.00031712736,0.00055545935,0.002173346,0.00008743366,0.00013135503,0.00080619793,0.00022877546,0.77421033,0.1046013,0.027180431,0.089532755,0.00017541443],"about_ca_topic_score_codex":0.0035985147,"about_ca_topic_score_gemma":0.0031359624,"teacher_disagreement_score":0.0035985147,"about_ca_system_score_codex":0.0009919617,"about_ca_system_score_gemma":0.0012085388,"threshold_uncertainty_score":0.0071972013},"labels":[],"label_agreement":null},{"id":"W1809963723","doi":"","title":"Online data migration for autonomic provisioning of databases in dynamic content web servers","year":2005,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Benchmark (surveying); Provisioning; Database; Transaction processing; Distributed computing; Database transaction; Replication (statistics); Computer network","score_opus":0.2718492388410517,"score_gpt":0.44719995181314376,"score_spread":0.17535071297209204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809963723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25213036,0.0005014267,0.7393803,0.00051693287,0.00015769758,0.00019256887,0.000071243485,0.0037935483,0.0032559591],"genre_scores_gemma":[0.78188604,0.00012479426,0.21618,0.00007152811,0.00004076793,0.00006901013,0.000109110835,0.00010487445,0.0014139875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942124,0.00016376699,0.000047875885,0.00009595567,0.00018000956,0.000091136055],"domain_scores_gemma":[0.99876547,0.0002898331,0.00014741183,0.0005024074,0.00017876478,0.00011623684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096375996,0.0002820252,0.00039976244,0.00052847737,0.0010444367,0.000905243,0.001180896,0.00060939556,0.0007539454],"category_scores_gemma":[0.0021478208,0.00027531508,0.00025379632,0.0005271821,0.00045226002,0.0012970275,0.0009007307,0.00069034635,0.00025125194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010591942,0.00071166025,0.011463335,0.00022976374,0.000111474095,0.00067965203,0.0005767896,0.13288431,0.18195057,0.026165355,0.008503397,0.6356645],"study_design_scores_gemma":[0.000096349904,0.00023439711,0.0033576654,0.000017503065,0.00005411279,0.00054844486,0.00020755267,0.9168329,0.060076382,0.009249811,0.009288352,0.00003645556],"about_ca_topic_score_codex":0.001058321,"about_ca_topic_score_gemma":0.0014980243,"teacher_disagreement_score":0.001180896,"about_ca_system_score_codex":0.0005238905,"about_ca_system_score_gemma":0.00064229517,"threshold_uncertainty_score":0.0050969124},"labels":[],"label_agreement":null},{"id":"W1817978457","doi":"10.1007/3-540-40064-8_17","title":"Efficient Communication in Unknown Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Broadcasting (networking); Synchronization (alternating current); Dissemination; Node (physics); Overhead (engineering); Computer network; Network topology; Constant (computer programming); Distributed computing; Simple (philosophy); Broadcast communication network; State (computer science); Theoretical computer science; Telecommunications network; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics","score_opus":0.010458574356660501,"score_gpt":0.22980066903922314,"score_spread":0.21934209468256263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817978457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020935165,0.0034744202,0.92889076,0.0012163044,0.00030206327,0.000052547675,0.00013423126,0.00086054293,0.04413402],"genre_scores_gemma":[0.6495775,0.007550181,0.26181084,0.00041704052,0.00074058276,0.00024219185,0.0005589327,0.00046340865,0.078639306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928325,0.00019198927,0.000029758958,0.00011570426,0.00028492403,0.00009429621],"domain_scores_gemma":[0.9984124,0.0008729892,0.000076487355,0.00048093597,0.00010997039,0.000047227768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064441696,0.00062672346,0.00084515155,0.0007311155,0.0008532623,0.0019808495,0.0012375761,0.0010897783,0.006427496],"category_scores_gemma":[0.00313693,0.0005020253,0.00031891675,0.0012814422,0.0016155859,0.004399701,0.0023564533,0.0016799482,0.0013868787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016952594,0.000054233944,0.00018646201,0.0002651449,0.000034611025,0.00008902993,0.00017222532,0.15189147,0.005411117,0.65464574,0.012159244,0.1749213],"study_design_scores_gemma":[0.00002611887,0.000039969967,0.00017666703,0.00004004204,0.000021646201,0.00016155867,0.000056764045,0.44223282,0.0043756044,0.52796006,0.024892943,0.000015807893],"about_ca_topic_score_codex":0.0004062738,"about_ca_topic_score_gemma":0.00050954876,"teacher_disagreement_score":0.006427496,"about_ca_system_score_codex":0.00062817545,"about_ca_system_score_gemma":0.00043340115,"threshold_uncertainty_score":0.021502137},"labels":[],"label_agreement":null},{"id":"W1822893234","doi":"10.1109/icdcs.1989.37978","title":"The reliability of regeneration-based replica control protocols","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Replica; Reliability (semiconductor); Computer science; Reliability engineering; Reliability theory; Control (management); Object (grammar); Engineering; Failure rate; Artificial intelligence","score_opus":0.01153761800846436,"score_gpt":0.25912048099230833,"score_spread":0.24758286298384397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822893234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21467,0.0053130407,0.7559154,0.0015415832,0.00020215572,0.00014014766,0.00010880902,0.001167075,0.020941846],"genre_scores_gemma":[0.97360295,0.0008316285,0.02257409,0.00005778889,0.00008382837,0.00007463519,0.00004489312,0.00004653975,0.002683657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986677,0.0004544158,0.0000577298,0.00014061567,0.0005264573,0.00015313056],"domain_scores_gemma":[0.9941788,0.0036219845,0.00051832997,0.0008636878,0.00071325665,0.0001039415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023392665,0.00047398734,0.00045081766,0.0008210909,0.00066797686,0.0013540167,0.0012951344,0.00089682144,0.0013935539],"category_scores_gemma":[0.011706623,0.0002909087,0.00029518668,0.0005300536,0.0013655736,0.002035898,0.0010141911,0.0006572752,0.00027820916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007231655,0.00010974544,0.0018516753,0.000343791,0.00006202894,0.0004001356,0.0005701957,0.54498357,0.022490826,0.27330428,0.0038767038,0.15128392],"study_design_scores_gemma":[0.000036602385,0.00012446895,0.00034451313,0.00002647235,0.000029102985,0.00023500703,0.000059452694,0.9070038,0.0049443212,0.08471164,0.0024597412,0.000024911127],"about_ca_topic_score_codex":0.0012985428,"about_ca_topic_score_gemma":0.0005755731,"teacher_disagreement_score":0.0023392665,"about_ca_system_score_codex":0.0011465378,"about_ca_system_score_gemma":0.0007983837,"threshold_uncertainty_score":0.012371421},"labels":[],"label_agreement":null},{"id":"W1829336647","doi":"10.1109/icc.1994.368795","title":"A combined token/random access protocol for high-speed LAN/MAN ring networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Token ring; Asynchronous communication; Computer science; Random access; Token passing; Computer network; Security token; Protocol (science); Token bus network; Network packet; Distributed computing","score_opus":0.04463979524113065,"score_gpt":0.3014247465549687,"score_spread":0.25678495131383805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829336647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003817553,0.000987215,0.9877957,0.00015649784,0.0001872234,0.00017995278,0.00006795101,0.0022732713,0.0045346236],"genre_scores_gemma":[0.17876011,0.0017521486,0.7975456,0.00019091148,0.00030133256,0.0009179732,0.0005108691,0.00041227104,0.019608727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910897,0.0002624305,0.00007737231,0.000093022434,0.0003872041,0.00007091982],"domain_scores_gemma":[0.99942577,0.00013285848,0.00007901614,0.00014879956,0.00015456777,0.00005906162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443039,0.0005015102,0.00045585024,0.00067386514,0.0005436782,0.0011438493,0.0018037786,0.0007266177,0.00603603],"category_scores_gemma":[0.0010891769,0.00033675018,0.00046277253,0.0007016664,0.0006166947,0.002323871,0.001043548,0.0012199235,0.0027703703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006006067,0.0002918321,0.0005383152,0.0011474828,0.00013233426,0.0011907323,0.00019785718,0.057099637,0.107124664,0.27937365,0.025903396,0.52639943],"study_design_scores_gemma":[0.00026752948,0.0011494745,0.00038825523,0.00012434622,0.0002447307,0.0028040712,0.00008896535,0.5280126,0.063102394,0.08198739,0.32164374,0.0001865115],"about_ca_topic_score_codex":0.00034344385,"about_ca_topic_score_gemma":0.00046940093,"teacher_disagreement_score":0.00603603,"about_ca_system_score_codex":0.00038924394,"about_ca_system_score_gemma":0.0006686842,"threshold_uncertainty_score":0.020192564},"labels":[],"label_agreement":null},{"id":"W1843376357","doi":"10.1109/icci.1992.227649","title":"Effects of network protocols on distributed concurrency control algorithm performance","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Token ring; Computer science; Concurrency control; Ethernet; Concurrency; Distributed concurrency control; Token bus network; Token passing; Computer network; Distributed computing; Protocol (science); Security token; Non-lock concurrency control; Algorithm; Programming language","score_opus":0.0068997080832055155,"score_gpt":0.23360232846070472,"score_spread":0.22670262037749922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843376357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247838,0.0015697672,0.06189735,0.000592951,0.00019222382,0.00027547684,0.00011950185,0.0019884654,0.008580318],"genre_scores_gemma":[0.98644906,0.00024765686,0.01201141,0.00004829395,0.000026894633,0.000107751235,0.000107559244,0.00017994773,0.0008213743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98192304,0.007778525,0.001893615,0.001482378,0.005751052,0.0011713938],"domain_scores_gemma":[0.8779933,0.096009426,0.004410429,0.011162809,0.009321438,0.0011025121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015293021,0.0008881582,0.00061056786,0.0012175286,0.0011289632,0.0032205153,0.0014403722,0.0011548789,0.0022280822],"category_scores_gemma":[0.10143697,0.0007271376,0.0003908678,0.0014705033,0.0017518012,0.004898042,0.0016898884,0.0020915163,0.00044293044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011398758,0.0026831913,0.025164574,0.0011222945,0.0004888983,0.0007897341,0.0018810433,0.55833286,0.12369062,0.026741104,0.0021822297,0.24552481],"study_design_scores_gemma":[0.0005921252,0.0037146003,0.006141771,0.00014898174,0.00038355752,0.00065479084,0.0006466185,0.6876858,0.28128052,0.014615861,0.003927597,0.00020782257],"about_ca_topic_score_codex":0.0013037105,"about_ca_topic_score_gemma":0.00074402144,"teacher_disagreement_score":0.015293021,"about_ca_system_score_codex":0.0013052747,"about_ca_system_score_gemma":0.0012491506,"threshold_uncertainty_score":0.0808782},"labels":[],"label_agreement":null},{"id":"W1843409908","doi":"10.1007/978-3-642-15763-9_50","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Adversarial system; Adversary; Consensus; Value (mathematics); Process (computing); State (computer science); Logarithm; Uniform consensus; Simple (philosophy); Consensus algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Multi-agent system; Artificial intelligence; Computer security; Mathematics; Machine learning","score_opus":0.013088301947167983,"score_gpt":0.24329490561744938,"score_spread":0.2302066036702814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843409908","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011442398,0.075968266,0.22888555,0.19870315,0.25058874,0.00018075608,0.0011464771,0.0017166759,0.23136798],"genre_scores_gemma":[0.2592849,0.047865983,0.03497541,0.03056682,0.13262771,0.00027972463,0.001397226,0.0006971262,0.4923051],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992735,0.0002634151,0.000032895703,0.00014847497,0.00020322787,0.00007849656],"domain_scores_gemma":[0.99849224,0.00086718687,0.000048113936,0.00011626579,0.00030570294,0.00017048635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012910486,0.00070440664,0.0006218828,0.0005607907,0.0008548366,0.0022093314,0.0011469803,0.0031972514,0.021516336],"category_scores_gemma":[0.004709215,0.0004522016,0.00060618087,0.00095705997,0.0012169826,0.003582654,0.0008249364,0.0035362744,0.0066792816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034936308,0.00006067529,0.000106097985,0.00051353336,0.000048182475,0.00021431627,0.00014525682,0.004420604,0.002087159,0.2787995,0.6003033,0.11295202],"study_design_scores_gemma":[0.00014030084,0.00021069936,0.0002331183,0.0001613007,0.000066182845,0.0003177769,0.00010162017,0.013744835,0.0028378544,0.36171332,0.62038124,0.00009175952],"about_ca_topic_score_codex":0.0007215573,"about_ca_topic_score_gemma":0.00086431537,"teacher_disagreement_score":0.021516336,"about_ca_system_score_codex":0.0009596453,"about_ca_system_score_gemma":0.000709779,"threshold_uncertainty_score":0.071979284},"labels":[],"label_agreement":null},{"id":"W1846944684","doi":"10.1109/ccece.2004.1345259","title":"Survey of collaborative environments","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Variety (cybernetics); Scalability; Field (mathematics); Synchronization (alternating current); Quality of service; Collaborative software; Collaborative network; Set (abstract data type); Service (business); Ubiquitous computing; Data science; Multimedia; World Wide Web; Human–computer interaction; Telecommunications; Knowledge management; Database","score_opus":0.014663264724932455,"score_gpt":0.23906902988518122,"score_spread":0.22440576516024877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846944684","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006218149,0.6816165,0.063793525,0.008070497,0.002250761,0.0002483371,0.00066014205,0.00039007486,0.23675199],"genre_scores_gemma":[0.06844329,0.8204002,0.05064279,0.0032229193,0.0039187106,0.00043542724,0.0018323642,0.00018199305,0.050922412],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967056,0.00086709845,0.0003392059,0.00056043133,0.001231769,0.0002959227],"domain_scores_gemma":[0.99574125,0.0019682837,0.00035819662,0.00042627583,0.0011194857,0.00038655955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156687,0.0010033571,0.0010791057,0.006804985,0.0024443471,0.0060017835,0.0019723808,0.002761399,0.012111791],"category_scores_gemma":[0.0055361968,0.0006362194,0.00068942225,0.014548693,0.0024013927,0.009600199,0.0029359704,0.0017565164,0.0044242176],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046048994,0.00009731434,0.0016120966,0.0030045062,0.000038500184,0.00023603362,0.0013809311,0.0015704766,0.00042804962,0.36243212,0.06793141,0.5612226],"study_design_scores_gemma":[0.0000050402177,0.000038502083,0.0010213909,0.0007267853,0.000010890317,0.0009249423,0.00043399903,0.0007371885,0.00012133366,0.049872052,0.9460893,0.000018539564],"about_ca_topic_score_codex":0.0031391364,"about_ca_topic_score_gemma":0.0026988434,"teacher_disagreement_score":0.012111791,"about_ca_system_score_codex":0.0021586397,"about_ca_system_score_gemma":0.0029647634,"threshold_uncertainty_score":0.040517926},"labels":[],"label_agreement":null},{"id":"W1847035638","doi":"10.1109/ccece.1999.807216","title":"An architectural pattern for constructing nanokernels","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Architectural pattern; Timer; Software design pattern; Architectural design; Set (abstract data type); Software engineering; Computer architecture; Programming language; Architecture; Software development; Embedded system; Software; Software design","score_opus":0.015054768563992973,"score_gpt":0.262166768857619,"score_spread":0.24711200029362607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847035638","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008229952,0.00011761106,0.98460335,0.00042882015,0.00005162975,0.00018397054,0.000051299638,0.0016246231,0.00470879],"genre_scores_gemma":[0.060463484,0.00025373214,0.9308808,0.00028090435,0.000020867366,0.0004861342,0.00021106993,0.0006769947,0.0067260675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984118,0.00037858207,0.00024217076,0.0002484879,0.00055376743,0.00016510296],"domain_scores_gemma":[0.9979527,0.00043708616,0.00018531817,0.0008737944,0.00040395075,0.0001470339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021877394,0.0005925679,0.0004136399,0.0007883403,0.0011541282,0.0025529529,0.0019855506,0.0012711823,0.0025303229],"category_scores_gemma":[0.0033509824,0.0009828387,0.00079456304,0.0006628475,0.0022118324,0.0047556353,0.0024790755,0.0020260285,0.0015142434],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015848891,0.00017293179,0.0034631873,0.00047580444,0.000048556125,0.0006935622,0.0030350704,0.023791477,0.041946292,0.71551657,0.00975936,0.20093878],"study_design_scores_gemma":[0.00012401934,0.00030856417,0.0014325733,0.00032735732,0.000091082045,0.0017745435,0.0011021266,0.096687324,0.058957953,0.39977193,0.43926075,0.00016190998],"about_ca_topic_score_codex":0.0013870371,"about_ca_topic_score_gemma":0.0025391406,"teacher_disagreement_score":0.0025529529,"about_ca_system_score_codex":0.00091597415,"about_ca_system_score_gemma":0.0017249484,"threshold_uncertainty_score":0.011570036},"labels":[],"label_agreement":null},{"id":"W1848936076","doi":"10.1109/icde.1991.131474","title":"Locking granularity in multiprocessor database systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Granularity; Computer science; Multiprocessing; Lock (firearm); Database; Parallel computing; Operating system; Engineering","score_opus":0.030560279901907947,"score_gpt":0.22905684078271518,"score_spread":0.19849656088080725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848936076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80326736,0.0030826125,0.18744652,0.00041855552,0.00014264135,0.0000787307,0.00009312119,0.0015272275,0.003943146],"genre_scores_gemma":[0.9887102,0.00019884497,0.010639315,0.00003906359,0.000023387793,0.000021605001,0.0000325638,0.00004952844,0.00028561102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606043,0.0013682103,0.0002755051,0.00046048505,0.0011440669,0.00069134944],"domain_scores_gemma":[0.97542965,0.016059967,0.0024583864,0.0037769657,0.0015459403,0.0007290613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031945608,0.00043853943,0.0006150177,0.00086814974,0.000982504,0.002166971,0.0011699771,0.0007144657,0.0015549931],"category_scores_gemma":[0.019964404,0.0005872961,0.00032506496,0.0011376537,0.0012318422,0.0031292513,0.0015379047,0.0011536238,0.00025701796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041500726,0.00053215463,0.036698796,0.0006567556,0.00022071463,0.0011517562,0.0010775732,0.66758937,0.089071,0.05432987,0.0030795932,0.1414424],"study_design_scores_gemma":[0.0002572085,0.0009112257,0.005360507,0.000083805025,0.00018748437,0.0006030715,0.00053786347,0.9059196,0.04911837,0.03392057,0.003024203,0.00007599314],"about_ca_topic_score_codex":0.0007280033,"about_ca_topic_score_gemma":0.0007681484,"teacher_disagreement_score":0.0031945608,"about_ca_system_score_codex":0.000967887,"about_ca_system_score_gemma":0.0007554146,"threshold_uncertainty_score":0.016894639},"labels":[],"label_agreement":null},{"id":"W1855233090","doi":"10.1109/pacrim.1993.407171","title":"Implementing halt on failure processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Fault tolerance; Masking (illustration); Node (physics); Limit (mathematics); Virtual machine; Embedded system; Operating system; Engineering","score_opus":0.019085256820277733,"score_gpt":0.2349749292081962,"score_spread":0.21588967238791848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855233090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07227065,0.00031515482,0.90694636,0.0005043501,0.00017132766,0.00015019071,0.000066593486,0.012974114,0.006601296],"genre_scores_gemma":[0.6570633,0.0002752178,0.33059365,0.00035958315,0.00008293914,0.00029350686,0.00027684716,0.0008635327,0.010191411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975255,0.000831461,0.00012722044,0.00033843226,0.0007177047,0.00045973418],"domain_scores_gemma":[0.9937447,0.00235021,0.00039011613,0.0022305804,0.0009535886,0.0003308652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021170145,0.00079673604,0.0009907972,0.0004926494,0.000933783,0.0025420273,0.0030400108,0.0014724524,0.005155924],"category_scores_gemma":[0.007887006,0.00056266435,0.0007021791,0.0003447715,0.002075324,0.0035064113,0.0038276534,0.0019990697,0.0016404634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053579933,0.00060393655,0.009363038,0.00069006457,0.00030281974,0.0032038388,0.0028411183,0.32159877,0.06733754,0.15876986,0.021293456,0.40863755],"study_design_scores_gemma":[0.00032120946,0.0009080181,0.0005722973,0.000057029094,0.00009480864,0.000514156,0.0003318976,0.82368517,0.08065832,0.06877853,0.023987936,0.00009060519],"about_ca_topic_score_codex":0.002001397,"about_ca_topic_score_gemma":0.0016171372,"teacher_disagreement_score":0.005155924,"about_ca_system_score_codex":0.00060915685,"about_ca_system_score_gemma":0.0010881185,"threshold_uncertainty_score":0.017248273},"labels":[],"label_agreement":null},{"id":"W1859609600","doi":"10.1007/978-3-642-02843-4_13","title":"Answering Multiple-Item Queries in Data Broadcast Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.03054351647770143,"score_gpt":0.2582071972749866,"score_spread":0.22766368079728516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859609600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073631234,0.0037259073,0.9109717,0.0019491218,0.0002816467,0.0002182945,0.0005992497,0.003252335,0.0053705256],"genre_scores_gemma":[0.618796,0.0021140608,0.35675898,0.0004388284,0.0007943765,0.00032911223,0.0022558456,0.00049960567,0.018013123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958106,0.0013769201,0.0003399185,0.0005472567,0.0014575317,0.00046786494],"domain_scores_gemma":[0.9874538,0.009762516,0.0002526934,0.0014254327,0.0008607275,0.0002447659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037571962,0.0007119671,0.0031679042,0.0011478126,0.0017350602,0.004091939,0.003120778,0.0027164887,0.0046492764],"category_scores_gemma":[0.013753822,0.0011193708,0.00088265183,0.0027332988,0.0013201878,0.0061783716,0.0023229911,0.0027546934,0.0013331891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024876893,0.0006661199,0.0053766174,0.0013055217,0.00024076698,0.0005448302,0.0022038128,0.2726161,0.014621093,0.15817028,0.04081707,0.5009502],"study_design_scores_gemma":[0.00010903108,0.00008555483,0.0004205636,0.000030884712,0.00006366924,0.00019080882,0.000365985,0.85484546,0.0049598236,0.13301301,0.0058879564,0.000027243008],"about_ca_topic_score_codex":0.004777779,"about_ca_topic_score_gemma":0.0043914733,"teacher_disagreement_score":0.004777779,"about_ca_system_score_codex":0.0016283528,"about_ca_system_score_gemma":0.0013071339,"threshold_uncertainty_score":0.019870162},"labels":[],"label_agreement":null},{"id":"W1861651162","doi":"10.1007/978-3-319-18173-8_6","title":"Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Interval (graph theory); Sequence (biology); Discrete mathematics; Intersection (aeronautics); Mathematics; Indifference graph; Interval graph; Chordal graph; Computer science; Graph; 1-planar graph","score_opus":0.02732113612990234,"score_gpt":0.26428183474072364,"score_spread":0.2369606986108213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861651162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44495583,0.00050093664,0.5226294,0.0015834856,0.00032338983,0.00037713393,0.001568427,0.007659264,0.02040207],"genre_scores_gemma":[0.85482675,0.00017069202,0.13799559,0.0002894233,0.00007641716,0.00014102648,0.0021036405,0.00068847666,0.003708011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.00039215767,0.00007917955,0.00042457468,0.00040382202,0.00023753286],"domain_scores_gemma":[0.986061,0.010473484,0.0006312194,0.0016355684,0.00076222926,0.00043660184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232589,0.0011150207,0.0009051249,0.00087431935,0.00064405805,0.0016486973,0.0032857491,0.0013222654,0.007579637],"category_scores_gemma":[0.010719668,0.00061416253,0.0011933816,0.00090913783,0.0010993452,0.0038842552,0.0022207196,0.0015238181,0.0008630382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019086405,0.00058438577,0.0067063095,0.00090756913,0.00023266295,0.0008016671,0.00040873417,0.61777127,0.038766246,0.055958565,0.019621585,0.25633237],"study_design_scores_gemma":[0.00015196744,0.0003474478,0.0006554712,0.00004667863,0.00006554727,0.00024315661,0.00019461267,0.87163943,0.014898948,0.109570675,0.0021590865,0.000026992702],"about_ca_topic_score_codex":0.003080668,"about_ca_topic_score_gemma":0.0033158327,"teacher_disagreement_score":0.007579637,"about_ca_system_score_codex":0.0010792506,"about_ca_system_score_gemma":0.0012039755,"threshold_uncertainty_score":0.025356352},"labels":[],"label_agreement":null},{"id":"W1861659989","doi":"10.1007/978-0-387-30162-4_380","title":"Snapshots in Shared Memory","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Psychology","score_opus":0.01438385155006809,"score_gpt":0.22434665111307106,"score_spread":0.20996279956300298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861659989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009165433,0.06025815,0.52810246,0.002371446,0.0035451564,0.00012267406,0.0009975951,0.008589497,0.3868475],"genre_scores_gemma":[0.1821574,0.04584484,0.2541706,0.00089861266,0.0019744523,0.00026169705,0.0034775904,0.003039086,0.50817573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966824,0.00006439291,0.00002574394,0.00006773982,0.00014134438,0.00003251708],"domain_scores_gemma":[0.9996123,0.00011280002,0.00001994486,0.00016256918,0.00006316414,0.000029308743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029743055,0.0006439614,0.0007793731,0.0009113754,0.0006623375,0.003039073,0.0010815957,0.0006869484,0.027957547],"category_scores_gemma":[0.0013992704,0.0005732275,0.00032977242,0.0022884367,0.00090464536,0.0042412286,0.0016694862,0.0014423577,0.009554936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055547855,0.000028756433,0.00020241662,0.00028841503,0.000017031238,0.00009650326,0.00027909875,0.004995802,0.0013219919,0.5132705,0.090267904,0.38917607],"study_design_scores_gemma":[0.00001917613,0.000030332985,0.00030755912,0.00021951547,0.000024236577,0.00042117137,0.000111910296,0.01657633,0.0025047006,0.45754975,0.5222112,0.000024074767],"about_ca_topic_score_codex":0.0010282173,"about_ca_topic_score_gemma":0.0013665044,"teacher_disagreement_score":0.027957547,"about_ca_system_score_codex":0.00063565664,"about_ca_system_score_gemma":0.00062233576,"threshold_uncertainty_score":0.09352738},"labels":[],"label_agreement":null},{"id":"W1861862848","doi":"10.1007/11561927_14","title":"Time and Space Lower Bounds for Implementations Using k-CAS","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Implementation; Upper and lower bounds; Queue; Binary logarithm; Priority queue; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.022031467034643537,"score_gpt":0.2870211703615573,"score_spread":0.26498970332691374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861862848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08750116,0.010400932,0.704492,0.0069839307,0.0019178906,0.0006750437,0.00202661,0.01401206,0.17199038],"genre_scores_gemma":[0.57211506,0.004150231,0.36111718,0.002044931,0.0016153604,0.0015090028,0.0027449853,0.005812193,0.04889102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.979871,0.0034361372,0.0014372084,0.0021634165,0.0067688148,0.0063234274],"domain_scores_gemma":[0.9249548,0.046292115,0.0027745331,0.018372996,0.0051021106,0.0025034905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008406143,0.00524267,0.0049075778,0.005039708,0.004847047,0.016864423,0.010232257,0.0055546323,0.046068445],"category_scores_gemma":[0.046841316,0.0024047764,0.0043348633,0.008193035,0.0054233284,0.025123201,0.010359143,0.010432255,0.010835015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005250181,0.0008312156,0.0020818375,0.0020613484,0.0003746621,0.00021569694,0.00075575965,0.19338329,0.01437278,0.5037296,0.056582436,0.22036129],"study_design_scores_gemma":[0.00031452996,0.00035470387,0.00057492807,0.00043017024,0.00048419525,0.0003659749,0.00042934748,0.5103123,0.013991997,0.45865124,0.013921745,0.00016886322],"about_ca_topic_score_codex":0.004708875,"about_ca_topic_score_gemma":0.011822577,"teacher_disagreement_score":0.046068445,"about_ca_system_score_codex":0.00861058,"about_ca_system_score_gemma":0.012054682,"threshold_uncertainty_score":0.15411437},"labels":[],"label_agreement":null},{"id":"W1861900966","doi":"10.1109/hicss.1998.649226","title":"Concurrency control of large unstructured data","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency control; Concurrency; Granularity; Non-lock concurrency control; Distributed computing; Optimistic concurrency control; Distributed concurrency control; Database; Database transaction; Programming language","score_opus":0.030680998555757445,"score_gpt":0.2620945006292671,"score_spread":0.23141350207350964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861900966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06867438,0.001324573,0.9221785,0.00061344757,0.00013358807,0.00015181358,0.000076710974,0.0012941891,0.0055527133],"genre_scores_gemma":[0.89419043,0.00053327775,0.1011772,0.00016263455,0.00015257615,0.00025760525,0.00017963706,0.00016593636,0.0031807246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943883,0.0013328494,0.00044114998,0.0008361829,0.0024275214,0.0005739606],"domain_scores_gemma":[0.9873166,0.0066282605,0.0009747512,0.0029504327,0.0015469213,0.0005830211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005418372,0.00044130255,0.0008425536,0.0011383318,0.0012824037,0.0041473364,0.0021022663,0.00047757925,0.0012494493],"category_scores_gemma":[0.0143195,0.00052779855,0.00054740073,0.0011888054,0.0035732395,0.0032831111,0.0037884184,0.0015441049,0.0002071767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006965328,0.00014806198,0.006353451,0.00041395403,0.00009412443,0.00070905953,0.0018999166,0.16624269,0.03009131,0.6593443,0.004147588,0.12985909],"study_design_scores_gemma":[0.00014710076,0.000084223495,0.00050992065,0.00003699109,0.000037344125,0.00014912074,0.00014748127,0.6812755,0.013772322,0.2931177,0.010681365,0.000040871746],"about_ca_topic_score_codex":0.0034568252,"about_ca_topic_score_gemma":0.002650246,"teacher_disagreement_score":0.005418372,"about_ca_system_score_codex":0.001564067,"about_ca_system_score_gemma":0.0024135755,"threshold_uncertainty_score":0.02865547},"labels":[],"label_agreement":null},{"id":"W1865269592","doi":"10.1007/3-540-36108-1_7","title":"Transformations of Self-Stabilizing Algorithms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Transformation (genetics); Self-stabilization; Bounded function; Algorithm; Class (philosophy); Security token; Theoretical computer science; Parallel computing; Distributed algorithm; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.016522905735754625,"score_gpt":0.23303585900886817,"score_spread":0.21651295327311354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865269592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0476123,0.00038881795,0.8658457,0.00025631802,0.00027561845,0.000112954476,0.00011761962,0.0017737749,0.08361682],"genre_scores_gemma":[0.8024027,0.000669482,0.13433161,0.00021540596,0.00020414368,0.00022623425,0.00034805518,0.00082633423,0.060776073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968505,0.000078197976,0.000016811333,0.000053135558,0.00013100432,0.000035888057],"domain_scores_gemma":[0.99957675,0.00014147708,0.000037172842,0.0001304548,0.00008439254,0.000029805053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620871,0.00043970734,0.00033475502,0.00058898615,0.00044719368,0.00086450856,0.00054585066,0.00036524844,0.009100685],"category_scores_gemma":[0.0012811542,0.00023991754,0.00044619114,0.00048528326,0.0007029143,0.0010816277,0.00096982345,0.0011024195,0.0017862857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095644,0.000077811135,0.0001469974,0.00006523586,0.000015932172,0.00006346637,0.00019152905,0.035835527,0.011413862,0.79663074,0.004503037,0.15096031],"study_design_scores_gemma":[0.000047956397,0.000107280925,0.00016936687,0.000017438166,0.000012540491,0.00012982181,0.000049780807,0.18468297,0.011669866,0.78627616,0.016823223,0.000013598535],"about_ca_topic_score_codex":0.00029869168,"about_ca_topic_score_gemma":0.00027127148,"teacher_disagreement_score":0.009100685,"about_ca_system_score_codex":0.00034595004,"about_ca_system_score_gemma":0.00029249533,"threshold_uncertainty_score":0.0304448},"labels":[],"label_agreement":null},{"id":"W1872117385","doi":"10.1007/978-3-642-10877-8_11","title":"The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Message passing; Task (project management); Set (abstract data type); Theoretical computer science; Distributed computing; Programming language","score_opus":0.009171732976890133,"score_gpt":0.23493539508187028,"score_spread":0.22576366210498014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872117385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09024826,0.0025385031,0.89453894,0.001832766,0.00032776524,0.00012212258,0.00047796965,0.00096144463,0.008952296],"genre_scores_gemma":[0.7004055,0.0012600463,0.29133317,0.0001904195,0.00053583895,0.00031897888,0.00065535627,0.0006401744,0.0046605207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975108,0.0007452319,0.00024836624,0.00037435285,0.0008818028,0.00023938232],"domain_scores_gemma":[0.97855854,0.016727757,0.0009842089,0.0019996907,0.0010847667,0.0006450502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032961299,0.0012172207,0.0021574723,0.0016865475,0.0010889993,0.0029077178,0.0031061808,0.0022414844,0.0033271967],"category_scores_gemma":[0.028561914,0.0010259354,0.0010974726,0.0018157485,0.002167258,0.007033102,0.0019672746,0.0039886776,0.0004508624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032734412,0.00026633288,0.0012974924,0.0013410227,0.00013568535,0.00015424019,0.00096250925,0.29891005,0.012180951,0.3834805,0.010510791,0.28748697],"study_design_scores_gemma":[0.00010553583,0.00024596014,0.0006248851,0.00008938671,0.00006144741,0.0000811951,0.00007154858,0.47719425,0.0047775134,0.51498365,0.0017268931,0.0000377642],"about_ca_topic_score_codex":0.0006863866,"about_ca_topic_score_gemma":0.0008334578,"teacher_disagreement_score":0.0033271967,"about_ca_system_score_codex":0.0014253611,"about_ca_system_score_gemma":0.0017971984,"threshold_uncertainty_score":0.017431855},"labels":[],"label_agreement":null},{"id":"W187528409","doi":"","title":"Contamination and Decontamination in Majority-Based Systems","year":2009,"lang":"en","type":"article","venue":"Journal of cellular automata","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Human decontamination; Computer science; Contamination; Process (computing); Voting; Reliability (semiconductor); Node (physics); Variety (cybernetics); Field (mathematics); Computer security; Distributed computing; Waste management; Engineering; Artificial intelligence; Mathematics","score_opus":0.006244358623837383,"score_gpt":0.2213205229623176,"score_spread":0.21507616433848023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187528409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18480483,0.004578783,0.7869448,0.001840509,0.00028964807,0.000140182,0.000088930465,0.00046576952,0.02084657],"genre_scores_gemma":[0.97473407,0.0011198878,0.01942709,0.00022795032,0.0001317652,0.00007273817,0.00006554427,0.00004941388,0.004171482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661237,0.0010640053,0.00019334871,0.00055048993,0.0011465955,0.00043318406],"domain_scores_gemma":[0.9912282,0.0045583295,0.0013527747,0.0013777288,0.0011464892,0.00033644252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833367,0.00069472345,0.001356622,0.00090903,0.0014127399,0.0028595917,0.0013551512,0.0022921544,0.0020130102],"category_scores_gemma":[0.012952683,0.00046343732,0.0011205241,0.00084192527,0.004165253,0.0037826875,0.0037006172,0.0019242056,0.00048244806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030758046,0.00010429081,0.0044586277,0.0005053356,0.00011304575,0.0012242007,0.0018550874,0.2284906,0.014990234,0.68736345,0.002069452,0.058518175],"study_design_scores_gemma":[0.000055792,0.00023443095,0.0009286977,0.00008834655,0.000058861653,0.000507104,0.00029847815,0.51645994,0.010469546,0.4612939,0.009538189,0.00006672074],"about_ca_topic_score_codex":0.0009855288,"about_ca_topic_score_gemma":0.00036275294,"teacher_disagreement_score":0.0028595917,"about_ca_system_score_codex":0.0010446745,"about_ca_system_score_gemma":0.00076241954,"threshold_uncertainty_score":0.009695888},"labels":[],"label_agreement":null},{"id":"W1876602362","doi":"10.1007/3-540-45156-0_16","title":"Shared Memory Contention and Its Impact on Multiprocessor Call Control Throughput","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Throughput; Parallel computing; Multiprocessing; Shared memory; Uniform memory access; Distributed computing; Memory management; Operating system; Semiconductor memory","score_opus":0.017673387639066614,"score_gpt":0.26728081795809905,"score_spread":0.24960743031903243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876602362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97682106,0.0028019662,0.009111543,0.0006076338,0.00013031228,0.000011215268,0.00017430232,0.00045574445,0.009886205],"genre_scores_gemma":[0.9985172,0.00014929852,0.00039928893,0.000013686475,0.000027617345,0.0000052607184,0.00003061063,0.000043269632,0.0008136965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881893,0.00029520874,0.000036082063,0.0001263702,0.00037390125,0.00034947484],"domain_scores_gemma":[0.97876906,0.018223165,0.00075203,0.00090494606,0.0009076783,0.00044320358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379354,0.00036769398,0.00051318354,0.0009081487,0.0007554769,0.0018782145,0.0009817769,0.0009239136,0.0060997386],"category_scores_gemma":[0.017064326,0.0005873333,0.00029199966,0.0018416703,0.00074806466,0.0020689021,0.00087375555,0.0013173122,0.0005929241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009594575,0.0013053506,0.057212286,0.0003472564,0.00036459343,0.0017573488,0.0013044459,0.5086799,0.16224436,0.041265845,0.008206295,0.20771766],"study_design_scores_gemma":[0.00017323396,0.0009091087,0.03909072,0.000036788544,0.00033428584,0.0007131234,0.00050699536,0.85970443,0.0813089,0.015121686,0.001998431,0.00010231268],"about_ca_topic_score_codex":0.0018155886,"about_ca_topic_score_gemma":0.0020906057,"teacher_disagreement_score":0.0060997386,"about_ca_system_score_codex":0.0011766887,"about_ca_system_score_gemma":0.00083221984,"threshold_uncertainty_score":0.02040565},"labels":[],"label_agreement":null},{"id":"W1880038188","doi":"10.1007/978-0-387-09699-5_13","title":"An Integrity Lock Architecture for Supporting Distributed Authorizations in Database Federations","year":2008,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data integrity; Lock (firearm); Database; Architecture; Authorization; Distributed database; Database server; Enterprise information security architecture; Access control; Distributed computing; Computer security; Engineering","score_opus":0.029615514831831818,"score_gpt":0.30866940857935204,"score_spread":0.2790538937475202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880038188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011188198,0.001276331,0.9673322,0.00084308535,0.00036698752,0.00022672645,0.000115056835,0.00639666,0.01225476],"genre_scores_gemma":[0.2622461,0.0015130128,0.69604445,0.0005491394,0.00029162166,0.00049733825,0.000680489,0.00090939255,0.037268527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985191,0.00028975692,0.0001853219,0.00017093898,0.000545039,0.00028981495],"domain_scores_gemma":[0.9979164,0.00046177866,0.000112187605,0.00091690297,0.00040932084,0.00018336329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036799614,0.0004077752,0.0007738435,0.0009283159,0.0020766133,0.0053704535,0.0034545066,0.0018382655,0.0059248568],"category_scores_gemma":[0.0041538724,0.0009744861,0.00061656715,0.0014911729,0.0018896511,0.0075319093,0.00363898,0.0035264217,0.001664043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047451028,0.00029416184,0.0010433758,0.000362516,0.00008138145,0.00027466426,0.0013483845,0.02133461,0.016914258,0.5989876,0.035557445,0.32332706],"study_design_scores_gemma":[0.00025755272,0.0003447593,0.0008132286,0.0002532518,0.00023024056,0.0006344735,0.0005241388,0.34819794,0.04245955,0.34805956,0.25804114,0.00018413413],"about_ca_topic_score_codex":0.0028921238,"about_ca_topic_score_gemma":0.0041044406,"teacher_disagreement_score":0.0059248568,"about_ca_system_score_codex":0.001443791,"about_ca_system_score_gemma":0.0023521506,"threshold_uncertainty_score":0.019820571},"labels":[],"label_agreement":null},{"id":"W1884554866","doi":"10.1109/ftcs.1990.89343","title":"A fault-tolerant strategy for hierarchical control in distributed computing systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Arbiter; Fault tolerance; Computer science; Overhead (engineering); Distributed computing; Reliability (semiconductor); Exploit; Control (management); Feature (linguistics); Computer network; Artificial intelligence; Operating system; Computer security","score_opus":0.029068389532719754,"score_gpt":0.2563741578437571,"score_spread":0.22730576831103735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884554866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006616451,0.00034757136,0.9827483,0.00040172596,0.00007889798,0.00007333601,0.000020151407,0.00046165253,0.009251975],"genre_scores_gemma":[0.60827726,0.0005642276,0.3765771,0.00034678043,0.0001523206,0.00030007155,0.00008166472,0.00008463523,0.013615927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996184,0.00008692258,0.000023324763,0.000049598366,0.00017538694,0.000046245794],"domain_scores_gemma":[0.99979204,0.00006917633,0.000020651358,0.0000419462,0.000050066858,0.00002618795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748439,0.0004987362,0.00028018453,0.0004284414,0.00064974185,0.0009374347,0.000807539,0.00067673455,0.0034603209],"category_scores_gemma":[0.00096631,0.00013710615,0.00024638715,0.000364642,0.0009408125,0.0011324583,0.0008301384,0.0006945497,0.00051818613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107908614,0.00007720188,0.00020319612,0.00018862146,0.000029059694,0.00027459758,0.0005475058,0.14501515,0.016445342,0.6473206,0.0072255223,0.18256527],"study_design_scores_gemma":[0.000073116986,0.00018117971,0.00013082157,0.000038935188,0.000018622963,0.0001380492,0.000089558926,0.7669812,0.006817977,0.18665536,0.03885167,0.000023493052],"about_ca_topic_score_codex":0.0015039309,"about_ca_topic_score_gemma":0.001663701,"teacher_disagreement_score":0.0034603209,"about_ca_system_score_codex":0.0008135263,"about_ca_system_score_gemma":0.0006714544,"threshold_uncertainty_score":0.011575937},"labels":[],"label_agreement":null},{"id":"W1922602005","doi":"","title":"SatelliteLab: Adding Heterogeneity to Planetary-Scale Testbeds","year":2008,"lang":"en","type":"article","venue":"Max Planck Digital Library","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Computer science; Testbed; Computer network; The Internet; Enhanced Data Rates for GSM Evolution; Distributed computing; Telecommunications; Operating system","score_opus":0.013419033354520342,"score_gpt":0.1904514847334615,"score_spread":0.17703245137894114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922602005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43046802,0.0005939624,0.52663827,0.00084378256,0.00033711767,0.0012452918,0.00068824063,0.027368689,0.011816691],"genre_scores_gemma":[0.7934599,0.00024293184,0.2016758,0.00017592731,0.000073899144,0.0006916651,0.0012949953,0.0010495501,0.0013353011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958753,0.001832321,0.00028918462,0.00041819128,0.0011909661,0.0003940919],"domain_scores_gemma":[0.98969495,0.0030883192,0.00086830364,0.0040624896,0.0010995172,0.0011863692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005832234,0.00053368165,0.00052821473,0.000865981,0.0006154722,0.0013354562,0.002700208,0.00047364997,0.0014100845],"category_scores_gemma":[0.011764419,0.00053558935,0.00040521804,0.0007098466,0.0010843803,0.0025379597,0.002656721,0.0011559481,0.00036306152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002982352,0.0017827449,0.05324214,0.0011191096,0.000549237,0.002115817,0.0018146728,0.40796202,0.1618466,0.069654755,0.03171583,0.2652148],"study_design_scores_gemma":[0.0007390156,0.0025472404,0.013961254,0.00015895537,0.00021762955,0.00084404025,0.0005737131,0.81789064,0.0708898,0.017923698,0.0740939,0.00016009365],"about_ca_topic_score_codex":0.0015620117,"about_ca_topic_score_gemma":0.0014658127,"teacher_disagreement_score":0.005832234,"about_ca_system_score_codex":0.0010162595,"about_ca_system_score_gemma":0.00087222084,"threshold_uncertainty_score":0.030844212},"labels":[],"label_agreement":null},{"id":"W1923099297","doi":"","title":"Partitioning applications for hybrid and federated clouds","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Cloud computing; Implementation; Data center; Java; Database; Sample (material); Software; Server; Code (set theory); Service provider; Computer security; Operating system; Service (business); Software engineering; Business","score_opus":0.01793094981857312,"score_gpt":0.25988301582223144,"score_spread":0.24195206600365832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923099297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35085732,0.0005593149,0.63413185,0.00038082717,0.000097133016,0.0003059078,0.0001380707,0.008135078,0.005394619],"genre_scores_gemma":[0.71931934,0.00012780131,0.27745163,0.00009144851,0.000016228785,0.00010490245,0.00018982992,0.0004228244,0.002276057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884254,0.00028014294,0.000105151434,0.00017777157,0.00036536588,0.0002291389],"domain_scores_gemma":[0.99818987,0.0004909562,0.00011335483,0.0006807163,0.00034476895,0.00018028982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564749,0.00062726997,0.00041489355,0.0005880665,0.0010207351,0.0019121278,0.0018107565,0.0010076775,0.0013861583],"category_scores_gemma":[0.0029251,0.0004781172,0.00050259463,0.0007172156,0.0007726416,0.0020654986,0.002450889,0.0007998469,0.00043163152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021459854,0.00078457285,0.017711472,0.0005448662,0.00025036943,0.0021093276,0.0032877973,0.35083506,0.15902598,0.058726415,0.010539867,0.39403826],"study_design_scores_gemma":[0.00014217403,0.00016176891,0.003991573,0.000063618005,0.00006653047,0.0006046561,0.00058495917,0.9014185,0.047157213,0.026710743,0.0190256,0.000072595445],"about_ca_topic_score_codex":0.003988435,"about_ca_topic_score_gemma":0.0052324664,"teacher_disagreement_score":0.003988435,"about_ca_system_score_codex":0.0012222182,"about_ca_system_score_gemma":0.0008930929,"threshold_uncertainty_score":0.008867919},"labels":[],"label_agreement":null},{"id":"W193386108","doi":"","title":"Adaptive space-time sharing with SCOJO.","year":2004,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Space (punctuation)","score_opus":0.013471589623921447,"score_gpt":0.19069535154357758,"score_spread":0.17722376191965614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193386108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095441855,0.000859647,0.8844406,0.0002468072,0.00035270336,0.0002441569,0.00022634074,0.004260944,0.013926833],"genre_scores_gemma":[0.74894047,0.0002854454,0.24383965,0.00021622813,0.00007993044,0.00021181407,0.00030316034,0.0003758469,0.0057474915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956673,0.00007790588,0.000025813282,0.0000832899,0.00016532138,0.0000809784],"domain_scores_gemma":[0.99920565,0.00016853932,0.00009694204,0.0002855362,0.0001251611,0.000118151125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054237235,0.00046269796,0.00034087867,0.0003984916,0.0004999292,0.00082637457,0.001144711,0.0003552518,0.0017874509],"category_scores_gemma":[0.0011204157,0.00018622505,0.00043099135,0.00076816115,0.00061444147,0.00077945925,0.0012208999,0.00075169664,0.00042283625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016470721,0.00056346867,0.00648332,0.0005716724,0.00020317134,0.00049240206,0.0006183321,0.4322449,0.14287156,0.09238097,0.012818979,0.30910423],"study_design_scores_gemma":[0.0001454159,0.00041498998,0.001378789,0.0000242009,0.00006914304,0.0003168482,0.00010377955,0.8779941,0.042936094,0.029102514,0.04745353,0.000060564336],"about_ca_topic_score_codex":0.001298264,"about_ca_topic_score_gemma":0.0015624245,"teacher_disagreement_score":0.0017874509,"about_ca_system_score_codex":0.0004268106,"about_ca_system_score_gemma":0.000970724,"threshold_uncertainty_score":0.005979657},"labels":[],"label_agreement":null},{"id":"W194050023","doi":"10.1007/978-3-540-87779-0_7","title":"Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Theoretical computer science; Algorithm; Closing (real estate); Shared memory; Parallel computing; Computer network; Artificial intelligence","score_opus":0.050233849505739434,"score_gpt":0.2678825908409869,"score_spread":0.21764874133524748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194050023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05596746,0.0053599956,0.8333466,0.013685961,0.0010333111,0.000107750624,0.00021468596,0.001000591,0.08928353],"genre_scores_gemma":[0.7539886,0.0038023654,0.21282338,0.0018161733,0.0020927126,0.00029061525,0.00035267792,0.0006118689,0.024221614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961326,0.0008641151,0.00012034962,0.00040679137,0.0020676842,0.00040854904],"domain_scores_gemma":[0.98613095,0.010046301,0.00038599357,0.0023436625,0.0007654019,0.000327748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431593,0.0006837008,0.0011953999,0.00084417337,0.0020643028,0.004174502,0.0022805454,0.002148942,0.006995394],"category_scores_gemma":[0.013781917,0.0006558316,0.0010889781,0.0015838087,0.004424283,0.016543258,0.0049418807,0.0060777497,0.0009239185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012461537,0.000037589176,0.00017976166,0.00011442768,0.000016027698,0.000051860352,0.00028550057,0.013043961,0.0008779267,0.9388084,0.004536426,0.041923612],"study_design_scores_gemma":[0.000021847916,0.000019585988,0.00013875672,0.000029618866,0.000010989804,0.00010944511,0.000060077044,0.045550097,0.0011187381,0.9372049,0.015718818,0.0000171396],"about_ca_topic_score_codex":0.002869361,"about_ca_topic_score_gemma":0.002034632,"teacher_disagreement_score":0.006995394,"about_ca_system_score_codex":0.0033109372,"about_ca_system_score_gemma":0.0028248513,"threshold_uncertainty_score":0.024022639},"labels":[],"label_agreement":null},{"id":"W1940937474","doi":"10.1109/mrd.1990.138262","title":"An analysis of replication strategies for X.500-like distributed directories","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Replication (statistics); Computer science; Context (archaeology); Information retrieval; World Wide Web; Biology; Mathematics; Statistics","score_opus":0.026351185253428513,"score_gpt":0.28214417125996333,"score_spread":0.25579298600653483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940937474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54067886,0.0029965523,0.39620188,0.0015172014,0.000103730104,0.00073919573,0.000427541,0.0014034375,0.055931553],"genre_scores_gemma":[0.9201817,0.000559302,0.069719866,0.00012577139,0.000042267657,0.0002235767,0.000267282,0.0002172196,0.008662941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652547,0.0012837286,0.00020915145,0.0003634613,0.0011020877,0.0005160258],"domain_scores_gemma":[0.9810619,0.010893084,0.0020399508,0.0023780467,0.0030394683,0.0005874991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048173065,0.0004405252,0.00055811385,0.0013957104,0.0011892999,0.0028745637,0.0017337244,0.0012879194,0.004788636],"category_scores_gemma":[0.024977852,0.0004335284,0.00054949516,0.0013981536,0.0010905234,0.0039739795,0.000963132,0.0007742377,0.0006915804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074341503,0.00043316724,0.010571778,0.0003935044,0.00014522375,0.00032177076,0.0011514496,0.2916403,0.016024997,0.5115873,0.010271299,0.1567157],"study_design_scores_gemma":[0.00011771395,0.0003441768,0.004046063,0.000073579744,0.00009793185,0.00056894496,0.0008055582,0.89536446,0.0065554,0.08076634,0.011200352,0.000059507533],"about_ca_topic_score_codex":0.0031608006,"about_ca_topic_score_gemma":0.0026409808,"teacher_disagreement_score":0.0048173065,"about_ca_system_score_codex":0.0031009289,"about_ca_system_score_gemma":0.001602568,"threshold_uncertainty_score":0.025476635},"labels":[],"label_agreement":null},{"id":"W1946130928","doi":"10.1109/icde.1992.213161","title":"Transactions in distributed shared memory systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Computer science; Distributed shared memory; Concurrency; Shared memory; Virtual memory; Concurrency control; Address space; Distributed computing; Database transaction; Set (abstract data type); Memory model; Memory management; Architecture; Parallel computing; Theoretical computer science; Programming language; Operating system; Uniform memory access; Overlay","score_opus":0.014645131039314217,"score_gpt":0.2267045534102382,"score_spread":0.21205942237092398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946130928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017020956,0.03560173,0.8920318,0.005798939,0.0034645943,0.0005055241,0.00038149426,0.0015567748,0.043638114],"genre_scores_gemma":[0.49264175,0.028318226,0.40597874,0.0020674032,0.0042309538,0.0014419429,0.0013550967,0.00060596276,0.063359864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579704,0.001480285,0.00054612494,0.00047804284,0.0013845068,0.00031396552],"domain_scores_gemma":[0.996811,0.001425679,0.00021339019,0.00075288414,0.00054262765,0.00025445374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031532147,0.0010486031,0.0014179439,0.0010375767,0.0017969282,0.005724069,0.0019630503,0.0027031833,0.006075742],"category_scores_gemma":[0.007143269,0.0010247657,0.000875275,0.0024593205,0.003017014,0.007039072,0.003129006,0.003434371,0.0024953564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115311974,0.0000549094,0.000453099,0.00038179508,0.000044462067,0.00050464744,0.0009859531,0.015094306,0.0014910316,0.914906,0.01518899,0.050779596],"study_design_scores_gemma":[0.00014106437,0.00011470672,0.00015798566,0.00019475333,0.000055754783,0.0006342792,0.0003283505,0.0572608,0.002085532,0.7281761,0.2108018,0.000048814276],"about_ca_topic_score_codex":0.0017599864,"about_ca_topic_score_gemma":0.0011595594,"teacher_disagreement_score":0.006075742,"about_ca_system_score_codex":0.0015365331,"about_ca_system_score_gemma":0.002111173,"threshold_uncertainty_score":0.020325363},"labels":[],"label_agreement":null},{"id":"W1956602043","doi":"10.1109/cds.1998.675769","title":"Dynamic service reconfiguration and migration in the Kea kernel","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Control reconfiguration; Kernel (algebra); Reconfigurability; Domain (mathematical analysis); Distributed computing; Service (business); Debugging; Structuring; Modular design; Hierarchy; Layering; Software engineering; Operating system; Embedded system","score_opus":0.015488991025304107,"score_gpt":0.21856684169373727,"score_spread":0.20307785066843317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956602043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6187771,0.00062574825,0.3513693,0.000537732,0.00020341438,0.00019119239,0.00011129384,0.015192353,0.012991816],"genre_scores_gemma":[0.9256017,0.00011313777,0.0703791,0.00007923608,0.000017402039,0.00007912673,0.00009371394,0.0003369676,0.003299596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00022104428,0.00012627002,0.00023306462,0.0003296381,0.00021931823],"domain_scores_gemma":[0.99693584,0.0006411334,0.00025477802,0.0014648759,0.00038608068,0.0003171925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012047723,0.00034419054,0.0005130258,0.0005556835,0.0011665579,0.0021666216,0.0015086656,0.000986347,0.0012229122],"category_scores_gemma":[0.004739652,0.00053150865,0.00047230916,0.00054200925,0.0012070409,0.0028130354,0.0019066418,0.001324654,0.00067596167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003639971,0.0013193786,0.037356183,0.00035237137,0.0002059352,0.002155136,0.0033608894,0.24008696,0.24780095,0.1098528,0.010985966,0.3428835],"study_design_scores_gemma":[0.00020255672,0.00033473474,0.0058673723,0.00003254889,0.000083688305,0.0015465855,0.00033350618,0.8645958,0.07805107,0.025782166,0.023060134,0.0001098982],"about_ca_topic_score_codex":0.001847114,"about_ca_topic_score_gemma":0.0011863196,"teacher_disagreement_score":0.0021666216,"about_ca_system_score_codex":0.0010817029,"about_ca_system_score_gemma":0.0011448228,"threshold_uncertainty_score":0.007848382},"labels":[],"label_agreement":null},{"id":"W1963743620","doi":"10.1016/j.tcs.2013.01.024","title":"Correctness of concurrent executions of closed nested transactions in transactional memory systems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Nested transaction; Software transactional memory; Correctness; Database transaction; Transactional memory; Consistency (knowledge bases); Class (philosophy); Serialization; Transaction processing; Distributed transaction; Programming language; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.00876243527131157,"score_gpt":0.2329234691236317,"score_spread":0.22416103385232014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963743620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5673805,0.0008021979,0.42300755,0.00091591425,0.00020051544,0.00015376692,0.0002174087,0.0015025943,0.005819494],"genre_scores_gemma":[0.9767596,0.00011422524,0.021591151,0.00008026318,0.00007164104,0.000066071065,0.00016865788,0.00015713027,0.0009912889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982656,0.00506914,0.001437292,0.0016123424,0.0071339253,0.0020912255],"domain_scores_gemma":[0.91301876,0.0555475,0.0054762806,0.011162166,0.012945647,0.0018496589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009076585,0.000611003,0.0013254711,0.0009568763,0.0021233007,0.005910374,0.0029523335,0.002211294,0.0015060045],"category_scores_gemma":[0.057800833,0.0011642533,0.0011974889,0.0009675191,0.006771207,0.0061300052,0.0027337123,0.002949951,0.00032481065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058872076,0.0007761582,0.03730364,0.00074596354,0.00040013043,0.0024921717,0.009562873,0.19671568,0.04569337,0.6274675,0.0031929077,0.06976243],"study_design_scores_gemma":[0.0004400778,0.00033557526,0.0028537759,0.00007668826,0.00014369098,0.0003748069,0.00057178724,0.375924,0.021251285,0.5956017,0.002348773,0.00007787453],"about_ca_topic_score_codex":0.0053809476,"about_ca_topic_score_gemma":0.0031526664,"teacher_disagreement_score":0.009076585,"about_ca_system_score_codex":0.0017420067,"about_ca_system_score_gemma":0.0041288026,"threshold_uncertainty_score":0.048002124},"labels":[],"label_agreement":null},{"id":"W1965246621","doi":"10.1145/1216993.1217007","title":"Deriving distribution of thread service time in layered queueing networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Queueing theory; Distributed computing; Thread (computing); Computation; Layered queueing network; Statistic; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Computer network","score_opus":0.007933355807957055,"score_gpt":0.22764297183793453,"score_spread":0.21970961602997746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965246621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028191362,0.00017918601,0.9699439,0.00009901255,0.000020187263,0.000034522258,0.00013108602,0.00027481854,0.001125959],"genre_scores_gemma":[0.82964057,0.0010782595,0.16553612,0.00012124268,0.00009530706,0.00025035464,0.0005209354,0.00030278775,0.0024542972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984634,0.0005866302,0.000075265525,0.00017166833,0.00052004185,0.00018313758],"domain_scores_gemma":[0.9904783,0.006488931,0.0009318783,0.0006222931,0.0012650895,0.0002136682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049157394,0.0009726602,0.0009138393,0.0019422809,0.00058049103,0.0017430991,0.0020524443,0.0011436555,0.001334324],"category_scores_gemma":[0.03211698,0.000839988,0.0010704589,0.0014171576,0.0010771167,0.0027097333,0.0013976065,0.0015259339,0.00055484707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022313498,0.000027127244,0.0016081415,0.000038701615,0.000021820024,0.0001018099,0.00013178612,0.9354426,0.0011746977,0.052973688,0.00038051367,0.008076856],"study_design_scores_gemma":[0.0000013416548,0.0000026846674,0.00006654487,0.0000032260928,0.0000015192403,0.0000057950833,0.000004896695,0.9923293,0.00011695761,0.0073626847,0.00010100817,0.0000039554857],"about_ca_topic_score_codex":0.017691394,"about_ca_topic_score_gemma":0.0071446723,"teacher_disagreement_score":0.017691394,"about_ca_system_score_codex":0.0037000955,"about_ca_system_score_gemma":0.0022642692,"threshold_uncertainty_score":0.035176873},"labels":[],"label_agreement":null},{"id":"W1965473444","doi":"10.1109/hpcc.2012.165","title":"Speculative Versioning through Perceptron Predictors","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Software versioning; Benchmark (surveying); Software transactional memory; Database transaction; Suite; Software; Distributed computing; Parallel computing; Operating system; Database","score_opus":0.01698151236824669,"score_gpt":0.24929424992132257,"score_spread":0.23231273755307588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965473444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24334572,0.0016231439,0.7420078,0.00080085907,0.00029019374,0.00013974211,0.00025284776,0.008394992,0.0031446249],"genre_scores_gemma":[0.89945376,0.0002364746,0.097679496,0.0001710319,0.00008354569,0.00008602665,0.00036984275,0.00013361133,0.0017862354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896634,0.00036155514,0.00008198125,0.0001927086,0.00025291796,0.0001445886],"domain_scores_gemma":[0.9943456,0.0035121886,0.00048954086,0.00058606965,0.00088758086,0.0001790069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027577393,0.0009576702,0.0010824125,0.0008592665,0.00035198263,0.0012807144,0.0018745923,0.00086703623,0.001410478],"category_scores_gemma":[0.0094261775,0.00066066335,0.0004751717,0.0009248027,0.0005949269,0.0020496673,0.0006464987,0.0020754554,0.00042422893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063577446,0.00022589472,0.005262403,0.000087256114,0.000075743956,0.00009600022,0.00006778509,0.81173426,0.004567255,0.002576907,0.002756466,0.17191416],"study_design_scores_gemma":[0.0000068836025,0.00002301194,0.000106047715,0.0000023612363,0.0000049937726,0.000004742496,0.0000024520123,0.9985405,0.00058082456,0.0006353955,0.000089765716,0.0000030358342],"about_ca_topic_score_codex":0.006973774,"about_ca_topic_score_gemma":0.008244589,"teacher_disagreement_score":0.006973774,"about_ca_system_score_codex":0.0009273987,"about_ca_system_score_gemma":0.0015262295,"threshold_uncertainty_score":0.014584541},"labels":[],"label_agreement":null},{"id":"W1965993826","doi":"10.1145/1872007.1872053","title":"The case for hardware transactional memory in software packet processing","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Packet processing; Serialization; Network packet; Software transactional memory; Transactional memory; Network processor; Synchronization (alternating current); Programmer; Embedded system; Computer network; Operating system; Database transaction","score_opus":0.013053580455048156,"score_gpt":0.25622942301665935,"score_spread":0.2431758425616112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965993826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22605377,0.053232733,0.5407191,0.07684796,0.0059826,0.00041219319,0.0003946771,0.0040623406,0.092294656],"genre_scores_gemma":[0.7982258,0.006437087,0.17142421,0.008598611,0.0021012623,0.00035573947,0.00014512356,0.00038608414,0.012326041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972275,0.0005569258,0.00015494724,0.00051853026,0.0012226054,0.0003195729],"domain_scores_gemma":[0.99157155,0.003969169,0.0006245284,0.00247479,0.0010271644,0.00033287157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045945765,0.0005794314,0.00067686907,0.0004949018,0.0009871165,0.0037398234,0.004094526,0.0033852197,0.01006005],"category_scores_gemma":[0.012688692,0.00050636264,0.0004925299,0.0010675438,0.0035934302,0.009921709,0.0016800618,0.0052298415,0.0016229739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014454343,0.0004654881,0.009667603,0.0024401103,0.00010855799,0.0014639895,0.0008880857,0.020540195,0.03217233,0.5828324,0.02637671,0.32159916],"study_design_scores_gemma":[0.00045729434,0.0031638027,0.004159416,0.0015960982,0.00031881026,0.0047624134,0.0014125394,0.17832886,0.084826805,0.45367992,0.26703328,0.00026073967],"about_ca_topic_score_codex":0.00071745453,"about_ca_topic_score_gemma":0.0008284758,"teacher_disagreement_score":0.01006005,"about_ca_system_score_codex":0.00092762004,"about_ca_system_score_gemma":0.0009951802,"threshold_uncertainty_score":0.033654213},"labels":[],"label_agreement":null},{"id":"W1966171923","doi":"10.1109/ichi.2013.38","title":"Supporting N-Screen Medical Data Access in mHealth","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"mHealth; Computer science; Scalability; Mobile device; Consistency (knowledge bases); Mobile computing; Data access; Wireless; Mobile telephony; Computer network; Mobile radio; Health care; World Wide Web; Database; Telecommunications","score_opus":0.06764257629930419,"score_gpt":0.39051064064056135,"score_spread":0.32286806434125714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966171923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32883716,0.0015652442,0.6521479,0.0013912757,0.00020059693,0.0006516196,0.00023534561,0.0079806475,0.0069902684],"genre_scores_gemma":[0.9375461,0.00021926548,0.06012224,0.00016637005,0.000060262944,0.00010799704,0.00011914565,0.00005495613,0.0016038687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986853,0.00043133055,0.00017991046,0.00020362725,0.00035777353,0.0001421512],"domain_scores_gemma":[0.99592716,0.0015309156,0.00041897633,0.0011227904,0.0006807535,0.00031941684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021194476,0.00036987127,0.0006054181,0.0005893945,0.00072476704,0.0012456398,0.0016998686,0.0009581644,0.00159494],"category_scores_gemma":[0.0067902026,0.00029733387,0.00031688221,0.0005853499,0.0005695663,0.0018664799,0.0021311408,0.0004948048,0.00063826033],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061959573,0.0010509914,0.04885929,0.0011257564,0.00035060334,0.0061795525,0.0049073272,0.07429259,0.1929784,0.020756625,0.014257717,0.62904525],"study_design_scores_gemma":[0.00083262264,0.0018627207,0.025127439,0.00017523365,0.00027957215,0.0025261973,0.0015929246,0.81543165,0.08400214,0.024356596,0.043601,0.00021196135],"about_ca_topic_score_codex":0.003061351,"about_ca_topic_score_gemma":0.0024804415,"teacher_disagreement_score":0.003061351,"about_ca_system_score_codex":0.00046393412,"about_ca_system_score_gemma":0.0008038043,"threshold_uncertainty_score":0.011208892},"labels":[],"label_agreement":null},{"id":"W1967301683","doi":"10.1142/s0129054111008623","title":"SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Self-stabilization; Time complexity; Asynchronous communication; Computer science; Connected component; Distributed algorithm; Node (physics); Spanning tree; Enhanced Data Rates for GSM Evolution; Computation; Strongly connected component; State (computer science); Upper and lower bounds; Binary logarithm; Identifier; Degree (music); Computational complexity theory; Algorithm; Mathematics; Discrete mathematics; Distributed computing; Computer network","score_opus":0.03714620429616353,"score_gpt":0.290319023698489,"score_spread":0.25317281940232544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967301683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1631915,0.00009417829,0.83098596,0.00012997001,0.000032628323,0.00007751861,0.000081742866,0.0015506207,0.003855906],"genre_scores_gemma":[0.79128414,0.000063334606,0.20599735,0.000047898964,0.000011838584,0.00010957304,0.00018081191,0.000100894336,0.0022041511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996939,0.000056663812,0.000024770598,0.000075967146,0.000099082295,0.000049737962],"domain_scores_gemma":[0.9989981,0.0003392965,0.00011932188,0.00020978821,0.00027350243,0.00005998159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036126375,0.00031621795,0.00035565777,0.000738457,0.0006046422,0.00085873326,0.00090924476,0.0005592134,0.0022437603],"category_scores_gemma":[0.0028915985,0.00022153888,0.0003286864,0.0006713853,0.0006432278,0.0013379107,0.0012358881,0.00034671987,0.00044047146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007409836,0.00011353126,0.0043086167,0.00022426056,0.00007712681,0.00049916515,0.0008585426,0.5395557,0.050738193,0.17159696,0.0038859623,0.22740088],"study_design_scores_gemma":[0.000027582324,0.000045184406,0.00039996844,0.000012500832,0.000015453656,0.00008527107,0.00005435383,0.9281698,0.015332366,0.053542975,0.0023008299,0.0000137973775],"about_ca_topic_score_codex":0.0012561394,"about_ca_topic_score_gemma":0.0014281927,"teacher_disagreement_score":0.0022437603,"about_ca_system_score_codex":0.0005917354,"about_ca_system_score_gemma":0.00058317924,"threshold_uncertainty_score":0.007506132},"labels":[],"label_agreement":null},{"id":"W1967448812","doi":"10.1145/2370816.2370904","title":"Transactional event profiling in a best-effort hardware transactional memory system","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transactional memory; Atomicity; Software transactional memory; Computer science; Profiling (computer programming); Software; Transactional leadership; Operating system; Embedded system; Computer architecture; Programming language; Database transaction","score_opus":0.01833904863148237,"score_gpt":0.2527794438791513,"score_spread":0.23444039524766894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967448812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3728202,0.0005694939,0.6113133,0.00027101298,0.000076088436,0.0001054475,0.00019443655,0.009759729,0.0048904377],"genre_scores_gemma":[0.8477452,0.00009686123,0.14900298,0.00008496567,0.000021689453,0.000040039562,0.00010083834,0.00017476022,0.0027326583],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985933,0.00032106639,0.0001085388,0.00027027144,0.000535739,0.00017107153],"domain_scores_gemma":[0.99818605,0.0004828599,0.00015511688,0.0007672796,0.0002818047,0.00012687877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353916,0.00032728244,0.00043349076,0.0005500577,0.00056585623,0.0016737928,0.0010948683,0.0005125607,0.0012610448],"category_scores_gemma":[0.0027418805,0.00042702773,0.00018977677,0.0006545565,0.0005408092,0.0020835488,0.0008101788,0.00080084824,0.00044033083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00390812,0.00080579537,0.022386195,0.00024008863,0.000103615566,0.0017271057,0.0014731062,0.18931738,0.28154257,0.06861375,0.0069995574,0.42288265],"study_design_scores_gemma":[0.000062133426,0.000336594,0.0028517193,0.000021514,0.000048547463,0.00048821184,0.00013055417,0.8519063,0.1261984,0.011576056,0.006315862,0.000064084845],"about_ca_topic_score_codex":0.0013581507,"about_ca_topic_score_gemma":0.002264805,"teacher_disagreement_score":0.0016737928,"about_ca_system_score_codex":0.0006412676,"about_ca_system_score_gemma":0.00079682487,"threshold_uncertainty_score":0.004652798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01483399648761171,"score_gpt":0.26098157343179307,"score_spread":0.24614757694418135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967908173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02979471,0.00059431675,0.9173594,0.0058311685,0.0008842833,0.00025941757,0.00027248793,0.0016083221,0.043395836],"genre_scores_gemma":[0.74621487,0.00071082625,0.22554645,0.0025381926,0.0005460829,0.000544195,0.0005698665,0.00063495,0.022694597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992301,0.0029523366,0.0003320232,0.0012095935,0.0022811864,0.00092393026],"domain_scores_gemma":[0.9887263,0.005020905,0.00043455642,0.00305802,0.0024400328,0.0003201634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059202015,0.00095423206,0.0016475344,0.0008933588,0.0021088559,0.002663313,0.0034211006,0.0028247125,0.008006364],"category_scores_gemma":[0.020771353,0.0007901814,0.0012953788,0.0010210985,0.0038429692,0.005296099,0.0051835445,0.0040019713,0.0022535278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006743628,0.000094980984,0.00051747914,0.00027279663,0.000115965646,0.00017548457,0.00039048205,0.059869573,0.0058686486,0.8716545,0.0136032775,0.046762493],"study_design_scores_gemma":[0.0003957047,0.000114306415,0.0002524887,0.0000726853,0.00007667776,0.00012106288,0.00012205429,0.34142882,0.009413559,0.63328856,0.014637506,0.00007654683],"about_ca_topic_score_codex":0.002173639,"about_ca_topic_score_gemma":0.0015746271,"teacher_disagreement_score":0.008006364,"about_ca_system_score_codex":0.0020653,"about_ca_system_score_gemma":0.004384436,"threshold_uncertainty_score":0.031309366},"labels":[],"label_agreement":null},{"id":"W1969196642","doi":"10.1145/2141702.2141704","title":"AGC","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Commit; Cache coherence; Benchmark (surveying); Consistency (knowledge bases); Consistency model; Software transactional memory; Cache; Database transaction; Exploit; Overhead (engineering); Distributed computing; Parallel computing; Real-time computing; Operating system; CPU cache; Cache algorithms; Database; Data consistency; Computer security","score_opus":0.012654244225145378,"score_gpt":0.23170971929973674,"score_spread":0.21905547507459136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969196642","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023690399,0.0017056258,0.18073057,0.0024975676,0.003401105,0.0009879386,0.022682032,0.17952925,0.58477557],"genre_scores_gemma":[0.23283352,0.0016682659,0.15555091,0.0036632456,0.0010197598,0.0010182703,0.08900026,0.018010067,0.49723577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986292,0.00014754712,0.00007933289,0.00026044447,0.00065903855,0.0002244994],"domain_scores_gemma":[0.9970161,0.0002294649,0.000119857286,0.0010462641,0.0014003954,0.0001879107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007931568,0.0010861487,0.00045148577,0.0017441564,0.00071295607,0.0024384486,0.0022766436,0.0013144823,0.13922606],"category_scores_gemma":[0.0031230531,0.00035365482,0.00047333312,0.0017634446,0.00037426042,0.0019395744,0.0018311153,0.0011246288,0.12531602],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072679087,0.0002071917,0.0025997143,0.00042343317,0.000036992365,0.00032345374,0.00014211492,0.0050255316,0.015053858,0.026495913,0.50071305,0.44825202],"study_design_scores_gemma":[0.000099223435,0.00013450497,0.0011817382,0.000059517963,0.000025817048,0.00034678294,0.00005767117,0.0151384,0.013596971,0.007917715,0.9614014,0.000040295112],"about_ca_topic_score_codex":0.004903386,"about_ca_topic_score_gemma":0.0038406334,"teacher_disagreement_score":0.8607739,"about_ca_system_score_codex":0.0010058873,"about_ca_system_score_gemma":0.001785342,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1969434100","doi":"10.1145/2523616.2523632","title":"Consistency without borders","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Information and Intelligent Systems; Air Force Office of Scientific Research; Division of Graduate Education; Defense Advanced Research Projects Agency; Directorate for Computer and Information Science and Engineering; Nippon Telegraph and Telephone; Samsung; VMware; EMC; NetApp; National Science Foundation; Google; Microsoft; Oracle; Division of Computer and Network Systems; Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Cisco Systems; Facebook; SAP North America; General Electric; Intel Corporation","keywords":"Consistency (knowledge bases); Computer science; Consistency model; Linearizability; Sequential consistency; Weak consistency; Causal consistency; Eventual consistency; Data consistency; Strong consistency; Distributed computing; Programming language; Artificial intelligence; Mathematics; Correctness; Statistics","score_opus":0.009625182989871833,"score_gpt":0.24063305336062227,"score_spread":0.23100787037075043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969434100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011610774,0.003475759,0.8246565,0.008773684,0.0022756238,0.00034657036,0.0008541129,0.0029838986,0.14502308],"genre_scores_gemma":[0.48774925,0.005024534,0.36907378,0.008602632,0.0031900476,0.0015195993,0.0033305218,0.0044044554,0.11710522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877093,0.0028989648,0.0012003751,0.003811993,0.0030781266,0.0013011817],"domain_scores_gemma":[0.9706486,0.006649281,0.0012898501,0.01594029,0.0044823876,0.0009896487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008395195,0.0010238381,0.0017840128,0.0013717356,0.003880917,0.009018345,0.0043219663,0.0033237701,0.020089982],"category_scores_gemma":[0.036282968,0.0013203532,0.00198025,0.0017598649,0.006840168,0.023394717,0.012744696,0.0076828217,0.0064087072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046926612,0.00002023664,0.00035734123,0.00011463306,0.000024790288,0.00011220679,0.0003719531,0.0023259,0.00077072793,0.97031546,0.009451494,0.01608837],"study_design_scores_gemma":[0.000040622173,0.00002389337,0.00013675405,0.000114796174,0.000036295536,0.00018552138,0.00014666085,0.006788103,0.0015918202,0.8663132,0.12459526,0.000027088709],"about_ca_topic_score_codex":0.0030326925,"about_ca_topic_score_gemma":0.0017078398,"teacher_disagreement_score":0.020089982,"about_ca_system_score_codex":0.002460618,"about_ca_system_score_gemma":0.004278036,"threshold_uncertainty_score":0.067207694},"labels":[],"label_agreement":null},{"id":"W1971681150","doi":"10.2298/csis130122007a","title":"Revisiting snapshot algorithms by refinement-based techniques","year":2014,"lang":"en","type":"article","venue":"Computer Science and Information Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Snapshot (computer storage); Computer science; Debugging; Distributed algorithm; Algorithm; Computation; Distributed computing; Theoretical computer science; Programming language; Database","score_opus":0.008347949598917461,"score_gpt":0.22703694335778457,"score_spread":0.2186889937588671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971681150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017170993,0.00019313012,0.99651814,0.00017348201,0.000037676167,0.000032868473,0.000013763893,0.0003406153,0.0009731691],"genre_scores_gemma":[0.109850354,0.00074774976,0.8865513,0.0002438968,0.00010439174,0.00011491494,0.00010860708,0.0003488407,0.0019298962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944043,0.0021969501,0.00041155829,0.0007037404,0.0018757473,0.00040775153],"domain_scores_gemma":[0.9851354,0.0072924453,0.0005639441,0.0046927254,0.002076544,0.0002389947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006865839,0.0010466514,0.00089443027,0.0017008999,0.0009369468,0.0019202598,0.003052922,0.0012092309,0.0035467967],"category_scores_gemma":[0.019616988,0.0009619907,0.0017371848,0.0014648178,0.003975235,0.007377598,0.0045871963,0.0044151577,0.00089542835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014176319,0.000063188185,0.00096008397,0.00036200322,0.0000661786,0.0002469399,0.00063895393,0.046387043,0.008041622,0.8003597,0.0029400866,0.13979244],"study_design_scores_gemma":[0.00009984474,0.00012970105,0.0002732772,0.00017758302,0.00008153856,0.00027880562,0.00018517261,0.35414687,0.017001243,0.59783095,0.029732566,0.00006237747],"about_ca_topic_score_codex":0.002207517,"about_ca_topic_score_gemma":0.002723511,"teacher_disagreement_score":0.006865839,"about_ca_system_score_codex":0.0013053586,"about_ca_system_score_gemma":0.0019125065,"threshold_uncertainty_score":0.036310494},"labels":[],"label_agreement":null},{"id":"W1972023200","doi":"10.1145/1596655.1596671","title":"The use of hardware transactional memory for the trace-based parallelization of recursive Java programs","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Java; Parallel computing; TRACE (psycholinguistics); Speedup; Transactional memory; Software transactional memory; Fork (system call); Programming language; Operating system; Database transaction","score_opus":0.05425305920755355,"score_gpt":0.26013259477917666,"score_spread":0.2058795355716231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972023200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2329041,0.0004440028,0.7568083,0.00027631302,0.000028555578,0.00009914593,0.00005021094,0.0057143494,0.0036750354],"genre_scores_gemma":[0.72174627,0.00014344795,0.2767273,0.000046534773,0.000012393004,0.00007170123,0.000071793474,0.00014700329,0.0010335894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994203,0.00017804309,0.00003885332,0.00008735439,0.00020763738,0.00006781311],"domain_scores_gemma":[0.99830914,0.0006122961,0.0001329979,0.0006399394,0.00022953386,0.000076024735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740353,0.00030133573,0.0002584853,0.00044096974,0.00043545908,0.0009403183,0.001522004,0.0002915201,0.0014817034],"category_scores_gemma":[0.0033190758,0.00030735898,0.00023509144,0.00044439035,0.00080829073,0.0011177326,0.00063246436,0.00068862253,0.00017680699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064289046,0.0003700161,0.0071568964,0.00029533135,0.00007071525,0.0002913086,0.00055145123,0.15893881,0.18488449,0.04435621,0.0024609107,0.599981],"study_design_scores_gemma":[0.000106041596,0.00048739335,0.0017199494,0.000037580943,0.00006149955,0.00020861135,0.000090445734,0.7979633,0.17812435,0.014422208,0.0067332676,0.0000452464],"about_ca_topic_score_codex":0.0031177916,"about_ca_topic_score_gemma":0.0038432484,"teacher_disagreement_score":0.0031177916,"about_ca_system_score_codex":0.0006964666,"about_ca_system_score_gemma":0.0012512852,"threshold_uncertainty_score":0.0061993003},"labels":[],"label_agreement":null},{"id":"W1972499872","doi":"10.1145/1950413.1950422","title":"NetTM","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.03703189593691148,"score_gpt":0.20010168001065542,"score_spread":0.16306978407374395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972499872","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06821517,0.0019120709,0.7650349,0.0012100689,0.0014821657,0.00044359252,0.0019869823,0.056503613,0.10321149],"genre_scores_gemma":[0.43266162,0.0012988813,0.4468844,0.0015274977,0.00038063654,0.0004028673,0.0090667,0.0023100695,0.105467394],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997086,0.00002843468,0.000023230054,0.000063618456,0.00011177916,0.00006431585],"domain_scores_gemma":[0.9996191,0.000042981963,0.000028995233,0.00012798666,0.00012206087,0.000058891805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036291048,0.0003554576,0.00024072733,0.0004245601,0.00031154798,0.0012492476,0.00216022,0.0004952467,0.018597974],"category_scores_gemma":[0.00068356714,0.00022060446,0.00025345536,0.000384022,0.00019965181,0.0021389888,0.0009813663,0.00054611143,0.0054738335],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010887549,0.00025094073,0.0032715066,0.000658921,0.0000899235,0.00036018866,0.00015267107,0.007650725,0.05413279,0.047956776,0.077799976,0.80658674],"study_design_scores_gemma":[0.00028337128,0.0012267889,0.0024126181,0.00012740641,0.00014438498,0.001266387,0.000097208766,0.13597015,0.113505185,0.01881159,0.726066,0.00008898355],"about_ca_topic_score_codex":0.0009184298,"about_ca_topic_score_gemma":0.0017790545,"teacher_disagreement_score":0.018597974,"about_ca_system_score_codex":0.00035793468,"about_ca_system_score_gemma":0.0006015509,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1972699950","doi":"10.1504/ijhtm.2007.012100","title":"Middleware service architecture over cellular network for mobile medical applications","year":2007,"lang":"en","type":"article","venue":"International Journal of Healthcare Technology and Management","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Middleware (distributed applications); Server; Mobile computing; Scalability; Computer network; Process (computing); Operating system","score_opus":0.00772029062523983,"score_gpt":0.2920901190585525,"score_spread":0.28436982843331265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972699950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040030684,0.0034365563,0.899705,0.0022233925,0.0008632213,0.00048592096,0.00037532308,0.014770799,0.038109217],"genre_scores_gemma":[0.6932164,0.0025038817,0.26137736,0.00077181385,0.00030340717,0.0005708586,0.0016183306,0.00067957875,0.038958378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930036,0.00017665236,0.00009035306,0.00010068391,0.00021893163,0.00011303098],"domain_scores_gemma":[0.99948585,0.000069220994,0.000034983943,0.00009848312,0.00022036329,0.000091106675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007137974,0.00047281815,0.0004381903,0.00069010234,0.00086843845,0.0026410348,0.0012874207,0.0010221344,0.0035068614],"category_scores_gemma":[0.001460324,0.00023651954,0.00044495985,0.0009924637,0.00038057414,0.0013234832,0.0014319167,0.0008236479,0.0023184416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010251654,0.00031924475,0.0041872603,0.0011705005,0.00022273521,0.0022779065,0.0014653627,0.07124581,0.08860256,0.38662145,0.056959692,0.3859023],"study_design_scores_gemma":[0.00011704156,0.0003259548,0.0018759486,0.00014580972,0.000200672,0.0012972926,0.0004886504,0.51153535,0.025067294,0.057909828,0.40093452,0.000101653146],"about_ca_topic_score_codex":0.0057610576,"about_ca_topic_score_gemma":0.0045555057,"teacher_disagreement_score":0.0057610576,"about_ca_system_score_codex":0.0015434243,"about_ca_system_score_gemma":0.0016636361,"threshold_uncertainty_score":0.011731625},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1108332601636947,"score_gpt":0.3436451194508417,"score_spread":0.23281185928714698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973115038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021821149,0.02333485,0.8538089,0.02731874,0.006330821,0.00031462993,0.0002766356,0.0009239999,0.06587033],"genre_scores_gemma":[0.59340113,0.012747913,0.32418928,0.007126458,0.0043412824,0.00096669653,0.00040331107,0.000573126,0.05625075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887707,0.0046387915,0.0006261876,0.0012117876,0.0041046375,0.0006479465],"domain_scores_gemma":[0.9815678,0.008125682,0.001207764,0.0052660927,0.0031572187,0.00067543326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011570114,0.0006131641,0.0015698657,0.0013174716,0.0021908467,0.005164957,0.003463542,0.004455815,0.011720119],"category_scores_gemma":[0.030140024,0.00058999326,0.0012551951,0.002286652,0.0036702377,0.019015264,0.002822037,0.002575668,0.004207607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033022906,0.000081459926,0.0008300834,0.0005075659,0.00006909565,0.0001681942,0.000520527,0.005314398,0.002734002,0.8717052,0.010064313,0.10767491],"study_design_scores_gemma":[0.00017488017,0.00038419265,0.00037047637,0.00026959565,0.00006602512,0.00082316966,0.0005621046,0.032098144,0.0035827623,0.7969105,0.16465642,0.0001016923],"about_ca_topic_score_codex":0.0010642908,"about_ca_topic_score_gemma":0.00073405117,"teacher_disagreement_score":0.011720119,"about_ca_system_score_codex":0.0016708402,"about_ca_system_score_gemma":0.0016125875,"threshold_uncertainty_score":0.061189353},"labels":[],"label_agreement":null},{"id":"W1973991062","doi":"10.1109/tpds.2011.287","title":"Relaxed Concurrency Control in Software Transactional Memory","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Software transactional memory; Concurrency control; Optimistic concurrency control; Multiversion concurrency control; Transactional memory; Distributed computing; Concurrency; Parallel computing; Commit; Non-lock concurrency control; Distributed concurrency control; Database transaction; Operating system; Distributed transaction; Transaction processing; Programming language; Database","score_opus":0.023594969331914344,"score_gpt":0.21982452649761416,"score_spread":0.19622955716569981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973991062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086396456,0.0016855226,0.9061494,0.0003611077,0.00010065132,0.00012928904,0.00005136924,0.00253327,0.0025928828],"genre_scores_gemma":[0.77177894,0.00040268642,0.22517769,0.00018668972,0.00008275178,0.00024685357,0.00012162251,0.00025594598,0.0017468294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99187887,0.002605728,0.00074258563,0.0008804423,0.0033577087,0.0005347303],"domain_scores_gemma":[0.9893969,0.004263872,0.00094338285,0.0034998101,0.0016017715,0.00029423586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967772,0.00071978057,0.00079064537,0.0010276258,0.00082684995,0.0024737725,0.0037823298,0.00076488656,0.0010926058],"category_scores_gemma":[0.015406756,0.0009207122,0.00061682373,0.0012521335,0.0022366438,0.0043437635,0.0024369643,0.0025249214,0.00031680608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018880877,0.0004950881,0.009303043,0.0007366444,0.00019807764,0.00053182384,0.0018328162,0.39029038,0.078257985,0.17127663,0.004490987,0.34069848],"study_design_scores_gemma":[0.00021275072,0.00026920665,0.00047896177,0.00004899528,0.000059632624,0.00022167178,0.00009187562,0.9006965,0.03036116,0.06222893,0.0052740667,0.000056269662],"about_ca_topic_score_codex":0.0017408229,"about_ca_topic_score_gemma":0.0017871701,"teacher_disagreement_score":0.005967772,"about_ca_system_score_codex":0.0010058365,"about_ca_system_score_gemma":0.001461181,"threshold_uncertainty_score":0.031560957},"labels":[],"label_agreement":null},{"id":"W1975532470","doi":"10.4018/jcini.2013010102","title":"The T-Sat1 Nanosatellite Design and Implementation Through a Team of Teams","year":2013,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Magellan Aerospace (Canada); University of Manitoba","funders":"","keywords":"Computer science; Aerospace; Multitude; Engineering management; Focus (optics); Systems engineering; Government (linguistics); Process management","score_opus":0.012604392428594093,"score_gpt":0.30152951426425,"score_spread":0.28892512183565594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975532470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08224767,0.0002199098,0.8348269,0.0014870018,0.00021457214,0.00092096376,0.00021192228,0.003172196,0.07669884],"genre_scores_gemma":[0.35949025,0.00021495343,0.5930894,0.0003822892,0.00004097469,0.0010499954,0.00061378296,0.00067865115,0.044439733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973124,0.0010147459,0.000115804374,0.00037258715,0.0008418495,0.00034257656],"domain_scores_gemma":[0.9981535,0.00022146308,0.0001592122,0.00038225704,0.00078092807,0.00030264928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034184942,0.00042493647,0.00028938893,0.0005231196,0.0011546331,0.0026263164,0.0014286232,0.0007374075,0.008032131],"category_scores_gemma":[0.0034247052,0.00033833098,0.0005349689,0.00034880688,0.0012855142,0.0011691877,0.0023259139,0.0010219481,0.0029269576],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353082,0.0007139839,0.011850238,0.0007512002,0.00018102863,0.0012522852,0.0056122164,0.16277684,0.076278254,0.2726855,0.033440165,0.433323],"study_design_scores_gemma":[0.0004258253,0.0025098887,0.004360162,0.0003865661,0.00011801703,0.0009338084,0.0022934615,0.33236602,0.05772353,0.041241992,0.557497,0.00014369898],"about_ca_topic_score_codex":0.0033440352,"about_ca_topic_score_gemma":0.004511298,"teacher_disagreement_score":0.008032131,"about_ca_system_score_codex":0.0021558828,"about_ca_system_score_gemma":0.0038404525,"threshold_uncertainty_score":0.026870191},"labels":[],"label_agreement":null},{"id":"W1976381927","doi":"10.1145/1842733.1842747","title":"Accurate offline synchronization of distributed traces using kernel-level events","year":2010,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Polytechnique Montréal; Defence Research and Development Canada","keywords":"Computer science; Tracing; Timestamp; Synchronization (alternating current); TRACE (psycholinguistics); Distributed computing; Kernel (algebra); Time synchronization; Real-time computing; Parallel computing; Algorithm; Computer network; Channel (broadcasting); Operating system","score_opus":0.04547080925856184,"score_gpt":0.31574226858176335,"score_spread":0.2702714593232015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976381927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1043538,0.00026347238,0.88667434,0.00011487052,0.000085995154,0.000099953446,0.00024136298,0.006696917,0.0014692983],"genre_scores_gemma":[0.7899868,0.00022961099,0.20712823,0.00003565523,0.000063192536,0.000107819695,0.00064366707,0.0004967256,0.0013083164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964311,0.0007354551,0.00026788705,0.0007139439,0.0016285271,0.00022309896],"domain_scores_gemma":[0.9836056,0.0047163763,0.0018101309,0.006804619,0.0026311541,0.00043202803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002030016,0.00080572616,0.00093310303,0.0015709649,0.0006163747,0.0017535498,0.0014617286,0.0006878856,0.0012640427],"category_scores_gemma":[0.017542845,0.00044045653,0.00024288453,0.0013629249,0.00060493965,0.0023470502,0.0017199125,0.0015281586,0.0008257668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015777041,0.00047499678,0.036182094,0.00044602162,0.0002067506,0.00031064928,0.001413798,0.09273691,0.1953582,0.015418645,0.0038590753,0.65201515],"study_design_scores_gemma":[0.0001533171,0.0007281194,0.013924559,0.00009806616,0.00008635659,0.00040362982,0.0004004796,0.7646847,0.19284673,0.01524669,0.011332188,0.00009517015],"about_ca_topic_score_codex":0.0016929214,"about_ca_topic_score_gemma":0.00147989,"teacher_disagreement_score":0.002030016,"about_ca_system_score_codex":0.00067590724,"about_ca_system_score_gemma":0.0014668739,"threshold_uncertainty_score":0.010735869},"labels":[],"label_agreement":null},{"id":"W1976441876","doi":"10.1109/ispa.2010.38","title":"OSSR: Optimal Single Site Replication","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Replica; Computer science; Scalability; Replication (statistics); Distributed computing; Protocol (science); Consistency (knowledge bases); Fault tolerance; Computer network; Operating system; Biology","score_opus":0.011598856103146775,"score_gpt":0.23927224424111326,"score_spread":0.22767338813796648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976441876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1256515,0.0010516684,0.84596795,0.0006301014,0.00023482885,0.000619692,0.00036554367,0.0051968973,0.0202818],"genre_scores_gemma":[0.76964873,0.00043488023,0.22371389,0.00018449251,0.00011897449,0.0002466627,0.0005009902,0.00029828402,0.0048530437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975496,0.00070645934,0.00016261275,0.0003411038,0.00092907326,0.00031113203],"domain_scores_gemma":[0.9974788,0.0005692499,0.00044175785,0.0008660374,0.00050291826,0.00014128494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017995044,0.0005146357,0.0010953242,0.0009617744,0.0007832809,0.00091131375,0.0021037192,0.00069134124,0.0025594244],"category_scores_gemma":[0.0039212643,0.00031868395,0.00043301252,0.001063173,0.0013319434,0.0018639598,0.0016961229,0.0006138012,0.0010085909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015556775,0.00038838043,0.003687449,0.00079704256,0.0001566527,0.00056052476,0.0004331152,0.34912875,0.105011776,0.13824327,0.020438794,0.3795985],"study_design_scores_gemma":[0.000310713,0.0010180825,0.0014616149,0.000059699458,0.00008555142,0.0013040513,0.00028672977,0.84164464,0.06480621,0.058095284,0.030804878,0.00012247724],"about_ca_topic_score_codex":0.0007912695,"about_ca_topic_score_gemma":0.00090810674,"teacher_disagreement_score":0.0025594244,"about_ca_system_score_codex":0.00067235605,"about_ca_system_score_gemma":0.0011764702,"threshold_uncertainty_score":0.009516835},"labels":[],"label_agreement":null},{"id":"W1976739966","doi":"10.1016/s0950-5849(03)00066-1","title":"Formal verification of dependable distributed protocols","year":2003,"lang":"en","type":"article","venue":"Information and Software Technology","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Dependability; Formal verification; Formal methods; Modular design; Distributed computing; Runtime verification; Timestamp; Protocol (science); Model checking; Formal specification; Software engineering; Embedded system; Programming language; Real-time computing","score_opus":0.00854388190667143,"score_gpt":0.23704009039611196,"score_spread":0.22849620848944052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976739966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030251618,0.00022575723,0.96410954,0.00047767968,0.00009073966,0.00012621982,0.0001250013,0.001705125,0.0028882502],"genre_scores_gemma":[0.8145903,0.00043713348,0.18040341,0.00021285946,0.00010773754,0.00030200416,0.00047012363,0.0004028608,0.0030737533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915189,0.0030637472,0.000601029,0.00067383866,0.0034474374,0.0006949833],"domain_scores_gemma":[0.97043467,0.020530619,0.0014583619,0.0047263326,0.002531025,0.00031897344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067854607,0.0009332271,0.000785566,0.0010836885,0.0010255,0.0031085003,0.0033785098,0.0017126227,0.0029683614],"category_scores_gemma":[0.026511844,0.0012863391,0.0015580122,0.0006442088,0.004283243,0.005184376,0.0027326464,0.0030476754,0.00048729684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043352606,0.00027660173,0.0011787377,0.0006464564,0.00013457616,0.00059144263,0.0012560139,0.21612227,0.017693449,0.68769276,0.0021269803,0.071847126],"study_design_scores_gemma":[0.00025692227,0.0001152058,0.00028451966,0.0001314589,0.000085152154,0.00013512293,0.00012827035,0.47200134,0.02979496,0.4900662,0.0069509703,0.00004990084],"about_ca_topic_score_codex":0.003875402,"about_ca_topic_score_gemma":0.0029965588,"teacher_disagreement_score":0.0067854607,"about_ca_system_score_codex":0.0023848247,"about_ca_system_score_gemma":0.0029991358,"threshold_uncertainty_score":0.035885394},"labels":[],"label_agreement":null},{"id":"W1977752801","doi":"10.1007/978-3-642-35668-1_3","title":"Dealing with Undependable Workers in Decentralized Network Supercomputing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bounded function; Set (abstract data type); Binary logarithm; Supercomputer; Logarithm; Adversary; Parallel computing; Time complexity; Upper and lower bounds; Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.012401873487014934,"score_gpt":0.2237348427862167,"score_spread":0.21133296929920176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977752801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21501294,0.0030013148,0.74285465,0.0040543145,0.0007930304,0.00013988573,0.00011817884,0.0008834792,0.033142157],"genre_scores_gemma":[0.8819192,0.0012560139,0.093779825,0.00023447408,0.00048960675,0.00014545741,0.00013218255,0.0002093007,0.0218339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986224,0.00046821916,0.000053421205,0.0001767825,0.00041238588,0.00026674327],"domain_scores_gemma":[0.9965771,0.0017829512,0.00020115208,0.0009619722,0.0002647642,0.00021198436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022935802,0.00039083368,0.0008678056,0.00041198317,0.0021581878,0.0019711207,0.0023576678,0.001360538,0.003056885],"category_scores_gemma":[0.007040452,0.0005965246,0.0003588806,0.0011163891,0.0018891797,0.002949863,0.0030532265,0.0019789387,0.0004688297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062291435,0.00021668806,0.002886983,0.00039037192,0.00007272288,0.0008851434,0.0013041786,0.38075197,0.007965703,0.44615334,0.017722182,0.14102776],"study_design_scores_gemma":[0.000047880072,0.000044237335,0.0005190116,0.000030475056,0.000022725782,0.00017698412,0.00029042392,0.66633457,0.0035865132,0.31622314,0.012701411,0.000022572682],"about_ca_topic_score_codex":0.0012714305,"about_ca_topic_score_gemma":0.002000264,"teacher_disagreement_score":0.003056885,"about_ca_system_score_codex":0.00081680156,"about_ca_system_score_gemma":0.0011318517,"threshold_uncertainty_score":0.012129784},"labels":[],"label_agreement":null},{"id":"W1977792483","doi":"10.1109/cluster.2014.6968777","title":"Checkpoint/restart in practice: When &amp;#x2018;simple is better&amp;#x2019;","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Rule of thumb; Interval (graph theory); Set (abstract data type); Simple (philosophy); Fault tolerance; Key (lock); Process (computing); Speedup; Fault (geology); Distributed computing; Reliability engineering; Parallel computing; Algorithm; Programming language; Operating system","score_opus":0.022454205985809182,"score_gpt":0.28600954770872844,"score_spread":0.2635553417229193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977792483","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3194305,0.009426354,0.5643682,0.027379362,0.001419431,0.00061844743,0.0012707277,0.016266417,0.0598206],"genre_scores_gemma":[0.78335166,0.0016293031,0.20078675,0.0012842945,0.00020805374,0.00020782885,0.00066615874,0.0018624765,0.01000347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99685884,0.00093641604,0.00020640642,0.0007334917,0.00088044687,0.0003844037],"domain_scores_gemma":[0.9887257,0.0048114103,0.0015709865,0.0021640293,0.0020147979,0.000713047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035472482,0.000991272,0.0009562096,0.0011540536,0.0013655253,0.004459031,0.002160954,0.0034830421,0.0111226365],"category_scores_gemma":[0.029588608,0.00056704244,0.0003593779,0.0014575211,0.001690858,0.006703911,0.0017911735,0.0020296993,0.0034703906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018595977,0.00079612434,0.023486366,0.0010197839,0.00014535399,0.00045742962,0.000980257,0.14018723,0.020057257,0.046775144,0.070721775,0.69351363],"study_design_scores_gemma":[0.0003736945,0.0009892758,0.01385636,0.0005592821,0.00013397523,0.00051609933,0.0023703105,0.7635523,0.031593733,0.12026762,0.06553728,0.0002499893],"about_ca_topic_score_codex":0.0053128097,"about_ca_topic_score_gemma":0.008366156,"teacher_disagreement_score":0.0111226365,"about_ca_system_score_codex":0.0017281051,"about_ca_system_score_gemma":0.0018608165,"threshold_uncertainty_score":0.037208974},"labels":[],"label_agreement":null},{"id":"W1977956124","doi":"10.1007/s11042-006-0057-8","title":"Tools for transparent synchronous collaborative environments","year":2006,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Workspace; Java; Session (web analytics); Synchronization (alternating current); Latency (audio); Collaborative software; Human–computer interaction; Collaborative editing; Multimedia; Distributed computing; World Wide Web; Operating system; Computer network; Telecommunications","score_opus":0.020501040680467365,"score_gpt":0.2534936059960057,"score_spread":0.2329925653155383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977956124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004481112,0.00028941716,0.96394,0.00020983221,0.00017053269,0.00010727939,0.00011593673,0.021344675,0.009341173],"genre_scores_gemma":[0.23782407,0.0009734894,0.7279876,0.00034626987,0.00026163136,0.0006715735,0.000960163,0.006022056,0.024953268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971734,0.0007337672,0.00027720473,0.0003303291,0.0011052623,0.00037991037],"domain_scores_gemma":[0.99387145,0.002532493,0.00034651058,0.0022447538,0.0004671371,0.0005376067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966887,0.0012592821,0.0009226943,0.0016098117,0.0016441505,0.005079085,0.0033975698,0.002126365,0.013778943],"category_scores_gemma":[0.012737019,0.0012376639,0.0010516489,0.0011956857,0.001874627,0.0066702142,0.006785904,0.0028315063,0.0045917467],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007426767,0.00030122587,0.0009304528,0.0007740692,0.00010307884,0.0010107273,0.0037809997,0.01623949,0.021789357,0.52965605,0.036205135,0.38846666],"study_design_scores_gemma":[0.00036460694,0.0002013734,0.00048310193,0.0004829605,0.0001889204,0.0008345948,0.00063569564,0.152952,0.040092908,0.44847125,0.3551306,0.00016194762],"about_ca_topic_score_codex":0.0009221766,"about_ca_topic_score_gemma":0.0012207412,"teacher_disagreement_score":0.013778943,"about_ca_system_score_codex":0.0006719432,"about_ca_system_score_gemma":0.0012571824,"threshold_uncertainty_score":0.046095192},"labels":[],"label_agreement":null},{"id":"W1979684554","doi":"10.1145/2484239.2484241","title":"On deterministic abortable objects","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Abort; TRACE (psycholinguistics); Mutual exclusion; Object (grammar); Transactional memory; Distributed computing; Concurrency control; Computation; Process (computing); Simple (philosophy); Transaction processing; Parallel computing; Database transaction; Programming language; Operating system; Artificial intelligence","score_opus":0.0054219076088052294,"score_gpt":0.20408794703463268,"score_spread":0.19866603942582745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979684554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07708149,0.003410895,0.84825516,0.0010985283,0.000803515,0.00030018907,0.00051730394,0.0019550114,0.06657795],"genre_scores_gemma":[0.62950045,0.0038470055,0.27856576,0.0015632076,0.0010688052,0.0013164212,0.0017041508,0.0018671706,0.08056701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956241,0.0006527161,0.00037081278,0.00062865985,0.001860788,0.000862919],"domain_scores_gemma":[0.9902468,0.0026957681,0.0010763898,0.0035843397,0.0018246202,0.0005721927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031882809,0.0009989995,0.00092080835,0.0014809804,0.002564403,0.004640544,0.002575139,0.0015815158,0.005675863],"category_scores_gemma":[0.010169236,0.0009840244,0.0009909369,0.0020288697,0.0055151135,0.010129551,0.007129444,0.0025909499,0.0016644852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011068685,0.00002445131,0.0007146494,0.00008054452,0.000009914957,0.00022721107,0.00046863628,0.006540569,0.0016809492,0.974483,0.0020282897,0.013631196],"study_design_scores_gemma":[0.00010749205,0.0001577655,0.00044302797,0.00014251417,0.00005901791,0.0004279249,0.00021131196,0.034678534,0.0072420407,0.8481602,0.10829119,0.0000789826],"about_ca_topic_score_codex":0.0031032574,"about_ca_topic_score_gemma":0.0025382228,"teacher_disagreement_score":0.005675863,"about_ca_system_score_codex":0.0019932238,"about_ca_system_score_gemma":0.0019429512,"threshold_uncertainty_score":0.018987596},"labels":[],"label_agreement":null},{"id":"W1981209094","doi":"10.1109/icpp.2013.81","title":"Read-Write Lock Allocation in Software Transactional Memory","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software transactional memory; Transactional memory; Computer science; Lock (firearm); Exploit; Distributed computing; Overhead (engineering); Bottleneck; Consistency model; Parallel computing; Database transaction; Data consistency; Operating system; Embedded system; Database; Computer security","score_opus":0.009258107240865556,"score_gpt":0.2134051193489998,"score_spread":0.20414701210813424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981209094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33958265,0.0020104402,0.648993,0.0002763964,0.00009318815,0.00017590132,0.000077063196,0.00483381,0.0039575365],"genre_scores_gemma":[0.8647809,0.00027576822,0.13219914,0.000118075106,0.000035053712,0.00012267778,0.0001053713,0.00019996568,0.0021631483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986719,0.00038280443,0.00011464009,0.00018309114,0.000455797,0.00019171817],"domain_scores_gemma":[0.9981681,0.00048723313,0.0002914006,0.0006863943,0.0002791979,0.00008763445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055836,0.00034638584,0.00045876091,0.0005409296,0.00066589774,0.000927351,0.0015457026,0.000434702,0.0009408829],"category_scores_gemma":[0.002952522,0.0003361579,0.00023884098,0.0010355411,0.00058763125,0.0019006857,0.00082578737,0.00070993626,0.00032267976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019046284,0.00062524644,0.012073297,0.00035441696,0.00008671018,0.00024584794,0.00053231796,0.0644954,0.24042389,0.016614627,0.003884923,0.6587587],"study_design_scores_gemma":[0.0002803924,0.0014233012,0.0039721634,0.000037246577,0.00015385528,0.0006238411,0.0002477049,0.6213329,0.34596813,0.011098575,0.014760119,0.00010185508],"about_ca_topic_score_codex":0.000977492,"about_ca_topic_score_gemma":0.0013231742,"teacher_disagreement_score":0.0015457026,"about_ca_system_score_codex":0.0004279797,"about_ca_system_score_gemma":0.0007752643,"threshold_uncertainty_score":0.0055838823},"labels":[],"label_agreement":null},{"id":"W1981787615","doi":"10.1145/1066677.1066819","title":"Distributed evaluation of generalized path queries","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Theoretical computer science; Intersection (aeronautics); Path (computing); Path expression; Focus (optics); Query language; XML; Data mining; World Wide Web; Programming language","score_opus":0.027350402262801894,"score_gpt":0.2825173331280911,"score_spread":0.2551669308652892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981787615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08569563,0.0005913631,0.9041181,0.0006509339,0.00011550639,0.00033213457,0.0001864971,0.003030252,0.0052796365],"genre_scores_gemma":[0.6111617,0.0003294146,0.38233507,0.00020687825,0.00009197031,0.00030854225,0.0006489645,0.00045378448,0.00446367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415696,0.0015932849,0.00042850486,0.00092963583,0.0022765787,0.00061488966],"domain_scores_gemma":[0.99090976,0.004815522,0.0005457141,0.0014328347,0.0019599637,0.00033624753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004471372,0.0010127694,0.0017954628,0.0012730429,0.0012294276,0.0029339627,0.002424303,0.0012990538,0.0038308108],"category_scores_gemma":[0.018426836,0.0003521667,0.0007525668,0.0017246759,0.001316752,0.004060793,0.0042825313,0.0011818295,0.0006276811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016410616,0.00039352794,0.005785022,0.0005352985,0.00025398866,0.0007543284,0.0011841119,0.323244,0.018320108,0.13158336,0.011815334,0.50448984],"study_design_scores_gemma":[0.00014029648,0.00018207195,0.00040993938,0.000025381683,0.000055784112,0.00020303809,0.0003142593,0.8983568,0.007569666,0.08815524,0.0045589325,0.000028568764],"about_ca_topic_score_codex":0.004367055,"about_ca_topic_score_gemma":0.004027117,"teacher_disagreement_score":0.004471372,"about_ca_system_score_codex":0.0018726626,"about_ca_system_score_gemma":0.0024897512,"threshold_uncertainty_score":0.02364719},"labels":[],"label_agreement":null},{"id":"W1982369376","doi":"10.1016/j.jsc.2011.05.003","title":"Formal enforcement of security policies on concurrent systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Université Laval","funders":"","keywords":"Process calculus; Security policy; Modular design; Enforcement; Process (computing); Programming language; Computer science; Algebra over a field; Mathematics; Theoretical computer science; Computer security; Pure mathematics; Political science","score_opus":0.033208491328713355,"score_gpt":0.26869174774293647,"score_spread":0.23548325641422313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982369376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083741784,0.00024799176,0.9020194,0.0015725584,0.00020327509,0.00024835413,0.00013649951,0.0021466874,0.00968355],"genre_scores_gemma":[0.8399099,0.00023733289,0.1558217,0.0002686886,0.00015924692,0.00024206535,0.00017977673,0.00027794408,0.0029034175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98477095,0.0059971754,0.0014578855,0.0011216251,0.004832631,0.0018196634],"domain_scores_gemma":[0.93437564,0.04538606,0.0038242245,0.0090941945,0.0060574966,0.0012623076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012468475,0.00083024165,0.0011218206,0.0018362445,0.0019581758,0.0061136996,0.0028576779,0.0020398428,0.0023760803],"category_scores_gemma":[0.047009643,0.0014015624,0.0014020236,0.0012102413,0.008455924,0.006072881,0.0042330925,0.0048265597,0.00035657524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032314257,0.00017396858,0.0010541133,0.00019382183,0.000059708756,0.0002559029,0.0011295037,0.101019286,0.0053483783,0.86106586,0.0012980792,0.028078279],"study_design_scores_gemma":[0.00020326159,0.000069159905,0.0001652105,0.00008616287,0.000067441106,0.000058800688,0.00017629874,0.3839988,0.0072906693,0.6031844,0.0046559647,0.000043789154],"about_ca_topic_score_codex":0.0072598867,"about_ca_topic_score_gemma":0.0075040115,"teacher_disagreement_score":0.012468475,"about_ca_system_score_codex":0.00326538,"about_ca_system_score_gemma":0.0061612204,"threshold_uncertainty_score":0.06594038},"labels":[],"label_agreement":null},{"id":"W1982724276","doi":"10.1145/1353343.1353362","title":"Online recovery in cluster databases","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Replica; Scalability; Heuristics; Downtime; Distributed computing; Replication (statistics); Database; Database transaction; High availability; Distributed database; Transfer (computing); Set (abstract data type); Computer network; Operating system","score_opus":0.04047001056615874,"score_gpt":0.26642836919882545,"score_spread":0.22595835863266672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982724276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11049603,0.0018777715,0.8736961,0.0011408665,0.00013651447,0.00025869752,0.00018753618,0.005181886,0.007024557],"genre_scores_gemma":[0.81842244,0.0006363909,0.17331116,0.0001513107,0.00005056301,0.00018624566,0.00028059888,0.00022992105,0.0067313756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978537,0.0007086136,0.00011451013,0.00029279583,0.00076753384,0.00026284147],"domain_scores_gemma":[0.9965341,0.001418657,0.00027897648,0.0011366853,0.00047822954,0.00015338593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024211626,0.0004181652,0.00081889366,0.00082109164,0.0012258984,0.0014506798,0.0023494074,0.0011341982,0.0025574116],"category_scores_gemma":[0.007700237,0.00046442484,0.00038297274,0.0013037956,0.00092607684,0.0022551396,0.0022704739,0.0011219879,0.0006114746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073065265,0.00023859907,0.0020700837,0.00023628463,0.000061567094,0.0003165253,0.00047047087,0.6943273,0.010512582,0.058067508,0.00959869,0.22336984],"study_design_scores_gemma":[0.00008572536,0.00008859144,0.0004420109,0.00002200172,0.000025885423,0.0001434056,0.00022287758,0.9496223,0.0076209335,0.03544852,0.0062544686,0.000023371753],"about_ca_topic_score_codex":0.0070449007,"about_ca_topic_score_gemma":0.0033907772,"teacher_disagreement_score":0.0070449007,"about_ca_system_score_codex":0.0011733377,"about_ca_system_score_gemma":0.0013388474,"threshold_uncertainty_score":0.014007807},"labels":[],"label_agreement":null},{"id":"W1982878270","doi":"10.1109/icpp.2014.23","title":"Measuring Effective Work to Reward Success in Dynamic Transaction Scheduling","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Transactional memory; Serialization; Database transaction; Concurrency control; Transaction processing; Distributed computing; Transaction processing system; Scheduling (production processes); Software transactional memory; Online transaction processing; Distributed transaction; Optimistic concurrency control; Software; Serializability; Parallel computing; Operating system; Database","score_opus":0.010547580294613185,"score_gpt":0.23394580626306463,"score_spread":0.22339822596845144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982878270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7447031,0.0017895726,0.24500352,0.00047500743,0.00028335626,0.0003304765,0.00027643936,0.0015738328,0.005564604],"genre_scores_gemma":[0.95290995,0.00017170575,0.04577387,0.000034831748,0.00005217766,0.00009492852,0.00016669628,0.00007410815,0.0007218149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921381,0.0018328944,0.0008380526,0.00083964696,0.0038803262,0.0004710417],"domain_scores_gemma":[0.97143024,0.01318877,0.004881421,0.003538213,0.005067468,0.0018938236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005185852,0.00097306573,0.00095590035,0.002837732,0.0006737627,0.0016282969,0.0014377615,0.0007623767,0.00078989234],"category_scores_gemma":[0.02858419,0.0003915848,0.0002786615,0.0021600884,0.0012219033,0.0024429776,0.0011084065,0.00078701804,0.00048112703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026698986,0.0013893627,0.1416239,0.0005844038,0.00035742798,0.00030129272,0.0010736915,0.31335443,0.07330221,0.021620294,0.003207723,0.4405153],"study_design_scores_gemma":[0.000067950896,0.0019797098,0.034789585,0.000057218265,0.00009609289,0.00031603375,0.00037081647,0.8948597,0.050988752,0.012316177,0.004031498,0.00012643418],"about_ca_topic_score_codex":0.0013673394,"about_ca_topic_score_gemma":0.0017898865,"teacher_disagreement_score":0.005185852,"about_ca_system_score_codex":0.0012206604,"about_ca_system_score_gemma":0.0014319147,"threshold_uncertainty_score":0.027425766},"labels":[],"label_agreement":null},{"id":"W1983791345","doi":"10.1007/s00446-011-0139-3","title":"Symbolic synthesis of masking fault-tolerant distributed programs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Masking (illustration); Computer science; Fault tolerance; Programming language; Backward masking; Parallel computing; Distributed computing; Psychology; Art; Neuroscience","score_opus":0.027575467724975253,"score_gpt":0.2330057222646325,"score_spread":0.20543025453965724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983791345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14935987,0.00020548321,0.8290407,0.00031395804,0.00011677183,0.000057212164,0.0000814,0.0019308272,0.01889373],"genre_scores_gemma":[0.9144051,0.000105871106,0.08239056,0.000054667365,0.000017761155,0.00005865181,0.00007811211,0.0001338737,0.0027553411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997118,0.00006928155,0.000014757451,0.00003521575,0.00012042712,0.000048354235],"domain_scores_gemma":[0.9994081,0.00032175405,0.000056787765,0.000106132975,0.00008038245,0.00002680344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032816883,0.00039322322,0.0003701076,0.00030338153,0.00040528257,0.00069504796,0.000641646,0.00047020544,0.0037065274],"category_scores_gemma":[0.0017959217,0.00020304813,0.000293693,0.00027504066,0.00057191664,0.00054128905,0.0006515274,0.0006066279,0.00032264192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045830122,0.00011739383,0.00058875926,0.000277675,0.00003640682,0.00031088397,0.0003797978,0.5209579,0.06162677,0.31669816,0.0017171471,0.096830845],"study_design_scores_gemma":[0.00009082784,0.00010010509,0.00009047839,0.000027278356,0.000030627292,0.000050261842,0.000035074267,0.89009523,0.029703293,0.07555492,0.004210723,0.000011202192],"about_ca_topic_score_codex":0.0008568236,"about_ca_topic_score_gemma":0.0012469764,"teacher_disagreement_score":0.0037065274,"about_ca_system_score_codex":0.0005874307,"about_ca_system_score_gemma":0.0008030449,"threshold_uncertainty_score":0.012399554},"labels":[],"label_agreement":null},{"id":"W1984036659","doi":"10.1145/2421648.2421659","title":"Lockless multi-core high-throughput buffering scheme for kernel tracing","year":2012,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Scalability; Kernel (algebra); Interrupt; Distributed computing; Parallel computing; Context switch; Synchronization (alternating current); Latency (audio); Context (archaeology); Operating system; Embedded system; Computer network","score_opus":0.0794794799842234,"score_gpt":0.33380812091626944,"score_spread":0.25432864093204605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984036659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08076785,0.0012930955,0.9058304,0.00012679595,0.00014500327,0.00017825198,0.00008065338,0.008738256,0.0028397683],"genre_scores_gemma":[0.7441483,0.00023990513,0.2525938,0.00009791256,0.000038868486,0.00012477548,0.000113415495,0.00023875409,0.0024042653],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936897,0.00009915481,0.000055861507,0.00014501567,0.00022730272,0.000103747494],"domain_scores_gemma":[0.9978948,0.00031699328,0.00026713934,0.0009405485,0.0004352946,0.00014515902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095888367,0.0004807154,0.00057520845,0.001120094,0.00078588567,0.0011608236,0.0029958624,0.00045998069,0.0017252318],"category_scores_gemma":[0.0026872493,0.0003150474,0.000295641,0.00093027356,0.00063459825,0.0014871322,0.0010922893,0.0009162456,0.0004578042],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018774446,0.00042654545,0.0065878546,0.0006512551,0.00016180763,0.00029869966,0.0008884936,0.06660713,0.27923694,0.07406618,0.007474389,0.5617232],"study_design_scores_gemma":[0.00018531516,0.0010915658,0.0023595549,0.000079862446,0.00017460024,0.0005247384,0.00008914459,0.7317425,0.22474015,0.01547808,0.02341111,0.00012338071],"about_ca_topic_score_codex":0.001959148,"about_ca_topic_score_gemma":0.002345443,"teacher_disagreement_score":0.0029958624,"about_ca_system_score_codex":0.0016479134,"about_ca_system_score_gemma":0.0015113049,"threshold_uncertainty_score":0.0119565725},"labels":[],"label_agreement":null},{"id":"W1984249228","doi":"10.1145/1314690.1314695","title":"On specification of Read/Write shared variables","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Variable (mathematics); Inter-process communication; Consistency (knowledge bases); Abstraction; Value (mathematics); Programming language; Distributed computing; Mathematics","score_opus":0.022096016594193975,"score_gpt":0.2618276950884225,"score_spread":0.23973167849422855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984249228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004115123,0.0005296201,0.9867404,0.0007311742,0.0001291427,0.00018032853,0.00027675822,0.0012456448,0.0060517327],"genre_scores_gemma":[0.13369352,0.0015229608,0.8480343,0.0015733389,0.00039950578,0.0014919523,0.0012952526,0.0011989443,0.010790258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989934,0.00377768,0.0012071957,0.0012453268,0.0027120824,0.0011236323],"domain_scores_gemma":[0.9899691,0.0036902954,0.0009069736,0.0033590687,0.0017072917,0.00036728175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010314295,0.0018045075,0.0014621406,0.0015227927,0.0026436914,0.0059083826,0.0042754533,0.0035920406,0.004417403],"category_scores_gemma":[0.012945034,0.0016354191,0.0023416549,0.0021678982,0.007604876,0.01068202,0.0058043175,0.0063579436,0.0017728296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065405235,0.000034327215,0.00037799389,0.00013710487,0.000014293604,0.00030886778,0.00085200527,0.0071458146,0.0017774833,0.9761287,0.0023001917,0.0108578],"study_design_scores_gemma":[0.00011494154,0.00012706136,0.0001830914,0.00030690068,0.000064688975,0.0005697629,0.00041202153,0.047298398,0.010735905,0.8143895,0.12570345,0.0000941817],"about_ca_topic_score_codex":0.0039229207,"about_ca_topic_score_gemma":0.004331292,"teacher_disagreement_score":0.010314295,"about_ca_system_score_codex":0.001969549,"about_ca_system_score_gemma":0.00418581,"threshold_uncertainty_score":0.054547906},"labels":[],"label_agreement":null},{"id":"W1984303085","doi":"10.5555/2486788.2486831","title":"Detecting deadlock in programs with data-centric synchronization","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Atomicity; Programmer; Concurrency; Programming language; Java; Concurrency control; Lock (firearm); Synchronization (alternating current); Deadlock; Compiler; Parallel computing; Deadlock prevention algorithms; Semaphore; Concurrent computing; Distributed computing; Exception handling; Operating system; Database transaction; Computer network","score_opus":0.018720036718581082,"score_gpt":0.22639038077339496,"score_spread":0.20767034405481388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984303085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26484883,0.000117312215,0.72464603,0.00019390456,0.000041028445,0.00009573303,0.000048835383,0.008853089,0.0011553],"genre_scores_gemma":[0.7339227,0.000047864312,0.2646763,0.000102337865,0.000016265672,0.00006644167,0.00011730006,0.00037766792,0.0006730984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965983,0.0014554776,0.00028286118,0.00042296184,0.0009075086,0.00033284182],"domain_scores_gemma":[0.98427933,0.009496427,0.0014618874,0.0025940228,0.0018995678,0.00026886008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044142334,0.000500723,0.00056037394,0.0007960731,0.0007349082,0.0014993587,0.0016110367,0.0006834411,0.0006981192],"category_scores_gemma":[0.0135388095,0.00063243427,0.0005596741,0.0006326595,0.0018466559,0.0018564173,0.0018688979,0.001088931,0.00014098603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033915252,0.0010158883,0.08249096,0.0011887839,0.0003356848,0.0015270868,0.0027357547,0.267696,0.25666735,0.056240056,0.0036635685,0.32304734],"study_design_scores_gemma":[0.0001538216,0.0003126505,0.0023004448,0.0000616713,0.00011911694,0.00030639925,0.00015683663,0.8411305,0.13418317,0.01782762,0.003400184,0.000047568163],"about_ca_topic_score_codex":0.002440318,"about_ca_topic_score_gemma":0.0020102197,"teacher_disagreement_score":0.0044142334,"about_ca_system_score_codex":0.0007829152,"about_ca_system_score_gemma":0.0016863107,"threshold_uncertainty_score":0.023344934},"labels":[],"label_agreement":null},{"id":"W1984883054","doi":"10.1007/s00446-011-0128-6","title":"Randomized mutual exclusion with sub-logarithmic RMR-complexity","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Upper and lower bounds; Logarithm; Binary logarithm; Computer science; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.03728997020315791,"score_gpt":0.2374978864502045,"score_spread":0.2002079162470466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984883054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090792656,0.002639833,0.8145105,0.02215314,0.0010670534,0.00087019335,0.002345877,0.010614955,0.05500576],"genre_scores_gemma":[0.7887092,0.0008686402,0.1781666,0.0035453257,0.0012967577,0.0015080681,0.0016787669,0.0020105303,0.022216022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97924864,0.008853491,0.0007828613,0.0029831235,0.0048952643,0.0032366475],"domain_scores_gemma":[0.9077522,0.06656636,0.0026562705,0.018466648,0.0021239365,0.002434576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009906407,0.0028996456,0.0052576694,0.0015525543,0.0032169565,0.0066011595,0.008274031,0.005704552,0.024808787],"category_scores_gemma":[0.052851513,0.0016329366,0.0028779814,0.0028241165,0.0057575735,0.016614465,0.010350426,0.0094405785,0.0057770466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075603644,0.0018175383,0.0025989213,0.0013427119,0.00040136065,0.0003731479,0.00063725334,0.31213877,0.012633461,0.43116733,0.0578946,0.17143457],"study_design_scores_gemma":[0.00095634226,0.0002216436,0.00037933432,0.000047059526,0.00012705915,0.00019095042,0.000075965836,0.5696833,0.003638468,0.42119414,0.0034141215,0.00007168369],"about_ca_topic_score_codex":0.0020892096,"about_ca_topic_score_gemma":0.0040074564,"teacher_disagreement_score":0.024808787,"about_ca_system_score_codex":0.0074520395,"about_ca_system_score_gemma":0.010017782,"threshold_uncertainty_score":0.082993686},"labels":[],"label_agreement":null},{"id":"W1985671439","doi":"10.1145/1011767.1011777","title":"Lower bounds for adaptive collect and related objects","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Computer science; Upper and lower bounds; Algorithm; Mathematics","score_opus":0.010361593517490006,"score_gpt":0.2247643378607285,"score_spread":0.2144027443432385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985671439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07776367,0.0042883786,0.849639,0.0036726282,0.00035468614,0.00046453273,0.00091897347,0.002475046,0.06042311],"genre_scores_gemma":[0.6479779,0.0025156378,0.3138941,0.0015757518,0.0011153668,0.0012337376,0.0017696078,0.0023094688,0.027608426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98442763,0.0022974361,0.00083286304,0.0022985407,0.0066588162,0.0034847455],"domain_scores_gemma":[0.92134714,0.057059955,0.0037620617,0.0113484,0.0049243025,0.0015580549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073743374,0.0024156957,0.0023105391,0.0031739466,0.003821749,0.008142478,0.005566036,0.0028720691,0.014904396],"category_scores_gemma":[0.052434836,0.0014099684,0.0036769784,0.0034521797,0.004777811,0.02133997,0.007500337,0.0079460265,0.002582757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00117395,0.0005580409,0.00903206,0.0010840306,0.00024168704,0.00038893486,0.001023463,0.11412807,0.011624602,0.7097457,0.013930517,0.13706893],"study_design_scores_gemma":[0.00008915927,0.000282398,0.0019477713,0.00020520472,0.00021407868,0.00044687922,0.00018909023,0.51231277,0.012169984,0.4570232,0.015005248,0.000114192175],"about_ca_topic_score_codex":0.0026425852,"about_ca_topic_score_gemma":0.0035606544,"teacher_disagreement_score":0.014904396,"about_ca_system_score_codex":0.006501537,"about_ca_system_score_gemma":0.0040337173,"threshold_uncertainty_score":0.04986024},"labels":[],"label_agreement":null},{"id":"W1986330160","doi":"10.1145/564870.564908","title":"Gossiping to reach consensus","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Gossip; Omega; Binary logarithm; Upper and lower bounds; Combinatorics; Log-log plot; Computer science; Communication complexity; Node (physics); Discrete mathematics; Point (geometry); Mathematics; Physics","score_opus":0.029552600338162854,"score_gpt":0.23266206014078206,"score_spread":0.2031094598026192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986330160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0663436,0.0012652343,0.9100198,0.0015725972,0.00025213053,0.00014257064,0.00011347606,0.001132096,0.019158503],"genre_scores_gemma":[0.7805599,0.0014740383,0.20583451,0.00039940863,0.00024584754,0.00038152927,0.0003412129,0.00019231722,0.010571196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990097,0.00027184706,0.00005821783,0.00022580715,0.00030967343,0.00012477321],"domain_scores_gemma":[0.9974827,0.0014900771,0.00025171376,0.00034173406,0.0002253728,0.00020837515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223307,0.00082865974,0.0009986402,0.0005343718,0.0009807677,0.0011470169,0.0010066177,0.0009818007,0.0031320374],"category_scores_gemma":[0.0057805753,0.0003408351,0.0006483306,0.0006404647,0.0014534987,0.0021139665,0.0018994035,0.0014515505,0.0008307881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032934442,0.000106306434,0.0006395969,0.0005480206,0.0001483102,0.00046922071,0.00077474007,0.62072796,0.009962756,0.29336283,0.0066378606,0.06629296],"study_design_scores_gemma":[0.00010499042,0.00014416207,0.00013086584,0.000021405374,0.00003158264,0.00008591924,0.00009837742,0.70739514,0.00277555,0.2824466,0.0067465836,0.000018751503],"about_ca_topic_score_codex":0.0013354593,"about_ca_topic_score_gemma":0.0010601307,"teacher_disagreement_score":0.0031320374,"about_ca_system_score_codex":0.0008083743,"about_ca_system_score_gemma":0.0007532373,"threshold_uncertainty_score":0.010477722},"labels":[],"label_agreement":null},{"id":"W1987584238","doi":"10.1007/s00446-010-0096-2","title":"Closing the complexity gap between FCFS mutual exclusion and mutual exclusion","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Binary logarithm; Algorithm; Parallel computing; Theoretical computer science; Distributed computing; Discrete mathematics; Mathematics; Computer network; Artificial intelligence","score_opus":0.038226657414625956,"score_gpt":0.27780160395382425,"score_spread":0.2395749465391983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987584238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07617928,0.003789555,0.86510825,0.01736369,0.0008324564,0.000116142335,0.0002064144,0.0007784577,0.035625737],"genre_scores_gemma":[0.85048586,0.002317554,0.1344388,0.001728239,0.0017606934,0.00024755677,0.000249118,0.00040226642,0.00837002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919761,0.0021478892,0.00027464636,0.000755275,0.0040856753,0.00076042966],"domain_scores_gemma":[0.9604365,0.029191868,0.0011986332,0.006360447,0.0019454171,0.00086714467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046311687,0.00072775176,0.001650971,0.001026412,0.0025780164,0.0051874756,0.002765178,0.002845907,0.0060449285],"category_scores_gemma":[0.028554255,0.0006979965,0.001228112,0.0015935821,0.005526633,0.021250676,0.0072547547,0.006435995,0.00074548495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041447824,0.00008642584,0.000665582,0.00020764656,0.000047323596,0.000102052494,0.0005296917,0.040124357,0.00161715,0.8994859,0.004850097,0.05186936],"study_design_scores_gemma":[0.00005913375,0.000044853867,0.0002860832,0.000037672464,0.000026465576,0.00013212951,0.00011829779,0.13018364,0.0017412386,0.8554233,0.011916764,0.000030386629],"about_ca_topic_score_codex":0.0030599763,"about_ca_topic_score_gemma":0.0021322384,"teacher_disagreement_score":0.0060449285,"about_ca_system_score_codex":0.003752954,"about_ca_system_score_gemma":0.0040654223,"threshold_uncertainty_score":0.027229667},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025530648803107178,"score_gpt":0.23798741467071693,"score_spread":0.21245676586760975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987782288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21405911,0.0064509315,0.72106427,0.014072699,0.00034556625,0.00023327433,0.0010630368,0.002241702,0.040469322],"genre_scores_gemma":[0.86345935,0.0017653442,0.11998005,0.0013737784,0.0008496405,0.0005357964,0.0011191018,0.0009826631,0.009934279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98697495,0.0035015463,0.00049812894,0.0023130556,0.0040636086,0.002648633],"domain_scores_gemma":[0.87100506,0.109402515,0.0048259567,0.00988602,0.0028800676,0.0020002567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008106572,0.0019657642,0.0029765463,0.0025907352,0.0027593854,0.004725211,0.005669551,0.0031715564,0.008904463],"category_scores_gemma":[0.063059986,0.0011138545,0.0024414663,0.0029326014,0.004878708,0.018651146,0.006381638,0.008526721,0.0013747149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015685961,0.000731982,0.004389472,0.0009228145,0.00019691259,0.0003562841,0.0011699492,0.36903113,0.012661264,0.5229876,0.012856533,0.073127456],"study_design_scores_gemma":[0.00009885614,0.00014009373,0.0008648727,0.00006910162,0.00007190449,0.00018060158,0.0001605665,0.56416106,0.0061877053,0.42468426,0.003319968,0.00006104958],"about_ca_topic_score_codex":0.0018950838,"about_ca_topic_score_gemma":0.0016322596,"teacher_disagreement_score":0.008904463,"about_ca_system_score_codex":0.005598148,"about_ca_system_score_gemma":0.0026607318,"threshold_uncertainty_score":0.04287219},"labels":[],"label_agreement":null},{"id":"W1989510234","doi":"10.1109/ispdc.2013.22","title":"Estimating Reliability of Workers for Cooperative Distributed Computing","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Supercomputer; Probability distribution; Algorithm; Computation; Theoretical computer science; Parallel computing; Mathematics; Statistics; Programming language","score_opus":0.013396976913438864,"score_gpt":0.26078144423874067,"score_spread":0.2473844673253018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989510234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14059466,0.00034643782,0.8560485,0.00041782658,0.000051853272,0.00012984508,0.00022899933,0.00088079093,0.0013010022],"genre_scores_gemma":[0.89522237,0.00021809353,0.10223057,0.000059381997,0.00009660155,0.00023309134,0.0005080822,0.0001321213,0.0012997158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965649,0.001185391,0.00016536305,0.00088380626,0.00087839365,0.00032207166],"domain_scores_gemma":[0.9707046,0.017806325,0.0026869765,0.0047914973,0.0031517919,0.0008587696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005422721,0.0010511911,0.0014956298,0.0017868563,0.00085972145,0.0013991379,0.0025638824,0.0011939798,0.0012317525],"category_scores_gemma":[0.047026273,0.0007639334,0.00082376366,0.0011724253,0.0014082796,0.0017912996,0.0017623679,0.0013893448,0.0006843207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005176455,0.00011816812,0.0138257975,0.00013173456,0.0001007337,0.0001455325,0.0003536893,0.9144328,0.0036448587,0.018027188,0.002317297,0.046384547],"study_design_scores_gemma":[0.000013808732,0.000037892707,0.0007134871,0.0000069314383,0.00000870132,0.000024255518,0.000035683202,0.984212,0.000989092,0.013677935,0.00027061786,0.000009597447],"about_ca_topic_score_codex":0.0050823702,"about_ca_topic_score_gemma":0.0026253571,"teacher_disagreement_score":0.005422721,"about_ca_system_score_codex":0.0017449843,"about_ca_system_score_gemma":0.0017734321,"threshold_uncertainty_score":0.028678477},"labels":[],"label_agreement":null},{"id":"W1991072415","doi":"10.1007/s00446-010-0106-4","title":"Adaptive progress: a gracefully-degrading liveness property","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Liveness; Computer science; Abstraction; Implementation; Property (philosophy); Object (grammar); Process (computing); Distributed computing; Bridge (graph theory); Key (lock); Simple (philosophy); Theoretical computer science; Programming language; Computer security; Artificial intelligence","score_opus":0.014107387576893332,"score_gpt":0.24322895281708548,"score_spread":0.22912156524019214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991072415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13953647,0.0005146182,0.8357943,0.0014982807,0.00019918139,0.00011490703,0.00023788182,0.0028101313,0.019294096],"genre_scores_gemma":[0.94161797,0.00033935113,0.04787702,0.00023425794,0.00019176291,0.00017057912,0.00014352221,0.00046221633,0.008963392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761486,0.00036204004,0.0001705807,0.0005375867,0.0008623173,0.00045266617],"domain_scores_gemma":[0.9717452,0.011091392,0.0026759203,0.009693335,0.0033001164,0.0014940941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026610862,0.0009607295,0.001044904,0.0010821507,0.0015334907,0.0027166528,0.0021393339,0.0015475722,0.0034612452],"category_scores_gemma":[0.024997042,0.0005245051,0.0006659254,0.0010993294,0.003692062,0.006537035,0.0038639987,0.0041680136,0.00085383817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009281849,0.00016380734,0.0023526668,0.0002466607,0.00006386367,0.00086140144,0.0014170201,0.091395825,0.03809454,0.77768624,0.0043063937,0.0824834],"study_design_scores_gemma":[0.00014353014,0.00027012982,0.00053164456,0.0000356711,0.00008272955,0.00074136193,0.0002122776,0.32282147,0.023440063,0.64439195,0.0072737574,0.000055373705],"about_ca_topic_score_codex":0.00069657015,"about_ca_topic_score_gemma":0.00043194083,"teacher_disagreement_score":0.0034612452,"about_ca_system_score_codex":0.0008841741,"about_ca_system_score_gemma":0.0013260727,"threshold_uncertainty_score":0.014073312},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027744266622154425,"score_gpt":0.23357638033745115,"score_spread":0.20583211371529672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991152532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020593239,0.0020534913,0.5586576,0.0024090335,0.0022286188,0.0010866041,0.0026475787,0.15088786,0.259436],"genre_scores_gemma":[0.23174223,0.0017311702,0.44332314,0.0032123236,0.0008964562,0.00094294455,0.00859228,0.015332325,0.2942271],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973404,0.00044007777,0.00019404858,0.00067573186,0.0009692279,0.00038057272],"domain_scores_gemma":[0.9963398,0.0004115139,0.00023497161,0.0019676692,0.0006197426,0.00042638325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027060902,0.0009686444,0.0008183386,0.001577724,0.0016510976,0.004675694,0.0032834886,0.0021252017,0.04922209],"category_scores_gemma":[0.0067121685,0.00064359733,0.0011874704,0.0010383036,0.0010206389,0.007057968,0.005991506,0.0018909404,0.036579136],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011809233,0.00036993515,0.0033983358,0.0007688975,0.0001300836,0.0008509093,0.0011767979,0.0037748304,0.030930996,0.27296996,0.1836262,0.5008222],"study_design_scores_gemma":[0.00014910728,0.00033229348,0.0013359869,0.00014101183,0.00008786339,0.0009125928,0.00023643248,0.016370254,0.024198426,0.052553624,0.9035368,0.00014557267],"about_ca_topic_score_codex":0.0018431338,"about_ca_topic_score_gemma":0.00134087,"teacher_disagreement_score":0.04922209,"about_ca_system_score_codex":0.0010245645,"about_ca_system_score_gemma":0.0019874885,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01836708407344712,"score_gpt":0.2308340455114102,"score_spread":0.2124669614379631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991407706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106105156,0.0012694171,0.88375574,0.00051744323,0.00016364563,0.00014197509,0.000023448232,0.002838549,0.0051845587],"genre_scores_gemma":[0.65028363,0.0009381132,0.3440086,0.0001450567,0.00009759854,0.00009724372,0.00006916392,0.00019869661,0.004161862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985127,0.00050068664,0.00013572298,0.00018986243,0.00050134753,0.00015974758],"domain_scores_gemma":[0.9956899,0.0012173774,0.00058846094,0.0017381316,0.0006183501,0.0001476164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914499,0.00059835933,0.0005627496,0.00058577023,0.00053844985,0.0013264826,0.0014489416,0.0008980994,0.0016392003],"category_scores_gemma":[0.0058341087,0.00032104237,0.00043649165,0.0005385656,0.00069471286,0.002019575,0.0013960825,0.00096125685,0.00074745365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003752089,0.00028710655,0.00461173,0.00038725242,0.000111894165,0.0005313214,0.00088387565,0.33114022,0.16322076,0.04115138,0.0040310454,0.45326808],"study_design_scores_gemma":[0.0001231284,0.00056989567,0.0014372251,0.00006965391,0.00013989607,0.0008157292,0.00023226273,0.8122923,0.10638086,0.035178423,0.04268274,0.000077929704],"about_ca_topic_score_codex":0.0009346125,"about_ca_topic_score_gemma":0.0007238293,"teacher_disagreement_score":0.0016392003,"about_ca_system_score_codex":0.00038882784,"about_ca_system_score_gemma":0.00055008073,"threshold_uncertainty_score":0.007887661},"labels":[],"label_agreement":null},{"id":"W1991558558","doi":"10.1007/s00446-015-0261-8","title":"Universal constructions that ensure disjoint-access parallelism and wait-freedom","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Computer science; Parallelism (grammar); Parallel computing; Data parallelism; Task parallelism; Crash; Degrees of freedom (physics and chemistry); Base (topology); Process (computing); Distributed computing; Programming language; Mathematics","score_opus":0.01891117604027799,"score_gpt":0.2416308932677721,"score_spread":0.22271971722749412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991558558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04724572,0.0003495073,0.92959845,0.0013011532,0.00028610002,0.00015513982,0.00022686161,0.0037937143,0.017043453],"genre_scores_gemma":[0.7870108,0.00046128666,0.19772011,0.0013609825,0.00036912892,0.00050916284,0.00035628068,0.0020160147,0.010196229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99225086,0.001446018,0.00062526035,0.0017384425,0.0018128536,0.00212661],"domain_scores_gemma":[0.9702324,0.011822645,0.0015266712,0.012837687,0.0017890877,0.0017914625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062611587,0.0013428618,0.0025149193,0.0014557629,0.004901464,0.0053123995,0.0037530023,0.0026134008,0.00666745],"category_scores_gemma":[0.02623344,0.0022383055,0.002673709,0.0026893292,0.009840058,0.01695075,0.017035693,0.009264467,0.0016729987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011909088,0.000052770713,0.0002315183,0.00008077504,0.000018072418,0.000043066626,0.00048002528,0.0022467393,0.0017670819,0.9834238,0.0016777513,0.009859366],"study_design_scores_gemma":[0.00006581372,0.00003061682,0.000088837805,0.000035770496,0.00006762485,0.00006864834,0.00008991758,0.009442411,0.005140097,0.97915274,0.0057757087,0.000041813324],"about_ca_topic_score_codex":0.0009090218,"about_ca_topic_score_gemma":0.0011620949,"teacher_disagreement_score":0.00666745,"about_ca_system_score_codex":0.0024078866,"about_ca_system_score_gemma":0.0034053107,"threshold_uncertainty_score":0.033112526},"labels":[],"label_agreement":null},{"id":"W1992053203","doi":"10.1109/pdcat.2012.132","title":"TRT: Transactional Read Tracking","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Transactional memory; Software transactional memory; Computer science; Exploit; Consistency (knowledge bases); Commit; Transactional leadership; Overhead (engineering); Transaction processing; Distributed computing; Consistency model; Database transaction; Parallel computing; Data consistency; Operating system; Database; Computer security; Artificial intelligence; Psychology","score_opus":0.024217883787263278,"score_gpt":0.2531857349727783,"score_spread":0.22896785118551502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992053203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022590222,0.0020692404,0.8692691,0.0004279638,0.0008147881,0.0008397897,0.0017421162,0.08561797,0.016628783],"genre_scores_gemma":[0.3211465,0.0016622219,0.63010657,0.00117534,0.0007304565,0.0007668512,0.0061978824,0.0043667452,0.033847477],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701726,0.00041992462,0.00030988216,0.0006046917,0.0013468823,0.0003014325],"domain_scores_gemma":[0.9955597,0.00072556635,0.0005686873,0.0019125629,0.001000848,0.00023267587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018698169,0.0009803752,0.0008267195,0.001457526,0.0008191948,0.0018630257,0.0033473996,0.0011571402,0.007899731],"category_scores_gemma":[0.004641489,0.0005099322,0.0006117427,0.0018977139,0.00079165486,0.0026658666,0.0014851686,0.0014612372,0.005944165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001323361,0.0003746754,0.004481432,0.0007933043,0.0001317612,0.0005946399,0.00027079153,0.0087909065,0.07864081,0.025848875,0.065465406,0.813284],"study_design_scores_gemma":[0.0006494276,0.0020478368,0.0041830386,0.00021576529,0.000328511,0.0042923763,0.0001932567,0.27459902,0.30696148,0.029521441,0.376566,0.00044188325],"about_ca_topic_score_codex":0.00142009,"about_ca_topic_score_gemma":0.0012848893,"teacher_disagreement_score":0.007899731,"about_ca_system_score_codex":0.00047677237,"about_ca_system_score_gemma":0.0015483341,"threshold_uncertainty_score":0.02642721},"labels":[],"label_agreement":null},{"id":"W1992598604","doi":"10.1007/s00446-011-0131-y","title":"How much memory is needed for leader election","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Logarithm; Class (philosophy); Computer science; Node (physics); Theory of computation; Exponential function; Topology (electrical circuits); Discrete mathematics; Binary logarithm; Combinatorics; Mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.041901846813373694,"score_gpt":0.24376545351609982,"score_spread":0.20186360670272613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992598604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58957165,0.008946066,0.30567023,0.01791267,0.0035045808,0.00022893878,0.0013072328,0.005579461,0.06727925],"genre_scores_gemma":[0.9756511,0.0005039293,0.014620424,0.00037016455,0.00022430076,0.000056718276,0.0002319666,0.00028033342,0.008061062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.00028411468,0.00007843652,0.0002310993,0.00022078794,0.00038794155],"domain_scores_gemma":[0.99421835,0.00257516,0.00037202204,0.0016229075,0.000780017,0.00043151318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009947054,0.000427111,0.0009296086,0.0006105321,0.0013649,0.0026288708,0.0011056061,0.0010889648,0.016518654],"category_scores_gemma":[0.011159431,0.00048914255,0.00045676614,0.00056477106,0.00070452446,0.007838663,0.0011078017,0.0011355841,0.0034958522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005840114,0.00050807255,0.01513906,0.00137937,0.00036917833,0.0006143629,0.0009231056,0.0902732,0.106142744,0.07322182,0.036165897,0.669423],"study_design_scores_gemma":[0.0008870071,0.0011278928,0.012383748,0.0003356898,0.00077903166,0.0014109319,0.0032016921,0.57203937,0.15449211,0.20748831,0.045625295,0.00022890452],"about_ca_topic_score_codex":0.0015272377,"about_ca_topic_score_gemma":0.0034770342,"teacher_disagreement_score":0.016518654,"about_ca_system_score_codex":0.000694736,"about_ca_system_score_gemma":0.0015388897,"threshold_uncertainty_score":0.05526042},"labels":[],"label_agreement":null},{"id":"W1994064073","doi":"10.1016/j.parco.2006.08.007","title":"Quasi-atomic recovery for distributed agents","year":2006,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Distributed computing; Asynchronous communication; Protocol (science); Overhead (engineering); Two-phase commit protocol; Simple (philosophy); Locality; Computer network; Algorithm; Operating system; Distributed transaction; Transaction processing; Database transaction; Programming language","score_opus":0.017657913512586824,"score_gpt":0.2589437906140779,"score_spread":0.24128587710149108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994064073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042297784,0.0003319054,0.9480565,0.00081250985,0.00026979964,0.000072181785,0.00003442121,0.00095689687,0.007167852],"genre_scores_gemma":[0.78561383,0.00027997055,0.19678357,0.0002770999,0.00017043503,0.0001851052,0.0001207813,0.00027384455,0.01629521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909794,0.0002676413,0.000046592904,0.00012201074,0.00029533173,0.00017044958],"domain_scores_gemma":[0.99654716,0.001202076,0.00022252611,0.0013234052,0.0004778875,0.00022693495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021514713,0.0003472066,0.0007209205,0.00041148352,0.0014649134,0.0015278951,0.0020218329,0.0010067486,0.0048005404],"category_scores_gemma":[0.0061900676,0.00048239523,0.00054242404,0.00046989784,0.0020381517,0.002626705,0.0026578724,0.0024198913,0.00067766325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007926669,0.0001483286,0.00068068353,0.00017842211,0.000047951275,0.00024028994,0.00053763937,0.06810389,0.010672412,0.84054697,0.0063386536,0.07171211],"study_design_scores_gemma":[0.00012300373,0.00010491589,0.00029543764,0.000014004496,0.000036762267,0.00008828925,0.00010037166,0.52263784,0.003653638,0.46781066,0.005112098,0.000022956105],"about_ca_topic_score_codex":0.002125843,"about_ca_topic_score_gemma":0.002258133,"teacher_disagreement_score":0.0048005404,"about_ca_system_score_codex":0.00075617264,"about_ca_system_score_gemma":0.0013643237,"threshold_uncertainty_score":0.016059339},"labels":[],"label_agreement":null},{"id":"W1994104531","doi":"10.1109/icci-cc.2012.6311177","title":"The T-Sat1 Nanosatellite Team of Teams","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Aerospace; Engineering management; Computer science; Government (linguistics); Systems engineering; Informatics; Satellite; Process management; Engineering; Software engineering","score_opus":0.00755113129630063,"score_gpt":0.22774974649179608,"score_spread":0.22019861519549544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994104531","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35734564,0.0010090619,0.35615695,0.015775152,0.0025951928,0.0019699843,0.0026539061,0.008885441,0.2536086],"genre_scores_gemma":[0.33043936,0.00030738814,0.16224118,0.0013218374,0.00025030764,0.00090003095,0.0043798187,0.0012452278,0.4989148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748576,0.00075374235,0.000082485494,0.00047048373,0.0008534872,0.00035392036],"domain_scores_gemma":[0.992618,0.00037027217,0.00026784302,0.00051933894,0.0033358044,0.002888618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041177436,0.00047310579,0.00026094762,0.0007673235,0.0029017378,0.0025433274,0.0010868552,0.00063530356,0.022503655],"category_scores_gemma":[0.0035423366,0.0002783434,0.00032535795,0.0004197531,0.0009039039,0.00091656303,0.0033754252,0.0011666318,0.009362442],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024753073,0.00083871547,0.02636289,0.00030906865,0.000071093345,0.0010917536,0.0078586135,0.01710515,0.046590474,0.054844093,0.34891328,0.49353957],"study_design_scores_gemma":[0.00024574617,0.0008448207,0.0043818797,0.000076751385,0.000021084563,0.00033904274,0.002800236,0.02385888,0.013775538,0.0034920617,0.9500954,0.000068499256],"about_ca_topic_score_codex":0.01029036,"about_ca_topic_score_gemma":0.02273744,"teacher_disagreement_score":0.022503655,"about_ca_system_score_codex":0.003087271,"about_ca_system_score_gemma":0.008766383,"threshold_uncertainty_score":0.075282216},"labels":[],"label_agreement":null},{"id":"W1998896855","doi":"10.1016/j.tcs.2014.10.015","title":"Dealing with undependable workers in decentralized network supercomputing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Computer science; Binary logarithm; Bounded function; Set (abstract data type); Logarithm; Time complexity; Supercomputer; Adversary; Parallel computing; Upper and lower bounds; Computational complexity theory; Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.005534214958432437,"score_gpt":0.21928154366739452,"score_spread":0.2137473287089621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998896855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5551553,0.00089779653,0.42634943,0.004513173,0.0004989794,0.00012648384,0.000113872644,0.00061133417,0.011733586],"genre_scores_gemma":[0.962766,0.00019792179,0.03121606,0.00015374745,0.00018702955,0.00007250031,0.000054114636,0.00008804589,0.005264545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973206,0.0009953597,0.000126603,0.0004071367,0.0005848938,0.0005653447],"domain_scores_gemma":[0.9877281,0.0064465627,0.0009849798,0.0029985562,0.0009761103,0.00086567114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048730443,0.00037363422,0.0011142843,0.00058209884,0.0032418869,0.0025885147,0.0030916682,0.0020504927,0.0031005458],"category_scores_gemma":[0.019081997,0.0008027863,0.0003755739,0.0011190604,0.0027348956,0.0036338575,0.0037974867,0.002058577,0.00041301205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015818429,0.00046353423,0.013225837,0.00031859626,0.00013034196,0.001655986,0.0023491916,0.63339716,0.008022042,0.2458083,0.010900709,0.08214649],"study_design_scores_gemma":[0.0000853017,0.000077741366,0.00091078936,0.000018658371,0.00003354138,0.00016868327,0.0005445111,0.8339136,0.0029186422,0.15750317,0.0037988378,0.000026561236],"about_ca_topic_score_codex":0.0019146841,"about_ca_topic_score_gemma":0.0029060303,"teacher_disagreement_score":0.0048730443,"about_ca_system_score_codex":0.0009132622,"about_ca_system_score_gemma":0.0017604177,"threshold_uncertainty_score":0.02577138},"labels":[],"label_agreement":null},{"id":"W2000185635","doi":"10.1006/jpdc.2002.1861","title":"Efficient Selection and Sorting Schemes Using Coteries for Processing Large Distributed Files","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sorting; Node (physics); Quicksort; Sorting algorithm; Key (lock); Selection (genetic algorithm); Ranking (information retrieval); Scheme (mathematics); Theoretical computer science; Binary logarithm; Sorting network; Distributed computing; Computer network; sort; Algorithm; Mathematics; Discrete mathematics; Information retrieval; Operating system; Artificial intelligence","score_opus":0.024613023142266023,"score_gpt":0.26770370086357137,"score_spread":0.24309067772130535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000185635","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28390867,0.0011065431,0.69384897,0.00059184775,0.0005841061,0.00038059265,0.00046118782,0.0109381,0.00818003],"genre_scores_gemma":[0.44894266,0.00035658493,0.5310459,0.000325191,0.00010718911,0.00021454913,0.00091910764,0.0004264258,0.017662343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.0001199651,0.000087899854,0.0001351192,0.00021188502,0.00013222413],"domain_scores_gemma":[0.99741167,0.0005963042,0.00018465193,0.00089259446,0.0006955372,0.0002192729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144407,0.00072361075,0.00094573846,0.001513225,0.0018134734,0.0018561895,0.0020987531,0.00080506847,0.007881727],"category_scores_gemma":[0.002670348,0.00054577994,0.0004512091,0.002668609,0.0006280877,0.0019190749,0.0017167535,0.00069714186,0.0014692436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049469536,0.00056098384,0.00496538,0.00033942034,0.00012760093,0.00025151277,0.0004898404,0.024987426,0.13491228,0.027943138,0.019462248,0.7810132],"study_design_scores_gemma":[0.0010634131,0.0014644377,0.004717963,0.00008207265,0.00022611335,0.0007336553,0.000532073,0.7287668,0.1894698,0.03541285,0.037342284,0.00018852127],"about_ca_topic_score_codex":0.0048452993,"about_ca_topic_score_gemma":0.012463503,"teacher_disagreement_score":0.007881727,"about_ca_system_score_codex":0.0011864982,"about_ca_system_score_gemma":0.0016941563,"threshold_uncertainty_score":0.026367009},"labels":[],"label_agreement":null},{"id":"W2000266365","doi":"10.1109/ainaw.2007.73","title":"An Adaptable Crash Faults Detector for Mobile Ad-Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Crash; Computer science; Host (biology); Completeness (order theory); Computer network; Wireless ad hoc network; Mobile ad hoc network; Block (permutation group theory); Detector; Distributed computing; Wireless; Computer security; Telecommunications; Operating system","score_opus":0.01108148263253072,"score_gpt":0.26786576372107357,"score_spread":0.25678428108854284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000266365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037981644,0.0010849959,0.95813006,0.00038627384,0.00014411131,0.000096246345,0.000068913185,0.00093530753,0.0011724763],"genre_scores_gemma":[0.85843885,0.0006760449,0.13870507,0.00019974797,0.00015109045,0.000120301964,0.00014608467,0.000047602567,0.0015152323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984193,0.00034124267,0.00011424214,0.00027246584,0.0007114665,0.00014127957],"domain_scores_gemma":[0.992492,0.00409078,0.0006526968,0.00094280374,0.0015087471,0.00031292465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024562997,0.0004657033,0.00082531926,0.0011390792,0.00054580835,0.0012124152,0.0016563934,0.0010168634,0.00062545034],"category_scores_gemma":[0.013140884,0.00036050566,0.00036996364,0.0007691119,0.0016819471,0.0023017938,0.0018883932,0.0015633748,0.00018414065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094624335,0.00021491057,0.01380921,0.00060394796,0.00019576537,0.0010794295,0.00074929436,0.34130186,0.04373341,0.19387738,0.0066026975,0.3968859],"study_design_scores_gemma":[0.000042233198,0.0004052568,0.0008840057,0.00002883385,0.000055319,0.0004668861,0.000059336002,0.93792427,0.0121384505,0.042853013,0.0050986996,0.00004368146],"about_ca_topic_score_codex":0.00073206966,"about_ca_topic_score_gemma":0.00044155127,"teacher_disagreement_score":0.0024562997,"about_ca_system_score_codex":0.0007792049,"about_ca_system_score_gemma":0.00093017425,"threshold_uncertainty_score":0.012990296},"labels":[],"label_agreement":null},{"id":"W2000625430","doi":"10.1145/2000832.2000833","title":"Application-specific signatures for transactional memory in soft processors","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transactional memory; Field-programmable gate array; Scalability; Network packet; Synchronization (alternating current); Embedded system; Thread (computing); Parallel computing; Computer hardware; Operating system; Computer network; Channel (broadcasting); Database transaction","score_opus":0.023696704151688532,"score_gpt":0.23223356286591015,"score_spread":0.20853685871422162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000625430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62785846,0.0009986905,0.36134842,0.0002159615,0.00015070618,0.00015809546,0.00015196223,0.00422617,0.0048915334],"genre_scores_gemma":[0.93766385,0.00009548671,0.06097373,0.000083879626,0.000018386376,0.000060217484,0.0000779293,0.000067623034,0.0009589038],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887604,0.0002664609,0.00012658068,0.00012647557,0.00048566435,0.00011867296],"domain_scores_gemma":[0.99650276,0.00093548634,0.000732551,0.001269441,0.0004346936,0.00012500824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800901,0.00038110785,0.00040092075,0.00072630896,0.00038759212,0.0011829614,0.0011998815,0.00040924372,0.0014890275],"category_scores_gemma":[0.004004382,0.00025873014,0.00019304744,0.00072732545,0.0005860207,0.0015332644,0.0008121902,0.00073984894,0.00029171474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023558447,0.0005098116,0.013773889,0.0007098147,0.00012195321,0.00078109966,0.0005620837,0.058328703,0.45875877,0.03333028,0.0029594023,0.42780823],"study_design_scores_gemma":[0.00010952577,0.001262916,0.0042641857,0.00006934098,0.00006991476,0.00095033075,0.00026621984,0.40559447,0.5687794,0.008609075,0.009940066,0.00008455848],"about_ca_topic_score_codex":0.0003214813,"about_ca_topic_score_gemma":0.00078742986,"teacher_disagreement_score":0.0014890275,"about_ca_system_score_codex":0.00053374574,"about_ca_system_score_gemma":0.0007717373,"threshold_uncertainty_score":0.00498122},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02488932264454965,"score_gpt":0.22436284946677215,"score_spread":0.1994735268222225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001271834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053754296,0.0004539896,0.9241758,0.0024947757,0.00030521292,0.0004940758,0.00017897185,0.0039336653,0.014209201],"genre_scores_gemma":[0.5928252,0.00047563427,0.39146847,0.00066661986,0.0001848067,0.00083538773,0.00030576455,0.0014260458,0.0118121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939178,0.0014436,0.00041631382,0.00081640563,0.0023298825,0.0010759431],"domain_scores_gemma":[0.9836426,0.0056150206,0.0021460028,0.006553615,0.0015459806,0.00049687695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941848,0.0014313135,0.0022196833,0.0010984108,0.0033450525,0.0034272792,0.003895966,0.0023055212,0.0073129577],"category_scores_gemma":[0.01936636,0.0006657959,0.0014961296,0.001030408,0.0038207378,0.010434692,0.008190532,0.006539042,0.0038300012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030421636,0.0006460231,0.0038220247,0.0011210834,0.00034957964,0.0007057488,0.0027029205,0.053615555,0.14716236,0.4894794,0.021024024,0.27632907],"study_design_scores_gemma":[0.00058145623,0.0010751332,0.0009813249,0.00031855007,0.00019552799,0.001131266,0.00077575166,0.3462787,0.1824556,0.39560908,0.070350096,0.0002474748],"about_ca_topic_score_codex":0.0010390299,"about_ca_topic_score_gemma":0.0007958755,"teacher_disagreement_score":0.0073129577,"about_ca_system_score_codex":0.0017249263,"about_ca_system_score_gemma":0.003355883,"threshold_uncertainty_score":0.026135325},"labels":[],"label_agreement":null},{"id":"W2001389392","doi":"10.1109/icws.2004.35","title":"Comparison of UDDI registry replication strategies","year":2004,"lang":"en","type":"article","venue":"International Conference on Web Services","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Computer science; Middleware (distributed applications); Throughput; Web service; Distributed computing; World Wide Web; Operating system; Wireless; Biology","score_opus":0.04805234651477051,"score_gpt":0.3574664383000399,"score_spread":0.30941409178526935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001389392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4179183,0.027427156,0.42370448,0.0032372514,0.0016389798,0.0038369475,0.003483729,0.024151627,0.094601564],"genre_scores_gemma":[0.65163183,0.008716054,0.3174901,0.000623343,0.00014058959,0.0010911227,0.006201332,0.0011832018,0.01292239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98548305,0.0046009417,0.002430902,0.0010628355,0.0052855047,0.0011368856],"domain_scores_gemma":[0.977967,0.0074042277,0.0010774571,0.0055607995,0.006958301,0.0010320758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013846378,0.0013547615,0.0013828218,0.003912013,0.0013101746,0.0042571733,0.0048230155,0.0017274687,0.0020143038],"category_scores_gemma":[0.025102748,0.000935799,0.0010238093,0.0051198513,0.00066308246,0.004420707,0.002020823,0.0011191847,0.0018883869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004712466,0.0016279637,0.01690126,0.0028245097,0.0006487219,0.00056442025,0.0015552816,0.0961086,0.055754326,0.06249246,0.03802589,0.71878403],"study_design_scores_gemma":[0.0015556165,0.0038847006,0.021381069,0.0006256239,0.0010875307,0.0028678398,0.0052585113,0.58499026,0.14591484,0.0169242,0.21473081,0.0007790532],"about_ca_topic_score_codex":0.003930071,"about_ca_topic_score_gemma":0.0034598294,"teacher_disagreement_score":0.013846378,"about_ca_system_score_codex":0.0025141765,"about_ca_system_score_gemma":0.002569868,"threshold_uncertainty_score":0.073227525},"labels":[],"label_agreement":null},{"id":"W2001652799","doi":"10.1109/mdm.2010.58","title":"TANGO: A Flexible Mobility-Enabled Architecture for Online and Offline Mobile Enterprise Applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Business logic; Mobile device; Architecture; Interoperability; Mobile computing; Distributed computing; Computer network; Database; World Wide Web","score_opus":0.006968432396533487,"score_gpt":0.261554387063215,"score_spread":0.2545859546666815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001652799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045064345,0.0009766412,0.88351256,0.0008439181,0.0003404774,0.00073450175,0.00040682053,0.03335383,0.034766886],"genre_scores_gemma":[0.5958066,0.0011369127,0.34644657,0.0008960938,0.00015486886,0.00088818476,0.0024044446,0.0022852856,0.049980998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993567,0.00008119258,0.00008110992,0.000109994864,0.00017647304,0.00019459895],"domain_scores_gemma":[0.9994893,0.000043481024,0.00004971735,0.00013862681,0.00011676678,0.00016216752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072956557,0.00096891937,0.00049895374,0.0008722167,0.0011264124,0.00249063,0.0025332456,0.0014573782,0.0041441787],"category_scores_gemma":[0.0014503718,0.00061967596,0.00087545277,0.0005867352,0.000784565,0.004982024,0.0040562195,0.0018987772,0.0017879315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027445192,0.00060768315,0.009251835,0.0010606447,0.00028809241,0.0048033083,0.0045410874,0.045087315,0.15579379,0.253233,0.05997926,0.46260953],"study_design_scores_gemma":[0.000304528,0.0008719046,0.0045464872,0.0004939502,0.00039111433,0.0029524832,0.0007991465,0.45711258,0.047305238,0.0588484,0.42586124,0.00051295967],"about_ca_topic_score_codex":0.006413626,"about_ca_topic_score_gemma":0.004893607,"teacher_disagreement_score":0.006413626,"about_ca_system_score_codex":0.0012482652,"about_ca_system_score_gemma":0.0017108341,"threshold_uncertainty_score":0.013863683},"labels":[],"label_agreement":null},{"id":"W2002220286","doi":"10.1007/s00778-013-0312-3","title":"Eliminating unscalable communication in transaction processing","year":2013,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Online transaction processing; Transaction processing; Transaction processing system; Scalability; Distributed transaction; Distributed computing; Database transaction; Concurrency; Thread (computing); Compensating transaction; Operating system; Database","score_opus":0.010700441848596995,"score_gpt":0.2297111019525497,"score_spread":0.2190106601039527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002220286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1827174,0.002779995,0.7932744,0.0024803123,0.00070859387,0.00028336985,0.00014938887,0.005859603,0.011746889],"genre_scores_gemma":[0.833163,0.0006302186,0.15682341,0.0007536038,0.00042904916,0.0002257582,0.00020049422,0.00084043125,0.006933896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989915,0.0035112286,0.00070665136,0.00080027524,0.0038246855,0.0012420975],"domain_scores_gemma":[0.9593445,0.016217167,0.002244409,0.017136479,0.004272508,0.000784993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050586015,0.0008664032,0.0012831112,0.0013141874,0.0030625197,0.0028554518,0.0046349643,0.0019687638,0.004516142],"category_scores_gemma":[0.02680689,0.0012954039,0.0007330774,0.0025428196,0.0032507295,0.008164631,0.004316665,0.003966322,0.0013718226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028226261,0.0011173789,0.008083401,0.0008209459,0.00015075563,0.00055311417,0.0018818404,0.12415482,0.028460614,0.17732315,0.01733802,0.6372934],"study_design_scores_gemma":[0.000300485,0.0006723965,0.0011926524,0.00012844923,0.00024257314,0.00042693884,0.0006449567,0.6871874,0.05421243,0.23705265,0.017837266,0.00010180201],"about_ca_topic_score_codex":0.0019371207,"about_ca_topic_score_gemma":0.0034191941,"teacher_disagreement_score":0.0050586015,"about_ca_system_score_codex":0.0013057404,"about_ca_system_score_gemma":0.0043217037,"threshold_uncertainty_score":0.02675277},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007595682322297699,"score_gpt":0.21353945058418589,"score_spread":0.20594376826188818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003895614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86842793,0.00042018358,0.123781554,0.00019309881,0.000035434216,0.000091221686,0.00003854301,0.0040606237,0.0029514465],"genre_scores_gemma":[0.93197817,0.0000786844,0.06691224,0.000037158596,0.000014252844,0.000052395124,0.00007359557,0.00014858267,0.0007048807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983304,0.0004498353,0.00008896353,0.0002935381,0.00066841365,0.00016878512],"domain_scores_gemma":[0.99712163,0.00086203765,0.00024459002,0.0010712002,0.0004502433,0.00025021817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013536448,0.0006603442,0.00056081417,0.0005310379,0.00069117424,0.0014210937,0.002171649,0.0005399534,0.00064414646],"category_scores_gemma":[0.0042243144,0.0004623803,0.00030128547,0.0010362881,0.00082688266,0.00219372,0.0013238109,0.0008878599,0.00014772743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011210903,0.000710463,0.01768673,0.0002570272,0.00015466558,0.000633095,0.0007985559,0.58148485,0.16760759,0.01770788,0.0026441372,0.20919387],"study_design_scores_gemma":[0.00008595133,0.0002060456,0.0012923686,0.0000041792514,0.00002719461,0.00008048127,0.00005206018,0.9675907,0.026407067,0.0030276447,0.0012037255,0.000022552003],"about_ca_topic_score_codex":0.0024745585,"about_ca_topic_score_gemma":0.0022776471,"teacher_disagreement_score":0.0024745585,"about_ca_system_score_codex":0.0008501116,"about_ca_system_score_gemma":0.00092107506,"threshold_uncertainty_score":0.0071588755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09131539780630715,"score_gpt":0.3441698489587792,"score_spread":0.25285445115247207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005064465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616504,0.0057506547,0.0103280265,0.00036397914,0.00019829895,0.00013226234,0.003399296,0.005339282,0.012837805],"genre_scores_gemma":[0.9791764,0.00054775085,0.012036156,0.00009281393,0.00005188432,0.00014739828,0.005245593,0.00035372333,0.0023482821],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99451786,0.00074409717,0.0004029172,0.00077570684,0.0029343576,0.00062504626],"domain_scores_gemma":[0.9744521,0.011374628,0.0015895723,0.002919444,0.0087689385,0.0008952829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00270001,0.0010517291,0.0006980996,0.0027335135,0.0005093519,0.0011610991,0.0021635413,0.0006726419,0.0030208013],"category_scores_gemma":[0.013905524,0.00035409795,0.00031811843,0.0057070004,0.0007964863,0.0031725287,0.000680071,0.00074113434,0.00070997584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009145373,0.001679474,0.07538126,0.003796031,0.0006171502,0.00074729463,0.0007691759,0.15417317,0.16861242,0.013509906,0.058531556,0.51303715],"study_design_scores_gemma":[0.0005383781,0.006713886,0.11264316,0.0002057332,0.0005602876,0.0008722952,0.0011365911,0.5329085,0.30503944,0.004369594,0.034781177,0.00023094857],"about_ca_topic_score_codex":0.0037221508,"about_ca_topic_score_gemma":0.005249869,"teacher_disagreement_score":0.0037221508,"about_ca_system_score_codex":0.001561295,"about_ca_system_score_gemma":0.001109464,"threshold_uncertainty_score":0.014279246},"labels":[],"label_agreement":null},{"id":"W2005147105","doi":"10.1007/s00446-011-0137-5","title":"Fully-adaptive algorithms for long-lived renaming","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto; Dalhousie University","funders":"","keywords":"Computer science; Asynchronous communication; Algorithm; Process (computing); Bounded function; Theoretical computer science; Mathematics; Programming language; Computer network","score_opus":0.0666930311508916,"score_gpt":0.2723594850737362,"score_spread":0.2056664539228446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005147105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018672392,0.00034675788,0.9777866,0.00015714286,0.0001193912,0.00005612353,0.000034371616,0.0010626507,0.0017645508],"genre_scores_gemma":[0.53925014,0.00032406233,0.4506724,0.00023341223,0.00013330982,0.00023274183,0.00022440849,0.00039816977,0.008531333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975817,0.0007209286,0.00019441826,0.000514978,0.0005782907,0.00040959896],"domain_scores_gemma":[0.99115306,0.0036006193,0.00041870587,0.0033596735,0.001108197,0.00035975815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003037067,0.00081787317,0.0015472628,0.00074068346,0.0015222867,0.0020608334,0.0041891565,0.0016541398,0.0054365546],"category_scores_gemma":[0.014530172,0.00060780416,0.0006207082,0.001094765,0.001609531,0.0061535663,0.004841792,0.0023899034,0.0010089542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012658762,0.00029716734,0.0015699723,0.00020579952,0.00012871825,0.00012825055,0.00059970253,0.41813144,0.011079141,0.19917555,0.00750439,0.35991398],"study_design_scores_gemma":[0.000059892114,0.000060464175,0.00009678665,0.000010789513,0.000017639763,0.000052806892,0.000045277025,0.92448515,0.0020228236,0.071188,0.0019343188,0.000026001822],"about_ca_topic_score_codex":0.002471926,"about_ca_topic_score_gemma":0.003271628,"teacher_disagreement_score":0.0054365546,"about_ca_system_score_codex":0.0010255075,"about_ca_system_score_gemma":0.0015938028,"threshold_uncertainty_score":0.018187165},"labels":[],"label_agreement":null},{"id":"W2005304136","doi":"10.1007/s00224-013-9448-1","title":"Tight Bounds for Adopt-Commit Objects","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commit; Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Matching (statistics); Mathematics; Deterministic algorithm; Discrete mathematics; Class (philosophy); Computer science; Statistics; Database","score_opus":0.013099220252770974,"score_gpt":0.22893660315291445,"score_spread":0.21583738290014348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005304136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08127271,0.008339074,0.8253571,0.01152322,0.0013316127,0.00042634996,0.0015608455,0.0050467253,0.065142415],"genre_scores_gemma":[0.80365247,0.004203445,0.14546135,0.0034088902,0.00242387,0.0011279869,0.0024253726,0.004396099,0.032900523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97240686,0.005137572,0.0013992024,0.00297157,0.010439905,0.007645009],"domain_scores_gemma":[0.7899123,0.13080902,0.007236492,0.048981182,0.014460532,0.008600454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019171009,0.004010202,0.0062525403,0.0057884185,0.007660802,0.018140418,0.01242842,0.0061973496,0.02218757],"category_scores_gemma":[0.13407616,0.0036401418,0.0029099511,0.008608595,0.008486587,0.045543082,0.02019237,0.018491087,0.0047419197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025517293,0.00054830656,0.002933694,0.00069879455,0.0001726304,0.00022390968,0.0013681368,0.060704015,0.0032316986,0.83684677,0.025867019,0.064853415],"study_design_scores_gemma":[0.00013652728,0.00015266506,0.00053359533,0.00014189321,0.00018599146,0.00014011751,0.0002869155,0.12707862,0.0025486546,0.86014026,0.008586924,0.000067881556],"about_ca_topic_score_codex":0.004453254,"about_ca_topic_score_gemma":0.005820249,"teacher_disagreement_score":0.02218757,"about_ca_system_score_codex":0.0076337783,"about_ca_system_score_gemma":0.008747517,"threshold_uncertainty_score":0.1013872},"labels":[],"label_agreement":null},{"id":"W2005480575","doi":"10.14778/1920841.1920847","title":"Database replication","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Branco Weiss Fellowship – Society in Science; Eidgenössische Technische Hochschule Zürich; McGill University","keywords":"Computer science; Scalability; Replication (statistics); Distributed computing; Eventual consistency; Database transaction; Consistency (knowledge bases); Fault tolerance; Overhead (engineering); Distributed database; Cloud computing; Database; Transaction processing; Data consistency; Weak consistency; Concurrency control; Strong consistency; Consistency model; Operating system; Artificial intelligence","score_opus":0.009657613492116489,"score_gpt":0.23346822183864122,"score_spread":0.22381060834652472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005480575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008233492,0.014366679,0.71671194,0.0059702243,0.009025815,0.003111641,0.00854926,0.02856207,0.20546885],"genre_scores_gemma":[0.22715679,0.015782895,0.49655867,0.006242869,0.005889824,0.0023872494,0.030326126,0.0051176534,0.21053791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860547,0.0022542402,0.0016062013,0.0023357945,0.0068485583,0.00090058055],"domain_scores_gemma":[0.97513753,0.0020740202,0.000869839,0.014462221,0.0064275526,0.001028782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067743505,0.001281474,0.0020268548,0.002715617,0.0028986202,0.009341591,0.0065892227,0.0025565934,0.03983166],"category_scores_gemma":[0.024221975,0.001038776,0.0020170156,0.0040296274,0.0013212903,0.008225502,0.008716768,0.0026845923,0.047846917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004062108,0.00019257188,0.002042039,0.001641266,0.0002324496,0.00056023605,0.0006385805,0.0054664193,0.011520394,0.18711011,0.3147606,0.4754291],"study_design_scores_gemma":[0.00008849312,0.000118233955,0.00045056085,0.00019942004,0.00006227005,0.0011126631,0.00019967771,0.0066830935,0.005832228,0.047500394,0.9376683,0.000084716106],"about_ca_topic_score_codex":0.0017777905,"about_ca_topic_score_gemma":0.0012632145,"teacher_disagreement_score":0.03983166,"about_ca_system_score_codex":0.0017837019,"about_ca_system_score_gemma":0.0044910703,"threshold_uncertainty_score":0.13325018},"labels":[],"label_agreement":null},{"id":"W2005820465","doi":"10.1142/s0218843000000090","title":"USING METADATA TO QUERY PASSIVE DATA SOURCES","year":2000,"lang":"en","type":"article","venue":"International Journal of Cooperative Information Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Metadata; Information retrieval; The Internet; World Wide Web; Metadata repository; Data element; Popularity; Web search query; Data extraction; Search engine; Data management; Database","score_opus":0.0525599548440297,"score_gpt":0.32436431186841963,"score_spread":0.27180435702438993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005820465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053709965,0.0011140117,0.9283229,0.0025156313,0.00013543596,0.0006478312,0.00093075476,0.0050607375,0.007562708],"genre_scores_gemma":[0.38032544,0.0011051449,0.60569835,0.00075403875,0.00017883937,0.0006863005,0.0035868627,0.00093627546,0.006728688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99100554,0.002955306,0.0011111288,0.000985624,0.0036199896,0.00032252015],"domain_scores_gemma":[0.95011103,0.02231465,0.0037831564,0.015935035,0.006978546,0.0008775896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013876608,0.00077340996,0.0011460099,0.007007803,0.0022513159,0.007593628,0.003271687,0.0020959158,0.0013387608],"category_scores_gemma":[0.04382045,0.0009202785,0.0009846381,0.0073993118,0.002365369,0.014904269,0.006819532,0.0018656612,0.0007562256],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013387785,0.00061070453,0.037165064,0.0022822702,0.00045483408,0.0037754767,0.023618203,0.018840775,0.07120313,0.2436287,0.020820405,0.5762617],"study_design_scores_gemma":[0.00045262242,0.0006837615,0.008145247,0.0009179399,0.0005063871,0.004344371,0.009585779,0.2781757,0.1455092,0.24801134,0.30308652,0.00058116065],"about_ca_topic_score_codex":0.0038043496,"about_ca_topic_score_gemma":0.0046862485,"teacher_disagreement_score":0.013876608,"about_ca_system_score_codex":0.0016263393,"about_ca_system_score_gemma":0.0025474085,"threshold_uncertainty_score":0.073387384},"labels":[],"label_agreement":null},{"id":"W2006182245","doi":"10.1016/j.camwa.2002.12.016","title":"Mapping matrix multiplication algorithm onto fault-tolerant systolic array","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Systolic array; Mathematics; Matrix multiplication; Algorithm; Multiplication (music); Matrix (chemical analysis); Fault tolerance; Arithmetic; Combinatorics; Computer science; Very-large-scale integration","score_opus":0.011408658380878116,"score_gpt":0.24493596653408392,"score_spread":0.2335273081532058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006182245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07182543,0.00026673087,0.918307,0.00014757246,0.00016471694,0.000054096257,0.00005743045,0.0035850604,0.0055918572],"genre_scores_gemma":[0.5122358,0.00036444067,0.47653565,0.00012561241,0.000089349036,0.00010073134,0.0002428379,0.00019991766,0.010105696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998896,0.00001828479,0.000007464038,0.000020992946,0.00004698407,0.000016600898],"domain_scores_gemma":[0.9998171,0.00003421291,0.000018190696,0.000045466873,0.00007366945,0.000011410924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010755563,0.00025939828,0.00022376598,0.0003329831,0.00034083088,0.00038358752,0.00058824004,0.00021272198,0.0030337581],"category_scores_gemma":[0.0005429661,0.00011416223,0.00015195289,0.0005310177,0.00012498985,0.00045673762,0.00030568565,0.00028324398,0.0007718961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004796441,0.00017365968,0.0012808117,0.00018354821,0.000032010932,0.0002516002,0.00022433125,0.078301795,0.15522714,0.029245103,0.006953071,0.7276473],"study_design_scores_gemma":[0.00008224487,0.0005713871,0.0010202691,0.000023849632,0.00003604585,0.000377889,0.00010099904,0.79673284,0.14839008,0.033246923,0.019393869,0.000023521137],"about_ca_topic_score_codex":0.0017332359,"about_ca_topic_score_gemma":0.0015693248,"teacher_disagreement_score":0.0030337581,"about_ca_system_score_codex":0.00020326702,"about_ca_system_score_gemma":0.0004995262,"threshold_uncertainty_score":0.0101489425},"labels":[],"label_agreement":null},{"id":"W2006638148","doi":"10.1145/1186778.1186780","title":"Reactive provisioning of backend databases in shared dynamic content server clusters","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Provisioning; Distributed computing; Resource allocation; Replication (statistics); High availability; Context (archaeology); Replica; Fault tolerance; Benchmark (surveying); Server; Database; Transaction processing; Computer network; Database transaction","score_opus":0.03455533401892498,"score_gpt":0.24785882832669695,"score_spread":0.21330349430777196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006638148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54873836,0.0006138317,0.44115573,0.0004299686,0.00013389447,0.00019187902,0.00007425816,0.0048925774,0.0037695137],"genre_scores_gemma":[0.93830615,0.000084985004,0.06014083,0.00007432421,0.000034267465,0.000054874836,0.00008420728,0.00010444565,0.0011158248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808204,0.00050518167,0.000114550094,0.00031949766,0.0007123255,0.0002663377],"domain_scores_gemma":[0.9964226,0.00088954,0.00031764538,0.0015761671,0.00044759395,0.00034644688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080146,0.00040902884,0.0006768078,0.0005320535,0.0012992097,0.0023341551,0.0035507204,0.0008514155,0.00075960654],"category_scores_gemma":[0.004050647,0.0006056057,0.00034295014,0.00059228897,0.000877855,0.0023326688,0.0020278774,0.0008737031,0.00022276762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022049248,0.00067684334,0.014474337,0.00031092955,0.00026267805,0.0016613349,0.0015678022,0.52491546,0.18903561,0.051887773,0.007539918,0.20546241],"study_design_scores_gemma":[0.000071734605,0.00013982889,0.0016011904,0.000008153243,0.000044568907,0.00018329312,0.00018543408,0.9609485,0.024830334,0.008104407,0.0038483255,0.000034240802],"about_ca_topic_score_codex":0.0025190627,"about_ca_topic_score_gemma":0.0024476408,"teacher_disagreement_score":0.0035507204,"about_ca_system_score_codex":0.0011726136,"about_ca_system_score_gemma":0.0009405579,"threshold_uncertainty_score":0.011000991},"labels":[],"label_agreement":null},{"id":"W2006715921","doi":"10.1109/saso.2010.40","title":"Self-Adaptive Resource Allocation in Open Distributed Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Distributed computing; Computer science; Scalability; Computation; Resource (disambiguation); Resource allocation; Shared resource; Resource management (computing); The Internet; Distributed algorithm; Computer network; World Wide Web; Operating system","score_opus":0.014332588848111422,"score_gpt":0.2479151960095231,"score_spread":0.2335826071614117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006715921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09454027,0.0002918172,0.89790475,0.00041113907,0.00006181574,0.00009751432,0.000035267094,0.0012034999,0.0054539046],"genre_scores_gemma":[0.86575055,0.0002124683,0.13076703,0.00014301715,0.000049457565,0.00015950033,0.000057811387,0.00012397872,0.0027361452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982444,0.00055710366,0.0001441663,0.00031086543,0.0005303099,0.00021323493],"domain_scores_gemma":[0.99623424,0.001988586,0.0004460149,0.0006175178,0.00045267257,0.0002608865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508492,0.00036330806,0.0005208677,0.0005256099,0.001033303,0.0024467073,0.0013146137,0.00085726165,0.0013080586],"category_scores_gemma":[0.006614691,0.00036047044,0.00038573603,0.00059070956,0.0022944196,0.0031943468,0.002218753,0.0010465033,0.00022057754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005016409,0.00018100851,0.0024289056,0.0001802538,0.00008478989,0.0006939876,0.0014935972,0.5500552,0.029391292,0.34756035,0.001746999,0.06568196],"study_design_scores_gemma":[0.00006088864,0.000050707305,0.00021535042,0.000014306907,0.00002168502,0.000086698485,0.0001792529,0.8645024,0.0047448967,0.12618265,0.003916728,0.00002441619],"about_ca_topic_score_codex":0.0022733926,"about_ca_topic_score_gemma":0.0015626611,"teacher_disagreement_score":0.002508492,"about_ca_system_score_codex":0.0011816375,"about_ca_system_score_gemma":0.0011017952,"threshold_uncertainty_score":0.013266325},"labels":[],"label_agreement":null},{"id":"W2007015871","doi":"10.1109/fpt.2010.5681538","title":"Parallelizing FPGA placement using Transactional Memory","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Thread (computing); Transactional memory; Scalability; Field-programmable gate array; Software; Multi-core processor; Source lines of code; Multithreading; Simulated annealing; Speedup; Embedded system; Operating system; Database transaction; Algorithm; Programming language","score_opus":0.02082260540460202,"score_gpt":0.25940507011370395,"score_spread":0.23858246470910194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007015871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2775831,0.00042130306,0.69838965,0.00028505747,0.00014792057,0.00009410997,0.00011192987,0.012634809,0.01033213],"genre_scores_gemma":[0.64972913,0.0001323117,0.34689176,0.000079808204,0.000018818999,0.00006877024,0.00018043794,0.00038198876,0.0025169807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.00008271598,0.000036500405,0.000086544685,0.00015333999,0.000061186045],"domain_scores_gemma":[0.9992925,0.00021644264,0.000070898015,0.00022798934,0.00015758075,0.000034572648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046734096,0.00040733538,0.0002991859,0.00065318024,0.0003392863,0.0009174201,0.0013744092,0.00037631093,0.003583342],"category_scores_gemma":[0.0013914024,0.00036595738,0.0003632606,0.00065635564,0.0005133296,0.0008058087,0.0007137447,0.00051619724,0.0005433961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005190787,0.00015575108,0.004619037,0.00018956904,0.000088309,0.0003537152,0.00036395746,0.49051023,0.10185927,0.013893705,0.0045599933,0.38288742],"study_design_scores_gemma":[0.000057010584,0.00016336663,0.0005978751,0.0000100617945,0.000017088012,0.00008360735,0.0000709059,0.94899523,0.042368703,0.0034309854,0.0041865497,0.000018687888],"about_ca_topic_score_codex":0.0029006412,"about_ca_topic_score_gemma":0.0054778275,"teacher_disagreement_score":0.003583342,"about_ca_system_score_codex":0.0007251594,"about_ca_system_score_gemma":0.00087000424,"threshold_uncertainty_score":0.011987448},"labels":[],"label_agreement":null},{"id":"W2009114884","doi":"10.1145/1988008.1988019","title":"Characterizing problems for realizing policies in self-adaptive and self-managing systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Council Canada; CA Technologies; International Business Machines Corporation","keywords":"Computer science; Autonomic computing; Cloud computing; Distributed computing; Range (aeronautics); Usability; Human–computer interaction; Engineering","score_opus":0.03291592941928311,"score_gpt":0.23392454030699716,"score_spread":0.20100861088771405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009114884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029655252,0.00062215526,0.96098566,0.003054964,0.000060629987,0.0002831176,0.000109544075,0.00025724957,0.0049714637],"genre_scores_gemma":[0.5130929,0.0013477486,0.48000807,0.00061959104,0.00027807773,0.00086895283,0.00046608,0.00022341404,0.003095256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98566115,0.007130343,0.0015414464,0.0016481021,0.0028353,0.0011837253],"domain_scores_gemma":[0.9454325,0.04353898,0.003172914,0.0033781584,0.0031140232,0.0013634124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014801232,0.0014321444,0.0016460434,0.0016657774,0.002159554,0.0077506024,0.0026927781,0.0048610675,0.001860342],"category_scores_gemma":[0.05224639,0.0014820519,0.0014991445,0.0017642338,0.006505329,0.012381207,0.0040567475,0.0049302382,0.00041338507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010561713,0.0001222589,0.0013294228,0.00024780683,0.00006549217,0.00015417198,0.0006940155,0.37405038,0.0011596543,0.6039974,0.0013392543,0.016734581],"study_design_scores_gemma":[0.000037977872,0.000037081987,0.00014631439,0.00007075997,0.00002030484,0.00004482858,0.00026689383,0.49097395,0.0011058149,0.50504524,0.002220416,0.000030293852],"about_ca_topic_score_codex":0.0033530265,"about_ca_topic_score_gemma":0.002147826,"teacher_disagreement_score":0.014801232,"about_ca_system_score_codex":0.004750206,"about_ca_system_score_gemma":0.0038993263,"threshold_uncertainty_score":0.07827735},"labels":[],"label_agreement":null},{"id":"W2010221388","doi":"10.1145/1328671.1328673","title":"Incrementally parallelizing database transactions with thread-level speculation","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Speculative multithreading; Parallel computing; Database transaction; Multiprocessing; Programmer; Online transaction processing; Thread (computing); Speculative execution; Transaction processing; Database; Multithreading; Operating system","score_opus":0.05971631205217947,"score_gpt":0.24475712156926213,"score_spread":0.18504080951708266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010221388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44979417,0.0004608755,0.54110324,0.00024532722,0.00009048594,0.00012493193,0.000048598256,0.0049532535,0.0031790375],"genre_scores_gemma":[0.7909769,0.00015174612,0.20752911,0.000057688907,0.000043349264,0.000094170115,0.00009381112,0.00011063786,0.0009426805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934965,0.0001829177,0.000047411024,0.00010790489,0.0002097474,0.00010229586],"domain_scores_gemma":[0.99818593,0.00077230757,0.00011118842,0.0006000497,0.00025911842,0.00007132664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008555244,0.00046237168,0.0004215446,0.00043347589,0.00043467857,0.000661294,0.0017286176,0.00038396323,0.0009705261],"category_scores_gemma":[0.002889831,0.0004915881,0.00037891575,0.0005402736,0.0006298261,0.0011803539,0.0010199065,0.00085861783,0.00026036735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013753131,0.00052914105,0.009609651,0.00018089324,0.00013371243,0.00032985627,0.000831223,0.34395006,0.21952903,0.015614455,0.0029736452,0.404943],"study_design_scores_gemma":[0.00010216921,0.00023366408,0.0005236236,0.0000064890473,0.00005336658,0.00007251012,0.000048203496,0.95249355,0.038384907,0.0063496013,0.0017124374,0.000019553692],"about_ca_topic_score_codex":0.0032310819,"about_ca_topic_score_gemma":0.0030234766,"teacher_disagreement_score":0.0032310819,"about_ca_system_score_codex":0.00042548552,"about_ca_system_score_gemma":0.0010889356,"threshold_uncertainty_score":0.0064245462},"labels":[],"label_agreement":null},{"id":"W2010285338","doi":"10.1016/j.micpro.2013.09.002","title":"Boosting performance of transactional memory through O-GEHL predictors","year":2013,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Exploit; Software transactional memory; Benchmark (surveying); Boosting (machine learning); Consistency model; Distributed computing; Parallel computing; Embedded system; Database; Database transaction; Data consistency; Computer security; Artificial intelligence","score_opus":0.006239108056967694,"score_gpt":0.18838036810676392,"score_spread":0.18214126004979622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85094637,0.0034545013,0.12906913,0.0006832268,0.00034913304,0.000029703022,0.00012541722,0.003486115,0.011856375],"genre_scores_gemma":[0.98548466,0.00023440336,0.011349013,0.00008691057,0.00006417967,0.000010347352,0.00006854028,0.00004544628,0.0026566081],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998253,0.00004076,0.0000066780376,0.000024229019,0.000051670973,0.00005131896],"domain_scores_gemma":[0.9991714,0.00039983547,0.00007264308,0.00010281176,0.00018294195,0.00007043864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035255303,0.00035351914,0.0003168692,0.00035942436,0.0002506932,0.00053867034,0.0006678938,0.00031307782,0.0031281714],"category_scores_gemma":[0.0019419573,0.00014623483,0.00009010476,0.0004624832,0.0002177291,0.0007790379,0.0005500763,0.00064633664,0.0005959367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00343104,0.000672489,0.014945569,0.0001859905,0.00008269572,0.00020143384,0.00012027327,0.1982124,0.0756772,0.0089222975,0.010247371,0.6873013],"study_design_scores_gemma":[0.00006854083,0.0006182657,0.0016884503,0.000018887307,0.000040393108,0.000055013425,0.00004588415,0.9501155,0.042193316,0.0029522458,0.0021861687,0.000017211249],"about_ca_topic_score_codex":0.0008515072,"about_ca_topic_score_gemma":0.0026276507,"teacher_disagreement_score":0.0031281714,"about_ca_system_score_codex":0.00017436619,"about_ca_system_score_gemma":0.0005457872,"threshold_uncertainty_score":0.0104647875},"labels":[],"label_agreement":null},{"id":"W2010680424","doi":"10.1142/s021884300900204x","title":"UPDATE PROCESSING IN INSTANCE-MAPPED P2P DATA SHARING SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Cooperative Information Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Peer-to-peer; Soundness; Overlay network; Relational database; Schema (genetic algorithms); Distributed computing; Data mining; Computer network; Information retrieval; The Internet; World Wide Web; Programming language","score_opus":0.0332913780114412,"score_gpt":0.30947630040822577,"score_spread":0.27618492239678455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010680424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19574815,0.0010381913,0.79500526,0.0006107858,0.00011573359,0.00040995382,0.00030020383,0.0031305905,0.0036410678],"genre_scores_gemma":[0.8073286,0.00048692359,0.18912454,0.00014986843,0.00007356237,0.00017163044,0.00051619596,0.00022648001,0.0019223163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460757,0.0015214836,0.0004289173,0.0012331565,0.0018160999,0.00039269004],"domain_scores_gemma":[0.9914048,0.0047858194,0.000673914,0.0018542493,0.00087964477,0.00040164066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042055272,0.00088008406,0.0016503187,0.0009853031,0.0020404574,0.0046596527,0.003793931,0.0022964014,0.0015353638],"category_scores_gemma":[0.0145025095,0.0010528378,0.00074736745,0.002217915,0.0015734589,0.006590524,0.002859729,0.0017311614,0.00040243706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008260388,0.0003995402,0.00917128,0.0005308327,0.00027556377,0.0026322394,0.0022062107,0.729344,0.017886838,0.048931994,0.0041081505,0.18368739],"study_design_scores_gemma":[0.000051472194,0.00008600698,0.00064829754,0.000011693406,0.000048607435,0.0003886628,0.00030380514,0.9646723,0.0076145413,0.022872437,0.003268912,0.000033311004],"about_ca_topic_score_codex":0.006599543,"about_ca_topic_score_gemma":0.0027119182,"teacher_disagreement_score":0.006599543,"about_ca_system_score_codex":0.0011977039,"about_ca_system_score_gemma":0.0014735886,"threshold_uncertainty_score":0.022241235},"labels":[],"label_agreement":null},{"id":"W2011917159","doi":"10.1007/s005000100100","title":"Application of computational intelligence techniques in active networks","year":2001,"lang":"en","type":"article","venue":"Soft Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computational intelligence; Artificial intelligence","score_opus":0.011548710124297222,"score_gpt":0.2713785765670486,"score_spread":0.2598298664427514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011917159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014511489,0.005412795,0.9405891,0.0012161537,0.0006510663,0.000050595372,0.000036781894,0.00028388973,0.037248176],"genre_scores_gemma":[0.6713446,0.011651286,0.29519904,0.00036608675,0.00089858007,0.00013998013,0.000096786134,0.00011972164,0.020184003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962807,0.00012244286,0.000016838663,0.00004836522,0.00015830254,0.000026073718],"domain_scores_gemma":[0.99878234,0.0008061966,0.00006592576,0.00014753864,0.00015857174,0.00003936659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007096958,0.0004429986,0.00045198633,0.000935778,0.00060902396,0.0017306316,0.0009527231,0.00074873865,0.003498187],"category_scores_gemma":[0.0032344747,0.00023711292,0.0003643654,0.0010334521,0.0012285373,0.0021935042,0.001066099,0.0013177634,0.0006635038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007710148,0.00008593192,0.0005312099,0.00033784145,0.00005037696,0.00010549173,0.00019433176,0.09057792,0.0066712582,0.69758046,0.002726553,0.20106152],"study_design_scores_gemma":[0.000018525663,0.000037424583,0.00024365407,0.000066101195,0.000024863619,0.00012205664,0.000056881698,0.49351582,0.0054242387,0.47635552,0.02412111,0.000013845803],"about_ca_topic_score_codex":0.0005644692,"about_ca_topic_score_gemma":0.0005102954,"teacher_disagreement_score":0.003498187,"about_ca_system_score_codex":0.0005416222,"about_ca_system_score_gemma":0.00042101368,"threshold_uncertainty_score":0.011702657},"labels":[],"label_agreement":null},{"id":"W2012942161","doi":"10.1145/1370082.1370092","title":"Stage","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Concurrency; Predicate (mathematical logic); Erlang (programming language); Programming language; Concurrent computing; Concurrency control; Concurrent object-oriented programming; Distributed computing; Functional programming; Programming paradigm; Declarative programming; Inductive programming","score_opus":0.024587793737312878,"score_gpt":0.2278977543306694,"score_spread":0.20330996059335651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012942161","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008822459,0.00044316478,0.8114755,0.00067091006,0.0005492364,0.0006357846,0.0018244856,0.03435851,0.14121996],"genre_scores_gemma":[0.15231623,0.0009789437,0.6469785,0.0012611828,0.00018846728,0.00083706423,0.0049242927,0.011274136,0.18124115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868995,0.00020133342,0.00011217439,0.00024442282,0.00047626015,0.0002760031],"domain_scores_gemma":[0.99908185,0.00020093298,0.00006295051,0.000325893,0.00020645538,0.00012196072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011168177,0.0005457989,0.0006134312,0.00071867567,0.0008401157,0.0026679605,0.002154155,0.000771452,0.05436272],"category_scores_gemma":[0.002825097,0.0006879007,0.0009913613,0.00050716527,0.0009411263,0.004131217,0.003884663,0.0016829867,0.017454853],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006948092,0.00015601474,0.0019290833,0.0007489311,0.00006111566,0.00035667865,0.001010388,0.007757165,0.010865244,0.59515005,0.07909588,0.30217466],"study_design_scores_gemma":[0.000083727864,0.00014323405,0.00036547155,0.00016662505,0.000055821656,0.0004476651,0.00018949476,0.029856952,0.011548611,0.07355218,0.8835207,0.000069443355],"about_ca_topic_score_codex":0.0018919007,"about_ca_topic_score_gemma":0.0040179077,"teacher_disagreement_score":0.05436272,"about_ca_system_score_codex":0.00090849225,"about_ca_system_score_gemma":0.0018135995,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2013154696","doi":"10.1016/j.tcs.2015.01.024","title":"A characterization of oblivious message adversaries for which Consensus is solvable","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Henan Institute of Science and Technology; Agence Nationale de la Recherche","keywords":"Network topology; Adversary; Computer science; Set (abstract data type); Theoretical computer science; Characterization (materials science); Message passing; Consensus algorithm; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Distributed computing; Algorithm; Computer security; Combinatorics","score_opus":0.01790132295529213,"score_gpt":0.25373043773067583,"score_spread":0.2358291147753837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013154696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33313566,0.00043518146,0.60224676,0.006355965,0.00021608683,0.00047938447,0.0008094664,0.0013362719,0.054985203],"genre_scores_gemma":[0.9668893,0.0002999884,0.02185502,0.0007232455,0.00021773229,0.000298663,0.00051713636,0.00023360735,0.00896528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959692,0.0009917517,0.0002600859,0.0009397358,0.0009389519,0.00090033194],"domain_scores_gemma":[0.9585508,0.029917112,0.0043512704,0.0031317659,0.0020450787,0.002003965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035357922,0.0013359421,0.0023045496,0.0017965322,0.0029823836,0.0067454083,0.0035162352,0.0043738126,0.0060306173],"category_scores_gemma":[0.032967128,0.00126607,0.001711155,0.0019666606,0.005399574,0.010541299,0.005916145,0.006678136,0.00094472885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032890897,0.00011437503,0.00066059956,0.00013277115,0.0000649771,0.00021702745,0.0005671251,0.03271678,0.0035212557,0.95336,0.0030245748,0.005291645],"study_design_scores_gemma":[0.000070836766,0.00006868053,0.00014744092,0.00002179683,0.000027437087,0.00013553895,0.00014750646,0.15607278,0.0012662533,0.84070075,0.0013140545,0.000027050486],"about_ca_topic_score_codex":0.00095045596,"about_ca_topic_score_gemma":0.00073555676,"teacher_disagreement_score":0.0067454083,"about_ca_system_score_codex":0.0030237255,"about_ca_system_score_gemma":0.0031172333,"threshold_uncertainty_score":0.0219388},"labels":[],"label_agreement":null},{"id":"W2013607435","doi":"10.1109/mascot.2009.5366689","title":"Performance modeling of systems using fair share scheduling with Layered Queueing Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fair queuing; Scheduling (production processes); Proportionally fair; Distributed computing; Weighted fair queueing; Round-robin scheduling; Linux kernel; Queueing theory; Generalized processor sharing; Software; Fair-share scheduling; Computer network; Operating system; Quality of service; Engineering","score_opus":0.024454836582503338,"score_gpt":0.2330884395026851,"score_spread":0.20863360292018177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013607435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10872007,0.00032389068,0.8814517,0.00035876417,0.00005918214,0.0001290211,0.00021956059,0.0008637439,0.007873967],"genre_scores_gemma":[0.9460376,0.00029195496,0.050265048,0.00005235872,0.00004274344,0.00015636437,0.00013178041,0.0000714963,0.0029505338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988784,0.00037859936,0.00006201158,0.0001119444,0.00038646112,0.0001824185],"domain_scores_gemma":[0.99834406,0.0008538535,0.00025342754,0.00019569266,0.00026152257,0.0000915475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835321,0.0009222821,0.00070488645,0.0006170715,0.000708813,0.0019375944,0.0016460567,0.00087151094,0.0018035414],"category_scores_gemma":[0.004641987,0.0005174835,0.0009020426,0.00067676743,0.0010581601,0.00217547,0.0011482643,0.0009708332,0.0003214203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024051307,0.000015986428,0.00029309068,0.000010203639,0.00000937334,0.000020159308,0.000040346134,0.98812485,0.00069176103,0.009372656,0.000098276876,0.0012992958],"study_design_scores_gemma":[0.000002464899,0.0000061134733,0.000037331283,0.00000116507,0.0000021730386,0.000002365019,0.0000035590062,0.99761766,0.00015641218,0.0020602932,0.00010772229,0.000002624657],"about_ca_topic_score_codex":0.016448746,"about_ca_topic_score_gemma":0.005533795,"teacher_disagreement_score":0.016448746,"about_ca_system_score_codex":0.002249913,"about_ca_system_score_gemma":0.001767835,"threshold_uncertainty_score":0.032705963},"labels":[],"label_agreement":null},{"id":"W2014039063","doi":"10.1109/mm.2012.16","title":"Kilo TM: Hardware Transactional Memory for GPU Architectures","year":2012,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Computer science; Transactional memory; Parallel computing; Computer architecture; Range (aeronautics); Database transaction; Programming language","score_opus":0.018660552259854083,"score_gpt":0.2529427535631042,"score_spread":0.23428220130325011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014039063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22293654,0.0067366487,0.6854859,0.0014379873,0.0015999738,0.00037426254,0.0012365438,0.050033636,0.03015844],"genre_scores_gemma":[0.72570515,0.0010377741,0.25155833,0.00076165516,0.00025637288,0.00026211017,0.0016518111,0.0015908531,0.017175999],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995448,0.00006373422,0.000046346893,0.00008334449,0.00018109602,0.00008062686],"domain_scores_gemma":[0.998877,0.00016985001,0.00008266248,0.0005348257,0.00019770424,0.00013799047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038231196,0.0005970491,0.00049850333,0.000492317,0.00042781228,0.0014347128,0.003107272,0.0006101659,0.005916866],"category_scores_gemma":[0.0015657932,0.00038834402,0.00028175698,0.0009457939,0.0006529833,0.002042829,0.001514426,0.0012651737,0.0010220581],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033708122,0.0004240514,0.007736069,0.00096335803,0.00024239428,0.00072205806,0.0005065927,0.027321374,0.16827752,0.05765849,0.09999996,0.63277733],"study_design_scores_gemma":[0.0007447611,0.0019190831,0.0030509715,0.0001315535,0.00019563804,0.0015548696,0.00030990157,0.53370696,0.21911268,0.03535489,0.20368928,0.00022946797],"about_ca_topic_score_codex":0.0008577564,"about_ca_topic_score_gemma":0.0014326109,"teacher_disagreement_score":0.005916866,"about_ca_system_score_codex":0.00047537623,"about_ca_system_score_gemma":0.00066347374,"threshold_uncertainty_score":0.019793868},"labels":[],"label_agreement":null},{"id":"W2015468161","doi":"10.1007/s00446-011-0146-4","title":"The minimum information about failures for solving non-local tasks in message-passing systems","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Message passing; Commit; Task (project management); Process (computing); Set (abstract data type); Function (biology); Distributed computing; Value (mathematics); Theory of computation; Theoretical computer science; Algorithm; Programming language; Machine learning","score_opus":0.014691213198245175,"score_gpt":0.23371146627504805,"score_spread":0.21902025307680287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015468161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16589546,0.001506353,0.825347,0.002261676,0.00022172797,0.00011433328,0.0005306351,0.0009972788,0.0031256431],"genre_scores_gemma":[0.85700464,0.0005815344,0.13900359,0.00019228135,0.00031516203,0.00022726784,0.00055572245,0.00045239998,0.0016674433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596715,0.0014340946,0.00048271002,0.0005724517,0.001128253,0.00041530098],"domain_scores_gemma":[0.9396034,0.046936624,0.0032716999,0.0050582476,0.0031628085,0.0019672909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005632433,0.0013196768,0.0031214624,0.002531453,0.0015978044,0.0032714629,0.003675836,0.0029068347,0.0024370884],"category_scores_gemma":[0.058600347,0.0011484869,0.0010569652,0.0018704366,0.0027223432,0.008903621,0.002585884,0.0037767568,0.00035701576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070566977,0.00044059023,0.0037827366,0.0014024948,0.00019599433,0.00022174684,0.0013997175,0.53440034,0.01226632,0.25112018,0.007728323,0.17998493],"study_design_scores_gemma":[0.00014947282,0.00034195848,0.0009908429,0.00007970195,0.00007835091,0.000070880946,0.00009255319,0.6986983,0.0050915405,0.29363796,0.00071596645,0.000052449584],"about_ca_topic_score_codex":0.0010590678,"about_ca_topic_score_gemma":0.0011202524,"teacher_disagreement_score":0.005632433,"about_ca_system_score_codex":0.0015272326,"about_ca_system_score_gemma":0.0023702562,"threshold_uncertainty_score":0.02978748},"labels":[],"label_agreement":null},{"id":"W2016326061","doi":"10.1023/b:dapd.0000013069.97679.62","title":"An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems","year":2004,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Cache; Robustness (evolution); Architecture; Data management; Database; Computer network","score_opus":0.09128449405044331,"score_gpt":0.32144718531403554,"score_spread":0.23016269126359223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016326061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13364714,0.0009117297,0.8096563,0.00070262415,0.0002857309,0.00045856385,0.0003254289,0.04567545,0.008336972],"genre_scores_gemma":[0.60574234,0.00040104662,0.37883437,0.00043606138,0.00013379105,0.0002734466,0.0009158886,0.0010794271,0.012183589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990877,0.0001591205,0.00009090256,0.00014458437,0.00037086598,0.0001468957],"domain_scores_gemma":[0.9970958,0.00031601381,0.00012478884,0.0014734354,0.00071991904,0.00027001702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013422768,0.0006612741,0.00079161907,0.000948699,0.001333092,0.0021501235,0.005543297,0.0010743502,0.0037464972],"category_scores_gemma":[0.0028930067,0.0007766071,0.0004470207,0.0016927257,0.0009025387,0.00247484,0.0020895735,0.0017530684,0.0011628456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033734827,0.0013023142,0.011845556,0.00040320505,0.0003231022,0.0007486968,0.0010879366,0.10793613,0.12394921,0.046522323,0.05546553,0.6470426],"study_design_scores_gemma":[0.00015762389,0.0002175635,0.001528961,0.000019085765,0.00013701004,0.0002197417,0.00009727926,0.9406896,0.033359386,0.010077896,0.013420449,0.00007540141],"about_ca_topic_score_codex":0.009625981,"about_ca_topic_score_gemma":0.0098641245,"teacher_disagreement_score":0.009625981,"about_ca_system_score_codex":0.0016801473,"about_ca_system_score_gemma":0.0019358828,"threshold_uncertainty_score":0.019139886},"labels":[],"label_agreement":null},{"id":"W2017204622","doi":"10.1142/s0129626413500102","title":"PARALLEL ALGORITHM FOR SECOND–ORDER RESTRICTED WEAK INTEGER COMPOSITION GENERATION FOR SHARED MEMORY MACHINES","year":2013,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Integer (computer science); Bounded function; Order (exchange); Integer programming; Mathematics; Combinatorics; Parallel algorithm; Computer science; Parallel computing; Algorithm; Discrete mathematics","score_opus":0.020301101147326535,"score_gpt":0.25457994559020997,"score_spread":0.23427884444288344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017204622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023448594,0.00008601504,0.9688639,0.00012828775,0.000061908126,0.00016875863,0.000070351954,0.0015806826,0.0055915145],"genre_scores_gemma":[0.19444595,0.00008426448,0.7978991,0.00008673808,0.000040475326,0.00026046933,0.00038779556,0.00026795955,0.0065271812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00008749837,0.00004077505,0.00011086979,0.00018050619,0.00008681099],"domain_scores_gemma":[0.99948186,0.00019520364,0.000030770745,0.000119472716,0.00014492116,0.00002784363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005976839,0.0007579889,0.00067511963,0.0006754243,0.0008631373,0.0008060065,0.0010142486,0.00049696164,0.0064954287],"category_scores_gemma":[0.0014140063,0.00034868554,0.00083128776,0.0008804267,0.00058727816,0.00128394,0.0011536595,0.0008620285,0.0014284872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009075938,0.00029781155,0.0014287744,0.00036625614,0.00010720398,0.00043437077,0.0004201066,0.12820506,0.04972749,0.1583575,0.009512794,0.65023506],"study_design_scores_gemma":[0.00025042877,0.000221384,0.00031426476,0.000016713468,0.000053635256,0.00028095415,0.00008095277,0.84018457,0.037810925,0.1023065,0.0184399,0.000039627517],"about_ca_topic_score_codex":0.0012411459,"about_ca_topic_score_gemma":0.002024628,"teacher_disagreement_score":0.0064954287,"about_ca_system_score_codex":0.00070075085,"about_ca_system_score_gemma":0.0012613342,"threshold_uncertainty_score":0.02172935},"labels":[],"label_agreement":null},{"id":"W2017975200","doi":"10.1109/cloudcom.2013.60","title":"Innesto: A Searchable Key/Value Store for Highly Dimensional Data","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Associative array; Key (lock); Scalability; Cloud computing; Database; Consistency (knowledge bases); NoSQL; Set (abstract data type); Value (mathematics); Component (thermodynamics); Operating system","score_opus":0.038458764897171926,"score_gpt":0.2768208028651616,"score_spread":0.23836203796798966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017975200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07314593,0.0077056,0.61296177,0.0034298948,0.002228213,0.0016282205,0.032635942,0.19775431,0.06851006],"genre_scores_gemma":[0.44730687,0.0033832807,0.44063047,0.0017501925,0.00049657025,0.0010329336,0.052536003,0.0073212623,0.0455425],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983456,0.00012589735,0.00019323868,0.00019845345,0.0009223738,0.00021439033],"domain_scores_gemma":[0.99656326,0.00053013273,0.00030273246,0.0014889806,0.0007127391,0.00040216185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014316835,0.00080664107,0.0011055034,0.001676505,0.00135905,0.0035594383,0.0049719806,0.00083298894,0.010347866],"category_scores_gemma":[0.0068171397,0.000741872,0.00059332774,0.0040329853,0.0011071644,0.0064889025,0.005606417,0.0018221464,0.0039115283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039779716,0.0005745792,0.008342071,0.0017305627,0.00032065628,0.0015786447,0.0012476905,0.011557491,0.032273747,0.10097344,0.4251032,0.41231993],"study_design_scores_gemma":[0.0013405198,0.0007781296,0.003987245,0.00041831797,0.00026954652,0.0025977362,0.0007707368,0.14701724,0.072297394,0.14703552,0.62295425,0.00053324556],"about_ca_topic_score_codex":0.0031595882,"about_ca_topic_score_gemma":0.0048315693,"teacher_disagreement_score":0.010347866,"about_ca_system_score_codex":0.0009813972,"about_ca_system_score_gemma":0.0026852945,"threshold_uncertainty_score":0.034617066},"labels":[],"label_agreement":null},{"id":"W2019720084","doi":"10.1109/cse.2013.50","title":"Dynamic Load Balancing in Real-Time Distributed Transaction Processing","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Load balancing (electrical power); Distributed computing; Latency (audio); Transaction processing; Database transaction; Parameterized complexity; Load management; Network topology; Computer network","score_opus":0.005940528574700896,"score_gpt":0.22559591067982493,"score_spread":0.21965538210512403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019720084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36084116,0.0016402577,0.6295065,0.0005563219,0.00013819593,0.00022854975,0.00008745876,0.0020965217,0.0049050846],"genre_scores_gemma":[0.93064284,0.00026863575,0.06800873,0.000054831053,0.000027069405,0.000101829515,0.00008489776,0.000088183595,0.00072295824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975223,0.001157003,0.00014747793,0.00029426313,0.00071067346,0.00016837384],"domain_scores_gemma":[0.9959007,0.0022112809,0.00034240124,0.0007875603,0.00057214336,0.00018594712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026639462,0.0005256612,0.00064628734,0.0005233887,0.0009824346,0.0013540146,0.0016307357,0.000881305,0.0009358556],"category_scores_gemma":[0.0073260474,0.0005270934,0.0002990835,0.0009383958,0.0011406711,0.002665973,0.0008566884,0.0011436582,0.00028635512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075528974,0.00030167366,0.0034187133,0.00019223077,0.00007632671,0.00026212863,0.00035316782,0.8546085,0.04143033,0.01305094,0.0011918813,0.08435883],"study_design_scores_gemma":[0.000072147166,0.0001414003,0.00034567848,0.0000074524337,0.000015065389,0.00007607154,0.00004858833,0.9821247,0.010731849,0.0050294823,0.0013851147,0.000022348595],"about_ca_topic_score_codex":0.0023571094,"about_ca_topic_score_gemma":0.0018789145,"teacher_disagreement_score":0.0026639462,"about_ca_system_score_codex":0.0008989414,"about_ca_system_score_gemma":0.00096840254,"threshold_uncertainty_score":0.014088452},"labels":[],"label_agreement":null},{"id":"W2020165959","doi":"10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Concurrency; Computer science; Asynchronous communication; Generalization; Critical section; Algorithm; Group (periodic table); Process (computing); Suzuki-Kasami algorithm; Extension (predicate logic); Theoretical computer science; Distributed computing; Mathematics; Programming language; Computer network","score_opus":0.008804448669416143,"score_gpt":0.2258978333368807,"score_spread":0.21709338466746456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020165959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011055083,0.0001515416,0.98178375,0.0002454994,0.000065474276,0.00013806562,0.00006201475,0.0013791448,0.0051193386],"genre_scores_gemma":[0.22126368,0.00012923464,0.768684,0.00021972509,0.00006985676,0.00027829732,0.00024759854,0.0001701939,0.008937416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891794,0.0002480112,0.000058997386,0.00020141028,0.00041100942,0.0001626111],"domain_scores_gemma":[0.9989311,0.00035426204,0.00008856944,0.00026134067,0.0002574804,0.00010718375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558632,0.000619784,0.0007788609,0.0005275352,0.0011871323,0.0010480742,0.002204278,0.0013132617,0.005479363],"category_scores_gemma":[0.0023556692,0.00031536835,0.00041021474,0.0008049534,0.0006149706,0.0014539403,0.0021453295,0.0009129324,0.0014876674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084239396,0.0004764258,0.0014647711,0.00023115826,0.00008804229,0.0003442747,0.00036753275,0.30616724,0.019901758,0.10959106,0.018723406,0.54180187],"study_design_scores_gemma":[0.00022319719,0.000117905845,0.0001493164,0.000013197393,0.000019896877,0.00017699458,0.00002835767,0.93143034,0.0050664945,0.04590629,0.016845638,0.000022384209],"about_ca_topic_score_codex":0.0015924695,"about_ca_topic_score_gemma":0.0019260233,"teacher_disagreement_score":0.005479363,"about_ca_system_score_codex":0.0007176638,"about_ca_system_score_gemma":0.0015030869,"threshold_uncertainty_score":0.018330276},"labels":[],"label_agreement":null},{"id":"W2020337406","doi":"10.1145/1140123.1140273","title":"Application of finite state automata to the bakery algorithm in critical section modeling","year":2006,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Critical section; Mutual exclusion; Computer science; Automaton; Section (typography); Finite-state machine; State (computer science); Algorithm; Property (philosophy); Bounded function; Theoretical computer science; Distributed computing; Mathematics; Operating system","score_opus":0.013087769272518077,"score_gpt":0.2608764308339877,"score_spread":0.24778866156146961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020337406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008882587,0.00013650575,0.9874889,0.00013875315,0.000029823288,0.000049216218,0.000014364375,0.00022771525,0.0030320138],"genre_scores_gemma":[0.38601464,0.00042162524,0.61019105,0.0000809847,0.00006135438,0.0002643828,0.000047882695,0.00007772418,0.0028404307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992532,0.00030710138,0.00004908353,0.00010521905,0.00023744222,0.000047904374],"domain_scores_gemma":[0.99829155,0.0011900285,0.00012049687,0.00017930608,0.00016407293,0.000054478718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011131925,0.0004085382,0.00042865504,0.0006140276,0.00078650983,0.0011592602,0.0016164645,0.0010141612,0.0017192357],"category_scores_gemma":[0.0041958396,0.00041552962,0.0006830475,0.0006259722,0.0021246264,0.0017163949,0.0010660437,0.0013630996,0.0002192442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003272822,0.00003904524,0.00064208405,0.000059454545,0.000014665499,0.00013202135,0.00037324853,0.3756843,0.002107044,0.59648055,0.0005429149,0.023891995],"study_design_scores_gemma":[0.000008087964,0.000023396738,0.00004064513,0.000013011744,0.000007432422,0.000028572531,0.000026896449,0.9054478,0.0011697644,0.090821944,0.0024039359,0.00000858186],"about_ca_topic_score_codex":0.0051905797,"about_ca_topic_score_gemma":0.004479702,"teacher_disagreement_score":0.0051905797,"about_ca_system_score_codex":0.0014891217,"about_ca_system_score_gemma":0.0020404418,"threshold_uncertainty_score":0.010804355},"labels":[],"label_agreement":null},{"id":"W2021082070","doi":"10.1007/s10207-007-0047-5","title":"Discretionary capability confinement","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Annotation; Extensibility; Cryptography; Distributed computing; Access control; Programming language; Software engineering; Operating system; Artificial intelligence; Computer security","score_opus":0.005381315075705473,"score_gpt":0.258682177015339,"score_spread":0.2533008619396335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021082070","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17585087,0.0009207673,0.38592413,0.0028747348,0.00056892744,0.00023213854,0.0005102839,0.0026947025,0.43042347],"genre_scores_gemma":[0.9378243,0.00022423417,0.028929109,0.00031651775,0.0001540112,0.00011672655,0.00024289537,0.0002874157,0.03190472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835557,0.00025872214,0.00009270689,0.000337628,0.00052834157,0.00042704423],"domain_scores_gemma":[0.9937656,0.0013645568,0.00038648397,0.0030259439,0.0008157183,0.0006416663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010969714,0.00041647645,0.0005774007,0.00084478804,0.0022555776,0.0026760523,0.0016711694,0.0008533177,0.016188763],"category_scores_gemma":[0.007056698,0.00033836585,0.0006200044,0.00089387863,0.0028305922,0.005606287,0.0049040765,0.0024841311,0.0018851543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006008164,0.00003819371,0.00030921111,0.000037004847,0.00000836937,0.00014367986,0.00037910097,0.0020289356,0.003216845,0.9750011,0.0030670448,0.015710413],"study_design_scores_gemma":[0.00002334719,0.000045625868,0.0004696332,0.000032352844,0.000017239916,0.0002868643,0.00022928271,0.027052017,0.0052363127,0.9378479,0.028716832,0.000042556385],"about_ca_topic_score_codex":0.001319408,"about_ca_topic_score_gemma":0.0013663847,"teacher_disagreement_score":0.016188763,"about_ca_system_score_codex":0.0009466052,"about_ca_system_score_gemma":0.001133562,"threshold_uncertainty_score":0.05415684},"labels":[],"label_agreement":null},{"id":"W2021119769","doi":"10.1145/2335470.2335471","title":"Resource-competitive analysis","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Air Force Office of Scientific Research; Directorate for Computer and Information Science and Engineering; National University of Singapore; National Science Foundation","keywords":"Competitive analysis; Adversary; Computer science; Resource (disambiguation); Protocol (science); Adversarial system; Game theory; Mathematical optimization; Power (physics); Resource management (computing); Distributed computing; Computer network; Upper and lower bounds; Computer security; Artificial intelligence; Mathematics; Mathematical economics","score_opus":0.010504633455708002,"score_gpt":0.2353722810963384,"score_spread":0.22486764764063039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021119769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017940858,0.0010049986,0.91262984,0.0020077222,0.00019511532,0.0002202524,0.00036100263,0.00026200258,0.065378174],"genre_scores_gemma":[0.87572664,0.0022502725,0.10174266,0.0013712718,0.00080177956,0.00070557336,0.00041370947,0.0004921193,0.016495924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896708,0.0038421247,0.0002904701,0.0011023293,0.0035454552,0.0015488644],"domain_scores_gemma":[0.98032045,0.012849706,0.0013311944,0.0022442464,0.0023866524,0.00086764846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071208724,0.0025067767,0.0022185165,0.002475783,0.001849946,0.0051542465,0.003502801,0.0020923754,0.013801626],"category_scores_gemma":[0.027941018,0.00055763527,0.0019582533,0.0027141788,0.003929862,0.0078293085,0.0034697903,0.004034997,0.0013939297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008726656,0.000058504917,0.00041249234,0.00011485718,0.000056227153,0.000063173415,0.00007587463,0.105897464,0.00080432644,0.877036,0.0039022716,0.011491492],"study_design_scores_gemma":[0.000025328394,0.00008339194,0.00022809886,0.000029146076,0.000036439196,0.000116838746,0.000066050794,0.4678864,0.0006339785,0.52438587,0.006485401,0.000023057939],"about_ca_topic_score_codex":0.0037664191,"about_ca_topic_score_gemma":0.0016913709,"teacher_disagreement_score":0.013801626,"about_ca_system_score_codex":0.0050556287,"about_ca_system_score_gemma":0.0033648852,"threshold_uncertainty_score":0.04617107},"labels":[],"label_agreement":null},{"id":"W2021663150","doi":"10.1115/imece2013-64774","title":"Vulnerability, Uncertainty and Probability (VUP) Quantification of a Network of Interacting Satellites Using Stochastic Petri Nets (SPN)","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stochastic Petri net; Petri net; Computer science; Markov chain; Stochastic process; Stochastic modelling; State space; Vulnerability (computing); Markov process; Process architecture; Distributed computing; Mathematics; Machine learning; Statistics","score_opus":0.03766797467299176,"score_gpt":0.28254399783422945,"score_spread":0.2448760231612377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021663150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01233955,0.00008742723,0.98644376,0.000068238296,0.000014654178,0.000027479362,0.00005602017,0.00007798917,0.00088490534],"genre_scores_gemma":[0.79277116,0.00048785322,0.20508346,0.0000430161,0.000049823935,0.00021719265,0.00019022086,0.000046691486,0.0011105177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788445,0.0007414136,0.00014832176,0.00028946754,0.0007796573,0.0001566729],"domain_scores_gemma":[0.99561846,0.0027233283,0.0007823642,0.00028172848,0.00047076773,0.00012345117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023534333,0.0009971077,0.0008054283,0.0021296458,0.0005879547,0.0016693131,0.001082245,0.0006293284,0.0006401574],"category_scores_gemma":[0.006728236,0.0004888729,0.0011777399,0.0013156591,0.0017857178,0.0029613022,0.001949339,0.0012781152,0.00006215686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019438103,0.00001224943,0.002009211,0.00006724362,0.00005418544,0.00010860672,0.000087773595,0.918775,0.0018652084,0.064121224,0.00015108447,0.012728694],"study_design_scores_gemma":[0.0000017963305,0.00002163432,0.00046342934,0.000018513903,0.000021420274,0.00005140182,0.000035656787,0.95824325,0.001059775,0.03958998,0.00047164076,0.000021470545],"about_ca_topic_score_codex":0.0051057786,"about_ca_topic_score_gemma":0.004197637,"teacher_disagreement_score":0.0051057786,"about_ca_system_score_codex":0.0020355394,"about_ca_system_score_gemma":0.0018946363,"threshold_uncertainty_score":0.014768958},"labels":[],"label_agreement":null},{"id":"W2022652334","doi":"10.1145/1011767.1011778","title":"Efficient synchronous snapshots","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Snapshot (computer storage); Asynchronous communication; Computer science; Binary logarithm; Implementation; Execution time; Parallel computing; Time complexity; Algorithm; Real-time computing; Theoretical computer science; Discrete mathematics; Mathematics; Operating system; Programming language; Computer network","score_opus":0.007283436841387523,"score_gpt":0.21981611057246658,"score_spread":0.21253267373107906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022652334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053451944,0.0007478576,0.9188737,0.0002207088,0.00019074432,0.00018250731,0.00051442854,0.013204444,0.012613673],"genre_scores_gemma":[0.5129592,0.0006727995,0.46955958,0.00022705953,0.00011527796,0.00040925553,0.0014826375,0.0011413074,0.013432859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754864,0.00045389403,0.000247543,0.0004582504,0.00092768855,0.00036394416],"domain_scores_gemma":[0.9943433,0.0012054339,0.00044075784,0.0029190495,0.00085612386,0.00023538423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015347895,0.0008749015,0.0009228398,0.000816319,0.0009537989,0.0029045248,0.0024649526,0.00079918146,0.0071150423],"category_scores_gemma":[0.0070804944,0.000710963,0.00054972485,0.0015479148,0.00078473066,0.0054956274,0.0031645661,0.0009924826,0.0021130343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024067892,0.00033977002,0.0071070306,0.0008568056,0.00017344639,0.00055796484,0.0013135975,0.0734461,0.07676825,0.27267304,0.028452646,0.53590465],"study_design_scores_gemma":[0.00052274665,0.00064817077,0.0023394078,0.00016316534,0.0002601766,0.00063322816,0.0008005876,0.5691081,0.15707164,0.15326487,0.115027934,0.00016000654],"about_ca_topic_score_codex":0.0014611406,"about_ca_topic_score_gemma":0.002236448,"teacher_disagreement_score":0.0071150423,"about_ca_system_score_codex":0.0009382107,"about_ca_system_score_gemma":0.0014899401,"threshold_uncertainty_score":0.023802161},"labels":[],"label_agreement":null},{"id":"W2025042589","doi":"10.1007/s00607-013-0375-4","title":"TurboLock: increasing associativity of lock table in transactional memory","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Parallel computing; Overhead (engineering); Concurrency; Exploit; Table (database); Distributed computing; Operating system; Programming language; Computer security; Database transaction; Data mining","score_opus":0.008302495638667196,"score_gpt":0.2172443057043419,"score_spread":0.2089418100656747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025042589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12073345,0.0025156774,0.86327535,0.0004773038,0.0005555908,0.00009373498,0.00022832006,0.006363705,0.0057568615],"genre_scores_gemma":[0.75530577,0.0009374144,0.23723042,0.00040156677,0.00039928238,0.00017886279,0.00023073831,0.00063242926,0.0046834634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979273,0.00051031075,0.00019398991,0.0003375757,0.00065294694,0.00037775404],"domain_scores_gemma":[0.9866541,0.0046451767,0.0008233596,0.0052264174,0.0018644156,0.0007866726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023737848,0.0005775617,0.001108093,0.0014841118,0.0013609637,0.0024179674,0.0032892677,0.000798154,0.0057437425],"category_scores_gemma":[0.012421884,0.00060383166,0.00061075704,0.0030795292,0.0018344842,0.0063003064,0.0034462465,0.0018119024,0.0010866817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004020177,0.00052331004,0.008366383,0.0007952851,0.00015035509,0.0004313063,0.0009721473,0.06909783,0.059038065,0.26827824,0.014402264,0.5739246],"study_design_scores_gemma":[0.00051424163,0.0013459494,0.0013136856,0.00015305646,0.00042558849,0.0011455667,0.0004006236,0.633199,0.090145886,0.2420456,0.029129066,0.00018178522],"about_ca_topic_score_codex":0.0010700801,"about_ca_topic_score_gemma":0.0014226564,"teacher_disagreement_score":0.0057437425,"about_ca_system_score_codex":0.0007546681,"about_ca_system_score_gemma":0.0022867804,"threshold_uncertainty_score":0.01921475},"labels":[],"label_agreement":null},{"id":"W2026129449","doi":"10.1109/sera.2010.40","title":"Advances in the Design and Implementation of a Multi-tier Architecture in the GIPSY Environment with Java","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Java; Computer science; Architecture; Multitier architecture; Real time Java; Software engineering; Operating system; Software design pattern; Programming language; Software; Distributed computing","score_opus":0.014425663882795233,"score_gpt":0.270683599656822,"score_spread":0.2562579357740267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026129449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006743986,0.0002800498,0.9845322,0.00014365335,0.000056000084,0.00006624406,0.000029612986,0.0045779883,0.0035702658],"genre_scores_gemma":[0.090487875,0.00091033604,0.90062976,0.00024481837,0.000049402977,0.00012299234,0.00028706828,0.0017174553,0.0055501848],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998752,0.00023610206,0.00011921879,0.00022682447,0.00052176294,0.00014419793],"domain_scores_gemma":[0.9985783,0.0002863869,0.00011724367,0.000628761,0.0002888159,0.00010045287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017440901,0.00051948853,0.00041166416,0.00039919844,0.00039159335,0.0020567128,0.0025359893,0.0006102636,0.0031822145],"category_scores_gemma":[0.0022666298,0.00060328975,0.0009701424,0.0004695242,0.0009048316,0.002007391,0.0015980006,0.0031675836,0.0014347641],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005066697,0.00049292605,0.005100289,0.0011038665,0.00024299545,0.00076000375,0.0012576525,0.04786519,0.30286297,0.2266848,0.00851537,0.4046072],"study_design_scores_gemma":[0.00024516298,0.0006869683,0.0056419596,0.00036191812,0.00041840784,0.001891181,0.00019064818,0.32591048,0.22955571,0.070662156,0.36416745,0.00026793915],"about_ca_topic_score_codex":0.0013008701,"about_ca_topic_score_gemma":0.0019729498,"teacher_disagreement_score":0.0031822145,"about_ca_system_score_codex":0.0005985475,"about_ca_system_score_gemma":0.0014186909,"threshold_uncertainty_score":0.010645509},"labels":[],"label_agreement":null},{"id":"W2031416491","doi":"10.4271/2012-01-2141","title":"Optimal Traceability for IMA System-of-Systems","year":2012,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Bombardier (Canada)","funders":"","keywords":"Traceability; Computer science; Software engineering","score_opus":0.01658257331142717,"score_gpt":0.2594253166525594,"score_spread":0.24284274334113223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031416491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011391632,0.0001231159,0.98488694,0.00013207903,0.000013116065,0.00006704275,0.00003765868,0.00026926835,0.0030791261],"genre_scores_gemma":[0.67220867,0.0003296619,0.3231237,0.00010390678,0.000049388043,0.000253108,0.00036171987,0.00023090604,0.003338921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99079096,0.0030931372,0.00066532317,0.0011278793,0.0035919605,0.0007306424],"domain_scores_gemma":[0.9890211,0.005888255,0.0008846351,0.0019410137,0.0020126349,0.00025233964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051436503,0.0007165178,0.0007993497,0.0023833616,0.00093343033,0.002561883,0.0015214238,0.0010423324,0.003319647],"category_scores_gemma":[0.021548826,0.0004056113,0.0009992223,0.0016077037,0.0024011482,0.0036993853,0.0032045906,0.001728951,0.0004705478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022215469,0.00013799779,0.0016386127,0.00030563842,0.000056247925,0.00013865739,0.00055547623,0.3550204,0.005731863,0.4639966,0.0011389271,0.17105737],"study_design_scores_gemma":[0.000018303112,0.00013151411,0.00045947084,0.00005096232,0.000023515337,0.000056933855,0.00011618759,0.60185325,0.00682796,0.38684428,0.0035948576,0.000022729375],"about_ca_topic_score_codex":0.0043691453,"about_ca_topic_score_gemma":0.0032151912,"teacher_disagreement_score":0.0051436503,"about_ca_system_score_codex":0.0025834278,"about_ca_system_score_gemma":0.002467213,"threshold_uncertainty_score":0.027202606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0071365872295788895,"score_gpt":0.20499021825034394,"score_spread":0.19785363102076506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032204694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062135343,0.017313635,0.7980546,0.0036236357,0.0027421613,0.00040926895,0.0018516266,0.014466687,0.099403106],"genre_scores_gemma":[0.7295089,0.0065083,0.20016345,0.0020273528,0.0013263839,0.00042124945,0.0023743499,0.0010226385,0.05664738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984958,0.00022815655,0.00017158699,0.00023712608,0.0006416976,0.00022556017],"domain_scores_gemma":[0.99509156,0.00083174836,0.00026635814,0.0023828275,0.0011270572,0.000300489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010902632,0.00060545275,0.0006266706,0.00053658313,0.0009933903,0.0034891411,0.0028371923,0.0010261955,0.013295252],"category_scores_gemma":[0.0056493236,0.0003947957,0.00045687734,0.0011858761,0.0011365457,0.006536976,0.0028448743,0.0014549529,0.0055384594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014991782,0.000196693,0.0026227548,0.0013722025,0.00010854591,0.0010468182,0.00042485812,0.014738012,0.06705068,0.4388656,0.055306196,0.41676843],"study_design_scores_gemma":[0.00016408754,0.00049388816,0.0011392202,0.00047643343,0.00013868092,0.002473968,0.00021604616,0.092405304,0.09751308,0.34329492,0.4615348,0.00014962284],"about_ca_topic_score_codex":0.00045150923,"about_ca_topic_score_gemma":0.0003458292,"teacher_disagreement_score":0.013295252,"about_ca_system_score_codex":0.00054781884,"about_ca_system_score_gemma":0.0011726521,"threshold_uncertainty_score":0.044477105},"labels":[],"label_agreement":null},{"id":"W2032692626","doi":"10.1145/2332432.2332479","title":"Brief announcement","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Computer science; Upper and lower bounds; Deadlock; Adversary model; Schedule; Critical section; Distributed shared memory; Shared memory; Cache; Binary logarithm; Adversary; Theoretical computer science; Distributed computing; Parallel computing; Memory management; Mathematics; Discrete mathematics; Uniform memory access; Overlay; Operating system; Computer security","score_opus":0.01595816704439158,"score_gpt":0.24027575080292168,"score_spread":0.22431758375853011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032692626","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017346444,0.032392535,0.0030682015,0.16098514,0.52268505,0.00039642933,0.0050146705,0.0010063181,0.2727171],"genre_scores_gemma":[0.012272737,0.024144098,0.0018632582,0.06645529,0.12986173,0.00029908682,0.0041542235,0.00034963537,0.7605999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838364,0.00019375683,0.00012162354,0.00037366222,0.00066655735,0.00026071788],"domain_scores_gemma":[0.99463874,0.0006356089,0.0002060709,0.00038882485,0.0020963338,0.0020344716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020756254,0.00095409836,0.0007896233,0.0014119665,0.001994107,0.003684219,0.0019681202,0.0059310044,0.268687],"category_scores_gemma":[0.008486977,0.00033279587,0.00071428734,0.0010064015,0.0006581534,0.0028641953,0.0022453205,0.0041645947,0.15911879],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009300738,0.000043680822,0.0001940697,0.00020216519,0.0000058141813,0.0001896274,0.00003291964,0.00003295919,0.00040357438,0.0045605646,0.9386085,0.055633172],"study_design_scores_gemma":[0.0000078057565,0.000027104046,0.0002438678,0.00007336128,0.0000044066073,0.00018268601,0.000036235546,0.00001550975,0.00014776301,0.0009493646,0.99830747,0.0000045467227],"about_ca_topic_score_codex":0.0017725013,"about_ca_topic_score_gemma":0.0032294116,"teacher_disagreement_score":0.731313,"about_ca_system_score_codex":0.0020979214,"about_ca_system_score_gemma":0.0034394441,"threshold_uncertainty_score":0.8988476},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03438226618304596,"score_gpt":0.24975715386073064,"score_spread":0.21537488767768467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033942886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006455333,0.000048180067,0.9873059,0.00018690832,0.00003333487,0.00018063332,0.0005245049,0.0014128146,0.0038524102],"genre_scores_gemma":[0.28347522,0.00038201505,0.7036207,0.0006188392,0.00015481918,0.0012449281,0.003008279,0.0008959311,0.006599293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962029,0.0009566059,0.00030895887,0.00082170893,0.0012660201,0.00044371013],"domain_scores_gemma":[0.98668844,0.008209181,0.00084178,0.0017484906,0.0022503487,0.00026172664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056407,0.0010890155,0.000664133,0.0022102788,0.0014398154,0.0019925314,0.002393167,0.0011442493,0.005080647],"category_scores_gemma":[0.011256771,0.0006637476,0.0019472,0.0014780993,0.003636716,0.00597068,0.0022721556,0.002282915,0.0010470678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022719502,0.00015005138,0.0016180685,0.00040329492,0.000048772607,0.00046850627,0.0007269409,0.047665097,0.009834887,0.84519666,0.0039654253,0.08969515],"study_design_scores_gemma":[0.00004558985,0.00006800075,0.0002847179,0.00009348463,0.000057620528,0.0001546158,0.00012438867,0.10421322,0.017728694,0.85110384,0.026074907,0.000050967818],"about_ca_topic_score_codex":0.004755816,"about_ca_topic_score_gemma":0.0035639938,"teacher_disagreement_score":0.005080647,"about_ca_system_score_codex":0.0016201525,"about_ca_system_score_gemma":0.0022453854,"threshold_uncertainty_score":0.016996443},"labels":[],"label_agreement":null},{"id":"W2034109654","doi":"10.1007/s00446-008-0069-x","title":"Lower bound for scalable Byzantine Agreement","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scalability; Omega; Upper and lower bounds; Binary logarithm; String (physics); Parallel computing; Combinatorics; Discrete mathematics; Mathematics; Physics; Operating system","score_opus":0.02167600237742189,"score_gpt":0.2504902375396287,"score_spread":0.22881423516220678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034109654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060117863,0.0043358156,0.81341374,0.01649726,0.0015708809,0.0006397493,0.0023948161,0.006090998,0.09493899],"genre_scores_gemma":[0.7645482,0.0031939566,0.17907578,0.003288412,0.002010622,0.0016071132,0.003445656,0.002893444,0.0399368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9851075,0.002831099,0.0005373533,0.0019501322,0.006178004,0.0033959504],"domain_scores_gemma":[0.94716877,0.03472018,0.00173221,0.010303941,0.0037824593,0.0022924738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012376635,0.003858949,0.0062601916,0.0033413377,0.006522413,0.010343688,0.009901251,0.0051973723,0.029068084],"category_scores_gemma":[0.049604192,0.0016778246,0.0023782062,0.005768336,0.0052918005,0.026100457,0.013377416,0.013287409,0.0061933156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026375568,0.00050488993,0.0009802984,0.0009901389,0.00023111467,0.0002132548,0.00078695413,0.12734507,0.0064035594,0.7350034,0.054520976,0.07038272],"study_design_scores_gemma":[0.00022611678,0.000155097,0.00022318469,0.00009743672,0.000113701906,0.00009399379,0.00012027884,0.2900317,0.0023883022,0.7004599,0.006042546,0.000047726997],"about_ca_topic_score_codex":0.0031514124,"about_ca_topic_score_gemma":0.0048141186,"teacher_disagreement_score":0.029068084,"about_ca_system_score_codex":0.0071630054,"about_ca_system_score_gemma":0.009600716,"threshold_uncertainty_score":0.097242415},"labels":[],"label_agreement":null},{"id":"W2034956448","doi":"10.1145/2732263","title":"Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Snapshot (computer storage); Computer science; Time complexity; Computational complexity theory; Worst-case complexity; Binary logarithm; Upper and lower bounds; Algorithm; Theoretical computer science; Average-case complexity; Combinatorics; Mathematics; Database","score_opus":0.07412263790797627,"score_gpt":0.26414357091242885,"score_spread":0.19002093300445258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034956448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041519687,0.0004431873,0.94292086,0.0002330655,0.000090195084,0.00011971124,0.00014573729,0.009865175,0.0046622553],"genre_scores_gemma":[0.4458427,0.0002828758,0.5443604,0.00014243869,0.00007060573,0.0003017838,0.0004429395,0.00069125,0.007865008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981822,0.0002863134,0.00015415504,0.00023303549,0.00090641016,0.00023797258],"domain_scores_gemma":[0.9939865,0.0014814442,0.0003666779,0.0031984705,0.0007404753,0.00022638506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436927,0.00072198274,0.00084463117,0.000637997,0.0008519158,0.002483896,0.0033833557,0.0008685448,0.0064739613],"category_scores_gemma":[0.0056040464,0.000704259,0.0005227634,0.0011815458,0.0011822258,0.0057115555,0.0031819465,0.0015495782,0.0019463643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038208093,0.00049942813,0.0055148667,0.00070777023,0.00014710505,0.00045543196,0.00063892576,0.06440877,0.07717191,0.17570506,0.014230645,0.65669924],"study_design_scores_gemma":[0.00043067074,0.00066878693,0.001452663,0.00011068438,0.0001899509,0.000614031,0.0002565011,0.67052925,0.18416426,0.10464807,0.036784284,0.00015082014],"about_ca_topic_score_codex":0.001260179,"about_ca_topic_score_gemma":0.0023024026,"teacher_disagreement_score":0.0064739613,"about_ca_system_score_codex":0.0012072576,"about_ca_system_score_gemma":0.001551471,"threshold_uncertainty_score":0.021657526},"labels":[],"label_agreement":null},{"id":"W2035326338","doi":"10.1145/1353522.1353527","title":"The potential for variable-granularity access tracking for optimistic parallelism","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Granularity; Exploit; Transactional memory; Cache; Parallel computing; CPU cache; Multithreading; Thread (computing); Speculative multithreading; Variable (mathematics); Operating system; Database transaction; Programming language","score_opus":0.041157556319846064,"score_gpt":0.290618407687541,"score_spread":0.2494608513676949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035326338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45300433,0.0013202868,0.5339269,0.000927264,0.00011344257,0.000069349946,0.00010324138,0.0049566524,0.0055785077],"genre_scores_gemma":[0.9164602,0.00014596147,0.08233001,0.00011264709,0.000030000358,0.000036607868,0.00006094579,0.00009282929,0.0007306712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843746,0.0004233986,0.00013692568,0.00019630093,0.00060387084,0.00020198995],"domain_scores_gemma":[0.98833746,0.0047287066,0.0012139337,0.004658095,0.0007433576,0.00031857946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020949824,0.00038672937,0.00041300614,0.0005677552,0.00067308726,0.0014958134,0.0021947778,0.0005333343,0.0016489421],"category_scores_gemma":[0.0073966216,0.000534019,0.0003623373,0.00094177894,0.0012280477,0.0022782886,0.0015189543,0.0013956093,0.00027466146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030871057,0.00045928636,0.037839092,0.0005720431,0.00019259096,0.0008257226,0.0011457695,0.22945972,0.21611217,0.12458585,0.005861315,0.37985927],"study_design_scores_gemma":[0.00014801652,0.0007490715,0.0042922865,0.000072886476,0.00012294241,0.00062064565,0.00022718722,0.8040693,0.122555375,0.055024546,0.0120088095,0.000108939625],"about_ca_topic_score_codex":0.0010230255,"about_ca_topic_score_gemma":0.0017705981,"teacher_disagreement_score":0.0021947778,"about_ca_system_score_codex":0.00070441805,"about_ca_system_score_gemma":0.0012238515,"threshold_uncertainty_score":0.01107949},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020728668085622966,"score_gpt":0.27631319757487316,"score_spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038924034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049995556,0.06880267,0.6724761,0.06010863,0.0058254697,0.00019989534,0.0009797054,0.0028977306,0.13871425],"genre_scores_gemma":[0.66098017,0.049665354,0.21699505,0.011568677,0.024280395,0.0010275592,0.0029478515,0.0018776848,0.030657306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99105716,0.0021465134,0.00068414304,0.0018986673,0.0034671559,0.0007463678],"domain_scores_gemma":[0.9208265,0.064350836,0.0010710054,0.009906809,0.0025669255,0.001277927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008939336,0.0025116797,0.0024688637,0.0039703045,0.0042285146,0.0074125896,0.0038441026,0.0048718285,0.010464572],"category_scores_gemma":[0.04495262,0.0021892472,0.0033089675,0.0046535837,0.009975886,0.020054474,0.00733724,0.01686954,0.0028020875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040577154,0.00024786073,0.0016513921,0.001717261,0.0003052776,0.0003507829,0.00063320505,0.016304016,0.0016750557,0.8296218,0.045134053,0.10195348],"study_design_scores_gemma":[0.00004464392,0.000021047648,0.00024063925,0.00010787845,0.00005404233,0.00013599994,0.00006537158,0.0099028405,0.0006434238,0.974703,0.01404701,0.00003416126],"about_ca_topic_score_codex":0.00046059646,"about_ca_topic_score_gemma":0.00034764133,"teacher_disagreement_score":0.010464572,"about_ca_system_score_codex":0.0021764257,"about_ca_system_score_gemma":0.001187664,"threshold_uncertainty_score":0.047276318},"labels":[],"label_agreement":null},{"id":"W2039296153","doi":"10.1109/mm.2010.80","title":"The Velox Transactional Memory Stack","year":2010,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Programmer; Compiler; Programming language; Call stack; Programming paradigm; Separation of concerns; Parallel computing; Stack (abstract data type); Operating system; Software; Database transaction","score_opus":0.006781309725933197,"score_gpt":0.22123242505767085,"score_spread":0.21445111533173766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039296153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040284637,0.011977432,0.813473,0.0029030158,0.0011214432,0.0005162618,0.0015420044,0.0334391,0.09474323],"genre_scores_gemma":[0.3650475,0.010091405,0.4897278,0.0025703346,0.000738259,0.00076950295,0.0046872166,0.0040956386,0.122272365],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826366,0.00018271475,0.0001442278,0.00022527129,0.0008797592,0.0003043369],"domain_scores_gemma":[0.9987204,0.0001613039,0.00008766395,0.00045041763,0.0004380235,0.00014229442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019330215,0.00059594953,0.00061848166,0.0010199259,0.00082648563,0.0056642387,0.004466187,0.00090397283,0.006519608],"category_scores_gemma":[0.0032641725,0.0007670866,0.0006059833,0.0011505756,0.0010555866,0.0057902816,0.002656092,0.002115196,0.0026364983],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010675713,0.00013734934,0.0018957421,0.0008054491,0.00011769476,0.00031416398,0.0006417856,0.019319447,0.025301874,0.43666267,0.053092092,0.4606441],"study_design_scores_gemma":[0.00020026854,0.00052601675,0.00090830127,0.0003999765,0.00022295507,0.00078557804,0.00036396433,0.12289317,0.0385357,0.12571788,0.70927095,0.00017519365],"about_ca_topic_score_codex":0.0048188246,"about_ca_topic_score_gemma":0.0032397534,"teacher_disagreement_score":0.006519608,"about_ca_system_score_codex":0.0013091604,"about_ca_system_score_gemma":0.0032155793,"threshold_uncertainty_score":0.021810293},"labels":[],"label_agreement":null},{"id":"W2039317558","doi":"10.1145/1822327.1822334","title":"A fair protocol for non-deterministic message passing","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Deadlock; Protocol (science); Communicating sequential processes; Distributed computing; Implementation; Set (abstract data type); Message passing; Communications protocol; Computation; Process (computing); Computer network; Channel (broadcasting); Theoretical computer science; Algorithm; Programming language; Semantics (computer science)","score_opus":0.018635998099809318,"score_gpt":0.31486084472504894,"score_spread":0.2962248466252396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039317558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023643777,0.0010654196,0.98136556,0.0010637682,0.00092112576,0.00076876447,0.0002185361,0.00091046205,0.011322015],"genre_scores_gemma":[0.15740018,0.0018496491,0.79626936,0.0012692234,0.0009434453,0.0038719361,0.00056208204,0.00039664577,0.03743747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99383426,0.0017895899,0.00047063653,0.00085593207,0.002462508,0.0005872046],"domain_scores_gemma":[0.99638295,0.0014379149,0.00023687266,0.0009040497,0.0007489516,0.00028934915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061433013,0.0012463138,0.0015574226,0.001389305,0.005112492,0.0038929824,0.0033636205,0.0030790458,0.00874674],"category_scores_gemma":[0.0105411,0.0008025825,0.001749433,0.0018704544,0.004538162,0.005596871,0.0032677443,0.0037150066,0.002227335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012507333,0.00007145805,0.00009180393,0.0001795962,0.000042439933,0.00030998135,0.00039285855,0.015032034,0.0025472925,0.932485,0.009830811,0.03889163],"study_design_scores_gemma":[0.00026062352,0.0001703088,0.000099059085,0.0001517592,0.00011964394,0.00038860802,0.00007366643,0.081056446,0.006809277,0.7301681,0.18055363,0.00014872104],"about_ca_topic_score_codex":0.0042292653,"about_ca_topic_score_gemma":0.0037584421,"teacher_disagreement_score":0.00874674,"about_ca_system_score_codex":0.002586579,"about_ca_system_score_gemma":0.0054875826,"threshold_uncertainty_score":0.0324893},"labels":[],"label_agreement":null},{"id":"W2039699744","doi":"10.1145/1882453.1882460","title":"LV*","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Transactional memory; Software transactional memory; MESI protocol; Cache; Software versioning; Cache coherence; Implementation; Operating system; Transactional leadership; Lock (firearm); Protocol (science); Distributed computing; Software; Programming language; CPU cache; Database transaction; Cache coloring; Cache algorithms","score_opus":0.0039760482585803,"score_gpt":0.21029372636407767,"score_spread":0.20631767810549737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039699744","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088429236,0.000484674,0.018699847,0.00087130483,0.0009773212,0.0002591363,0.029994274,0.1275223,0.82030684],"genre_scores_gemma":[0.0050163316,0.00042732013,0.006373859,0.000550557,0.00021526014,0.00020905236,0.030357894,0.030401805,0.9264479],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991523,0.00007299044,0.000055647368,0.0001799721,0.0003960178,0.00014312015],"domain_scores_gemma":[0.99844956,0.00017181778,0.000072927556,0.00051923684,0.000558894,0.00022749873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071593624,0.0017624637,0.0011169374,0.002608383,0.0012692477,0.006182149,0.0027770163,0.0021386764,0.8626623],"category_scores_gemma":[0.002886799,0.0011273108,0.0009904574,0.0022775256,0.00040673531,0.0049599404,0.004634757,0.001989843,0.86330473],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089472174,0.00003668805,0.00017412867,0.00019117912,0.0000067975598,0.000051224502,0.00007482477,0.00011531714,0.00073595386,0.0059462907,0.87065727,0.121920794],"study_design_scores_gemma":[0.000014768998,0.000012014602,0.00013708974,0.000041579904,0.0000026684922,0.0000644265,0.00002096851,0.00016807002,0.0007954022,0.0010460916,0.99768615,0.000010762787],"about_ca_topic_score_codex":0.0028579647,"about_ca_topic_score_gemma":0.0024586748,"teacher_disagreement_score":0.13733768,"about_ca_system_score_codex":0.0012063915,"about_ca_system_score_gemma":0.0011250923,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2040481815","doi":"10.1145/1879211.1879247","title":"TIE","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Debugging; Concurrency; Programming language; Thread (computing); Java; Interleaving; Program slicing; Visualization; Software; Software bug; Software engineering; Operating system; Artificial intelligence","score_opus":0.004127280538763994,"score_gpt":0.20991025378021436,"score_spread":0.20578297324145037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040481815","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017142626,0.0013809085,0.27374327,0.0028423986,0.0027305847,0.00046145107,0.013186021,0.100177154,0.58833563],"genre_scores_gemma":[0.13781239,0.001955163,0.2109436,0.0016319532,0.0008711335,0.00070668967,0.033471156,0.019838383,0.59276956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994295,0.00007365992,0.000028363082,0.000112139445,0.00027138405,0.00008484199],"domain_scores_gemma":[0.998591,0.0003777035,0.00008750477,0.00032976244,0.00038248627,0.00023151113],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007850515,0.0007533406,0.00046811247,0.0018638587,0.0012497964,0.0028277093,0.0014474329,0.001129011,0.24343851],"category_scores_gemma":[0.0041144635,0.00035829862,0.0005051074,0.0015508027,0.00027271514,0.0035419466,0.0027265367,0.0013316523,0.06112308],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041549632,0.000112203685,0.0018548223,0.00043703165,0.00003788798,0.00040133204,0.0004666561,0.0022151012,0.007281361,0.045687187,0.51513857,0.42595226],"study_design_scores_gemma":[0.0000559324,0.000055856282,0.0008446628,0.00007028607,0.000014455163,0.00038299029,0.00013048889,0.0086391745,0.0040779873,0.015227556,0.9704689,0.000031745287],"about_ca_topic_score_codex":0.0012657389,"about_ca_topic_score_gemma":0.0021852925,"teacher_disagreement_score":0.7565615,"about_ca_system_score_codex":0.00041456718,"about_ca_system_score_gemma":0.0007903599,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2040949982","doi":"10.1145/777412.777469","title":"Can we elect if we cannot compare?","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Pairwise comparison; Leader election; Comparability; Computer science; Focus (optics); Node (physics); Set (abstract data type); Theoretical computer science; Protocol (science); A priori and a posteriori; Discrete mathematics; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.01707132529386281,"score_gpt":0.23832358824502287,"score_spread":0.22125226295116004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040949982","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018255655,0.0076116505,0.09867699,0.59612274,0.012445496,0.00016727412,0.0009362378,0.00072379847,0.26506013],"genre_scores_gemma":[0.6450523,0.0073771323,0.07603224,0.14587197,0.0074221976,0.0007312212,0.0015275332,0.0016274563,0.11435798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9760283,0.012853481,0.0008294648,0.0046416014,0.0038783879,0.0017687421],"domain_scores_gemma":[0.96450883,0.014383347,0.0026941954,0.009505075,0.005865079,0.0030435782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027183339,0.000858649,0.0016605628,0.0025357467,0.008264861,0.014833447,0.0038582284,0.006141057,0.03356529],"category_scores_gemma":[0.106130764,0.0005804639,0.0010091604,0.0026882067,0.024700735,0.04448038,0.009195202,0.009378868,0.011558062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440655,0.000041853426,0.0021577282,0.00010764272,0.00006392508,0.00011040694,0.0017832861,0.00070983724,0.000111868714,0.865055,0.065550365,0.0642036],"study_design_scores_gemma":[0.00001928641,0.000021743435,0.00028885383,0.00015148339,0.000019538333,0.000091987764,0.0018125044,0.0007045266,0.00016903334,0.8043965,0.19228974,0.000034776145],"about_ca_topic_score_codex":0.003749962,"about_ca_topic_score_gemma":0.003517358,"teacher_disagreement_score":0.03356529,"about_ca_system_score_codex":0.004124409,"about_ca_system_score_gemma":0.0047184117,"threshold_uncertainty_score":0.14376098},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025532778176718715,"score_gpt":0.26121851579626315,"score_spread":0.23568573761954442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041180570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017526342,0.0011260249,0.97454923,0.00032842887,0.00013440967,0.0001614823,0.00004915777,0.0033714417,0.0027534608],"genre_scores_gemma":[0.58713806,0.0008472968,0.40535644,0.00038987695,0.00038442318,0.00035175568,0.00023976974,0.00041342492,0.004879017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356985,0.0015869244,0.000612619,0.0010539084,0.0026969712,0.00047975674],"domain_scores_gemma":[0.9839048,0.0022397668,0.0013274051,0.010437664,0.0015736514,0.0005166863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039539086,0.0006781252,0.0011520978,0.0010296901,0.0015288164,0.0028977217,0.0034569583,0.0012402235,0.002114192],"category_scores_gemma":[0.013251941,0.0007166082,0.00082903134,0.0017139226,0.0018663798,0.006081867,0.006638477,0.0021408552,0.0013037812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001020331,0.00038877712,0.0066314917,0.0010265983,0.00046989665,0.0009515239,0.001329683,0.13637203,0.070636906,0.31635746,0.015575776,0.44923955],"study_design_scores_gemma":[0.0003658333,0.0008035468,0.0015572178,0.00014714927,0.0004168316,0.0019194215,0.00042203238,0.588038,0.080245495,0.26885822,0.057027258,0.00019892535],"about_ca_topic_score_codex":0.0007328423,"about_ca_topic_score_gemma":0.0008262879,"teacher_disagreement_score":0.0039539086,"about_ca_system_score_codex":0.00084154546,"about_ca_system_score_gemma":0.002071357,"threshold_uncertainty_score":0.020910501},"labels":[],"label_agreement":null},{"id":"W2042186799","doi":"10.1145/2213836.2213920","title":"ConsAD","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Database transaction; Serializability; Isolation (microbiology); Data mining; Interface (matter); Database; Transaction processing; Artificial intelligence; Distributed transaction; Operating system","score_opus":0.013526531858821746,"score_gpt":0.23567787127344658,"score_spread":0.22215133941462484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042186799","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028925456,0.0015385182,0.4731808,0.00116136,0.0015490812,0.00043841242,0.01224677,0.38315848,0.097801074],"genre_scores_gemma":[0.38340703,0.0012941188,0.40446663,0.0040885415,0.00047491092,0.001094403,0.035061613,0.037149508,0.13296323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998384,0.00023955463,0.000111675574,0.00037535044,0.0007059759,0.00018341944],"domain_scores_gemma":[0.9963141,0.001240029,0.00018176516,0.0010804962,0.001019164,0.00016449328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016509026,0.0012585621,0.000642892,0.0017230379,0.00087147276,0.0025815757,0.0018215653,0.0010549579,0.04267651],"category_scores_gemma":[0.006375129,0.00073583017,0.0007142472,0.0009241843,0.00061199965,0.0034946417,0.0030420187,0.0014047527,0.017627899],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002063193,0.00035425418,0.020008836,0.0011350245,0.00009123232,0.00079107576,0.000612216,0.005956341,0.012911317,0.06352619,0.42588958,0.4666607],"study_design_scores_gemma":[0.00022677399,0.00027795316,0.00407865,0.00024248735,0.00009494546,0.0015816791,0.00024470987,0.06956169,0.031251606,0.030505551,0.8617902,0.00014375795],"about_ca_topic_score_codex":0.003088363,"about_ca_topic_score_gemma":0.0046646707,"teacher_disagreement_score":0.04267651,"about_ca_system_score_codex":0.00066821754,"about_ca_system_score_gemma":0.0013220506,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2042734235","doi":"10.1007/s00446-012-0158-8","title":"Partial synchrony based on set timeliness","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Generalization; Set (abstract data type); Simple (philosophy); Simplicity; Computer science; Theory of computation; Agreement; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Physics","score_opus":0.020088775776242573,"score_gpt":0.26762045343549734,"score_spread":0.24753167765925477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042734235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03284977,0.00025336267,0.95963454,0.00028227016,0.0001852335,0.000096425974,0.00021261262,0.00093189994,0.005553859],"genre_scores_gemma":[0.8332646,0.00041237855,0.1588831,0.00022410002,0.00038858585,0.0003050886,0.0005142931,0.00046062525,0.005547211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704784,0.0007372797,0.00023385293,0.0006549923,0.0010381541,0.00028785755],"domain_scores_gemma":[0.9787587,0.011554282,0.0018173354,0.0048176735,0.0020318902,0.001020094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032957725,0.0008286234,0.002010681,0.0019506931,0.0013725968,0.0027959237,0.0021925569,0.0010975192,0.006389798],"category_scores_gemma":[0.017351713,0.00069324067,0.0011073885,0.0021133178,0.00240315,0.005206048,0.0034948026,0.0020819253,0.00085113687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001136928,0.0000935045,0.0014853018,0.0002300609,0.00010206563,0.0002577479,0.0004938971,0.1678347,0.008209985,0.7476475,0.0038067284,0.068701595],"study_design_scores_gemma":[0.00015047866,0.00022020367,0.00034166296,0.000033597502,0.00009217816,0.00015767847,0.00008944564,0.5768275,0.0047104633,0.41300932,0.0043141176,0.000053312207],"about_ca_topic_score_codex":0.0012118535,"about_ca_topic_score_gemma":0.0011666501,"teacher_disagreement_score":0.006389798,"about_ca_system_score_codex":0.0013425767,"about_ca_system_score_gemma":0.0014959552,"threshold_uncertainty_score":0.021376014},"labels":[],"label_agreement":null},{"id":"W2042789597","doi":"10.1145/1011767.1011835","title":"Brief announcement","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Computer science","score_opus":0.010197972644911873,"score_gpt":0.22410066547626037,"score_spread":0.2139026928313485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042789597","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090868236,0.013915912,0.0011720144,0.02407675,0.07519764,0.0009296825,0.021809291,0.001816889,0.86017317],"genre_scores_gemma":[0.0018914209,0.0041136364,0.00029059648,0.0030127564,0.005940684,0.00015986031,0.0048613823,0.0001641878,0.9795655],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998926,0.000095660565,0.00006103027,0.00022830645,0.0004565565,0.00023238125],"domain_scores_gemma":[0.9966618,0.0005771996,0.00013954703,0.00024641556,0.001313469,0.0010615394],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011323823,0.0013493411,0.0021027315,0.00212522,0.0017479897,0.004063531,0.002958402,0.006242552,0.8379575],"category_scores_gemma":[0.005443693,0.0006776972,0.0012698113,0.002176694,0.00060781057,0.0015583349,0.0013022238,0.0026699365,0.728952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044888322,0.00010032698,0.00009081455,0.00058135076,0.00001751893,0.00016217057,0.00001735007,0.000047480044,0.00093052734,0.0020835071,0.9538565,0.04166348],"study_design_scores_gemma":[0.000056037206,0.00008508241,0.00038082918,0.00011466278,0.00001321053,0.00011251826,0.000029080285,0.000024962015,0.00034910606,0.000653642,0.99817145,0.0000094659335],"about_ca_topic_score_codex":0.002713536,"about_ca_topic_score_gemma":0.0032038048,"teacher_disagreement_score":0.1620425,"about_ca_system_score_codex":0.0015179275,"about_ca_system_score_gemma":0.0019915113,"threshold_uncertainty_score":0.23113388},"labels":[],"label_agreement":null},{"id":"W2043112783","doi":"10.1016/j.tcs.2008.09.061","title":"Fault-tolerant computation of distributed regular path queries","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computation; Computer science; Path (computing); Fault tolerance; Theoretical computer science; Parallel computing; Distributed computing; Algorithm; Mathematics; Programming language","score_opus":0.0103279312169427,"score_gpt":0.2333992794955134,"score_spread":0.2230713482785707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043112783","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51974964,0.00065649603,0.46763128,0.0011313136,0.00020963133,0.0001855232,0.0003125482,0.0035152105,0.006608347],"genre_scores_gemma":[0.9441508,0.00012173193,0.052656878,0.00011143586,0.000059517875,0.0000625806,0.00030656892,0.00016850836,0.0023619302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794155,0.0004338739,0.0001474769,0.00036736726,0.000742005,0.0003676487],"domain_scores_gemma":[0.99313027,0.0038816498,0.00046041363,0.0015734886,0.00062835036,0.00032591503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572913,0.0005132895,0.001353468,0.00094231777,0.0011639766,0.0026782013,0.001960159,0.0012239733,0.00258833],"category_scores_gemma":[0.012342341,0.00046267104,0.0004961575,0.0015463849,0.0015471285,0.0040851026,0.0020897216,0.0011470573,0.00039447818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006619253,0.0006320281,0.007859999,0.00065734,0.00027560437,0.0012236652,0.002097706,0.45002297,0.044114403,0.24616446,0.012583129,0.2277493],"study_design_scores_gemma":[0.00024619576,0.00021445354,0.0004469928,0.000018236982,0.00007222999,0.00019464566,0.00019668443,0.8267891,0.014977419,0.1545201,0.0022958925,0.000028026288],"about_ca_topic_score_codex":0.0017627445,"about_ca_topic_score_gemma":0.0020015095,"teacher_disagreement_score":0.0026782013,"about_ca_system_score_codex":0.0012420535,"about_ca_system_score_gemma":0.0012463115,"threshold_uncertainty_score":0.010880113},"labels":[],"label_agreement":null},{"id":"W2043462337","doi":"10.1145/1993806.1993826","title":"The space complexity of long-lived and one-shot timestamp implementations","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Timestamp; Asynchronous communication; Computer science; Timestamp-based concurrency control; Identifier; Implementation; Object (grammar); Theoretical computer science; Spacetime; Programming language; Concurrency control; Real-time computing; Artificial intelligence; Physics","score_opus":0.196502685883702,"score_gpt":0.31977574844765694,"score_spread":0.12327306256395493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043462337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40465254,0.0021727972,0.5652009,0.0037110953,0.00019965316,0.00024142305,0.00067470083,0.0032004488,0.019946385],"genre_scores_gemma":[0.89520365,0.000609103,0.096286595,0.00026987313,0.000103630045,0.0002793404,0.0004513873,0.00036428028,0.0064320974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919709,0.0021509277,0.0007039424,0.0010028424,0.0024939033,0.0016774025],"domain_scores_gemma":[0.9732579,0.01760658,0.0018412576,0.0055694804,0.0011985468,0.0005262907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003800829,0.0007561233,0.0012393999,0.00064721046,0.0015232286,0.005873569,0.0038679778,0.0024505637,0.010562637],"category_scores_gemma":[0.024135616,0.0008706192,0.0011647824,0.0019956157,0.0027910394,0.018892946,0.0041794153,0.0032166326,0.0011788444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026569571,0.0003679732,0.0033656862,0.0010374219,0.00016092708,0.0003845881,0.0014029137,0.1800145,0.01695915,0.63807046,0.007541041,0.14803839],"study_design_scores_gemma":[0.00032642714,0.00040106603,0.00065508555,0.00013348159,0.00013926138,0.00036681385,0.00057409774,0.37177837,0.016653495,0.603802,0.0050722496,0.000097627235],"about_ca_topic_score_codex":0.0012747773,"about_ca_topic_score_gemma":0.0015217295,"teacher_disagreement_score":0.010562637,"about_ca_system_score_codex":0.002740998,"about_ca_system_score_gemma":0.0029378207,"threshold_uncertainty_score":0.03533554},"labels":[],"label_agreement":null},{"id":"W2043953242","doi":"10.1145/1217935.1217945","title":"Database replication policies for dynamic content applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Replica; Replication (statistics); Server; Database; Distributed computing; Benchmark (surveying); Database server; Fault tolerance; Latency (audio); Operating system","score_opus":0.030031220260654044,"score_gpt":0.2865328940277339,"score_spread":0.2565016737670799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043953242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28448492,0.0025641741,0.6925319,0.00116331,0.0002930417,0.00053149497,0.00026294478,0.0041975887,0.013970674],"genre_scores_gemma":[0.9019985,0.00046448677,0.094030246,0.00014306784,0.00011080768,0.000174101,0.00022058586,0.00023710207,0.0026211212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946392,0.0018067037,0.0005565506,0.0007855901,0.0017631038,0.00044885004],"domain_scores_gemma":[0.9795434,0.0060931295,0.0018696827,0.007540691,0.0042240606,0.00072900666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068513206,0.00042648666,0.00058458635,0.00083837,0.0013955103,0.0024136812,0.002159439,0.000872498,0.0013139516],"category_scores_gemma":[0.019653266,0.00050213566,0.0003051804,0.00094293396,0.0008096536,0.002722444,0.0013509889,0.0009342359,0.0006538037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020462584,0.00078475813,0.015179781,0.00060798164,0.00018807431,0.000710932,0.0015609739,0.31550536,0.1294205,0.1622003,0.019243862,0.35255116],"study_design_scores_gemma":[0.00026823228,0.00052216044,0.0032071301,0.00006907833,0.00011492591,0.00087869825,0.00055964873,0.87912303,0.04523801,0.038820684,0.031081675,0.000116697],"about_ca_topic_score_codex":0.001953453,"about_ca_topic_score_gemma":0.0015382613,"teacher_disagreement_score":0.0068513206,"about_ca_system_score_codex":0.001619016,"about_ca_system_score_gemma":0.002364687,"threshold_uncertainty_score":0.036233664},"labels":[],"label_agreement":null},{"id":"W2044214161","doi":"10.1145/1321211.1321218","title":"Pattern rewriting for efficient search in partial-order event data","year":2007,"lang":"en","type":"article","venue":"Proceedings of CASCON","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rewriting; Computer science; Order (exchange); Event (particle physics); Programming language; Information retrieval; Theoretical computer science","score_opus":0.041137989391652786,"score_gpt":0.32064427627463005,"score_spread":0.27950628688297724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044214161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012205996,0.00013316734,0.9835961,0.00016787054,0.000031791962,0.00013046394,0.0003011483,0.0016824541,0.0017510161],"genre_scores_gemma":[0.1106562,0.00024717127,0.8834691,0.00012755604,0.000033784807,0.0002665076,0.0013543656,0.00064733275,0.0031979904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713683,0.0005793613,0.00047693195,0.00042334822,0.0011551911,0.00022841473],"domain_scores_gemma":[0.99597895,0.0020013994,0.00023680236,0.0011931104,0.00050021365,0.00008952724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019493159,0.0006208659,0.0011335582,0.0011560005,0.00069616263,0.0017482709,0.0017132602,0.0007705652,0.0034953093],"category_scores_gemma":[0.009873533,0.0006874438,0.0015809301,0.002223481,0.0012600283,0.0034929283,0.0025719674,0.0018232352,0.0012693736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039693117,0.00021216186,0.0017373777,0.0007670127,0.00013062944,0.0011439588,0.0015872666,0.08533327,0.035684858,0.31709117,0.011410071,0.5445052],"study_design_scores_gemma":[0.00011495871,0.0001407722,0.00036270276,0.00007639868,0.0000744811,0.00062293425,0.00030711605,0.5978536,0.032124862,0.34054744,0.027711824,0.00006286021],"about_ca_topic_score_codex":0.003373355,"about_ca_topic_score_gemma":0.004136244,"teacher_disagreement_score":0.0034953093,"about_ca_system_score_codex":0.0007664403,"about_ca_system_score_gemma":0.0012310165,"threshold_uncertainty_score":0.011692941},"labels":[],"label_agreement":null},{"id":"W2045395233","doi":"10.1007/s00236-008-0086-z","title":"A queue based mutual exclusion algorithm","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Theory of computation; Computer science; Concurrency; Algorithm; Critical section; Conjecture; Semaphore; Automaton; Atomicity; Queue; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.012789053925545775,"score_gpt":0.21507667957268187,"score_spread":0.2022876256471361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045395233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021518592,0.00041790513,0.9690532,0.00037339522,0.00026349985,0.00018534031,0.0001370562,0.0026471904,0.0054038926],"genre_scores_gemma":[0.3261665,0.00027865474,0.6596407,0.00032923245,0.00014254679,0.00030670947,0.00044626006,0.00033264022,0.0123567665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989981,0.0002705244,0.00006133834,0.0001678445,0.00035612233,0.00014610437],"domain_scores_gemma":[0.9982048,0.0007449167,0.00007186186,0.000329397,0.0004953708,0.00015364589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014907484,0.00052392023,0.0011881153,0.0008326141,0.0017885877,0.001720566,0.002521074,0.0011890609,0.006368653],"category_scores_gemma":[0.003479497,0.00038315973,0.0005028814,0.0011394481,0.0004924792,0.0017755115,0.0017857958,0.001265827,0.0014429415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023163198,0.00115815,0.0016629356,0.00031293737,0.00019032144,0.00014500612,0.00034078606,0.16510174,0.023873795,0.1399551,0.02383465,0.6411082],"study_design_scores_gemma":[0.0004103238,0.00031614426,0.00032772787,0.00001953884,0.00007455212,0.00010778479,0.000041019524,0.9378672,0.00814158,0.040025193,0.012623289,0.000045617326],"about_ca_topic_score_codex":0.003272413,"about_ca_topic_score_gemma":0.0044504306,"teacher_disagreement_score":0.006368653,"about_ca_system_score_codex":0.00097155396,"about_ca_system_score_gemma":0.0025795996,"threshold_uncertainty_score":0.021305323},"labels":[],"label_agreement":null},{"id":"W2046045897","doi":"10.1109/iccsnt.2011.6181934","title":"Hierarchical index system for crash-stop service failure detection","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Network for Business Sustainability","keywords":"Survivability; Computer science; Crash; Service (business); Reliability engineering; Quality of service; Network service; Index (typography); Failure causes; Computer security; Computer network; Engineering","score_opus":0.02078546494488147,"score_gpt":0.21927338583441716,"score_spread":0.19848792088953568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046045897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125841135,0.00051520957,0.97874707,0.00008951881,0.00009460303,0.00023278836,0.0005171054,0.0042728777,0.0029467307],"genre_scores_gemma":[0.34983623,0.0005973576,0.6409345,0.00019128143,0.00023444036,0.00065376953,0.0024074418,0.00021058985,0.004934359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980464,0.00033423366,0.00028110045,0.00031697308,0.00085699453,0.00016422376],"domain_scores_gemma":[0.9972402,0.0005746445,0.0002978637,0.0005655625,0.0011346401,0.0001870592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018672479,0.0006152584,0.0011481603,0.0028572907,0.0010113183,0.0016296229,0.0017916724,0.0006775684,0.0029350468],"category_scores_gemma":[0.0060591213,0.0002839053,0.0005542614,0.0020717226,0.00056258414,0.0023451843,0.001542382,0.0009967383,0.0019182193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001044829,0.0003243441,0.009601503,0.00043996685,0.00015878204,0.00028530252,0.00067681004,0.06167797,0.03262395,0.09170944,0.024310678,0.77714646],"study_design_scores_gemma":[0.00009050562,0.00042074156,0.004544102,0.000057912934,0.00016068635,0.0003658059,0.00015639147,0.9070187,0.018438147,0.034562908,0.03403276,0.00015125578],"about_ca_topic_score_codex":0.0065280297,"about_ca_topic_score_gemma":0.004916278,"teacher_disagreement_score":0.0065280297,"about_ca_system_score_codex":0.0013452312,"about_ca_system_score_gemma":0.0019031379,"threshold_uncertainty_score":0.012980044},"labels":[],"label_agreement":null},{"id":"W2046474027","doi":"10.1007/s00778-013-0318-x","title":"Consistency anomalies in multi-tier architectures: automatic detection and prevention","year":2013,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Consistency (knowledge bases); Computer science; Anomaly detection; Isolation (microbiology); Database transaction; Set (abstract data type); Data mining; Database; Distributed computing; Artificial intelligence; Programming language","score_opus":0.017376135837386203,"score_gpt":0.24773613173478778,"score_spread":0.23035999589740158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046474027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5713867,0.0023271185,0.40812883,0.0010149264,0.000328427,0.0002206025,0.0007075186,0.013702738,0.0021830986],"genre_scores_gemma":[0.94798315,0.00022408592,0.05054151,0.000093398565,0.000048436013,0.000030491889,0.00043325606,0.0001653124,0.0004802577],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321884,0.0010143804,0.0006081504,0.0010924307,0.0035104323,0.00055583037],"domain_scores_gemma":[0.9679357,0.0102036195,0.007712883,0.007344904,0.0060231425,0.000779603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035761984,0.0006783207,0.0010071377,0.0030069877,0.00080768333,0.002079629,0.0020933005,0.0013557348,0.0007172665],"category_scores_gemma":[0.020715555,0.00069086533,0.0005507961,0.0021866725,0.0008296196,0.0024057934,0.0016750578,0.0017211379,0.00033842452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016310168,0.00067264726,0.4160343,0.0005142884,0.0003467167,0.0010872522,0.00076457235,0.059183374,0.08937742,0.011401771,0.008194437,0.41079214],"study_design_scores_gemma":[0.00008068988,0.0003392546,0.04792956,0.000067374895,0.00023079326,0.0018716864,0.00035873835,0.8731759,0.058293078,0.014487258,0.0030818027,0.00008382606],"about_ca_topic_score_codex":0.0034066525,"about_ca_topic_score_gemma":0.0058659227,"teacher_disagreement_score":0.0035761984,"about_ca_system_score_codex":0.00091901317,"about_ca_system_score_gemma":0.0023572473,"threshold_uncertainty_score":0.01891303},"labels":[],"label_agreement":null},{"id":"W2046897173","doi":"10.1007/s10766-012-0210-0","title":"Removal of Conflicts in Hardware Transactional Memory Systems","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; False sharing; Transactional memory; Cache; Cache coherence; Software versioning; Class (philosophy); Distributed computing; Theory of computation; Conflict resolution; Shared memory; Parallel computing; CPU cache; Operating system; Cache algorithms; Database transaction; Algorithm; Programming language; Artificial intelligence","score_opus":0.024888820919740047,"score_gpt":0.2882694005470693,"score_spread":0.26338057962732925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046897173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.621896,0.0033330815,0.35736713,0.0010050378,0.00066249707,0.00018572368,0.00012681849,0.0027734132,0.012650311],"genre_scores_gemma":[0.9371828,0.0002336645,0.058292806,0.00015062247,0.00008410487,0.000060781287,0.00012662412,0.00018163618,0.003686953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974578,0.000741634,0.00024263626,0.00017051905,0.0009788169,0.00040848632],"domain_scores_gemma":[0.9868197,0.0058006127,0.0009174983,0.004140266,0.0017686973,0.0005532529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107297,0.00041900735,0.0007607732,0.00082148914,0.0013390464,0.0016278676,0.002774883,0.0007986766,0.0029694128],"category_scores_gemma":[0.012497377,0.00060515077,0.00034824933,0.0010965671,0.0010591958,0.0025671707,0.0020076232,0.0015330936,0.00052811985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036550802,0.0011410296,0.011058659,0.000812724,0.00026621483,0.0016670582,0.0017846461,0.11628076,0.07155534,0.06799871,0.012650005,0.7111297],"study_design_scores_gemma":[0.0005592573,0.0012204327,0.0032513153,0.00010168187,0.00029814028,0.0015191637,0.0010530058,0.7680185,0.10493781,0.09757209,0.021359188,0.00010942967],"about_ca_topic_score_codex":0.0006430133,"about_ca_topic_score_gemma":0.0011173552,"teacher_disagreement_score":0.0029694128,"about_ca_system_score_codex":0.0003226616,"about_ca_system_score_gemma":0.0011756171,"threshold_uncertainty_score":0.011144578},"labels":[],"label_agreement":null},{"id":"W2047109080","doi":"10.1145/1146381.1146424","title":"Lower bound for scalable Byzantine Agreement","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalability; Computer science; Upper and lower bounds; Parallel computing; String (physics); Binary logarithm; Constant (computer programming); Set (abstract data type); Computation; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics","score_opus":0.010405954828250694,"score_gpt":0.23236175164632789,"score_spread":0.2219557968180772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047109080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07856243,0.0033001609,0.8494763,0.012545743,0.00057011796,0.00067054,0.0017774701,0.0057545346,0.047342703],"genre_scores_gemma":[0.8364215,0.002427658,0.1330984,0.0019851958,0.0009646952,0.0014854121,0.0030524156,0.0017916047,0.018773116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98216003,0.003887931,0.00077034754,0.002902578,0.006502853,0.0037762139],"domain_scores_gemma":[0.9394768,0.040877294,0.003161556,0.010561601,0.0035242387,0.002398445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012508992,0.0031429853,0.004555904,0.0022151424,0.0048694084,0.007200606,0.007763276,0.0044497037,0.020154046],"category_scores_gemma":[0.050598882,0.0012968193,0.002632231,0.0035265707,0.005577095,0.02525437,0.011695341,0.009324308,0.004527632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027769385,0.0005799588,0.0026576032,0.0014461614,0.00032041455,0.0005870176,0.0009784406,0.32829,0.012171361,0.5544799,0.031291198,0.06442105],"study_design_scores_gemma":[0.00028268507,0.00023514064,0.00028672343,0.00012255293,0.000103057784,0.00023260084,0.00013869606,0.52127635,0.003908657,0.46740592,0.0059587765,0.0000487805],"about_ca_topic_score_codex":0.0020388511,"about_ca_topic_score_gemma":0.0021736699,"teacher_disagreement_score":0.020154046,"about_ca_system_score_codex":0.0058308067,"about_ca_system_score_gemma":0.0059734317,"threshold_uncertainty_score":0.06742203},"labels":[],"label_agreement":null},{"id":"W2047777418","doi":"10.1109/swste.2010.10","title":"Distributed Event-Based System Features: Representation and Reasoning","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Middleware (distributed applications); Semantics (computer science); Process calculus; Event (particle physics); Representation (politics); Process (computing); Encoding (memory); Distributed computing; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.006385882134869692,"score_gpt":0.24596870048981137,"score_spread":0.2395828183549417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047777418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004756035,0.00023607991,0.98839694,0.0003477997,0.00003218754,0.00013768107,0.0002802366,0.001396947,0.004416155],"genre_scores_gemma":[0.30591565,0.0007695229,0.6856981,0.00014762313,0.00010636261,0.00042298363,0.0013291626,0.00020138374,0.0054092123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985619,0.0003512538,0.00016375435,0.0002199667,0.0005950925,0.00010806102],"domain_scores_gemma":[0.9981945,0.00083806214,0.0002384717,0.0004455837,0.00022382993,0.000059593764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022092548,0.00074168714,0.0006895527,0.0012231132,0.0005451797,0.004255159,0.0028194177,0.0016965137,0.004081189],"category_scores_gemma":[0.0051762345,0.0005452304,0.0014935647,0.0014049996,0.0015884808,0.0055981,0.0015334476,0.0018043161,0.000835694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056897265,0.00012004416,0.0008384171,0.00023589737,0.00005569421,0.0003672325,0.0004948036,0.1177599,0.0019630247,0.8321628,0.0032865815,0.042658705],"study_design_scores_gemma":[0.00005382858,0.00003562571,0.00018260023,0.00006390315,0.000050191218,0.00017754684,0.00009404493,0.6198777,0.0032824955,0.34718806,0.0289658,0.000028325712],"about_ca_topic_score_codex":0.003824727,"about_ca_topic_score_gemma":0.0027981543,"teacher_disagreement_score":0.004255159,"about_ca_system_score_codex":0.0013386938,"about_ca_system_score_gemma":0.00091268506,"threshold_uncertainty_score":0.013652921},"labels":[],"label_agreement":null},{"id":"W2047859166","doi":"10.1145/1385989.1386018","title":"A metamodel for distributed event based systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metamodeling; Computer science; Distributed computing; Component (thermodynamics); Modular programming; Event (particle physics); Interface (matter); Software engineering; Programming language; Operating system","score_opus":0.03242547486316702,"score_gpt":0.25072262913725807,"score_spread":0.21829715427409105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047859166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009781698,0.0003361404,0.9919043,0.00041524746,0.00013587688,0.00022503421,0.00055898144,0.0018703402,0.0035759823],"genre_scores_gemma":[0.03626462,0.0015421308,0.94937885,0.000550318,0.00022812755,0.0011977123,0.0025454261,0.00056792237,0.0077248747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973882,0.0006788819,0.00053417525,0.00042187804,0.0007760354,0.00020087011],"domain_scores_gemma":[0.99759394,0.00070758647,0.0002336285,0.00087233144,0.0004138063,0.0001786014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034647584,0.0012506966,0.001334023,0.002034785,0.001449335,0.0041180877,0.0029212697,0.0026688003,0.00407246],"category_scores_gemma":[0.0045800665,0.001015391,0.002355993,0.002273598,0.0015240359,0.0051765293,0.0026341407,0.0044475263,0.0023577204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008517181,0.00011647824,0.00046436928,0.0003789526,0.000070357695,0.0005502452,0.0007050692,0.03110982,0.00865519,0.8910961,0.012748722,0.054019492],"study_design_scores_gemma":[0.0001116141,0.00010737027,0.00028349014,0.00036685317,0.000093045375,0.0009171596,0.00014845429,0.09612541,0.007103808,0.38089305,0.5137553,0.000094474584],"about_ca_topic_score_codex":0.003020095,"about_ca_topic_score_gemma":0.003274495,"teacher_disagreement_score":0.0041180877,"about_ca_system_score_codex":0.0016319279,"about_ca_system_score_gemma":0.0034098222,"threshold_uncertainty_score":0.0183236},"labels":[],"label_agreement":null},{"id":"W2048438387","doi":"10.1016/s0020-0190(03)00227-8","title":"Proof of correctness of Ressel's adOPTed algorithm","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Algorithm; Computer science","score_opus":0.007103674795007354,"score_gpt":0.2133890013111565,"score_spread":0.20628532651614917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048438387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05262178,0.00081124535,0.8595985,0.0037887113,0.0012600604,0.00035134295,0.00079185725,0.0058206897,0.07495574],"genre_scores_gemma":[0.6492817,0.0009163986,0.315632,0.0019543462,0.0003628267,0.000460806,0.00078314677,0.0011387217,0.029470041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.00064935075,0.00023502386,0.0006339263,0.0012846052,0.00064722454],"domain_scores_gemma":[0.9949279,0.0015487628,0.00015182486,0.0017162232,0.0015392902,0.00011604737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006475,0.0010418226,0.0009239304,0.0008396147,0.001183246,0.002718956,0.002390605,0.0019526706,0.011718054],"category_scores_gemma":[0.009932272,0.0005481936,0.001126066,0.0009436076,0.0025198883,0.0026470618,0.0045318897,0.0023735214,0.0047275885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007990136,0.0001519893,0.0014156285,0.0005400331,0.00013967861,0.0005870846,0.0006613892,0.017785922,0.021077214,0.81135684,0.024636526,0.12084869],"study_design_scores_gemma":[0.00044653038,0.00021400626,0.0011359625,0.00019857759,0.00018483572,0.000689453,0.00025692765,0.08714081,0.06558003,0.7596214,0.084400035,0.00013144143],"about_ca_topic_score_codex":0.0013105152,"about_ca_topic_score_gemma":0.0009508477,"teacher_disagreement_score":0.011718054,"about_ca_system_score_codex":0.001192915,"about_ca_system_score_gemma":0.0017380054,"threshold_uncertainty_score":0.039200842},"labels":[],"label_agreement":null},{"id":"W2049377095","doi":"10.1016/j.compeleceng.2004.08.003","title":"A comparative study of some concurrency control algorithms for cluster-based communication networks","year":2004,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Concurrency; Computer science; Cluster (spacecraft); Concurrency control; Control (management); Algorithm; Distributed computing; Computer network; Artificial intelligence; Programming language","score_opus":0.01578817288765355,"score_gpt":0.2582707963364496,"score_spread":0.24248262344879606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049377095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27633002,0.0067696194,0.70228434,0.00043804027,0.00023510285,0.00031068551,0.000088534885,0.0010504243,0.012493181],"genre_scores_gemma":[0.8886266,0.0014859823,0.107916676,0.00006170816,0.00007835581,0.000095450596,0.00008104813,0.00012261442,0.0015315887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653614,0.0011264745,0.00016315865,0.0003542355,0.0015165254,0.00030354236],"domain_scores_gemma":[0.98845506,0.0076100198,0.0005307933,0.0012059825,0.0018615342,0.00033651033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003945624,0.0005627713,0.00092714507,0.0015991841,0.0013791476,0.0017224826,0.0019714837,0.0008365712,0.0017106395],"category_scores_gemma":[0.015857456,0.00032883842,0.0005221835,0.0020622625,0.0011830848,0.0020978854,0.0007972859,0.0009131043,0.00014659502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001765922,0.0005376935,0.005365646,0.000607481,0.00016590796,0.000092435876,0.0006059084,0.5167925,0.0140781095,0.11168372,0.0018004561,0.3465043],"study_design_scores_gemma":[0.00009434172,0.00032147556,0.000861116,0.000029683702,0.00007828906,0.000112016045,0.00015093184,0.9773039,0.0054670023,0.013708287,0.0018508588,0.000021994525],"about_ca_topic_score_codex":0.005036171,"about_ca_topic_score_gemma":0.003886933,"teacher_disagreement_score":0.005036171,"about_ca_system_score_codex":0.0019339214,"about_ca_system_score_gemma":0.0022866498,"threshold_uncertainty_score":0.020866692},"labels":[],"label_agreement":null},{"id":"W2050619853","doi":"10.1109/pdgc.2014.7030782","title":"Message complexity of distributed algorithms revisited","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed algorithm; Scalability; Distributed computing; Asynchronous communication; Mutual exclusion; Message passing; Algorithm; Leader election; Computational complexity theory; Metric (unit); Reliability (semiconductor); Theoretical computer science; Computer network","score_opus":0.026975070033709733,"score_gpt":0.2572775309768106,"score_spread":0.23030246094310086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050619853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042704225,0.005854795,0.91158533,0.005978384,0.0005117347,0.00019995718,0.00017037085,0.00030011975,0.032695066],"genre_scores_gemma":[0.83000106,0.004101609,0.15290672,0.0008333992,0.0015706677,0.0005726681,0.0001873285,0.00023888015,0.009587775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899414,0.0039947857,0.00056620676,0.0009356228,0.0039137276,0.0006482699],"domain_scores_gemma":[0.96248484,0.030240785,0.0014285363,0.0027974504,0.002479134,0.00056918076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004653509,0.0009913666,0.0013789894,0.0018717074,0.0012160427,0.003980235,0.0017797677,0.0019691582,0.0041244933],"category_scores_gemma":[0.038921203,0.00046569956,0.0011244762,0.002280488,0.004733066,0.009747057,0.0027188759,0.0041636457,0.00063716056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583732,0.00002972705,0.0005075416,0.00017720026,0.000031387848,0.000089426394,0.00028772483,0.051742658,0.00088823563,0.9289941,0.0015257607,0.015650364],"study_design_scores_gemma":[0.00004106903,0.000084381645,0.0003482405,0.00004448225,0.000023176159,0.00015663635,0.00008387707,0.22363274,0.0012404405,0.76496917,0.009348316,0.00002750038],"about_ca_topic_score_codex":0.0009839915,"about_ca_topic_score_gemma":0.00035717437,"teacher_disagreement_score":0.004653509,"about_ca_system_score_codex":0.0031091163,"about_ca_system_score_gemma":0.0016702955,"threshold_uncertainty_score":0.0246104},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03403358076798483,"score_gpt":0.326526578156011,"score_spread":0.29249299738802614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050846431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005344294,0.000032687138,0.99361986,0.00006162457,0.000017676624,0.000069460235,0.000049507285,0.0049844338,0.0006302029],"genre_scores_gemma":[0.0375741,0.00015148628,0.9591058,0.00007182588,0.000031187585,0.0002761983,0.0004617183,0.0010119693,0.0013156555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967591,0.0008425121,0.00035287472,0.00041191527,0.0013903009,0.00024322708],"domain_scores_gemma":[0.9952034,0.001666213,0.0002477532,0.002014395,0.0006679595,0.00020041406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045850393,0.0014282492,0.0015087998,0.0016588302,0.0016760294,0.0057440284,0.0053587575,0.0025665127,0.007311522],"category_scores_gemma":[0.0119599765,0.0017171819,0.0030143217,0.0014175909,0.0017793882,0.0058506457,0.0048761787,0.0042089815,0.0030260808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021243525,0.00033382358,0.0010664576,0.00045494942,0.0002642461,0.00062906207,0.0008456874,0.18919444,0.009255807,0.5607356,0.014949136,0.22205843],"study_design_scores_gemma":[0.00008048161,0.00003983718,0.0001119102,0.00010095435,0.00009216954,0.00015176607,0.00006854282,0.75733364,0.0058999024,0.1973237,0.038737282,0.000059848164],"about_ca_topic_score_codex":0.006819891,"about_ca_topic_score_gemma":0.007800639,"teacher_disagreement_score":0.007311522,"about_ca_system_score_codex":0.0015880746,"about_ca_system_score_gemma":0.003299807,"threshold_uncertainty_score":0.024459481},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0078637736390246,"score_gpt":0.23013710140963195,"score_spread":0.22227332777060735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051837689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013956605,0.0024889628,0.9280849,0.0012532444,0.00078890356,0.0004507815,0.00048460043,0.004444904,0.048047077],"genre_scores_gemma":[0.54291755,0.0029276137,0.41201508,0.00090904615,0.0006479044,0.0010027211,0.001873376,0.0005256215,0.037181035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987332,0.000249477,0.00005207351,0.00022894237,0.00056100055,0.00017537322],"domain_scores_gemma":[0.9986602,0.0004729329,0.00011924171,0.00032982838,0.0002960377,0.00012162775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197259,0.0006239114,0.0010381162,0.0005498779,0.0010525696,0.0009292898,0.0018162505,0.0008010853,0.010528892],"category_scores_gemma":[0.003144269,0.00036035772,0.00046406174,0.0009683158,0.0006136979,0.002290768,0.0024086025,0.0010397349,0.00293847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005482885,0.0002665207,0.001118372,0.0011834633,0.00024354369,0.0007490239,0.00035645848,0.17649588,0.03597578,0.2524824,0.11599465,0.4145856],"study_design_scores_gemma":[0.00038232736,0.0003514561,0.00045836248,0.00009907048,0.00011036448,0.0005903997,0.00020333972,0.65073717,0.015542047,0.21090353,0.12055745,0.000064558124],"about_ca_topic_score_codex":0.0007092411,"about_ca_topic_score_gemma":0.0014866529,"teacher_disagreement_score":0.010528892,"about_ca_system_score_codex":0.0005312379,"about_ca_system_score_gemma":0.00095387927,"threshold_uncertainty_score":0.03522265},"labels":[],"label_agreement":null},{"id":"W2052404333","doi":"10.1007/s10626-011-0126-7","title":"A pseudometric in supervisory control of probabilistic discrete event systems","year":2012,"lang":"en","type":"article","venue":"Discrete Event Dynamic Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Probabilistic logic; Supervisory control; Generator (circuit theory); Event (particle physics); Monotone polygon; Characterization (materials science); Discrete mathematics; Algorithm; Control (management); Artificial intelligence; Computer science; Statistics; Power (physics)","score_opus":0.012964024939932104,"score_gpt":0.252160529195101,"score_spread":0.23919650425516892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052404333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016746873,0.001931915,0.9759846,0.00090663804,0.00038067915,0.000038689992,0.00009213938,0.00013578519,0.0037826425],"genre_scores_gemma":[0.7155803,0.003983231,0.26916447,0.000517362,0.002051534,0.00039914442,0.00029902463,0.00023811738,0.0077667865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995619,0.002040456,0.00029728562,0.00063373777,0.0012522377,0.00015716295],"domain_scores_gemma":[0.98904115,0.0075531066,0.0009788463,0.00068880746,0.0010699964,0.0006681132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004431903,0.0010057852,0.0013651424,0.0017719758,0.0010540576,0.0028199824,0.0017179954,0.0016014064,0.0022045716],"category_scores_gemma":[0.019124007,0.0005230463,0.0010833781,0.0023407137,0.0037468409,0.006715479,0.0035089816,0.0037476257,0.00033959627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011343949,0.00004040553,0.000344882,0.00020062742,0.000025536876,0.00008402929,0.00021426713,0.061470658,0.001506706,0.89728117,0.001273293,0.037444893],"study_design_scores_gemma":[0.000025433628,0.00021189204,0.0003006273,0.000039627645,0.000013559492,0.00010451502,0.00003940857,0.46014386,0.000764828,0.53383046,0.0044885534,0.00003711903],"about_ca_topic_score_codex":0.0006892039,"about_ca_topic_score_gemma":0.0003599682,"teacher_disagreement_score":0.004431903,"about_ca_system_score_codex":0.0014036067,"about_ca_system_score_gemma":0.0013555554,"threshold_uncertainty_score":0.023438454},"labels":[],"label_agreement":null},{"id":"W2053471922","doi":"10.1109/bigdata.2014.7004206","title":"BASIC: An alternative to BASE for large-scale data management system","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Distributed computing; Timestamp; Eventual consistency; Partition (number theory); Consistency (knowledge bases); Atomicity; Consistency model; Database; Data consistency; Computer network; Database transaction","score_opus":0.03144848293646263,"score_gpt":0.28465187174926104,"score_spread":0.2532033888127984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053471922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13740471,0.0024135748,0.80337846,0.0017099872,0.0007520382,0.0010241095,0.0015063552,0.028511105,0.023299657],"genre_scores_gemma":[0.6503225,0.00073506683,0.33426434,0.00087678304,0.00020573537,0.00038340694,0.0016834129,0.00071381585,0.010814901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981352,0.00029968008,0.00014531714,0.00021493631,0.0009771677,0.0002277136],"domain_scores_gemma":[0.99643517,0.00050561636,0.00038613103,0.0015604385,0.0007269496,0.00038566845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022573597,0.00043476207,0.0006518404,0.0007548037,0.000873012,0.0018617378,0.003106466,0.0010317556,0.0036634472],"category_scores_gemma":[0.0037268254,0.00044600788,0.00041332337,0.00093623594,0.00083240855,0.004376538,0.0032607613,0.0019983307,0.00093984586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067243264,0.0010184498,0.0077884765,0.001861709,0.0003346752,0.0013250086,0.0016544658,0.03498822,0.17623347,0.24263106,0.04039297,0.48504725],"study_design_scores_gemma":[0.0012138736,0.003970212,0.00494193,0.00029460358,0.00048373837,0.0024747027,0.00090554875,0.4860564,0.1462452,0.102424316,0.25067878,0.00031075653],"about_ca_topic_score_codex":0.0014956255,"about_ca_topic_score_gemma":0.0016870238,"teacher_disagreement_score":0.0036634472,"about_ca_system_score_codex":0.0007965132,"about_ca_system_score_gemma":0.0016290256,"threshold_uncertainty_score":0.01225549},"labels":[],"label_agreement":null},{"id":"W2054047340","doi":"10.1016/j.scico.2012.11.007","title":"ARV–ALA: Improving performance of software transactional memory through adaptive read and write policies","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Lakehead University","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Benchmark (surveying); Transactional leadership; Exploit; Implementation; Database transaction; Software; Distributed computing; Software engineering; Operating system; Programming language; Computer security","score_opus":0.01768339843819622,"score_gpt":0.24676671066169212,"score_spread":0.2290833122234959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054047340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68052244,0.0038210303,0.20971498,0.0014595626,0.00126899,0.00015138576,0.0007085127,0.08745062,0.014902468],"genre_scores_gemma":[0.92741895,0.00023108022,0.06128447,0.00034141573,0.00014027035,0.000053042517,0.00059280323,0.0012526824,0.008685232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843365,0.0004871996,0.00010029684,0.00029713064,0.00040054627,0.0002811087],"domain_scores_gemma":[0.9967242,0.00078706077,0.00019585234,0.0014292295,0.00060991157,0.0002538705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013128058,0.00081166514,0.00060926576,0.0007320976,0.00054242095,0.0015399621,0.002702159,0.00081632374,0.0058251875],"category_scores_gemma":[0.003567372,0.00044362238,0.00030680915,0.00066949846,0.0006958121,0.002273876,0.0012992016,0.0013365492,0.0017095356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008117607,0.0014242142,0.0075387754,0.0005462618,0.00022398322,0.00039674965,0.00051193516,0.04451247,0.20265998,0.014442245,0.044070076,0.6755557],"study_design_scores_gemma":[0.0009845841,0.002341755,0.00270845,0.000033422377,0.00016495925,0.0004108736,0.00018725662,0.73378956,0.23033068,0.008502541,0.020428091,0.000117839576],"about_ca_topic_score_codex":0.0010109378,"about_ca_topic_score_gemma":0.0017808388,"teacher_disagreement_score":0.0058251875,"about_ca_system_score_codex":0.0004472585,"about_ca_system_score_gemma":0.0010010006,"threshold_uncertainty_score":0.019487202},"labels":[],"label_agreement":null},{"id":"W2056966287","doi":"10.1109/cluster.2014.6968778","title":"To checkpoint or not to checkpoint: Understanding energy-performance-I/O tradeoffs in HPC checkpointing","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fault tolerance; Scheduling (production processes); Overhead (engineering); Exploit; Energy consumption; Distributed computing; Supercomputer; Efficient energy use; Parallel computing; Embedded system; Operating system; Computer security","score_opus":0.04731972437339088,"score_gpt":0.2645134748651125,"score_spread":0.21719375049172163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056966287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81971425,0.005669074,0.16364373,0.0014387754,0.000055710552,0.00007739831,0.00028625692,0.00051328575,0.008601475],"genre_scores_gemma":[0.9900394,0.00096563087,0.008192508,0.000044908127,0.000017276745,0.000023932915,0.000080111,0.00008218076,0.0005541515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00007203369,0.0000142138615,0.0000526003,0.000086486354,0.00006421484],"domain_scores_gemma":[0.99849653,0.0010136677,0.00019545303,0.000117388015,0.00012986768,0.0000471337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007727087,0.0006311165,0.0004749093,0.0006636999,0.00038281397,0.00095954485,0.0006524007,0.00064613647,0.0009403693],"category_scores_gemma":[0.0043894453,0.0003497262,0.00024882675,0.00090537884,0.00078572653,0.0018968786,0.00051163597,0.0006990273,0.0001535703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011921452,0.00009590636,0.0051127095,0.00011533541,0.000023458884,0.00006119397,0.000073227784,0.9617117,0.010336273,0.0044814255,0.00034319787,0.017526349],"study_design_scores_gemma":[0.000008737351,0.000081167396,0.0045719477,0.000022720484,0.000016481574,0.00002770083,0.00012311428,0.98008704,0.006937186,0.0075673265,0.0005377354,0.000018876748],"about_ca_topic_score_codex":0.0030906645,"about_ca_topic_score_gemma":0.003052443,"teacher_disagreement_score":0.0030906645,"about_ca_system_score_codex":0.0010042312,"about_ca_system_score_gemma":0.00052021025,"threshold_uncertainty_score":0.0072862506},"labels":[],"label_agreement":null},{"id":"W2058204792","doi":"10.1007/s00446-014-0227-2","title":"The complexity of automated addition of fault-tolerance without explicit legitimate states","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Set (abstract data type); Computer science; State (computer science); Fault tolerance; Fault model; Identification (biology); Polynomial; Fault (geology); Reliability engineering; Algorithm; Theoretical computer science; Distributed computing; Mathematics; Engineering; Programming language","score_opus":0.019660953845410882,"score_gpt":0.2609594278962686,"score_spread":0.2412984740508577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058204792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16260925,0.00047854247,0.80149394,0.005477383,0.00022552593,0.00027695383,0.0006008853,0.004972617,0.023864886],"genre_scores_gemma":[0.81450444,0.00035593205,0.17701395,0.0005542581,0.00021932529,0.0002748745,0.0006083063,0.0007898381,0.005679095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98871523,0.0036437232,0.00065962726,0.0018408725,0.003848612,0.0012918989],"domain_scores_gemma":[0.93633235,0.04630528,0.002339159,0.011853722,0.002478795,0.00069059606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044314903,0.0009137553,0.0019528628,0.0011605766,0.0029575767,0.006552186,0.004383036,0.00290164,0.00839123],"category_scores_gemma":[0.04300245,0.0015559307,0.0023113636,0.0019360293,0.005439541,0.017796045,0.007530373,0.005734769,0.0015440726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010505883,0.000347995,0.002894279,0.0006481932,0.00015744772,0.0007056209,0.0011217315,0.26012522,0.0054132,0.5805451,0.009173384,0.13781726],"study_design_scores_gemma":[0.00008415506,0.000035171564,0.000298683,0.000034285855,0.00007211701,0.00013868952,0.00014021812,0.37640247,0.0036026384,0.61660135,0.002545413,0.00004484137],"about_ca_topic_score_codex":0.0041079274,"about_ca_topic_score_gemma":0.0044971076,"teacher_disagreement_score":0.00839123,"about_ca_system_score_codex":0.0026910421,"about_ca_system_score_gemma":0.0036530874,"threshold_uncertainty_score":0.028071463},"labels":[],"label_agreement":null},{"id":"W2058843773","doi":"10.1016/j.entcs.2005.05.012","title":"Source Transformation for Concurrency Analysis","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Concurrency; Java; Programming language; Deadlock; Debugging; Concurrent object-oriented programming; Distributed computing; Operating system; Programming paradigm","score_opus":0.005884489380710531,"score_gpt":0.25858299521963823,"score_spread":0.2526985058389277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058843773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016509311,0.00010724505,0.98649466,0.00014220376,0.00005344473,0.00007889006,0.00013909997,0.0055243336,0.005809199],"genre_scores_gemma":[0.15205902,0.00060523534,0.8277397,0.0002659448,0.000121884565,0.0004820918,0.0015797002,0.006161439,0.010985007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700755,0.0007766053,0.0001685502,0.0003666692,0.0014642178,0.00021645124],"domain_scores_gemma":[0.9956949,0.0018031704,0.00021620213,0.0012979181,0.00092936534,0.000058426904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020725676,0.0009957207,0.00068839977,0.0022615294,0.0010779332,0.0023992998,0.0016250917,0.00080884586,0.014679778],"category_scores_gemma":[0.009619105,0.0007389417,0.0015673402,0.0018105368,0.001524549,0.0031649137,0.0028578313,0.0029522774,0.004233396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018063812,0.00014168904,0.0010927377,0.00037714627,0.0000624667,0.0005462462,0.00079655834,0.019027248,0.01584016,0.64776516,0.014145802,0.30002412],"study_design_scores_gemma":[0.00007105161,0.000057202862,0.00031632886,0.00015087801,0.000055255423,0.0004526554,0.0001985504,0.2309673,0.047265336,0.6305448,0.0898675,0.000053213724],"about_ca_topic_score_codex":0.0013953927,"about_ca_topic_score_gemma":0.0010946268,"teacher_disagreement_score":0.014679778,"about_ca_system_score_codex":0.0011360964,"about_ca_system_score_gemma":0.0016817781,"threshold_uncertainty_score":0.049108803},"labels":[],"label_agreement":null},{"id":"W2061075968","doi":"10.1016/j.peva.2005.09.005","title":"Multicast protocols for scalable on-demand download","year":2005,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multicast; Computer science; Computer network; Download; Scalability; IP multicast; Protocol Independent Multicast; Distributed computing; World Wide Web; Operating system","score_opus":0.05015555241017577,"score_gpt":0.34233441349428506,"score_spread":0.2921788610841093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061075968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8270441,0.0027884599,0.1389027,0.0011626275,0.00037282272,0.0010406802,0.0011738718,0.0052591204,0.022255482],"genre_scores_gemma":[0.9604614,0.00044917085,0.03527583,0.00006706001,0.00008904765,0.0002541623,0.00054953265,0.00019383353,0.0026601253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962112,0.0010424835,0.00023337899,0.00020843705,0.0017303827,0.00057414867],"domain_scores_gemma":[0.9913085,0.0039005876,0.00049724145,0.0021719926,0.0016847927,0.00043692713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004524762,0.0010318152,0.0016437693,0.0017748128,0.0016187677,0.0013628523,0.0021681325,0.0012230893,0.0034957542],"category_scores_gemma":[0.010319452,0.0003912342,0.0003947624,0.0017736262,0.00076283456,0.0033991346,0.002186576,0.0010464246,0.00040442825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010237217,0.003104544,0.006146587,0.0011191525,0.0004405322,0.0005603306,0.0007038422,0.5338843,0.084130384,0.03470942,0.019720143,0.30524352],"study_design_scores_gemma":[0.0005315574,0.0015148938,0.0016103537,0.00003352112,0.00016999044,0.00022230978,0.00022062856,0.9493536,0.03216632,0.010493979,0.003631327,0.000051607178],"about_ca_topic_score_codex":0.0033791102,"about_ca_topic_score_gemma":0.0028516203,"teacher_disagreement_score":0.004524762,"about_ca_system_score_codex":0.0022796472,"about_ca_system_score_gemma":0.0015665017,"threshold_uncertainty_score":0.023929536},"labels":[],"label_agreement":null},{"id":"W2062194413","doi":"10.1145/2391229.2391235","title":"How <i>consistent</i> is your cloud application?","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Consistency (knowledge bases); Cloud computing; Computer science; Transactional leadership; Business logic; Distributed computing; Sequential consistency; Data consistency; Database; Consistency model; Artificial intelligence; Operating system","score_opus":0.019932773904677518,"score_gpt":0.24608221730420465,"score_spread":0.22614944339952714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062194413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.803513,0.0015233947,0.16230129,0.007208848,0.00034760733,0.00030869182,0.0015103081,0.0039042737,0.019382665],"genre_scores_gemma":[0.9647443,0.00043025613,0.032275923,0.0005416173,0.00011228259,0.000044653727,0.00057927164,0.0004282147,0.00084361294],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907278,0.0018736932,0.0009566835,0.0018262622,0.0037861555,0.0008294185],"domain_scores_gemma":[0.97151417,0.007928937,0.0069062943,0.005750664,0.006852493,0.001047445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055352384,0.00041770464,0.00073031895,0.0018525127,0.0011542992,0.0066582477,0.0013321654,0.0016684136,0.0010598939],"category_scores_gemma":[0.036419176,0.0004659309,0.0005346539,0.0023070988,0.0019183891,0.0067053465,0.0013142957,0.0014777925,0.0007800433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009897283,0.0003548948,0.639994,0.0008263844,0.0006398843,0.0027870692,0.004242116,0.012327585,0.0758849,0.02956329,0.012342119,0.22004792],"study_design_scores_gemma":[0.00011214846,0.0007825328,0.36198643,0.0006673764,0.0010144247,0.011432707,0.016490843,0.27393752,0.15523447,0.10992937,0.067681774,0.00073037983],"about_ca_topic_score_codex":0.0038168393,"about_ca_topic_score_gemma":0.0034418765,"teacher_disagreement_score":0.0066582477,"about_ca_system_score_codex":0.0012375065,"about_ca_system_score_gemma":0.0014545656,"threshold_uncertainty_score":0.02927351},"labels":[],"label_agreement":null},{"id":"W2062485521","doi":"10.1145/1960275.1960304","title":"Putting events in context","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Adaptability; Software deployment; Decoupling (probability); Event (particle physics); Ubiquitous computing; Context (archaeology); Distributed computing; Event-driven programming; Human–computer interaction; Programming paradigm; Software engineering; Programming language; Engineering; Reactive programming","score_opus":0.03336153983732857,"score_gpt":0.2344689247355759,"score_spread":0.20110738489824734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062485521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009793514,0.01100885,0.7283273,0.034923166,0.008146677,0.00013282486,0.0006903417,0.0017685595,0.20520872],"genre_scores_gemma":[0.46751225,0.01855342,0.41662663,0.014032772,0.008597754,0.00045600507,0.0015009493,0.0016822431,0.071037956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967648,0.001301676,0.00023389448,0.00087566423,0.0005014698,0.00032261494],"domain_scores_gemma":[0.99462754,0.0023509306,0.00037798827,0.001525509,0.0006879727,0.00043012158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036994116,0.0014209286,0.0010471147,0.002243805,0.0033902924,0.012426236,0.0023588121,0.003331619,0.013368444],"category_scores_gemma":[0.01054601,0.001025868,0.0015857575,0.0015731173,0.012115334,0.026306193,0.0083566755,0.0075230105,0.0031638276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023710678,0.0000079817555,0.00020640144,0.00007172703,0.0000157323,0.00019345348,0.0013103226,0.00081987644,0.0002506539,0.9824975,0.0037294934,0.010873139],"study_design_scores_gemma":[0.000013363028,0.000015783968,0.00011078915,0.00015519437,0.00003769156,0.00015880624,0.00065629266,0.0013435252,0.0005857782,0.7679919,0.22890475,0.00002610385],"about_ca_topic_score_codex":0.00349821,"about_ca_topic_score_gemma":0.0029124152,"teacher_disagreement_score":0.013368444,"about_ca_system_score_codex":0.0017057606,"about_ca_system_score_gemma":0.0017159383,"threshold_uncertainty_score":0.04472196},"labels":[],"label_agreement":null},{"id":"W206250993","doi":"","title":"Adaptive speculative locking protocol for distributed real-time database systems","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Concurrency control; Two-phase commit protocol; Two-phase locking; Distributed transaction; Protocol (science); Optimistic concurrency control; Distributed computing; Serializability; Transaction processing; Database transaction; Online transaction processing; Distributed database; Distributed concurrency control; Parallel computing; Database","score_opus":0.06597769050967398,"score_gpt":0.33864273419682867,"score_spread":0.2726650436871547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206250993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052662123,0.00062536827,0.9415745,0.00045467235,0.00015114658,0.00020907956,0.000054476575,0.0012071044,0.003061543],"genre_scores_gemma":[0.85424036,0.0003543698,0.1424262,0.00017233513,0.00007560084,0.000340767,0.00014306814,0.0000648266,0.0021824806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988927,0.0004022275,0.000120034114,0.000105490195,0.00039621742,0.000083343664],"domain_scores_gemma":[0.9978276,0.00073423254,0.00022443004,0.00059187436,0.0005162738,0.00010563489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806425,0.00021774114,0.0002827362,0.0003897922,0.00050136895,0.0010806951,0.001621421,0.0004952736,0.0014821409],"category_scores_gemma":[0.003916445,0.00020303439,0.00020351273,0.00044563072,0.000934386,0.0019047309,0.0011448594,0.00085151085,0.0002584491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015225287,0.00035876175,0.0057134363,0.00073411997,0.00014085184,0.0013376044,0.0014667851,0.20919111,0.23949113,0.22481869,0.01014025,0.30508468],"study_design_scores_gemma":[0.00037568426,0.00046628778,0.0004646702,0.00004004693,0.00006244939,0.000503326,0.00015195036,0.88046026,0.05249639,0.03735575,0.027544565,0.00007865748],"about_ca_topic_score_codex":0.0006069353,"about_ca_topic_score_gemma":0.0006131475,"teacher_disagreement_score":0.001621421,"about_ca_system_score_codex":0.000410344,"about_ca_system_score_gemma":0.0010314146,"threshold_uncertainty_score":0.008359313},"labels":[],"label_agreement":null},{"id":"W2063409721","doi":"10.1145/1621087.1621092","title":"A causal multicast protocol for dynamic groups in cellular networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de la Santé et des Services sociaux","keywords":"Multicast; Computer science; Distributed computing; Computer network; Protocol (science); Simple (philosophy); Communication in small groups; Internet Group Management Protocol; Overhead (engineering); Protocol Independent Multicast; Group (periodic table); Abstraction; Pragmatic General Multicast","score_opus":0.023161708984340553,"score_gpt":0.2824861383428416,"score_spread":0.25932442935850103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063409721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008289601,0.0010068066,0.9815347,0.0005876183,0.00035272606,0.00021211966,0.00013948024,0.0007279479,0.0071489653],"genre_scores_gemma":[0.50530875,0.0027870727,0.47618955,0.0007226718,0.0006515944,0.0009467678,0.00070552056,0.00011184641,0.012576118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00017835027,0.000041955267,0.00005568887,0.00023874758,0.00005291709],"domain_scores_gemma":[0.9994875,0.00018420028,0.0000733379,0.00010197741,0.00011220104,0.00004067821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075684924,0.00027075264,0.00025507328,0.00071780366,0.0011072119,0.00061456946,0.0008032577,0.000686808,0.0023624955],"category_scores_gemma":[0.0019213147,0.00014229231,0.00028173628,0.0009000714,0.00067216833,0.0012277944,0.0010595608,0.0007325016,0.00032825864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017733821,0.00008232212,0.0005515591,0.00040600108,0.000040942035,0.00050154096,0.0005207957,0.03846518,0.02090082,0.67239624,0.011372007,0.2545852],"study_design_scores_gemma":[0.00023333316,0.00051732507,0.0008382429,0.000100033954,0.0001821409,0.0009900511,0.00032628342,0.3569084,0.025606202,0.3299556,0.28420374,0.00013859595],"about_ca_topic_score_codex":0.00093690614,"about_ca_topic_score_gemma":0.0010448691,"teacher_disagreement_score":0.0023624955,"about_ca_system_score_codex":0.0005214695,"about_ca_system_score_gemma":0.0006884154,"threshold_uncertainty_score":0.0079033375},"labels":[],"label_agreement":null},{"id":"W2063992960","doi":"10.1007/s00446-011-0150-8","title":"RMR-efficient implementations of comparison primitives using read and write operations","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Swap (finance); Asynchronous communication; Shared memory; Reading (process); Constant (computer programming); Distributed shared memory; Cache; Implementation; Programming language; Uniform memory access; Memory management; Overlay; Computer network","score_opus":0.07288501185737015,"score_gpt":0.31795905169134403,"score_spread":0.24507403983397388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063992960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052615274,0.001535063,0.87824434,0.00047711047,0.00044909056,0.000362651,0.0005490288,0.050539583,0.015227925],"genre_scores_gemma":[0.39886826,0.0003351977,0.5772398,0.00046296074,0.00026742494,0.0005119728,0.0013421673,0.004219066,0.016753118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99369615,0.0019565823,0.0005851079,0.0008531021,0.0020714384,0.0008375931],"domain_scores_gemma":[0.9878127,0.003187015,0.0008175625,0.0064658946,0.0014112747,0.00030554127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040886793,0.0016820872,0.0018336297,0.0018967468,0.0014173168,0.0037554158,0.0059960764,0.0017129905,0.019903067],"category_scores_gemma":[0.011385434,0.0013855557,0.0010063449,0.0030017663,0.001399044,0.007983651,0.0033857857,0.0022033888,0.007874102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004019241,0.000687263,0.0017735388,0.0008883213,0.00019233495,0.00038787385,0.0005828799,0.02090024,0.09978031,0.11525752,0.04372182,0.71180856],"study_design_scores_gemma":[0.001653821,0.0010838045,0.0017310008,0.0002345636,0.00032842206,0.0010039482,0.00039230613,0.50372845,0.30969858,0.11769495,0.062047683,0.00040244826],"about_ca_topic_score_codex":0.0012429204,"about_ca_topic_score_gemma":0.0025927236,"teacher_disagreement_score":0.019903067,"about_ca_system_score_codex":0.0019484134,"about_ca_system_score_gemma":0.0023703994,"threshold_uncertainty_score":0.06658238},"labels":[],"label_agreement":null},{"id":"W2064330718","doi":"10.1016/j.jpdc.2014.10.002","title":"Robust network supercomputing with unreliable workers","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; University of British Columbia","funders":"National Science Foundation","keywords":"Correctness; Computer science; Computation; A priori and a posteriori; Process (computing); Supercomputer; Task (project management); Master/slave; Master equation; Distributed computing; Theoretical computer science; Algorithm; Parallel computing; Programming language","score_opus":0.013396595270680893,"score_gpt":0.20833888110127916,"score_spread":0.19494228583059825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064330718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3380562,0.0011336692,0.63683516,0.0017440397,0.00057967985,0.00012233513,0.00021234677,0.0018925451,0.01942405],"genre_scores_gemma":[0.96810216,0.00012812614,0.02814073,0.000059932572,0.00012732476,0.000046172765,0.000060582617,0.00011447853,0.0032205842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988186,0.00035065637,0.00005659876,0.00015595023,0.00043869787,0.0001795887],"domain_scores_gemma":[0.99577373,0.0014264993,0.00044307215,0.0014365658,0.00065709394,0.00026304583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016145787,0.0004708857,0.0011117915,0.00067272043,0.0012758395,0.0016043541,0.0018163248,0.0008627241,0.0022197277],"category_scores_gemma":[0.00905357,0.0004566314,0.00032457197,0.0009558266,0.001700291,0.0015449278,0.0020889153,0.0009593684,0.0005286051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014965925,0.0001331566,0.0024362553,0.000109235276,0.00009653658,0.00024595804,0.00016231768,0.8847924,0.009380553,0.046623897,0.0050651236,0.04945795],"study_design_scores_gemma":[0.000044212116,0.000059676877,0.00037765395,0.000004825419,0.00001652212,0.000025697544,0.00003231809,0.9757592,0.0022463368,0.020613393,0.00080864335,0.00001162514],"about_ca_topic_score_codex":0.003291135,"about_ca_topic_score_gemma":0.0027983831,"teacher_disagreement_score":0.003291135,"about_ca_system_score_codex":0.0009927554,"about_ca_system_score_gemma":0.0012205428,"threshold_uncertainty_score":0.008538842},"labels":[],"label_agreement":null},{"id":"W2064856671","doi":"10.1109/wowmom.2014.6918932","title":"SpaceOS: Operating system services for smart computing environments","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; JADE (particle detector); Software; Programming paradigm; Smart environment; Stack (abstract data type); Core (optical fiber); Software engineering; Operating system; Distributed computing; World Wide Web; Internet of Things; Programming language","score_opus":0.007821346837481669,"score_gpt":0.21652226915107298,"score_spread":0.2087009223135913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064856671","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135422805,0.0021484303,0.27729604,0.0012303294,0.0009016274,0.0005577479,0.011311083,0.6312478,0.06176462],"genre_scores_gemma":[0.38625616,0.0061940104,0.20732938,0.004713042,0.0015995585,0.002150611,0.110871196,0.13229837,0.14858763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982254,0.0002058773,0.00020139893,0.0001679549,0.00086942414,0.00033008461],"domain_scores_gemma":[0.99725026,0.00043698392,0.00025794544,0.0007856639,0.0006054933,0.0006635994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017622445,0.0018216348,0.000890695,0.00183514,0.0011159999,0.003075228,0.001957561,0.0011218314,0.034108743],"category_scores_gemma":[0.005107971,0.00087899587,0.0006145314,0.0017510692,0.0011473065,0.0056862603,0.0039143306,0.0029908847,0.025314346],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015275088,0.00028207852,0.0031538045,0.00078196405,0.000121549645,0.00045261657,0.00066448754,0.0050031976,0.022404289,0.054605227,0.7096796,0.20132376],"study_design_scores_gemma":[0.00047660805,0.00019398006,0.002882466,0.00022589507,0.00006720542,0.0004928537,0.00017963044,0.040947918,0.024136664,0.03503915,0.89515734,0.00020038457],"about_ca_topic_score_codex":0.0028180373,"about_ca_topic_score_gemma":0.0018346005,"teacher_disagreement_score":0.034108743,"about_ca_system_score_codex":0.0009857237,"about_ca_system_score_gemma":0.0022535846,"threshold_uncertainty_score":0.114105046},"labels":[],"label_agreement":null},{"id":"W2065624422","doi":"10.1163/157404006778330834","title":"An Elegant l-exclusion Algorithm for Shared Memory Systems","year":2006,"lang":"en","type":"article","venue":"Computing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Computer science; Correctness; Generalization; Simple (philosophy); Java; Theoretical computer science; Algorithm; Parallel computing; Mathematics; Programming language","score_opus":0.009650095903142501,"score_gpt":0.2349383286158963,"score_spread":0.2252882327127538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065624422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141907865,0.00017136123,0.98143756,0.0002510216,0.00006121668,0.00006467021,0.00002398448,0.000924611,0.0028747101],"genre_scores_gemma":[0.33023387,0.00016582811,0.6612161,0.00021869679,0.000077768935,0.00023849618,0.00014964558,0.00017728872,0.0075223604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993851,0.00013300774,0.000036805028,0.00008964599,0.00023384271,0.00012155689],"domain_scores_gemma":[0.9994337,0.0002446604,0.00004376515,0.000096225456,0.00012361877,0.000057978636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054316927,0.00046093445,0.0007077816,0.00045901374,0.001094446,0.0009904612,0.0015059413,0.0008641972,0.003369127],"category_scores_gemma":[0.0019453225,0.00028849143,0.00035212896,0.00065182557,0.0006164972,0.001340083,0.002139009,0.0009966912,0.00084716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074114243,0.0002529645,0.0010213378,0.0002912784,0.0000735075,0.00039476002,0.00050277065,0.20709139,0.033212006,0.19007833,0.011737473,0.55460304],"study_design_scores_gemma":[0.00021134473,0.00013123857,0.00014965676,0.000015847878,0.000017768647,0.00014917456,0.000037082376,0.9120478,0.006749327,0.06851308,0.01194885,0.000028870916],"about_ca_topic_score_codex":0.0016038334,"about_ca_topic_score_gemma":0.0019284548,"teacher_disagreement_score":0.003369127,"about_ca_system_score_codex":0.000644374,"about_ca_system_score_gemma":0.0012026133,"threshold_uncertainty_score":0.011270821},"labels":[],"label_agreement":null},{"id":"W2066429853","doi":"10.1016/j.jpdc.2005.10.011","title":"Optimal decision strategies in Byzantine environments","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Correctness; Computer science; Probability distribution; Expected value; Set (abstract data type); Optimal decision; Markov decision process; Mathematical optimization; Value (mathematics); Decision rule; Decision problem; Construct (python library); Theoretical computer science; Mathematics; Algorithm; Decision tree; Artificial intelligence; Markov process; Machine learning; Statistics","score_opus":0.00963331687269626,"score_gpt":0.2521058600829257,"score_spread":0.24247254321022943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066429853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28124726,0.0007472561,0.6855276,0.0019301352,0.00008945484,0.00018900026,0.00021704643,0.00044146256,0.029610828],"genre_scores_gemma":[0.8977226,0.00044901794,0.091799475,0.00013015167,0.000044058575,0.0001155818,0.000101765836,0.00010247317,0.00953474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841225,0.0009388695,0.000054135486,0.0001602552,0.00014350435,0.00029094057],"domain_scores_gemma":[0.99544746,0.0035650546,0.00027814286,0.0002039263,0.00024703925,0.00025838462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065875,0.00079886086,0.0013374316,0.00070191856,0.0010172388,0.0030182048,0.0013062777,0.0016196179,0.004327666],"category_scores_gemma":[0.009311468,0.0005201859,0.00033165372,0.00083355076,0.001371861,0.0037454257,0.0018799457,0.0015022533,0.00055383233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009841766,0.00012478213,0.00060166157,0.0001945321,0.00005593603,0.00018865094,0.0005578812,0.43674278,0.0019238578,0.50611657,0.003752708,0.048756395],"study_design_scores_gemma":[0.000113606045,0.000102226484,0.00012343834,0.000017310098,0.000018322798,0.000040731236,0.00014108923,0.6458379,0.00094908563,0.35036692,0.0022724776,0.00001692082],"about_ca_topic_score_codex":0.0017117081,"about_ca_topic_score_gemma":0.0020531174,"teacher_disagreement_score":0.004327666,"about_ca_system_score_codex":0.0010992347,"about_ca_system_score_gemma":0.0011059142,"threshold_uncertainty_score":0.014477432},"labels":[],"label_agreement":null},{"id":"W2067357795","doi":"10.5555/1404680.1404736","title":"Simulation of a complex distributed real-time database system","year":2007,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Turnaround time; Modular design; Distributed computing; Distributed database; Protocol (science); Extensibility; Database transaction; Distributed Computing Environment; Set (abstract data type); Real-time database; Task (project management); Transaction processing; Range (aeronautics); Database; Operating system; Programming language","score_opus":0.040165009196724076,"score_gpt":0.30654768322293025,"score_spread":0.2663826740262062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067357795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971565,0.0003274103,0.18083185,0.000745349,0.000113971626,0.00025855174,0.00089401373,0.0014738803,0.01819851],"genre_scores_gemma":[0.9632863,0.00017986548,0.03253676,0.000084567546,0.000012207686,0.00015325843,0.0003841244,0.00005252742,0.0033103917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.00017071048,0.000044309912,0.000090175236,0.00016204214,0.000071094466],"domain_scores_gemma":[0.9985927,0.0007562624,0.00008968773,0.00016854824,0.000226267,0.00016662129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070510816,0.0003391721,0.0006100275,0.0003697484,0.0006445948,0.0012007201,0.001254039,0.0011146601,0.0037559315],"category_scores_gemma":[0.002161929,0.00028025985,0.00046547878,0.0006143897,0.0008324022,0.0009715535,0.0009568553,0.00070946076,0.0003352283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000935377,0.00006892934,0.0015111928,0.0000315407,0.000019975738,0.00017848179,0.000100715435,0.98750496,0.0023808787,0.00478969,0.00044947345,0.002870631],"study_design_scores_gemma":[0.00003312846,0.000031788673,0.0002515525,0.0000022943136,0.0000046628643,0.000026950618,0.000026994501,0.99745995,0.0006969537,0.00082587264,0.0006346765,0.0000052309174],"about_ca_topic_score_codex":0.008325808,"about_ca_topic_score_gemma":0.003156046,"teacher_disagreement_score":0.008325808,"about_ca_system_score_codex":0.0008840469,"about_ca_system_score_gemma":0.0011148576,"threshold_uncertainty_score":0.016554713},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01069697413433289,"score_gpt":0.24789450467668148,"score_spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067397086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1335546,0.0056128087,0.8088734,0.0057258373,0.0017359413,0.000084986445,0.0001630101,0.0012467973,0.04300249],"genre_scores_gemma":[0.9396695,0.0013403441,0.03910671,0.0003474266,0.0007144848,0.00006588652,0.00008170788,0.00009122365,0.018582765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985121,0.0003495641,0.00007195456,0.00020186986,0.0006349516,0.0002296828],"domain_scores_gemma":[0.99571383,0.0019556887,0.00031351234,0.0011477552,0.0006426919,0.00022658998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011768013,0.00030224782,0.00062540214,0.000612196,0.0017390868,0.0028760047,0.0014936356,0.0013353048,0.0026660783],"category_scores_gemma":[0.007782384,0.00031844337,0.00029015366,0.0012380324,0.0021854204,0.0047902656,0.0018053073,0.0013613132,0.00052968995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023971035,0.00007149788,0.0006165053,0.000113838156,0.000024733574,0.00020560887,0.00036149667,0.039876174,0.0023708593,0.9024074,0.0059959814,0.047716223],"study_design_scores_gemma":[0.000027734846,0.000023460692,0.00016785489,0.0000123014415,0.00001907641,0.00013509222,0.00008104888,0.090050645,0.0019744027,0.8945238,0.012967419,0.00001709108],"about_ca_topic_score_codex":0.00079169334,"about_ca_topic_score_gemma":0.0009625477,"teacher_disagreement_score":0.0028760047,"about_ca_system_score_codex":0.00081497256,"about_ca_system_score_gemma":0.0009549237,"threshold_uncertainty_score":0.008918941},"labels":[],"label_agreement":null},{"id":"W2067642869","doi":"10.1145/1619258.1619269","title":"Parallel event processing for content-based publish/subscribe systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Software transactional memory; Throughput; Lock (firearm); Matching (statistics); Event (particle physics); Transactional memory; Implementation; Parallel computing; Software; Distributed computing; Computer architecture; Embedded system; Operating system; Software engineering; Database","score_opus":0.04701812603583192,"score_gpt":0.26994755341147186,"score_spread":0.22292942737563995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067642869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046150424,0.00058953644,0.94099385,0.000594409,0.0002188602,0.00022415142,0.00014052866,0.0051705716,0.0059177275],"genre_scores_gemma":[0.6376175,0.0006227285,0.3511213,0.00019939049,0.00025753217,0.00027537625,0.00051029754,0.0003993075,0.008996504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988952,0.00022288479,0.00010174208,0.00014502517,0.0005243003,0.0001109359],"domain_scores_gemma":[0.99821293,0.0008125484,0.00010159746,0.00047460344,0.00031498756,0.00008338073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014134182,0.00042362034,0.00067069655,0.0005444836,0.0009908194,0.0018711356,0.0013211111,0.0006315284,0.004903481],"category_scores_gemma":[0.0040920884,0.00029875664,0.00039620185,0.0008565807,0.00057268597,0.0021508213,0.0008353271,0.000954252,0.001131268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017438272,0.00084204075,0.0037186716,0.000517998,0.0001613085,0.000666402,0.00039711245,0.22462474,0.118943766,0.13601743,0.017914819,0.4944519],"study_design_scores_gemma":[0.00025254922,0.00023421827,0.00052075845,0.000013100713,0.000059621092,0.00025185893,0.000074337615,0.82470214,0.068646275,0.083029896,0.022178933,0.000036267284],"about_ca_topic_score_codex":0.0012427665,"about_ca_topic_score_gemma":0.0011464772,"teacher_disagreement_score":0.004903481,"about_ca_system_score_codex":0.00071300165,"about_ca_system_score_gemma":0.0009614982,"threshold_uncertainty_score":0.016403854},"labels":[],"label_agreement":null},{"id":"W2068701179","doi":"10.1109/pdcat.2012.31","title":"A Synchronization-Induced Checkpoint Protocol for Group-Synchronous Parallel Programs","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronization (alternating current); Computer science; Overhead (engineering); Protocol (science); Distributed computing; Data synchronization; Process (computing); Parallel computing; Fault tolerance; Embedded system; Computer network; Operating system","score_opus":0.03954535464032354,"score_gpt":0.30283147954415834,"score_spread":0.2632861249038348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068701179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08371551,0.00017583996,0.912299,0.00023934744,0.00006828672,0.00019459683,0.00006340014,0.0009859599,0.0022580798],"genre_scores_gemma":[0.83014256,0.00023087235,0.16731116,0.000055873672,0.00003897127,0.00031653402,0.000092574985,0.00009432168,0.0017171768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970907,0.00006343419,0.000029659983,0.000054656477,0.000099182784,0.000044022963],"domain_scores_gemma":[0.9991247,0.0002655256,0.00017208257,0.00023819545,0.00012610789,0.00007330289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915806,0.00029173086,0.00028635075,0.00040035832,0.00055111747,0.00049976364,0.00094033347,0.0003647792,0.0010675702],"category_scores_gemma":[0.0022404364,0.00014856283,0.00021603715,0.0006908348,0.00063727534,0.0009495088,0.0009162971,0.00069231045,0.0001410947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007470505,0.00053539936,0.0026708564,0.00048864144,0.000096025695,0.00063436886,0.0009122392,0.25885773,0.17760812,0.30906755,0.00602206,0.24235998],"study_design_scores_gemma":[0.00022971313,0.00068596617,0.00087245705,0.000034168694,0.00008547923,0.0002974667,0.00015365747,0.8724252,0.058621116,0.05388078,0.012656944,0.000057036767],"about_ca_topic_score_codex":0.0005515529,"about_ca_topic_score_gemma":0.00063602265,"teacher_disagreement_score":0.0010675702,"about_ca_system_score_codex":0.0004393776,"about_ca_system_score_gemma":0.0009745419,"threshold_uncertainty_score":0.003571391},"labels":[],"label_agreement":null},{"id":"W2070626055","doi":"10.1007/s10619-005-4257-4","title":"Preventive Replication in a Database Cluster","year":2005,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Replica; Computer science; Replication (statistics); Database transaction; Benchmark (surveying); Distributed database; Database; Throughput; Cluster (spacecraft); Consistency (knowledge bases); Data consistency; Distributed computing; Parallel computing; Computer network; Operating system; Mathematics; Artificial intelligence; Geography","score_opus":0.022992260274848044,"score_gpt":0.2855527655536087,"score_spread":0.2625605052787607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070626055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.665119,0.0010902104,0.3153157,0.0015548621,0.000402871,0.00020755817,0.00017281756,0.0071416,0.008995437],"genre_scores_gemma":[0.94873804,0.00013380445,0.047484554,0.00006507943,0.000067313194,0.000058130405,0.000103399914,0.00010111501,0.0032485598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.00036432274,0.00010693992,0.00034258375,0.0006448559,0.00026919637],"domain_scores_gemma":[0.99284756,0.0013434512,0.00043280204,0.0032817188,0.0013254778,0.0007689146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022535557,0.00034117338,0.000983835,0.0009174201,0.0023527348,0.0022202588,0.002826814,0.0010308621,0.001878176],"category_scores_gemma":[0.006117551,0.0006690131,0.00035875133,0.001592368,0.001040887,0.0017512776,0.0019969768,0.0009913741,0.000552555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005734737,0.0014740296,0.029233722,0.00049888494,0.00029728335,0.0020864322,0.002092231,0.4561655,0.092112124,0.13894469,0.023200693,0.24815968],"study_design_scores_gemma":[0.00026971995,0.00036860124,0.0022699055,0.000011754745,0.00012445616,0.0003905015,0.00034245636,0.94942486,0.013546498,0.026628926,0.0065715355,0.000050815648],"about_ca_topic_score_codex":0.0044888747,"about_ca_topic_score_gemma":0.0036591792,"teacher_disagreement_score":0.0044888747,"about_ca_system_score_codex":0.0011384516,"about_ca_system_score_gemma":0.002497375,"threshold_uncertainty_score":0.011918128},"labels":[],"label_agreement":null},{"id":"W2070651426","doi":"10.1016/j.future.2013.06.017","title":"Efficient execution of speculative threads and transactions with hardware transactional memory","year":2013,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Speculative multithreading; Transactional memory; Speculative execution; Parallel computing; Thread (computing); Speedup; Software transactional memory; Rollback; Lock (firearm); Operating system; Distributed computing; Multithreading; Database transaction; Programming language","score_opus":0.008922112905692175,"score_gpt":0.19149516974158118,"score_spread":0.182573056835889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070651426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252381,0.0022899264,0.4621871,0.00036409646,0.0002567976,0.00009549139,0.00011184152,0.002657518,0.0067991205],"genre_scores_gemma":[0.90378654,0.0002326848,0.09333116,0.000043069784,0.00004367475,0.00005332141,0.00011963591,0.00012615288,0.0022638466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.00025144118,0.00007974185,0.000105673214,0.00035198213,0.0001376065],"domain_scores_gemma":[0.99770796,0.0008757388,0.00015784157,0.00078985904,0.0003612602,0.00010740982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094997033,0.00044397518,0.00046941367,0.00039086965,0.00064942456,0.0013183339,0.0014895798,0.0005048773,0.0018428181],"category_scores_gemma":[0.003895017,0.000448419,0.00027212763,0.00068454933,0.00056341104,0.0014290722,0.00089370157,0.0007148941,0.0003235293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004877668,0.00046358313,0.010387761,0.00041635768,0.00022424951,0.0006917847,0.00058829907,0.27067152,0.1310719,0.09980507,0.00921049,0.47159138],"study_design_scores_gemma":[0.00013603426,0.00023245644,0.0005828137,0.000011107425,0.000050496965,0.00011624602,0.00005848451,0.9494641,0.026973343,0.019218666,0.00314151,0.000014674364],"about_ca_topic_score_codex":0.0012544738,"about_ca_topic_score_gemma":0.0023923465,"teacher_disagreement_score":0.0018428181,"about_ca_system_score_codex":0.00044300157,"about_ca_system_score_gemma":0.0012471356,"threshold_uncertainty_score":0.006164849},"labels":[],"label_agreement":null},{"id":"W2071898078","doi":"10.1142/s0129054106004492","title":"FAST BROADCASTING WITH BYZANTINE FAULTS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Correctness; Broadcasting (networking); Quantum Byzantine agreement; Computer science; Binary logarithm; Byzantine fault tolerance; Robustness (evolution); Log-log plot; Node (physics); Algorithm; Blocking (statistics); Distributed computing; Computer network; Fault tolerance; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.008157644065646001,"score_gpt":0.2592890208855335,"score_spread":0.2511313768198875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071898078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1057983,0.00035861696,0.89085907,0.00025860636,0.000033142176,0.000095505864,0.00005200518,0.00073100004,0.0018136548],"genre_scores_gemma":[0.7641826,0.00056709745,0.23122402,0.00013489631,0.00009967445,0.0002158723,0.00016611308,0.0002095453,0.0032001354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.00033994572,0.00005793322,0.00020711734,0.00046692995,0.00030196065],"domain_scores_gemma":[0.99290985,0.0044743707,0.0008942965,0.00089216046,0.0006773142,0.00015213301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588315,0.00071542163,0.0011693097,0.0009511381,0.0008525212,0.0015323792,0.001554806,0.0013575915,0.0011624774],"category_scores_gemma":[0.008685489,0.0004646571,0.00074261724,0.00086142623,0.0017695129,0.0025197063,0.0013868436,0.0013405234,0.00038402472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005433955,0.0000750344,0.002680795,0.00032406344,0.00008109448,0.00028322169,0.00058700907,0.7820231,0.03500927,0.09703647,0.0018537758,0.07950281],"study_design_scores_gemma":[0.000046055386,0.00010313227,0.00018477226,0.000016410439,0.000025075078,0.000116759555,0.000032254567,0.9608064,0.0080427565,0.029197264,0.0014170791,0.000012010976],"about_ca_topic_score_codex":0.0024365517,"about_ca_topic_score_gemma":0.0011028885,"teacher_disagreement_score":0.0024365517,"about_ca_system_score_codex":0.001338553,"about_ca_system_score_gemma":0.0014043213,"threshold_uncertainty_score":0.009711981},"labels":[],"label_agreement":null},{"id":"W2072483141","doi":"10.1016/j.tcs.2014.02.041","title":"Causality in physics and computation","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Causality (physics); Theory of relativity; Causal structure; Spacetime; Computation; Theoretical physics; General relativity; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.010787520034739989,"score_gpt":0.2622740298283683,"score_spread":0.2514865097936283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072483141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0377935,0.050926246,0.60258096,0.05915955,0.009828414,0.00014643224,0.0005521546,0.00057405414,0.23843865],"genre_scores_gemma":[0.8661956,0.019325372,0.05765091,0.004524022,0.009913219,0.0003371883,0.00029278934,0.00034940167,0.041411437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850166,0.0006033588,0.00009597514,0.00025168195,0.00043061897,0.000116721065],"domain_scores_gemma":[0.99403656,0.0042059873,0.00025842915,0.000736784,0.0005501375,0.00021206918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029488183,0.0007933143,0.0015897804,0.0027223378,0.0025194916,0.004297559,0.0013567158,0.0028395352,0.008121083],"category_scores_gemma":[0.008463767,0.00072162435,0.0009771641,0.0023812412,0.014881269,0.013777128,0.002466922,0.005822308,0.00082714466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014780338,0.0000020169216,0.000013656737,0.000012393048,0.0000013616896,0.000004609098,0.000035850007,0.00014527951,0.000013925375,0.99871266,0.00033216586,0.00072456035],"study_design_scores_gemma":[0.0000019311892,8.140847e-7,0.0000071485047,0.000002671828,9.3271115e-7,0.000004059642,0.0000058956193,0.00027643598,0.000012315881,0.99830085,0.0013856974,0.0000012432857],"about_ca_topic_score_codex":0.0023600894,"about_ca_topic_score_gemma":0.0010993943,"teacher_disagreement_score":0.008121083,"about_ca_system_score_codex":0.0024015412,"about_ca_system_score_gemma":0.002039909,"threshold_uncertainty_score":0.027167678},"labels":[],"label_agreement":null},{"id":"W2072498199","doi":"10.4018/jmcmc.2012070101","title":"Progressive Data Synchronization Model for Mobile Devices","year":2012,"lang":"en","type":"article","venue":"International Journal of Mobile Computing and Multimedia Communications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Data synchronization; Computer science; Synchronizing; Synchronization (alternating current); Distributed computing; Mobile device; Computer network; Mobile computing; Context (archaeology); Real-time computing; Wireless sensor network; Telecommunications; Channel (broadcasting); Operating system","score_opus":0.05526508567468721,"score_gpt":0.3751479811107485,"score_spread":0.3198828954360613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072498199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010795528,0.00039226506,0.97763693,0.0005511459,0.00015163409,0.0002600064,0.00034693335,0.0010153154,0.008850176],"genre_scores_gemma":[0.44200277,0.0020943133,0.5238194,0.000675719,0.00037410212,0.0014611685,0.0022564302,0.00041144015,0.02690465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774534,0.00038288024,0.00030107723,0.00050990825,0.0008594898,0.00020139],"domain_scores_gemma":[0.99767214,0.0004893679,0.00021841966,0.00092377915,0.0005459052,0.00015027792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019387392,0.00048507605,0.0005680321,0.0010009567,0.0008649531,0.003087591,0.0025302519,0.0013600717,0.0027519842],"category_scores_gemma":[0.0043211887,0.00039594682,0.0009394528,0.0014055717,0.0011418842,0.0059721237,0.0025906973,0.0019261661,0.0013472539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001475685,0.00009184784,0.001474043,0.00019404618,0.00004681796,0.0006768134,0.0013081757,0.04046439,0.010241976,0.8810879,0.0070147626,0.05725176],"study_design_scores_gemma":[0.00014863476,0.00032302496,0.0008703328,0.00015146576,0.00012992177,0.0014048617,0.00045909398,0.52353865,0.015520047,0.25521925,0.20213318,0.00010149146],"about_ca_topic_score_codex":0.0034952462,"about_ca_topic_score_gemma":0.0019321322,"teacher_disagreement_score":0.0034952462,"about_ca_system_score_codex":0.0013263191,"about_ca_system_score_gemma":0.0016435698,"threshold_uncertainty_score":0.010253191},"labels":[],"label_agreement":null},{"id":"W2073683596","doi":"10.1145/1073814.1073849","title":"The weakest failure detector to solve nonuniform consensus","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Computer science; Consensus; Consensus algorithm; Distributed computing; Algorithm; Telecommunications; Artificial intelligence; Multi-agent system","score_opus":0.007380470246799258,"score_gpt":0.22291566938085253,"score_spread":0.21553519913405328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073683596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026560152,0.00009865696,0.9711392,0.00042109692,0.00006628968,0.00003277202,0.000026711085,0.00013269998,0.0015224281],"genre_scores_gemma":[0.7338215,0.00034122527,0.2608226,0.0004897336,0.00020585593,0.00029848522,0.0001326119,0.00011675759,0.0037711905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832135,0.0005102002,0.00011815243,0.00043939706,0.00037935478,0.00023140183],"domain_scores_gemma":[0.99138427,0.0046007256,0.0008622109,0.0012704616,0.0014176578,0.00046461448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031448998,0.0006203407,0.0010582992,0.0006117395,0.00069094374,0.0007674083,0.0016470059,0.0010446159,0.0017119135],"category_scores_gemma":[0.018619284,0.00027933315,0.000643789,0.00051059434,0.0019520387,0.0033822272,0.0034227122,0.0017561351,0.00032131554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004679296,0.000114738235,0.0029420862,0.0003121124,0.00011745347,0.00019211485,0.0003390626,0.5207153,0.015411661,0.3446555,0.0041361293,0.110596016],"study_design_scores_gemma":[0.00005502925,0.00014026812,0.00020309808,0.000018475623,0.0000212868,0.00007289266,0.0000429054,0.8381946,0.0056927525,0.15394263,0.0015949443,0.000021068216],"about_ca_topic_score_codex":0.0006710121,"about_ca_topic_score_gemma":0.0005864833,"teacher_disagreement_score":0.0031448998,"about_ca_system_score_codex":0.00060694653,"about_ca_system_score_gemma":0.0014543365,"threshold_uncertainty_score":0.01663202},"labels":[],"label_agreement":null},{"id":"W2074139260","doi":"10.1109/dest.2010.5610658","title":"Mobile devices, scalability &amp;amp; digital ecologies","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Handset; Laptop; Computer science; Mobile device; Mobile broadband; Scalability; Mobile Web; Key (lock); Mobile service; Mobile computing; Mobile technology; Service (business); Transmission (telecommunications); IMT Advanced; Mobile payment; Data transmission; Telecommunications; Mobile telephony; Mobile radio; Computer network; Wireless; World Wide Web; Business; Computer security; Operating system","score_opus":0.014785499620129917,"score_gpt":0.26239236218051354,"score_spread":0.2476068625603836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074139260","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07542716,0.061396886,0.12366074,0.17540732,0.003843303,0.00029325028,0.0015526882,0.0031937426,0.5552249],"genre_scores_gemma":[0.77249414,0.057776637,0.06168598,0.008339932,0.0046599726,0.0003428253,0.00077303825,0.00037762936,0.09354995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893814,0.00017849787,0.000048454604,0.00017390265,0.00052367843,0.00013725982],"domain_scores_gemma":[0.996458,0.001720465,0.00030258187,0.00038495465,0.0007823484,0.00035170777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661513,0.00048603688,0.00038564627,0.0013214885,0.0013224215,0.005039433,0.001142066,0.0019400774,0.017348647],"category_scores_gemma":[0.006655681,0.00032177198,0.00022844611,0.002271051,0.0018677117,0.0098817125,0.0027953493,0.0016289986,0.002906511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007447017,0.00007798975,0.009273721,0.00071028125,0.0000301579,0.00085737166,0.0010724707,0.009863546,0.004004875,0.3347946,0.15407294,0.48516753],"study_design_scores_gemma":[0.000027207494,0.00012425597,0.008871037,0.00043224517,0.00003284878,0.002359612,0.0027929358,0.024149064,0.0014515715,0.25145033,0.70825,0.000058792513],"about_ca_topic_score_codex":0.0034802842,"about_ca_topic_score_gemma":0.0034850899,"teacher_disagreement_score":0.017348647,"about_ca_system_score_codex":0.0013937299,"about_ca_system_score_gemma":0.0008770382,"threshold_uncertainty_score":0.058036983},"labels":[],"label_agreement":null},{"id":"W2075289482","doi":"10.1109/itng.2010.63","title":"Towards Adaptive Replication Reconfiguration for QoS","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Replication (statistics); Distributed computing; Control reconfiguration; Scalability; Middleware (distributed applications); Quality of service; Software deployment; Replica; Reliability (semiconductor); Computer network; Embedded system; Operating system","score_opus":0.023974349669952204,"score_gpt":0.27601845579262063,"score_spread":0.2520441061226684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075289482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007470087,0.0015798503,0.9733716,0.002429663,0.0004266654,0.00007194858,0.000024243645,0.000977368,0.013648619],"genre_scores_gemma":[0.3735797,0.002877653,0.6081532,0.0013257057,0.0009037079,0.00023933161,0.0001235078,0.00046160142,0.012335578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978173,0.0007503481,0.000104954386,0.00035877404,0.0007477721,0.00022094618],"domain_scores_gemma":[0.9969687,0.00084053667,0.00022503141,0.0010205539,0.0007508076,0.0001944786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023350504,0.00073875056,0.0006627726,0.0007476381,0.0007969444,0.0019193471,0.0019217236,0.0017124254,0.0023023346],"category_scores_gemma":[0.006747696,0.0004922023,0.0006123658,0.00068751624,0.0014511144,0.0028500776,0.0029055483,0.002816944,0.0014442482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001252298,0.0000900646,0.0008564202,0.00029056187,0.00005886415,0.0006592639,0.0007407124,0.10636684,0.03558474,0.6625298,0.010446476,0.18225105],"study_design_scores_gemma":[0.00004309726,0.000100688856,0.00041997287,0.00009347823,0.000026812833,0.00056958984,0.00018614849,0.55731606,0.010252297,0.3328433,0.09807478,0.00007382962],"about_ca_topic_score_codex":0.0009541316,"about_ca_topic_score_gemma":0.00078005815,"teacher_disagreement_score":0.0023350504,"about_ca_system_score_codex":0.0010917651,"about_ca_system_score_gemma":0.0007582505,"threshold_uncertainty_score":0.012349129},"labels":[],"label_agreement":null},{"id":"W2075802691","doi":"10.1145/1451940.1451954","title":"Showing correctness of a replication algorithm in a component based system","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Correctness; Computer science; Component (thermodynamics); Replication (statistics); Rotation formalisms in three dimensions; Distributed computing; Process (computing); Architecture; Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.024908733481079755,"score_gpt":0.23500445868243436,"score_spread":0.2100957252013546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075802691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012017026,0.00009494009,0.98381305,0.00038156204,0.0000454477,0.000096348034,0.00005586576,0.0021837782,0.001312015],"genre_scores_gemma":[0.3748586,0.0003912573,0.6209316,0.0003767938,0.00013968602,0.00023546391,0.0004633567,0.00090733205,0.0016958406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97971785,0.006445706,0.0024410486,0.0024803882,0.007168349,0.001746713],"domain_scores_gemma":[0.942351,0.034919936,0.0027328704,0.012319335,0.0070118248,0.000665087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0130437855,0.0013563636,0.0015303851,0.0016815563,0.0022874605,0.006947426,0.0042709974,0.00502786,0.002367386],"category_scores_gemma":[0.04938321,0.0018776371,0.0033111337,0.0015062648,0.006705603,0.00935057,0.0047247624,0.0046850746,0.0011259039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047592135,0.00028463927,0.0062509635,0.00083633687,0.00038980113,0.001717531,0.0016952967,0.29483092,0.02633373,0.5933275,0.0037003146,0.07015699],"study_design_scores_gemma":[0.00016584221,0.00018695982,0.00044418796,0.00011253113,0.00020108042,0.0004992784,0.00018597607,0.599418,0.034986887,0.3563421,0.007343465,0.000113665265],"about_ca_topic_score_codex":0.005974267,"about_ca_topic_score_gemma":0.003131735,"teacher_disagreement_score":0.0130437855,"about_ca_system_score_codex":0.001961263,"about_ca_system_score_gemma":0.0041118856,"threshold_uncertainty_score":0.06898296},"labels":[],"label_agreement":null},{"id":"W2076003965","doi":"10.1007/s00224-003-1082-x","title":"Automatable Verification of Sequential Consistency","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Undecidable problem; Consistency model; Sequential consistency; Computer science; Consistency (knowledge bases); Decidability; Class (philosophy); Protocol (science); Task (project management); Theoretical computer science; State (computer science); Multiprocessing; Programming language; Finite-state machine; Model checking; Parallel computing; Artificial intelligence; Correctness","score_opus":0.020711842044976784,"score_gpt":0.24722852933840578,"score_spread":0.226516687293429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076003965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065239355,0.0001918661,0.9167036,0.001631638,0.00040726777,0.00021105634,0.00039182004,0.00501517,0.010208291],"genre_scores_gemma":[0.8666423,0.00014065325,0.12605909,0.00054870086,0.00020264735,0.00025938873,0.00052434055,0.00052227866,0.0051004677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99019533,0.0032572898,0.00072370685,0.001671584,0.0029792995,0.0011727719],"domain_scores_gemma":[0.93359333,0.04880038,0.0019973908,0.009373754,0.005480037,0.0007550719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005677766,0.0010909021,0.0014727259,0.0015218091,0.002030646,0.004294088,0.0035212748,0.0023461538,0.0068746004],"category_scores_gemma":[0.038113188,0.0014180831,0.002633989,0.0011012496,0.006176226,0.00880583,0.0052544754,0.005925876,0.0010566622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011889976,0.00032520626,0.002154763,0.000484978,0.0001822588,0.00058079127,0.0009679937,0.0908497,0.01552686,0.82962215,0.005936623,0.052179612],"study_design_scores_gemma":[0.00018994082,0.000077995355,0.0002230845,0.000045314933,0.00007801975,0.00008371064,0.00008792987,0.2913494,0.015308187,0.68966424,0.002848379,0.000043813725],"about_ca_topic_score_codex":0.0053265635,"about_ca_topic_score_gemma":0.0062771137,"teacher_disagreement_score":0.0068746004,"about_ca_system_score_codex":0.0031477055,"about_ca_system_score_gemma":0.0052042454,"threshold_uncertainty_score":0.03002721},"labels":[],"label_agreement":null},{"id":"W2076662080","doi":"10.1109/micro.2010.25","title":"Hardware Support for Relaxed Concurrency Control in Transactional Memory","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Computer science; Serializability; Concurrency control; Commit; Software transactional memory; Optimistic concurrency control; Distributed computing; Multiversion concurrency control; Two-phase locking; Serialization; Parallel computing; Cache coherence; Operating system; Database transaction; Cache; Transaction processing; Distributed transaction; Distributed concurrency control; Programming language; Cache algorithms; CPU cache; Database","score_opus":0.009234825785726632,"score_gpt":0.24566764604330132,"score_spread":0.2364328202575747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076662080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14433634,0.00090708374,0.84546727,0.0003246564,0.00013464272,0.00015848654,0.000076046366,0.0038873763,0.004708023],"genre_scores_gemma":[0.7577149,0.00027000293,0.23962332,0.0001549218,0.000074972755,0.00017313492,0.00013740397,0.0001395984,0.0017116729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978403,0.00045883967,0.00023739926,0.00025594817,0.0009461629,0.00026135944],"domain_scores_gemma":[0.99176437,0.0022155265,0.0007532553,0.0041365637,0.0009330709,0.00019729267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102936,0.00051790714,0.00060755457,0.00057260855,0.0006602615,0.0017071815,0.0032974598,0.0006115381,0.0022918251],"category_scores_gemma":[0.007649869,0.000654299,0.0005161249,0.00080663717,0.0013230433,0.0027682672,0.0018633034,0.0020327738,0.0005357547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025479158,0.0006810722,0.009000232,0.0008608385,0.00021733732,0.0006933477,0.0010968632,0.14268526,0.30401975,0.1696753,0.0049866433,0.36353537],"study_design_scores_gemma":[0.0005632454,0.0014612875,0.0022423263,0.00011674284,0.00021782829,0.000862937,0.00014339962,0.739377,0.18893607,0.045603458,0.020348929,0.00012679423],"about_ca_topic_score_codex":0.00070254423,"about_ca_topic_score_gemma":0.0010588862,"teacher_disagreement_score":0.0032974598,"about_ca_system_score_codex":0.0005382685,"about_ca_system_score_gemma":0.0011518225,"threshold_uncertainty_score":0.008516133},"labels":[],"label_agreement":null},{"id":"W2078484109","doi":"10.1007/s10766-013-0303-4","title":"A Transaction-Based Environment for System Modeling and Parallel Simulation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Speedup; SystemC; Parallel computing; Concurrency; Distributed computing; Scheduling (production processes); Granularity; Transaction processing; Workload; Database transaction; Computer architecture; Operating system; Programming language","score_opus":0.01917536753296576,"score_gpt":0.2687987249979213,"score_spread":0.24962335746495554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078484109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040326943,0.00009060573,0.9664765,0.00010814528,0.00007896279,0.0001343848,0.0006695515,0.025168914,0.0032403653],"genre_scores_gemma":[0.20169105,0.0005902063,0.7702975,0.00030460607,0.00010331712,0.0014536371,0.0048038927,0.011016379,0.009739404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856406,0.00046055176,0.00016538535,0.00019900143,0.0004870867,0.00012400855],"domain_scores_gemma":[0.9971365,0.0012145267,0.00011440698,0.000871224,0.00042412878,0.0002393014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023080946,0.0013195109,0.001398268,0.00074278074,0.0010639374,0.0031811332,0.005125922,0.0017811507,0.02051787],"category_scores_gemma":[0.0057687624,0.0012983134,0.001494801,0.0011491813,0.00091733,0.0028119523,0.0026681228,0.0033522933,0.005373012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001170798,0.000645714,0.0027186042,0.00061932346,0.0003455464,0.00078391057,0.000622753,0.6905849,0.014050327,0.1052193,0.039375477,0.14386335],"study_design_scores_gemma":[0.00013825895,0.00006430748,0.00014183373,0.000028050275,0.000047539073,0.00009863928,0.000026069345,0.9475271,0.0048837927,0.023942843,0.023064861,0.000036818194],"about_ca_topic_score_codex":0.0034666706,"about_ca_topic_score_gemma":0.0029571252,"teacher_disagreement_score":0.02051787,"about_ca_system_score_codex":0.00067643437,"about_ca_system_score_gemma":0.0018948618,"threshold_uncertainty_score":0.06863904},"labels":[],"label_agreement":null},{"id":"W2079344815","doi":"10.1142/s0129054106004042","title":"AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Distributed algorithm; Asynchronous communication; Computer science; Enhanced Data Rates for GSM Evolution; Time complexity; Algorithm; Binary logarithm; Message passing; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Distributed computing; Computer network; Artificial intelligence","score_opus":0.011182936591719284,"score_gpt":0.29382614801252016,"score_spread":0.2826432114208009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079344815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00547622,0.00016450077,0.98904335,0.00013530445,0.00005113395,0.00008976274,0.00010309079,0.0022247573,0.0027119794],"genre_scores_gemma":[0.13236272,0.00015669299,0.8619773,0.00011874338,0.00003633885,0.00030484324,0.00055301405,0.0002384439,0.004251835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994356,0.000085262334,0.000032454715,0.00013402804,0.00021117328,0.000101501835],"domain_scores_gemma":[0.9993374,0.00021684906,0.000049498478,0.0001589385,0.00017684938,0.000060493323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045478932,0.00077902083,0.0008898201,0.000908144,0.0010085155,0.00097615033,0.0022009108,0.0012779855,0.009748884],"category_scores_gemma":[0.0021294327,0.00033533416,0.00053017866,0.001309988,0.00059581833,0.0019052242,0.0025681392,0.00090888195,0.0023637703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048899517,0.00022214686,0.00088610634,0.00032142966,0.00006692436,0.00034306876,0.0002306145,0.12275284,0.01906868,0.079804614,0.029728122,0.7460864],"study_design_scores_gemma":[0.00027063605,0.000147593,0.00043284346,0.000033130334,0.000040039722,0.00047621276,0.00008231617,0.85679245,0.008185966,0.10725275,0.02623785,0.0000482892],"about_ca_topic_score_codex":0.0017891045,"about_ca_topic_score_gemma":0.002951583,"teacher_disagreement_score":0.009748884,"about_ca_system_score_codex":0.0007098432,"about_ca_system_score_gemma":0.0010382992,"threshold_uncertainty_score":0.032613218},"labels":[],"label_agreement":null},{"id":"W2079362709","doi":"10.1109/iros.2005.1545415","title":"Fuzzy discrete event system based behavior modulation in mobile robotics","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre For Cold Ocean Resources Engineering; Memorial University of Newfoundland","funders":"","keywords":"Controllability; Observability; Fuzzy logic; Mobile robot; Event (particle physics); Computer science; Artificial intelligence; Robot; Fuzzy control system; Neuro-fuzzy; Control theory (sociology); Mathematics","score_opus":0.010731673944648976,"score_gpt":0.2543302649648191,"score_spread":0.24359859102017012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079362709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010695192,0.00024161363,0.98744816,0.00005728617,0.00003651151,0.000023637263,0.0000075150274,0.0002731144,0.0012169465],"genre_scores_gemma":[0.757419,0.00028734028,0.2401276,0.00006729495,0.000044332508,0.000068787864,0.00002948142,0.000020599296,0.0019355151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976414,0.00005739497,0.000016964497,0.000057066292,0.00008661763,0.000017794246],"domain_scores_gemma":[0.99975866,0.00012951625,0.00003065553,0.000028262535,0.000041948242,0.000010984132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036438715,0.000307158,0.00034295357,0.00022766249,0.0001916468,0.00040862666,0.0005376306,0.00037635793,0.00072966877],"category_scores_gemma":[0.0008855526,0.00012643321,0.00023585207,0.0001767251,0.00046824684,0.0004742744,0.00028055956,0.000483939,0.00013798843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029338885,0.000107116,0.0010579908,0.00022828061,0.000061027735,0.000349962,0.00026364898,0.44603997,0.06586637,0.058235075,0.001178861,0.4263183],"study_design_scores_gemma":[0.000018605964,0.00007861573,0.0001894584,0.000008224111,0.000009515222,0.00006153114,0.000011023185,0.981939,0.008998399,0.006361865,0.002314747,0.000009013541],"about_ca_topic_score_codex":0.0009072886,"about_ca_topic_score_gemma":0.0006719195,"teacher_disagreement_score":0.0009072886,"about_ca_system_score_codex":0.00032774176,"about_ca_system_score_gemma":0.00020207472,"threshold_uncertainty_score":0.0024410486},"labels":[],"label_agreement":null},{"id":"W2079968340","doi":"10.1145/2332432.2332508","title":"Strongly linearizable implementations","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Correctness; Computer science; Implementation; Set (abstract data type); Theoretical computer science; Generator (circuit theory); Algorithm; Programming language","score_opus":0.021768015235182004,"score_gpt":0.2847432221315715,"score_spread":0.2629752068963895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079968340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033017118,0.00008483502,0.95402616,0.00061155594,0.000048707177,0.00020354318,0.00021773031,0.001833467,0.009957024],"genre_scores_gemma":[0.7221847,0.00025691403,0.26104823,0.0011441548,0.00017991234,0.0014584822,0.00055805594,0.00042234248,0.012747132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898205,0.0021728738,0.0010215318,0.0027002217,0.0027841658,0.0015007707],"domain_scores_gemma":[0.9595949,0.019633662,0.003225711,0.012105291,0.0046985745,0.00074182893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00446396,0.0011778898,0.0007861115,0.0007278589,0.0008900597,0.0030156835,0.002773999,0.0020673699,0.007977596],"category_scores_gemma":[0.025668394,0.0011612694,0.001785789,0.0007293824,0.0038033829,0.0067943265,0.006609313,0.00568838,0.0018683029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002226331,0.00030163914,0.0023276045,0.00032569523,0.00009516031,0.0003318062,0.0008239139,0.035098583,0.015467603,0.8891125,0.0029052356,0.052987516],"study_design_scores_gemma":[0.00011506098,0.00025461262,0.00030144496,0.00005610845,0.00006941596,0.00024954823,0.00012559962,0.13562198,0.023360675,0.8336999,0.006102637,0.000042998225],"about_ca_topic_score_codex":0.00047680805,"about_ca_topic_score_gemma":0.00048529898,"teacher_disagreement_score":0.007977596,"about_ca_system_score_codex":0.001265751,"about_ca_system_score_gemma":0.0022886873,"threshold_uncertainty_score":0.026687741},"labels":[],"label_agreement":null},{"id":"W2081506791","doi":"10.1109/icsamos.2010.5642062","title":"LV&lt;sup&gt;&amp;#x2217;&lt;/sup&gt;: A low complexity lazy versioning HTM infrastructure","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Transactional memory; Software transactional memory; Software versioning; Operating system; Cache; Cache coherence; MESI protocol; Implementation; Transactional leadership; Lock (firearm); CPU cache; Software; Programming language; Database transaction; Cache coloring; Cache algorithms","score_opus":0.013660334612667215,"score_gpt":0.23716357845742622,"score_spread":0.223503243844759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081506791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04573309,0.0007202744,0.7507956,0.0010228474,0.00028721403,0.00043523646,0.0013247691,0.09487852,0.1048024],"genre_scores_gemma":[0.60272884,0.0005776101,0.22453487,0.0004553683,0.000282837,0.00062813173,0.004519847,0.006132067,0.16014044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993926,0.00010928299,0.00004514226,0.000103219674,0.00026354854,0.000086163695],"domain_scores_gemma":[0.9989874,0.0001228098,0.00007386019,0.00055633887,0.00016505091,0.00009452206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008562893,0.000341393,0.00033705452,0.0006336856,0.0004802414,0.0021257247,0.0022381213,0.00067908526,0.037417583],"category_scores_gemma":[0.0015295955,0.00032510806,0.00017028676,0.0005097589,0.00076263904,0.0027211767,0.0019133814,0.0010783698,0.0193686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007248552,0.00028085551,0.0029582537,0.00037126493,0.00003376773,0.0004742437,0.0006033516,0.009349511,0.099282295,0.12560253,0.1133939,0.6469252],"study_design_scores_gemma":[0.00036558573,0.0010083558,0.0041852365,0.00015286736,0.000072298324,0.0010944183,0.0003019739,0.26832396,0.16552022,0.039102543,0.5197293,0.00014322292],"about_ca_topic_score_codex":0.0016211198,"about_ca_topic_score_gemma":0.0011362577,"teacher_disagreement_score":0.037417583,"about_ca_system_score_codex":0.0009057951,"about_ca_system_score_gemma":0.00070520764,"threshold_uncertainty_score":0.12517428},"labels":[],"label_agreement":null},{"id":"W2082078474","doi":"10.2200/s00551ed1v01y201311dct012","title":"Impossibility Results for Distributed Computing","year":2014,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Impossibility; Computer science; Distributed computing; Political science","score_opus":0.012187151172236454,"score_gpt":0.25460207715230293,"score_spread":0.24241492598006648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082078474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045301087,0.0121941995,0.70210904,0.031097773,0.004051675,0.00015252709,0.0006739095,0.0011845897,0.20323522],"genre_scores_gemma":[0.8214251,0.009471957,0.101071596,0.004965976,0.008472686,0.0009728014,0.0012418901,0.00078162167,0.05159643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99432445,0.0015784334,0.00031553785,0.0012018566,0.0019918126,0.00058793195],"domain_scores_gemma":[0.9656595,0.027927049,0.0005335583,0.0033041548,0.00159595,0.0009797135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060422476,0.0021849463,0.0025374987,0.0031225232,0.00390612,0.0059043146,0.0033295408,0.0034774821,0.011269505],"category_scores_gemma":[0.027312115,0.0015776904,0.0029754583,0.0030058387,0.009021997,0.015457681,0.0073107886,0.019863972,0.001732651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006579715,0.00002764688,0.00012091863,0.00014535873,0.000032398457,0.00005854106,0.00015147949,0.003828066,0.0003485289,0.9830918,0.005712811,0.00641656],"study_design_scores_gemma":[0.000017782788,0.0000069487537,0.000049609545,0.00002172021,0.000012212458,0.000024816522,0.00001791081,0.0060895393,0.00015704744,0.99023205,0.0033616612,0.0000088310335],"about_ca_topic_score_codex":0.0010599046,"about_ca_topic_score_gemma":0.0005848408,"teacher_disagreement_score":0.011269505,"about_ca_system_score_codex":0.004020414,"about_ca_system_score_gemma":0.0013658408,"threshold_uncertainty_score":0.037700295},"labels":[],"label_agreement":null},{"id":"W2083112208","doi":"10.1016/j.scico.2010.11.002","title":"Queue based mutual exclusion with linearly bounded overtaking","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Overtaking; Thread (computing); Computer science; Critical section; Queue; Traverse; Bounded function; Parallel computing; Distributed computing; Computer network; Mathematics; Programming language","score_opus":0.007506269166022648,"score_gpt":0.2411300093688366,"score_spread":0.23362374020281396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083112208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900066,0.00033412996,0.91971153,0.0004639338,0.00023712372,0.0001319845,0.00011735611,0.003046604,0.006956648],"genre_scores_gemma":[0.83588594,0.00010434124,0.1529315,0.00026421744,0.000089964495,0.00020599128,0.00012570554,0.00031366275,0.010078674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957658,0.0014691283,0.00023126336,0.0005216021,0.0011324387,0.00087981706],"domain_scores_gemma":[0.98882675,0.0054730736,0.0006240297,0.0023750607,0.0017971019,0.00090393174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031678695,0.00079212955,0.0018765364,0.00087000674,0.002518387,0.0031343678,0.0038907956,0.0014569965,0.0056607267],"category_scores_gemma":[0.009985343,0.0006434905,0.0006410573,0.001337359,0.0019295213,0.0030939498,0.0048776367,0.0027673023,0.0011309233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005732141,0.0010208223,0.0020467837,0.00028303845,0.00015181297,0.00031267817,0.00078120775,0.47287807,0.027688144,0.33463645,0.009747242,0.14472166],"study_design_scores_gemma":[0.000124785,0.0001614145,0.00009050052,0.000008473039,0.000026220443,0.000026347705,0.000030632007,0.9550625,0.005122778,0.038050424,0.0012618267,0.000034157747],"about_ca_topic_score_codex":0.0065120733,"about_ca_topic_score_gemma":0.00815353,"teacher_disagreement_score":0.0065120733,"about_ca_system_score_codex":0.0021768152,"about_ca_system_score_gemma":0.0038256012,"threshold_uncertainty_score":0.018936992},"labels":[],"label_agreement":null},{"id":"W2083836487","doi":"10.1016/j.jnca.2010.03.028","title":"Adaptive security protocol selection for mobile computing","year":2010,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cryptographic protocol; Security service; Quality of service; Cryptography; Middleware (distributed applications); Computer network; Distributed computing; Protocol (science); Mobile computing; Computer security model; Computer security; Information security","score_opus":0.008415199226316155,"score_gpt":0.273427952232882,"score_spread":0.26501275300656585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083836487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15892774,0.0010555981,0.8321092,0.0006922168,0.00032478993,0.00025143818,0.00008546427,0.0014607465,0.0050926968],"genre_scores_gemma":[0.91775155,0.00019376726,0.07892405,0.0001137078,0.0001160164,0.00012549976,0.000084930514,0.00006500518,0.0026254603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986895,0.0004429673,0.00008051048,0.00018990926,0.00037254873,0.0002246931],"domain_scores_gemma":[0.99610835,0.0020684493,0.00030616406,0.0006627545,0.0006707693,0.00018350224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018140164,0.0005735896,0.00081105443,0.0011711478,0.0011444461,0.0010383179,0.0012807815,0.00074353174,0.0022311076],"category_scores_gemma":[0.005075879,0.00032688142,0.00035525367,0.0006741019,0.0007909905,0.0013930956,0.0013320069,0.0013028906,0.0005370849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041950364,0.0005516246,0.0077136084,0.00025992174,0.0002410805,0.00084854517,0.0005829636,0.2623485,0.099545054,0.078878276,0.010947374,0.533888],"study_design_scores_gemma":[0.0001708183,0.0003221791,0.00082389516,0.000017006529,0.000063288004,0.0003367598,0.00010002225,0.95795,0.011934226,0.025620567,0.0026274573,0.000033764158],"about_ca_topic_score_codex":0.00072549505,"about_ca_topic_score_gemma":0.0012399843,"teacher_disagreement_score":0.0022311076,"about_ca_system_score_codex":0.00067614304,"about_ca_system_score_gemma":0.00083252834,"threshold_uncertainty_score":0.009593606},"labels":[],"label_agreement":null},{"id":"W2083861901","doi":"10.1109/pdcat.2006.11","title":"A Locality-Driven Atomic Group Checkpoint Protocol","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Locality; Atomicity; Distributed computing; Protocol (science); Overhead (engineering); Dependency (UML); Two-phase commit protocol; Consistency (knowledge bases); Communication in small groups; Logging; Parallel computing; Programming language; Transaction processing; Distributed transaction","score_opus":0.009442558911032092,"score_gpt":0.2470189446807213,"score_spread":0.2375763857696892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083861901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022568347,0.00046906475,0.96455216,0.00087235257,0.00020666097,0.00038713732,0.00021346199,0.003229415,0.0075013866],"genre_scores_gemma":[0.6921982,0.0007276036,0.29801422,0.00041167712,0.00015073616,0.00061038224,0.00060908985,0.00022285286,0.0070551676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00015319964,0.000047066314,0.0001064933,0.00026982365,0.00007448504],"domain_scores_gemma":[0.9990563,0.00018093226,0.0001002643,0.00036826215,0.00020802466,0.000086232256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316327,0.00032833562,0.0004192071,0.00070239964,0.0010049705,0.0007143466,0.001602455,0.00074749533,0.0015988362],"category_scores_gemma":[0.0018499063,0.00018617853,0.0002906642,0.00094281905,0.001018401,0.0014682106,0.0019435431,0.0010106912,0.0003578267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005143264,0.00028326744,0.0020841903,0.0005261774,0.00011078719,0.0007672596,0.0007425508,0.19139569,0.053762935,0.43930855,0.026485236,0.284019],"study_design_scores_gemma":[0.000192585,0.00029651084,0.00073203165,0.000040215615,0.00010158857,0.0005192075,0.00017873409,0.79187787,0.022828644,0.11170827,0.071434975,0.00008931581],"about_ca_topic_score_codex":0.0016671425,"about_ca_topic_score_gemma":0.0014777902,"teacher_disagreement_score":0.0016671425,"about_ca_system_score_codex":0.00081480714,"about_ca_system_score_gemma":0.0014494846,"threshold_uncertainty_score":0.0059118867},"labels":[],"label_agreement":null},{"id":"W2084175966","doi":"10.1504/ijhpcn.2011.038709","title":"A self-stabilising algorithm for 3-edge-connectivity","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Computation; Spanning tree; Distributed algorithm; Algorithm; Fault tolerance; Self-stabilization; Distributed minimum spanning tree; Minimum spanning tree; Tree (set theory); Distributed computing; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Computer network","score_opus":0.019761998359530346,"score_gpt":0.25083017889184356,"score_spread":0.2310681805323132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084175966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0191854,0.000107205284,0.97709435,0.0001364715,0.000029453411,0.000079223086,0.000034318044,0.0011087888,0.0022247913],"genre_scores_gemma":[0.40208113,0.00012559627,0.59384155,0.00013868512,0.000030347119,0.00021684085,0.00018617239,0.00014566297,0.0032340377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.000090133304,0.000036079375,0.00012019361,0.00015678564,0.000060494633],"domain_scores_gemma":[0.9989446,0.00038992567,0.0001280271,0.00024640877,0.00022661543,0.000064511456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981333,0.0004748158,0.0004398557,0.00084141316,0.00073005,0.0006347683,0.0013168555,0.0010107784,0.0027722719],"category_scores_gemma":[0.0030524402,0.0002498752,0.00046684872,0.0006841583,0.00088075065,0.001448356,0.0017422496,0.00094822637,0.00077950605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052531884,0.00018903166,0.0014794734,0.00024367073,0.00006532726,0.00033778633,0.0006686726,0.266962,0.066778705,0.1418853,0.0073143695,0.5135504],"study_design_scores_gemma":[0.000095930394,0.00020658181,0.00029231867,0.000026466842,0.000019548506,0.00028009652,0.00006450284,0.90241015,0.015550451,0.07397819,0.0070367716,0.000039020448],"about_ca_topic_score_codex":0.0011047312,"about_ca_topic_score_gemma":0.0012593769,"teacher_disagreement_score":0.0027722719,"about_ca_system_score_codex":0.00052414,"about_ca_system_score_gemma":0.00075393997,"threshold_uncertainty_score":0.009274185},"labels":[],"label_agreement":null},{"id":"W2085957933","doi":"10.1109/71.983940","title":"Performance of CORBA-based client-server architectures","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"University of Saskatchewan","keywords":"Common Object Request Broker Architecture; Computer science; Orb (optics); Object request broker; Server; Middleware (distributed applications); Operating system; Client–server model; Distributed computing; Workstation; Client; Distributed object","score_opus":0.019602157033652774,"score_gpt":0.21620264224521027,"score_spread":0.19660048521155749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085957933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85495496,0.0017653493,0.081003726,0.0007461402,0.0002779999,0.00035582695,0.0007963383,0.021249203,0.038850438],"genre_scores_gemma":[0.98186433,0.0003281159,0.012532589,0.000056161323,0.000020079437,0.00011952208,0.0009869026,0.00042670697,0.003665606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99073225,0.0020801937,0.00046945646,0.00061296934,0.0050840257,0.0010211508],"domain_scores_gemma":[0.9931391,0.0019168729,0.0003163741,0.0010627279,0.0032060826,0.00035890934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003997676,0.0013053854,0.0009100756,0.0014505639,0.0013210551,0.0028766994,0.0026364506,0.0012559516,0.0039409776],"category_scores_gemma":[0.010491873,0.00056623475,0.00042960656,0.0021874,0.00064521405,0.002012263,0.0011529168,0.0010902637,0.0023626217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057947454,0.0021093031,0.018958578,0.0010208264,0.00047403527,0.0006540564,0.0015503565,0.55220634,0.15826347,0.019990757,0.015964216,0.22301333],"study_design_scores_gemma":[0.00016343633,0.0007796896,0.012007247,0.00004200768,0.000093335984,0.00018719904,0.0003205762,0.9033305,0.07058363,0.0034915612,0.008885965,0.00011475037],"about_ca_topic_score_codex":0.011489948,"about_ca_topic_score_gemma":0.0034823436,"teacher_disagreement_score":0.011489948,"about_ca_system_score_codex":0.0025561992,"about_ca_system_score_gemma":0.0022094704,"threshold_uncertainty_score":0.022846162},"labels":[],"label_agreement":null},{"id":"W2086169821","doi":"10.1145/1165678.1165680","title":"Publisher FrameWork (PFW)","year":2006,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Raytheon Technologies (Canada)","funders":"","keywords":"Computer science; Air traffic control; Fault tolerance; Component (thermodynamics); Object-oriented programming; Software; Aviation; Software engineering; Distributed computing; Engineering; Operating system","score_opus":0.00727781898003395,"score_gpt":0.20712566631015894,"score_spread":0.19984784733012498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086169821","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018700778,0.00039074468,0.9143149,0.000503171,0.0001798293,0.00035460506,0.0010840358,0.051748257,0.029554375],"genre_scores_gemma":[0.06231455,0.0010189747,0.8653484,0.0007495903,0.00017356029,0.0012060859,0.008013928,0.020006387,0.041168533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976549,0.00043925285,0.00021997323,0.00038526105,0.0009811742,0.00031930278],"domain_scores_gemma":[0.9975286,0.0005355929,0.00015323066,0.0011037275,0.00049971836,0.00017915589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041485303,0.0012980538,0.0007579005,0.0014373084,0.0012658192,0.004517566,0.0038741652,0.0023597986,0.022558607],"category_scores_gemma":[0.0079549095,0.0013418556,0.0017538654,0.0011085897,0.0012928629,0.0069853184,0.0038411731,0.0029819286,0.013374043],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020679238,0.00014845883,0.001492531,0.000612634,0.000081119106,0.00039682348,0.00075745885,0.010209661,0.0055088312,0.49370727,0.102015324,0.38486317],"study_design_scores_gemma":[0.0001008215,0.000090464535,0.00039720783,0.00015625951,0.00003994706,0.0005166717,0.00012373588,0.032516796,0.0056103067,0.09073775,0.8696349,0.00007500181],"about_ca_topic_score_codex":0.0084675895,"about_ca_topic_score_gemma":0.007575961,"teacher_disagreement_score":0.022558607,"about_ca_system_score_codex":0.0014035967,"about_ca_system_score_gemma":0.003381017,"threshold_uncertainty_score":0.07546604},"labels":[],"label_agreement":null},{"id":"W2086669962","doi":"10.1016/j.jpdc.2007.07.002","title":"Implementing sequentially consistent programs on processor consistent platforms","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; American University of Sharjah","keywords":"Computer science; Sequential consistency; Compiler; Consistency (knowledge bases); Consistency model; Scalability; Programming language; Semantics (computer science); Memory model; Set (abstract data type); Transformation (genetics); Program transformation; Strong consistency; Implementation; Shared memory; Parallel computing; Operating system; Artificial intelligence","score_opus":0.023508172232703742,"score_gpt":0.275532434328486,"score_spread":0.25202426209578227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086669962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15645893,0.00011100489,0.833021,0.0002912549,0.00012470088,0.00017760386,0.00005607131,0.0061516226,0.0036078144],"genre_scores_gemma":[0.5152224,0.000114080096,0.4791298,0.00015423397,0.000053914355,0.00027159203,0.00019267549,0.0009339961,0.003927402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600816,0.0013284439,0.0003346165,0.00037265747,0.0013786914,0.00057745154],"domain_scores_gemma":[0.9889214,0.0043706694,0.00067343673,0.004233353,0.0014768654,0.00032430922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045979056,0.0009283336,0.0011470984,0.0005912148,0.0012484994,0.0022917117,0.0031166035,0.0015638086,0.0034744875],"category_scores_gemma":[0.014209314,0.0013457431,0.00083729136,0.0011351559,0.0020549595,0.0036282819,0.00391556,0.0024606462,0.0006478559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035246175,0.00116052,0.012075735,0.00045196296,0.00028406113,0.0010898927,0.0020860473,0.3251381,0.0886273,0.24784988,0.009602569,0.30810937],"study_design_scores_gemma":[0.0005041006,0.00052760687,0.00056992355,0.000038044014,0.00014637866,0.00012523464,0.00031777067,0.8024908,0.06732915,0.12143921,0.006459435,0.000052403946],"about_ca_topic_score_codex":0.0017785727,"about_ca_topic_score_gemma":0.0033157584,"teacher_disagreement_score":0.0045979056,"about_ca_system_score_codex":0.0007787402,"about_ca_system_score_gemma":0.0020776629,"threshold_uncertainty_score":0.02431631},"labels":[],"label_agreement":null},{"id":"W2089396908","doi":"10.1109/srds.2011.30","title":"An Architecture for Reliable Encapsulation Endpoints Using Commodity Hardware","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encapsulation (networking); Computer science; Software; Operating system; Hardware architecture; Cloud computing; Embedded system; Architecture; Software as a service; Software engineering; Distributed computing; Software development; Computer network","score_opus":0.05848664720828665,"score_gpt":0.27674733815544983,"score_spread":0.2182606909471632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089396908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020866457,0.00043147505,0.9517762,0.00057844224,0.0002728834,0.00021723339,0.000087702116,0.009572032,0.016197607],"genre_scores_gemma":[0.31830364,0.0010689569,0.6483948,0.00038495223,0.00020419258,0.0003973282,0.00045575408,0.0010765721,0.029713787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988444,0.0001312275,0.000119550095,0.00018587192,0.0005888055,0.00013014195],"domain_scores_gemma":[0.9986797,0.00011267737,0.000099690005,0.00057415524,0.00041915537,0.00011461257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014218965,0.00063057785,0.0005462804,0.000894259,0.0014501038,0.0027088376,0.0031259062,0.0015124838,0.00500429],"category_scores_gemma":[0.001923288,0.0009014755,0.000838853,0.0007281559,0.0009595471,0.003390639,0.0030209308,0.002337641,0.0038596455],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007317842,0.0003503284,0.003328491,0.00060784345,0.0002118333,0.001520606,0.0016892118,0.08688376,0.13721925,0.45250562,0.033598654,0.2813526],"study_design_scores_gemma":[0.00018551743,0.0008684445,0.0021766135,0.00024227968,0.00035143603,0.0013607423,0.00025349105,0.54264724,0.09097619,0.09327892,0.26733398,0.00032510332],"about_ca_topic_score_codex":0.0013822109,"about_ca_topic_score_gemma":0.0013625174,"teacher_disagreement_score":0.00500429,"about_ca_system_score_codex":0.0010289653,"about_ca_system_score_gemma":0.0014031611,"threshold_uncertainty_score":0.016740978},"labels":[],"label_agreement":null},{"id":"W2090011393","doi":"10.1145/1755913.1755919","title":"Transactional memory support for scalable and transparent parallelization of multiplayer games","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software transactional memory; Computer science; Transactional memory; Scalability; Parallel computing; Lock (firearm); Transactional leadership; Software; Programming paradigm; Programming language; Operating system; Database transaction","score_opus":0.017776144875479162,"score_gpt":0.25680794525924444,"score_spread":0.23903180038376529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090011393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4593619,0.00087435497,0.5254891,0.00039039762,0.000112763315,0.00012672675,0.000048395355,0.0015583622,0.012038014],"genre_scores_gemma":[0.9453173,0.00020964658,0.052688364,0.000035830166,0.00003120067,0.000066412744,0.00004175143,0.00008741912,0.0015220604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00011993148,0.00002338362,0.000042531305,0.00013455446,0.000077862496],"domain_scores_gemma":[0.9987709,0.0006410877,0.00010329093,0.00025146425,0.00016435912,0.00006884308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041898835,0.00039012864,0.00036357602,0.00017441972,0.00044637264,0.00091229554,0.0012291716,0.00044071756,0.0024459637],"category_scores_gemma":[0.0030495378,0.00023641247,0.0002554164,0.00038729832,0.0004885922,0.0014537182,0.0008993025,0.0010333498,0.0002475808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017480833,0.000857473,0.007224726,0.00072326144,0.00019351667,0.0012174383,0.0012870083,0.30752468,0.25035945,0.16402473,0.006072183,0.2587675],"study_design_scores_gemma":[0.00014312468,0.00031547504,0.00088160293,0.000017317187,0.00004552353,0.0002450106,0.00015487945,0.9188022,0.052543208,0.020831652,0.0059999246,0.00002007609],"about_ca_topic_score_codex":0.0007437879,"about_ca_topic_score_gemma":0.0009961392,"teacher_disagreement_score":0.0024459637,"about_ca_system_score_codex":0.00022617588,"about_ca_system_score_gemma":0.00043572215,"threshold_uncertainty_score":0.008182585},"labels":[],"label_agreement":null},{"id":"W2090919369","doi":"10.1142/s0129054103002229","title":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; De Bruijn sequence; Computer science; Sorting; Hypercube; Cardinality (data modeling); Algorithm; Set (abstract data type); Sorting algorithm; Communication complexity; Selection (genetic algorithm); Selection algorithm; Node (physics); Theoretical computer science; Parallel computing; Mathematics; Discrete mathematics; Data mining","score_opus":0.015521792565095482,"score_gpt":0.3087336153858631,"score_spread":0.2932118228207676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090919369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0446519,0.00016822097,0.9518465,0.00011918965,0.000025893007,0.00021052641,0.00009643163,0.0014788312,0.0014024646],"genre_scores_gemma":[0.2759635,0.0002955977,0.71936864,0.00008193881,0.00004200828,0.00043476996,0.0004278454,0.00011665495,0.0032690507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990972,0.0002423153,0.00006576403,0.00015508977,0.0003311767,0.00010837599],"domain_scores_gemma":[0.99742955,0.0014143725,0.0002819929,0.00045887285,0.00031487516,0.00010036133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011625987,0.0005548251,0.000697783,0.0012033266,0.0011447624,0.0011403419,0.001272921,0.00064798776,0.0022866945],"category_scores_gemma":[0.0031623272,0.0003683557,0.00045136057,0.0019419342,0.00075482094,0.0021154296,0.0010213548,0.0005475247,0.0006991069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010706093,0.0003145959,0.0032645997,0.00046401372,0.00010065058,0.00028340903,0.00057486875,0.23449077,0.039993208,0.06695608,0.0069575016,0.6455296],"study_design_scores_gemma":[0.0003344918,0.00036318143,0.0013083476,0.00004479065,0.000039026025,0.00039649688,0.0003479566,0.8602238,0.04450066,0.080921434,0.0114704035,0.000049297636],"about_ca_topic_score_codex":0.0011878172,"about_ca_topic_score_gemma":0.001989861,"teacher_disagreement_score":0.0022866945,"about_ca_system_score_codex":0.0009154977,"about_ca_system_score_gemma":0.00096361345,"threshold_uncertainty_score":0.0076497793},"labels":[],"label_agreement":null},{"id":"W2091212653","doi":"10.1109/sose.2013.10","title":"Reliable Consumption of Web Services in a Mobile-Cloud Ecosystem Using REST","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Cloud computing; Scalability; Mobile device; Distributed computing; The Internet; Software deployment; Computer network; Database; World Wide Web; Operating system","score_opus":0.01601777034509347,"score_gpt":0.24335601642339763,"score_spread":0.22733824607830416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091212653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6664974,0.0007313248,0.31225473,0.000958838,0.0000929878,0.00019816123,0.0001381996,0.00871885,0.010409503],"genre_scores_gemma":[0.97989285,0.00007206365,0.018363928,0.00008144757,0.000012911678,0.000026531272,0.000081709055,0.00014604746,0.0013223846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838614,0.0003581569,0.00015333928,0.00022514214,0.0005272084,0.0003500552],"domain_scores_gemma":[0.996795,0.00040414665,0.00028751185,0.0016817512,0.0006146403,0.00021684472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015691837,0.0005729503,0.00076098205,0.00076584384,0.0014510958,0.0025008935,0.0018497354,0.00082594116,0.0008149414],"category_scores_gemma":[0.0031852985,0.00046860383,0.0006176173,0.0008903404,0.00093455066,0.0034466411,0.0021491426,0.00087003456,0.00048350077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005447575,0.0014172567,0.056778714,0.0005277192,0.00069926307,0.008230791,0.0023739066,0.184997,0.31203008,0.09353276,0.012854315,0.32111058],"study_design_scores_gemma":[0.00015593479,0.00035174008,0.010701278,0.000044940236,0.00025277038,0.0010456708,0.00056786946,0.8591539,0.093635924,0.020580282,0.013405269,0.000104393555],"about_ca_topic_score_codex":0.004992762,"about_ca_topic_score_gemma":0.005228891,"teacher_disagreement_score":0.004992762,"about_ca_system_score_codex":0.0012407936,"about_ca_system_score_gemma":0.0012209214,"threshold_uncertainty_score":0.009927392},"labels":[],"label_agreement":null},{"id":"W2091544818","doi":"10.1007/s00446-006-0019-4","title":"The weakest failure detector to solve nonuniform consensus","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Computer science; Theory of computation; Consensus; Distributed computing; Algorithm; Telecommunications; Artificial intelligence; Multi-agent system","score_opus":0.008785664092193463,"score_gpt":0.24358182893036828,"score_spread":0.2347961648381748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091544818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010998143,0.00025851233,0.98692894,0.00033948914,0.00015135513,0.000033558706,0.000020509373,0.00026874777,0.0010007484],"genre_scores_gemma":[0.68407357,0.00048592227,0.30914432,0.00047194495,0.00028037006,0.00030259602,0.00015593905,0.00015277832,0.0049326667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.00045383754,0.000077348894,0.0002129844,0.0003441847,0.000116373296],"domain_scores_gemma":[0.99486274,0.0030129415,0.00026428705,0.00068225403,0.0009645081,0.00021332766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003421135,0.0006374439,0.0016003774,0.00082464237,0.00086088426,0.0009946086,0.0017550228,0.0011310752,0.0015416567],"category_scores_gemma":[0.014687808,0.00043370758,0.0004896116,0.00083942356,0.0015198643,0.0023840044,0.0024807104,0.0023447983,0.0002854137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007464558,0.00011702362,0.0012421291,0.00032050116,0.00016780772,0.000092805065,0.0002907579,0.532174,0.0067688134,0.20275612,0.008488501,0.24683507],"study_design_scores_gemma":[0.000050469345,0.000056612487,0.00006116408,0.0000070620486,0.000017284929,0.000019541405,0.000011967417,0.9506096,0.0013141851,0.046971586,0.0008719727,0.000008561508],"about_ca_topic_score_codex":0.0012439911,"about_ca_topic_score_gemma":0.0013048465,"teacher_disagreement_score":0.003421135,"about_ca_system_score_codex":0.0008327136,"about_ca_system_score_gemma":0.0018698117,"threshold_uncertainty_score":0.01809287},"labels":[],"label_agreement":null},{"id":"W2091682271","doi":"10.1145/2767133","title":"SMT-Based Synthesis of Distributed Self-Stabilizing Systems","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Mutual exclusion; Self-stabilization; Asynchronous communication; Correctness; Distributed computing; Token ring; Dijkstra's algorithm; Security token; Suzuki-Kasami algorithm; Distributed algorithm; Protocol (science); Matching (statistics); Set (abstract data type); State (computer science); Topology (electrical circuits); Theoretical computer science; Graph; Algorithm; Computer network; Shortest path problem; Mathematics","score_opus":0.031948815322003214,"score_gpt":0.23747035590302407,"score_spread":0.20552154058102085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091682271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01473889,0.00008018268,0.9778211,0.00008160352,0.000046637637,0.000082338265,0.00007914558,0.0009972993,0.00607285],"genre_scores_gemma":[0.47364607,0.00015234818,0.5221102,0.00006448152,0.000025342546,0.00033437888,0.00023716316,0.00022883152,0.0032011457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.00013051229,0.000051342908,0.00009455356,0.00022861316,0.000047931306],"domain_scores_gemma":[0.99925476,0.00032477156,0.000075584096,0.0001403207,0.0001767068,0.000027887041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062950683,0.00046721424,0.00040790354,0.0004799631,0.00044078857,0.00055281474,0.000653929,0.0004608141,0.0026608745],"category_scores_gemma":[0.0016968901,0.0002760447,0.00064447714,0.000303785,0.000723926,0.0004666701,0.0009322944,0.00059216196,0.00050755526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116602314,0.00007023825,0.0005620553,0.00037243808,0.00004670442,0.00036824436,0.00032061618,0.6809636,0.07371645,0.14349008,0.0017135646,0.09825949],"study_design_scores_gemma":[0.000042375115,0.0000648198,0.00007106458,0.000028557492,0.00002003282,0.00005659741,0.00003449958,0.9320256,0.025754223,0.033521134,0.008371582,0.000009426265],"about_ca_topic_score_codex":0.00063746277,"about_ca_topic_score_gemma":0.0010858517,"teacher_disagreement_score":0.0026608745,"about_ca_system_score_codex":0.0006482827,"about_ca_system_score_gemma":0.0007717906,"threshold_uncertainty_score":0.008901477},"labels":[],"label_agreement":null},{"id":"W2092603825","doi":"10.1109/dasc.2004.1390738","title":"Development of a fault tolerant flight control system","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Avionics; Fault tolerance; Resilience (materials science); Modular design; Embedded system; Fault (geology); Control system; Computer science; Scope (computer science); Software fault tolerance; Life-critical system; Integrated modular avionics; Fault model; Reliability engineering; Engineering; Distributed computing; Software; Operating system; Aerospace engineering","score_opus":0.008462794466763656,"score_gpt":0.21389455129915788,"score_spread":0.20543175683239423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092603825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06093951,0.00020834144,0.92177534,0.00032814962,0.00018171033,0.00043320254,0.00009075891,0.0055518686,0.010491174],"genre_scores_gemma":[0.60676086,0.00033957977,0.3805158,0.00020017884,0.00006183169,0.00032564354,0.00024672932,0.00014872567,0.011400613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.000022843034,0.000017880491,0.000056826364,0.0001758703,0.000029116942],"domain_scores_gemma":[0.99974614,0.00003436332,0.000022508864,0.000033724198,0.00013820987,0.000024941335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023192889,0.00032706096,0.0002715634,0.0003840487,0.0004425814,0.0005078127,0.0006139933,0.0005069391,0.0022779189],"category_scores_gemma":[0.00058775465,0.00019353806,0.00021691518,0.00014592143,0.0002313147,0.000482098,0.0003872361,0.0004908693,0.00084473856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002708684,0.00018967527,0.0019996872,0.0003533069,0.000057966976,0.0011001411,0.0006976596,0.08856055,0.41886595,0.017747594,0.00489012,0.4652664],"study_design_scores_gemma":[0.00020601989,0.0013234353,0.0022386964,0.00009918125,0.00009379417,0.0013070934,0.00016618351,0.5732223,0.3429262,0.0039795637,0.07435733,0.000080293685],"about_ca_topic_score_codex":0.0016987709,"about_ca_topic_score_gemma":0.0008004096,"teacher_disagreement_score":0.0022779189,"about_ca_system_score_codex":0.00022731413,"about_ca_system_score_gemma":0.0007011567,"threshold_uncertainty_score":0.007620394},"labels":[],"label_agreement":null},{"id":"W2093197865","doi":"10.1007/s00446-005-0145-4","title":"Relationships between broadcast and shared memory in reliable anonymous distributed systems","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; Atomic broadcast; Shared memory; Identifier; Robustness (evolution); Distributed computing; Distributed shared memory; Computer network; Broadcasting (networking); Parallel computing; Memory management; Operating system; Uniform memory access","score_opus":0.025746112959283897,"score_gpt":0.24509743549439192,"score_spread":0.21935132253510803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093197865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25630552,0.012105981,0.66176677,0.009982339,0.0005374189,0.0001644634,0.00040889744,0.0007699408,0.057958674],"genre_scores_gemma":[0.96115524,0.00216449,0.027500438,0.00031278547,0.00060688006,0.00014778167,0.00015258098,0.00015720958,0.0078025786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589705,0.002116637,0.00020881117,0.00046133803,0.0009607723,0.00035539558],"domain_scores_gemma":[0.91996086,0.066146,0.0049328757,0.0041556596,0.0036320267,0.0011725719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005400278,0.00043091862,0.0010641341,0.001873984,0.0029486502,0.0061425497,0.002115626,0.002498858,0.006443531],"category_scores_gemma":[0.061281517,0.001075285,0.00044706822,0.0028292546,0.004918782,0.015560905,0.0030340985,0.0031306795,0.00066920824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040807796,0.0000685193,0.0013149873,0.00014476472,0.000027398664,0.00013336378,0.001302774,0.01525289,0.0005171849,0.9557678,0.002746441,0.022315718],"study_design_scores_gemma":[0.00008149913,0.00006106739,0.0004607906,0.000041559284,0.000073739,0.00017192034,0.00040211435,0.058225825,0.00077808637,0.93353724,0.0061364695,0.000029610239],"about_ca_topic_score_codex":0.0021037334,"about_ca_topic_score_gemma":0.00165786,"teacher_disagreement_score":0.006443531,"about_ca_system_score_codex":0.0019619975,"about_ca_system_score_gemma":0.0015481676,"threshold_uncertainty_score":0.028559804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01245770845899721,"score_gpt":0.2471855765119259,"score_spread":0.2347278680529287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093347633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16086619,0.0014164613,0.82637316,0.0011690689,0.00019189503,0.0002021717,0.00017139544,0.0009473175,0.008662314],"genre_scores_gemma":[0.9319667,0.0007673177,0.058962148,0.00026662447,0.0002220481,0.00026350789,0.00026305445,0.0001772452,0.0071112365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718213,0.0011147036,0.00015008841,0.00044465763,0.00054777524,0.00056065095],"domain_scores_gemma":[0.9889121,0.008038743,0.0010213505,0.00092949974,0.0005208425,0.00057742797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029998503,0.00079797296,0.0013478389,0.0006660437,0.0017081463,0.0017803082,0.0017134692,0.0014647425,0.0034711442],"category_scores_gemma":[0.012633475,0.00074157194,0.00054614607,0.00088817603,0.002014326,0.0055411602,0.002628473,0.002021701,0.00055955246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017285312,0.00029465076,0.0029275967,0.0007605679,0.00011701746,0.0007097302,0.0016802556,0.45093438,0.012799152,0.4142537,0.009495741,0.10429865],"study_design_scores_gemma":[0.00024513312,0.00021257863,0.00047571032,0.000036803136,0.00005366466,0.00018002471,0.0003895779,0.73903996,0.003457887,0.2505208,0.005352364,0.00003551949],"about_ca_topic_score_codex":0.0016030105,"about_ca_topic_score_gemma":0.0012999765,"teacher_disagreement_score":0.0034711442,"about_ca_system_score_codex":0.0010271324,"about_ca_system_score_gemma":0.0013006688,"threshold_uncertainty_score":0.015864968},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005448011887945285,"score_gpt":0.19689970072595941,"score_spread":0.19145168883801414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094285453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35715804,0.0030735843,0.6061857,0.0037420664,0.0004616644,0.00015022235,0.0004197357,0.0036729602,0.025136143],"genre_scores_gemma":[0.95591706,0.00058267836,0.035736658,0.00019643793,0.00015599446,0.0000782526,0.00013458506,0.00017703853,0.0070213177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871683,0.00034150388,0.00007370397,0.00017542171,0.00037553054,0.00031705265],"domain_scores_gemma":[0.988781,0.006983841,0.0008161111,0.0023655,0.0007696653,0.00028382306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015191582,0.0006926318,0.0016405368,0.0012032052,0.001622169,0.0024343808,0.0012846936,0.0018941811,0.0033967737],"category_scores_gemma":[0.011807004,0.00048704376,0.0002787295,0.001568554,0.0017535832,0.0047923415,0.0028736785,0.0019253687,0.0006482855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044653416,0.00015497628,0.0018899045,0.00083762815,0.00008069442,0.0012583549,0.001412695,0.34536403,0.04993916,0.44055736,0.011840432,0.14219938],"study_design_scores_gemma":[0.0002626241,0.0003060249,0.0003933468,0.000068149435,0.00006165108,0.00049023295,0.00023673596,0.6472647,0.027700907,0.3142623,0.0088920295,0.00006134569],"about_ca_topic_score_codex":0.0019170484,"about_ca_topic_score_gemma":0.0022887983,"teacher_disagreement_score":0.0033967737,"about_ca_system_score_codex":0.0021636412,"about_ca_system_score_gemma":0.0011492419,"threshold_uncertainty_score":0.015698314},"labels":[],"label_agreement":null},{"id":"W2095199468","doi":"10.3166/jesa.42.365-382","title":"Architecture décisionnelle pour satellite autonome. Intégration dans un logiciel de vol spatial","year":2008,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.025609685886696345,"score_gpt":0.24422409261440378,"score_spread":0.21861440672770743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095199468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025883535,0.0008596686,0.9563446,0.0008123456,0.00011972549,0.00014151416,0.00012608706,0.0010551745,0.014657347],"genre_scores_gemma":[0.48229837,0.0024626406,0.48488045,0.0004553212,0.00024344977,0.000286801,0.0007249695,0.00029105242,0.028357053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982797,0.0005187946,0.000083868654,0.000311006,0.00064946926,0.00015716122],"domain_scores_gemma":[0.9992255,0.00039067375,0.00006474288,0.00006812136,0.00017986073,0.00007103132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019624385,0.00085222395,0.00051066105,0.0008029244,0.0010608515,0.0046859817,0.0008222425,0.001171957,0.004038983],"category_scores_gemma":[0.0024044549,0.00039093132,0.0013298374,0.00070612726,0.002305397,0.002473976,0.0010424173,0.002536045,0.0013165835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003831088,0.00024811248,0.0021548464,0.00048570978,0.00013497968,0.00071325304,0.0012775403,0.15543093,0.023852203,0.64544344,0.0040703565,0.16580553],"study_design_scores_gemma":[0.00019371987,0.00044795332,0.0020722654,0.0001984837,0.00010746861,0.00068441,0.0005262764,0.5906591,0.018796101,0.25681943,0.12939142,0.00010340587],"about_ca_topic_score_codex":0.014371504,"about_ca_topic_score_gemma":0.010148019,"teacher_disagreement_score":0.014371504,"about_ca_system_score_codex":0.0027301072,"about_ca_system_score_gemma":0.002376754,"threshold_uncertainty_score":0.028575718},"labels":[],"label_agreement":null},{"id":"W2096480741","doi":"10.1109/icci.1992.227618","title":"Global snapshots for distributed debugging","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Debugging; Snapshot (computer storage); Computer science; Computation; Theoretical computer science; Distributed computing; Distributed algorithm; Programming language; Operating system","score_opus":0.014472711498892588,"score_gpt":0.25901530624744545,"score_spread":0.24454259474855286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096480741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025106585,0.00074732536,0.9912855,0.0003834004,0.00008904657,0.000048925962,0.000051275587,0.0014577038,0.0034261302],"genre_scores_gemma":[0.2107605,0.0015373797,0.7818517,0.00032165268,0.00019870416,0.000243134,0.0003114284,0.0006007698,0.004174805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720925,0.0013175525,0.00020478327,0.0004381527,0.00063328794,0.000196928],"domain_scores_gemma":[0.9941094,0.0022265662,0.00043898562,0.0023137727,0.00064564473,0.00026575744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037563844,0.00077115063,0.0007545095,0.001276223,0.0010975668,0.0030761785,0.001472869,0.001244327,0.004668436],"category_scores_gemma":[0.010738758,0.0005199341,0.0005457792,0.0013521861,0.0023671743,0.0064852396,0.0037512043,0.003086935,0.0009019785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013043551,0.000024020877,0.00075010717,0.00016350404,0.000029522778,0.00013576294,0.0005114918,0.018650252,0.0023479154,0.82767826,0.0056812568,0.14389746],"study_design_scores_gemma":[0.000063453255,0.0001019719,0.00036427993,0.00019838345,0.00006552232,0.00033017353,0.00024991328,0.14263976,0.00931849,0.7568925,0.08972574,0.000049845894],"about_ca_topic_score_codex":0.0011742243,"about_ca_topic_score_gemma":0.0013046477,"teacher_disagreement_score":0.004668436,"about_ca_system_score_codex":0.0009074593,"about_ca_system_score_gemma":0.0012978233,"threshold_uncertainty_score":0.01986593},"labels":[],"label_agreement":null},{"id":"W2096701070","doi":"10.1109/reldis.2005.18","title":"Fault-tolerance for Stateful Application Servers in the Presence of Advanced Transactions Patterns","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Stateful firewall; Server; Replication (statistics); Database transaction; Application server; Overhead (engineering); Transaction processing; Operating system; Distributed transaction; Client–server model; Fault tolerance; Computer network; Distributed computing; Database","score_opus":0.007884739924984155,"score_gpt":0.24031987505411476,"score_spread":0.2324351351291306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096701070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48396322,0.0005421089,0.5042284,0.0005917594,0.00008632374,0.00012834214,0.00007128738,0.0072585507,0.0031300278],"genre_scores_gemma":[0.9469539,0.00012094039,0.05038247,0.00008057136,0.000030368145,0.000053916807,0.00014799398,0.00015237005,0.0020775455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974037,0.00058390666,0.00033197924,0.00029861825,0.001019319,0.00036249438],"domain_scores_gemma":[0.9916476,0.002018273,0.00077627064,0.0038788836,0.0012037796,0.00047514285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023373843,0.00048891624,0.00066817773,0.00060438237,0.0011461601,0.0025331818,0.0024319398,0.0012371795,0.0011069499],"category_scores_gemma":[0.009314487,0.0005089561,0.00036213564,0.0008069301,0.0010394724,0.0037814386,0.001980071,0.0008893069,0.00042724804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003306387,0.00082865276,0.030580143,0.00044392547,0.00021853913,0.004505434,0.0024495083,0.24908046,0.21691541,0.103072114,0.010430925,0.37816852],"study_design_scores_gemma":[0.00013614728,0.00042448455,0.0033472432,0.000025588883,0.00007575079,0.0011142256,0.00027729583,0.8596667,0.06696089,0.060198415,0.007712103,0.00006125915],"about_ca_topic_score_codex":0.0016189327,"about_ca_topic_score_gemma":0.0012514102,"teacher_disagreement_score":0.0025331818,"about_ca_system_score_codex":0.00074155006,"about_ca_system_score_gemma":0.00082825037,"threshold_uncertainty_score":0.012361407},"labels":[],"label_agreement":null},{"id":"W2096798349","doi":"10.1109/sdne.1995.470468","title":"Mobile IP-based multicast as a service for mobile hosts","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multicast; Computer network; Computer science; IP multicast; Xcast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Source-specific multicast; Distributed computing; Multicast address; Inter-domain; Pragmatic General Multicast; Mobile computing; Mobile IP","score_opus":0.020070015184871705,"score_gpt":0.2612552296638821,"score_spread":0.2411852144790104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096798349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030873023,0.004708509,0.8088577,0.0029632961,0.0014081583,0.00038939703,0.0005595464,0.01571181,0.13452858],"genre_scores_gemma":[0.55420244,0.005152619,0.33255273,0.0010927024,0.0019018232,0.00036225276,0.0017468312,0.0009413989,0.102047205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996966,0.00008968256,0.00001728333,0.000024880188,0.00012887923,0.000042770043],"domain_scores_gemma":[0.99964404,0.00004273261,0.00002025449,0.000113094975,0.00012363547,0.000056291832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046737012,0.00027247393,0.00028347224,0.00069242687,0.0006923081,0.0013106657,0.00068174227,0.00094170845,0.0060101612],"category_scores_gemma":[0.0010541957,0.00017455049,0.0002019422,0.00061499455,0.00030968146,0.0011278592,0.0009077071,0.0006360888,0.0038731033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005374778,0.00011859018,0.001248956,0.00027570597,0.00004984809,0.0008302653,0.0005444691,0.0056166854,0.06729278,0.19841123,0.13012148,0.5949525],"study_design_scores_gemma":[0.000105268206,0.00030876877,0.0011869335,0.00009550709,0.000072423165,0.0011431482,0.00015363334,0.13577981,0.025507675,0.053562872,0.78203195,0.00005193987],"about_ca_topic_score_codex":0.0005986659,"about_ca_topic_score_gemma":0.00074323843,"teacher_disagreement_score":0.0060101612,"about_ca_system_score_codex":0.0004991317,"about_ca_system_score_gemma":0.000365316,"threshold_uncertainty_score":0.020106018},"labels":[],"label_agreement":null},{"id":"W2096922323","doi":"10.1145/2767386.2767403","title":"On the Time and Space Complexity of ABA Prevention and Detection","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Computer science; Base (topology); Discrete mathematics; Upper and lower bounds; Algorithm; Parallel computing; Mathematics","score_opus":0.040191430102431765,"score_gpt":0.25288836627722383,"score_spread":0.21269693617479207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096922323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41992995,0.00411498,0.5346201,0.0067416155,0.00034026994,0.0008439301,0.0012224324,0.005715994,0.026470678],"genre_scores_gemma":[0.7519103,0.0011008944,0.23743422,0.0009202072,0.0002480763,0.0007737535,0.0009766639,0.0012181329,0.005417733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98151153,0.006013395,0.0011623434,0.0027788118,0.0038118658,0.0047219982],"domain_scores_gemma":[0.9155783,0.06963825,0.003591054,0.007673997,0.0021580616,0.0013603314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008573999,0.0026456194,0.0024998183,0.0019303636,0.0027485525,0.007267293,0.0052989055,0.0032690864,0.013537899],"category_scores_gemma":[0.039228726,0.0018943002,0.0033653888,0.0030568822,0.005625894,0.020511592,0.0061685825,0.0061702114,0.0017080716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062706163,0.0008527931,0.010703421,0.0018796149,0.0005218803,0.00039745137,0.0015470412,0.5796951,0.029950535,0.13495678,0.009448022,0.22377676],"study_design_scores_gemma":[0.0004082503,0.00045079508,0.0012613067,0.000098621385,0.0002875845,0.00018155223,0.00032873295,0.8864874,0.012482699,0.09593398,0.0019983035,0.00008070165],"about_ca_topic_score_codex":0.007862968,"about_ca_topic_score_gemma":0.010468958,"teacher_disagreement_score":0.013537899,"about_ca_system_score_codex":0.007835374,"about_ca_system_score_gemma":0.010242818,"threshold_uncertainty_score":0.056849897},"labels":[],"label_agreement":null},{"id":"W2097185670","doi":"10.1109/spdp.1990.143522","title":"A new paradigm for high availability and efficiency in replicated distributed databases","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Serializability; Replication (statistics); Correctness; Concurrency control; Distributed computing; Database transaction; Replica; Transaction processing; High availability; Mechanism (biology); Database; Distributed database; Service (business); Distributed transaction; Programming language","score_opus":0.03276845634663218,"score_gpt":0.2563940488341835,"score_spread":0.22362559248755132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097185670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043494334,0.001552748,0.98245287,0.0019350135,0.00035433064,0.000096719894,0.000056479257,0.0007845763,0.008417881],"genre_scores_gemma":[0.13431032,0.0021983176,0.84980667,0.0014542816,0.0011437682,0.0005497183,0.00021872645,0.00037756446,0.009940676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958424,0.0010626015,0.0003296473,0.00054820604,0.0020225493,0.00019463681],"domain_scores_gemma":[0.996163,0.0010512796,0.00023885128,0.0015845487,0.0007416467,0.00022080108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036915217,0.0004083856,0.00071682513,0.0009675389,0.001324302,0.0038307179,0.0023334923,0.0014236742,0.002828082],"category_scores_gemma":[0.007994333,0.00059442467,0.00085780385,0.0013284752,0.002109219,0.006960093,0.0036164909,0.0027814037,0.0013577362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009982128,0.00007109149,0.00033919606,0.00024521898,0.00004703815,0.00026962877,0.0006497158,0.005941574,0.008322185,0.86208385,0.01007322,0.11185744],"study_design_scores_gemma":[0.00023922324,0.0002762965,0.0003619926,0.00013773418,0.00008627689,0.0017040446,0.00017709791,0.06263004,0.008255407,0.5974574,0.32858548,0.00008894527],"about_ca_topic_score_codex":0.0005061366,"about_ca_topic_score_gemma":0.00050256663,"teacher_disagreement_score":0.0038307179,"about_ca_system_score_codex":0.0009744175,"about_ca_system_score_gemma":0.0016674481,"threshold_uncertainty_score":0.019522905},"labels":[],"label_agreement":null},{"id":"W2097621495","doi":"10.1109/mdm.2009.25","title":"SLA-Aware Adaptive On-demand Data Broadcasting in Wireless Environments","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workload; Scheduling (production processes); Computer network; Broadcasting (networking); Wireless; Quality of service; Exploit; Dynamic priority scheduling; Distributed computing; Real-time computing; Telecommunications; Operating system","score_opus":0.04304281163071568,"score_gpt":0.26733372475175327,"score_spread":0.22429091312103758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097621495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20179828,0.00075171335,0.78821623,0.00051700015,0.00014229475,0.00011034607,0.00006495453,0.001300589,0.007098625],"genre_scores_gemma":[0.9757193,0.00017529927,0.022843184,0.00005428685,0.00004753307,0.000027189477,0.00004272197,0.00004492022,0.0010455467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.00027185737,0.000031388037,0.00007621314,0.00025317236,0.00016920995],"domain_scores_gemma":[0.9981267,0.00075076905,0.00025880468,0.0002612919,0.0004208494,0.00018163033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009875473,0.0003264778,0.00057004916,0.00040011035,0.0005792152,0.0007278045,0.0010024385,0.00045231736,0.0004908658],"category_scores_gemma":[0.0031692043,0.00024341866,0.00017045066,0.00047354074,0.00049565005,0.0008172141,0.00075115566,0.00058509334,0.00018243912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006491622,0.0003159505,0.0029259978,0.00028206874,0.00006214609,0.0003156283,0.00063847075,0.68807644,0.06837333,0.020916311,0.005698177,0.21174632],"study_design_scores_gemma":[0.000021379852,0.00007212254,0.0005796637,0.000005400474,0.00001061996,0.00006604074,0.000094301475,0.9887426,0.0044478984,0.0042090956,0.0017406937,0.00001009956],"about_ca_topic_score_codex":0.003725142,"about_ca_topic_score_gemma":0.003470689,"teacher_disagreement_score":0.003725142,"about_ca_system_score_codex":0.00061729946,"about_ca_system_score_gemma":0.0008438006,"threshold_uncertainty_score":0.0074068904},"labels":[],"label_agreement":null},{"id":"W2097974388","doi":"10.1109/icpads.2000.857709","title":"Circumventing/identifying faults effects","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Identification (biology); Byzantine fault tolerance; Computer science; Byzantine architecture; Quantum Byzantine agreement; Process (computing); Overhead (engineering); Variety (cybernetics); Distributed computing; Fault tolerance; Artificial intelligence","score_opus":0.023236061872774872,"score_gpt":0.23013972233545693,"score_spread":0.20690366046268205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097974388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055878565,0.00066255627,0.93227905,0.00047651288,0.00015607047,0.0002403676,0.00007952939,0.0041627027,0.0060646064],"genre_scores_gemma":[0.6056584,0.0010435567,0.38351876,0.00031599836,0.00019224721,0.00018707967,0.00019027601,0.00088152563,0.008012089],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765104,0.00066118996,0.00016605147,0.0005322852,0.00068974594,0.00029973302],"domain_scores_gemma":[0.992916,0.0020286848,0.00083198556,0.003518482,0.0006019798,0.00010282193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015267542,0.0015486623,0.002203613,0.0010458755,0.0013177602,0.0011641618,0.0016882288,0.0015857546,0.0055547985],"category_scores_gemma":[0.00745886,0.0006252624,0.0009296298,0.0008402502,0.0022662242,0.0040035113,0.0028596201,0.0019650494,0.0018985025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080339605,0.00028973827,0.0037175044,0.0016536001,0.00016028793,0.0013180242,0.000952485,0.064788595,0.26611674,0.10998846,0.00628555,0.5439255],"study_design_scores_gemma":[0.0001799778,0.0009423078,0.0020198333,0.00016962405,0.0003477522,0.0029763733,0.00033371872,0.28247,0.5459809,0.11673715,0.04772669,0.0001157878],"about_ca_topic_score_codex":0.0005613297,"about_ca_topic_score_gemma":0.0006247504,"teacher_disagreement_score":0.0055547985,"about_ca_system_score_codex":0.0006060376,"about_ca_system_score_gemma":0.0012185124,"threshold_uncertainty_score":0.018582642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004902096397346088,"score_gpt":0.18554557464082128,"score_spread":0.18064347824347518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098095723","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011780718,0.0029304803,0.12486907,0.0044661313,0.0037415666,0.00078187545,0.014214568,0.16742036,0.6697952],"genre_scores_gemma":[0.10454515,0.0029443614,0.12089686,0.0036650754,0.0014132846,0.0009475531,0.058507696,0.033415332,0.67366457],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978116,0.00031562452,0.00012977971,0.0004723166,0.0009858033,0.00028479652],"domain_scores_gemma":[0.9967727,0.00045883094,0.00016202222,0.0009963633,0.0010846222,0.0005253346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019852982,0.0014750375,0.00094474957,0.0015380438,0.0012019468,0.0045563406,0.0032078563,0.001792109,0.22887908],"category_scores_gemma":[0.005362922,0.000751793,0.0008381822,0.0013655969,0.00073716365,0.0042823097,0.004370139,0.002248552,0.14848438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012093416,0.0002745814,0.0019764686,0.00053802744,0.000053163876,0.00041796814,0.00031062946,0.0027437971,0.010058479,0.033316135,0.64771104,0.30139038],"study_design_scores_gemma":[0.00014718976,0.00014645689,0.000887865,0.000102068894,0.000023002425,0.00036618082,0.000079120284,0.008552309,0.004479775,0.008482157,0.9766858,0.00004801772],"about_ca_topic_score_codex":0.0021331953,"about_ca_topic_score_gemma":0.0022986191,"teacher_disagreement_score":0.22887908,"about_ca_system_score_codex":0.00094503356,"about_ca_system_score_gemma":0.0018821482,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2098564014","doi":"10.1109/icdcs.1991.148704","title":"Using multiple replica classes to improve performance in distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Replica; Replication (statistics); Computer science; Distributed computing; Consistency (knowledge bases); Protocol (science); Distributed database; Class (philosophy); High availability; Database transaction; Data consistency; Eventual consistency; Computer network; Database; Consistency model; Artificial intelligence; Biology","score_opus":0.0405454334822488,"score_gpt":0.25445136138510926,"score_spread":0.21390592790286045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098564014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05495711,0.0065890537,0.8909916,0.0018675041,0.0013588478,0.0003432067,0.00011452215,0.020508789,0.023269411],"genre_scores_gemma":[0.5822985,0.0025449316,0.39240858,0.0008356996,0.0015666089,0.00048803535,0.0003101739,0.0030743203,0.016473072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672276,0.00085442344,0.0002598444,0.0006060798,0.0012725422,0.00028432487],"domain_scores_gemma":[0.98648435,0.004013102,0.000930081,0.0062826565,0.0017550454,0.0005348407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038232284,0.00093021017,0.0013522789,0.0016434698,0.001430406,0.0042091194,0.0030434204,0.0014523352,0.007800001],"category_scores_gemma":[0.016569206,0.0008401585,0.000653609,0.001534527,0.001120909,0.007226959,0.003021491,0.002112783,0.0036322437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089799665,0.00042835608,0.0033823529,0.0005872509,0.00013989491,0.0003901261,0.0008024508,0.08427759,0.054117423,0.0847103,0.02769355,0.74257267],"study_design_scores_gemma":[0.0006851164,0.0008158669,0.0022934095,0.00020549199,0.000281484,0.0011991048,0.00021519783,0.6112891,0.071178116,0.11443427,0.19715048,0.00025233172],"about_ca_topic_score_codex":0.00076345267,"about_ca_topic_score_gemma":0.00087471557,"teacher_disagreement_score":0.007800001,"about_ca_system_score_codex":0.0012359598,"about_ca_system_score_gemma":0.0010529571,"threshold_uncertainty_score":0.026093662},"labels":[],"label_agreement":null},{"id":"W2099281062","doi":"10.1109/icsi.1992.217247","title":"Large scale interoperability and distributed transaction processing","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Distributed transaction; Interoperability; Transaction processing system; Transaction processing; Computer science; Database transaction; Online transaction processing; Distributed computing; Protocol (science); Architecture; Block (permutation group theory); Database; Software engineering; World Wide Web","score_opus":0.00976942004259336,"score_gpt":0.2344099003350062,"score_spread":0.22464048029241285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099281062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062858188,0.0021553005,0.9519488,0.003218195,0.00030726905,0.00017181433,0.0001375157,0.0014381942,0.034337055],"genre_scores_gemma":[0.44933683,0.0054309885,0.49902242,0.0018636276,0.0011679156,0.0010792834,0.0017395488,0.0008041559,0.039555207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919185,0.0024307657,0.0007211272,0.0010489322,0.003387708,0.0004929027],"domain_scores_gemma":[0.99505603,0.0018119758,0.0004561673,0.0018234707,0.00065616536,0.0001961218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050231107,0.0006632942,0.000661555,0.0012914274,0.0014793961,0.0062826965,0.0019617996,0.0019233623,0.0048270314],"category_scores_gemma":[0.010702973,0.000502416,0.0008642565,0.0023417962,0.0036386738,0.010800399,0.0042212163,0.002366491,0.002035063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004604019,0.00003930496,0.0004179335,0.000107293876,0.000033358672,0.0002580507,0.00046194586,0.008621241,0.0013614324,0.89911896,0.00553982,0.083994545],"study_design_scores_gemma":[0.000042202406,0.00006761506,0.00028597587,0.00010057479,0.00003130981,0.00042394237,0.00022717724,0.054830737,0.0027841693,0.81834537,0.122824125,0.000036764617],"about_ca_topic_score_codex":0.0020079748,"about_ca_topic_score_gemma":0.000980883,"teacher_disagreement_score":0.0062826965,"about_ca_system_score_codex":0.0018225531,"about_ca_system_score_gemma":0.0021472985,"threshold_uncertainty_score":0.026565075},"labels":[],"label_agreement":null},{"id":"W2099290884","doi":"10.1109/pccc.1995.472417","title":"Distributed application entity groups: analysis and simulation results","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mechanism (biology); Computer science; Fault tolerance; Reliability (semiconductor); Variety (cybernetics); Software fault tolerance; Software; Distributed computing; Group (periodic table); Fault (geology); Reliability engineering; Artificial intelligence; Programming language; Engineering","score_opus":0.013787384793182271,"score_gpt":0.24197770378271027,"score_spread":0.228190318989528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099290884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8150869,0.0008932742,0.149965,0.00075194467,0.00007922575,0.00027533167,0.0015648516,0.002154784,0.029228657],"genre_scores_gemma":[0.97599334,0.0002501513,0.021700418,0.000031884712,0.000010007473,0.00013858925,0.0005704722,0.00007310311,0.0012320502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.00049081555,0.00005578042,0.00010070252,0.00039462632,0.00018105496],"domain_scores_gemma":[0.99034005,0.0072547225,0.00036500054,0.0007567947,0.001094773,0.00018861183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019022768,0.0005812448,0.00075999676,0.0011793155,0.0006041206,0.00069672515,0.0010592781,0.0010305134,0.0029377132],"category_scores_gemma":[0.007826687,0.0002714694,0.00053387065,0.0016317064,0.00053950894,0.00084134174,0.00049902796,0.0007881161,0.00032971048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079270496,0.00012649692,0.0024064966,0.000043071996,0.000023529992,0.000055461824,0.00007087482,0.9843797,0.0006515202,0.0058336356,0.0007989223,0.005531045],"study_design_scores_gemma":[0.000009640564,0.00001610494,0.0002006946,0.0000030375013,0.0000058823384,0.000008891872,0.000017523107,0.998028,0.00044206766,0.00093863346,0.00032663054,0.0000028847924],"about_ca_topic_score_codex":0.009216879,"about_ca_topic_score_gemma":0.0044897166,"teacher_disagreement_score":0.009216879,"about_ca_system_score_codex":0.0012221949,"about_ca_system_score_gemma":0.000758883,"threshold_uncertainty_score":0.018326461},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00858421625016597,"score_gpt":0.2195543342874197,"score_spread":0.2109701180372537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099537990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20918787,0.002147755,0.7518956,0.00074158836,0.000577484,0.00045255155,0.0010780102,0.012106156,0.02181299],"genre_scores_gemma":[0.8154605,0.0005387723,0.17579207,0.00046349148,0.00008767346,0.00037456464,0.0008835406,0.00070011395,0.005699241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979386,0.00039170033,0.00021741382,0.00031471395,0.0008236746,0.00031383368],"domain_scores_gemma":[0.99314535,0.0017895658,0.00043789583,0.0032443316,0.0012010521,0.00018177048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302671,0.00067588437,0.0006235838,0.0004038939,0.00070133613,0.0023099026,0.0037638813,0.0010384826,0.00542004],"category_scores_gemma":[0.007170769,0.0005714418,0.00063316646,0.0008090159,0.0012266693,0.004073634,0.0012941789,0.0016944726,0.0012198514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017814607,0.0006232002,0.015375373,0.0015156087,0.0003247452,0.001053078,0.00078283524,0.36426672,0.120965056,0.26143372,0.027340442,0.20453776],"study_design_scores_gemma":[0.00023736733,0.00058204273,0.0015318904,0.00011053249,0.0001616787,0.0005700449,0.00011398279,0.7749637,0.08836682,0.061481643,0.07177192,0.000108403176],"about_ca_topic_score_codex":0.0018572666,"about_ca_topic_score_gemma":0.0013229336,"teacher_disagreement_score":0.00542004,"about_ca_system_score_codex":0.0007410376,"about_ca_system_score_gemma":0.0018137133,"threshold_uncertainty_score":0.018131793},"labels":[],"label_agreement":null},{"id":"W2100475936","doi":"10.1109/pacrim.1989.48354","title":"DPD: a distributed program debugger for the REM environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Debugger; Computer science; Synchronization (alternating current); Abstraction; Process (computing); Graphical user interface; Debugging; Programming language; Controller (irrigation); Real-time computing; Operating system; Distributed computing; Computer network","score_opus":0.016037344599600434,"score_gpt":0.24445536588616526,"score_spread":0.22841802128656483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100475936","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040026014,0.00026387346,0.8456721,0.00030571548,0.000117568794,0.00033403366,0.00072529603,0.14104715,0.0075315717],"genre_scores_gemma":[0.07335028,0.0005987408,0.8777113,0.0006939338,0.00009979118,0.00085665646,0.004636023,0.0126464255,0.029406907],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985436,0.0004784637,0.00013333524,0.00022584133,0.00047473665,0.00014407576],"domain_scores_gemma":[0.99858475,0.0004502534,0.00011207244,0.00048820785,0.0002298299,0.00013498626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442765,0.00088625704,0.00074809464,0.0011223085,0.00041975372,0.0012934702,0.0029028761,0.0011973982,0.015076098],"category_scores_gemma":[0.0057934504,0.0009490493,0.00057560194,0.00052977377,0.00075542403,0.0028567214,0.0028927883,0.0022987253,0.0069683315],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012043018,0.00046204237,0.0024674158,0.0011128262,0.000117830394,0.00093159307,0.0008340973,0.023557536,0.058114223,0.0687925,0.19164456,0.6507611],"study_design_scores_gemma":[0.00090504525,0.0005970138,0.0015548631,0.00025587325,0.000085892876,0.0019085803,0.000090390364,0.23141792,0.07035692,0.021476896,0.67112815,0.00022236018],"about_ca_topic_score_codex":0.0008847522,"about_ca_topic_score_gemma":0.000910665,"teacher_disagreement_score":0.015076098,"about_ca_system_score_codex":0.0005379718,"about_ca_system_score_gemma":0.0011329246,"threshold_uncertainty_score":0.05043459},"labels":[],"label_agreement":null},{"id":"W2100677024","doi":"10.1145/945526.945527","title":"Some myths about famous mutual exclusion algorithms","year":2003,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Algorithm; Computer science; Dijkstra's algorithm; Software; Process (computing); Theoretical computer science; Programming language; Shortest path problem","score_opus":0.01872739838913388,"score_gpt":0.2595506680645361,"score_spread":0.2408232696754022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100677024","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02230985,0.21904847,0.20854919,0.3465156,0.0137924645,0.000120274875,0.00037773492,0.00049551774,0.18879096],"genre_scores_gemma":[0.5127792,0.20086098,0.11222429,0.07411799,0.055386063,0.00061631453,0.00042417774,0.0006594227,0.042931624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960205,0.0017625324,0.00023326135,0.00059433334,0.0011718546,0.00021739487],"domain_scores_gemma":[0.98522437,0.011248256,0.0004587651,0.001137342,0.0016396148,0.00029169547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008415806,0.00077564333,0.00076073076,0.0023268922,0.0032483432,0.003841969,0.0025453374,0.003911887,0.0038784996],"category_scores_gemma":[0.021524861,0.0006339532,0.0008711648,0.0025817035,0.016252657,0.020382063,0.002484619,0.010390168,0.0017536466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036191173,0.00003775167,0.00017645952,0.00016177926,0.000012484776,0.000050499108,0.0007155777,0.001243704,0.00010744853,0.9545797,0.018136838,0.024741486],"study_design_scores_gemma":[0.000013929648,0.000020469986,0.000091290116,0.00012921165,0.0000059543336,0.0001208186,0.00018831031,0.0014304527,0.00015196856,0.9362398,0.061590374,0.000017446735],"about_ca_topic_score_codex":0.0008421354,"about_ca_topic_score_gemma":0.0003717705,"teacher_disagreement_score":0.008415806,"about_ca_system_score_codex":0.0023156262,"about_ca_system_score_gemma":0.0010535482,"threshold_uncertainty_score":0.044507563},"labels":[],"label_agreement":null},{"id":"W2101077206","doi":"10.1109/pdcat.2009.47","title":"A Classification-Based Approach to Fault-Tolerance Support in Parallel Programs","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fault tolerance; Software fault tolerance; Computer science; Distributed computing; Fault (geology); Reliability engineering; Engineering","score_opus":0.031156942579666703,"score_gpt":0.2661476126444009,"score_spread":0.2349906700647342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101077206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009517478,0.0002953223,0.98496616,0.0005744793,0.00006861386,0.00014645554,0.000060457754,0.00072452606,0.003646497],"genre_scores_gemma":[0.14331684,0.0005853109,0.84900326,0.00031743254,0.00013221645,0.0004026358,0.00039276155,0.00018077741,0.005668734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748623,0.00040224267,0.0003324868,0.0004694359,0.0010651627,0.00024435413],"domain_scores_gemma":[0.9952371,0.00093352684,0.0006628326,0.0011998581,0.0017279556,0.00023863724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018848474,0.0007183292,0.0006982979,0.0022601397,0.0015404263,0.002885675,0.0026522044,0.0015812184,0.0020916883],"category_scores_gemma":[0.006086331,0.00041362178,0.001009134,0.002363902,0.0016259266,0.004043378,0.0012193989,0.0025878968,0.0008458336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029812302,0.0004936698,0.009249974,0.0005329972,0.000076913195,0.0005138685,0.0020880222,0.038246237,0.02255836,0.3394708,0.010363861,0.57610714],"study_design_scores_gemma":[0.00007308497,0.00037101275,0.004338754,0.00036034474,0.0001637042,0.0019856866,0.00073349854,0.4951605,0.028153755,0.33106607,0.1374381,0.00015548844],"about_ca_topic_score_codex":0.0037676415,"about_ca_topic_score_gemma":0.003090134,"teacher_disagreement_score":0.0037676415,"about_ca_system_score_codex":0.0017740374,"about_ca_system_score_gemma":0.0021252332,"threshold_uncertainty_score":0.012871623},"labels":[],"label_agreement":null},{"id":"W2101206167","doi":"10.1109/icdsc.2001.918955","title":"Modular composition of redundancy management protocols in distributed systems: an outlook on simplifying protocol level formal specification and verification","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Modular design; Redundancy (engineering); Formal methods; Formal verification; Protocol (science); Distributed computing; Software engineering; Programming language; Operating system","score_opus":0.08380403843891895,"score_gpt":0.3087471568920895,"score_spread":0.22494311845317053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101206167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005710769,0.0005242758,0.99168915,0.0002617246,0.000031655258,0.00007973986,0.000009322307,0.00047182012,0.0012215421],"genre_scores_gemma":[0.07850704,0.0011241725,0.9184444,0.00011761383,0.00006941262,0.00021595845,0.00007110709,0.00018827377,0.0012621206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944252,0.002676234,0.00036927997,0.0005452672,0.0016657304,0.0003183984],"domain_scores_gemma":[0.9915221,0.003948996,0.0006799663,0.0029390252,0.0007276429,0.00018231139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010826539,0.0011405911,0.00097595336,0.0014558211,0.00077367056,0.0019794004,0.002801721,0.0011727415,0.0020681345],"category_scores_gemma":[0.010622997,0.0010046704,0.002291448,0.0011004285,0.0040901825,0.006462911,0.0034752884,0.0031317065,0.0009468207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013399686,0.00012815258,0.00080030994,0.0006716265,0.00006833826,0.00030907945,0.0008698623,0.069039874,0.019267285,0.7659862,0.0009054839,0.1418199],"study_design_scores_gemma":[0.00012578141,0.00037063006,0.00040082543,0.00043751125,0.00013187865,0.00059970573,0.00030556563,0.28617224,0.035940383,0.6188024,0.05661195,0.0001010046],"about_ca_topic_score_codex":0.0011815904,"about_ca_topic_score_gemma":0.000804675,"teacher_disagreement_score":0.010826539,"about_ca_system_score_codex":0.0012627533,"about_ca_system_score_gemma":0.00212914,"threshold_uncertainty_score":0.057256937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03282252343404647,"score_gpt":0.2356508613346849,"score_spread":0.20282833790063842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101209730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075420484,0.018506307,0.85425985,0.002190055,0.0012377364,0.0003175846,0.0016381807,0.019129967,0.027299728],"genre_scores_gemma":[0.5202097,0.004856616,0.45222646,0.0010738737,0.00032627236,0.0006623962,0.0027699568,0.0010837163,0.016790919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992138,0.00014966835,0.00008213853,0.00012372364,0.00035266837,0.00007790578],"domain_scores_gemma":[0.99854773,0.0002707343,0.0001094715,0.00060411124,0.0003955861,0.0000722783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055339414,0.0006433474,0.0005723008,0.00048664026,0.0005476523,0.0015280952,0.0031394272,0.0006016796,0.00737142],"category_scores_gemma":[0.002350655,0.0004012362,0.00047966078,0.0013106632,0.0005004539,0.0018153086,0.0011828301,0.0017753756,0.0017135629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011718937,0.00022775617,0.006156086,0.0015687982,0.00025676104,0.0006329433,0.00041702233,0.053611483,0.08647921,0.13443348,0.08808926,0.62695533],"study_design_scores_gemma":[0.00030502697,0.00091657136,0.0022541205,0.0002562607,0.00018884041,0.0010582567,0.00023048237,0.56924057,0.09016848,0.078837514,0.2564029,0.00014100019],"about_ca_topic_score_codex":0.0017044873,"about_ca_topic_score_gemma":0.002621193,"teacher_disagreement_score":0.00737142,"about_ca_system_score_codex":0.00097543397,"about_ca_system_score_gemma":0.0011462932,"threshold_uncertainty_score":0.024659872},"labels":[],"label_agreement":null},{"id":"W2101300912","doi":"10.1016/j.peva.2004.10.020","title":"Performance analysis of a novel hybrid push–pull algorithm with QoS adaptations in wireless networks","year":2005,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Quality of service; Queue; Computer network; Broadcasting (networking); Queueing theory; Scheme (mathematics); Algorithm; Push and pull; Wireless; Distributed computing; Wireless network; Telecommunications; Mathematics","score_opus":0.023694321006341296,"score_gpt":0.2644651976376429,"score_spread":0.24077087663130162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101300912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54262424,0.00074384786,0.45046508,0.0003397388,0.00015067647,0.00015300665,0.000061380684,0.0008610972,0.004600911],"genre_scores_gemma":[0.9539833,0.000092072165,0.04464446,0.000034674435,0.0000421665,0.000043668533,0.000031883323,0.000034438144,0.0010933925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891627,0.00036399713,0.000054134827,0.00012261755,0.00039229053,0.00015074109],"domain_scores_gemma":[0.996075,0.0024796333,0.00023125841,0.00029527923,0.0007555101,0.00016317959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023270594,0.00071741175,0.0008511714,0.000575718,0.0006466142,0.0010261798,0.0013334932,0.0009288454,0.0014306825],"category_scores_gemma":[0.0046138163,0.00024375497,0.00023603835,0.00059582345,0.00048197075,0.0010561489,0.00068689964,0.0005073756,0.00022619247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022751624,0.00045927777,0.0033688692,0.00017166465,0.00015812137,0.00013567366,0.00010303018,0.81481683,0.04326377,0.007519017,0.0012448202,0.12648374],"study_design_scores_gemma":[0.00001840676,0.0001182328,0.00018125269,0.0000012203071,0.0000123438385,0.0000310359,0.000007874894,0.99706167,0.0021864667,0.00030182852,0.00007584593,0.0000039320494],"about_ca_topic_score_codex":0.0015450484,"about_ca_topic_score_gemma":0.0012381002,"teacher_disagreement_score":0.0023270594,"about_ca_system_score_codex":0.0007141907,"about_ca_system_score_gemma":0.0008709415,"threshold_uncertainty_score":0.012306809},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01089334841262969,"score_gpt":0.2440988763617894,"score_spread":0.23320552794915972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101397060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007808643,0.00046421218,0.9817028,0.0001552252,0.000078057055,0.00007330027,0.00006234449,0.005072935,0.0045824707],"genre_scores_gemma":[0.17034662,0.00052843086,0.8170457,0.00029073912,0.00009822291,0.00019034343,0.0003665713,0.0011858739,0.009947451],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905866,0.00022347702,0.000082733124,0.00012576279,0.00042565376,0.000083630635],"domain_scores_gemma":[0.999141,0.00021669193,0.000070731134,0.0003714539,0.00016456119,0.0000355167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067225477,0.0004832697,0.0005523686,0.0005133949,0.00053176226,0.0010899496,0.002738671,0.00072130084,0.0028364544],"category_scores_gemma":[0.0020735296,0.0003701102,0.0006579047,0.00059695094,0.00086542295,0.0012685414,0.001149985,0.0012338983,0.0009765704],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029859357,0.00018610264,0.0012536377,0.0005226222,0.00008772208,0.0007919103,0.0006545296,0.058283105,0.11733277,0.21691974,0.015385446,0.5882838],"study_design_scores_gemma":[0.00012746484,0.00037113513,0.0006619818,0.00009133911,0.00014731611,0.0016188254,0.000112065456,0.62076765,0.16028383,0.08084997,0.13483858,0.00012989684],"about_ca_topic_score_codex":0.001298841,"about_ca_topic_score_gemma":0.0017555443,"teacher_disagreement_score":0.0028364544,"about_ca_system_score_codex":0.0006472782,"about_ca_system_score_gemma":0.0007553376,"threshold_uncertainty_score":0.00948894},"labels":[],"label_agreement":null},{"id":"W2101703048","doi":"10.1145/571825.571877","title":"Dynamic and self-stabilizing distributed matching","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Atomicity; Bipartite graph; Computer science; Matching (statistics); Asynchronous communication; Self-stabilization; Distributed algorithm; Theoretical computer science; Time complexity; 3-dimensional matching; Blossom algorithm; Distributed computing; Graph; Quadratic equation; Computational complexity theory; Algorithm; Mathematics; Computer network","score_opus":0.009245359900534392,"score_gpt":0.21509239610713016,"score_spread":0.20584703620659578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101703048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065455675,0.00015397501,0.9216217,0.00040910672,0.000046198096,0.00010225469,0.00010179505,0.00094549695,0.011163703],"genre_scores_gemma":[0.78075004,0.00016672381,0.20866999,0.00013059647,0.000052149262,0.00020680444,0.00025645082,0.00011077238,0.009656433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884737,0.00020713083,0.000059656402,0.00038106088,0.00034858237,0.00015619556],"domain_scores_gemma":[0.99765754,0.00083469873,0.00031405542,0.00062793866,0.0004073317,0.0001583726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010036086,0.00029504852,0.00052947266,0.0006558638,0.0009345725,0.0012002399,0.0015092661,0.00078649895,0.0031057897],"category_scores_gemma":[0.0048305923,0.00028085796,0.00033075258,0.00094792247,0.00093338627,0.0020359608,0.0018991197,0.00073250645,0.0006893123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005369301,0.0002111464,0.0015231014,0.00024077507,0.00006883542,0.00023500671,0.00036747265,0.29607722,0.03276238,0.4526007,0.0057433136,0.20963313],"study_design_scores_gemma":[0.000070736416,0.00008024259,0.0003024113,0.000014774185,0.000024284614,0.00016169398,0.0000901734,0.7237296,0.01294522,0.25417826,0.008384755,0.000017942883],"about_ca_topic_score_codex":0.0007537452,"about_ca_topic_score_gemma":0.00088235404,"teacher_disagreement_score":0.0031057897,"about_ca_system_score_codex":0.0009970056,"about_ca_system_score_gemma":0.0012951555,"threshold_uncertainty_score":0.010389924},"labels":[],"label_agreement":null},{"id":"W2101899047","doi":"10.1109/icci.1992.227616","title":"Search operations on distributed directories","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Directory; Directory service; Computer science; Lightweight Directory Access Protocol; Service (business); Distributed database; Network topology; World Wide Web; Information retrieval; Data mining; Distributed computing; Computer network; Operating system","score_opus":0.021421601893334374,"score_gpt":0.2658318600475108,"score_spread":0.24441025815417644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101899047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10475864,0.0037025488,0.7304361,0.002071703,0.00046452627,0.00076573447,0.003080093,0.01346047,0.14126018],"genre_scores_gemma":[0.5358398,0.0022167047,0.33746946,0.0006104114,0.00034063763,0.0007744589,0.0049330457,0.0014145676,0.116400935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976472,0.00044357314,0.000262625,0.00035438538,0.0009296295,0.00036259549],"domain_scores_gemma":[0.9959638,0.0016752671,0.00037891217,0.0011651742,0.0005971053,0.00021972522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015819022,0.0006141529,0.0010561952,0.003276919,0.0024719657,0.0051516816,0.0016904346,0.0013646107,0.019434856],"category_scores_gemma":[0.008385773,0.00048214855,0.00069387356,0.0061053233,0.0014904928,0.00924437,0.0041153235,0.00090171734,0.0036647287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006618783,0.00019328183,0.001729524,0.00050712604,0.00005949745,0.00042323463,0.0015895475,0.021449655,0.0054042246,0.6527181,0.05383394,0.26143],"study_design_scores_gemma":[0.00045204328,0.00021688435,0.0017838252,0.00027484976,0.00012834517,0.00083964056,0.0016660873,0.2091431,0.02314492,0.47337157,0.28885195,0.0001269116],"about_ca_topic_score_codex":0.0051510246,"about_ca_topic_score_gemma":0.0063364683,"teacher_disagreement_score":0.019434856,"about_ca_system_score_codex":0.0020527109,"about_ca_system_score_gemma":0.0015686285,"threshold_uncertainty_score":0.06501609},"labels":[],"label_agreement":null},{"id":"W2102110118","doi":"10.1109/icdcs.2005.83","title":"Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Correctness; Transformation (genetics); Cache; Class (philosophy); Algorithm; Set (abstract data type); Parallel computing; Theoretical computer science; Shared memory; Suzuki-Kasami algorithm; Programming language; Artificial intelligence","score_opus":0.029192786179648923,"score_gpt":0.2555816388852233,"score_spread":0.22638885270557435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102110118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062125683,0.00010476472,0.92596626,0.0002412825,0.00005162568,0.00011692467,0.000059634076,0.0016571216,0.009676635],"genre_scores_gemma":[0.7539238,0.00014625829,0.24125983,0.00021110702,0.000058011097,0.00024620118,0.00019800186,0.0004518631,0.0035049992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988319,0.00026111468,0.00007652052,0.0001482679,0.0005177815,0.00016434173],"domain_scores_gemma":[0.9983486,0.0006113604,0.0001202027,0.00063468545,0.00023650711,0.000048691312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071525254,0.00036348664,0.00035657015,0.00034502978,0.0005775484,0.00095071364,0.0009964055,0.0004604843,0.001940881],"category_scores_gemma":[0.0032487742,0.00021554582,0.0006031604,0.0005029507,0.0012712732,0.0016633304,0.0013717238,0.0017808363,0.00038083945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026231512,0.00031298032,0.00078889495,0.00012235767,0.000049130616,0.00035494549,0.0007421708,0.111913,0.02172166,0.7157182,0.0033363304,0.14467803],"study_design_scores_gemma":[0.0001647782,0.000138957,0.00030781014,0.000022733375,0.000039162525,0.00022179424,0.00015493276,0.48097202,0.041190505,0.46121135,0.01554524,0.00003075157],"about_ca_topic_score_codex":0.001695014,"about_ca_topic_score_gemma":0.0015232242,"teacher_disagreement_score":0.001940881,"about_ca_system_score_codex":0.0007668428,"about_ca_system_score_gemma":0.000935491,"threshold_uncertainty_score":0.006492853},"labels":[],"label_agreement":null},{"id":"W2102340574","doi":"10.1109/icde.2006.51","title":"Don&amp;amp;#146;t be a Pessimist: Use Snapshot based Concurrency Control for XML","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency control; Non-lock concurrency control; Distributed concurrency control; Multiversion concurrency control; Database; Snapshot (computer storage); Concurrency; Distributed computing; Programming language; Database transaction","score_opus":0.04066292646847111,"score_gpt":0.2759588632342133,"score_spread":0.2352959367657422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102340574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08169847,0.007872926,0.84542465,0.013583252,0.0010522235,0.00013334508,0.00009286526,0.0069872653,0.043155],"genre_scores_gemma":[0.725133,0.0026895704,0.24965592,0.0032627694,0.00047413068,0.00012243522,0.00009085026,0.0009203526,0.017651089],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886703,0.0003154231,0.00006726045,0.00022497449,0.0003887385,0.00013658674],"domain_scores_gemma":[0.99673504,0.0010672259,0.00023898936,0.001279127,0.000393198,0.00028650864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018936627,0.0005225619,0.0003258062,0.0006575405,0.0008775653,0.0028465076,0.0017738248,0.0011699421,0.0052291667],"category_scores_gemma":[0.0065821283,0.00036534472,0.000325818,0.00050460786,0.00166701,0.0060912194,0.0029646521,0.0012336569,0.0010533325],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006448257,0.00028391223,0.0065129497,0.0002660633,0.00009548236,0.0008081315,0.0025039546,0.014485353,0.020463336,0.2533122,0.015949335,0.68467444],"study_design_scores_gemma":[0.00035974462,0.0009643369,0.0023695724,0.00044019282,0.00029822625,0.0020639494,0.0012733042,0.23339282,0.08299457,0.53217447,0.14330898,0.00035982474],"about_ca_topic_score_codex":0.0017713947,"about_ca_topic_score_gemma":0.002268192,"teacher_disagreement_score":0.0052291667,"about_ca_system_score_codex":0.00062838144,"about_ca_system_score_gemma":0.00080607936,"threshold_uncertainty_score":0.017493308},"labels":[],"label_agreement":null},{"id":"W2102942129","doi":"10.1109/tencon.1994.369145","title":"Response time analysis of fault tolerant systems using primary site approach with LCFS repair service","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Backup; Redundancy (engineering); Service (business); Fault tolerance; Computer science; Joins; Queue; High availability; Backup software; Primary (astronomy); Computer network; Database; Distributed computing; Operating system; Business","score_opus":0.01991301040804755,"score_gpt":0.212286057465896,"score_spread":0.19237304705784844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102942129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50234383,0.0017724456,0.4821837,0.0007852457,0.00014094384,0.00011763726,0.0003521678,0.0018520297,0.01045197],"genre_scores_gemma":[0.98848814,0.00019980368,0.00929613,0.000041842763,0.00003717613,0.000038933285,0.00010681969,0.00009360672,0.0016976609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983822,0.0005084549,0.000045562156,0.00022150093,0.00050471997,0.00033748779],"domain_scores_gemma":[0.994321,0.0039037904,0.00045171188,0.00031689563,0.000831289,0.00017528015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015122708,0.0006203667,0.00055407494,0.00084240275,0.0003673517,0.00077465695,0.00076881,0.00057772186,0.0030261513],"category_scores_gemma":[0.007390103,0.00022303965,0.0003783689,0.000712089,0.0005217313,0.00073304947,0.00035641075,0.0005917659,0.00043038864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009788733,0.00008922773,0.002885957,0.00021702501,0.000082266,0.00020591986,0.00022660929,0.92915004,0.02344713,0.019937612,0.002407269,0.020372149],"study_design_scores_gemma":[0.000008596471,0.000046380967,0.00045438393,0.000003700238,0.000009864798,0.00003070276,0.000024278756,0.99610436,0.0015424499,0.0015483481,0.00022161735,0.000005408248],"about_ca_topic_score_codex":0.0046312697,"about_ca_topic_score_gemma":0.0014705103,"teacher_disagreement_score":0.0046312697,"about_ca_system_score_codex":0.0018369325,"about_ca_system_score_gemma":0.00064992765,"threshold_uncertainty_score":0.013327897},"labels":[],"label_agreement":null},{"id":"W2103389349","doi":"10.1109/icdcs.1991.148652","title":"Performance of transaction scheduling policies for parallel database systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Database transaction; Scheduling (production processes); Nothing; Architecture; Transaction processing; Database; Online transaction processing; Transaction processing system; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.03760867438048361,"score_gpt":0.2502296666862971,"score_spread":0.2126209923058135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103389349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977989,0.0007638564,0.017775487,0.00031040548,0.00006480592,0.00004159232,0.00007105432,0.00053308584,0.002450647],"genre_scores_gemma":[0.9960039,0.00013604749,0.0035235155,0.000020648788,0.000012516662,0.000014031344,0.000054400498,0.000025101825,0.00020995866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967895,0.0015006495,0.00020617488,0.0002825032,0.00079018105,0.00043091967],"domain_scores_gemma":[0.9781074,0.015379023,0.0017340481,0.0017545765,0.0021451523,0.0008797711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005150707,0.00066892005,0.0006811948,0.00062050065,0.0008190926,0.0017083619,0.00089389953,0.0008510403,0.0011947756],"category_scores_gemma":[0.020666158,0.00042525455,0.00030719666,0.0011557363,0.0010039097,0.0014439058,0.0005664819,0.00089358573,0.00016665389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002467621,0.0004897239,0.009189941,0.00015240487,0.00010131287,0.00013796696,0.00025227465,0.9226439,0.012435982,0.010222207,0.0018695587,0.04003725],"study_design_scores_gemma":[0.00007971151,0.00030136766,0.0012107376,0.0000062786394,0.0000258914,0.000036715704,0.00008373195,0.9891418,0.005216941,0.0035924562,0.00029068885,0.000013614045],"about_ca_topic_score_codex":0.0037049358,"about_ca_topic_score_gemma":0.0015072662,"teacher_disagreement_score":0.005150707,"about_ca_system_score_codex":0.0020091152,"about_ca_system_score_gemma":0.0014998757,"threshold_uncertainty_score":0.02723986},"labels":[],"label_agreement":null},{"id":"W2103627184","doi":"10.1109/aswec.2008.4483221","title":"An Extended Concurrency Control Service for CORBA","year":2008,"lang":"en","type":"article","venue":"Proceedings - Australian Software Engineering Conference/Proceedings","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Concurrency control; Distributed computing; Atomicity; Deadlock; Common Object Request Broker Architecture; Distributed transaction; Scalability; Transaction processing; Fault tolerance; Concurrency; Optimistic concurrency control; Serializability; Distributed concurrency control; Multiversion concurrency control; Concurrent computing; Database transaction; Operating system; Database","score_opus":0.02513879651983089,"score_gpt":0.24545504703295756,"score_spread":0.22031625051312667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103627184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007774034,0.0005809252,0.93127626,0.0008963283,0.0005050858,0.0008596111,0.0005387733,0.048487343,0.009081607],"genre_scores_gemma":[0.2689317,0.00083634834,0.6977208,0.0014365865,0.00037946485,0.0013603278,0.0023690737,0.0048590633,0.022106638],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99528414,0.0011366159,0.00049850845,0.0004924228,0.0020173732,0.0005709298],"domain_scores_gemma":[0.99485517,0.0008016547,0.00034227737,0.0020983003,0.0014952405,0.00040736684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055842157,0.0009557842,0.0007983669,0.0012472342,0.0016767523,0.0024164359,0.0022350918,0.00132414,0.00627651],"category_scores_gemma":[0.009130597,0.0007167708,0.0012655569,0.0012626101,0.0013339422,0.0023152914,0.0030663132,0.0032591098,0.0026731244],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016015613,0.00071650307,0.003603137,0.001521164,0.00028241216,0.0018964224,0.0022973383,0.025059732,0.1631236,0.27708045,0.052331775,0.47048593],"study_design_scores_gemma":[0.0006003172,0.00042684315,0.0020186203,0.0003141035,0.00018264257,0.0016593509,0.00023350294,0.17656976,0.051032595,0.094016664,0.6725393,0.0004064534],"about_ca_topic_score_codex":0.0100481175,"about_ca_topic_score_gemma":0.006699632,"teacher_disagreement_score":0.0100481175,"about_ca_system_score_codex":0.0015109904,"about_ca_system_score_gemma":0.003882787,"threshold_uncertainty_score":0.029532492},"labels":[],"label_agreement":null},{"id":"W2104075962","doi":"","title":"Probability measure on regular languages and its application in fault diagnosis for discrete event systems","year":2004,"lang":"en","type":"article","venue":"Asian Control Conference","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ambiguity; Probabilistic logic; Computer science; Event (particle physics); Fault (geology); Measure (data warehouse); Construct (python library); Theoretical computer science; Artificial intelligence; Data mining; Natural language processing; Programming language","score_opus":0.01733281613318584,"score_gpt":0.2620313732094104,"score_spread":0.24469855707622454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104075962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062882225,0.0004016144,0.9916539,0.00030899514,0.00004632326,0.00002198384,0.000034234898,0.00018005709,0.0010646651],"genre_scores_gemma":[0.43550348,0.001712684,0.5587869,0.00037076182,0.0006177825,0.00022261146,0.0002258448,0.00024076962,0.00231923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951792,0.0020474026,0.00042449834,0.00076565257,0.001314491,0.00026884596],"domain_scores_gemma":[0.97390455,0.021596117,0.0012123864,0.0013108797,0.0013308007,0.0006452238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060343486,0.0010955689,0.0013062466,0.0028907354,0.0011175462,0.0032785563,0.0019862687,0.0016678737,0.0016712245],"category_scores_gemma":[0.029372087,0.0007708832,0.0025706259,0.002892216,0.005250726,0.006201048,0.002934546,0.0036963073,0.0003639195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006672737,0.00003971177,0.0004585939,0.00013725375,0.000046737223,0.00023668053,0.00031175892,0.07272882,0.001345647,0.89810693,0.0005690502,0.025952065],"study_design_scores_gemma":[0.000014222902,0.000056501176,0.00012585164,0.000031628522,0.000018083161,0.00014180857,0.00003959376,0.32813507,0.0011614109,0.66874254,0.0014953598,0.00003786074],"about_ca_topic_score_codex":0.0019563083,"about_ca_topic_score_gemma":0.00074260944,"teacher_disagreement_score":0.0060343486,"about_ca_system_score_codex":0.0017342749,"about_ca_system_score_gemma":0.0010566713,"threshold_uncertainty_score":0.031913042},"labels":[],"label_agreement":null},{"id":"W2104639126","doi":"10.1007/978-3-642-03869-3_10","title":"Grouping MPI Processes for Partial Checkpoint and Co-migration","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Process (computing); Node (physics); Process migration; Block (permutation group theory); Distributed computing; Resource (disambiguation); Computer network; Operating system","score_opus":0.019077199212550806,"score_gpt":0.26157027669127225,"score_spread":0.24249307747872145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104639126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839055,0.00061311503,0.962013,0.00020998229,0.00028285568,0.00017295715,0.00015152263,0.006662938,0.011503167],"genre_scores_gemma":[0.2943673,0.0005481089,0.67767936,0.00009930072,0.00018711253,0.00042207175,0.0007700426,0.0013071576,0.024619533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00005834755,0.000023744466,0.000049497394,0.00012236991,0.00005984886],"domain_scores_gemma":[0.99920577,0.0001271628,0.00004309904,0.00046570366,0.00011308605,0.000045287616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039808135,0.0006639156,0.000737818,0.0007245502,0.0012244076,0.0007630018,0.0014490369,0.00067581225,0.009151363],"category_scores_gemma":[0.0014941741,0.00039386668,0.000550253,0.0013741938,0.00051366485,0.0008364305,0.0013246433,0.0010334679,0.0032921126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006225325,0.00023594778,0.0007767464,0.00048337475,0.00006957437,0.00032342272,0.0006855954,0.04902345,0.07806306,0.094766885,0.033665426,0.74128395],"study_design_scores_gemma":[0.00020987906,0.00053416134,0.0024507635,0.00012227167,0.00019348743,0.00076836196,0.0003780858,0.52773184,0.10131244,0.20455086,0.16160585,0.00014200206],"about_ca_topic_score_codex":0.0008880342,"about_ca_topic_score_gemma":0.0015835365,"teacher_disagreement_score":0.009151363,"about_ca_system_score_codex":0.00032455465,"about_ca_system_score_gemma":0.0005505935,"threshold_uncertainty_score":0.030614376},"labels":[],"label_agreement":null},{"id":"W2104709356","doi":"10.1109/ipdps.2011.31","title":"Snap-Stabilizing Committee Coordination","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Computer science; Mutual exclusion; Process (computing); Algorithm; Synchronization (alternating current); Protocol (science); Set (abstract data type); Distributed computing; Computer network; Programming language","score_opus":0.03751443629509378,"score_gpt":0.2576417524047073,"score_spread":0.22012731610961356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104709356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018223686,0.00012260277,0.9778552,0.00017264915,0.00006428274,0.00011179197,0.00004682082,0.0007135086,0.0026893632],"genre_scores_gemma":[0.55245465,0.00023519825,0.4365114,0.00027634928,0.000070700386,0.0004388428,0.00034139276,0.00020689,0.009464553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811053,0.0004947952,0.00011714428,0.0005570085,0.00042359493,0.00029684757],"domain_scores_gemma":[0.9970503,0.00090408465,0.0003716614,0.0007166944,0.0005878244,0.00036936637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019827378,0.00070774823,0.0010337486,0.00068672124,0.0013852095,0.0017936057,0.0027041784,0.001328011,0.004696399],"category_scores_gemma":[0.0063915965,0.00035408107,0.0007106978,0.00064414006,0.0012337245,0.0023357647,0.0029878716,0.0012521651,0.0009015769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007407041,0.0002324159,0.0027866368,0.00030789897,0.00015138902,0.00031531753,0.00077010546,0.47436526,0.018716471,0.30550787,0.009489093,0.18661684],"study_design_scores_gemma":[0.0001060318,0.0001444459,0.00026241923,0.000031434003,0.000039149843,0.00011115928,0.00015359068,0.89918214,0.01043848,0.0786596,0.010836693,0.000034831784],"about_ca_topic_score_codex":0.0022147968,"about_ca_topic_score_gemma":0.0015978126,"teacher_disagreement_score":0.004696399,"about_ca_system_score_codex":0.0011582971,"about_ca_system_score_gemma":0.002161714,"threshold_uncertainty_score":0.01571101},"labels":[],"label_agreement":null},{"id":"W2105299496","doi":"10.1109/async.1994.656315","title":"Delay-insensitive solutions to the committee problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Implementation; Computer science; Mutual exclusion; Synchronization (alternating current); Scheduling (production processes); Processor scheduling; Parallelism (grammar); Simple (philosophy); Parallel computing; Distributed computing; Theoretical computer science; Resource (disambiguation); Programming language; Computer network; Mathematical optimization; Mathematics","score_opus":0.029775913914963648,"score_gpt":0.22481160916403206,"score_spread":0.1950356952490684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105299496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02190136,0.00036797178,0.95092976,0.0009154416,0.00020639888,0.00016039799,0.00011210332,0.0005577986,0.02484871],"genre_scores_gemma":[0.42955118,0.0011769163,0.51392066,0.0010575838,0.00044590724,0.0007653776,0.0005498458,0.00047991326,0.05205265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980509,0.00052694563,0.00012723234,0.00029615944,0.0006015871,0.00039719426],"domain_scores_gemma":[0.9965004,0.0015666604,0.0003584304,0.00069460063,0.00062607724,0.00025397525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021449295,0.0007317955,0.00078206183,0.00078104227,0.0013834718,0.0019638278,0.0024905554,0.0020867188,0.008534165],"category_scores_gemma":[0.00945434,0.000639231,0.0008364828,0.00095843244,0.0012119118,0.0027842608,0.0031708481,0.0030644566,0.001486047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021927449,0.00013453567,0.00034418836,0.00018247901,0.00003767528,0.0001518195,0.0002503969,0.078947134,0.0054812976,0.84306794,0.013529635,0.05765352],"study_design_scores_gemma":[0.0002142169,0.000099306424,0.00017923483,0.00003569982,0.000039821774,0.00014236811,0.00014033676,0.3855616,0.006779616,0.57904613,0.027718306,0.00004333737],"about_ca_topic_score_codex":0.0010057291,"about_ca_topic_score_gemma":0.001101374,"teacher_disagreement_score":0.008534165,"about_ca_system_score_codex":0.0010600585,"about_ca_system_score_gemma":0.001837611,"threshold_uncertainty_score":0.028549612},"labels":[],"label_agreement":null},{"id":"W2105490751","doi":"10.1145/1400751.1400844","title":"Closing the complexity gap between mutual exclusion and FCFS mutual exclusion","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Reading (process); Closing (real estate); Upper and lower bounds; Theoretical computer science; Mathematics; Computer network; Political science","score_opus":0.09248155547423492,"score_gpt":0.27747111388312345,"score_spread":0.18498955840888853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105490751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19439271,0.0040487666,0.77120346,0.0069487747,0.00032183924,0.0002351112,0.00028299255,0.0021746275,0.020391788],"genre_scores_gemma":[0.8754063,0.00092002307,0.11690075,0.0007912879,0.00047223023,0.00025943143,0.000245228,0.00051266997,0.004492157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98715776,0.003868365,0.00037963793,0.0015642714,0.004366053,0.0026639164],"domain_scores_gemma":[0.91335833,0.07157354,0.0029197386,0.008910808,0.0021230676,0.0011145384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006279333,0.001594691,0.0021899252,0.001196109,0.0021191551,0.0037694527,0.004638292,0.003105003,0.0056247874],"category_scores_gemma":[0.039003782,0.00093649334,0.0013836675,0.0022080976,0.0036896737,0.012037373,0.0051291934,0.0049244873,0.000677242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001768791,0.00047694347,0.00242253,0.00055774965,0.00016625074,0.0002918933,0.0007880465,0.67249334,0.011685417,0.17985035,0.009479216,0.12001944],"study_design_scores_gemma":[0.00008839299,0.00011013504,0.00043546146,0.000026082736,0.000037903064,0.0001636784,0.00008959749,0.8897642,0.004526047,0.102108315,0.0026175333,0.00003263453],"about_ca_topic_score_codex":0.0054985574,"about_ca_topic_score_gemma":0.0052936254,"teacher_disagreement_score":0.006279333,"about_ca_system_score_codex":0.0047212453,"about_ca_system_score_gemma":0.004266613,"threshold_uncertainty_score":0.034255147},"labels":[],"label_agreement":null},{"id":"W2106110374","doi":"10.1109/ds-rt.2008.50","title":"Agent-Based Mobile Middleware Architecture (AMMA) for Patient-Care Clinical Data Messaging Using Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovatia (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Middleware (distributed applications); Message broker; Computer network; Protocol (science); Mobile computing; Context (archaeology); Short Message Service; Distributed computing","score_opus":0.08998642414654853,"score_gpt":0.3291845094609209,"score_spread":0.2391980853143724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106110374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072007533,0.0020108873,0.9592485,0.0012339936,0.0006605804,0.0005090379,0.0002170487,0.016802412,0.01211681],"genre_scores_gemma":[0.14572437,0.0019233217,0.82409126,0.001110386,0.00027751605,0.0012481811,0.0015525143,0.0006529404,0.023419559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.0002673055,0.00017083599,0.00014507074,0.0003604973,0.00008929522],"domain_scores_gemma":[0.999193,0.0001536653,0.00010092755,0.0001331394,0.00024524657,0.00017400044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016028731,0.00048412677,0.00053633365,0.0007911616,0.00086982106,0.0020264853,0.0022918328,0.0014101872,0.0036983413],"category_scores_gemma":[0.0024816275,0.0003436751,0.0006757833,0.0006605504,0.0003386469,0.0017197145,0.0020946665,0.001311689,0.0029776602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000606478,0.0005005742,0.0037116085,0.0017885644,0.00038855238,0.0015435903,0.001430509,0.025127606,0.06657472,0.17375076,0.08017254,0.64440453],"study_design_scores_gemma":[0.00017643879,0.0005483045,0.0026615523,0.00032284026,0.00033813872,0.002195453,0.00022908038,0.21623291,0.027580444,0.035093732,0.714442,0.00017903128],"about_ca_topic_score_codex":0.0010492787,"about_ca_topic_score_gemma":0.0012942251,"teacher_disagreement_score":0.0036983413,"about_ca_system_score_codex":0.00070697704,"about_ca_system_score_gemma":0.0018073046,"threshold_uncertainty_score":0.012372196},"labels":[],"label_agreement":null},{"id":"W2106198180","doi":"10.5555/2485288.2485479","title":"Verifying safety and liveness for the FlexTM hybrid transactional memory","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transactional memory; Software transactional memory; Computer science; Liveness; Cache coherence; Serializability; Distributed computing; Shared memory; Distributed shared memory; Parallel computing; Cache; Theoretical computer science; Database transaction; Transaction processing; Programming language; Memory management; CPU cache; Cache algorithms; Distributed transaction; Uniform memory access; Overlay","score_opus":0.01238823462313733,"score_gpt":0.22029647942153568,"score_spread":0.20790824479839837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106198180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35304958,0.00021037708,0.6414188,0.00015937915,0.000025484642,0.00009298579,0.00015068059,0.0031164344,0.0017762743],"genre_scores_gemma":[0.9113546,0.000035246154,0.087882474,0.000038487076,0.000009364175,0.000049637543,0.0001014217,0.000074806136,0.0004540397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805033,0.0005795981,0.00014833623,0.00034400876,0.00069543393,0.00018231822],"domain_scores_gemma":[0.99461186,0.0028156901,0.0005493797,0.0012961826,0.00062357984,0.00010341299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340992,0.00046052007,0.00031592837,0.00052787724,0.00053875684,0.0009894435,0.0014420204,0.0007819035,0.0013132028],"category_scores_gemma":[0.0060435394,0.00032531362,0.0006281081,0.00030472077,0.0016551662,0.0019184713,0.0014527612,0.00082705676,0.00012770692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00225065,0.00037692854,0.03400214,0.00067746016,0.00033999747,0.0018648386,0.00089198526,0.40069103,0.24210739,0.14939773,0.0018857252,0.16551414],"study_design_scores_gemma":[0.00007772934,0.00037271745,0.0012895488,0.00003458263,0.000059070626,0.0003404649,0.000115745584,0.8672221,0.09844586,0.029748958,0.0022647313,0.000028626866],"about_ca_topic_score_codex":0.0019087709,"about_ca_topic_score_gemma":0.0015856472,"teacher_disagreement_score":0.002340992,"about_ca_system_score_codex":0.00067156414,"about_ca_system_score_gemma":0.00074392755,"threshold_uncertainty_score":0.012380481},"labels":[],"label_agreement":null},{"id":"W2106756255","doi":"10.1109/pacrim.1993.407324","title":"Dynamic time slot assignment in reservation protocols for multiaccess channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Reservation; Computer network; Distributed computing","score_opus":0.046639636327414156,"score_gpt":0.30678389849093746,"score_spread":0.2601442621635233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106756255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011932335,0.0029905953,0.9740311,0.0008460389,0.00044775647,0.000092816896,0.000032597276,0.00026409444,0.009362596],"genre_scores_gemma":[0.6657579,0.005179463,0.31152648,0.0005428378,0.0009386926,0.0004391936,0.00013313575,0.00018436974,0.015297989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986206,0.00061628217,0.00006607595,0.00015406225,0.00035910466,0.00018382844],"domain_scores_gemma":[0.9988513,0.0007532422,0.000077645185,0.00013926465,0.00012778108,0.000050787196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017178637,0.00052942015,0.00056017097,0.00044760716,0.0008926824,0.0018780938,0.0011923676,0.0009874696,0.0022178043],"category_scores_gemma":[0.0034897896,0.00048540864,0.00048662585,0.0009163639,0.0013041097,0.0025468199,0.0007721393,0.0014962701,0.0005740862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021790263,0.000080796,0.00050127186,0.00014534518,0.00004378758,0.0001988337,0.00039791834,0.18675876,0.0050177933,0.70283616,0.006001407,0.09780003],"study_design_scores_gemma":[0.000060214494,0.00011917855,0.00014234126,0.00004804469,0.000039641425,0.00017035288,0.0001208423,0.7392228,0.0034444882,0.2181936,0.038394384,0.000044145043],"about_ca_topic_score_codex":0.001667976,"about_ca_topic_score_gemma":0.0015253745,"teacher_disagreement_score":0.0022178043,"about_ca_system_score_codex":0.0014510708,"about_ca_system_score_gemma":0.0010359392,"threshold_uncertainty_score":0.010528326},"labels":[],"label_agreement":null},{"id":"W2107208179","doi":"10.1145/777412.777467","title":"Toward a decidable notion of sequential consistency","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decidability; Undecidable problem; Correctness; Computer science; Upper and lower bounds; Prefix; Consistency (knowledge bases); Sequential consistency; Protocol (science); Theoretical computer science; Conjecture; Discrete mathematics; Counterexample; Reachability problem; Mathematics; Algorithm; Consistency model","score_opus":0.0325474592930355,"score_gpt":0.2504543122260805,"score_spread":0.21790685293304501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107208179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038201306,0.0005100054,0.9423328,0.0041325474,0.00013569977,0.00016481172,0.00036713583,0.0012229821,0.012932724],"genre_scores_gemma":[0.5709255,0.00068937085,0.41698465,0.0015298504,0.0005400366,0.00069905486,0.0010682369,0.00054320804,0.007020055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871171,0.0039776643,0.0011262692,0.002977768,0.0035875565,0.0012136438],"domain_scores_gemma":[0.96533084,0.022697499,0.0017890864,0.0071613663,0.0021322214,0.0008889613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012941671,0.0010756816,0.0011966565,0.0021828783,0.0027885577,0.008184805,0.005957018,0.0033494763,0.0032327885],"category_scores_gemma":[0.02658788,0.0023147804,0.003467931,0.0023463324,0.011653747,0.021624248,0.007989095,0.013914975,0.0006475192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769563,0.00007251559,0.00033373813,0.000079387544,0.000022777866,0.000098711906,0.00053662696,0.01014992,0.0016034433,0.980056,0.0008725842,0.0061065713],"study_design_scores_gemma":[0.00006112284,0.000037610465,0.000080481266,0.00003792627,0.000029663252,0.000074020805,0.00014613553,0.06280972,0.0038494659,0.9264965,0.006354467,0.000022913373],"about_ca_topic_score_codex":0.0031197814,"about_ca_topic_score_gemma":0.00250909,"teacher_disagreement_score":0.012941671,"about_ca_system_score_codex":0.0057067596,"about_ca_system_score_gemma":0.004778965,"threshold_uncertainty_score":0.06844294},"labels":[],"label_agreement":null},{"id":"W2107465185","doi":"10.1145/1379350.1379355","title":"Maintaining consistency in a failure-prone P2P database network during transaction processing","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed transaction; Database transaction; Database schema; Transaction processing; Database; Distributed database; Consistency (knowledge bases); Peer-to-peer; Compensating transaction; Data consistency; Data sharing; Nested transaction; Database design; Distributed computing","score_opus":0.017930624846128812,"score_gpt":0.22970588086869784,"score_spread":0.21177525602256903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107465185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10127347,0.0002977578,0.89580125,0.00042228398,0.0000456272,0.0001818552,0.00006825249,0.00080143363,0.0011080868],"genre_scores_gemma":[0.75036204,0.00033755484,0.24714361,0.00013150473,0.00010823724,0.0003345326,0.00023093294,0.00020054354,0.0011510038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872485,0.0036855699,0.0012571742,0.0018450938,0.005114238,0.0008494674],"domain_scores_gemma":[0.9731083,0.010002515,0.0027454635,0.008990767,0.0045133783,0.00063963793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012644906,0.00064735883,0.001542244,0.0009886995,0.0025166066,0.00458344,0.005706849,0.0020650888,0.00044803234],"category_scores_gemma":[0.035323747,0.0009965436,0.0005578434,0.0018673002,0.0021904702,0.009754345,0.0044131964,0.0019805375,0.00038207383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016474992,0.0005206893,0.03202848,0.00074371503,0.00045995475,0.006509535,0.006523083,0.48305914,0.07094457,0.15664057,0.0054000514,0.23552272],"study_design_scores_gemma":[0.00019180341,0.00036115895,0.0023515525,0.000057297562,0.00019014062,0.0013855285,0.001083136,0.8494935,0.029305983,0.10572867,0.009766058,0.00008523416],"about_ca_topic_score_codex":0.0017922755,"about_ca_topic_score_gemma":0.0011033819,"teacher_disagreement_score":0.012644906,"about_ca_system_score_codex":0.0008370772,"about_ca_system_score_gemma":0.0026061495,"threshold_uncertainty_score":0.06687343},"labels":[],"label_agreement":null},{"id":"W2107615505","doi":"10.1016/s1389-9457(11)70432-4","title":"W-K-083 ISCORE: AN SYSTEM FOR GRADING HOME SLEEP TEST INTERPRETABILITY","year":2011,"lang":"en","type":"article","venue":"Sleep Medicine","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Heart and Stroke Foundation of Canada","keywords":"Interpretability; Medicine; Test (biology); Computer science; Artificial intelligence; Biology","score_opus":0.03143767969559271,"score_gpt":0.25584960464380285,"score_spread":0.22441192494821013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107615505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7059807,0.00088554784,0.13325003,0.0005990237,0.00041694648,0.004895294,0.056539886,0.040365666,0.057066914],"genre_scores_gemma":[0.7570452,0.0004418895,0.15437351,0.00048700738,0.00012830428,0.004142991,0.04530377,0.0019501672,0.03612721],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830544,0.00032847683,0.00041279633,0.00019231407,0.000608186,0.00015275067],"domain_scores_gemma":[0.9904525,0.001977544,0.0013926298,0.00048651197,0.005177273,0.00051350385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00253788,0.0010671325,0.00070627505,0.0049290196,0.00041910823,0.0010846076,0.0009043829,0.00076721597,0.012999513],"category_scores_gemma":[0.010208505,0.00024688308,0.0008030763,0.0014077198,0.0002612314,0.0011179497,0.0013914388,0.0004336792,0.006058311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003581743,0.0005706426,0.44568735,0.00082184025,0.00037752875,0.00030015214,0.00057980337,0.002845169,0.013848908,0.0009806879,0.08974246,0.44066375],"study_design_scores_gemma":[0.00042442788,0.0015758825,0.8675725,0.0003664489,0.0004698351,0.0011085593,0.0007534185,0.056964707,0.03325952,0.001856932,0.03539106,0.0002567036],"about_ca_topic_score_codex":0.005471018,"about_ca_topic_score_gemma":0.010262487,"teacher_disagreement_score":0.012999513,"about_ca_system_score_codex":0.0007884203,"about_ca_system_score_gemma":0.00093436777,"threshold_uncertainty_score":0.043487668},"labels":[],"label_agreement":null},{"id":"W2107914208","doi":"10.1109/icde.1994.283056","title":"X.500 Directory Schema management","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Directory; Directory service; Schema (genetic algorithms); Computer science; Lightweight Directory Access Protocol; Organizational unit; Schema evolution; Conceptual schema; Database schema; Information retrieval; World Wide Web; Computer security; Gender schema theory; Operating system","score_opus":0.018817751582591594,"score_gpt":0.21299353861823356,"score_spread":0.19417578703564198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107914208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017790316,0.0020943754,0.488799,0.0022399023,0.00070182834,0.0017640095,0.018862354,0.2750214,0.19272676],"genre_scores_gemma":[0.18865657,0.0031209302,0.43344918,0.0023869528,0.00042395532,0.0016569328,0.11759322,0.020046994,0.23266526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850863,0.00028674406,0.00021915177,0.00022144809,0.000573256,0.00019074114],"domain_scores_gemma":[0.9970816,0.0002989651,0.00024827998,0.0013869605,0.00073168305,0.00025251854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025815351,0.0007032707,0.000520008,0.002053808,0.0015053842,0.0060285944,0.002220338,0.0011412319,0.032130275],"category_scores_gemma":[0.005262502,0.0006931429,0.00045273124,0.0023548007,0.00056145387,0.0044201594,0.0028107532,0.0014780514,0.022114238],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047387255,0.00023346844,0.0044554495,0.00040411545,0.00006729832,0.0004905545,0.0012154314,0.0032241992,0.00981995,0.13684294,0.4910465,0.35172638],"study_design_scores_gemma":[0.00006926309,0.00004910065,0.0013050609,0.00011793649,0.000029404462,0.000587285,0.00022658615,0.017458841,0.0124497255,0.017962672,0.94968224,0.00006188227],"about_ca_topic_score_codex":0.005424669,"about_ca_topic_score_gemma":0.003693374,"teacher_disagreement_score":0.032130275,"about_ca_system_score_codex":0.0014726789,"about_ca_system_score_gemma":0.0021251815,"threshold_uncertainty_score":0.10748649},"labels":[],"label_agreement":null},{"id":"W2108084919","doi":"10.1109/ecumn.2002.1002117","title":"Loss recovery at the ATM layer for latency-constrained reliable multicast","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Standards and Technology","keywords":"Computer network; Retransmission; Computer science; Multicast; Reliable multicast; Packet loss; Protocol Independent Multicast; Transport layer; Network packet; Application layer; Asynchronous Transfer Mode; ATM adaptation layer; Distributed computing; Layer (electronics); Chemistry; Operating system","score_opus":0.01987564484501384,"score_gpt":0.2471205443384717,"score_spread":0.22724489949345786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108084919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10486287,0.006006423,0.8813258,0.001131318,0.00025706404,0.00013290384,0.00009604856,0.001419956,0.0047675967],"genre_scores_gemma":[0.86259085,0.0024878387,0.13156685,0.00018610309,0.00022938102,0.00012614518,0.00012766855,0.00007867741,0.0026063975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937904,0.00014916442,0.000032869822,0.00004253375,0.00032433125,0.000072098526],"domain_scores_gemma":[0.99919575,0.00029864485,0.00014362656,0.00015001447,0.00018031272,0.00003166025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012151488,0.00031040772,0.00028105808,0.0004802022,0.0006332633,0.00066005165,0.0009378479,0.00055350276,0.0017933171],"category_scores_gemma":[0.002741029,0.00021474702,0.00025618175,0.000570238,0.000607488,0.0012757825,0.0005665935,0.0007653827,0.00037235007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013551402,0.00018001776,0.002624394,0.0007852557,0.00012444002,0.0010315559,0.00045113612,0.33122995,0.14794467,0.12494426,0.008678617,0.38065055],"study_design_scores_gemma":[0.00016132761,0.0005260179,0.0015539544,0.000084228624,0.00013931697,0.00086167315,0.0001093138,0.87654376,0.04126859,0.05896211,0.019701272,0.0000885414],"about_ca_topic_score_codex":0.0011425028,"about_ca_topic_score_gemma":0.0009613668,"teacher_disagreement_score":0.0017933171,"about_ca_system_score_codex":0.0005465252,"about_ca_system_score_gemma":0.0006686918,"threshold_uncertainty_score":0.006426394},"labels":[],"label_agreement":null},{"id":"W2108655457","doi":"10.1109/ccgrid.2005.1558537","title":"Feasibility study and early experimental results towards cluster survivability","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Canada; Ericsson (Canada)","funders":"","keywords":"Serviceability (structure); Computer science; Benchmarking; Survivability; High availability; Architecture; Cluster (spacecraft); Critical infrastructure; Reliability engineering; Reliability (semiconductor); Scheduling (production processes); Distributed computing; Computer security; Operating system; Engineering; Computer network; Operations management; Business","score_opus":0.03185438985663053,"score_gpt":0.30238715444957925,"score_spread":0.2705327645929487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108655457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89003366,0.0002640424,0.08848231,0.0011898458,0.00013211762,0.0011826508,0.000423118,0.0025200173,0.01577218],"genre_scores_gemma":[0.96892047,0.00010389615,0.027792456,0.000112084264,0.000019633868,0.00026063976,0.0003839948,0.00011582641,0.0022910088],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958132,0.0015883018,0.00018163671,0.00035501306,0.0015060101,0.0005558523],"domain_scores_gemma":[0.99083006,0.0037152225,0.0003062855,0.0012905364,0.00338942,0.00046845197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044134143,0.00046622127,0.00036889603,0.0005553905,0.0011605528,0.00081567914,0.0015764626,0.0007905418,0.0052279467],"category_scores_gemma":[0.011449729,0.000222361,0.00024095053,0.0006176046,0.00090461783,0.0015856451,0.001074379,0.0008644394,0.00091067667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00994991,0.007435992,0.035727043,0.001774512,0.000248041,0.0015959623,0.0040423214,0.1106466,0.53526384,0.02763038,0.015331886,0.2503536],"study_design_scores_gemma":[0.0007435633,0.025268372,0.014403144,0.00015083904,0.00015112803,0.00078168564,0.0024964164,0.14048219,0.7812736,0.0064748693,0.027627809,0.0001463518],"about_ca_topic_score_codex":0.001978531,"about_ca_topic_score_gemma":0.0012399779,"teacher_disagreement_score":0.0052279467,"about_ca_system_score_codex":0.00096876477,"about_ca_system_score_gemma":0.0006572946,"threshold_uncertainty_score":0.023340642},"labels":[],"label_agreement":null},{"id":"W2108934635","doi":"10.1109/mascot.1998.693692","title":"Performance of hard real-time transaction scheduling policies in parallel database systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database transaction; Distributed computing; Online transaction processing; Dynamic priority scheduling; Scheduling (production processes); Transaction processing; Distributed transaction; Fair-share scheduling; Workload; Compensating transaction; Earliest deadline first scheduling; Database; Rate-monotonic scheduling; Real-time computing; Computer network; Operating system; Quality of service","score_opus":0.026851039357235533,"score_gpt":0.23534647352702492,"score_spread":0.20849543416978938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108934635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98607385,0.00091498985,0.0106445085,0.00019529677,0.00007098244,0.000034298522,0.00005717492,0.00037172635,0.0016372511],"genre_scores_gemma":[0.99746037,0.0001177356,0.0020876222,0.0000235042,0.00001464234,0.000010110535,0.000037605194,0.000019277837,0.00022907488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951892,0.001623429,0.00037363337,0.0004671112,0.0016340534,0.0007126312],"domain_scores_gemma":[0.97685087,0.015017884,0.0023091754,0.0019332138,0.0025608698,0.0013279633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067635598,0.0008302238,0.00103191,0.0008375256,0.00079944305,0.0017321908,0.0010836353,0.0007939939,0.0010800728],"category_scores_gemma":[0.025185812,0.00039143773,0.00019430094,0.0010346343,0.0012107095,0.0013853353,0.0008734347,0.0007211805,0.00024179628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064478023,0.0008282376,0.0146929575,0.00027294553,0.00014587377,0.00020935966,0.0003387474,0.88144183,0.025614643,0.003918916,0.0018002514,0.06428843],"study_design_scores_gemma":[0.00015256034,0.00091918843,0.003144303,0.000010280402,0.000028238299,0.000067066496,0.0001412284,0.98186666,0.011569391,0.0017850925,0.00029087276,0.000025237587],"about_ca_topic_score_codex":0.0042844554,"about_ca_topic_score_gemma":0.0014004696,"teacher_disagreement_score":0.0067635598,"about_ca_system_score_codex":0.0016873796,"about_ca_system_score_gemma":0.0014620125,"threshold_uncertainty_score":0.03576958},"labels":[],"label_agreement":null},{"id":"W2109248581","doi":"10.1007/978-3-540-87779-0_41","title":"Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Spin (aerodynamics); Algorithm; Physics; Theoretical computer science","score_opus":0.01660293086506761,"score_gpt":0.2428399060668806,"score_spread":0.226236975201813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109248581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008445461,0.10637247,0.27057135,0.10862889,0.25190318,0.0005430223,0.002645908,0.006128082,0.24476166],"genre_scores_gemma":[0.08376035,0.059754044,0.08486323,0.016951872,0.14457239,0.00064591167,0.006896962,0.0024325638,0.6001227],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.00027161796,0.000058429912,0.00019174918,0.00040041786,0.00012626965],"domain_scores_gemma":[0.9976707,0.0012223161,0.00007749249,0.00022109055,0.00057783735,0.00023041294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017179446,0.0013169233,0.001303356,0.0011959734,0.0014724545,0.0029593713,0.0022949032,0.0031169786,0.052857798],"category_scores_gemma":[0.0050365627,0.00073697965,0.00074456906,0.0032564278,0.001078715,0.0065641655,0.0009733309,0.0046808845,0.016005106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010689422,0.00011292994,0.000091649636,0.00044179638,0.000018775367,0.00005224649,0.000059291462,0.0012437053,0.00065057323,0.052176565,0.8128279,0.13221769],"study_design_scores_gemma":[0.000097059776,0.0002504142,0.000545179,0.00020617199,0.000052932934,0.00030231336,0.00010295105,0.010153713,0.0020961494,0.16633308,0.81977975,0.000080315884],"about_ca_topic_score_codex":0.0010623514,"about_ca_topic_score_gemma":0.0022210893,"teacher_disagreement_score":0.052857798,"about_ca_system_score_codex":0.0015669849,"about_ca_system_score_gemma":0.0011778247,"threshold_uncertainty_score":0.17682695},"labels":[],"label_agreement":null},{"id":"W2109406937","doi":"10.1109/ideas.2004.42","title":"Interoperable server-based cache consistency algorithm","year":2004,"lang":"en","type":"article","venue":"International Database Engineering and Applications Symposium","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Cache; Concurrency control; Commit; Callback; Operating system; Transactional memory; False sharing; Consistency (knowledge bases); Client-side; Cache algorithms; Database transaction; Distributed computing; Database; Computer network; CPU cache","score_opus":0.007040355949881921,"score_gpt":0.21748349784167884,"score_spread":0.21044314189179691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109406937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150272325,0.0003616148,0.9687385,0.0002832236,0.00012696453,0.00030565594,0.0001722709,0.0041593416,0.010825103],"genre_scores_gemma":[0.4235697,0.00029433134,0.56078297,0.00032012776,0.00012402453,0.00049886457,0.0010169153,0.00044074736,0.012952283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968561,0.0005366982,0.00031412594,0.00051329064,0.0014378385,0.00034186742],"domain_scores_gemma":[0.9943752,0.0007678342,0.00035649727,0.0019948639,0.0022919318,0.0002137162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028062796,0.0005666231,0.00092021195,0.0013910487,0.0012222927,0.0026465708,0.004210139,0.0014387071,0.0066723344],"category_scores_gemma":[0.0071653323,0.00034854095,0.0006168616,0.002126866,0.0008732915,0.0030085277,0.0024789646,0.0019443543,0.0021654528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091039465,0.00054031896,0.0052794325,0.00026922446,0.00016653546,0.0002317129,0.00044220506,0.13860086,0.01730344,0.22635117,0.022905674,0.58699906],"study_design_scores_gemma":[0.00022203362,0.00024183257,0.0007066093,0.000046153145,0.0000904892,0.00042645886,0.0001388533,0.8882435,0.023369117,0.054434508,0.032001022,0.000079407924],"about_ca_topic_score_codex":0.0029132585,"about_ca_topic_score_gemma":0.002924437,"teacher_disagreement_score":0.0066723344,"about_ca_system_score_codex":0.001635571,"about_ca_system_score_gemma":0.003353288,"threshold_uncertainty_score":0.022321165},"labels":[],"label_agreement":null},{"id":"W2109895798","doi":"10.1109/icpp.2004.25","title":"Clustering strategies for cluster timestamps","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Cluster analysis; Scalability; Locality; Timestamp-based concurrency control; Cluster (spacecraft); Hierarchical clustering; Data mining; Parallel computing; Distributed computing; Real-time computing; Database; Artificial intelligence; Computer network","score_opus":0.015829832459714383,"score_gpt":0.2560956738828982,"score_spread":0.24026584142318383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109895798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057558067,0.0011847701,0.9324817,0.000273768,0.00010507514,0.00038108992,0.00023223353,0.0012871295,0.006496291],"genre_scores_gemma":[0.41719177,0.0005190697,0.5781449,0.00009741183,0.000048671165,0.0003492285,0.00047173531,0.00020310639,0.0029740569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975914,0.0007256789,0.00023191726,0.000396796,0.0008254377,0.00022887961],"domain_scores_gemma":[0.9938962,0.0018068328,0.0006382396,0.0011808363,0.002221458,0.00025645667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030763187,0.0007683244,0.00070313335,0.0023436851,0.0015316242,0.0019048877,0.0020713992,0.0010207365,0.0025453665],"category_scores_gemma":[0.010592625,0.00037780625,0.00049548515,0.003275737,0.0007674244,0.0028901775,0.0012621129,0.00065010984,0.00075807126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074542745,0.00027043524,0.0051664547,0.0004701516,0.0001741812,0.00014862293,0.00085393456,0.3108761,0.027574448,0.18264338,0.008748732,0.46232817],"study_design_scores_gemma":[0.00017561554,0.00054545107,0.0018237919,0.00007592135,0.00017732101,0.00051462336,0.00070745195,0.85906464,0.046004597,0.05840996,0.032397512,0.000103130216],"about_ca_topic_score_codex":0.0031757513,"about_ca_topic_score_gemma":0.00518174,"teacher_disagreement_score":0.0031757513,"about_ca_system_score_codex":0.002349812,"about_ca_system_score_gemma":0.002380257,"threshold_uncertainty_score":0.017049134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026289657278363878,"score_gpt":0.2516244494746975,"score_spread":0.2253347921963336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110020044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067523103,0.00054278306,0.97808313,0.00084338663,0.00013531931,0.00020846276,0.00029167987,0.00399447,0.009148495],"genre_scores_gemma":[0.08324079,0.0004819768,0.9094471,0.00031725626,0.00009595822,0.00029317575,0.0007589291,0.00024830847,0.005116498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987914,0.00015787123,0.000094323885,0.00019485943,0.00064739725,0.00011425584],"domain_scores_gemma":[0.9985032,0.00028555762,0.00006812212,0.00037550158,0.0005924118,0.00017523253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580207,0.0003841064,0.00056871737,0.0006775389,0.0012667876,0.0013173211,0.0022663353,0.0012656286,0.010208172],"category_scores_gemma":[0.003908471,0.00039892035,0.000417063,0.0016308313,0.00052152644,0.0024236366,0.0022037127,0.0010356698,0.0040324647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041750114,0.00025238894,0.0014501456,0.0006531661,0.000060803002,0.0006378749,0.0002455833,0.11399539,0.045147106,0.15404555,0.095703915,0.5873906],"study_design_scores_gemma":[0.0002989906,0.0003298957,0.0004128127,0.00007969943,0.000045665944,0.00097447314,0.00011551209,0.68607527,0.012553556,0.10897957,0.19007674,0.00005788406],"about_ca_topic_score_codex":0.002046647,"about_ca_topic_score_gemma":0.0022540842,"teacher_disagreement_score":0.010208172,"about_ca_system_score_codex":0.0006705831,"about_ca_system_score_gemma":0.0016769231,"threshold_uncertainty_score":0.034149706},"labels":[],"label_agreement":null},{"id":"W2110186914","doi":"10.1109/ride.1993.281914","title":"Semipermeable transactions and semantics-based concurrency control for multidatabases","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Serializability; Computer science; Concurrency; Semantics (computer science); Database transaction; Concurrency control; Distributed computing; Distributed concurrency control; Programming language; Theoretical computer science; Transaction processing; Distributed transaction","score_opus":0.022890961138949003,"score_gpt":0.23345068807551084,"score_spread":0.21055972693656183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110186914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024013652,0.0017081266,0.96570265,0.001208081,0.00016374973,0.000070181755,0.000055770448,0.00053027144,0.0065475595],"genre_scores_gemma":[0.7840831,0.0017611298,0.20561285,0.00037973112,0.0004431305,0.0002915089,0.00017855594,0.00024078874,0.00700919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410653,0.0017314687,0.00053326075,0.0006608936,0.0025667846,0.00040111112],"domain_scores_gemma":[0.9933128,0.002801676,0.00078477483,0.0018587855,0.00083262846,0.00040940222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003994097,0.00057799916,0.00076116185,0.0011254847,0.0011934208,0.004919636,0.0024143024,0.0016431812,0.0018182123],"category_scores_gemma":[0.008951794,0.00081851793,0.0010278235,0.0013157442,0.0066546374,0.010081651,0.003622059,0.0029212239,0.0003249302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012420838,0.000041534113,0.0002686419,0.000096737465,0.000024204162,0.00016573814,0.00057610514,0.034566324,0.0033999344,0.9367967,0.0007710487,0.023168813],"study_design_scores_gemma":[0.00004816459,0.000055768312,0.000098947,0.00004182394,0.000017845647,0.00013472585,0.000112622205,0.10478334,0.0036266062,0.88021505,0.010832406,0.000032824544],"about_ca_topic_score_codex":0.0016130352,"about_ca_topic_score_gemma":0.0010101334,"teacher_disagreement_score":0.004919636,"about_ca_system_score_codex":0.0018750795,"about_ca_system_score_gemma":0.0017850557,"threshold_uncertainty_score":0.021123052},"labels":[],"label_agreement":null},{"id":"W2110472399","doi":"10.1109/imtc.2005.1604597","title":"Test Control via DOS Middleware Instrumentation","year":2006,"lang":"en","type":"article","venue":"2005 IEEE Instrumentationand Measurement Technology Conference Proceedings","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Middleware (distributed applications); Distributed computing; Layer (electronics); Distributed object; Process (computing); Operating system; Embedded system; Common Object Request Broker Architecture","score_opus":0.015529022601886816,"score_gpt":0.21435073687514755,"score_spread":0.19882171427326073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110472399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14689472,0.00058023946,0.7713259,0.0008800227,0.0003561659,0.00039142888,0.00010989829,0.055714108,0.02374748],"genre_scores_gemma":[0.9571321,0.000121418525,0.03576813,0.0003381044,0.00007835759,0.00014769906,0.00007596576,0.0009511182,0.005387044],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949403,0.0011626438,0.00040061265,0.0010206302,0.002013531,0.00046219333],"domain_scores_gemma":[0.9868422,0.0039161397,0.0020145834,0.0046425853,0.0019475652,0.00063687004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033166143,0.00086008816,0.0008559488,0.001361885,0.00068266876,0.0028642523,0.001678766,0.0008443644,0.004520226],"category_scores_gemma":[0.015809493,0.0004215325,0.0003411625,0.0004705902,0.0017482003,0.0023480922,0.0022795007,0.0018295271,0.00133396],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002407474,0.0006700125,0.036587995,0.0006294488,0.00016323708,0.0020996097,0.004404076,0.071425594,0.3047789,0.15716246,0.011439771,0.40823138],"study_design_scores_gemma":[0.00021709218,0.00069372664,0.0082001025,0.00019233282,0.000110102614,0.001432708,0.0004680519,0.43881202,0.4388431,0.05218719,0.058672786,0.00017070549],"about_ca_topic_score_codex":0.00064886373,"about_ca_topic_score_gemma":0.00036881093,"teacher_disagreement_score":0.004520226,"about_ca_system_score_codex":0.0014570693,"about_ca_system_score_gemma":0.0009244442,"threshold_uncertainty_score":0.017540097},"labels":[],"label_agreement":null},{"id":"W2110961887","doi":"10.1145/1402946.1402994","title":"Satellitelab","year":2008,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Computer science; Testbed; Computer network; The Internet; Enhanced Data Rates for GSM Evolution; Distributed computing; Telecommunications; Operating system","score_opus":0.04239621926371471,"score_gpt":0.2758941930551798,"score_spread":0.2334979737914651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110961887","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031964537,0.0023628485,0.13756207,0.0030590948,0.0016984472,0.0014627378,0.027916914,0.20534888,0.5886245],"genre_scores_gemma":[0.2711311,0.0023628173,0.14139861,0.0022918305,0.0007261312,0.0018609518,0.11421017,0.021259049,0.4447593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878925,0.00022383584,0.00006041876,0.00023448691,0.000538353,0.00015369641],"domain_scores_gemma":[0.9971607,0.00030341296,0.0001507265,0.00078695803,0.001086635,0.00051159377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015769468,0.0009105248,0.000689556,0.0013068583,0.0008901572,0.00193121,0.0016461601,0.00073759723,0.16043532],"category_scores_gemma":[0.0029941595,0.00044171078,0.00046156056,0.0012741764,0.0005632661,0.0020282075,0.0019395439,0.0011385459,0.08329345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014255545,0.0003438092,0.0048240856,0.0007733583,0.00008237927,0.0003030609,0.0005041359,0.006997695,0.023651654,0.032392245,0.6615683,0.26713368],"study_design_scores_gemma":[0.00022251897,0.00033790624,0.0014690316,0.00005951212,0.000032464173,0.00020656013,0.00012571242,0.011885841,0.008312374,0.004008938,0.97330475,0.000034555622],"about_ca_topic_score_codex":0.0028560995,"about_ca_topic_score_gemma":0.002913055,"teacher_disagreement_score":0.16043532,"about_ca_system_score_codex":0.001022678,"about_ca_system_score_gemma":0.0017700654,"threshold_uncertainty_score":0.5367096},"labels":[],"label_agreement":null},{"id":"W2111012197","doi":"10.1142/s0129626406002496","title":"VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Voting; Computer science; Byzantine fault tolerance; Quantum Byzantine agreement; Byzantine architecture; Distributed computing; Mechanism (biology); Computer network; Fault tolerance","score_opus":0.0067876714183110224,"score_gpt":0.20582957849625697,"score_spread":0.19904190707794595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111012197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06954865,0.00043494586,0.91985244,0.00056647946,0.000107299646,0.00021503842,0.00007478089,0.000983137,0.008217223],"genre_scores_gemma":[0.7334625,0.00054850534,0.25411314,0.00021073343,0.00021982341,0.00067832856,0.00012726686,0.00014293668,0.010496774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441457,0.0022800837,0.00046063768,0.0009595904,0.0012252778,0.00065982697],"domain_scores_gemma":[0.99175006,0.003978241,0.0013525209,0.001767472,0.0008441812,0.00030755592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048974818,0.0007806709,0.00094018615,0.0011839512,0.0016666047,0.0035227973,0.0019843867,0.001991646,0.003300329],"category_scores_gemma":[0.011327785,0.0005236559,0.0006630667,0.0008772305,0.002688241,0.006524981,0.002592984,0.0016287953,0.00085202866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026510362,0.000064182,0.00046754317,0.00015312571,0.000028005263,0.00024484313,0.0007520745,0.033888053,0.0074447533,0.9232696,0.0013786949,0.032043982],"study_design_scores_gemma":[0.00042784197,0.00031969056,0.00027635097,0.000089264584,0.00007369081,0.000352388,0.00024217734,0.24821442,0.020670578,0.6890437,0.040207278,0.00008270463],"about_ca_topic_score_codex":0.00043609884,"about_ca_topic_score_gemma":0.00037199384,"teacher_disagreement_score":0.0048974818,"about_ca_system_score_codex":0.0009473975,"about_ca_system_score_gemma":0.000816684,"threshold_uncertainty_score":0.025900662},"labels":[],"label_agreement":null},{"id":"W2111670490","doi":"10.1109/icdcs.2003.1203495","title":"Modular composition and verification of transaction processing protocols","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Two-phase commit protocol; Correctness; Computer science; Protocol (science); Modular design; Commit; Distributed computing; Transaction processing; Distributed transaction; Compensating transaction; Database transaction; Theoretical computer science; Programming language; Database","score_opus":0.016048529772426087,"score_gpt":0.2648577538144938,"score_spread":0.24880922404206768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111670490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02942413,0.0002472314,0.9663698,0.00019419949,0.000056709745,0.00011206171,0.000026287154,0.0007023931,0.0028672128],"genre_scores_gemma":[0.7065206,0.00048511298,0.2901542,0.00011722327,0.000102186146,0.000309478,0.00017997363,0.00016263714,0.0019686164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418277,0.0022082762,0.00040050794,0.0006174018,0.0022601802,0.00033084975],"domain_scores_gemma":[0.994317,0.0027143944,0.00055671774,0.0012754666,0.0009278991,0.00020857074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004883535,0.0005331089,0.00047375835,0.000857828,0.0009852964,0.0016552118,0.0012731325,0.0009792994,0.001251458],"category_scores_gemma":[0.00900465,0.0005730475,0.000890016,0.00074630417,0.0035227453,0.002887584,0.002921524,0.0014881061,0.00050536456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022616559,0.000087699984,0.0014263602,0.00036356802,0.00009250137,0.00084406906,0.0012583875,0.08835892,0.03821989,0.7860912,0.0012005316,0.0818307],"study_design_scores_gemma":[0.00008255294,0.00018056414,0.00048513347,0.000084742336,0.00007352404,0.00035649035,0.0002167156,0.36582994,0.04420543,0.57260203,0.015824921,0.000057929745],"about_ca_topic_score_codex":0.00089358183,"about_ca_topic_score_gemma":0.00041806695,"teacher_disagreement_score":0.004883535,"about_ca_system_score_codex":0.00084490847,"about_ca_system_score_gemma":0.0016648292,"threshold_uncertainty_score":0.025826931},"labels":[],"label_agreement":null},{"id":"W2111722155","doi":"10.1109/ideas.1997.625700","title":"Multi-view memory to support OS locking for transaction systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Lock (firearm); Thread (computing); Transaction processing; Database transaction; Operating system; Embedded system; Software; Database","score_opus":0.05564316449502463,"score_gpt":0.2729787938221966,"score_spread":0.21733562932717196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111722155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07274422,0.004064135,0.908849,0.0003722263,0.00031638358,0.00014768275,0.00016463782,0.0038701661,0.009471502],"genre_scores_gemma":[0.749593,0.0010774345,0.24024272,0.00034446726,0.00009874736,0.00018200633,0.00035096527,0.00042121173,0.0076893996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942833,0.0001265734,0.000038780596,0.00007759304,0.00021936953,0.00010923824],"domain_scores_gemma":[0.99855286,0.00045131028,0.00012395479,0.0005687615,0.00023757694,0.000065544795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009591897,0.00040268383,0.000498352,0.00038801247,0.00040446644,0.0021281312,0.002222713,0.0007717718,0.0045141513],"category_scores_gemma":[0.0030427275,0.0003075357,0.00042550635,0.00044592962,0.00047009945,0.0032902935,0.0012446435,0.001170414,0.00078663835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014243814,0.00032674448,0.006662372,0.0008509329,0.00010046458,0.00074075785,0.0006696997,0.07467225,0.095828675,0.49279398,0.010369221,0.31556043],"study_design_scores_gemma":[0.00023886436,0.0013610101,0.0010886684,0.0002692993,0.00020858375,0.0014164419,0.00032757077,0.62853307,0.14836983,0.10232255,0.1157691,0.00009500199],"about_ca_topic_score_codex":0.00066434534,"about_ca_topic_score_gemma":0.0011124897,"teacher_disagreement_score":0.0045141513,"about_ca_system_score_codex":0.00070176536,"about_ca_system_score_gemma":0.0007649489,"threshold_uncertainty_score":0.015101373},"labels":[],"label_agreement":null},{"id":"W2112434174","doi":"10.1145/1187436.1216586","title":"Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Synchronization (alternating current); Overhead (engineering); Shared memory; Abstraction; Distributed shared memory; Parallel computing; Consistency (knowledge bases); Memory management; Computer network; Uniform memory access; Operating system; Overlay","score_opus":0.006637733434060977,"score_gpt":0.2543754159048994,"score_spread":0.24773768247083844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112434174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14611529,0.0012351535,0.8409176,0.00055869203,0.00016593479,0.00022314704,0.000074989075,0.005974217,0.0047349567],"genre_scores_gemma":[0.7963099,0.00024423542,0.20149718,0.00008345939,0.000043707434,0.00011452051,0.00008641915,0.00023925053,0.0013813779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978194,0.0005601378,0.00014713238,0.00020803876,0.0009735514,0.0002916429],"domain_scores_gemma":[0.99627054,0.0009029177,0.00041658714,0.0012992601,0.00084932806,0.00026137367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628426,0.0005512121,0.000755226,0.0005845602,0.00055908575,0.0013170708,0.002083623,0.0008753659,0.001607987],"category_scores_gemma":[0.0060140705,0.0004858776,0.00041827981,0.00064874935,0.00062886043,0.0015927395,0.0022745791,0.0015222187,0.00037601602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013846988,0.0007559196,0.006078693,0.00092671905,0.00027905777,0.00063843216,0.0006728763,0.3927115,0.19339529,0.08134873,0.005567079,0.3162409],"study_design_scores_gemma":[0.00046897723,0.0009935924,0.0028002416,0.00007489991,0.00025365487,0.0003873415,0.0002869782,0.8514172,0.09973347,0.019793505,0.023663994,0.0001261563],"about_ca_topic_score_codex":0.0013750847,"about_ca_topic_score_gemma":0.0010930639,"teacher_disagreement_score":0.002083623,"about_ca_system_score_codex":0.00061747513,"about_ca_system_score_gemma":0.001448923,"threshold_uncertainty_score":0.00879401},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044649816998303886,"score_gpt":0.2969985777953138,"score_spread":0.2523487607970099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112527958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024127575,0.0026730928,0.9545694,0.001631581,0.0002090422,0.0001835933,0.0003711981,0.00041346528,0.015820982],"genre_scores_gemma":[0.6112283,0.0033581103,0.3743851,0.00088348374,0.00070108235,0.0006294785,0.0007677842,0.00021962126,0.007826959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992069,0.0023917675,0.0010315495,0.0010830044,0.0028928232,0.0005319468],"domain_scores_gemma":[0.9878407,0.0066860113,0.0013868647,0.002240202,0.0014999803,0.00034620124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047610393,0.0006814023,0.00075693434,0.0012840084,0.001154748,0.0039399555,0.002604337,0.0018812921,0.0019173569],"category_scores_gemma":[0.015123383,0.00077477284,0.0009741287,0.0023605905,0.0046763173,0.00833667,0.0031356614,0.0031787993,0.00049472536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043698208,0.000038343132,0.00038721794,0.00017862095,0.000022750792,0.0005031926,0.0005667345,0.012771364,0.0025308994,0.965076,0.0013427258,0.016538434],"study_design_scores_gemma":[0.00007298148,0.00009162417,0.0004016838,0.0001195807,0.00005377669,0.00075621164,0.00028607185,0.076322764,0.008460076,0.87642455,0.03695431,0.000056410612],"about_ca_topic_score_codex":0.0020522508,"about_ca_topic_score_gemma":0.0013191352,"teacher_disagreement_score":0.0047610393,"about_ca_system_score_codex":0.0013150302,"about_ca_system_score_gemma":0.0019858188,"threshold_uncertainty_score":0.025179088},"labels":[],"label_agreement":null},{"id":"W2112880133","doi":"10.1109/icpads.2010.67","title":"Multi-consistency Data Replication","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Consistency model; Computer science; Eventual consistency; Distributed computing; Sequential consistency; Replication (statistics); Correctness; Weak consistency; Replica; Causal consistency; Linearizability; Strong consistency; Consistency (knowledge bases); Scalability; Serializability; Data consistency; Algorithm; Transaction processing; Programming language; Operating system; Estimator; Database transaction; Distributed transaction","score_opus":0.05702123638455012,"score_gpt":0.31083243363795293,"score_spread":0.25381119725340284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112880133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016052853,0.0031624837,0.95495886,0.00066519104,0.0008006652,0.00075772096,0.0007069067,0.0039893505,0.018905848],"genre_scores_gemma":[0.45467183,0.002292998,0.5109927,0.0006575798,0.0005007848,0.0007091261,0.0022448078,0.0008592288,0.027070897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99231637,0.0012512892,0.0008022893,0.0013952856,0.0037879448,0.00044683664],"domain_scores_gemma":[0.98754334,0.001632558,0.0007394075,0.00675898,0.0030372136,0.00028848558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045238966,0.0007004233,0.0014358343,0.0016983408,0.0019548072,0.0035541062,0.00422093,0.0016129131,0.0063065095],"category_scores_gemma":[0.010503241,0.00061509747,0.001467697,0.0026133684,0.0011393945,0.004546023,0.0050867437,0.0016023443,0.0035788433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009847069,0.00036192333,0.0066786413,0.0027200119,0.0005945289,0.0019033998,0.0012839852,0.05333445,0.08768982,0.18664642,0.03564568,0.62215644],"study_design_scores_gemma":[0.00040972736,0.0009644912,0.0035973166,0.00044160525,0.00041182342,0.006867027,0.0007841112,0.27225652,0.15864706,0.13048781,0.42476064,0.0003719356],"about_ca_topic_score_codex":0.0010082398,"about_ca_topic_score_gemma":0.0008632553,"teacher_disagreement_score":0.0063065095,"about_ca_system_score_codex":0.00092822115,"about_ca_system_score_gemma":0.0018964172,"threshold_uncertainty_score":0.023924947},"labels":[],"label_agreement":null},{"id":"W2113401164","doi":"10.1145/1993316.1993573","title":"Synchronization via scheduling","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Programmer; Debugging; Scheduling (production processes); Rollback; Distributed computing; Parallel computing; Synchronization (alternating current); Programming language; Database transaction","score_opus":0.031814918067509676,"score_gpt":0.23704277231943496,"score_spread":0.2052278542519253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113401164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016554384,0.00035687015,0.9580816,0.00031450493,0.00032185848,0.00025211673,0.00023444081,0.007858818,0.016025385],"genre_scores_gemma":[0.5569276,0.00072252733,0.41691855,0.0003600981,0.00033355062,0.0006054666,0.00081769604,0.0020843297,0.021230225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760854,0.000706039,0.00017828835,0.00050056115,0.0007328525,0.00027375206],"domain_scores_gemma":[0.9966808,0.0009356748,0.00027736922,0.0015786315,0.0003976887,0.00012983319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648848,0.0008696471,0.00079210044,0.00096071936,0.0009830887,0.0019385288,0.0013212664,0.0007502403,0.008861914],"category_scores_gemma":[0.00579852,0.00048860663,0.00061202503,0.0011618271,0.0013982694,0.0025190148,0.002332144,0.0012686453,0.0021897971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075564435,0.0002717347,0.0031239686,0.0005561688,0.00018779731,0.00044599664,0.0012182904,0.13947912,0.050164316,0.35613236,0.028328665,0.41933593],"study_design_scores_gemma":[0.00024434636,0.0003586569,0.0009459963,0.00009341244,0.00011477814,0.00034475254,0.00021526054,0.50683737,0.058543973,0.29352516,0.13866797,0.00010832665],"about_ca_topic_score_codex":0.0021371474,"about_ca_topic_score_gemma":0.002280964,"teacher_disagreement_score":0.008861914,"about_ca_system_score_codex":0.0010190508,"about_ca_system_score_gemma":0.0021547743,"threshold_uncertainty_score":0.029646099},"labels":[],"label_agreement":null},{"id":"W2113863982","doi":"10.1002/cpe.3659","title":"Dekker's mutual exclusion algorithm made RW‐safe","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Mutual exclusion; Correctness; Algorithm; Computer science; Tournament; Parallel computing; Mathematics; Theoretical computer science; Operating system; Combinatorics","score_opus":0.03383703133070081,"score_gpt":0.32511015342923744,"score_spread":0.2912731220985366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113863982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1462864,0.000115673836,0.8354575,0.0004290527,0.00021835578,0.00021395969,0.00009678535,0.002416252,0.014765971],"genre_scores_gemma":[0.6233167,0.00006442648,0.3629745,0.00015715163,0.00003373056,0.00016724573,0.00024161625,0.00032069863,0.012723944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866784,0.00023432114,0.00013958369,0.00025815968,0.00040208327,0.0002981056],"domain_scores_gemma":[0.9976037,0.00083515653,0.00020299183,0.000673824,0.0005567588,0.00012749812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014137009,0.0004944088,0.0006992755,0.0004688547,0.001206746,0.001278945,0.0015408171,0.0008907226,0.0042440873],"category_scores_gemma":[0.005474781,0.00026875763,0.00061168266,0.00036248172,0.00081377244,0.0012783982,0.0016741123,0.0010904528,0.0010271275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001608043,0.00032950987,0.0042997445,0.00023478238,0.00011574509,0.00039925068,0.0008719946,0.23113917,0.053746644,0.19664456,0.009722483,0.500888],"study_design_scores_gemma":[0.00021681689,0.00026091875,0.0007794149,0.000032225904,0.000048033908,0.00027643266,0.000116578616,0.87775815,0.046563305,0.057436645,0.016453752,0.000057749632],"about_ca_topic_score_codex":0.0026562524,"about_ca_topic_score_gemma":0.002535192,"teacher_disagreement_score":0.0042440873,"about_ca_system_score_codex":0.0007789347,"about_ca_system_score_gemma":0.0022005308,"threshold_uncertainty_score":0.014197886},"labels":[],"label_agreement":null},{"id":"W2114133384","doi":"10.1109/tce.2007.381704","title":"Message Replication and Consumer Database Synchronization Algorithms and System for Highly Available High Performance Intelligent Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Replication (statistics); Asynchronous communication; Distributed computing; High availability; Synchronization (alternating current); Distributed database; Fault tolerance; Service (business); Data synchronization; Computer network; Wireless sensor network","score_opus":0.012979732302070342,"score_gpt":0.23804563600739323,"score_spread":0.2250659037053229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114133384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022648001,0.00031087542,0.9712266,0.0003547772,0.00011657874,0.000105860556,0.000034631994,0.0017812001,0.0034215366],"genre_scores_gemma":[0.46954498,0.0002866831,0.5168012,0.00020213512,0.0001957579,0.00032815262,0.00020376605,0.00019802756,0.012239347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987888,0.00034352962,0.0000623176,0.00024687767,0.0004882769,0.000070261754],"domain_scores_gemma":[0.99842846,0.00042782834,0.00017057612,0.0004115103,0.00048109877,0.000080598584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951213,0.00032053838,0.00045988575,0.00072692765,0.00086877204,0.0011568256,0.0018983786,0.0007981254,0.0032868034],"category_scores_gemma":[0.004074632,0.00022893018,0.00031937286,0.00079781795,0.00064228993,0.0018550802,0.00092549244,0.000871984,0.0009209811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011357097,0.00027686506,0.0030662294,0.0002500416,0.0001195894,0.00034293256,0.0008086489,0.12137444,0.044866275,0.37302193,0.018609429,0.436128],"study_design_scores_gemma":[0.00017357727,0.00019185588,0.0007591753,0.000016917396,0.00005322978,0.00027563112,0.000099911165,0.9202565,0.021679014,0.03576889,0.020672143,0.00005314588],"about_ca_topic_score_codex":0.0019954399,"about_ca_topic_score_gemma":0.0018385621,"teacher_disagreement_score":0.0032868034,"about_ca_system_score_codex":0.001184404,"about_ca_system_score_gemma":0.0013622748,"threshold_uncertainty_score":0.010995448},"labels":[],"label_agreement":null},{"id":"W2114813502","doi":"10.1109/soac.1991.143905","title":"A dynamic granularity locking protocol for tree-structured databases","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Granularity; Computer science; Protocol (science); Distributed computing; Two-phase commit protocol; Database transaction; Two-phase locking; Lock (firearm); Transaction processing; Database; Computer network; Online transaction processing; Distributed transaction; Operating system; Engineering","score_opus":0.04978930693228227,"score_gpt":0.31396267292608465,"score_spread":0.26417336599380237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114813502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051639616,0.00059945893,0.98771,0.00035156502,0.00021800864,0.00028694925,0.00019980429,0.0021520304,0.0033183245],"genre_scores_gemma":[0.24904776,0.001799583,0.73334956,0.0006507102,0.00031927784,0.00117544,0.0015413382,0.0005235719,0.011592793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787664,0.00041991938,0.00032310022,0.00020939349,0.0010106218,0.00016037143],"domain_scores_gemma":[0.9978794,0.00047975185,0.00019540003,0.00069778523,0.0005722229,0.00017544317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019239518,0.00036517586,0.0005343737,0.0009913604,0.0010385053,0.0021540031,0.002099662,0.001178048,0.0045908466],"category_scores_gemma":[0.0046559297,0.00042800664,0.0004287049,0.0018520252,0.0009471795,0.004514316,0.00267234,0.0017252266,0.0013738981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084981066,0.00028774244,0.0013238683,0.0008850819,0.00011637515,0.00083397725,0.0010618992,0.03820345,0.07194569,0.29147863,0.036483023,0.55653054],"study_design_scores_gemma":[0.00059357553,0.00072372326,0.0006955894,0.00022768216,0.00019869438,0.0027391429,0.0003824029,0.41897482,0.08472687,0.15205565,0.33837453,0.00030731715],"about_ca_topic_score_codex":0.00079847465,"about_ca_topic_score_gemma":0.00063817366,"teacher_disagreement_score":0.0045908466,"about_ca_system_score_codex":0.00056452723,"about_ca_system_score_gemma":0.0015895783,"threshold_uncertainty_score":0.015357912},"labels":[],"label_agreement":null},{"id":"W2114913558","doi":"10.1109/icde.2006.82","title":"Inferring a Serialization Order for Distributed Transactions","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Serialization; Computer science; Database; Distributed database; Transaction processing; Concurrency control; Database transaction; Distributed computing; Operating system","score_opus":0.009280610056148332,"score_gpt":0.22829145203840873,"score_spread":0.2190108419822604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114913558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.149499,0.00035549444,0.84078,0.00049006345,0.00017225477,0.0002161721,0.0011427318,0.004267036,0.0030772141],"genre_scores_gemma":[0.67539907,0.0004836618,0.31723955,0.00014230423,0.00020833094,0.00019606638,0.003458824,0.00046465595,0.0024074616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961134,0.000604287,0.00042011627,0.00084953435,0.001798418,0.00021423885],"domain_scores_gemma":[0.97527754,0.007517556,0.002064291,0.0094142975,0.005233159,0.0004931977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027524384,0.0008250181,0.0006417359,0.0021633273,0.0008757572,0.0022928491,0.0009256044,0.00087813195,0.0013046756],"category_scores_gemma":[0.024550878,0.0009935952,0.0005384188,0.0016417743,0.0010120802,0.0034936704,0.0009835365,0.0021717637,0.0008096108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002266353,0.00074635394,0.10098897,0.00044710463,0.00018686324,0.0012450543,0.0016810894,0.1915779,0.08516454,0.10824561,0.014275544,0.49317467],"study_design_scores_gemma":[0.0001556577,0.00024502198,0.007265164,0.00009042518,0.0000843025,0.00045285217,0.0002677751,0.8111462,0.07075964,0.09483713,0.0146121215,0.00008363233],"about_ca_topic_score_codex":0.0025677495,"about_ca_topic_score_gemma":0.0046870406,"teacher_disagreement_score":0.0027524384,"about_ca_system_score_codex":0.0009495844,"about_ca_system_score_gemma":0.0024911761,"threshold_uncertainty_score":0.0145564675},"labels":[],"label_agreement":null},{"id":"W2115192502","doi":"10.1109/saci.2011.5873012","title":"Observability and controllability of autonomic computing systems for composed Web services","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University; University of Ottawa","funders":"","keywords":"Observability; Computer science; Distributed computing; Controllability; Cloud computing; Autonomic computing; Provisioning; Computer network; Operating system","score_opus":0.02950443234742769,"score_gpt":0.23345866647334376,"score_spread":0.20395423412591607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115192502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12667605,0.00022947464,0.86638653,0.00031790807,0.00004375513,0.000056814668,0.000054974837,0.00031672302,0.0059177633],"genre_scores_gemma":[0.9859368,0.00013399226,0.012344664,0.000034209417,0.000031227144,0.000105546016,0.000051535848,0.00003091132,0.0013310106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987161,0.00031905217,0.00006960481,0.00021311913,0.0005114071,0.00017067375],"domain_scores_gemma":[0.99736804,0.00147504,0.00056219444,0.00021266204,0.00028879178,0.0000933114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014094381,0.00058164605,0.00064649805,0.0006949698,0.0007289206,0.0019675668,0.0006681481,0.00073427055,0.0017253984],"category_scores_gemma":[0.006283259,0.00034306623,0.001182241,0.0003367173,0.0017351098,0.0014541979,0.0011101146,0.0011197148,0.00013598758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018699298,0.00011622114,0.0024623417,0.00017590976,0.0001389643,0.00058040064,0.0005438885,0.6934312,0.014420896,0.27241087,0.00041870886,0.015113525],"study_design_scores_gemma":[0.000014380376,0.000041882482,0.00038767207,0.0000070582723,0.00001561322,0.000027769462,0.000024532632,0.9638325,0.00085657556,0.0345357,0.0002483762,0.000008018056],"about_ca_topic_score_codex":0.0054318304,"about_ca_topic_score_gemma":0.0030337754,"teacher_disagreement_score":0.0054318304,"about_ca_system_score_codex":0.0011558221,"about_ca_system_score_gemma":0.0013165051,"threshold_uncertainty_score":0.010800421},"labels":[],"label_agreement":null},{"id":"W2119297889","doi":"10.1109/pacrim.1989.48353","title":"Multicast communications in the distributed system T-Shoshin","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Reliable multicast; Pragmatic General Multicast; Reliability (semiconductor); Computer network; Protocol Independent Multicast; Xcast; Distributed computing; Communication in small groups; IP multicast; Source-specific multicast; Datagram","score_opus":0.03292359863549578,"score_gpt":0.27661955398510213,"score_spread":0.24369595534960636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119297889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114205465,0.0015762175,0.83320385,0.0013184637,0.00022416875,0.00017839322,0.000113934315,0.0017584655,0.047421094],"genre_scores_gemma":[0.7689101,0.0010804293,0.2065153,0.00035843483,0.00011636708,0.00022617781,0.00018322868,0.00015031257,0.022459563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992336,0.0002870505,0.00004487725,0.000088364715,0.00027136892,0.00007467287],"domain_scores_gemma":[0.9996662,0.00010834964,0.000029650197,0.000073398594,0.00009201226,0.000030326364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086550385,0.00020150654,0.00037144442,0.00033779792,0.0006395866,0.0014028384,0.00066847296,0.00075396005,0.0017496587],"category_scores_gemma":[0.0012830805,0.0002318725,0.00031870036,0.000525007,0.00070424454,0.0017590524,0.0008326354,0.00081543473,0.0005041228],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034274723,0.00012909209,0.0013717645,0.00024939326,0.000030186688,0.0006907427,0.001194937,0.120830394,0.018150233,0.7263046,0.007095405,0.1236105],"study_design_scores_gemma":[0.00019366434,0.00029679085,0.0004931531,0.00007533759,0.000043580934,0.00067450927,0.00024352298,0.76429045,0.009761901,0.14711191,0.0767579,0.00005734466],"about_ca_topic_score_codex":0.002282371,"about_ca_topic_score_gemma":0.001825783,"teacher_disagreement_score":0.002282371,"about_ca_system_score_codex":0.0009366441,"about_ca_system_score_gemma":0.0010014757,"threshold_uncertainty_score":0.0067958236},"labels":[],"label_agreement":null},{"id":"W2119622732","doi":"10.1109/iwsm.1996.534150","title":"Specifying lifecycles of object interactions within distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Relation (database); Computer science; Distributed computing; Object (grammar); Distributed object; Identification (biology); State (computer science); Interface (matter); Human–computer interaction; Data mining; Programming language; Artificial intelligence; Operating system","score_opus":0.03543326295235277,"score_gpt":0.24722943240587805,"score_spread":0.21179616945352528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119622732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031419676,0.00027897017,0.990855,0.00042186232,0.000041535975,0.00017768817,0.00016293678,0.00096729863,0.003952744],"genre_scores_gemma":[0.09070477,0.0009915282,0.8994127,0.00031289257,0.0001095727,0.0009991529,0.0009337421,0.0006617331,0.005873854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482274,0.0017878062,0.0011185532,0.0005719485,0.0012425306,0.0004564951],"domain_scores_gemma":[0.9914259,0.0041318918,0.0010344009,0.002221881,0.0008706065,0.00031538587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076340884,0.001425727,0.0009239805,0.0025021846,0.0021075106,0.0067704464,0.0026691977,0.0035819989,0.0025294602],"category_scores_gemma":[0.014429586,0.0021707574,0.0026734879,0.0018031895,0.004001367,0.011381683,0.003860867,0.0045916485,0.0016651842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040872063,0.00009116717,0.0012983994,0.00015694932,0.000029328354,0.00060443836,0.0020689433,0.041802794,0.0031258615,0.90912795,0.0027065743,0.038946826],"study_design_scores_gemma":[0.00007303436,0.00010904079,0.0003989336,0.00048468885,0.00008401249,0.00063742476,0.00075503386,0.25798243,0.010388777,0.57314676,0.15577398,0.00016587126],"about_ca_topic_score_codex":0.008480888,"about_ca_topic_score_gemma":0.011402321,"teacher_disagreement_score":0.008480888,"about_ca_system_score_codex":0.0028937636,"about_ca_system_score_gemma":0.0035708144,"threshold_uncertainty_score":0.040373385},"labels":[],"label_agreement":null},{"id":"W2120152386","doi":"10.1007/pl00008920","title":"On the power of shared object types to implement one-resilient Consensus","year":2000,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Object (grammar); Computer science; Asynchronous communication; Set (abstract data type); Process (computing); Power (physics); Consensus; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language; Artificial intelligence; Computer network; Multi-agent system; Physics","score_opus":0.0179501018062648,"score_gpt":0.26072369786078337,"score_spread":0.24277359605451856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120152386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086756974,0.0009371929,0.8853475,0.0025182047,0.00055789953,0.000110524765,0.00007305059,0.0012937912,0.022404945],"genre_scores_gemma":[0.8260117,0.0007793445,0.16219294,0.0008576192,0.00035772988,0.00020798692,0.0001212831,0.00055509893,0.008916302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670523,0.0011121058,0.00028703833,0.00036097475,0.0010452035,0.00048935664],"domain_scores_gemma":[0.96604776,0.021832671,0.0010328356,0.008399566,0.0020144426,0.00067268487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069093886,0.00059459044,0.0010885389,0.0015046276,0.0022896044,0.003148955,0.0029591236,0.00196808,0.0039587375],"category_scores_gemma":[0.026016813,0.00089762366,0.0009435914,0.0016133416,0.007945944,0.011613859,0.0043422296,0.004199585,0.0008031276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065204274,0.00008750942,0.00085180555,0.00013817224,0.000041825497,0.00013469964,0.0006132868,0.06964306,0.0031418107,0.8624266,0.0039328462,0.05833636],"study_design_scores_gemma":[0.00012574783,0.00010063656,0.00016275245,0.0000396813,0.0000562511,0.000084946594,0.000096557385,0.23579475,0.0035540557,0.7554674,0.0044611376,0.000056181838],"about_ca_topic_score_codex":0.0020685783,"about_ca_topic_score_gemma":0.002062828,"teacher_disagreement_score":0.0069093886,"about_ca_system_score_codex":0.0016377416,"about_ca_system_score_gemma":0.0011175026,"threshold_uncertainty_score":0.036540747},"labels":[],"label_agreement":null},{"id":"W2120182417","doi":"10.1007/978-3-642-17653-1_27","title":"Fast Local-Spin Abortable Mutual Exclusion with Bounded Space","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Bounded function; Critical section; Theoretical computer science; Suzuki-Kasami algorithm; Abort; Algorithm; Discrete mathematics; Distributed computing; Mathematics; Programming language","score_opus":0.00772564879268011,"score_gpt":0.22497021202419698,"score_spread":0.21724456323151686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120182417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07105995,0.0005599674,0.8993226,0.00035284183,0.0002603363,0.00014125704,0.00016251238,0.008676607,0.019463826],"genre_scores_gemma":[0.83638734,0.00018886998,0.14697227,0.00016088563,0.00008695964,0.00026801578,0.00031275913,0.0007672921,0.014855612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844426,0.00031777666,0.00006431787,0.00014841344,0.0006514213,0.00037382837],"domain_scores_gemma":[0.99654937,0.0012438743,0.0001570159,0.0013647192,0.0004631033,0.00022192768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359861,0.0007936988,0.0013729086,0.00064742815,0.002170273,0.00190721,0.002331089,0.000838917,0.008548921],"category_scores_gemma":[0.0035192238,0.00054704375,0.00050951063,0.0009678787,0.001395024,0.0026854873,0.0044329357,0.0019297411,0.0013086537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00521503,0.0005208469,0.0021293845,0.0005772603,0.00017502013,0.00040189744,0.0011904739,0.18515977,0.03331781,0.3117354,0.024456847,0.43512028],"study_design_scores_gemma":[0.0003733106,0.00035963487,0.0004872895,0.000046854508,0.00009329264,0.00016435931,0.00018938308,0.7779224,0.027703054,0.18061815,0.011971852,0.000070386195],"about_ca_topic_score_codex":0.002157226,"about_ca_topic_score_gemma":0.0063889474,"teacher_disagreement_score":0.008548921,"about_ca_system_score_codex":0.0011164454,"about_ca_system_score_gemma":0.0018932465,"threshold_uncertainty_score":0.028598964},"labels":[],"label_agreement":null},{"id":"W2120196685","doi":"10.1016/j.jpdc.2008.05.005","title":"A new analytical method for parallel, diffusion-type load balancing","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Mathematical proof; Load balancing (electrical power); Obstacle; Type (biology); Distributed computing; Key (lock); Parallel computing; Diffusion; Algorithm; Theoretical computer science; Mathematics","score_opus":0.02498088714067866,"score_gpt":0.29479851399700296,"score_spread":0.2698176268563243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120196685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012273216,0.00021513917,0.9946774,0.00013789038,0.00032063408,0.00003863403,0.000019144903,0.00028628172,0.0030776102],"genre_scores_gemma":[0.11689644,0.0011330887,0.84902936,0.0004244264,0.00057667616,0.00036000626,0.00011954678,0.0006903174,0.030770168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.000090437774,0.00002104919,0.000058084268,0.0002829747,0.00003294216],"domain_scores_gemma":[0.9994406,0.00018226498,0.00003905997,0.00006578011,0.00022726851,0.00004489143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081178476,0.000796916,0.00088389235,0.0010592146,0.0010014847,0.0011002057,0.0021066233,0.0011313419,0.005075188],"category_scores_gemma":[0.002497652,0.00045997405,0.0007420873,0.0010671904,0.000884673,0.0016749894,0.001238267,0.0014521077,0.0018158416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002088649,0.00023031278,0.00059514004,0.0005039894,0.00012173965,0.00024966814,0.00043488885,0.20197023,0.0749736,0.3375267,0.020087073,0.36309776],"study_design_scores_gemma":[0.000025880001,0.000026703046,0.00007581801,0.000016892005,0.00001957654,0.00012146873,0.0000194505,0.9539886,0.00334601,0.02452209,0.017810833,0.000026646523],"about_ca_topic_score_codex":0.0017946435,"about_ca_topic_score_gemma":0.0021374759,"teacher_disagreement_score":0.005075188,"about_ca_system_score_codex":0.00093548297,"about_ca_system_score_gemma":0.0012697714,"threshold_uncertainty_score":0.016978204},"labels":[],"label_agreement":null},{"id":"W2120593045","doi":"10.1109/reldis.1989.72753","title":"An efficient kernel-level dependable multicast protocol for distributed systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Institut National Du Cancer; Simon Fraser University; Princeton University","keywords":"Multicast; Computer science; Computer network; Protocol Independent Multicast; Pragmatic General Multicast; Protocol (science); Distributed computing; Reliable multicast; Source-specific multicast; IP multicast; Overhead (engineering); Reliability (semiconductor); Distance Vector Multicast Routing Protocol; Xcast; Kernel (algebra); Internet Group Management Protocol; Communication in small groups; Operating system","score_opus":0.04706951977761003,"score_gpt":0.3207099925229586,"score_spread":0.2736404727453486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120593045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017017772,0.0008121559,0.975686,0.00025935372,0.00008884662,0.0001493774,0.000055495962,0.0018196644,0.0041113105],"genre_scores_gemma":[0.5582129,0.0010144562,0.43134195,0.00016187689,0.00015494587,0.00046052953,0.00051781785,0.00031231256,0.00782327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.00025754698,0.0000782038,0.00005500504,0.00035881097,0.000054322023],"domain_scores_gemma":[0.9993286,0.00019089122,0.000055882007,0.00019873014,0.00018985473,0.000035990884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010250239,0.00032658427,0.0004204954,0.00064452935,0.00077702606,0.001215836,0.0013255494,0.00078285666,0.0015514075],"category_scores_gemma":[0.0023587402,0.0002712169,0.0002248977,0.00069464074,0.00049350713,0.0022011632,0.001214546,0.0009225673,0.0005250498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008925727,0.0003006763,0.0011118369,0.00062967686,0.00009399307,0.00087979244,0.0009920043,0.078142606,0.11822808,0.24251916,0.019529356,0.5366803],"study_design_scores_gemma":[0.00022492374,0.00047532056,0.00070284447,0.00007130268,0.00010328446,0.000827608,0.00011909312,0.7652099,0.057110734,0.06582451,0.10924591,0.00008454822],"about_ca_topic_score_codex":0.0006463215,"about_ca_topic_score_gemma":0.00065571227,"teacher_disagreement_score":0.0015514075,"about_ca_system_score_codex":0.0005843697,"about_ca_system_score_gemma":0.00050179235,"threshold_uncertainty_score":0.0054209232},"labels":[],"label_agreement":null},{"id":"W2121367871","doi":"10.1109/ipdps.2001.925119","title":"Real-time computation: a formal definition and its applications","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Formalism (music); Computation; Expressive power; Formal description; Theoretical computer science; Distributed computing; Algorithm; Programming language","score_opus":0.016924116154096874,"score_gpt":0.24715926866107898,"score_spread":0.23023515250698212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121367871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030379395,0.0161245,0.9478536,0.0052104807,0.00081519573,0.00009929497,0.0003088574,0.00021997307,0.026330229],"genre_scores_gemma":[0.25850463,0.026245357,0.68877095,0.0040863035,0.0038632785,0.0012196826,0.000906756,0.00045343832,0.015949702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976865,0.00079105876,0.00027042418,0.0005504165,0.000528586,0.00017302626],"domain_scores_gemma":[0.9966978,0.0019218483,0.00027558807,0.00050066534,0.00042934282,0.00017475412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004048908,0.0013117571,0.0010614814,0.0029445426,0.0018751295,0.0051975525,0.002385241,0.002296951,0.0049336553],"category_scores_gemma":[0.0057592415,0.0009124624,0.0019083532,0.0057050227,0.01109847,0.011468592,0.003272205,0.0060729845,0.0014063697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039215593,0.000007517551,0.00003229691,0.000049453756,0.000002842124,0.00003864944,0.00018658598,0.0009416446,0.0001779311,0.9931809,0.0010051017,0.004373287],"study_design_scores_gemma":[0.000008438162,0.000016119873,0.000060077884,0.00010079514,0.000006658871,0.00022735231,0.00011162283,0.00783514,0.00022263432,0.91202855,0.079365514,0.00001712556],"about_ca_topic_score_codex":0.0023017225,"about_ca_topic_score_gemma":0.0011800718,"teacher_disagreement_score":0.0051975525,"about_ca_system_score_codex":0.002641565,"about_ca_system_score_gemma":0.0017033857,"threshold_uncertainty_score":0.021412969},"labels":[],"label_agreement":null},{"id":"W2122334246","doi":"10.1109/ftdcs.1992.217479","title":"Using dummy reads to maintain consistency in heterogeneous database systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Concurrency control; Consistency (knowledge bases); Concurrency; Protocol (science); Distributed computing; Distributed database; Database; Scheme (mathematics); Distributed concurrency control; Simple (philosophy); Optimistic concurrency control; Multiversion concurrency control; Database transaction; Artificial intelligence; Mathematics","score_opus":0.04600316973374813,"score_gpt":0.28878977159651514,"score_spread":0.24278660186276702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122334246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1399255,0.00078126474,0.8465613,0.0005086129,0.00023780805,0.00039430129,0.0001712204,0.005598593,0.00582141],"genre_scores_gemma":[0.79917336,0.0003424103,0.19106503,0.00046670163,0.00018472211,0.00047302616,0.0005460339,0.0011188033,0.0066298787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903529,0.0038533697,0.0011114206,0.0014309749,0.0026027195,0.0006486108],"domain_scores_gemma":[0.9592316,0.011308627,0.0033812106,0.021889364,0.0033752536,0.00081394205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009233047,0.00063985883,0.0012865602,0.0012273197,0.0019134925,0.003805342,0.004627859,0.001172278,0.0021666235],"category_scores_gemma":[0.02902458,0.0011305097,0.0005416431,0.0012422606,0.003140845,0.008531552,0.006413009,0.0018556231,0.00085487735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005702256,0.0011521219,0.021331483,0.0011059927,0.00043857857,0.0024722484,0.0056602233,0.12671487,0.12804231,0.2143944,0.015659709,0.47732577],"study_design_scores_gemma":[0.0014396717,0.001427478,0.0027973074,0.00014866224,0.00055087794,0.0010612463,0.0010970299,0.5138027,0.24064629,0.19511153,0.041619662,0.00029756883],"about_ca_topic_score_codex":0.0011050544,"about_ca_topic_score_gemma":0.0014066235,"teacher_disagreement_score":0.009233047,"about_ca_system_score_codex":0.00090920756,"about_ca_system_score_gemma":0.0017868748,"threshold_uncertainty_score":0.048829556},"labels":[],"label_agreement":null},{"id":"W2122692551","doi":"10.1142/s0129054112400394","title":"RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología; McMaster University","keywords":"Preference; Computer science; Leader election; Bandwidth (computing); Theoretical computer science; Mathematics; Statistics; Computer network","score_opus":0.03817242970142039,"score_gpt":0.3004254805165874,"score_spread":0.26225305081516703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122692551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1604982,0.0000804677,0.8370399,0.00015081925,0.00002264928,0.000093848124,0.000053791442,0.00038265702,0.0016776812],"genre_scores_gemma":[0.86715233,0.000054650034,0.13111007,0.00004150987,0.000014830626,0.00009855373,0.00007170826,0.000028499591,0.0014278792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988996,0.00046428887,0.00004853922,0.00016389473,0.00025602838,0.00016758211],"domain_scores_gemma":[0.99779546,0.001182818,0.00032270688,0.0002648357,0.00027076574,0.0001634493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016659708,0.00023497311,0.00069111394,0.00039132521,0.00081799785,0.0006230355,0.0011221691,0.000560285,0.0007882708],"category_scores_gemma":[0.0042535346,0.00022305964,0.00032723218,0.0006866794,0.00066252216,0.0009345769,0.0008166303,0.0004737606,0.00016902901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003461612,0.00013345244,0.0015935453,0.000068958645,0.000047581532,0.00020428654,0.00024723084,0.879334,0.0077172634,0.05683045,0.0010990772,0.05237799],"study_design_scores_gemma":[0.000030615865,0.00004422716,0.00012057196,0.0000019492825,0.0000054876095,0.000033969987,0.00002366316,0.9856494,0.0011731595,0.012575245,0.00033457048,0.0000070993815],"about_ca_topic_score_codex":0.001785099,"about_ca_topic_score_gemma":0.0020104102,"teacher_disagreement_score":0.001785099,"about_ca_system_score_codex":0.00067048566,"about_ca_system_score_gemma":0.0011302319,"threshold_uncertainty_score":0.00881058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013018712825994727,"score_gpt":0.2926498428743762,"score_spread":0.27963113004838147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123429492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077857986,0.0044681905,0.7676588,0.020066613,0.0012120459,0.00011584536,0.000355436,0.0008777197,0.1273873],"genre_scores_gemma":[0.903626,0.0028676256,0.07248335,0.0012855141,0.0012467586,0.00027428937,0.00022139354,0.00033607314,0.017658934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960453,0.0019803972,0.00011269331,0.00051290414,0.0010025947,0.00034602915],"domain_scores_gemma":[0.95965576,0.030852605,0.0009587056,0.0064580236,0.0013220476,0.00075293885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049766535,0.0005705881,0.0012507115,0.0011056677,0.0022319632,0.0046269787,0.0026540037,0.0025292535,0.011546018],"category_scores_gemma":[0.045298934,0.00086082483,0.0008815113,0.0018015752,0.0060894554,0.012024593,0.0037457482,0.004494414,0.0018427435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108400585,0.00003625318,0.0005265009,0.00008318244,0.000030541836,0.000049277856,0.00021794767,0.047980785,0.00073361746,0.9195455,0.0044139945,0.02627392],"study_design_scores_gemma":[0.0000511738,0.000019704605,0.00017298802,0.00002107373,0.00001761384,0.00005339971,0.000053711934,0.16592112,0.0005349307,0.82641906,0.006718992,0.000016211905],"about_ca_topic_score_codex":0.0018589215,"about_ca_topic_score_gemma":0.0011229267,"teacher_disagreement_score":0.011546018,"about_ca_system_score_codex":0.0017784169,"about_ca_system_score_gemma":0.002039216,"threshold_uncertainty_score":0.0386253},"labels":[],"label_agreement":null},{"id":"W2124070832","doi":"10.1109/tkde.2002.1033784","title":"The presumed-either two-phase commit protocol","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IBM (Canada)","funders":"","keywords":"Commit; Abort; Computer science; Two-phase commit protocol; Exploit; Compensating transaction; Protocol (science); Computer security; Distributed transaction; Transaction processing; Operating system; Database; Medicine; Database transaction","score_opus":0.03674964714283385,"score_gpt":0.3081144308505624,"score_spread":0.27136478370772854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124070832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012436058,0.0015293052,0.939121,0.0013368815,0.00093785085,0.0018685067,0.0012764608,0.007369283,0.034124658],"genre_scores_gemma":[0.3754615,0.0030704662,0.5600005,0.001352438,0.0006170243,0.0021111278,0.0035967687,0.0012943152,0.05249595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963198,0.00084527,0.0003745969,0.00039258727,0.0016827909,0.0003849899],"domain_scores_gemma":[0.99484104,0.0007125456,0.0004310632,0.0024576834,0.0011556717,0.00040193347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024775113,0.0006738841,0.000663506,0.00067208,0.0012722391,0.0024693392,0.0037197645,0.0014277243,0.01063869],"category_scores_gemma":[0.0067065093,0.00061436655,0.0004717103,0.0012752351,0.0013606345,0.005270073,0.0056202575,0.0029312368,0.0036808867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015470675,0.0003362254,0.0011132053,0.0013066517,0.00009904759,0.00063185487,0.0006915358,0.021680899,0.031879786,0.5170864,0.07851,0.34511733],"study_design_scores_gemma":[0.000585648,0.0008333188,0.0005722531,0.00022435338,0.00014569549,0.0016138408,0.00039956046,0.16676047,0.05199786,0.1364798,0.64010274,0.0002845808],"about_ca_topic_score_codex":0.0014962914,"about_ca_topic_score_gemma":0.0014639156,"teacher_disagreement_score":0.01063869,"about_ca_system_score_codex":0.00068713597,"about_ca_system_score_gemma":0.0036460578,"threshold_uncertainty_score":0.035589933},"labels":[],"label_agreement":null},{"id":"W2125095970","doi":"10.1109/iri.2011.6009598","title":"Mobile databases - Synchronization &amp;amp; conflict resolution strategies using SQL server","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Synchronization (alternating current); Database; Sql server; SQL; Resolution (logic); Computer network; Programming language; Channel (broadcasting)","score_opus":0.11194015593525698,"score_gpt":0.3097085260495358,"score_spread":0.19776837011427884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125095970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041694578,0.0009928857,0.94556284,0.00075188524,0.000088785375,0.00028221804,0.00010461006,0.0040727863,0.006449463],"genre_scores_gemma":[0.59889805,0.0007882917,0.39343345,0.00035754175,0.000110587214,0.00020940264,0.00044445,0.00023932797,0.0055188825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975811,0.000728338,0.00029695593,0.0003184335,0.0008761604,0.00019890758],"domain_scores_gemma":[0.9980117,0.0005844104,0.00021532577,0.00059696264,0.0004257691,0.00016580225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025358626,0.00048259823,0.00054081826,0.0008403899,0.00082323316,0.0026956585,0.0020620616,0.0007351688,0.002287811],"category_scores_gemma":[0.0035676823,0.00040491318,0.00037829462,0.0011860557,0.0006387828,0.0034726288,0.0017220195,0.0010439561,0.00089759036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012508738,0.0006284746,0.007317176,0.0004880288,0.0002449649,0.0010804901,0.0023868713,0.0392291,0.09930194,0.11833158,0.01613008,0.71361035],"study_design_scores_gemma":[0.00041389134,0.0008909255,0.0029111898,0.00014342194,0.00024862023,0.0020332928,0.0020303514,0.673948,0.15616469,0.043627292,0.117401086,0.00018718418],"about_ca_topic_score_codex":0.0017052963,"about_ca_topic_score_gemma":0.0014352178,"teacher_disagreement_score":0.0026956585,"about_ca_system_score_codex":0.0006506063,"about_ca_system_score_gemma":0.0011138003,"threshold_uncertainty_score":0.013411105},"labels":[],"label_agreement":null},{"id":"W2125827816","doi":"10.1109/cmpsac.1990.139367","title":"Concurrent transaction execution in multidatabase systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Alberta","funders":"","keywords":"Serializability; Computer science; Distributed transaction; Distributed computing; Database transaction; Concurrency control; Schedule; Transaction processing; Serialization; Atomicity; Online transaction processing; Database; Programming language; Operating system","score_opus":0.028207986594607708,"score_gpt":0.23062892071937638,"score_spread":0.20242093412476866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125827816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05972831,0.003836899,0.9248115,0.00084123516,0.00019704843,0.00022767515,0.000104977495,0.001460948,0.008791511],"genre_scores_gemma":[0.7402316,0.0022209792,0.24816515,0.00022584043,0.00020645729,0.00035398797,0.00038991112,0.00025773255,0.00794823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962232,0.0011420386,0.00037285808,0.0004329769,0.0016158996,0.0002129323],"domain_scores_gemma":[0.9964579,0.0017820647,0.0002774945,0.00071023137,0.0005804163,0.00019198103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002593941,0.0004342679,0.0005610542,0.00069689384,0.0008786698,0.0030543169,0.0014011347,0.0009221771,0.0014339697],"category_scores_gemma":[0.006794825,0.0006781148,0.00042578919,0.0016614185,0.0015166424,0.0029006095,0.0016518208,0.0015827051,0.00043510826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034652444,0.00021071556,0.0043894183,0.0004909981,0.00007802658,0.0018125182,0.0018966987,0.32398942,0.014998748,0.4778922,0.0051662037,0.16872847],"study_design_scores_gemma":[0.00010869989,0.00010024011,0.0006081625,0.00007008788,0.000038982405,0.00045539017,0.00021128828,0.73752326,0.009055056,0.22165823,0.03013213,0.00003849042],"about_ca_topic_score_codex":0.0033331062,"about_ca_topic_score_gemma":0.0017637989,"teacher_disagreement_score":0.0033331062,"about_ca_system_score_codex":0.0012285654,"about_ca_system_score_gemma":0.001565054,"threshold_uncertainty_score":0.013718188},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016190014463895588,"score_gpt":0.23275630997701277,"score_spread":0.21656629551311718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126321570","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034586802,0.0013619134,0.83250564,0.004628137,0.0022782194,0.00094101205,0.0016696589,0.034631457,0.0873972],"genre_scores_gemma":[0.3640887,0.0011815768,0.5752281,0.0012275785,0.0006115616,0.0003539118,0.0027717808,0.0035442014,0.050992496],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860483,0.00018804867,0.00008811134,0.0002767307,0.0006453299,0.00019695793],"domain_scores_gemma":[0.9985393,0.00033161358,0.000071684866,0.00059807196,0.00027657876,0.00018264237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009820093,0.00068324804,0.0005416619,0.00063633005,0.0012999412,0.003170004,0.0010056937,0.0011382982,0.025873285],"category_scores_gemma":[0.0044496004,0.0005543829,0.00082807365,0.00044503532,0.00079073093,0.0033457454,0.001491314,0.001591917,0.00986842],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010022062,0.00033353092,0.0029285757,0.0003664983,0.00009890034,0.000743416,0.0007332409,0.019931836,0.031271823,0.0749215,0.12163683,0.74603164],"study_design_scores_gemma":[0.00062583195,0.00060668506,0.0041811853,0.00028666845,0.00022532367,0.0013957996,0.0017264613,0.28346097,0.057276,0.18650545,0.46338373,0.00032581773],"about_ca_topic_score_codex":0.0040008556,"about_ca_topic_score_gemma":0.0038816913,"teacher_disagreement_score":0.025873285,"about_ca_system_score_codex":0.00036482426,"about_ca_system_score_gemma":0.00087202183,"threshold_uncertainty_score":0.086554706},"labels":[],"label_agreement":null},{"id":"W2126722198","doi":"10.1109/iri.2004.1431458","title":"Synchronization of mobile XML databases by utilizing deferred views","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Synchronization (alternating current); Data synchronization; XML; Pace; Process (computing); XML database; Mobile database; Popularity; Bandwidth (computing); Relational database; Distributed computing; Computer network; Database; World Wide Web; Base station; Mobile station; Operating system","score_opus":0.030385870018153738,"score_gpt":0.2862890428723252,"score_spread":0.25590317285417147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126722198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466297,0.0007660184,0.9606014,0.000114704526,0.0000972657,0.00008605946,0.00006157094,0.001541098,0.0020689797],"genre_scores_gemma":[0.5549295,0.00064285664,0.44090146,0.00013948076,0.00010302022,0.000118272306,0.0004016297,0.00019035127,0.0025734077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988225,0.0002886833,0.0001208726,0.000170883,0.00048112252,0.000115916475],"domain_scores_gemma":[0.9980494,0.0005494241,0.0001735578,0.000758018,0.00036108718,0.00010845744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014699482,0.00033249648,0.0005356416,0.00093631,0.0005631617,0.0015091203,0.0016765665,0.00044993564,0.0009806252],"category_scores_gemma":[0.0038147424,0.0004474679,0.0004146237,0.00083745894,0.0004379337,0.0014947712,0.0017207111,0.00068239885,0.0002842617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013334628,0.0001795852,0.0034478519,0.00032910533,0.00015592025,0.001623667,0.0027092143,0.12483997,0.10890021,0.14940622,0.009650181,0.5974246],"study_design_scores_gemma":[0.00021057676,0.00040201453,0.0008015309,0.000055740744,0.00010243009,0.0007214858,0.00030393174,0.84522456,0.07658844,0.030099118,0.04540668,0.000083530314],"about_ca_topic_score_codex":0.0021005585,"about_ca_topic_score_gemma":0.0019864938,"teacher_disagreement_score":0.0021005585,"about_ca_system_score_codex":0.0005334907,"about_ca_system_score_gemma":0.000679991,"threshold_uncertainty_score":0.007773936},"labels":[],"label_agreement":null},{"id":"W2126740112","doi":"10.1109/pccc.2011.6108075","title":"Dynamic data allocation with replication in distributed systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Replication (statistics); Locality; Overhead (engineering); Distributed computing; Fragment (logic); Distributed database; Computer network; Algorithm; Operating system","score_opus":0.04575418189555057,"score_gpt":0.26097613860793156,"score_spread":0.21522195671238098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126740112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013071977,0.0016175051,0.9823263,0.00032747546,0.00006442313,0.00006662586,0.000025962461,0.0006077839,0.0018919002],"genre_scores_gemma":[0.5457708,0.0016138853,0.44836268,0.00012801679,0.00015147595,0.00024708567,0.00013415418,0.00014501016,0.0034469124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808854,0.00081037247,0.00012191943,0.00037672417,0.00046818177,0.00013421182],"domain_scores_gemma":[0.99829286,0.00072656194,0.00015376689,0.00054814515,0.00019597453,0.00008265409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018493191,0.0005725889,0.0010961023,0.00071815227,0.0009888785,0.0018925663,0.0016852219,0.0012160323,0.0011293472],"category_scores_gemma":[0.004781184,0.0005509363,0.00050418044,0.0016576832,0.0013264877,0.003245871,0.0017131404,0.0009542025,0.00046056154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002439888,0.00012019409,0.0012017386,0.0002774777,0.00007797837,0.0002544139,0.00028246353,0.63633305,0.01175894,0.09832075,0.0038660122,0.24726291],"study_design_scores_gemma":[0.00006646682,0.00011512235,0.00020098094,0.000026233702,0.000038478647,0.00029358128,0.00009851547,0.88060206,0.0059458325,0.10200462,0.010574541,0.000033575307],"about_ca_topic_score_codex":0.0014755636,"about_ca_topic_score_gemma":0.0012253188,"teacher_disagreement_score":0.0018925663,"about_ca_system_score_codex":0.0009979345,"about_ca_system_score_gemma":0.00116792,"threshold_uncertainty_score":0.009780288},"labels":[],"label_agreement":null},{"id":"W2127934681","doi":"10.1145/2576794","title":"Eventually consistent","year":2014,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Consistency (knowledge bases); Artificial intelligence","score_opus":0.03004107361134786,"score_gpt":0.26536628250021044,"score_spread":0.23532520888886257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127934681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413787,0.0007225243,0.9809249,0.00047837352,0.00012771727,0.00010137608,0.00029321585,0.00053103134,0.0054069976],"genre_scores_gemma":[0.5059298,0.0009868016,0.48064715,0.0007665521,0.00039153858,0.00056697713,0.0012576899,0.00062758254,0.008825953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886769,0.0036779926,0.0010118006,0.0018558828,0.004063808,0.0007135893],"domain_scores_gemma":[0.94789016,0.025058853,0.003755637,0.013610152,0.0087940395,0.00089118024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009933942,0.00089411164,0.001288704,0.0030152118,0.0019065129,0.0037997637,0.0028912493,0.0017067166,0.00452665],"category_scores_gemma":[0.06113541,0.0010425801,0.001308235,0.0029553908,0.0050964034,0.010985679,0.005250402,0.0036781456,0.0007856303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017891871,0.00004579954,0.0024527132,0.00026192944,0.00009633328,0.00013024983,0.00058009924,0.02638578,0.0024439658,0.9150188,0.004311451,0.048093867],"study_design_scores_gemma":[0.000024482206,0.00006918605,0.0005749392,0.00010564785,0.000061637424,0.00015683449,0.00021054773,0.10188393,0.0039047014,0.8855094,0.0074547553,0.000044070577],"about_ca_topic_score_codex":0.0028276476,"about_ca_topic_score_gemma":0.0025557908,"teacher_disagreement_score":0.009933942,"about_ca_system_score_codex":0.0023955933,"about_ca_system_score_gemma":0.003599108,"threshold_uncertainty_score":0.05253637},"labels":[],"label_agreement":null},{"id":"W2128222559","doi":"10.1007/s11227-012-0854-y","title":"Improving performance of software transactional memory through contention locality","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Locality; Benchmark (surveying); Suite; Database transaction; Transactional leadership; Parallel computing; Distributed computing; Locality of reference; Database; Cache","score_opus":0.01477276391523287,"score_gpt":0.21357204766565477,"score_spread":0.19879928375042188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128222559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82014716,0.0039199707,0.16154559,0.000993078,0.00024446123,0.0000415162,0.00006003174,0.0048710275,0.008177123],"genre_scores_gemma":[0.98130715,0.00019596747,0.016816763,0.0000744786,0.000056530203,0.000017104774,0.00003891713,0.00011959891,0.0013736193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989944,0.0002621773,0.00004670601,0.00011626638,0.0003608092,0.0002196173],"domain_scores_gemma":[0.9954886,0.0018945031,0.00027994564,0.0012635544,0.0008109562,0.00026237857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011071791,0.0004378335,0.0005622877,0.000734414,0.000993564,0.0012512334,0.0025474655,0.0005703893,0.0028375955],"category_scores_gemma":[0.005991437,0.0003543196,0.00023199013,0.001378809,0.00090900355,0.002129742,0.0012703551,0.0010341139,0.0006080826],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043320535,0.0013692714,0.014814842,0.00037244533,0.00019097881,0.00033068337,0.00082014,0.20021497,0.2311204,0.03341387,0.0104399575,0.5025803],"study_design_scores_gemma":[0.00021221713,0.0006527024,0.0014037589,0.000015160567,0.00013317737,0.000118953256,0.00015404267,0.90584683,0.07672502,0.011570155,0.0031232582,0.00004469323],"about_ca_topic_score_codex":0.0021245384,"about_ca_topic_score_gemma":0.0040230267,"teacher_disagreement_score":0.0028375955,"about_ca_system_score_codex":0.00081991334,"about_ca_system_score_gemma":0.0017802641,"threshold_uncertainty_score":0.009492695},"labels":[],"label_agreement":null},{"id":"W2128257486","doi":"10.1145/2261417.2261437","title":"Automated model repair for distributed programs","year":2012,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Model transformation; Scalability; Model checking; Automaton; Distributed computing; Property (philosophy); Transformation (genetics); Mutual exclusion; Finite-state machine; Security token; Theoretical computer science; Programming language; Artificial intelligence; Operating system","score_opus":0.0418212947630007,"score_gpt":0.29590166991256667,"score_spread":0.25408037514956594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128257486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006696342,0.00010996582,0.9882783,0.00031556963,0.000019640756,0.00006219727,0.00007513377,0.003145878,0.0012969497],"genre_scores_gemma":[0.29723504,0.00038323668,0.6962972,0.00018490841,0.00004950027,0.00038215859,0.0006096722,0.0009649462,0.0038933067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974921,0.00086134736,0.00016186692,0.00037663334,0.000927413,0.00018075513],"domain_scores_gemma":[0.993436,0.004304772,0.00046758127,0.0012181277,0.0004998266,0.00007373019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019645062,0.00094249827,0.0007939356,0.0010997086,0.0010680096,0.001890888,0.0014567593,0.0012124198,0.00359481],"category_scores_gemma":[0.011439365,0.00068113767,0.0018710133,0.0007230717,0.0019393852,0.003341182,0.002695961,0.0020680695,0.00074427115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017971016,0.00014543292,0.0015690499,0.00051427615,0.00009015061,0.0005353784,0.0007576569,0.4588496,0.015782211,0.3467245,0.006554795,0.16829713],"study_design_scores_gemma":[0.000049473125,0.00002925081,0.00010115295,0.00004329876,0.000024732304,0.000114263334,0.00006852646,0.7871644,0.008205045,0.19526969,0.008911403,0.000018695488],"about_ca_topic_score_codex":0.0027585863,"about_ca_topic_score_gemma":0.00303062,"teacher_disagreement_score":0.00359481,"about_ca_system_score_codex":0.0022364513,"about_ca_system_score_gemma":0.0019290082,"threshold_uncertainty_score":0.016226709},"labels":[],"label_agreement":null},{"id":"W2128488733","doi":"10.1109/waina.2011.33","title":"QoS-Aware Middleware for Scalable Replication","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Scalability; Replication (statistics); Middleware (distributed applications); Asynchronous communication; Distributed computing; Computer network; Session (web analytics); Protocol (science); Mobile QoS; Service (business); Service provider; Operating system; World Wide Web","score_opus":0.06780490720283178,"score_gpt":0.2588938613454463,"score_spread":0.1910889541426145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128488733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016418085,0.0013326319,0.9682636,0.000998736,0.00036716083,0.0001656294,0.000064989516,0.0051002423,0.0072889766],"genre_scores_gemma":[0.51523715,0.001315483,0.47261274,0.00040049112,0.0002708993,0.00032799892,0.00026691493,0.00047810117,0.009090169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981384,0.00034908354,0.00023278163,0.0001917706,0.0009318434,0.0001561648],"domain_scores_gemma":[0.9973551,0.0005824359,0.00023930914,0.0010237644,0.00062721415,0.00017221674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020340842,0.0004587078,0.00045782322,0.00047082597,0.00090536673,0.001761598,0.002186092,0.0009970028,0.0018353271],"category_scores_gemma":[0.0062018065,0.0005022283,0.0005217365,0.00053250353,0.0006194515,0.0028160173,0.0020535295,0.0019136445,0.00085830333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005014473,0.0002664846,0.0028415835,0.0009965203,0.00019730725,0.0017829636,0.0013071352,0.1365612,0.242475,0.29257196,0.019807477,0.3006909],"study_design_scores_gemma":[0.00010588464,0.00025890517,0.0011473744,0.00012419754,0.00012671114,0.0017444005,0.0003931418,0.65184027,0.09971588,0.096276104,0.14809799,0.00016912188],"about_ca_topic_score_codex":0.0010193819,"about_ca_topic_score_gemma":0.00087305484,"teacher_disagreement_score":0.002186092,"about_ca_system_score_codex":0.0009353983,"about_ca_system_score_gemma":0.0011994479,"threshold_uncertainty_score":0.010757387},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2128712994","doi":"10.1109/cluster.2011.65","title":"Investigating Scenario-Conscious Asynchronous Rendezvous over RDMA","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Innovation Trust","keywords":"Computer science; Asynchronous communication; Rendezvous; Message passing; Message queue; Thread (computing); Distributed computing; Callback; Computer network; Remote direct memory access; Message Passing Interface; Parallel computing; Operating system","score_opus":0.028718713358867325,"score_gpt":0.23182507014097553,"score_spread":0.2031063567821082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128712994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20382173,0.00055526965,0.78820276,0.00019815147,0.00010357131,0.00013975002,0.000031917352,0.000960242,0.005986567],"genre_scores_gemma":[0.9303335,0.00017508316,0.067398176,0.00003799178,0.000038035574,0.00006176398,0.000033605545,0.00004845747,0.0018733938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.00020515258,0.000028871656,0.00014175905,0.00020613434,0.000102702514],"domain_scores_gemma":[0.99889046,0.0004881017,0.00013174867,0.00026924035,0.0001240259,0.00009644089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088867755,0.00035449362,0.0004619045,0.00026857218,0.0007247784,0.00088188256,0.0013761381,0.00055473624,0.0014768838],"category_scores_gemma":[0.002678209,0.0002176604,0.0003232198,0.00023634144,0.0006928292,0.0018065406,0.0012869879,0.0006755807,0.00021148734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085042237,0.00026002343,0.004650474,0.00051607785,0.00016740931,0.0012534116,0.0014071247,0.4511478,0.19877605,0.2011746,0.0014886719,0.13830793],"study_design_scores_gemma":[0.000051483777,0.00019826318,0.00067681127,0.000009844836,0.000033514683,0.00023420538,0.00019095246,0.9521387,0.021722982,0.018783538,0.005923001,0.00003667413],"about_ca_topic_score_codex":0.0011614608,"about_ca_topic_score_gemma":0.0009402233,"teacher_disagreement_score":0.0014768838,"about_ca_system_score_codex":0.00039398886,"about_ca_system_score_gemma":0.0004960854,"threshold_uncertainty_score":0.0049406886},"labels":[],"label_agreement":null},{"id":"W2129022583","doi":"10.1109/dexa.1996.558282","title":"A two-phase commit protocol and its performance","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Two-phase commit protocol; Commit; Compensating transaction; Distributed transaction; Computer science; Protocol (science); Database transaction; Transaction processing; Distributed computing; Serializability; Two-phase locking; Reliability (semiconductor); Database","score_opus":0.031430402648498085,"score_gpt":0.29309079447366837,"score_spread":0.2616603918251703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129022583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6690693,0.009268943,0.29145265,0.0016932592,0.00039635383,0.0005794935,0.00043684788,0.0021265468,0.024976624],"genre_scores_gemma":[0.9640415,0.0012494214,0.032077346,0.00007245388,0.000064037966,0.00017849621,0.00022486462,0.00009392741,0.0019978764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381447,0.0015064686,0.00030810974,0.0005355122,0.0034293788,0.00040606072],"domain_scores_gemma":[0.9791006,0.01211233,0.0018811829,0.0026585727,0.0036761253,0.00057114154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005044739,0.00059687725,0.0007528045,0.0012711278,0.0011478568,0.0025037169,0.001331696,0.0015302715,0.0016906437],"category_scores_gemma":[0.02513586,0.00050569343,0.00027638758,0.0028905403,0.0015524974,0.0036323487,0.0011838175,0.0013567563,0.00038925526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033794607,0.001596845,0.024492601,0.0012415742,0.0002812686,0.0012473086,0.0015235662,0.5219472,0.046218567,0.15209068,0.011666525,0.23431438],"study_design_scores_gemma":[0.00022756183,0.0015198672,0.0038531877,0.000057382545,0.00009137441,0.0010967569,0.00035328988,0.93031275,0.023172935,0.031332783,0.007882847,0.00009917889],"about_ca_topic_score_codex":0.0025258558,"about_ca_topic_score_gemma":0.001131142,"teacher_disagreement_score":0.005044739,"about_ca_system_score_codex":0.001423569,"about_ca_system_score_gemma":0.002064627,"threshold_uncertainty_score":0.026679456},"labels":[],"label_agreement":null},{"id":"W2129620421","doi":"10.1109/mdm.2008.15","title":"LAOF: A New Framework to Efficiently Process Business Objects on Resource Constrained Mobile Phones","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Business process; Asynchronous communication; Mobile computing; Distributed computing; Mobile business development; Consistency (knowledge bases); Mobile device; Resource (disambiguation); Mobile Web; Mobile technology; Computer network; Operating system; Work in process","score_opus":0.01409116381525646,"score_gpt":0.2545321434693072,"score_spread":0.24044097965405073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129620421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005818377,0.00014038083,0.98697865,0.0001171972,0.000041656644,0.0001619113,0.000056429522,0.0057986043,0.00088676176],"genre_scores_gemma":[0.1210683,0.00029715666,0.87240857,0.00018672145,0.00011159359,0.00048058166,0.00034378588,0.0008671925,0.0042360593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982615,0.00041329022,0.00020220586,0.000243951,0.0006337745,0.00024531467],"domain_scores_gemma":[0.99714077,0.0008634624,0.00030925745,0.0010432245,0.00034940112,0.0002938853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030407668,0.00077219267,0.0009437878,0.0009499807,0.0011464625,0.0034090348,0.0039997958,0.0018254643,0.0030335921],"category_scores_gemma":[0.0055784225,0.00072550547,0.0010814437,0.0006034715,0.0014028997,0.006522178,0.0033505524,0.001743568,0.0010611977],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013406869,0.0005428664,0.00490496,0.0009709853,0.00016951298,0.0013660825,0.0025792203,0.11043621,0.0517159,0.20560087,0.022338739,0.59803396],"study_design_scores_gemma":[0.00030770974,0.00047335422,0.00069536106,0.00013605507,0.00012702643,0.0009377599,0.0002648443,0.75775623,0.026675127,0.07844785,0.13398832,0.00019031971],"about_ca_topic_score_codex":0.0047240513,"about_ca_topic_score_gemma":0.0034115887,"teacher_disagreement_score":0.0047240513,"about_ca_system_score_codex":0.00089312776,"about_ca_system_score_gemma":0.0023340862,"threshold_uncertainty_score":0.016081274},"labels":[],"label_agreement":null},{"id":"W2129789076","doi":"10.1109/icpads.2005.41","title":"A Pure Lazy Technique for Scalable Transaction Processing in Replicated Databases","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Database; Scalability; Transaction processing; Database transaction; Transaction processing system; Online transaction processing; Distributed transaction; Transaction log; Parallel computing; Programming language","score_opus":0.025868117471598225,"score_gpt":0.28832927590157476,"score_spread":0.2624611584299765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129789076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049921176,0.0014062771,0.99027747,0.00030471577,0.000100562924,0.00007775274,0.000026697548,0.0016072692,0.0012070664],"genre_scores_gemma":[0.19508347,0.0022239196,0.7935505,0.0004803595,0.0006749656,0.00044751336,0.00015828117,0.0005709717,0.006810089],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725,0.000592051,0.00021385218,0.00038878023,0.0013907197,0.00016459142],"domain_scores_gemma":[0.99703145,0.00060248474,0.00022856513,0.0016875764,0.00035909063,0.00009086561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106008,0.00066947355,0.0008152906,0.0010566949,0.0013131241,0.0015773096,0.0029368266,0.0010019118,0.0022332794],"category_scores_gemma":[0.0063796877,0.0008484457,0.00068852835,0.0016446492,0.0018155167,0.0048446604,0.003491153,0.0020287298,0.0014492141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006015391,0.00023526658,0.001350885,0.0012292081,0.00023335872,0.0006563418,0.0016911044,0.041033044,0.11664575,0.25085932,0.020665321,0.5647988],"study_design_scores_gemma":[0.00053056784,0.000737317,0.0010729475,0.00023210493,0.00039538238,0.0022976985,0.00032119124,0.495542,0.08127065,0.29969755,0.117697656,0.00020491959],"about_ca_topic_score_codex":0.0006866415,"about_ca_topic_score_gemma":0.00091648486,"teacher_disagreement_score":0.0029368266,"about_ca_system_score_codex":0.0005974399,"about_ca_system_score_gemma":0.0011520879,"threshold_uncertainty_score":0.0111377835},"labels":[],"label_agreement":null},{"id":"W2129935503","doi":"10.1109/ipdps.2011.290","title":"Speculative Contention Avoidance in Software Transactional Memory","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Lakehead University","keywords":"Transactional memory; Software transactional memory; Computer science; Lock (firearm); Suite; Benchmark (surveying); Database transaction; Transactional leadership; Locality; Exploit; Distributed computing; Parallel computing; Speculative execution; Computer security; Database; Psychology","score_opus":0.034733323561429094,"score_gpt":0.21621273758367,"score_spread":0.18147941402224088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129935503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5476883,0.003216386,0.4408275,0.0005987006,0.00015417988,0.00011461315,0.00006328773,0.0039837603,0.00335326],"genre_scores_gemma":[0.93205494,0.00027322912,0.06656733,0.00007500277,0.000032953907,0.000053456577,0.000046503443,0.00009268525,0.00080385164],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881077,0.00033120142,0.000088091954,0.00012140202,0.00050426,0.00014429886],"domain_scores_gemma":[0.9950472,0.001983281,0.0006340742,0.001454943,0.0007210699,0.00015946881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014153813,0.00039672304,0.0003875986,0.0006460823,0.0005668727,0.0010897876,0.0024523595,0.00039116913,0.0008350139],"category_scores_gemma":[0.005500842,0.0004374908,0.000300949,0.0010665399,0.001055835,0.0018225905,0.0008506359,0.0010370194,0.00017453935],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017751104,0.00062385545,0.028629782,0.0005755113,0.00022065443,0.000749298,0.0011695182,0.32304567,0.15764837,0.049589224,0.0058019413,0.43017104],"study_design_scores_gemma":[0.00011608832,0.00044132955,0.0011456774,0.000020373289,0.00007324693,0.00019646659,0.000092601884,0.9306901,0.05065195,0.011905244,0.004626166,0.000040751846],"about_ca_topic_score_codex":0.0020737348,"about_ca_topic_score_gemma":0.0026741058,"teacher_disagreement_score":0.0024523595,"about_ca_system_score_codex":0.0006211776,"about_ca_system_score_gemma":0.001333906,"threshold_uncertainty_score":0.0074853897},"labels":[],"label_agreement":null},{"id":"W2130160018","doi":"10.1109/hicss.1988.11809","title":"A software facility for load sharing and parallel processing in workstation environments","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Workstation; Computer science; Operating system; Process (computing); Software; Replication (statistics); Kernel (algebra); Local area network; Architecture; Embedded system; Distributed computing","score_opus":0.020290853441069474,"score_gpt":0.24573057142005658,"score_spread":0.2254397179789871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130160018","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030348692,0.0001901127,0.8715491,0.00018667382,0.000096578275,0.00016359227,0.0003776111,0.11516656,0.009234964],"genre_scores_gemma":[0.079098724,0.0004746118,0.8614892,0.00048345045,0.0002882064,0.00069593167,0.0045876396,0.012216865,0.040665466],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982798,0.00030543335,0.00013572315,0.00024873434,0.000791798,0.00023856213],"domain_scores_gemma":[0.9975116,0.00051701814,0.00014616759,0.0010489827,0.0004763301,0.00029985036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018130522,0.0010469451,0.00096573425,0.0018542558,0.0012738688,0.0022790865,0.004325238,0.0018344852,0.026347298],"category_scores_gemma":[0.004105995,0.0012277816,0.0011535634,0.0019977859,0.0013378463,0.0033030123,0.0041308813,0.0027822002,0.02003896],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000971085,0.00051154534,0.0022939527,0.0005889145,0.00014903565,0.0006986206,0.0010417596,0.018880535,0.048518106,0.12740792,0.19176717,0.6071714],"study_design_scores_gemma":[0.00059857813,0.0005990024,0.0022963379,0.00015547145,0.0001304878,0.0016448423,0.00009676845,0.15771025,0.05344143,0.049678825,0.7333392,0.00030881088],"about_ca_topic_score_codex":0.003302047,"about_ca_topic_score_gemma":0.002277296,"teacher_disagreement_score":0.026347298,"about_ca_system_score_codex":0.0010681876,"about_ca_system_score_gemma":0.0016232769,"threshold_uncertainty_score":0.08814055},"labels":[],"label_agreement":null},{"id":"W2131427573","doi":"10.1109/pccc.1996.493661","title":"Analysis of a dynamic voting algorithm based on regeneration with virtual copies","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Voting; Overhead (engineering); Consistency (knowledge bases); Distributed computing; Algorithm; Virtual machine; Scheme (mathematics); Real-time computing; Operating system; Mathematics; Artificial intelligence","score_opus":0.008984253789833245,"score_gpt":0.21298460036533062,"score_spread":0.20400034657549737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131427573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11414469,0.00049646135,0.8811965,0.00013719188,0.00004550863,0.000102998114,0.000019754734,0.00037011792,0.0034868363],"genre_scores_gemma":[0.89429605,0.00014850285,0.10364326,0.000038528753,0.000025298421,0.0000815268,0.00004292008,0.000055183784,0.00166879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875355,0.0003763801,0.000047219717,0.0001804973,0.00047144757,0.00017084839],"domain_scores_gemma":[0.99538475,0.0029416836,0.00037173298,0.00036888072,0.0008100221,0.00012292578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709017,0.00033830747,0.00076178805,0.00066628464,0.000578993,0.0007548095,0.0013221054,0.00063022546,0.0016303934],"category_scores_gemma":[0.008039487,0.00023263469,0.0003343133,0.00073150056,0.000840649,0.0009648436,0.0004785002,0.00049077877,0.00017615527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046223536,0.0000882697,0.0021231005,0.00012318154,0.000054062537,0.00009158931,0.0001243056,0.79843134,0.014131115,0.05258948,0.0008734331,0.13090782],"study_design_scores_gemma":[0.000014556541,0.00006234847,0.00014616211,0.0000029525531,0.000007654112,0.000034243374,0.000005231337,0.99542266,0.0012693524,0.0026990091,0.00033136224,0.0000043470595],"about_ca_topic_score_codex":0.0023473194,"about_ca_topic_score_gemma":0.0012875452,"teacher_disagreement_score":0.0023473194,"about_ca_system_score_codex":0.0010937091,"about_ca_system_score_gemma":0.0012067741,"threshold_uncertainty_score":0.010952115},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Kernel (algebra); Mathematics; Discrete mathematics","score_opus":0.004016871197081177,"score_gpt":0.21019561798992645,"score_spread":0.20617874679284526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132213430","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008989698,0.0012307004,0.003971164,0.0037067058,0.0021815759,0.00008297018,0.004878161,0.004593661,0.97845614],"genre_scores_gemma":[0.009953468,0.00151151,0.003344197,0.0028723478,0.0005971776,0.000111780624,0.008336044,0.0030414537,0.97023207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909437,0.00013452745,0.00004660438,0.0002096708,0.00033496929,0.00017997026],"domain_scores_gemma":[0.99825174,0.00020635173,0.00008862256,0.0005758588,0.0004965444,0.00038082898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008339158,0.001085207,0.00062958634,0.0021416692,0.0023172218,0.0077995313,0.0018908198,0.0021545219,0.6619001],"category_scores_gemma":[0.0045307884,0.00041253198,0.0008637634,0.0023197643,0.00092802977,0.0062262765,0.0042612446,0.0020957543,0.43604067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009449447,0.000029446224,0.0004100185,0.00018177029,0.000011570854,0.00016185018,0.00039458534,0.00011619361,0.00039842832,0.0642278,0.82362044,0.11035343],"study_design_scores_gemma":[0.0000033877964,0.0000024765802,0.00008443105,0.000030294004,0.0000018309286,0.00004323446,0.00005307862,0.000030418607,0.000059427155,0.0022396296,0.99744785,0.000003946784],"about_ca_topic_score_codex":0.0053021163,"about_ca_topic_score_gemma":0.007712601,"teacher_disagreement_score":0.6619001,"about_ca_system_score_codex":0.0012877182,"about_ca_system_score_gemma":0.0015640097,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2132364793","doi":"10.1109/ccgrid.2012.137","title":"Optimistic Scheduling with Geographically Replicated Services in the Cloud Environment (COLOR)","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cloud computing; Computer science; Consistency (knowledge bases); Distributed computing; Probabilistic logic; CLARITY; Eventual consistency; Bounded function; Scheduling (production processes); Data consistency; Consistency model; Mathematical optimization; Artificial intelligence; Mathematics; Operating system","score_opus":0.009396602030933858,"score_gpt":0.20922587813266275,"score_spread":0.19982927610172888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132364793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05301645,0.00043265728,0.938054,0.0009048148,0.00014662852,0.0001337743,0.00010510053,0.0012793576,0.00592721],"genre_scores_gemma":[0.86188376,0.00028688,0.1352307,0.00015209125,0.000073884235,0.000101019956,0.00007896969,0.00010973354,0.0020829865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.0005392521,0.00008346279,0.00017494659,0.00048405575,0.00025457083],"domain_scores_gemma":[0.9986039,0.00035022708,0.00021108387,0.00046968137,0.00018690655,0.0001782203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017573586,0.00047820446,0.00060100044,0.00032975417,0.0011254541,0.0024242604,0.0024275847,0.00069886143,0.0012199433],"category_scores_gemma":[0.0029320982,0.00041335687,0.00048471737,0.0006212507,0.0011661947,0.0019523267,0.0019846049,0.001257498,0.00027752353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036941085,0.000072144394,0.0011148131,0.00008819066,0.00005089817,0.00028234615,0.000354056,0.7330233,0.005660603,0.23443612,0.002408682,0.022139499],"study_design_scores_gemma":[0.000043205477,0.00004771363,0.00013906644,0.000007818701,0.000021282276,0.000065396605,0.00008219149,0.96232474,0.0021608942,0.030712137,0.004374165,0.000021420045],"about_ca_topic_score_codex":0.008613536,"about_ca_topic_score_gemma":0.007409383,"teacher_disagreement_score":0.008613536,"about_ca_system_score_codex":0.0019042868,"about_ca_system_score_gemma":0.0034075833,"threshold_uncertainty_score":0.017126799},"labels":[],"label_agreement":null},{"id":"W2133365899","doi":"10.1109/ispan.1997.645055","title":"Critical sections and producer/consumer queues in weak memory systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Critical section; Synchronization (alternating current); Queue; Mutual exclusion; Consistency (knowledge bases); Distributed computing; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.020725398278952985,"score_gpt":0.24680072701643863,"score_spread":0.22607532873748565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133365899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32652128,0.0041280896,0.64955467,0.0018384327,0.00038106547,0.00015728945,0.00011129627,0.0008626769,0.016445281],"genre_scores_gemma":[0.93373185,0.0017944976,0.048760027,0.0004085118,0.00040248883,0.00025095852,0.00011004954,0.00024677743,0.01429477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991854,0.00022384027,0.000057151243,0.00014153948,0.00017786701,0.00021416547],"domain_scores_gemma":[0.9951509,0.0028538276,0.000786685,0.00042380978,0.00046497947,0.0003197617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017918309,0.0005300584,0.00067311485,0.0009736129,0.0016601131,0.0024931047,0.001264184,0.0013068377,0.004944855],"category_scores_gemma":[0.0071369517,0.0008178841,0.0003746654,0.00082557567,0.0032188732,0.00488133,0.0019034132,0.001954369,0.00066970265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020410522,0.00003862327,0.0009748897,0.000102543185,0.000012107194,0.00023598556,0.00041243463,0.019490415,0.005145418,0.96327853,0.0017553681,0.0083495835],"study_design_scores_gemma":[0.0000980526,0.00006608945,0.00032534896,0.00003261749,0.000028035398,0.00013092003,0.0001108956,0.14268903,0.0063028815,0.8429834,0.007201045,0.00003160765],"about_ca_topic_score_codex":0.0016233627,"about_ca_topic_score_gemma":0.001108225,"teacher_disagreement_score":0.004944855,"about_ca_system_score_codex":0.0014258553,"about_ca_system_score_gemma":0.0016467692,"threshold_uncertainty_score":0.016542196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013368036344676518,"score_gpt":0.23973823846434802,"score_spread":0.22637020211967152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133718851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06934384,0.00025474167,0.9173099,0.001676543,0.00013539514,0.00010376157,0.000039129623,0.0012986925,0.009838074],"genre_scores_gemma":[0.7560529,0.00061334175,0.23120056,0.0007152128,0.00018237969,0.0003508464,0.0001571775,0.0005594593,0.010168041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955124,0.0016651235,0.00033626202,0.00038314296,0.0012757208,0.00082730985],"domain_scores_gemma":[0.9703481,0.01958378,0.0010857783,0.0064794053,0.0019326183,0.00057044596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0090055475,0.0010499951,0.0014180737,0.00086195377,0.0017740137,0.00268388,0.0023156803,0.0018272758,0.00432013],"category_scores_gemma":[0.03291757,0.00084850146,0.0009474163,0.0010856749,0.0039060884,0.012727991,0.006934017,0.004710176,0.00089487346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673422,0.00021559336,0.0027657894,0.00025801695,0.00006202164,0.00022036699,0.0012921238,0.103094496,0.006328263,0.763335,0.0041117766,0.117049225],"study_design_scores_gemma":[0.000121985315,0.00022328652,0.00023422287,0.000055591758,0.000065441716,0.0000837117,0.00031357774,0.36051816,0.007744813,0.6262851,0.004319922,0.000034189758],"about_ca_topic_score_codex":0.0017898773,"about_ca_topic_score_gemma":0.001594656,"teacher_disagreement_score":0.0090055475,"about_ca_system_score_codex":0.0013407149,"about_ca_system_score_gemma":0.00193694,"threshold_uncertainty_score":0.047626436},"labels":[],"label_agreement":null},{"id":"W2133740904","doi":"10.1109/wcnc.2003.1200662","title":"Performance evaluations of SRMTP for reliable multicasting over satellite networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Reliable multicast; Protocol Independent Multicast; Protocol (science); Satellite; Dissemination; Distributed computing; The Internet; Communications satellite; Data transmission; Broadband; IP multicast; Transmission (telecommunications); Telecommunications; Engineering","score_opus":0.024135574906256268,"score_gpt":0.28630638942365666,"score_spread":0.2621708145174004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133740904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526609,0.0016545032,0.03733546,0.00029003227,0.000059980215,0.00010915613,0.00038124676,0.0009599984,0.0065486687],"genre_scores_gemma":[0.9912629,0.0002757344,0.007782058,0.000012828351,0.000017195083,0.000042162344,0.000260542,0.000040377883,0.0003061769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788815,0.0008746457,0.00012603808,0.000120022545,0.00079069816,0.00020032251],"domain_scores_gemma":[0.9906607,0.00573299,0.000778373,0.00067224883,0.0018671867,0.0002883868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304306,0.0006373947,0.0005360806,0.0010073311,0.0004646673,0.00038087758,0.0007077381,0.0005263544,0.0009625693],"category_scores_gemma":[0.009328049,0.00015075531,0.00022248359,0.001061222,0.00037712077,0.0008238319,0.00043307486,0.00038130843,0.00021568191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022211606,0.00038887747,0.008340648,0.0005360118,0.0001316701,0.00038031754,0.00025813997,0.8333883,0.035317015,0.0038238328,0.0029287646,0.11228519],"study_design_scores_gemma":[0.00006512489,0.001136638,0.0031083974,0.000015147874,0.00003176168,0.00017633494,0.00007997049,0.9753032,0.018710546,0.0006527552,0.00069974334,0.000020475305],"about_ca_topic_score_codex":0.0023258098,"about_ca_topic_score_gemma":0.0013323481,"teacher_disagreement_score":0.0023258098,"about_ca_system_score_codex":0.0008592698,"about_ca_system_score_gemma":0.0003709518,"threshold_uncertainty_score":0.012186468},"labels":[],"label_agreement":null},{"id":"W2134091651","doi":"10.1007/s00446-008-0060-6","title":"The space complexity of unbounded timestamps","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"European Commission; University of Toronto; York University","keywords":"Timestamp; Computer science; Asynchronous communication; Upper and lower bounds; Identifier; Time complexity; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Mathematics; Programming language; Real-time computing; Computer network","score_opus":0.03477025260088355,"score_gpt":0.24936744135896993,"score_spread":0.21459718875808637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134091651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36202842,0.0078014806,0.5494653,0.030398233,0.00085895415,0.00013230644,0.0025374964,0.0014424903,0.04533524],"genre_scores_gemma":[0.952192,0.0028248143,0.034350518,0.0007305803,0.0011478809,0.00015625305,0.0007243268,0.00040054857,0.007472984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99075353,0.0028380079,0.00058993394,0.0010552556,0.003502332,0.0012609441],"domain_scores_gemma":[0.8841103,0.093969114,0.005051635,0.011365035,0.0032054123,0.0022984785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006636223,0.00096527155,0.002717498,0.0025040254,0.0029810993,0.009302873,0.0035411455,0.0033634382,0.008728581],"category_scores_gemma":[0.06823652,0.0014731832,0.0017090566,0.005500683,0.0066765705,0.03604212,0.0057966895,0.0068980022,0.0011131088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005676594,0.000067203786,0.0015483429,0.000197593,0.000048960246,0.0001842553,0.0005070518,0.07796781,0.0011124077,0.8905435,0.0070422464,0.020213023],"study_design_scores_gemma":[0.000048785223,0.000019382282,0.00018679613,0.000023149114,0.000025165054,0.00008798986,0.00007883908,0.10290884,0.00045619163,0.8947146,0.0014286068,0.000021633823],"about_ca_topic_score_codex":0.0026919034,"about_ca_topic_score_gemma":0.0016216155,"teacher_disagreement_score":0.009302873,"about_ca_system_score_codex":0.0040093297,"about_ca_system_score_gemma":0.003349597,"threshold_uncertainty_score":0.03509611},"labels":[],"label_agreement":null},{"id":"W2134167127","doi":"10.1002/cpe.756","title":"RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Database transaction; Concurrency; Focus (optics); Distributed computing; Workstation; Serializability; Transaction processing; Transaction data; Algorithm; Distributed transaction; Distributed concurrency control; Database; Operating system","score_opus":0.011562038446103748,"score_gpt":0.2916600820033734,"score_spread":0.28009804355726964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134167127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010815535,0.00007864264,0.98630863,0.000112325004,0.00003539756,0.000070267604,0.000028640785,0.001472785,0.0010777419],"genre_scores_gemma":[0.29703516,0.000047201494,0.7002592,0.00010988281,0.00003617263,0.00019308203,0.00014344149,0.00020537779,0.0019704849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819714,0.0004033571,0.0001367993,0.0003403475,0.0007176956,0.00020465076],"domain_scores_gemma":[0.99673766,0.0013330376,0.00029604175,0.0008140563,0.000659446,0.00015966373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025778606,0.00070915325,0.0009663113,0.0009964112,0.00067499257,0.0012637561,0.003086684,0.0012950912,0.0035867128],"category_scores_gemma":[0.007648019,0.0004365258,0.00066012406,0.000819125,0.0010855859,0.001761297,0.0024226164,0.0014500252,0.00073680055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005482157,0.0001398436,0.0010930848,0.00009281992,0.000059839207,0.0001323673,0.00017763994,0.59339076,0.007813005,0.0439714,0.0034178225,0.34916326],"study_design_scores_gemma":[0.0000551689,0.00002947776,0.000034333836,0.0000043132573,0.000005489025,0.000025408848,0.0000073464307,0.9897049,0.0015914947,0.007751261,0.00078310573,0.000007693649],"about_ca_topic_score_codex":0.006101005,"about_ca_topic_score_gemma":0.0035768833,"teacher_disagreement_score":0.006101005,"about_ca_system_score_codex":0.0010720509,"about_ca_system_score_gemma":0.0024952546,"threshold_uncertainty_score":0.013633192},"labels":[],"label_agreement":null},{"id":"W2134391840","doi":"10.1109/ccece.2006.277495","title":"A Formal CSP Framework for Message-Passing HPC Programming","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Message passing; Programming language; Communicating sequential processes; Formal methods; Parallel computing; Semantics (computer science); Operational semantics","score_opus":0.012638164395635991,"score_gpt":0.2593312442354833,"score_spread":0.2466930798398473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134391840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007266463,0.00018520997,0.9937232,0.00033973367,0.00005747872,0.000090970425,0.0001485874,0.00081228197,0.0039159567],"genre_scores_gemma":[0.06883334,0.00092015,0.922085,0.00036780018,0.00026006278,0.00074024824,0.00071057625,0.0004463291,0.005636589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972185,0.0009496309,0.00026587592,0.00030044912,0.0010129556,0.00025258667],"domain_scores_gemma":[0.99694186,0.0015856507,0.00025232957,0.00044728938,0.000572135,0.00020077697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036910623,0.0011737966,0.00074388186,0.0011418262,0.0019130327,0.0029281238,0.003019825,0.0011308898,0.0074474276],"category_scores_gemma":[0.005840077,0.00080662646,0.0023664809,0.0019282041,0.0035300695,0.004081005,0.00256483,0.0042551993,0.002352221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021359809,0.000023744587,0.000096148346,0.00013828602,0.000011545786,0.0001340194,0.00027327286,0.018257365,0.0011136265,0.9636427,0.0035094202,0.012778444],"study_design_scores_gemma":[0.00008186898,0.000042922857,0.00006870877,0.0000979479,0.000026408217,0.00029096467,0.00009426172,0.13776143,0.0037701488,0.74912727,0.10859002,0.000048025217],"about_ca_topic_score_codex":0.007201035,"about_ca_topic_score_gemma":0.0051737013,"teacher_disagreement_score":0.0074474276,"about_ca_system_score_codex":0.001984827,"about_ca_system_score_gemma":0.0058163325,"threshold_uncertainty_score":0.024914086},"labels":[],"label_agreement":null},{"id":"W2134403943","doi":"10.5555/1898953.1898988","title":"A new analytical method for parallel, diffusion-type load balancing","year":2006,"lang":"en","type":"article","venue":"International Parallel and Distributed Processing Symposium","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Load balancing (electrical power); Mathematical proof; Distributed computing; Key (lock); Obstacle; Type (biology); Parallel computing; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01096307121874041,"score_gpt":0.2826374801134162,"score_spread":0.2716744088946758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134403943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005783926,0.00024436112,0.99459654,0.00026780827,0.00015906098,0.00006257891,0.000023999964,0.00018073183,0.0038866266],"genre_scores_gemma":[0.11239888,0.0024598462,0.8656918,0.0010382828,0.0009877456,0.00090907176,0.00012421233,0.00063267705,0.015757376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830097,0.00031470726,0.00009155953,0.00025792213,0.00092231587,0.000112587826],"domain_scores_gemma":[0.99812657,0.00086239184,0.00017809738,0.00028712433,0.00045689472,0.00008883499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023831145,0.0013674912,0.00090576924,0.002324624,0.0013770452,0.0018327127,0.0027799467,0.0013135481,0.0076750866],"category_scores_gemma":[0.0068707475,0.000797773,0.0015046492,0.0014646302,0.0025987085,0.0054350337,0.0028208161,0.0039223763,0.00233263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039708808,0.00007060091,0.00017454805,0.00040628287,0.000057211986,0.00018361043,0.00026631955,0.030365221,0.020857036,0.8908874,0.0073115025,0.049380608],"study_design_scores_gemma":[0.000071408926,0.00010255972,0.00014468978,0.000121922254,0.00006511984,0.0005948188,0.000069490285,0.41784015,0.010779386,0.49620578,0.07392322,0.000081316706],"about_ca_topic_score_codex":0.00080089405,"about_ca_topic_score_gemma":0.00065079203,"teacher_disagreement_score":0.0076750866,"about_ca_system_score_codex":0.0015584684,"about_ca_system_score_gemma":0.0020902168,"threshold_uncertainty_score":0.025675714},"labels":[],"label_agreement":null},{"id":"W2134703599","doi":"10.1109/tpds.2006.146","title":"Tight Bounds for Critical Sections in Processor Consistent Platforms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Sequential consistency; Computer science; Consistency (knowledge bases); Consistency model; Algorithm; Strong consistency; Upper and lower bounds; Extension (predicate logic); Variable (mathematics); Theoretical computer science; Mathematics; Programming language; Artificial intelligence; Statistics","score_opus":0.016551133402456432,"score_gpt":0.2537222123865423,"score_spread":0.23717107898408588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134703599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09070504,0.0027539742,0.88530517,0.0020001952,0.00024723163,0.00036993783,0.0001745374,0.002726631,0.015717238],"genre_scores_gemma":[0.75781786,0.0012833955,0.22798276,0.0009322691,0.00033733845,0.00072293024,0.0002732767,0.0013278438,0.009322353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858606,0.0023107326,0.00075006206,0.002785417,0.0052336063,0.003059595],"domain_scores_gemma":[0.936952,0.04065934,0.005292481,0.009682611,0.005050848,0.0023626734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010895789,0.0023172616,0.0019750267,0.0038997207,0.0037144348,0.006858333,0.005644111,0.0024149227,0.0067257634],"category_scores_gemma":[0.060845893,0.0024327787,0.0016287046,0.0018914632,0.0069473838,0.015597485,0.008016721,0.0064043887,0.0015139608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015020642,0.00037864756,0.00424553,0.0006279517,0.00016043485,0.0005245705,0.0015672251,0.29891354,0.025319276,0.5770365,0.006259473,0.08346479],"study_design_scores_gemma":[0.00011617101,0.00031771295,0.0006167923,0.00018814116,0.0001040557,0.00018434213,0.00024751003,0.4439931,0.022329558,0.524996,0.006838568,0.000068087014],"about_ca_topic_score_codex":0.0032826427,"about_ca_topic_score_gemma":0.0041477303,"teacher_disagreement_score":0.010895789,"about_ca_system_score_codex":0.007382181,"about_ca_system_score_gemma":0.0061606825,"threshold_uncertainty_score":0.057623148},"labels":[],"label_agreement":null},{"id":"W2134867079","doi":"10.1109/ccece.1996.548316","title":"The converging flows protocol: design and analysis using SDL","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Manitoba","funders":"","keywords":"Computer science; Protocol (science); Computer network; Protocol design; Distributed computing; Communications protocol","score_opus":0.04147936772010949,"score_gpt":0.2700187958129653,"score_spread":0.2285394280928558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134867079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067480514,0.00009507813,0.9893826,0.00012429511,0.000025509573,0.0004129927,0.00007681766,0.0014463016,0.0016884421],"genre_scores_gemma":[0.22580819,0.0005249688,0.768702,0.00017477987,0.000035561618,0.0015041089,0.00049173884,0.00041962168,0.0023390574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938029,0.0019391477,0.0005680152,0.00035635123,0.0029596603,0.0003738249],"domain_scores_gemma":[0.99277943,0.003879344,0.00057182147,0.0007013748,0.0019077857,0.00016024042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081281215,0.00083196495,0.0007018867,0.001550376,0.0006722032,0.0026083991,0.0021155202,0.00087550184,0.0023759368],"category_scores_gemma":[0.011245834,0.0009390823,0.0009413676,0.00086625625,0.001875184,0.002423438,0.0013757495,0.0019805094,0.00048206424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003903916,0.00033237046,0.0038430067,0.0009066677,0.00014223153,0.00074533274,0.00085842714,0.51345414,0.02025416,0.28558415,0.004330414,0.16915864],"study_design_scores_gemma":[0.00009895953,0.00016861105,0.0001316968,0.00008379648,0.00004864197,0.00015609179,0.000071158065,0.95220757,0.017409299,0.019845206,0.009743989,0.000034921548],"about_ca_topic_score_codex":0.0042908965,"about_ca_topic_score_gemma":0.0028938802,"teacher_disagreement_score":0.0081281215,"about_ca_system_score_codex":0.0017701505,"about_ca_system_score_gemma":0.0040360587,"threshold_uncertainty_score":0.042986155},"labels":[],"label_agreement":null},{"id":"W2135133376","doi":"10.1109/icppw.2001.951979","title":"A mechanism for the dynamic construction of clusters using active networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Scalability; Distributed computing; Exploit; Scheduling (production processes); Construct (python library); Service (business); Anonymity; Computer network; Active networking; Fault tolerance; Computer security; Database; Engineering","score_opus":0.019721532850185998,"score_gpt":0.23998550029746518,"score_spread":0.2202639674472792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135133376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054427376,0.00023996546,0.98582286,0.00034329976,0.00016150853,0.00017259817,0.00006512895,0.0029999015,0.004752001],"genre_scores_gemma":[0.23052555,0.0006088353,0.7469114,0.00040764787,0.0003244376,0.001041797,0.00048762595,0.000710116,0.018982625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976561,0.0004961067,0.00016025298,0.0005351967,0.00091551145,0.00023679451],"domain_scores_gemma":[0.9936792,0.0015789866,0.0005559096,0.0027985298,0.0007898239,0.0005975115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002954489,0.00077488687,0.0008083062,0.0014488719,0.0030412392,0.0031767995,0.006282152,0.0015499037,0.006921885],"category_scores_gemma":[0.0059648026,0.0010727359,0.00090761454,0.0014233894,0.0021078645,0.0068355794,0.006882298,0.0026518435,0.002392019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000609684,0.0003700432,0.001990613,0.00053691195,0.00021163093,0.00049112045,0.001931082,0.063719556,0.031920385,0.6093833,0.026174743,0.26266092],"study_design_scores_gemma":[0.0002324048,0.0003537749,0.00078941893,0.00013964663,0.00015901307,0.00068506086,0.00047298442,0.34709173,0.04452322,0.26108238,0.3442162,0.00025417656],"about_ca_topic_score_codex":0.0015472427,"about_ca_topic_score_gemma":0.0020385978,"teacher_disagreement_score":0.006921885,"about_ca_system_score_codex":0.0011714201,"about_ca_system_score_gemma":0.0011685743,"threshold_uncertainty_score":0.023156047},"labels":[],"label_agreement":null},{"id":"W2135498668","doi":"10.1109/icdsc.2001.918989","title":"A hierarchical cluster algorithm for dynamic, centralized timestamps","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Scalability; Computation; Event (particle physics); Algorithm; Theoretical computer science; Parallel computing; Real-time computing; Database","score_opus":0.01294108456315003,"score_gpt":0.24343031406330035,"score_spread":0.23048922950015033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135498668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044958727,0.0001604823,0.9902846,0.00007789751,0.00006477984,0.00013832051,0.00014705214,0.0024542545,0.002176631],"genre_scores_gemma":[0.05352586,0.0001233891,0.94077325,0.00004543094,0.000037521353,0.00018134463,0.00058825186,0.0003074555,0.0044174823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998776,0.00014701986,0.00010293292,0.0002895074,0.0005455141,0.00013891327],"domain_scores_gemma":[0.9985856,0.00025127933,0.00011814268,0.0004269284,0.0005154295,0.0001026978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541123,0.00074439886,0.00081464526,0.0024533921,0.0016186538,0.0015945619,0.0021338856,0.0007224091,0.005953022],"category_scores_gemma":[0.0041266484,0.000501368,0.0006804505,0.003221031,0.0007121965,0.002496329,0.0024294853,0.0010979348,0.0029424783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004997173,0.0001486412,0.0012774391,0.00022403007,0.00008494152,0.000099150755,0.00046398645,0.12821828,0.015883984,0.11396402,0.024230706,0.71490514],"study_design_scores_gemma":[0.00020786324,0.00021899902,0.0005934795,0.000045838762,0.0000643735,0.00020550877,0.0002340649,0.87084234,0.017925538,0.06534493,0.04422167,0.00009532259],"about_ca_topic_score_codex":0.008727706,"about_ca_topic_score_gemma":0.010632904,"teacher_disagreement_score":0.008727706,"about_ca_system_score_codex":0.0018556932,"about_ca_system_score_gemma":0.0034797848,"threshold_uncertainty_score":0.019914806},"labels":[],"label_agreement":null},{"id":"W2135723947","doi":"10.1145/1148109.1148155","title":"Symmetric network computation","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computation; Equivalence (formal languages); Theoretical computer science; Automaton; Finite-state machine; Node (physics); Graph; Algorithm; Distributed computing; Discrete mathematics; Mathematics","score_opus":0.007465436418637917,"score_gpt":0.21511192602698204,"score_spread":0.20764648960834411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135723947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011956292,0.00018702696,0.9590953,0.0004930153,0.00015886372,0.000086111075,0.00023842651,0.0006543671,0.027130762],"genre_scores_gemma":[0.6054952,0.0008165559,0.3669784,0.0003736968,0.00016086653,0.00045161508,0.0008673056,0.00028507004,0.024571232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00021356961,0.0000518571,0.00017602256,0.00022905903,0.000100692356],"domain_scores_gemma":[0.999035,0.0003008509,0.00006073059,0.00039669737,0.00014418707,0.00006250632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070593215,0.0004573883,0.00050218374,0.0005884189,0.0007693893,0.0017460802,0.0015229392,0.000734161,0.009495646],"category_scores_gemma":[0.0027004275,0.00024033836,0.0007983776,0.0007169573,0.0014022052,0.0042962804,0.0019827508,0.0011298443,0.0015633472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027851805,0.000018358935,0.00011577847,0.000039861752,0.000010118801,0.000046943012,0.00006003026,0.024953965,0.0011503233,0.9569985,0.0017622141,0.014815992],"study_design_scores_gemma":[0.000017943761,0.000018235583,0.000038558443,0.000014513268,0.0000102204,0.00006735334,0.000028657645,0.20792095,0.002139853,0.7725518,0.017182438,0.000009569111],"about_ca_topic_score_codex":0.0011850118,"about_ca_topic_score_gemma":0.0015573654,"teacher_disagreement_score":0.009495646,"about_ca_system_score_codex":0.0012457507,"about_ca_system_score_gemma":0.0010615385,"threshold_uncertainty_score":0.031766117},"labels":[],"label_agreement":null},{"id":"W2136058416","doi":"10.1007/s00778-006-0026-x","title":"Extending DBMSs with satellite databases","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Middleware (distributed applications); Database; Architecture; Satellite; Distributed computing","score_opus":0.012294103049097956,"score_gpt":0.2241104797065471,"score_spread":0.21181637665744915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136058416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13317426,0.002428932,0.82426375,0.0012740508,0.0003755764,0.00015022577,0.0005476364,0.016859302,0.020926358],"genre_scores_gemma":[0.54792625,0.0022953898,0.43643188,0.0005325383,0.0003139777,0.00010366968,0.0014381289,0.0014133997,0.00954474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987649,0.0002770021,0.00019162451,0.00017384444,0.00045437028,0.0001384277],"domain_scores_gemma":[0.99598986,0.00083403295,0.00018331215,0.0023471075,0.0004827012,0.00016301183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018474226,0.00044048994,0.0007182898,0.0011063673,0.0007095409,0.0025794965,0.0017051145,0.00087960577,0.0035699406],"category_scores_gemma":[0.0057190075,0.00081015524,0.0008806658,0.0024111555,0.00086378393,0.0062612155,0.0041190973,0.0014213042,0.0012016834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084585155,0.00038792662,0.017197903,0.0010192113,0.00037064365,0.0014454324,0.0027449667,0.058212407,0.05354891,0.18571596,0.021475842,0.65703493],"study_design_scores_gemma":[0.0002537331,0.00043808963,0.0029469028,0.00029950115,0.0005892937,0.0019063542,0.00095242466,0.29784268,0.06632508,0.24859482,0.3796961,0.00015504833],"about_ca_topic_score_codex":0.0023325447,"about_ca_topic_score_gemma":0.0029791726,"teacher_disagreement_score":0.0035699406,"about_ca_system_score_codex":0.0003935452,"about_ca_system_score_gemma":0.0005474991,"threshold_uncertainty_score":0.011942625},"labels":[],"label_agreement":null},{"id":"W2136644108","doi":"","title":"Local-spin algorithms for variants of mutual exclusion using read and write operations","year":2011,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Shared memory; Algorithm; Parallel computing; Theoretical computer science","score_opus":0.04976495451208679,"score_gpt":0.35355842776603424,"score_spread":0.30379347325394745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136644108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03234654,0.00044257072,0.9574779,0.00026537268,0.00009624516,0.00017270961,0.00006492225,0.002060987,0.0070727454],"genre_scores_gemma":[0.4679362,0.0002893161,0.5213063,0.0002901387,0.00016353838,0.00037140158,0.00048060872,0.00046766098,0.008694931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977557,0.00046540005,0.00020335875,0.00049121695,0.0007317673,0.0003525583],"domain_scores_gemma":[0.99442047,0.002153842,0.00044257002,0.0019389341,0.000807074,0.00023719108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942548,0.00087449147,0.001023487,0.0007712539,0.0015405436,0.0020829004,0.003467514,0.001094166,0.005272353],"category_scores_gemma":[0.007402369,0.00039220197,0.00097420486,0.0011452956,0.0014448859,0.0042737178,0.0031314506,0.002456801,0.0010355755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00103805,0.0005046345,0.0035234457,0.00040382406,0.00014664841,0.0001621715,0.00088977936,0.1694803,0.010797029,0.3059283,0.012515042,0.4946108],"study_design_scores_gemma":[0.0001858197,0.00020109671,0.00039685302,0.00003073759,0.0000679337,0.00018033243,0.00020588444,0.8205569,0.010678491,0.1576753,0.009768554,0.000052066713],"about_ca_topic_score_codex":0.002959903,"about_ca_topic_score_gemma":0.0061246185,"teacher_disagreement_score":0.005272353,"about_ca_system_score_codex":0.0016962464,"about_ca_system_score_gemma":0.0025149432,"threshold_uncertainty_score":0.01763779},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007920401738214577,"score_gpt":0.2170953614075504,"score_spread":0.20917495966933583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136651966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009169206,0.00042964343,0.9793937,0.00022583902,0.00010740348,0.00015053034,0.00015483426,0.0026989183,0.007669974],"genre_scores_gemma":[0.1596668,0.0008896838,0.8144295,0.00059501594,0.00019602616,0.0006925779,0.000664503,0.0010757725,0.02179017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971529,0.0004584751,0.00028516763,0.00031256457,0.001391781,0.00039915275],"domain_scores_gemma":[0.994806,0.0012634759,0.0006319663,0.0019418586,0.0011201133,0.00023664035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905021,0.00078983663,0.0006534262,0.0015724577,0.0016948921,0.004362117,0.003355475,0.0015857575,0.008845168],"category_scores_gemma":[0.008626421,0.00086724234,0.00083995797,0.0023755978,0.0023281954,0.008994821,0.0044565746,0.0017327542,0.0033559864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028411832,0.00009285573,0.00081973657,0.00032127823,0.00004593536,0.00014548723,0.00039849212,0.015382148,0.0090147685,0.7787342,0.010063546,0.18469751],"study_design_scores_gemma":[0.00021815213,0.0002986103,0.0003046759,0.0001488852,0.00010723573,0.00043770313,0.00019691268,0.12434212,0.05406458,0.67918825,0.14054228,0.00015059036],"about_ca_topic_score_codex":0.0017224532,"about_ca_topic_score_gemma":0.0021494892,"teacher_disagreement_score":0.008845168,"about_ca_system_score_codex":0.0012913843,"about_ca_system_score_gemma":0.0023344085,"threshold_uncertainty_score":0.02959007},"labels":[],"label_agreement":null},{"id":"W2136674263","doi":"10.1145/1150019.1136504","title":"Tolerating Dependences Between Large Speculative Threads Via Sub-Threads","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Speculative multithreading; Thread (computing); Computer science; Parallel computing; Speculative execution; Speculation; Speedup; Multiprocessing; Multithreading; Operating system","score_opus":0.010879644601878383,"score_gpt":0.2432773610961072,"score_spread":0.23239771649422883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136674263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70094913,0.0008640839,0.28624347,0.00054240535,0.00012653062,0.00012960115,0.00008637638,0.007180566,0.0038778773],"genre_scores_gemma":[0.939301,0.00012746027,0.05874558,0.00009739149,0.00003499416,0.000055870718,0.000090143214,0.00015324447,0.0013942041],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992422,0.00015544548,0.00008274706,0.00010778057,0.00025223085,0.00015963169],"domain_scores_gemma":[0.9953283,0.0014569551,0.000509287,0.0019616853,0.00050440343,0.0002393712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010811049,0.00054002705,0.0004943504,0.00044830554,0.00042872716,0.00084350473,0.0015109184,0.00036047492,0.0018270834],"category_scores_gemma":[0.0037320342,0.00038677736,0.0003416885,0.00036397242,0.00060512853,0.0013759389,0.0012523612,0.00084993703,0.00031182196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029712748,0.00050397025,0.028602831,0.00039542143,0.00018084678,0.00068188016,0.0010911928,0.086032294,0.5051938,0.01785444,0.0054776277,0.35101444],"study_design_scores_gemma":[0.00032245758,0.0013159921,0.0045793005,0.000041642248,0.00015399723,0.00030780755,0.00020545255,0.7282506,0.24289213,0.008272757,0.013598913,0.000058920315],"about_ca_topic_score_codex":0.0013028888,"about_ca_topic_score_gemma":0.0020145176,"teacher_disagreement_score":0.0018270834,"about_ca_system_score_codex":0.00036854096,"about_ca_system_score_gemma":0.0010417621,"threshold_uncertainty_score":0.006112218},"labels":[],"label_agreement":null},{"id":"W2136842955","doi":"10.1109/iros.2006.281868","title":"An Analysis of Random Peer-to-Peer Communication for System-Level Coordination in Decentralized Multiple-Robot Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robot; Computer science; Peer-to-peer; Distributed computing; Software deployment; Task (project management); Population; State (computer science); Protocol (science); Human–computer interaction; Artificial intelligence; Engineering; Algorithm","score_opus":0.02317898170054228,"score_gpt":0.2876586657369643,"score_spread":0.264479684036422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136842955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04137444,0.0014831695,0.93656826,0.0015714493,0.00008772588,0.00015989903,0.00009109043,0.00035842045,0.018305533],"genre_scores_gemma":[0.9438533,0.0015002129,0.04782126,0.00027010156,0.0001903772,0.00044080106,0.00009238812,0.00025574167,0.0055758734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971487,0.0011448221,0.000083752704,0.000253492,0.0009576127,0.00041158512],"domain_scores_gemma":[0.9877621,0.00932064,0.0011290518,0.00057325326,0.00089503883,0.0003198381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964079,0.0010517025,0.0013861913,0.0013516807,0.0013862698,0.0013581397,0.0020986223,0.0016776745,0.0048116865],"category_scores_gemma":[0.020741327,0.0007186592,0.0010131975,0.0010238258,0.0026420285,0.0033093872,0.0018145785,0.0015398463,0.0006676067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055911984,0.000027142314,0.00033914257,0.00015090838,0.000037058544,0.0001891929,0.00017302885,0.81846553,0.0017221578,0.17035662,0.0019367802,0.00654653],"study_design_scores_gemma":[0.000008759801,0.000023546989,0.00010721126,0.000010367638,0.000009823403,0.00004137499,0.000024363337,0.96196,0.00017623548,0.036977023,0.0006524,0.000008868088],"about_ca_topic_score_codex":0.00300454,"about_ca_topic_score_gemma":0.001255072,"teacher_disagreement_score":0.0048116865,"about_ca_system_score_codex":0.0025363632,"about_ca_system_score_gemma":0.0014761194,"threshold_uncertainty_score":0.020964324},"labels":[],"label_agreement":null},{"id":"W2137031274","doi":"10.1007/3-540-45414-4_14","title":"Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Spanning tree; Computer science; Distributed minimum spanning tree; Minimum spanning tree; Message passing; Atomicity; Identifier; Self-stabilization; Tree (set theory); Distributed computing; Connected dominating set; Euclidean minimum spanning tree; Theoretical computer science; Distributed algorithm; Algorithm; Computer network; Discrete mathematics; Combinatorics; Mathematics; Database transaction","score_opus":0.014065851578548462,"score_gpt":0.2336594783033897,"score_spread":0.21959362672484126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137031274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071222275,0.0002444913,0.92313856,0.00021493823,0.00005597932,0.000053542426,0.000049825423,0.00072883593,0.0042915693],"genre_scores_gemma":[0.62611634,0.00035377184,0.3676031,0.000059825958,0.00005486196,0.0001374142,0.00021702757,0.0001347777,0.0053228633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997743,0.000068976944,0.000012149566,0.000035468383,0.00008328917,0.000025776226],"domain_scores_gemma":[0.9995216,0.00018809891,0.000044878376,0.00011997208,0.00009184991,0.000033561195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036283906,0.00026335378,0.00051157916,0.0005560213,0.0006109518,0.00054864626,0.0010311636,0.00055620045,0.0010751494],"category_scores_gemma":[0.0013208601,0.00030021652,0.00030361128,0.00073811476,0.00038269337,0.0010712459,0.000988757,0.00067819405,0.00027427785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031077614,0.00017624996,0.00087254343,0.00031832565,0.00007542543,0.00017827643,0.00042208654,0.35095295,0.062559016,0.24205303,0.0063474253,0.33573392],"study_design_scores_gemma":[0.000034808003,0.00008198925,0.0003253186,0.000019675545,0.000028002696,0.00010221084,0.000040160317,0.87508994,0.0136574125,0.10728425,0.0033214742,0.000014746199],"about_ca_topic_score_codex":0.0004942448,"about_ca_topic_score_gemma":0.0006244855,"teacher_disagreement_score":0.0010751494,"about_ca_system_score_codex":0.0004030264,"about_ca_system_score_gemma":0.00039925324,"threshold_uncertainty_score":0.003596723},"labels":[],"label_agreement":null},{"id":"W2137343359","doi":"10.3844/jcssp.2006.33.47","title":"Redundancy Schemes for High Availability Computer Clusters","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Redundancy (engineering); Data mining; Operating system","score_opus":0.00988911195403122,"score_gpt":0.24155163656874493,"score_spread":0.2316625246147137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137343359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.300826,0.0019096937,0.6884356,0.0007376286,0.000099396275,0.00015168659,0.00015671251,0.0012058913,0.0064772805],"genre_scores_gemma":[0.95093375,0.00042746574,0.04695601,0.000048276066,0.000023269606,0.00008437774,0.00006300344,0.000048044676,0.0014157854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.0003932479,0.000038498933,0.00007914188,0.0003252075,0.0000875634],"domain_scores_gemma":[0.99763,0.0012228433,0.0003476073,0.0004177667,0.00031906072,0.00006270861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012068064,0.000322998,0.00037453094,0.00052215665,0.00051278574,0.00067266176,0.0011370957,0.0006125578,0.0015282627],"category_scores_gemma":[0.0049513443,0.0002660486,0.00038816713,0.00053913955,0.00065164914,0.001237239,0.000562582,0.0006127102,0.00023707586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001772421,0.00006431317,0.0011668063,0.00021856252,0.000040883726,0.00020714586,0.00022809919,0.8723077,0.019825032,0.086271904,0.0016764365,0.017815908],"study_design_scores_gemma":[0.000045204135,0.00013245345,0.0005127571,0.000016327507,0.000019170302,0.00015044969,0.00004059518,0.97523785,0.0048437747,0.016215786,0.0027650474,0.000020592519],"about_ca_topic_score_codex":0.0012554658,"about_ca_topic_score_gemma":0.0007640368,"teacher_disagreement_score":0.0015282627,"about_ca_system_score_codex":0.0009886435,"about_ca_system_score_gemma":0.00055884337,"threshold_uncertainty_score":0.0071731806},"labels":[],"label_agreement":null},{"id":"W2137436235","doi":"10.5381/jot.2004.3.5.c1","title":"Message Oriented Programming - The Case for First Class Messages.","year":2004,"lang":"en","type":"article","venue":"The Journal of Object Technology","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Class (philosophy); Programming language; Artificial intelligence","score_opus":0.010988398487089669,"score_gpt":0.2509882756559911,"score_spread":0.23999987716890142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137436235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004344132,0.0049429513,0.8534068,0.018609697,0.0020596366,0.00022215369,0.00028876966,0.0047642817,0.11136174],"genre_scores_gemma":[0.17754923,0.005965186,0.6993691,0.0065391464,0.0019548116,0.00068633753,0.0005850801,0.0027312147,0.10461988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961665,0.0011068294,0.00016056815,0.0007302406,0.0013196148,0.00051627966],"domain_scores_gemma":[0.99288017,0.0032164082,0.00049058656,0.0022305364,0.0007139674,0.0004684126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036262707,0.00074347254,0.0006583576,0.0008127929,0.0018394461,0.006840988,0.0024282362,0.0032378323,0.012845395],"category_scores_gemma":[0.014536892,0.0006451747,0.0010752369,0.0011937142,0.0042558378,0.014835473,0.003385017,0.006581044,0.005708989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002636798,0.000023546247,0.00020393218,0.00014646427,0.000008431572,0.00010171489,0.0005473763,0.00036082507,0.00051286985,0.9484001,0.015097762,0.03457067],"study_design_scores_gemma":[0.000017484504,0.000016873157,0.00008851675,0.00016721497,0.000013480925,0.00054732646,0.00017152613,0.0030373146,0.0014150476,0.70242643,0.29208374,0.000015126227],"about_ca_topic_score_codex":0.0008876045,"about_ca_topic_score_gemma":0.0009363212,"teacher_disagreement_score":0.012845395,"about_ca_system_score_codex":0.0013491907,"about_ca_system_score_gemma":0.0017418384,"threshold_uncertainty_score":0.042972147},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004726351572055682,"score_gpt":0.22857777259807088,"score_spread":0.2238514210260152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137845880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17840159,0.00075595366,0.80733097,0.0013596762,0.00026676763,0.00011071239,0.00011319516,0.0005381943,0.011122916],"genre_scores_gemma":[0.9642468,0.00040257638,0.0288713,0.00013137373,0.00020431408,0.00013435213,0.00007919235,0.00007784676,0.0058523263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644405,0.0012774956,0.00024838705,0.0006790871,0.0008159848,0.00053509965],"domain_scores_gemma":[0.9713936,0.01976503,0.002249929,0.0032281962,0.001821996,0.0015412698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048175533,0.0004608536,0.0016109454,0.0011881794,0.0020956176,0.0035215404,0.0019107269,0.0018515545,0.0036165027],"category_scores_gemma":[0.024612917,0.000705728,0.00060072873,0.0016663173,0.0032929264,0.007955719,0.0040211184,0.0026451766,0.000531668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041751037,0.000077738354,0.0009939123,0.000094949464,0.00002164957,0.00036961195,0.00065870414,0.06772644,0.0021418065,0.9101035,0.0014317778,0.015962327],"study_design_scores_gemma":[0.00010776401,0.00006156762,0.00019613301,0.000013683302,0.000029599261,0.00010589687,0.00019184373,0.27978745,0.0011653135,0.7161804,0.0021420196,0.000018384015],"about_ca_topic_score_codex":0.001426982,"about_ca_topic_score_gemma":0.0012856195,"teacher_disagreement_score":0.0048175533,"about_ca_system_score_codex":0.0015139162,"about_ca_system_score_gemma":0.0017414668,"threshold_uncertainty_score":0.025478005},"labels":[],"label_agreement":null},{"id":"W2138859256","doi":"10.1016/j.scico.2004.07.003","title":"Relational characterizations of system fault tolerance","year":2004,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Fault tolerance; Range (aeronautics); Software fault tolerance; Reliability engineering; Theoretical computer science; Algorithm; Distributed computing","score_opus":0.016303384051068966,"score_gpt":0.23842279993898138,"score_spread":0.22211941588791242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138859256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08426201,0.0012323057,0.87972176,0.0019662264,0.00013957772,0.00008602956,0.00043082322,0.0010438353,0.031117404],"genre_scores_gemma":[0.9009362,0.0012216227,0.08477462,0.0005708088,0.00058504887,0.00024194091,0.0007958451,0.00035268225,0.010521268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693465,0.0005633988,0.00026073406,0.0005700525,0.0011391893,0.0005318944],"domain_scores_gemma":[0.9889535,0.0053061717,0.0015074827,0.0021353276,0.0016013666,0.00049622456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024425674,0.0006375918,0.00084258657,0.0029090869,0.0016864263,0.005472292,0.0025101297,0.0014744196,0.0069959206],"category_scores_gemma":[0.012234854,0.0007078174,0.0008602156,0.0029663227,0.0041375384,0.01357185,0.002697441,0.0030769152,0.00087855256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004037126,0.000023395392,0.000556188,0.000055711433,0.00001431813,0.000061730185,0.00057290687,0.006012995,0.0010423022,0.98100454,0.0009066394,0.009708855],"study_design_scores_gemma":[0.00001723301,0.000029589337,0.0003632309,0.00002350738,0.000039008268,0.00011362598,0.00023936632,0.025592797,0.0014908296,0.9660158,0.0060571893,0.000017714054],"about_ca_topic_score_codex":0.0020621577,"about_ca_topic_score_gemma":0.0011592,"teacher_disagreement_score":0.0069959206,"about_ca_system_score_codex":0.0019859807,"about_ca_system_score_gemma":0.0009927574,"threshold_uncertainty_score":0.023403645},"labels":[],"label_agreement":null},{"id":"W2139278390","doi":"10.1109/ccece.1995.526417","title":"Existence and design of supervisors for vector discrete event systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Supervisor; Event (particle physics); Computer science; Discrete event simulation; Simulation; Physics","score_opus":0.046151134919555935,"score_gpt":0.2466430656381391,"score_spread":0.20049193071858315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139278390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011561384,0.000541014,0.9859103,0.000094010546,0.000025626308,0.000032241383,0.000016070642,0.00022001786,0.0015993548],"genre_scores_gemma":[0.79717493,0.0010550516,0.1991892,0.00006398531,0.000053088803,0.00016296955,0.00010175699,0.000046242214,0.0021527372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993844,0.00016132942,0.000049908558,0.00015916243,0.00018482353,0.000060358554],"domain_scores_gemma":[0.9976948,0.0015668025,0.00027792162,0.00014752791,0.0002535665,0.000059346254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011299547,0.00039022535,0.00045456653,0.00031680247,0.00023166412,0.00076295703,0.00064684777,0.00046902144,0.0012635214],"category_scores_gemma":[0.0033320547,0.00041202444,0.00027721518,0.0001998015,0.0007755148,0.00098227,0.00084687833,0.0007307606,0.00019535069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002859046,0.00012822321,0.0012994437,0.0010986235,0.000053395852,0.0002790484,0.0006544749,0.4529505,0.047073796,0.23316878,0.0015577466,0.26145005],"study_design_scores_gemma":[0.00006235275,0.0003488989,0.00027167946,0.00008996049,0.000026198253,0.00014465091,0.000087681925,0.908488,0.01789122,0.06592519,0.006643657,0.000020607082],"about_ca_topic_score_codex":0.000208033,"about_ca_topic_score_gemma":0.0003148156,"teacher_disagreement_score":0.0012635214,"about_ca_system_score_codex":0.00026798339,"about_ca_system_score_gemma":0.0005433078,"threshold_uncertainty_score":0.0059758425},"labels":[],"label_agreement":null},{"id":"W2139506117","doi":"10.1109/qest.2007.25","title":"Performance Modeling of a Quorum Pattern in Layered Service Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scalability; Computer science; Distributed computing; Quorum sensing; Service (business); Value (mathematics); Database; Machine learning","score_opus":0.020453226540657662,"score_gpt":0.2340944142484767,"score_spread":0.21364118770781904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139506117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27060732,0.0005751191,0.71238095,0.0010060144,0.00008271607,0.00012036827,0.00019950957,0.0005916381,0.014436458],"genre_scores_gemma":[0.9796982,0.00018526232,0.017300706,0.00004361332,0.000023198076,0.000074684685,0.000053607917,0.00003736783,0.0025834283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.0003548336,0.00006592658,0.00012958638,0.0004076864,0.00015654656],"domain_scores_gemma":[0.9980135,0.0009342599,0.0002726225,0.00017812647,0.0004711236,0.00013044682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016071905,0.0005918279,0.00051173696,0.0006189234,0.00059571984,0.0016575207,0.0012819964,0.0012018965,0.0014536711],"category_scores_gemma":[0.0065495637,0.00036505802,0.00039658524,0.0005841311,0.00094252476,0.0016347226,0.0009791758,0.0006120544,0.00043101952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056268746,0.00002628084,0.0010411234,0.0000294364,0.000011456682,0.000090117566,0.00011655186,0.96858144,0.0023153115,0.02274907,0.00027906647,0.004703843],"study_design_scores_gemma":[0.0000019570152,0.000007855335,0.00005984987,0.0000014888045,0.0000013763428,0.0000067183255,0.000006385435,0.99677867,0.000114368326,0.002933185,0.00008565653,0.0000024453432],"about_ca_topic_score_codex":0.00789895,"about_ca_topic_score_gemma":0.0020417648,"teacher_disagreement_score":0.00789895,"about_ca_system_score_codex":0.0017576203,"about_ca_system_score_gemma":0.0009870332,"threshold_uncertainty_score":0.015705943},"labels":[],"label_agreement":null},{"id":"W2140232791","doi":"10.1145/1693453.1693496","title":"Towards scalable and transparent parallelization of multiplayer games using transactional memory support","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Software transactional memory; Computer science; Scalability; Lock (firearm); Transactional leadership; Parallel computing; Software; Distributed computing; Computer architecture; Programming language; Operating system; Database transaction","score_opus":0.02657940520419108,"score_gpt":0.2686872640475938,"score_spread":0.24210785884340272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140232791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22162773,0.0005452088,0.7648969,0.0003966163,0.00011216855,0.00017769396,0.000044136632,0.0045358157,0.0076636765],"genre_scores_gemma":[0.71811146,0.00028463893,0.27837265,0.00008332827,0.000041721534,0.00013384022,0.00011262536,0.00027126164,0.002588562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994802,0.00013460405,0.00003527736,0.000073167044,0.00018178923,0.000094986994],"domain_scores_gemma":[0.99908066,0.00029324924,0.00006466352,0.00031428065,0.00016242695,0.000084694686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552259,0.0006373039,0.00051861233,0.00029310863,0.00060842896,0.0012180639,0.0016937711,0.00048184834,0.0022609688],"category_scores_gemma":[0.0020800845,0.00037702225,0.00047679528,0.0004004975,0.00062494096,0.0015409163,0.0016606704,0.0014434755,0.0004283254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002169536,0.0007501019,0.0037189282,0.00048400534,0.00023480489,0.0007544503,0.0010768687,0.26789114,0.2636329,0.06504633,0.008269263,0.38597164],"study_design_scores_gemma":[0.00014522953,0.00016403542,0.00034880306,0.000010463438,0.000030084637,0.00008170906,0.00008357649,0.9460403,0.037109036,0.011909019,0.0040610405,0.000016690703],"about_ca_topic_score_codex":0.0019605723,"about_ca_topic_score_gemma":0.0023756032,"teacher_disagreement_score":0.0022609688,"about_ca_system_score_codex":0.0003845473,"about_ca_system_score_gemma":0.00072411605,"threshold_uncertainty_score":0.00756377},"labels":[],"label_agreement":null},{"id":"W2141280424","doi":"10.1109/dest.2012.6227919","title":"Mobile event-oriented digital ecosystem","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Digital ecosystem; Computer science; Scalability; Event (particle physics); Situated; Cloud computing; Loose coupling; Resource (disambiguation); Mobile computing; Mobile device; Distributed computing; Human–computer interaction; World Wide Web; Telecommunications; Computer network; Database; Operating system","score_opus":0.007608433677959786,"score_gpt":0.23238188844147445,"score_spread":0.22477345476351465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141280424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1150936,0.0014034887,0.7870033,0.0030179778,0.00066839403,0.00037813274,0.00038473817,0.0027061931,0.089344166],"genre_scores_gemma":[0.89605325,0.0010053504,0.0772977,0.00044675698,0.00023648684,0.0002373092,0.00037279227,0.00007033489,0.024279974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969506,0.000070988426,0.000027634105,0.00006631227,0.00008981372,0.000050117942],"domain_scores_gemma":[0.99949646,0.00012423295,0.000062863335,0.00010434411,0.00010116793,0.000110901514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044955194,0.00025296866,0.00026183508,0.000443892,0.0008349132,0.0022468977,0.00076287164,0.0008950078,0.004382037],"category_scores_gemma":[0.0012351114,0.00013853081,0.00026181064,0.0004837534,0.00052506936,0.00213646,0.0018823696,0.0006126387,0.0008936376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003636998,0.0002641893,0.0039957794,0.000357519,0.000080157355,0.0034634913,0.001437572,0.06980027,0.029170856,0.72188056,0.013707989,0.15547805],"study_design_scores_gemma":[0.00014421847,0.00026159236,0.0020332723,0.000099487916,0.00009907237,0.0027288967,0.0012124839,0.36994636,0.011138233,0.35361734,0.25864145,0.0000775189],"about_ca_topic_score_codex":0.0004729022,"about_ca_topic_score_gemma":0.00041298073,"teacher_disagreement_score":0.004382037,"about_ca_system_score_codex":0.00045630592,"about_ca_system_score_gemma":0.00043160663,"threshold_uncertainty_score":0.014659405},"labels":[],"label_agreement":null},{"id":"W2141579240","doi":"10.1145/2331576.2331587","title":"mTags","year":2012,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Microkernel; Overhead (engineering); Distributed computing; Operating system; Inter-process communication; Variety (cybernetics); Code (set theory); Legacy system; Embedded system; Software; Programming language","score_opus":0.032505732375404356,"score_gpt":0.29662905668550776,"score_spread":0.26412332431010344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141579240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040653437,0.0016262967,0.83363414,0.0015103794,0.0018843975,0.0005437755,0.00089811225,0.07967894,0.03957061],"genre_scores_gemma":[0.39302045,0.0013983021,0.48749867,0.0026604617,0.0008931344,0.00057537283,0.004848974,0.010368378,0.09873629],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820805,0.00030202055,0.00017624767,0.0003383047,0.0007528041,0.00022260085],"domain_scores_gemma":[0.99462765,0.0009212843,0.00031673652,0.0029137605,0.0009449127,0.0002757802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516935,0.00054319366,0.00044757733,0.00079132756,0.0010375225,0.0024358614,0.0025476012,0.00097131927,0.012451218],"category_scores_gemma":[0.004998807,0.0004067171,0.0005654462,0.0006892722,0.00095931493,0.0044721295,0.002891523,0.0016659049,0.007843879],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006629169,0.00036558358,0.006747573,0.00075092254,0.00009625062,0.0005570057,0.0009488776,0.013941939,0.027567197,0.16377781,0.11922502,0.66535896],"study_design_scores_gemma":[0.00009532974,0.00034661658,0.001966252,0.00016966154,0.00012176915,0.0009127154,0.00030895646,0.075099446,0.043005176,0.08405062,0.7937982,0.00012519378],"about_ca_topic_score_codex":0.0013952154,"about_ca_topic_score_gemma":0.0024408335,"teacher_disagreement_score":0.012451218,"about_ca_system_score_codex":0.0007253364,"about_ca_system_score_gemma":0.0014728282,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2141833902","doi":"10.1007/s00778-012-0278-6","title":"Scalable and dynamically balanced shared-everything OLTP with physiological partitioning","year":2012,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Thread (computing); Heap (data structure); Multi-core processor; Distributed computing; Parallel computing; Database transaction; Operating system; Programming language","score_opus":0.01529434217783311,"score_gpt":0.22644222987697848,"score_spread":0.2111478876991454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141833902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45148236,0.0018308578,0.5090193,0.0012049967,0.0006647793,0.00044343516,0.0009833635,0.014192886,0.020177972],"genre_scores_gemma":[0.9311538,0.00012989901,0.06520716,0.00011795933,0.000073898984,0.00008985013,0.0006235191,0.00022697759,0.0023768398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00023683008,0.00010219533,0.00032080413,0.00038898678,0.0003646812],"domain_scores_gemma":[0.99754286,0.0005738781,0.00014599509,0.0010104239,0.00048616185,0.00024068501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009503695,0.0010233875,0.00096512167,0.0008141769,0.0016633691,0.0025821037,0.0029202006,0.0006474412,0.0032174627],"category_scores_gemma":[0.0034688108,0.00053186895,0.00033630952,0.0013097516,0.0007249746,0.003361661,0.0031860254,0.00083486433,0.00083384593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006392353,0.0011395612,0.008866444,0.00042917192,0.0002968229,0.00094981235,0.000771019,0.40179142,0.087203585,0.016126469,0.028995631,0.44703776],"study_design_scores_gemma":[0.00030692937,0.000408421,0.0017633098,0.000023606834,0.00012738217,0.00032247565,0.00053871307,0.95823395,0.018280279,0.015755573,0.0041851774,0.000054313194],"about_ca_topic_score_codex":0.0040780357,"about_ca_topic_score_gemma":0.008466125,"teacher_disagreement_score":0.0040780357,"about_ca_system_score_codex":0.0010530179,"about_ca_system_score_gemma":0.0019560803,"threshold_uncertainty_score":0.010763466},"labels":[],"label_agreement":null},{"id":"W2142007505","doi":"10.1145/2592798.2592822","title":"Kronos","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; VMware; Intel Corporation","keywords":"Computer science; Distributed computing; Concurrency; Overhead (engineering); Key (lock); Event (particle physics); Concurrency control; Graph; Interdependence; Service (business); Theoretical computer science; Database; Database transaction; Computer security","score_opus":0.0043948880330394935,"score_gpt":0.19213655375281646,"score_spread":0.18774166571977696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142007505","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010311166,0.0023634017,0.64582217,0.0027212612,0.0023969607,0.0005879343,0.0061839037,0.044135127,0.2854781],"genre_scores_gemma":[0.17681186,0.0040434194,0.44370562,0.002875456,0.0009982056,0.00092005637,0.015692616,0.013131593,0.34182128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807006,0.0002817674,0.00023539762,0.0004161606,0.0007360376,0.00026063598],"domain_scores_gemma":[0.99732745,0.00036314482,0.00022312638,0.0010767519,0.00076953677,0.00023988058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013559208,0.00089353975,0.00083042635,0.0025327948,0.0017564512,0.0048381053,0.0026719184,0.001328622,0.07971581],"category_scores_gemma":[0.004133931,0.00087397284,0.0009994064,0.0019283354,0.001392522,0.007747021,0.004437897,0.0024948902,0.048874933],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061967905,0.00016488496,0.0019155788,0.000759117,0.000054030115,0.0003530515,0.00047171547,0.004487237,0.0064158137,0.54320127,0.10822529,0.33333233],"study_design_scores_gemma":[0.00007565159,0.00008587282,0.00039218136,0.00020798839,0.00003844226,0.00057616696,0.0001838608,0.01487868,0.0076008034,0.14067951,0.8352048,0.0000759697],"about_ca_topic_score_codex":0.0023526966,"about_ca_topic_score_gemma":0.003065526,"teacher_disagreement_score":0.07971581,"about_ca_system_score_codex":0.001296563,"about_ca_system_score_gemma":0.0023919847,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011768036132361088,"score_gpt":0.22505260466662805,"score_spread":0.21328456853426697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142047930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043892763,0.009817898,0.9604289,0.0017481502,0.0007092243,0.00014286277,0.00005479042,0.0012527516,0.021456137],"genre_scores_gemma":[0.4321293,0.019003851,0.5206917,0.0010085835,0.0022851187,0.0011864387,0.0003784261,0.00044751592,0.02286902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996783,0.0011496388,0.00017812704,0.00029225915,0.0013889434,0.00020794598],"domain_scores_gemma":[0.99779105,0.0009410544,0.00021282732,0.00054512225,0.00040800383,0.000102020276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328129,0.0006761389,0.0007901679,0.0010585196,0.0010475507,0.0027958825,0.001516148,0.0018309541,0.0031980372],"category_scores_gemma":[0.006764354,0.0005871335,0.0004252256,0.00186598,0.0025188422,0.0030418106,0.0020422486,0.001793248,0.0019035012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064746826,0.00003459816,0.00029992496,0.0005028276,0.000033494056,0.00041805467,0.0006530529,0.041828908,0.002149511,0.7975626,0.01688526,0.13956699],"study_design_scores_gemma":[0.000103015926,0.00013291884,0.00015946367,0.00022737044,0.000050927134,0.0006280663,0.00014449038,0.15574028,0.002810281,0.6484952,0.19144975,0.0000583741],"about_ca_topic_score_codex":0.0009196251,"about_ca_topic_score_gemma":0.0005660982,"teacher_disagreement_score":0.0031980372,"about_ca_system_score_codex":0.0010693189,"about_ca_system_score_gemma":0.0013037844,"threshold_uncertainty_score":0.012312472},"labels":[],"label_agreement":null},{"id":"W2143889951","doi":"10.1145/1216895.1216898","title":"A performance analysis method for autonomic computing systems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Autonomic computing; Workload; Distributed computing; Provisioning; Cloud computing; Computer network; Operating system","score_opus":0.023511537168247294,"score_gpt":0.2781364831931525,"score_spread":0.2546249460249052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143889951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008666254,0.00042448574,0.9939574,0.00015541323,0.00010002379,0.00007250106,0.00007121983,0.00064256,0.003709773],"genre_scores_gemma":[0.12777504,0.0017880158,0.85772157,0.0002792226,0.00083022326,0.0011751282,0.00044517036,0.0009220019,0.00906357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663323,0.0009050252,0.00024661914,0.00053461635,0.0014768384,0.00020374967],"domain_scores_gemma":[0.9958936,0.0022499822,0.00030412816,0.00066287076,0.0008071927,0.00008224372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035799777,0.002630464,0.0011957011,0.004016274,0.001131849,0.003054105,0.0019324798,0.0013267986,0.007290796],"category_scores_gemma":[0.012971442,0.00071093213,0.0014353995,0.003077717,0.0013464252,0.0045043114,0.0017958243,0.0038101024,0.0029262963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982464,0.00011596719,0.0008631991,0.00047308314,0.00013630057,0.0001624692,0.00049422006,0.21053946,0.009397102,0.48586226,0.014593537,0.27725258],"study_design_scores_gemma":[0.000016999838,0.00005551602,0.00025311875,0.00008239756,0.000030839765,0.00015178951,0.00006360629,0.8317484,0.002577641,0.14057127,0.024406603,0.000041720905],"about_ca_topic_score_codex":0.0018026961,"about_ca_topic_score_gemma":0.00079151907,"teacher_disagreement_score":0.007290796,"about_ca_system_score_codex":0.001632876,"about_ca_system_score_gemma":0.0012785334,"threshold_uncertainty_score":0.024390161},"labels":[],"label_agreement":null},{"id":"W2143928164","doi":"10.1109/hicss.2003.1174915","title":"Verifying trustworthiness requirements in distributed systems with formal log-file analysis","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Model checking; System requirements specification; Tracing; File system; Trustworthiness; Event (particle physics); Formal specification; Programming language; Software engineering; Distributed computing; Operating system; Computer security","score_opus":0.01635544987051214,"score_gpt":0.23985903103237954,"score_spread":0.22350358116186742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143928164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073027566,0.000049796632,0.92316496,0.00017998317,0.000014076374,0.00017427806,0.000107147614,0.0025664447,0.00071574264],"genre_scores_gemma":[0.73710096,0.00013925557,0.26100644,0.00006266214,0.000029277486,0.00031798813,0.00037843265,0.0002716554,0.0006933081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99140525,0.003459207,0.0007294298,0.00066004385,0.0032801798,0.0004658875],"domain_scores_gemma":[0.92125815,0.059586335,0.005540946,0.009968825,0.0032564937,0.00038931216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675932,0.00082678493,0.0006809507,0.0018278941,0.0007990999,0.0029087479,0.0016769231,0.0014139015,0.0014465497],"category_scores_gemma":[0.053501062,0.00076083373,0.0010911603,0.00087113737,0.0028573696,0.0056304387,0.0017820953,0.0016522383,0.00030683927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012476242,0.0009477938,0.022849087,0.00077847816,0.00018782404,0.0027080087,0.003114887,0.5670593,0.07782212,0.14712773,0.0023002052,0.173857],"study_design_scores_gemma":[0.00012435328,0.00019606008,0.0009285113,0.000058447855,0.000046900837,0.00044078552,0.00022619318,0.90427893,0.038874015,0.05306966,0.0017039339,0.000052152587],"about_ca_topic_score_codex":0.0028714645,"about_ca_topic_score_gemma":0.0024749294,"teacher_disagreement_score":0.00675932,"about_ca_system_score_codex":0.0014755777,"about_ca_system_score_gemma":0.0024175937,"threshold_uncertainty_score":0.03574711},"labels":[],"label_agreement":null},{"id":"W2144261737","doi":"10.1109/cmpsac.1995.524771","title":"Management of flexible transactions using semantics in multidatabase systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Commit; Correctness; Computer science; Atomicity; Two-phase commit protocol; Compensating transaction; Distributed transaction; Database transaction; Distributed computing; Transaction processing; Scheme (mathematics); Semantics (computer science); Concurrency control; Serializability; Concurrency; Protocol (science); Database; Programming language; Mathematics","score_opus":0.04740191832166744,"score_gpt":0.26156984729330957,"score_spread":0.21416792897164214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144261737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058389224,0.0010903305,0.93687445,0.0006742947,0.00012542575,0.00009954075,0.000039373128,0.00079235993,0.0019149956],"genre_scores_gemma":[0.7458442,0.0008687417,0.2508623,0.0001737427,0.00017054362,0.00019987366,0.00015499663,0.00014699159,0.0015786983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680567,0.0008939888,0.0004722321,0.00031798636,0.0012606432,0.00024954896],"domain_scores_gemma":[0.9968635,0.000718721,0.00035555224,0.0013498851,0.00042839895,0.0002839263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040812804,0.00051333936,0.00077975466,0.0010081183,0.0014610891,0.0041742544,0.002304305,0.0012872319,0.0006501975],"category_scores_gemma":[0.0050184303,0.0006674509,0.00089407706,0.0011890166,0.0026855934,0.008959877,0.0041321213,0.0018226539,0.0002483615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048089685,0.00024515812,0.0034221709,0.00037257987,0.00012064758,0.0009920958,0.0015582365,0.12125865,0.027829865,0.68718415,0.0025873296,0.15394825],"study_design_scores_gemma":[0.00016992571,0.00035526042,0.00051147596,0.00009904243,0.00012330663,0.0005856944,0.00038429792,0.53508943,0.023935048,0.4128551,0.02578772,0.000103778155],"about_ca_topic_score_codex":0.0006997185,"about_ca_topic_score_gemma":0.000705084,"teacher_disagreement_score":0.0041742544,"about_ca_system_score_codex":0.0007058709,"about_ca_system_score_gemma":0.001288569,"threshold_uncertainty_score":0.021584153},"labels":[],"label_agreement":null},{"id":"W2144606760","doi":"10.1109/ipdps.2004.1302946","title":"Dynamic versus static locking in real-time parallel database systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Two-phase locking; Computer science; Concurrency control; Serializability; Database transaction; Distributed computing; Real-time database; Optimistic concurrency control; Scheduling (production processes); Distributed transaction; Transaction processing; Distributed database; Distributed concurrency control; Protocol (science); Database; Parallel computing","score_opus":0.018914185423029365,"score_gpt":0.2711279742926186,"score_spread":0.25221378886958923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144606760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45371306,0.04487718,0.43805274,0.0034466945,0.002028085,0.00029133033,0.00033135552,0.0040349164,0.05322463],"genre_scores_gemma":[0.9609004,0.003445919,0.028092086,0.00021713797,0.000335792,0.000097277974,0.00020690523,0.00012411563,0.0065803817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693775,0.0009757329,0.0002334067,0.00030144525,0.0012585124,0.00029307688],"domain_scores_gemma":[0.9919808,0.0048313336,0.00066114165,0.0011221595,0.0011003773,0.0003041827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026180486,0.00035672504,0.00060788647,0.0006355552,0.0005705824,0.0019365528,0.0010158041,0.00048695417,0.0065544555],"category_scores_gemma":[0.009075971,0.00024539966,0.0001635854,0.001260963,0.00092172733,0.0032273985,0.0010293258,0.0006164323,0.0010208309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004904893,0.0006396452,0.0118969,0.0012818978,0.00011465543,0.000928659,0.0005850643,0.14855218,0.047178347,0.08765404,0.01873057,0.67753315],"study_design_scores_gemma":[0.0009369437,0.0048586675,0.006404103,0.00027875754,0.0003671429,0.0032875175,0.00078408193,0.69251806,0.08926698,0.12096223,0.080153525,0.00018202592],"about_ca_topic_score_codex":0.00032772488,"about_ca_topic_score_gemma":0.00029249978,"teacher_disagreement_score":0.0065544555,"about_ca_system_score_codex":0.00047147763,"about_ca_system_score_gemma":0.00055458164,"threshold_uncertainty_score":0.02192682},"labels":[],"label_agreement":null},{"id":"W2144887264","doi":"10.1109/sc.companion.2012.288","title":"Abstract: Evaluating Error Resiliency of GPGPU Applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Resilience (materials science); Focus (optics); Parallel computing; Look-ahead; Computer security; Operating system; Algorithm","score_opus":0.04727898507769538,"score_gpt":0.34403810576870747,"score_spread":0.29675912069101207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144887264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877287,0.0007437653,0.0062018493,0.00016644133,0.00006625315,0.00010924444,0.0006336652,0.0021636952,0.0021862749],"genre_scores_gemma":[0.99335915,0.00010092715,0.005000218,0.000043404667,0.00001699539,0.000039410384,0.00078425894,0.00013437055,0.00052122516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976804,0.00053001434,0.0002167529,0.00032118708,0.00090075796,0.0003509079],"domain_scores_gemma":[0.98896784,0.0051997253,0.0010972843,0.001934755,0.0021955431,0.0006048993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016032166,0.0010386364,0.0006548385,0.0012733351,0.0005313197,0.00076431024,0.0012504346,0.0009332031,0.0017238247],"category_scores_gemma":[0.012153202,0.00024312643,0.00040327353,0.001315971,0.0006777731,0.0010511556,0.000868534,0.00088192755,0.00056150364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0092385365,0.0017395046,0.07074878,0.001314397,0.00067498564,0.0007921821,0.0005845342,0.5986199,0.14321199,0.0017018697,0.008793553,0.16257985],"study_design_scores_gemma":[0.00024091773,0.007086678,0.052557196,0.000074050084,0.00022334869,0.00066001574,0.00034775923,0.7151465,0.2178415,0.0013146914,0.00439158,0.00011581443],"about_ca_topic_score_codex":0.0025123477,"about_ca_topic_score_gemma":0.0011452149,"teacher_disagreement_score":0.0025123477,"about_ca_system_score_codex":0.0005914679,"about_ca_system_score_gemma":0.0006179785,"threshold_uncertainty_score":0.008478701},"labels":[],"label_agreement":null},{"id":"W2145148249","doi":"10.1007/978-3-540-71703-4_35","title":"CST-Trees: Cache Sensitive T-Trees","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prompt (Canada)","funders":"","keywords":"Cache; Computer science; Cache coloring; Cache invalidation; Cache algorithms; Cache pollution; Parallel computing; Smart Cache; Page cache; Cache-oblivious algorithm; CPU cache","score_opus":0.02087411720460818,"score_gpt":0.25713916011291765,"score_spread":0.23626504290830946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145148249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011265721,0.003966871,0.8988129,0.00060683663,0.0008919954,0.00031293626,0.0057153595,0.034006648,0.044420794],"genre_scores_gemma":[0.23479822,0.006898074,0.65583724,0.0012362747,0.0006558587,0.0007218679,0.020088952,0.009633008,0.07013057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994999,0.0000624438,0.000041755044,0.00006973202,0.00026400798,0.00006220481],"domain_scores_gemma":[0.9989267,0.00027401443,0.00007089681,0.0003262015,0.0002946797,0.000107465356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042795687,0.00072567654,0.0007221685,0.0010007008,0.0006232306,0.001681663,0.0019867641,0.0010824683,0.021372218],"category_scores_gemma":[0.0028807153,0.0005949031,0.0004831465,0.0034737182,0.0004948362,0.0024027033,0.0012036115,0.0014413072,0.009856029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048102695,0.00013213295,0.00039350742,0.0009715552,0.00006116356,0.0002040643,0.00016092046,0.029142864,0.018863518,0.14089777,0.25654656,0.5521449],"study_design_scores_gemma":[0.00025246685,0.00021226202,0.00044099524,0.00025861742,0.00010089832,0.0010439382,0.0000841738,0.15361708,0.03211212,0.29565188,0.51613855,0.00008704285],"about_ca_topic_score_codex":0.00094030175,"about_ca_topic_score_gemma":0.0014442586,"teacher_disagreement_score":0.021372218,"about_ca_system_score_codex":0.00053779024,"about_ca_system_score_gemma":0.0008958704,"threshold_uncertainty_score":0.0714972},"labels":[],"label_agreement":null},{"id":"W2145304970","doi":"10.1109/cdc.2007.4435020","title":"Characterizing all classes of LTI stabilizing structurally constrained controllers by means of combinatorics","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Set (abstract data type); Controller (irrigation); Class (philosophy); Simple (philosophy); Directed graph; Mathematical optimization; Focus (optics); Mathematics; Algorithm","score_opus":0.012347964778086364,"score_gpt":0.24576978984010142,"score_spread":0.23342182506201506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145304970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09532268,0.0002720482,0.8957427,0.00030576324,0.000016384762,0.00014365617,0.0002716606,0.0002848315,0.0076402333],"genre_scores_gemma":[0.86244756,0.0006658533,0.13123389,0.00026670724,0.00008640676,0.0006988856,0.0009084868,0.00019098808,0.00350121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918073,0.00012763294,0.000075644115,0.00023627732,0.00026335573,0.00011638736],"domain_scores_gemma":[0.9953752,0.0029673025,0.00079473754,0.0003901783,0.0003587178,0.00011387689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008455713,0.00094978476,0.000988807,0.001725317,0.001034513,0.0023269376,0.0009499318,0.00094515027,0.003345313],"category_scores_gemma":[0.0051482813,0.000435241,0.0013315838,0.0010878801,0.00209613,0.0027330779,0.0008326394,0.0012996355,0.0002912645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001491652,0.00017109263,0.0032783877,0.00033846727,0.00007826612,0.00030981537,0.00041994543,0.38308302,0.010919901,0.5428964,0.001233627,0.057121906],"study_design_scores_gemma":[0.00003895059,0.0000935034,0.0010619126,0.000057899666,0.000048751852,0.0001362514,0.00017533074,0.4586166,0.004685168,0.53230834,0.0027438537,0.000033480814],"about_ca_topic_score_codex":0.0013554081,"about_ca_topic_score_gemma":0.0016344197,"teacher_disagreement_score":0.003345313,"about_ca_system_score_codex":0.0012397269,"about_ca_system_score_gemma":0.0012592294,"threshold_uncertainty_score":0.011191189},"labels":[],"label_agreement":null},{"id":"W2145957306","doi":"10.1109/icdcs.2009.71","title":"On Optimal Concurrency Control for Optimistic Replication","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency; Concurrency control; Distributed computing; Overhead (engineering); Replication (statistics); Parallel computing; Implementation; Metadata; Data transmission; Synchronization (alternating current); Mutual exclusion; Theoretical computer science; Computer network; Operating system; Programming language; Mathematics","score_opus":0.014802624208381309,"score_gpt":0.2785403477861057,"score_spread":0.2637377235777244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145957306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025823822,0.0008502419,0.9684263,0.0005360514,0.000066592795,0.00008324806,0.000048767048,0.00040055942,0.0037644957],"genre_scores_gemma":[0.76637465,0.0010270326,0.22902307,0.00021519697,0.00015486669,0.0002365323,0.00013034356,0.00017678658,0.0026615418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950582,0.0017003755,0.00032856947,0.0005634383,0.0017698213,0.0005795927],"domain_scores_gemma":[0.9917675,0.0051563103,0.0006196921,0.0013412707,0.0008445214,0.0002706253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047871,0.00081986526,0.0010003058,0.00089367933,0.0012092441,0.0021716924,0.0018406968,0.00069063465,0.0023361582],"category_scores_gemma":[0.019107584,0.0006311415,0.00054748374,0.0013432481,0.0029452608,0.0045893807,0.003043782,0.0019872407,0.00036827475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006038011,0.000103886196,0.0008366767,0.00014974372,0.000038294835,0.00007981588,0.00034211233,0.5086783,0.004976485,0.3802659,0.0023965484,0.101528354],"study_design_scores_gemma":[0.000073541145,0.0000719627,0.000107952386,0.00002109804,0.000017820495,0.00003335431,0.0000528094,0.8232434,0.0025013897,0.17213966,0.0017120906,0.000024919762],"about_ca_topic_score_codex":0.00390086,"about_ca_topic_score_gemma":0.0028258613,"teacher_disagreement_score":0.005047871,"about_ca_system_score_codex":0.0023314506,"about_ca_system_score_gemma":0.0030987097,"threshold_uncertainty_score":0.026696026},"labels":[],"label_agreement":null},{"id":"W2145987238","doi":"10.1109/icpads.2007.4447747","title":"Using synchronized atoms to check distributed programs","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Predicate (mathematical logic); Correctness; Serialization; Theoretical computer science; Model checking; Computation; Atomicity; Bounded function; Debugging; Syntactic predicate; Predicate abstraction; Algorithm; Programming language; Mathematics; Database transaction","score_opus":0.03753284358254843,"score_gpt":0.3009193811125255,"score_spread":0.26338653752997704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145987238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08423827,0.00009029572,0.9105481,0.00020333576,0.00003402151,0.00017897216,0.0002061712,0.0028111052,0.0016897478],"genre_scores_gemma":[0.5329553,0.00012441691,0.464399,0.00013281906,0.000043598582,0.0002891962,0.00055172306,0.00031819489,0.0011858023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953927,0.0015518628,0.0002974988,0.0008713118,0.001379016,0.0005076533],"domain_scores_gemma":[0.9865139,0.008782833,0.0010463351,0.0022812122,0.001098812,0.0002768673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160826,0.0010004129,0.0010511451,0.0020674998,0.0014450228,0.002038728,0.0028059874,0.0008856686,0.002708875],"category_scores_gemma":[0.015909512,0.0010661534,0.0014171462,0.0015350787,0.003875899,0.005813011,0.0035320525,0.0020179313,0.0003466989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013405937,0.00036665105,0.00904256,0.0004926734,0.00029885146,0.0008606139,0.00089523994,0.38199866,0.04915498,0.41117704,0.0029279918,0.14144418],"study_design_scores_gemma":[0.00021643811,0.00020141147,0.00047116767,0.000035813126,0.00010556986,0.00010372749,0.00012604117,0.74284846,0.050554473,0.20238654,0.0029089316,0.00004136656],"about_ca_topic_score_codex":0.0063864687,"about_ca_topic_score_gemma":0.0064185285,"teacher_disagreement_score":0.0063864687,"about_ca_system_score_codex":0.0017301934,"about_ca_system_score_gemma":0.002917213,"threshold_uncertainty_score":0.016716182},"labels":[],"label_agreement":null},{"id":"W2146013153","doi":"10.1145/1314690.1314694","title":"Time lower bounds for implementations of multi-writer snapshots","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Snapshot (computer storage); Implementation; Computer science; Swap (finance); Parallel computing; Upper and lower bounds; Shared memory; Theoretical computer science; Arithmetic; Algorithm; Programming language; Mathematics; Operating system","score_opus":0.029246185940400588,"score_gpt":0.32575873090437923,"score_spread":0.29651254496397866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146013153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13809729,0.0058414233,0.80893433,0.0052520386,0.0005753134,0.00036333763,0.0006340408,0.005322319,0.034979876],"genre_scores_gemma":[0.6567725,0.00241732,0.31412834,0.0017206289,0.0007804503,0.0010592534,0.0013920184,0.0031476063,0.018581834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98220384,0.0030910715,0.0013556381,0.002336835,0.0066012857,0.004411391],"domain_scores_gemma":[0.9383332,0.039399948,0.004321219,0.011608169,0.004462809,0.0018747225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077471016,0.0025620598,0.0025416478,0.0022905162,0.0026651705,0.01013252,0.0050066486,0.0031468465,0.012775192],"category_scores_gemma":[0.040986788,0.0017915819,0.0028725266,0.0027052371,0.003264531,0.016789928,0.007670552,0.0066188592,0.0025987297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005639164,0.0010800107,0.0069960197,0.0018072007,0.00036385847,0.0007406537,0.0016298267,0.19332018,0.07900585,0.47600102,0.021513877,0.21190234],"study_design_scores_gemma":[0.00041092443,0.0007576026,0.0012612424,0.00033032376,0.0004684422,0.000569306,0.00040503137,0.66650194,0.060032938,0.25307855,0.016026972,0.00015671781],"about_ca_topic_score_codex":0.0019761652,"about_ca_topic_score_gemma":0.0025669911,"teacher_disagreement_score":0.012775192,"about_ca_system_score_codex":0.005828605,"about_ca_system_score_gemma":0.0046664514,"threshold_uncertainty_score":0.042737246},"labels":[],"label_agreement":null},{"id":"W2146358422","doi":"10.1109/cmpeur.1992.218479","title":"Specification of real-time distributed database systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Brock University","funders":"","keywords":"Correctness; Computer science; Formalism (music); Concurrency; Consistency (knowledge bases); Concurrency control; Programming language; Distributed database; Specification language; Database theory; System requirements specification; Distributed computing; Theoretical computer science; Database; Data mining; Database transaction; Database design; Software engineering; Artificial intelligence","score_opus":0.017762472332203922,"score_gpt":0.23756921842869388,"score_spread":0.21980674609648995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146358422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015117959,0.0009971455,0.98931086,0.00057628355,0.00015773793,0.00028166932,0.0005615915,0.00084190984,0.0057610003],"genre_scores_gemma":[0.07925228,0.0031640995,0.9004326,0.000678164,0.00024968517,0.0017613495,0.0027734465,0.0003327704,0.011355573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911032,0.0025178618,0.0019175188,0.00080056826,0.0031092658,0.0005515535],"domain_scores_gemma":[0.9954726,0.0012862312,0.00054846413,0.00094169244,0.0014524879,0.00029847957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007772203,0.0016859776,0.0014801613,0.0017828973,0.0014578687,0.008291767,0.004658611,0.002779529,0.0038592296],"category_scores_gemma":[0.0074204695,0.0014118743,0.0017088881,0.0024266231,0.0023073503,0.0048345346,0.0027221178,0.0036237421,0.002052748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004962061,0.00005793231,0.00028702558,0.0004036305,0.00004132488,0.00070756825,0.00073803496,0.030383555,0.0045072637,0.92879266,0.006717536,0.027313814],"study_design_scores_gemma":[0.00020336952,0.00014310346,0.00024347226,0.00043254677,0.00010615072,0.0012556536,0.00044021002,0.17170863,0.011357435,0.4476845,0.3663035,0.00012147571],"about_ca_topic_score_codex":0.004145606,"about_ca_topic_score_gemma":0.004313772,"teacher_disagreement_score":0.008291767,"about_ca_system_score_codex":0.002014344,"about_ca_system_score_gemma":0.0052167564,"threshold_uncertainty_score":0.04110384},"labels":[],"label_agreement":null},{"id":"W2146927294","doi":"10.1145/1215995.1216006","title":"Portability events","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Defense Advanced Research Projects Agency","keywords":"Software portability; Computer science; Scalability; Scope (computer science); Abstraction; Event (particle physics); Programming paradigm; Software; Software engineering; Programming language; Simple (philosophy); Operating system; Embedded system; Distributed computing","score_opus":0.005118712549569145,"score_gpt":0.2066965795859408,"score_spread":0.20157786703637165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146927294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02064872,0.00018086891,0.9087206,0.00077628304,0.00027524485,0.0010841342,0.00064858433,0.042137098,0.025528489],"genre_scores_gemma":[0.36629558,0.00061723334,0.5556818,0.0020539255,0.00055855856,0.002096955,0.0031682767,0.019487362,0.050040353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945121,0.0011357254,0.0006736598,0.00077875546,0.0023280915,0.0005717832],"domain_scores_gemma":[0.9818334,0.005158639,0.001356861,0.008532036,0.002151017,0.00096796866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064189057,0.0017158003,0.0009333765,0.0013071795,0.0017794381,0.0060057673,0.004449309,0.0023089303,0.017277978],"category_scores_gemma":[0.027550263,0.0012097302,0.0015210964,0.0011003227,0.0023308273,0.0111077735,0.008228184,0.0042612157,0.004091127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012299463,0.00073233276,0.010552271,0.0006812253,0.00014483376,0.0018076453,0.0030727978,0.015061485,0.022583935,0.6233901,0.052370753,0.26837277],"study_design_scores_gemma":[0.00032088626,0.000527242,0.0028809083,0.00045574218,0.00019815851,0.002244635,0.0006814754,0.11025405,0.06925179,0.2698518,0.5430505,0.0002827023],"about_ca_topic_score_codex":0.0011654017,"about_ca_topic_score_gemma":0.00092401885,"teacher_disagreement_score":0.017277978,"about_ca_system_score_codex":0.0013566337,"about_ca_system_score_gemma":0.0016376753,"threshold_uncertainty_score":0.05780059},"labels":[],"label_agreement":null},{"id":"W2147006982","doi":"10.1109/icdcs.2004.1281621","title":"A distributed implementation of sequential consistency with multi-object operations","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. John’s Health Sciences Centre","funders":"","keywords":"Consistency model; Computer science; Sequential consistency; Consistency (knowledge bases); Eventual consistency; Asynchronous communication; Distributed computing; Unary operation; Linearizability; Protocol (science); Cache coherence; Object (grammar); Process (computing); Context (archaeology); Replication (statistics); Simple (philosophy); Programming language; Parallel computing; Data consistency; Computer network; Artificial intelligence; Mathematics","score_opus":0.02022762509106277,"score_gpt":0.2908112450314013,"score_spread":0.2705836199403385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147006982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005220875,0.00012503439,0.9877971,0.00016946992,0.0001283754,0.0001978351,0.000039728857,0.001792101,0.004529493],"genre_scores_gemma":[0.23462997,0.0002481629,0.75241816,0.00024681073,0.00021134409,0.000643646,0.00021256618,0.00037959238,0.0110097155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963582,0.00084488513,0.0003792054,0.00052834663,0.0016389674,0.00025033107],"domain_scores_gemma":[0.99545693,0.0009699107,0.00029952964,0.002071608,0.0010104076,0.000191567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040929727,0.0005992902,0.00091377273,0.00078772905,0.0014224518,0.0025113954,0.0030819657,0.00136854,0.0045109787],"category_scores_gemma":[0.0075155627,0.0006324795,0.00088060834,0.0011177139,0.002014949,0.0037220498,0.0033126087,0.0022338426,0.0012655044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005191996,0.00031151486,0.0010356607,0.00044068688,0.00013536047,0.00058183895,0.0010217617,0.042859755,0.02978986,0.73504025,0.0070381444,0.181226],"study_design_scores_gemma":[0.00053682906,0.0006189681,0.00050161214,0.00013213528,0.00018939078,0.000800496,0.00016741372,0.4215632,0.06204844,0.38810295,0.12522063,0.00011794076],"about_ca_topic_score_codex":0.0009798169,"about_ca_topic_score_gemma":0.00093705073,"teacher_disagreement_score":0.0045109787,"about_ca_system_score_codex":0.00088023674,"about_ca_system_score_gemma":0.0019962005,"threshold_uncertainty_score":0.021645963},"labels":[],"label_agreement":null},{"id":"W2147045827","doi":"10.1007/s00165-005-0082-9","title":"A formal approach to property testing in causally consistent distributed traces","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Theory of computation; Automaton; Property (philosophy); Consistency (knowledge bases); Model checking; Causality (physics); Theoretical computer science; Programming language; Event (particle physics); Formal methods; Artificial intelligence","score_opus":0.01893584562270784,"score_gpt":0.22398797159533837,"score_spread":0.20505212597263053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147045827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033904444,0.000030995896,0.9954092,0.00013044759,0.00001164362,0.000057806436,0.00003715714,0.0004495361,0.00048276086],"genre_scores_gemma":[0.25721428,0.0001394321,0.7404323,0.00016363848,0.00007630121,0.00042240304,0.00020956605,0.00019860303,0.0011434855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918521,0.00319804,0.00069760374,0.00092651515,0.0027168323,0.0006088904],"domain_scores_gemma":[0.9756335,0.016399056,0.0015159597,0.0035345983,0.0025421334,0.00037472628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009056193,0.0009722299,0.0008222097,0.0023990201,0.0011616925,0.0034338422,0.0034600315,0.0015332592,0.0027961258],"category_scores_gemma":[0.023964746,0.001025356,0.0017926139,0.0015469533,0.0074780425,0.0054109273,0.0029181659,0.0030800414,0.0003068343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071633716,0.00016503928,0.0011925087,0.00014966186,0.000052088555,0.0005570883,0.0007520736,0.13625692,0.004845046,0.8306402,0.0005704399,0.024747184],"study_design_scores_gemma":[0.000053825654,0.000060227394,0.00014494434,0.00008937421,0.000033433415,0.00015598469,0.00010658151,0.6078041,0.007305249,0.37757862,0.006632859,0.00003481123],"about_ca_topic_score_codex":0.0045642783,"about_ca_topic_score_gemma":0.0035578692,"teacher_disagreement_score":0.009056193,"about_ca_system_score_codex":0.0023905684,"about_ca_system_score_gemma":0.0036038926,"threshold_uncertainty_score":0.0478943},"labels":[],"label_agreement":null},{"id":"W2148179705","doi":"10.1109/icde.1991.131450","title":"Efficiently maintaining availability in the presence of partitionings in distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Replication (statistics); Computer science; Serializability; Distributed computing; High availability; Metric (unit); Distributed database; Protocol (science); Database transaction; Transaction processing; Database; Distributed transaction","score_opus":0.021766951338083526,"score_gpt":0.23296022795273458,"score_spread":0.21119327661465104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148179705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22083585,0.0014776058,0.7707801,0.00057701336,0.00010164965,0.000075547534,0.000069466885,0.002070586,0.004012122],"genre_scores_gemma":[0.9237839,0.00033183835,0.074297644,0.0000623736,0.000075354044,0.00006807924,0.0001192369,0.00012858251,0.0011328997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981027,0.00061238935,0.00014188685,0.0002356897,0.0006640501,0.00024333881],"domain_scores_gemma":[0.99276334,0.0036839047,0.0006895231,0.0018248542,0.0007650419,0.00027337708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038892,0.0005022031,0.00076205056,0.00070532423,0.0013082112,0.0018771081,0.0011469836,0.0007007656,0.00084897986],"category_scores_gemma":[0.00967451,0.00056516065,0.00026709697,0.000687666,0.0012130748,0.002955388,0.0025390151,0.00083528605,0.00037493196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009174839,0.00018575283,0.0077472017,0.000387051,0.000114249095,0.0015580738,0.001856465,0.5062445,0.094329774,0.073588,0.004934305,0.3081372],"study_design_scores_gemma":[0.00007830017,0.00023009533,0.0012119927,0.000037457572,0.000079097525,0.000776831,0.00033937377,0.9079828,0.020898942,0.059045717,0.009276331,0.000043103697],"about_ca_topic_score_codex":0.0015303232,"about_ca_topic_score_gemma":0.0014794603,"teacher_disagreement_score":0.0018771081,"about_ca_system_score_codex":0.00062797853,"about_ca_system_score_gemma":0.0009549082,"threshold_uncertainty_score":0.009540021},"labels":[],"label_agreement":null},{"id":"W2148194787","doi":"10.1109/cmpsac.1992.217571","title":"Fault-tolerant concurrent branch and bound algorithms derived from program verification","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Executable; Computer science; Fault tolerance; Programming language; Redundancy (engineering); Algorithm; Theoretical computer science; Distributed computing; Operating system","score_opus":0.018813479540320935,"score_gpt":0.2653363795129541,"score_spread":0.24652289997263316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148194787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005620373,0.0001837508,0.98959243,0.00012723713,0.000038339545,0.000054257354,0.000032781827,0.0012354676,0.0031152864],"genre_scores_gemma":[0.22022104,0.0003370679,0.7749307,0.00016953083,0.000052002815,0.00023883455,0.00023821693,0.00045808565,0.0033544272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982508,0.0003864714,0.000109517765,0.00023632724,0.0008508069,0.00016605308],"domain_scores_gemma":[0.9963253,0.0022189463,0.0002988572,0.0006327428,0.0004403268,0.00008386171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012832492,0.0006121732,0.00080885785,0.0014830113,0.0007429945,0.0017941761,0.0014218376,0.0010478497,0.0041658664],"category_scores_gemma":[0.007691115,0.0006385947,0.0008472706,0.0012683125,0.0015882085,0.0020790177,0.0018203,0.0017970487,0.0010105593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211068,0.0001547918,0.00072266854,0.0003615185,0.00008072101,0.00025908806,0.00036237144,0.23601153,0.011566044,0.4433287,0.0038316948,0.30310884],"study_design_scores_gemma":[0.00010856283,0.00004411926,0.000099678444,0.000062378844,0.00004265738,0.00013707591,0.000023479095,0.71736026,0.010086122,0.26495087,0.0070665483,0.000018258146],"about_ca_topic_score_codex":0.002243282,"about_ca_topic_score_gemma":0.002420451,"teacher_disagreement_score":0.0041658664,"about_ca_system_score_codex":0.0013555585,"about_ca_system_score_gemma":0.0018116116,"threshold_uncertainty_score":0.013936162},"labels":[],"label_agreement":null},{"id":"W2148682927","doi":"10.1109/isorc.2006.49","title":"Looking Ahead in Open Multithreaded Transactions","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency control; Database transaction; Distributed transaction; Transactional memory; Concurrency; Synchronization (alternating current); Transaction processing; Optimistic concurrency control; Serializability; Multithreading; Distributed computing; Software transactional memory; Compensating transaction; Programming language; Distributed concurrency control; Thread (computing); Computer network","score_opus":0.016394181476049166,"score_gpt":0.26273183481864465,"score_spread":0.2463376533425955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148682927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05973818,0.0017327886,0.93017817,0.0005810828,0.00030716037,0.00010940009,0.000040156912,0.0010008651,0.0063122003],"genre_scores_gemma":[0.69667983,0.0011819323,0.29090104,0.00041086506,0.000248208,0.00016834095,0.00009453262,0.0004108441,0.009904445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564016,0.0012495706,0.00043534365,0.0006499463,0.0014627153,0.0005621944],"domain_scores_gemma":[0.9935481,0.0027873167,0.0005879516,0.0019471924,0.00067740807,0.0004520677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038034753,0.0003679256,0.0006732614,0.00049205497,0.001521523,0.0037569646,0.001747671,0.0015321939,0.0023270668],"category_scores_gemma":[0.009860642,0.00093738653,0.00073613663,0.00090391224,0.0032655986,0.008542937,0.003200333,0.003241693,0.0005467096],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000654637,0.00014872226,0.0023822594,0.00030495637,0.00004727328,0.0009805126,0.0019175968,0.05362153,0.023232581,0.7970938,0.0026659248,0.116950236],"study_design_scores_gemma":[0.00013483167,0.0002813009,0.00053607253,0.00012049795,0.00012037954,0.0007089789,0.00047857375,0.22368813,0.027657012,0.7049993,0.04115081,0.00012406039],"about_ca_topic_score_codex":0.0014890664,"about_ca_topic_score_gemma":0.0012201959,"teacher_disagreement_score":0.0038034753,"about_ca_system_score_codex":0.0008221783,"about_ca_system_score_gemma":0.0011662602,"threshold_uncertainty_score":0.020114958},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012272568437825851,"score_gpt":0.2517639469107619,"score_spread":0.23949137847293608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148789662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9830578,0.000577347,0.00836391,0.00016552946,0.00011140893,0.000018904517,0.00011002627,0.0042792046,0.0033157053],"genre_scores_gemma":[0.997018,0.000041552692,0.0014640838,0.000026564318,0.000012915091,0.000006930549,0.00010105121,0.00013392128,0.0011949913],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998701,0.00024779848,0.000048082984,0.00022039044,0.00030846725,0.0004741942],"domain_scores_gemma":[0.99434835,0.002907189,0.00038208903,0.0009926928,0.00091035524,0.00045942338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171475,0.00065013365,0.0007174337,0.0005335784,0.0007277625,0.0010142901,0.0013543094,0.0007044708,0.007082657],"category_scores_gemma":[0.005779389,0.00026941288,0.000168506,0.0006717229,0.000634123,0.0013358804,0.00083649356,0.00069946115,0.0007465435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.042206243,0.00180953,0.017207041,0.00075074204,0.00025980917,0.00092479977,0.0014668575,0.13382305,0.50476235,0.008377989,0.014462623,0.273949],"study_design_scores_gemma":[0.0012881836,0.003935694,0.011393701,0.00003288662,0.00023177388,0.0002807768,0.00045306067,0.51516664,0.46139818,0.002235157,0.0034623079,0.000121604586],"about_ca_topic_score_codex":0.00248376,"about_ca_topic_score_gemma":0.0018750911,"teacher_disagreement_score":0.007082657,"about_ca_system_score_codex":0.0006648739,"about_ca_system_score_gemma":0.0011567317,"threshold_uncertainty_score":0.02369392},"labels":[],"label_agreement":null},{"id":"W2148953945","doi":"10.1109/ares.2007.7","title":"A Modular Architecture for Secure and Reliable Distributed Communication","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Apache (Canada)","funders":"","keywords":"Computer science; USable; Modular design; Focus (optics); Web service; The Internet; Architecture; Distributed computing; Service-oriented architecture; Service (business); World Wide Web; Computer security; Operating system","score_opus":0.00828185510812406,"score_gpt":0.2400604019515377,"score_spread":0.23177854684341362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148953945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007609793,0.0005768382,0.97551775,0.0006187131,0.00017702015,0.0002191915,0.000052596326,0.0051265997,0.010101461],"genre_scores_gemma":[0.19859633,0.0012056695,0.7820339,0.00038628987,0.00027821862,0.0006417635,0.00032812022,0.0005279274,0.016001765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869967,0.00025287067,0.000106473555,0.00016719104,0.00062058045,0.00015323829],"domain_scores_gemma":[0.9991191,0.00010051782,0.00008180727,0.0002820221,0.000257084,0.00015950915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016568383,0.000639359,0.000526075,0.0008172052,0.0009809354,0.002276737,0.0014513307,0.0013325809,0.003244936],"category_scores_gemma":[0.0016215985,0.00067651627,0.00068423623,0.0007069895,0.0015680806,0.0027893148,0.002708933,0.0017244247,0.0027409028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030446736,0.00014627086,0.0009970746,0.0005635898,0.0001308564,0.00096050586,0.0012978787,0.054609954,0.066267386,0.6590538,0.017639143,0.19802904],"study_design_scores_gemma":[0.0002340845,0.0006149082,0.0012227474,0.00031454576,0.00018391928,0.0015870605,0.00020966679,0.28812078,0.028338319,0.26542282,0.41353977,0.00021144387],"about_ca_topic_score_codex":0.00088372006,"about_ca_topic_score_gemma":0.00085644115,"teacher_disagreement_score":0.003244936,"about_ca_system_score_codex":0.000622482,"about_ca_system_score_gemma":0.001555493,"threshold_uncertainty_score":0.010855377},"labels":[],"label_agreement":null},{"id":"W2149458927","doi":"10.1109/ideas.2005.26","title":"Evaluation of Integration of ACBL and AOCC Caching Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Interoperability; Concurrency; Throughput; Concurrency control; Client-side; False sharing; Distributed computing; Computer network; Operating system; Database; Cache algorithms; Wireless; Database transaction; CPU cache; Cache","score_opus":0.02663557233244799,"score_gpt":0.28486775357170685,"score_spread":0.25823218123925884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149458927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457378,0.0012934783,0.0420205,0.00018495746,0.00009198559,0.00042149774,0.00018405865,0.0046909386,0.0053747725],"genre_scores_gemma":[0.95473206,0.00021851486,0.043256834,0.000053449985,0.00002183098,0.000110115245,0.0005586549,0.00016032724,0.0008881749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9865259,0.0033400243,0.0012509237,0.0012417479,0.0065440605,0.0010974482],"domain_scores_gemma":[0.9710498,0.010872746,0.0016120981,0.003154284,0.012306907,0.0010041425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073167705,0.0016662999,0.0011888162,0.001753247,0.0008142941,0.0023167382,0.0034143769,0.0012220744,0.0011868757],"category_scores_gemma":[0.02703985,0.0006675107,0.00039181425,0.003172879,0.00082868495,0.0033090333,0.0013208071,0.0010520137,0.00030527005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012369678,0.005320016,0.07365468,0.0010582642,0.00059364,0.00040156412,0.0006963185,0.34621355,0.058241848,0.005674047,0.0035384065,0.4922379],"study_design_scores_gemma":[0.00032582547,0.0025674675,0.010215831,0.000037294332,0.00020289877,0.0001803965,0.00018812892,0.9478176,0.035797592,0.00051490404,0.0020991971,0.000052703595],"about_ca_topic_score_codex":0.010612252,"about_ca_topic_score_gemma":0.005454632,"teacher_disagreement_score":0.010612252,"about_ca_system_score_codex":0.0030353882,"about_ca_system_score_gemma":0.0026622214,"threshold_uncertainty_score":0.038695216},"labels":[],"label_agreement":null},{"id":"W2150086571","doi":"10.1109/icde.2011.5767927","title":"Real-time quantification and classification of consistency anomalies in multi-tier architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Serializability; Isolation (microbiology); Consistency (knowledge bases); Transaction processing; Database transaction; Benchmark (surveying); Concurrency control; Distributed computing; Nested transaction; Transaction data; Transaction processing system; Data mining; Database; Distributed transaction; Artificial intelligence","score_opus":0.05751157350921872,"score_gpt":0.2685650185810819,"score_spread":0.2110534450718632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150086571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88721865,0.0002599667,0.10892774,0.00011095488,0.000018580693,0.00004654972,0.0002005611,0.0026895064,0.00052749907],"genre_scores_gemma":[0.94789207,0.000061608305,0.05141529,0.000019985024,0.000011186052,0.000025224317,0.00027177832,0.000072788236,0.0002300224],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515116,0.00071078126,0.00052073505,0.0008662714,0.0024051843,0.0003458501],"domain_scores_gemma":[0.9756035,0.008936781,0.0066366782,0.004381237,0.0036846844,0.0007570615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002029568,0.0005183682,0.00066745153,0.0036897822,0.0004402752,0.0012193571,0.0010662748,0.00088495796,0.00029533388],"category_scores_gemma":[0.01628891,0.00036996295,0.0003182009,0.0023200181,0.0006729483,0.0020117078,0.00091137114,0.0009326271,0.00011223838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010523789,0.00059465197,0.49976444,0.0002707571,0.00016812781,0.00081093115,0.0010410025,0.091579735,0.10920952,0.0067829955,0.001418308,0.28730723],"study_design_scores_gemma":[0.000026244594,0.00030614308,0.07395479,0.000022053444,0.000060985596,0.0010149225,0.00020496435,0.8696817,0.04659962,0.006902693,0.0011688853,0.000057053927],"about_ca_topic_score_codex":0.001630704,"about_ca_topic_score_gemma":0.0020339775,"teacher_disagreement_score":0.0036897822,"about_ca_system_score_codex":0.0006997115,"about_ca_system_score_gemma":0.00061620644,"threshold_uncertainty_score":0.010733485},"labels":[],"label_agreement":null},{"id":"W2150519219","doi":"10.1109/icsse.2013.6614674","title":"Distributed intelligent systems: Technologies and applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Automation; Computer science; Distributed computing; Supervisory control; Actuator; Control (management); Embedded system; Systems engineering; Engineering","score_opus":0.010435067369279552,"score_gpt":0.22193231524036203,"score_spread":0.21149724787108248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150519219","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005028858,0.4353783,0.39803538,0.011037642,0.0031697648,0.00036601772,0.00048270123,0.0028918772,0.14360943],"genre_scores_gemma":[0.24057218,0.4104124,0.27406064,0.0031807576,0.0069302116,0.0009182763,0.0012346845,0.00044973858,0.06224108],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998995,0.00023840723,0.00008400218,0.00015506549,0.00046231944,0.00006520203],"domain_scores_gemma":[0.99933165,0.00023437204,0.000047683687,0.00010419714,0.00021086255,0.000071181414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082992093,0.00092158857,0.0009935498,0.0015736094,0.00058054365,0.0037115158,0.0012733884,0.0021680384,0.0055433735],"category_scores_gemma":[0.0018163881,0.00040018797,0.00036110004,0.0032546453,0.0014433346,0.003190998,0.0018791041,0.0017058355,0.003979559],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048946076,0.000075910524,0.0005182795,0.002054268,0.00006766092,0.00030221004,0.0004770705,0.009272933,0.0021687152,0.3520652,0.070313506,0.56263524],"study_design_scores_gemma":[0.00002911747,0.00005999789,0.00046246834,0.0006861629,0.00003630061,0.0006221524,0.00017840543,0.01667133,0.0009451392,0.31672892,0.6635414,0.000038633618],"about_ca_topic_score_codex":0.0005762549,"about_ca_topic_score_gemma":0.00034771307,"teacher_disagreement_score":0.0055433735,"about_ca_system_score_codex":0.0009076578,"about_ca_system_score_gemma":0.00077765126,"threshold_uncertainty_score":0.018544436},"labels":[],"label_agreement":null},{"id":"W2151056818","doi":"10.1109/iwoos.1995.470575","title":"(De-)clustering objects for multiprocessor system software","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Object (grammar); Software; Multiprocessing; Asynchronous communication; Cluster analysis; Object-oriented programming; Software system; Operating system; Distributed computing; Programming language; Artificial intelligence","score_opus":0.021815557818878163,"score_gpt":0.2277765936825284,"score_spread":0.20596103586365022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151056818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041536144,0.0003325226,0.9879772,0.00016170334,0.00006738877,0.00010400314,0.000060320723,0.004453909,0.002689392],"genre_scores_gemma":[0.047253106,0.00033186987,0.9461027,0.00012435927,0.00004910497,0.00017293952,0.00029911037,0.0008522088,0.00481458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.00021856956,0.000104525156,0.00017629782,0.0004961002,0.00009148906],"domain_scores_gemma":[0.9985654,0.0002179524,0.00014079662,0.00076309225,0.00024345021,0.000069329784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116102,0.00068643724,0.00049021514,0.0010691044,0.0011967854,0.0018557365,0.0016410054,0.00087314006,0.0036994203],"category_scores_gemma":[0.0025700098,0.0005756061,0.00077538984,0.0013711812,0.0012049192,0.0022490292,0.0019073708,0.0014753655,0.002218719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001546041,0.00007859374,0.00190764,0.0006316946,0.00006526197,0.00031384328,0.00095198065,0.053335752,0.027368683,0.31246305,0.024913456,0.5778154],"study_design_scores_gemma":[0.00008764045,0.00021100522,0.0017088593,0.00022909073,0.00010756576,0.00078422355,0.00018172273,0.2920467,0.043903407,0.1949394,0.46569166,0.00010863388],"about_ca_topic_score_codex":0.0027311642,"about_ca_topic_score_gemma":0.0051883296,"teacher_disagreement_score":0.0036994203,"about_ca_system_score_codex":0.0013099312,"about_ca_system_score_gemma":0.0013418985,"threshold_uncertainty_score":0.012375772},"labels":[],"label_agreement":null},{"id":"W2151447336","doi":"10.1109/ipps.1995.395923","title":"A distributed algorithm for the detection of local cycles and knots","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computation; Computer science; Knot (papermaking); Algorithm; Deadlock prevention algorithms; Node (physics); Running time; Graph; Theoretical computer science","score_opus":0.014939299291887073,"score_gpt":0.2238937045629812,"score_spread":0.2089544052710941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151447336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026599297,0.000086536966,0.9948442,0.00006634475,0.000037894286,0.00006830066,0.000034517292,0.0011940211,0.0010082326],"genre_scores_gemma":[0.07465638,0.00014364666,0.9209183,0.000066764194,0.000032812273,0.00025077353,0.00019003975,0.00014307245,0.0035982411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.00013754402,0.00006717221,0.00030611633,0.00029286838,0.000101123835],"domain_scores_gemma":[0.99885833,0.00044506005,0.000084860476,0.00024756187,0.00029304254,0.00007110388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010006898,0.0008027091,0.00091318693,0.0014755039,0.0010692216,0.0012514245,0.0019604417,0.0011344786,0.0060283225],"category_scores_gemma":[0.0036189645,0.00048639427,0.0006028173,0.0012647116,0.0010012138,0.002203695,0.0022122408,0.0013547577,0.0016328099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039564524,0.00017151047,0.001036896,0.00029999577,0.00007249354,0.00019822003,0.00033744035,0.15077218,0.02314284,0.09008514,0.008727748,0.72475994],"study_design_scores_gemma":[0.00020675502,0.00012529161,0.00028638047,0.000042807616,0.00003949076,0.00026866983,0.000060952818,0.9062547,0.011041562,0.05793626,0.02368251,0.000054639728],"about_ca_topic_score_codex":0.0022751896,"about_ca_topic_score_gemma":0.0024868243,"teacher_disagreement_score":0.0060283225,"about_ca_system_score_codex":0.0010451195,"about_ca_system_score_gemma":0.0015890782,"threshold_uncertainty_score":0.020166755},"labels":[],"label_agreement":null},{"id":"W2151758719","doi":"10.1109/icsmc.1991.169925","title":"Effect of preprocessing on election in a complete network with a sense of direction","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Preprocessor; Set (abstract data type); Computer science; Divide and conquer algorithms; Constant (computer programming); Factor (programming language); Sense (electronics); Combinatorics; Artificial intelligence; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Programming language; Engineering","score_opus":0.009357392329318292,"score_gpt":0.22171259783016645,"score_spread":0.21235520550084816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151758719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54340994,0.0013874453,0.417664,0.0022466113,0.00060572766,0.0005527635,0.00054807233,0.0074563185,0.026129074],"genre_scores_gemma":[0.89040494,0.00029197,0.10518648,0.00036889449,0.00008040808,0.00015366953,0.00031862454,0.0002845488,0.0029103914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753714,0.00095359865,0.00012246812,0.00043690312,0.000390677,0.0005592162],"domain_scores_gemma":[0.9760553,0.014762984,0.0010526688,0.006035495,0.0015909185,0.0005025849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002608032,0.00094536,0.0014155734,0.0005560131,0.0014887601,0.0015202723,0.0015111192,0.0010084016,0.0055647586],"category_scores_gemma":[0.016148547,0.00056058384,0.0008920459,0.00089399493,0.0009760323,0.0034584338,0.0015029128,0.0016362017,0.0009754736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011521565,0.0013016671,0.0051907315,0.0006744825,0.00031180243,0.0007359779,0.0006050295,0.590517,0.08059969,0.036151122,0.011771522,0.26061943],"study_design_scores_gemma":[0.0008689226,0.0017952742,0.0027739734,0.000055961405,0.00020457186,0.00034755396,0.00028698606,0.8607178,0.09697442,0.027625093,0.008270244,0.00007916879],"about_ca_topic_score_codex":0.002275523,"about_ca_topic_score_gemma":0.0034556838,"teacher_disagreement_score":0.0055647586,"about_ca_system_score_codex":0.0010128582,"about_ca_system_score_gemma":0.0016031341,"threshold_uncertainty_score":0.018615961},"labels":[],"label_agreement":null},{"id":"W2151996199","doi":"","title":"An Effic ient Fault-Tolerant method for Distributed Computation Systems","year":2011,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.036225295300168096,"score_gpt":0.2611313905860072,"score_spread":0.2249060952858391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151996199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027054257,0.00033826803,0.99325055,0.0002661787,0.00013474585,0.00006088758,0.00001880164,0.0005681268,0.00265699],"genre_scores_gemma":[0.15184984,0.0007472824,0.83604044,0.00021491376,0.0002081457,0.0002902836,0.00008685562,0.00013507858,0.010427264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992095,0.00015970609,0.000059277572,0.0000959757,0.00042881074,0.00004659575],"domain_scores_gemma":[0.99947566,0.00016294507,0.000030051307,0.00015891275,0.0001403093,0.000032129632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007639246,0.00055790186,0.00060567266,0.0007493511,0.00078806345,0.0011083558,0.0013749826,0.00094990514,0.0028575747],"category_scores_gemma":[0.002162079,0.00024762045,0.00036827527,0.0006692956,0.00082794076,0.0015960756,0.0010524282,0.0010784284,0.00087041134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027659396,0.00017964769,0.00049663405,0.0005259918,0.00007394689,0.00043310705,0.0004925693,0.09209735,0.05284311,0.36086836,0.013118097,0.4785946],"study_design_scores_gemma":[0.0001838826,0.00020355171,0.00019187876,0.000086428736,0.00005923602,0.00048356786,0.00005947716,0.7691518,0.023688322,0.119440615,0.08639706,0.000054252792],"about_ca_topic_score_codex":0.00047273116,"about_ca_topic_score_gemma":0.00069105794,"teacher_disagreement_score":0.0028575747,"about_ca_system_score_codex":0.0005337516,"about_ca_system_score_gemma":0.0007232198,"threshold_uncertainty_score":0.009559512},"labels":[],"label_agreement":null},{"id":"W2153255549","doi":"10.1109/icdcs.1994.302453","title":"Communicating abstract data type values in heterogeneous distributed programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Notation; Computer science; Data exchange; Representation (politics); External Data Representation; Converters; Data type; Abstract data type; Type (biology); Theoretical computer science; Electronic data interchange; Term (time); Selection (genetic algorithm); Programming language; Computer network; Artificial intelligence; World Wide Web; Mathematics; Engineering; Arithmetic","score_opus":0.10946982133878869,"score_gpt":0.3004307666694957,"score_spread":0.190960945330707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153255549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019008975,0.00007963631,0.97817504,0.0003034494,0.00003440705,0.00005587751,0.000029899695,0.0004802059,0.0018324809],"genre_scores_gemma":[0.28128463,0.0004692543,0.71119565,0.00037329533,0.00012854232,0.00053895894,0.00029182882,0.00059844705,0.0051193726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98603445,0.0063314345,0.0014798994,0.0011383737,0.0044477456,0.00056814426],"domain_scores_gemma":[0.9817563,0.011041519,0.001833222,0.0031765336,0.0017257845,0.00046660058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011929963,0.00056148757,0.0010466424,0.0014273654,0.0016851432,0.0062057837,0.0019493335,0.0022097183,0.001381203],"category_scores_gemma":[0.027296586,0.0008209442,0.000999694,0.0020886331,0.0042758733,0.009697494,0.00581523,0.0028895081,0.0004399685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000246454,0.00007271658,0.0013082422,0.00013859454,0.00003081164,0.0005719913,0.0024208357,0.045971826,0.0044807424,0.88555825,0.0017785187,0.057421032],"study_design_scores_gemma":[0.00013119097,0.00010334959,0.00021741328,0.00009763073,0.000059776172,0.0003591862,0.00061392813,0.29261628,0.020498803,0.65862,0.026622022,0.000060431496],"about_ca_topic_score_codex":0.0010372294,"about_ca_topic_score_gemma":0.00068708364,"teacher_disagreement_score":0.011929963,"about_ca_system_score_codex":0.0017185982,"about_ca_system_score_gemma":0.0017813304,"threshold_uncertainty_score":0.06309241},"labels":[],"label_agreement":null},{"id":"W2153698650","doi":"10.1109/icpads.1994.590320","title":"An optimal fault-tolerant design approach for array processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Redundancy (engineering); Fault tolerance; Computer science; Systolic array; Design space exploration; Parallel computing; Distributed computing; Embedded system; Very-large-scale integration","score_opus":0.04539953657415366,"score_gpt":0.2554936429121614,"score_spread":0.21009410633800776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153698650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038176274,0.00018664089,0.9940446,0.000092081835,0.00002871691,0.000019112425,0.0000110593455,0.00015600857,0.0016441786],"genre_scores_gemma":[0.29656932,0.00068670936,0.6990983,0.00019645042,0.00009711368,0.00021615834,0.00008359755,0.00006756914,0.0029848476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996934,0.00006174774,0.000018934756,0.00004208775,0.00014771211,0.00003622797],"domain_scores_gemma":[0.999818,0.00004581994,0.00002636857,0.000026552936,0.00007495441,0.000008298212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024377473,0.0005194935,0.00034800492,0.00039508374,0.00033284313,0.0004833526,0.00072004023,0.00037685732,0.0015219374],"category_scores_gemma":[0.00062585616,0.00027228464,0.0002722735,0.0003583596,0.00037542,0.0005930954,0.0003560985,0.0005206555,0.000330582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011684345,0.0000824852,0.0003842439,0.00025837147,0.000047970203,0.00013903041,0.000115788964,0.5371297,0.060132235,0.13685197,0.003528274,0.26121315],"study_design_scores_gemma":[0.000038864986,0.00020999514,0.00010663553,0.000021562213,0.00002987596,0.000118753334,0.000025590844,0.89643073,0.018738544,0.07265317,0.011611139,0.000015152749],"about_ca_topic_score_codex":0.00044710207,"about_ca_topic_score_gemma":0.0008130787,"teacher_disagreement_score":0.0015219374,"about_ca_system_score_codex":0.00040177561,"about_ca_system_score_gemma":0.0008072801,"threshold_uncertainty_score":0.0050914288},"labels":[],"label_agreement":null},{"id":"W2153987004","doi":"10.1109/fuzz.2002.1005081","title":"On the use of fuzzy logic in a hybrid scheme for tolerating mobile support station failure","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; Ministère de la Santé et des Services sociaux","keywords":"Acknowledgement; Scheme (mathematics); Computer science; Fuzzy logic; Mobile telephony; Distributed computing; Mobile computing; Fault tolerance; Computer network; Mobile radio; Mathematics; Artificial intelligence","score_opus":0.047991328063708955,"score_gpt":0.26696773607296487,"score_spread":0.2189764080092559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153987004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10012994,0.00031173113,0.8937059,0.0002656702,0.000042045307,0.000096121046,0.000026082163,0.00019190348,0.0052305805],"genre_scores_gemma":[0.85981387,0.00016517106,0.13825326,0.00008238946,0.000018659865,0.00007751149,0.000019673702,0.000010237231,0.0015592573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965584,0.00010944529,0.000023661396,0.000050317834,0.000113511785,0.00004711607],"domain_scores_gemma":[0.9993333,0.00032370922,0.00010103514,0.000056992383,0.00014059484,0.000044364682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804445,0.00038544857,0.00041404823,0.00042910455,0.00057924533,0.00081630977,0.0009762206,0.000713977,0.000993202],"category_scores_gemma":[0.0015685936,0.0001548645,0.0003648851,0.0004776093,0.0007208072,0.00076144806,0.00045194544,0.0004663895,0.00014968246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063109444,0.00023346399,0.0011300984,0.00014041792,0.00009593695,0.0002861069,0.0005095759,0.7560387,0.04260197,0.05802994,0.0009588505,0.13934377],"study_design_scores_gemma":[0.00006725348,0.00026918892,0.00024384497,0.000021189528,0.00004675751,0.00008929467,0.00004524586,0.97894603,0.0070935404,0.011791529,0.001354905,0.000031216056],"about_ca_topic_score_codex":0.0036460129,"about_ca_topic_score_gemma":0.0033886977,"teacher_disagreement_score":0.0036460129,"about_ca_system_score_codex":0.00087125774,"about_ca_system_score_gemma":0.0005807946,"threshold_uncertainty_score":0.0072495937},"labels":[],"label_agreement":null},{"id":"W2154357382","doi":"10.1145/2245276.2245384","title":"Query execution on a mobile database system","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mobile database; Distributed database; View; Database tuning; Architecture; Database; Query optimization; Mobile computing; Computer network; Database design; Mobile station; Base station","score_opus":0.0135556382610616,"score_gpt":0.2440647430713407,"score_spread":0.23050910481027911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154357382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3836297,0.001555708,0.6035347,0.0005886119,0.00007837612,0.00021152271,0.00012521519,0.003179153,0.007096992],"genre_scores_gemma":[0.901709,0.0003614145,0.0951477,0.000085212,0.000045227272,0.00006898144,0.0001316606,0.000110396686,0.0023403028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.00019602728,0.000058151265,0.00013644015,0.0003323973,0.00016965749],"domain_scores_gemma":[0.9989242,0.00042464756,0.00006629793,0.0002346443,0.00021030851,0.00013982285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007482008,0.0005341369,0.00084306474,0.00058605976,0.0011513206,0.0016501594,0.001394075,0.0007735555,0.0012941345],"category_scores_gemma":[0.00182854,0.0003320666,0.00032430072,0.00070636114,0.0005557919,0.0016882858,0.0011971821,0.000637166,0.00043133597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005573345,0.0006021836,0.014465227,0.0005418727,0.00036733906,0.0043106917,0.0034173548,0.21016811,0.31883332,0.07641569,0.012265388,0.35303944],"study_design_scores_gemma":[0.00019953815,0.0004885374,0.0015737789,0.000032061696,0.00014699473,0.0006518999,0.0007908749,0.92612994,0.046056774,0.01068009,0.0131976,0.000051981897],"about_ca_topic_score_codex":0.003709499,"about_ca_topic_score_gemma":0.0036936058,"teacher_disagreement_score":0.003709499,"about_ca_system_score_codex":0.0005596322,"about_ca_system_score_gemma":0.00051635865,"threshold_uncertainty_score":0.0073758364},"labels":[],"label_agreement":null},{"id":"W2154420835","doi":"10.1109/icpads.2007.4447755","title":"A faster closure algorithm for pattern matching in partial-order event data","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Computer science; Matching (statistics); Computation; Algorithm; Event (particle physics); Pattern matching; Data mining; Regular polygon; Artificial intelligence; Mathematics; Statistics","score_opus":0.028986927332814907,"score_gpt":0.3037739203656514,"score_spread":0.2747869930328365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154420835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039739753,0.000053889933,0.9945814,0.00006382314,0.000030432342,0.00006103967,0.00005594455,0.0008624869,0.0003169892],"genre_scores_gemma":[0.06536029,0.0001071051,0.9320856,0.00009326224,0.000059621492,0.00019931895,0.00064131775,0.00029979128,0.0011537462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964569,0.0004831335,0.000511834,0.00076508976,0.0014993043,0.0002836622],"domain_scores_gemma":[0.991981,0.003720638,0.00056767394,0.0020814317,0.0013749148,0.00027437025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003509827,0.0010698645,0.0021988677,0.0023888405,0.0012403677,0.0020368544,0.002804128,0.0012605133,0.004178266],"category_scores_gemma":[0.016594758,0.00081282767,0.001693093,0.0029094215,0.0012951122,0.005973313,0.0033653153,0.0022812898,0.0015022347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083234365,0.0004208667,0.0019257643,0.00029507227,0.00009263625,0.0004748056,0.0005400553,0.118646264,0.0307683,0.06800928,0.008419073,0.7695756],"study_design_scores_gemma":[0.00013552923,0.00016591177,0.00027754638,0.000026019305,0.00002284462,0.00041587558,0.00009022685,0.92728055,0.015187882,0.049060956,0.0072936527,0.000043017884],"about_ca_topic_score_codex":0.004499234,"about_ca_topic_score_gemma":0.0027342895,"teacher_disagreement_score":0.004499234,"about_ca_system_score_codex":0.00091583794,"about_ca_system_score_gemma":0.002892711,"threshold_uncertainty_score":0.018562019},"labels":[],"label_agreement":null},{"id":"W2155425945","doi":"10.1109/ares.2007.42","title":"Applying a Tradeoff Model (TOM) to TACT","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"","keywords":"Tact; Consistency (knowledge bases); Replication (statistics); Computer science; Middleware (distributed applications); Distributed computing; Quality (philosophy); Software; Reliability engineering; Engineering; Artificial intelligence; Operating system","score_opus":0.02051294690812758,"score_gpt":0.27038368074700336,"score_spread":0.24987073383887579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155425945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023994561,0.00043383177,0.9290067,0.0019295319,0.0001275765,0.000116737865,0.00012920667,0.000328459,0.043933433],"genre_scores_gemma":[0.7044464,0.0006007059,0.2801401,0.00065412326,0.00019608262,0.00059943774,0.000221735,0.0002613808,0.012880058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651223,0.0014828579,0.00017880667,0.000514741,0.0009429574,0.0003684369],"domain_scores_gemma":[0.99316674,0.0039330446,0.00069569563,0.0010226141,0.00086846756,0.00031352733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037158327,0.0009958498,0.0009267529,0.0015143768,0.0013765063,0.0032359203,0.0023789133,0.0025998212,0.006192761],"category_scores_gemma":[0.014157397,0.0006968361,0.0014774807,0.0019457531,0.0024425348,0.00693473,0.002484865,0.0024986975,0.0009398355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008929279,0.00006245525,0.00076042477,0.00008866622,0.000040211966,0.00030807924,0.0005379083,0.12758526,0.001023707,0.85175854,0.0020687054,0.015676793],"study_design_scores_gemma":[0.000026934515,0.00006944281,0.00023312804,0.000026232032,0.000022903258,0.00031813342,0.00016758147,0.42752278,0.00038540372,0.5599451,0.011245573,0.000036834535],"about_ca_topic_score_codex":0.0027719634,"about_ca_topic_score_gemma":0.0020312134,"teacher_disagreement_score":0.006192761,"about_ca_system_score_codex":0.00297001,"about_ca_system_score_gemma":0.0018371772,"threshold_uncertainty_score":0.021549046},"labels":[],"label_agreement":null},{"id":"W2156537685","doi":"10.1016/j.tcs.2015.04.004","title":"On the expressivity of time-varying graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Institute for Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Rendering (computer graphics); Algebraic number; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.017447829726501374,"score_gpt":0.24559491417567908,"score_spread":0.2281470844491777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156537685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08906217,0.0012758893,0.8797716,0.0019461437,0.00014149971,0.00004080465,0.0004529014,0.00047103525,0.026838003],"genre_scores_gemma":[0.9065678,0.0022079821,0.07494844,0.0007350751,0.00039949338,0.00012994703,0.0007116074,0.00037098388,0.013928531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983304,0.00065464695,0.00009304006,0.00037187268,0.00034972557,0.00020026151],"domain_scores_gemma":[0.9864189,0.010526205,0.0009775264,0.0009231454,0.0008075148,0.00034675034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026932058,0.0009928033,0.0008341872,0.0015562307,0.0008183484,0.0027598513,0.001985904,0.0012725324,0.0040062615],"category_scores_gemma":[0.01375995,0.00069094537,0.0011352856,0.001819549,0.0028393515,0.0066408804,0.0021681169,0.0037725717,0.00050784566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036569865,0.0000144107835,0.00018712568,0.00003717191,0.000012824113,0.00006931949,0.00021284694,0.01827701,0.0008466673,0.9750404,0.0006855935,0.0045800745],"study_design_scores_gemma":[0.000009726158,0.000014299472,0.0000895712,0.000014957817,0.000012232969,0.00004635809,0.000040029696,0.10269777,0.00025771337,0.8956823,0.001125261,0.0000098127675],"about_ca_topic_score_codex":0.0026404408,"about_ca_topic_score_gemma":0.0016330618,"teacher_disagreement_score":0.0040062615,"about_ca_system_score_codex":0.0018095322,"about_ca_system_score_gemma":0.0005466085,"threshold_uncertainty_score":0.0142431855},"labels":[],"label_agreement":null},{"id":"W2157550063","doi":"10.1145/2559904","title":"The Space Complexity of Long-Lived and One-Shot Timestamp Implementations","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timestamp; Timestamp-based concurrency control; Computer science; Upper and lower bounds; Identifier; Time complexity; Asynchronous communication; Spacetime; Theoretical computer science; Algorithm; Mathematics; Programming language; Real-time computing; Concurrency control; Physics","score_opus":0.09217044298558189,"score_gpt":0.32247571661505103,"score_spread":0.23030527362946915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157550063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45843,0.0012698539,0.5238885,0.0020925612,0.0001270746,0.0002920672,0.00060323835,0.0030561555,0.010240569],"genre_scores_gemma":[0.8612788,0.00040667105,0.13177858,0.00023814208,0.00006392841,0.0003345191,0.00056713785,0.00032069275,0.0050114957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99142295,0.0021893724,0.0009248178,0.0013956797,0.0023160311,0.0017512223],"domain_scores_gemma":[0.9768644,0.014114328,0.0017679037,0.005324091,0.0012672989,0.00066205347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038149124,0.0009250878,0.0013946759,0.00068024214,0.0014083091,0.0049673403,0.003995446,0.002256479,0.007353243],"category_scores_gemma":[0.022306934,0.00087858684,0.0014344744,0.0019528219,0.0024120673,0.014553759,0.0041958317,0.0032159125,0.0009489729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035360728,0.00059825473,0.0065000076,0.0012002712,0.00024411305,0.00043052918,0.0021632675,0.34938675,0.031791493,0.38798407,0.007260339,0.2089049],"study_design_scores_gemma":[0.00040445037,0.000633555,0.0012715198,0.00012875845,0.00018981071,0.00033086474,0.00066437194,0.6589398,0.024063313,0.3085051,0.004759699,0.000108787375],"about_ca_topic_score_codex":0.002309281,"about_ca_topic_score_gemma":0.0025274316,"teacher_disagreement_score":0.007353243,"about_ca_system_score_codex":0.0030111535,"about_ca_system_score_gemma":0.0044474145,"threshold_uncertainty_score":0.024599075},"labels":[],"label_agreement":null},{"id":"W2157873963","doi":"10.1109/ideas.2003.1214952","title":"High availability solutions for transactional database systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Server; High availability; Database; Transaction processing; Transactional leadership; Distributed database; Software; Database transaction; Distributed computing; World Wide Web; Operating system","score_opus":0.0343764693970314,"score_gpt":0.24870804406641525,"score_spread":0.21433157466938385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157873963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03430636,0.0102601955,0.92462903,0.0025035685,0.00054842746,0.00027051126,0.00015273495,0.002254339,0.025074828],"genre_scores_gemma":[0.4594454,0.0071164593,0.5138662,0.0008045979,0.0008611126,0.00040124948,0.000543267,0.00037250298,0.016589165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971866,0.0005672439,0.0002612064,0.00019514542,0.00158686,0.00020302094],"domain_scores_gemma":[0.99624556,0.001375134,0.00040969864,0.0006604606,0.0011426951,0.0001663183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020745134,0.00045355482,0.00051766535,0.00086901296,0.0010669205,0.0033317553,0.0016092523,0.0011452896,0.006358974],"category_scores_gemma":[0.007894061,0.00041076101,0.00031598532,0.0013630157,0.00068942463,0.0036463195,0.0024962043,0.0017968144,0.0016150753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034525394,0.00023850947,0.0012929717,0.001178243,0.00008697568,0.0005144916,0.0016692443,0.019363666,0.0407404,0.4269284,0.021462122,0.4861797],"study_design_scores_gemma":[0.0001795715,0.00065486314,0.0013301453,0.00047138476,0.00012451824,0.002485899,0.0013603726,0.17529695,0.03778098,0.44246396,0.33773926,0.000112115864],"about_ca_topic_score_codex":0.00029266212,"about_ca_topic_score_gemma":0.0003880935,"teacher_disagreement_score":0.006358974,"about_ca_system_score_codex":0.0005207865,"about_ca_system_score_gemma":0.00067078095,"threshold_uncertainty_score":0.021272898},"labels":[],"label_agreement":null},{"id":"W2158501579","doi":"10.5555/1898953.1898956","title":"Making lockless synchronization fast: performance implications of memory reclamation","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Land reclamation; Pointer (user interface); Workload; Priority inversion; Blocking (statistics); Synchronization (alternating current); Distributed computing; Data structure; Computer network; Embedded system; Operating system; Dynamic priority scheduling; Computer hardware","score_opus":0.016354967677553057,"score_gpt":0.2474174421058779,"score_spread":0.23106247442832484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158501579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6951372,0.0058311257,0.27582908,0.0029422098,0.00040177768,0.000112493435,0.00014502028,0.003602819,0.015998358],"genre_scores_gemma":[0.96142644,0.00091344287,0.036219224,0.000111594425,0.00009886831,0.000039693194,0.00006477403,0.0002162648,0.00090963487],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825543,0.0006669009,0.000087509405,0.00019241397,0.00042123577,0.00037656928],"domain_scores_gemma":[0.9813058,0.011897336,0.0014006541,0.0034807809,0.0015056805,0.00040980213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029587918,0.0006005582,0.0004974377,0.00050146435,0.0010563175,0.0020098477,0.0014203009,0.00087886857,0.0028746184],"category_scores_gemma":[0.022392306,0.00031997322,0.0001786264,0.0010174419,0.0011875338,0.005931308,0.0015497576,0.001087431,0.0005687133],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028726037,0.00063942047,0.015119716,0.0010902341,0.00014436254,0.00047685206,0.0011452617,0.29982296,0.13342302,0.08729552,0.0093053505,0.44866467],"study_design_scores_gemma":[0.00041219586,0.0015528325,0.007001681,0.00010452875,0.00021547155,0.00046807324,0.00092553877,0.7734049,0.1360514,0.06942206,0.010317174,0.00012413191],"about_ca_topic_score_codex":0.0010301566,"about_ca_topic_score_gemma":0.0015142491,"teacher_disagreement_score":0.0029587918,"about_ca_system_score_codex":0.0006557629,"about_ca_system_score_gemma":0.0011041673,"threshold_uncertainty_score":0.015647769},"labels":[],"label_agreement":null},{"id":"W2160554755","doi":"10.1109/icnp.1995.524827","title":"Protocol synthesis using basic Lotos and global variables","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Protocol (science); Language Of Temporal Ordering Specification; Programming language; Transformation (genetics); Theoretical computer science; Specification language; Formal description; Service (business); Distributed computing","score_opus":0.03582872251183743,"score_gpt":0.2677484295632656,"score_spread":0.23191970705142817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160554755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004976247,0.00020539413,0.9916483,0.00007310323,0.00003711375,0.00009177072,0.00002964242,0.0004228339,0.0025155435],"genre_scores_gemma":[0.19228752,0.00054755114,0.80179524,0.00020728115,0.00004407861,0.0007385789,0.00017482595,0.00029215342,0.003912778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.00034817235,0.00010494115,0.00020293322,0.0003915488,0.00010236941],"domain_scores_gemma":[0.9989818,0.00051000656,0.00007626723,0.0002224647,0.00017175253,0.000037803653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020982898,0.0007073231,0.0006351598,0.00070326467,0.0004936638,0.0008813517,0.00087312976,0.000624022,0.0022372983],"category_scores_gemma":[0.0021511836,0.00061190256,0.0009240796,0.00055982644,0.0014937787,0.0017759232,0.0012153352,0.0013405763,0.00049180316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003316316,0.000077027245,0.00033274136,0.00059955905,0.00006563704,0.00029851755,0.00063572335,0.086323954,0.047810372,0.745154,0.0016109812,0.11675983],"study_design_scores_gemma":[0.00027260123,0.000524656,0.00016986804,0.00017213654,0.000115344425,0.00031833438,0.00012363621,0.3550871,0.10269595,0.481213,0.059208255,0.00009916455],"about_ca_topic_score_codex":0.00042468193,"about_ca_topic_score_gemma":0.00051463494,"teacher_disagreement_score":0.0022372983,"about_ca_system_score_codex":0.0006200715,"about_ca_system_score_gemma":0.00090821786,"threshold_uncertainty_score":0.011096954},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006362793586701465,"score_gpt":0.21462253705399292,"score_spread":0.20825974346729145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160685416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025587954,0.00020830572,0.96898806,0.00064467057,0.0000847557,0.00008824721,0.000050501556,0.00038835846,0.003959175],"genre_scores_gemma":[0.62877816,0.0005859769,0.3595151,0.00038527427,0.00031448272,0.00052651257,0.00014847584,0.0002853482,0.009460616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961171,0.001276654,0.00017702243,0.0006330102,0.001225492,0.0005706939],"domain_scores_gemma":[0.98932964,0.00558199,0.0010965735,0.0029659483,0.00067927595,0.00034656964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037855275,0.00081252924,0.0012075423,0.00090539944,0.0016730202,0.0024134468,0.0032985418,0.001845114,0.0023823562],"category_scores_gemma":[0.012674535,0.0005796095,0.001028107,0.001201315,0.0034079205,0.009725669,0.0039305054,0.0036482774,0.0007975868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035792674,0.00009957227,0.00039272345,0.00014325872,0.00003246581,0.00019662903,0.00054131035,0.13955526,0.0064759464,0.8124792,0.0025926498,0.037133086],"study_design_scores_gemma":[0.00010043193,0.00012043926,0.00009643323,0.000021312222,0.000020355279,0.000108451335,0.000050095638,0.47954538,0.007846803,0.5057704,0.006281017,0.000038830785],"about_ca_topic_score_codex":0.0009719432,"about_ca_topic_score_gemma":0.000808258,"teacher_disagreement_score":0.0037855275,"about_ca_system_score_codex":0.0014878283,"about_ca_system_score_gemma":0.0015298554,"threshold_uncertainty_score":0.020020008},"labels":[],"label_agreement":null},{"id":"W2160927132","doi":"10.1109/hicss.1995.375493","title":"Data consistency in a distributed persistent object system","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"College of Family Physicians of Canada","keywords":"Computer science; Concurrency; Consistency (knowledge bases); Programming language; Object (grammar); Code (set theory); Relation (database); Data type; Data consistency; Concurrency control; Object-oriented programming; Theoretical computer science; Distributed computing; Data mining; Artificial intelligence","score_opus":0.054391940490366754,"score_gpt":0.2453413520676749,"score_spread":0.19094941157730816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160927132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054075606,0.00071172643,0.9323036,0.0015730851,0.00017336171,0.00015981233,0.00014512692,0.0033285876,0.007529053],"genre_scores_gemma":[0.6203569,0.0009356274,0.3622894,0.00072086527,0.00032844517,0.0005314813,0.00055124157,0.0008325516,0.013453528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99340314,0.0016533529,0.00080082787,0.00085634855,0.0028394319,0.00044694077],"domain_scores_gemma":[0.9870991,0.0043715867,0.0009534041,0.004625535,0.0024905486,0.0004599382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069798757,0.00027842593,0.00082782947,0.00093404547,0.0023807304,0.0058560953,0.0025849605,0.0017484665,0.0018686507],"category_scores_gemma":[0.018909875,0.0009225001,0.0005169102,0.0016550929,0.0030712266,0.0073100994,0.0056391405,0.0025267403,0.00076831854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007367988,0.00027447756,0.007832083,0.0004608347,0.00010400893,0.0016272324,0.003820177,0.06045989,0.013885561,0.7505851,0.011080619,0.14913324],"study_design_scores_gemma":[0.0005888052,0.00030598667,0.0011833243,0.000127169,0.00023015331,0.0011819177,0.0007302482,0.32148084,0.025979992,0.5579853,0.09008365,0.00012253223],"about_ca_topic_score_codex":0.0032946654,"about_ca_topic_score_gemma":0.00154119,"teacher_disagreement_score":0.0069798757,"about_ca_system_score_codex":0.001163275,"about_ca_system_score_gemma":0.003040151,"threshold_uncertainty_score":0.036913574},"labels":[],"label_agreement":null},{"id":"W2161234583","doi":"10.1109/mcsa.2000.895381","title":"A mobile code toolkit for adaptive mobile applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mobile computing; Mobile Web; Mobile device; Wireless; Mobile telephony; Mobile technology; Robustness (evolution); Distributed computing; Mobile database; Computer network; Mobile station; Mobile radio; Telecommunications; Operating system; Base station","score_opus":0.026677987820858597,"score_gpt":0.25818564927565746,"score_spread":0.23150766145479887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161234583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013766611,0.0005698466,0.8502566,0.00047542911,0.00015502828,0.0006728337,0.00045951325,0.12024417,0.013399937],"genre_scores_gemma":[0.23784661,0.0008851404,0.7102167,0.0006290715,0.00011250668,0.0015533201,0.002170159,0.015391481,0.031194974],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999388,0.00010058995,0.00006546842,0.00006647308,0.00027995047,0.00009944952],"domain_scores_gemma":[0.99834037,0.00050069,0.00012224921,0.00043366622,0.00035254392,0.00025050872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072020595,0.00081506337,0.00048299198,0.0008817578,0.0006942804,0.0011262193,0.0020689573,0.0012442986,0.0061531174],"category_scores_gemma":[0.00462043,0.00063055166,0.00067586347,0.00063691434,0.0008938327,0.0023270252,0.0027858764,0.0020763702,0.0040873126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014301678,0.00044464407,0.005769225,0.0014000623,0.00014708296,0.0034729575,0.0031372057,0.026357152,0.13800944,0.11944658,0.12072354,0.57966185],"study_design_scores_gemma":[0.0003665262,0.0005848376,0.0033133586,0.0004106686,0.000113505215,0.0038474842,0.0002977557,0.24242988,0.06059076,0.042964336,0.64476454,0.0003162707],"about_ca_topic_score_codex":0.001482013,"about_ca_topic_score_gemma":0.0017365399,"teacher_disagreement_score":0.0061531174,"about_ca_system_score_codex":0.00046065418,"about_ca_system_score_gemma":0.0010776283,"threshold_uncertainty_score":0.020584166},"labels":[],"label_agreement":null},{"id":"W2161536662","doi":"10.1007/978-3-642-13284-1_12","title":"Distributed Tree Comparison with Nodes of Limited Memory","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Tree (set theory); Task (project management); Automaton; Class (philosophy); Theoretical computer science; Distributed algorithm; Timed automaton; Enhanced Data Rates for GSM Evolution; Shared memory; Parallel computing; State (computer science); Distributed memory; Discrete mathematics; Distributed computing; Algorithm; Combinatorics; Mathematics; Computer network; Artificial intelligence","score_opus":0.014641470582872304,"score_gpt":0.23756665015031236,"score_spread":0.22292517956744007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161536662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2884206,0.0050602225,0.67463785,0.0012735976,0.0011305541,0.00021366439,0.0008812795,0.0032737309,0.025108514],"genre_scores_gemma":[0.7570807,0.0005129808,0.23233317,0.00017168406,0.00029846636,0.00013982355,0.00065172184,0.00043329757,0.008378152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.00032389906,0.00006647597,0.00016797765,0.00039654734,0.00010743682],"domain_scores_gemma":[0.9938315,0.003194931,0.00022357558,0.0015291634,0.0009698011,0.0002509792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017439821,0.0004273568,0.0013492928,0.0013827981,0.000771039,0.0013196793,0.0024388072,0.0009546089,0.0099176075],"category_scores_gemma":[0.010911699,0.000274941,0.00036002038,0.002108077,0.0005414274,0.004167728,0.0016915881,0.000717724,0.00080807594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007785852,0.00038301345,0.0034775916,0.000771668,0.00026069826,0.0003390807,0.0003488944,0.17989387,0.029796423,0.12729965,0.021549739,0.6280936],"study_design_scores_gemma":[0.00044668387,0.00068459293,0.0013396612,0.000098352204,0.0001781246,0.0003445634,0.000121237215,0.79493403,0.020324983,0.17018564,0.011304707,0.000037455953],"about_ca_topic_score_codex":0.0006154821,"about_ca_topic_score_gemma":0.0014014242,"teacher_disagreement_score":0.0099176075,"about_ca_system_score_codex":0.0009777928,"about_ca_system_score_gemma":0.00106567,"threshold_uncertainty_score":0.033177733},"labels":[],"label_agreement":null},{"id":"W2162167216","doi":"10.1109/reldis.1995.526227","title":"Performance analysis of a regeneration-based dynamic voting algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Voting; Overhead (engineering); Consistency (knowledge bases); Distributed computing; Algorithm; Object (grammar); Regeneration (biology); Scheme (mathematics); Virtual machine; Dynamic data; Real-time computing; Operating system; Database; Artificial intelligence; Mathematics","score_opus":0.01150971308709491,"score_gpt":0.2191548836785838,"score_spread":0.20764517059148888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162167216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6203088,0.0011523478,0.36262882,0.00045373317,0.000094463365,0.00020222201,0.00011214379,0.002562763,0.012484794],"genre_scores_gemma":[0.9720623,0.000059937913,0.026552198,0.000023981831,0.000010065784,0.00004037946,0.00008083278,0.00003191763,0.0011383957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983724,0.0005077478,0.000055768294,0.0002022966,0.00054036843,0.00032149936],"domain_scores_gemma":[0.9944199,0.0033299502,0.00031600604,0.0005069671,0.0011904376,0.0002367241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215641,0.00038876425,0.0007272831,0.00074434845,0.0007280556,0.0007619624,0.0011890783,0.0007533306,0.0025473454],"category_scores_gemma":[0.007914634,0.00017365356,0.00019209318,0.0007041465,0.00058277807,0.0007713615,0.0006057916,0.00043432094,0.00044387064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025723996,0.0002588126,0.0044202665,0.00010796448,0.00007263436,0.000090845875,0.000110949644,0.7831316,0.022412634,0.011189035,0.0021770662,0.1734558],"study_design_scores_gemma":[0.00002659281,0.00010002741,0.0002470146,0.0000015771016,0.0000060383873,0.000025701613,0.0000072037315,0.9969212,0.0019254476,0.00055006373,0.00018425091,0.000004906698],"about_ca_topic_score_codex":0.0041191652,"about_ca_topic_score_gemma":0.002323577,"teacher_disagreement_score":0.0041191652,"about_ca_system_score_codex":0.001333427,"about_ca_system_score_gemma":0.0014928223,"threshold_uncertainty_score":0.011717558},"labels":[],"label_agreement":null},{"id":"W2162312647","doi":"10.1109/dsn.2007.86","title":"Scaling and Continuous Availability in Database Server Clusters through Multiversion Replication","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Database server; Replication (statistics); Database; Node (physics); Workload; Throughput; Control reconfiguration; Database tuning; Operating system; Middleware (distributed applications); Embedded system; Database design; View","score_opus":0.020042224287205694,"score_gpt":0.27748778279194264,"score_spread":0.25744555850473694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162312647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47373968,0.0018836494,0.5165321,0.00072281586,0.00015921371,0.00012503563,0.000055631146,0.0025600127,0.0042218766],"genre_scores_gemma":[0.95057386,0.00026534803,0.04765976,0.00005249366,0.00008607116,0.000061802704,0.00004028446,0.00011389752,0.0011464572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795365,0.0005980251,0.00012248702,0.00039511043,0.00063699216,0.00029369243],"domain_scores_gemma":[0.9939551,0.002664154,0.0005772521,0.0017400371,0.0007476455,0.00031580168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582778,0.0004976445,0.0007411763,0.0007181646,0.0011180446,0.0016877458,0.002228362,0.00071814714,0.0008808727],"category_scores_gemma":[0.008038205,0.0005156745,0.00038623976,0.0009063373,0.0012304832,0.0028877917,0.0020311766,0.0007990462,0.0003424377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010415482,0.00033457417,0.015252847,0.00039428636,0.00020702905,0.0006977219,0.0023823625,0.6102191,0.085257426,0.047796484,0.0045603025,0.23185635],"study_design_scores_gemma":[0.000096187236,0.00029307054,0.0018301839,0.000018364746,0.000066967885,0.00040784033,0.00048333517,0.9643341,0.013773003,0.014492225,0.0041563567,0.000048441038],"about_ca_topic_score_codex":0.0022051602,"about_ca_topic_score_gemma":0.0013545757,"teacher_disagreement_score":0.002582778,"about_ca_system_score_codex":0.000860922,"about_ca_system_score_gemma":0.0006844113,"threshold_uncertainty_score":0.013659179},"labels":[],"label_agreement":null},{"id":"W2162838679","doi":"10.1002/net.21463","title":"Distributed tree comparison with nodes of limited memory","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Tree (set theory); Task (project management); Class (philosophy); Automaton; Binary logarithm; Enhanced Data Rates for GSM Evolution; Theoretical computer science; State (computer science); Discrete mathematics; Shared memory; Parallel computing; Combinatorics; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.015946542808643993,"score_gpt":0.23702053338625434,"score_spread":0.22107399057761035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162838679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5831999,0.0007441557,0.40833116,0.00053828966,0.00009350897,0.00014988819,0.00016590826,0.0012047755,0.0055723162],"genre_scores_gemma":[0.90019166,0.00009936787,0.096625485,0.0000610498,0.000042837808,0.00011420746,0.00012699966,0.00010832421,0.0026299648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99793977,0.000592632,0.00015224512,0.0005705926,0.00045539296,0.00028937982],"domain_scores_gemma":[0.98458856,0.009667278,0.0012636777,0.0028515833,0.0009778233,0.00065113604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515139,0.0005106255,0.0014164755,0.00070999545,0.0010500406,0.0021137975,0.0029318277,0.0012753378,0.0053317756],"category_scores_gemma":[0.011876881,0.00047336836,0.00060630793,0.0011485065,0.001187181,0.005672121,0.0021397837,0.001003361,0.00065623055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004651527,0.00050174503,0.0051579,0.000556824,0.0001753485,0.00079345517,0.0008004474,0.6351975,0.0625192,0.09271314,0.0027946248,0.19413824],"study_design_scores_gemma":[0.00014042006,0.0004223066,0.0005222938,0.000021735112,0.000055566583,0.00013893865,0.00011195988,0.91042817,0.020854563,0.06527229,0.0020000576,0.00003164241],"about_ca_topic_score_codex":0.00095100765,"about_ca_topic_score_gemma":0.0009988729,"teacher_disagreement_score":0.0053317756,"about_ca_system_score_codex":0.0013360083,"about_ca_system_score_gemma":0.0009636314,"threshold_uncertainty_score":0.01783657},"labels":[],"label_agreement":null},{"id":"W2163743319","doi":"10.1007/s00165-005-0079-4","title":"The verified software repository: a step towards the verifying compiler","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Pernambuco; University of Illinois at Urbana-Champaign; London South Bank University; McMaster University","keywords":"Computer science; Compiler; Dependability; Software engineering; Software development; Software; Programming language","score_opus":0.010244577768595116,"score_gpt":0.21701436317577175,"score_spread":0.20676978540717664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163743319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028664668,0.000391352,0.97094506,0.0029593797,0.00080715853,0.00026111587,0.00021915705,0.018680757,0.002869571],"genre_scores_gemma":[0.023588749,0.00045255397,0.96420413,0.0008914916,0.0002644045,0.00019957649,0.0010622931,0.0058080796,0.0035287046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9653279,0.013511583,0.004032985,0.0024589438,0.013218112,0.0014504746],"domain_scores_gemma":[0.8961848,0.029976573,0.004476908,0.04033286,0.025978139,0.0030507538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04252172,0.0011145486,0.0019165257,0.004028948,0.0018939648,0.009123042,0.007580749,0.004160102,0.008851981],"category_scores_gemma":[0.0779206,0.002248044,0.002384811,0.0024584387,0.004360734,0.023160806,0.008308786,0.011609228,0.009292349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005048435,0.00060782407,0.0023046595,0.00089389173,0.00010923124,0.0012493691,0.0014032841,0.024111982,0.0119126905,0.49135932,0.077096164,0.38844678],"study_design_scores_gemma":[0.00043645632,0.000680329,0.000649972,0.0015070292,0.00016826506,0.0014994196,0.0005044893,0.18821198,0.044359002,0.2509538,0.51068765,0.00034160513],"about_ca_topic_score_codex":0.0021679,"about_ca_topic_score_gemma":0.0011553592,"teacher_disagreement_score":0.04252172,"about_ca_system_score_codex":0.0019760525,"about_ca_system_score_gemma":0.011737059,"threshold_uncertainty_score":0.22487903},"labels":[],"label_agreement":null},{"id":"W2164697936","doi":"10.1109/ispan.2005.26","title":"Cloning-Based Checkpoint for Localized Recovery","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Computer science; Protocol (science); Distributed computing; Decoupling (probability); Parallel computing; Theoretical computer science; Mathematics; Engineering","score_opus":0.009910077294927185,"score_gpt":0.2293605101503463,"score_spread":0.21945043285541913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164697936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116500095,0.00091887795,0.87658185,0.0002952795,0.00004938551,0.00011379415,0.000024978097,0.0011166466,0.004399083],"genre_scores_gemma":[0.9149199,0.00050112983,0.08132599,0.00008390701,0.000022332213,0.000102087695,0.000047629466,0.00007778193,0.0029192062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937636,0.0001570495,0.000030103365,0.000101437276,0.00024910565,0.00008589302],"domain_scores_gemma":[0.9984047,0.0006727306,0.00020328794,0.00048463032,0.0001643943,0.00007034011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732381,0.0002791955,0.00043985507,0.00041280992,0.0006397271,0.000538443,0.0008063717,0.0005634283,0.001389962],"category_scores_gemma":[0.0022585401,0.00015146365,0.00030359218,0.00045592306,0.001415244,0.0016296912,0.0015763515,0.0008058686,0.000272815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005033546,0.00015085688,0.0025791225,0.0005113895,0.000061036444,0.0010946264,0.0014237848,0.2354537,0.18218087,0.41263664,0.0029213137,0.16048332],"study_design_scores_gemma":[0.00009079851,0.00041436346,0.0010897525,0.00007523227,0.000090579,0.0006680498,0.0002792512,0.8160641,0.098410815,0.06750598,0.015244411,0.00006659148],"about_ca_topic_score_codex":0.0010568842,"about_ca_topic_score_gemma":0.000693425,"teacher_disagreement_score":0.001389962,"about_ca_system_score_codex":0.0008494366,"about_ca_system_score_gemma":0.0006027159,"threshold_uncertainty_score":0.00616318},"labels":[],"label_agreement":null},{"id":"W2165821496","doi":"10.1002/cpe.3263","title":"High‐performance<i>N</i>‐thread software solutions for mutual exclusion","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Correctness; Thread (computing); Intuition; Algorithm; Software; Implementation; Critical section; Parallel computing; Programming language","score_opus":0.025177903421765332,"score_gpt":0.2955406178304535,"score_spread":0.27036271440868814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165821496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017962743,0.0005960909,0.9697651,0.00047006327,0.00012690696,0.000082407896,0.000028353255,0.003335256,0.0076330504],"genre_scores_gemma":[0.30630532,0.0006217868,0.6812845,0.00023491214,0.00012031859,0.00022087552,0.00020291384,0.00082495774,0.010184425],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998694,0.0003180939,0.000105239524,0.00015299239,0.00055747817,0.00017212704],"domain_scores_gemma":[0.9976534,0.00071141147,0.00028803703,0.0005909042,0.0005978503,0.00015840308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017341479,0.0005352285,0.0005303798,0.0006616436,0.00070252887,0.0019812512,0.001862947,0.0007910132,0.005785853],"category_scores_gemma":[0.0042336034,0.00030585617,0.0006109713,0.0006414934,0.0009414038,0.0022545722,0.0016984855,0.0012201442,0.0016769065],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034902524,0.00026172563,0.0029134646,0.0006469055,0.00006412786,0.00015471147,0.00058332784,0.08247323,0.033328656,0.30453032,0.020508874,0.55418557],"study_design_scores_gemma":[0.00013295254,0.00032111417,0.00078881264,0.00017290641,0.00004711094,0.0003535884,0.0001571247,0.73556405,0.05567936,0.13454391,0.0721612,0.000077813085],"about_ca_topic_score_codex":0.0012847412,"about_ca_topic_score_gemma":0.00096405187,"teacher_disagreement_score":0.005785853,"about_ca_system_score_codex":0.0012556656,"about_ca_system_score_gemma":0.001402276,"threshold_uncertainty_score":0.019355595},"labels":[],"label_agreement":null},{"id":"W2165870196","doi":"10.1145/1772690.1772711","title":"Automated object persistence for JavaScript","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; JavaScript; Rich Internet application; Web application; Cloud computing; Ajax; The Internet; World Wide Web; Compiler; Operating system","score_opus":0.01863535747620306,"score_gpt":0.2504688646332578,"score_spread":0.23183350715705472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165870196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013330715,0.00025088649,0.9579745,0.00024156205,0.0000617756,0.00010863245,0.000085423264,0.02610172,0.0018448118],"genre_scores_gemma":[0.309393,0.00053548894,0.67540973,0.0002797987,0.0001696908,0.00024757956,0.0007714299,0.006257414,0.0069358475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756974,0.00030032202,0.00030287297,0.00041518157,0.0011048783,0.000306926],"domain_scores_gemma":[0.9936047,0.0020425674,0.0008282838,0.00254892,0.00077780045,0.00019767592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020359473,0.0005979232,0.00069595076,0.0009099442,0.0009031977,0.0032395443,0.00228415,0.0010164334,0.0017928197],"category_scores_gemma":[0.008147836,0.0007323976,0.0011672482,0.0008139966,0.0014823625,0.0045726704,0.0025887326,0.0024939505,0.0010318535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043722324,0.0005261049,0.013165313,0.0008610397,0.00015389515,0.0009836059,0.0021800378,0.061746337,0.070144676,0.15486832,0.01734919,0.67758423],"study_design_scores_gemma":[0.0001702017,0.000340749,0.0034248482,0.00034466817,0.00018969073,0.0013688775,0.00025045723,0.62686855,0.11145568,0.12564522,0.12976684,0.00017427682],"about_ca_topic_score_codex":0.002758139,"about_ca_topic_score_gemma":0.0022405824,"teacher_disagreement_score":0.0032395443,"about_ca_system_score_codex":0.0011020236,"about_ca_system_score_gemma":0.0019004667,"threshold_uncertainty_score":0.010767221},"labels":[],"label_agreement":null},{"id":"W2165873678","doi":"10.1109/icde.1994.283006","title":"Supporting partial data accesses to replicated data","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Replica; Protocol (science); Data access; Replication (statistics); Distributed computing; Distributed database; Computer network; Database","score_opus":0.1807891740527147,"score_gpt":0.37599040128588357,"score_spread":0.19520122723316888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165873678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25083712,0.0009757678,0.7414043,0.00039051802,0.00008362258,0.00014224857,0.00021776164,0.0026179226,0.0033306617],"genre_scores_gemma":[0.9054612,0.0003237303,0.09113977,0.000083392784,0.000120953264,0.00016467017,0.00038935503,0.00018128497,0.0021355383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803203,0.00069106236,0.00020459095,0.00023097367,0.00063395913,0.00020722106],"domain_scores_gemma":[0.9813415,0.0061495723,0.0011102913,0.009340166,0.0016805542,0.00037791434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025322756,0.00042342395,0.0010009558,0.0004994591,0.0006823042,0.001648385,0.0016285123,0.00063286966,0.001912298],"category_scores_gemma":[0.011142952,0.0004381619,0.00048053212,0.0006576693,0.0010429537,0.004286702,0.0039042928,0.00072263635,0.0005586316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001871449,0.0002611403,0.012202553,0.0012499089,0.00045113466,0.0014032094,0.0024192207,0.1205788,0.23006372,0.08719381,0.0075873747,0.53471774],"study_design_scores_gemma":[0.00024324885,0.0015044737,0.0032946158,0.00011418177,0.00024460693,0.0017030217,0.0005999615,0.71479315,0.15063764,0.07396503,0.0527775,0.00012253842],"about_ca_topic_score_codex":0.0004391835,"about_ca_topic_score_gemma":0.00050347665,"teacher_disagreement_score":0.0025322756,"about_ca_system_score_codex":0.00030170425,"about_ca_system_score_gemma":0.0006490954,"threshold_uncertainty_score":0.013392091},"labels":[],"label_agreement":null},{"id":"W2166252726","doi":"10.1109/hpca.2003.1183538","title":"Dynamic data replication: an approach to providing fault-tolerant shared memory clusters","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Replication (statistics); Distributed shared memory; Latency (audio); Protocol (science); Fault tolerance; Data diffusion machine; Overhead (engineering); Low latency (capital markets); Computer network; Virtual memory; Operating system; Memory management; Overlay; Uniform memory access","score_opus":0.05101440513361539,"score_gpt":0.2949219372126086,"score_spread":0.24390753207899324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166252726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08431542,0.00083123485,0.9084174,0.0006311763,0.00016337248,0.0001893082,0.00004611157,0.0024121585,0.0029937858],"genre_scores_gemma":[0.7376959,0.00048034693,0.2575916,0.0002449392,0.00015075234,0.00024358624,0.00011335172,0.00015674255,0.0033228793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990281,0.00024817674,0.000082334525,0.00014073229,0.00039408493,0.0001066415],"domain_scores_gemma":[0.9976561,0.00031090865,0.00023479921,0.0012351386,0.0003739776,0.00018906273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258804,0.00043717914,0.00056421635,0.0005182926,0.0011591524,0.0015374932,0.003929048,0.00089813955,0.0010002542],"category_scores_gemma":[0.0028684787,0.00041069937,0.00039873255,0.0006602857,0.00087056315,0.0030403188,0.002922912,0.0014462314,0.00027370575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011367035,0.0003769177,0.006185973,0.0010179826,0.00039922108,0.001165848,0.00245065,0.15472333,0.21263854,0.19423372,0.01166188,0.41400918],"study_design_scores_gemma":[0.0002674285,0.0010786803,0.0015817507,0.00009769621,0.00033863357,0.0015530352,0.000687545,0.6765749,0.12373979,0.10076386,0.0931341,0.00018254214],"about_ca_topic_score_codex":0.00071642554,"about_ca_topic_score_gemma":0.0011337412,"teacher_disagreement_score":0.003929048,"about_ca_system_score_codex":0.00075821904,"about_ca_system_score_gemma":0.0010634282,"threshold_uncertainty_score":0.007540822},"labels":[],"label_agreement":null},{"id":"W2166305247","doi":"10.1109/mdm.2006.161","title":"Update-Aware Scheduling Algorithms for Hierarchical Data Dissemination Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Server; Scheduling (production processes); Dissemination; Distributed computing; Computer network; Algorithm; Telecommunications","score_opus":0.030929750254697908,"score_gpt":0.3055772070134957,"score_spread":0.2746474567587978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166305247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041559905,0.0008223679,0.9532257,0.00027066597,0.00007552833,0.00015816711,0.00010515703,0.0016094681,0.0021731218],"genre_scores_gemma":[0.5990856,0.0006415837,0.39626935,0.0001087306,0.00013966054,0.0002602589,0.0003586367,0.00016287161,0.0029732357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00026935086,0.00008277595,0.00014366186,0.00035046585,0.00013636363],"domain_scores_gemma":[0.9975153,0.001279709,0.00033066748,0.0003639129,0.00036421913,0.00014610276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018843594,0.00065635564,0.0008449012,0.00096541183,0.0009411021,0.0011376257,0.0015857024,0.00070106785,0.0015122268],"category_scores_gemma":[0.005926483,0.00043044938,0.0002647071,0.0013701884,0.00062718056,0.0015024194,0.0010963071,0.0009082988,0.00045768355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031719738,0.00013792532,0.001112733,0.00014362783,0.00003695372,0.00006170397,0.00033330818,0.7659042,0.007675222,0.02859044,0.005439138,0.19024754],"study_design_scores_gemma":[0.00003840612,0.000028705415,0.00014388739,0.000004647794,0.0000073227884,0.000016771848,0.000028884075,0.9881714,0.0010843094,0.009245364,0.0012225768,0.000007739572],"about_ca_topic_score_codex":0.005829597,"about_ca_topic_score_gemma":0.005380075,"teacher_disagreement_score":0.005829597,"about_ca_system_score_codex":0.0015461479,"about_ca_system_score_gemma":0.0016385395,"threshold_uncertainty_score":0.011591315},"labels":[],"label_agreement":null},{"id":"W2166416865","doi":"10.1109/icdcs.1994.302398","title":"An efficient method for mutual exclusion in truly distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Computer science; Correctness; Tree (set theory); Distributed algorithm; Overhead (engineering); Distributed computing; Suzuki-Kasami algorithm; Mutual information; Voting; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02318509445989404,"score_gpt":0.2860185086874513,"score_spread":0.2628334142275573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166416865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001430254,0.0001565648,0.99366647,0.00017142101,0.00011396634,0.000098633034,0.000028332235,0.000961664,0.0033727335],"genre_scores_gemma":[0.11563599,0.00043081603,0.864572,0.0003685954,0.00027099633,0.00084430526,0.00023463427,0.0005070402,0.017135562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753594,0.00064513943,0.00014623543,0.00031099783,0.0011904021,0.00017124247],"domain_scores_gemma":[0.9981882,0.0005812415,0.000097710355,0.0006612265,0.0003803213,0.000091353046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598213,0.00064026995,0.0006922636,0.00095786137,0.0013108316,0.0018203806,0.0017237909,0.0011443954,0.006608828],"category_scores_gemma":[0.0048300996,0.00045195056,0.0006527282,0.00087769615,0.0010996216,0.0028220813,0.002733902,0.0015220215,0.002445381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022892533,0.00012257615,0.00040353287,0.00035972754,0.00008040535,0.00038040118,0.00050683244,0.043047264,0.025808208,0.5243621,0.026328057,0.37837186],"study_design_scores_gemma":[0.00027579995,0.00024237597,0.00027820174,0.00009479964,0.00007417868,0.0007800501,0.00010461928,0.45396015,0.023878846,0.2740323,0.24618337,0.00009531746],"about_ca_topic_score_codex":0.0005372165,"about_ca_topic_score_gemma":0.00083810237,"teacher_disagreement_score":0.006608828,"about_ca_system_score_codex":0.000791162,"about_ca_system_score_gemma":0.0013748189,"threshold_uncertainty_score":0.022108674},"labels":[],"label_agreement":null},{"id":"W2166882409","doi":"10.1109/icci.1993.315335","title":"The serializability of transactions in object bases","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Serializability; Computer science; Serialization; Object (grammar); Two-phase locking; Graph; Programming language; Schedule; Database transaction; Distributed computing; Theoretical computer science; Database; Transaction processing; Artificial intelligence; Operating system; Online transaction processing; Distributed transaction","score_opus":0.018166888022466736,"score_gpt":0.22484323820975857,"score_spread":0.20667635018729183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166882409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14982694,0.0013790729,0.82784367,0.0007961236,0.00017419404,0.00013790544,0.00016665536,0.0018378277,0.01783749],"genre_scores_gemma":[0.86738044,0.0015553763,0.11901293,0.00023674115,0.0003757942,0.0002086448,0.00044292514,0.0003336367,0.010453598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976121,0.0005754849,0.00028285745,0.00038897357,0.0009128139,0.00022772669],"domain_scores_gemma":[0.9933861,0.0026584358,0.0008514665,0.0019391812,0.00098136,0.00018351965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024863547,0.00035960547,0.0004594732,0.0013467605,0.0010921671,0.0031895784,0.00090751116,0.00068903767,0.0018772511],"category_scores_gemma":[0.009569699,0.00058463984,0.000510572,0.0016914305,0.0025063048,0.005082708,0.0014375184,0.0013084768,0.00057344144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029679554,0.00012552255,0.0039145006,0.0001541219,0.000037190413,0.000600086,0.0013058176,0.058875423,0.010091386,0.79700464,0.002554858,0.1250396],"study_design_scores_gemma":[0.00008087624,0.00012127572,0.0011043634,0.000051597504,0.000043891792,0.00039706682,0.00021287108,0.17286353,0.009611035,0.79472554,0.020752234,0.000035716013],"about_ca_topic_score_codex":0.0046806806,"about_ca_topic_score_gemma":0.0027824752,"teacher_disagreement_score":0.0046806806,"about_ca_system_score_codex":0.0010686854,"about_ca_system_score_gemma":0.0012007145,"threshold_uncertainty_score":0.013149202},"labels":[],"label_agreement":null},{"id":"W2167003754","doi":"10.1109/32.910857","title":"Design of multi-invariant data structures for robust shared accesses in multiprocessor systems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Invariant (physics); Data structure; Multiprocessing; Fault tolerance; Algorithm; Distributed computing; Parallel computing; Theoretical computer science; Programming language; Mathematics","score_opus":0.07999694562695671,"score_gpt":0.27546634039445494,"score_spread":0.19546939476749825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167003754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028159706,0.00020897253,0.96961963,0.00010070723,0.000027707565,0.00013851379,0.000050309143,0.0011735641,0.000520829],"genre_scores_gemma":[0.3360291,0.00025458404,0.66128904,0.00014757046,0.00004550476,0.0005149794,0.00025142374,0.00034480353,0.0011230157],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978828,0.0004734141,0.00038206336,0.0002586144,0.00079137745,0.00021170087],"domain_scores_gemma":[0.99540895,0.0013425095,0.00086614466,0.0012613784,0.0009872942,0.00013370771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023269288,0.0004814156,0.0006083771,0.00093542185,0.0006983329,0.001426057,0.0021317645,0.000780124,0.00069009216],"category_scores_gemma":[0.004887075,0.0005692692,0.0006673943,0.00090624404,0.0014603151,0.0021756846,0.0013952883,0.0012236638,0.000318461],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006383609,0.00035521312,0.0052999835,0.00097349554,0.0001666809,0.0005349428,0.0011433415,0.26929238,0.15566058,0.26559526,0.005541082,0.29479873],"study_design_scores_gemma":[0.00018239638,0.00055072736,0.0005492224,0.000077789875,0.00011452794,0.00025906798,0.00011486911,0.75563407,0.16391143,0.057963148,0.020572204,0.00007059569],"about_ca_topic_score_codex":0.0007853579,"about_ca_topic_score_gemma":0.0010457804,"teacher_disagreement_score":0.0023269288,"about_ca_system_score_codex":0.00092607905,"about_ca_system_score_gemma":0.0014926055,"threshold_uncertainty_score":0.012306154},"labels":[],"label_agreement":null},{"id":"W2167125021","doi":"","title":"Performance modeling of nested transactions in database systems","year":2000,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Nested transaction; Database transaction; Database; Transaction processing; Concurrency control; Workflow; Online transaction processing; Distributed transaction; Distributed computing; Database tuning; Transaction processing system; Transaction log; Rollback; Distributed database; Serializability; Database design; View","score_opus":0.020307749963602104,"score_gpt":0.22879657471469003,"score_spread":0.20848882475108793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167125021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15996952,0.0018177856,0.8302734,0.00044255296,0.00006977254,0.00016443817,0.00017733165,0.0005967976,0.0064884187],"genre_scores_gemma":[0.9491117,0.00096072844,0.04722615,0.000055040637,0.000065005304,0.00012386093,0.00015628367,0.00007122211,0.002229906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672514,0.0012802657,0.00023213877,0.00039859113,0.0010827846,0.00028100424],"domain_scores_gemma":[0.9939037,0.003712758,0.0006113183,0.00061904354,0.0009255382,0.00022751893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445667,0.00090326346,0.0008954881,0.0006221039,0.00059759675,0.0019530896,0.0020580296,0.0012728063,0.0013249833],"category_scores_gemma":[0.0110996775,0.0005766689,0.00057603524,0.0010404037,0.0010608607,0.003175427,0.00094341283,0.0011783835,0.00045474857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069447255,0.00005552999,0.0010311354,0.000052453845,0.000021546073,0.00009562676,0.00020374419,0.96088624,0.0030108439,0.028011557,0.0002442821,0.0063175545],"study_design_scores_gemma":[0.0000042051024,0.000022133936,0.00009168166,0.0000032619798,0.000004740272,0.000021562519,0.000011252837,0.9933831,0.00033362798,0.005781628,0.00033822382,0.0000046028053],"about_ca_topic_score_codex":0.004164998,"about_ca_topic_score_gemma":0.0013287277,"teacher_disagreement_score":0.004164998,"about_ca_system_score_codex":0.0010658477,"about_ca_system_score_gemma":0.0009784736,"threshold_uncertainty_score":0.012934089},"labels":[],"label_agreement":null},{"id":"W2167196910","doi":"10.1109/ssst.1994.287907","title":"Formal model for verifying compatibility among transactions","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Compatibility (geochemistry); Concurrency; Formal verification; Programming language; Theoretical computer science; Model checking","score_opus":0.05049759296252718,"score_gpt":0.24711697588865644,"score_spread":0.19661938292612927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167196910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025300938,0.000117127885,0.9925795,0.00040095972,0.000056724533,0.000114771094,0.00016392967,0.0007614758,0.0032754824],"genre_scores_gemma":[0.19648503,0.0006458125,0.79189575,0.00054965983,0.0002286004,0.0009266664,0.0012605103,0.00032941916,0.00767842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943553,0.0015820279,0.00061726134,0.0007987327,0.0021884912,0.00045818262],"domain_scores_gemma":[0.9921629,0.0043072025,0.0006976707,0.001578177,0.001017103,0.0002370513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044247448,0.0011696044,0.0008702828,0.0015696005,0.0013136156,0.003997376,0.0036511214,0.0021676198,0.0065041985],"category_scores_gemma":[0.010951176,0.0010250385,0.0023023568,0.00129274,0.0039866697,0.0081344135,0.0026225646,0.0035317573,0.0017217852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114838425,0.00012518499,0.00029106913,0.0002416606,0.00003954391,0.00028548128,0.00033408144,0.063152924,0.004759778,0.90685076,0.0031295118,0.020675108],"study_design_scores_gemma":[0.00018747512,0.00013748242,0.00009509842,0.00010891968,0.000070259804,0.00029954241,0.00011785406,0.31247452,0.0073590437,0.6465636,0.032533288,0.00005286925],"about_ca_topic_score_codex":0.004206498,"about_ca_topic_score_gemma":0.0038064336,"teacher_disagreement_score":0.0065041985,"about_ca_system_score_codex":0.0027085443,"about_ca_system_score_gemma":0.0044095065,"threshold_uncertainty_score":0.023400605},"labels":[],"label_agreement":null},{"id":"W2167610167","doi":"10.1109/infcom.1993.253375","title":"Implementing efficient encoders and decoders for network data representations","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Society for Neuroscience in Anesthesiology and Critical Care","keywords":"Encoding (memory); Computer science; Encoder; Protocol stack; Representation (politics); Decoding methods; External Data Representation; Theoretical computer science; Task (project management); Implementation; Data structure; Stack (abstract data type); Parallel computing; Computer engineering; Algorithm; Programming language; Artificial intelligence; Operating system","score_opus":0.06922984749710497,"score_gpt":0.311690463369868,"score_spread":0.24246061587276302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167610167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022524573,0.00032340406,0.96244454,0.00021664624,0.000113773705,0.00020304785,0.00018535931,0.008850546,0.005137956],"genre_scores_gemma":[0.14935671,0.00052847137,0.84111804,0.00019947108,0.000046505545,0.00022729576,0.000696912,0.000733761,0.007092883],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789053,0.00060388376,0.00034879288,0.00021550401,0.0007593776,0.00018183241],"domain_scores_gemma":[0.9931767,0.0029506432,0.00050006824,0.0018074276,0.0014661389,0.00009895621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028332316,0.00061322196,0.00057317584,0.00096140156,0.0005933433,0.003653601,0.0016154643,0.0010955073,0.0036168261],"category_scores_gemma":[0.012254382,0.0006972323,0.0003508429,0.000876704,0.0006665308,0.0041226917,0.0010190795,0.0013802431,0.0020846156],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009546786,0.00035709594,0.0036741733,0.00065372605,0.00009944764,0.000380323,0.0007933517,0.077602744,0.07165905,0.19223097,0.017674843,0.63391954],"study_design_scores_gemma":[0.00017436947,0.00017894666,0.0005360601,0.00011087732,0.00009255351,0.0005060668,0.00019913999,0.63863915,0.27332467,0.03568385,0.050474178,0.00008009992],"about_ca_topic_score_codex":0.0021019601,"about_ca_topic_score_gemma":0.0029772017,"teacher_disagreement_score":0.003653601,"about_ca_system_score_codex":0.0010882786,"about_ca_system_score_gemma":0.0015396747,"threshold_uncertainty_score":0.014983773},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007423690268378923,"score_gpt":0.22422661015075512,"score_spread":0.2168029198823762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168227861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013180831,0.00023133034,0.948011,0.00021625664,0.00010884847,0.0002824052,0.00012254863,0.03515899,0.0026877653],"genre_scores_gemma":[0.2206701,0.00027763913,0.76697975,0.00037639285,0.00018733663,0.00030148565,0.00094829366,0.0028798638,0.007379102],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595416,0.0008714737,0.00044687395,0.00075078994,0.0016366997,0.00034006205],"domain_scores_gemma":[0.98874646,0.0017211208,0.00073781324,0.006992684,0.0013451611,0.00045678654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063419794,0.0011796689,0.0010007023,0.0010966188,0.0006777601,0.0023067938,0.0051803123,0.00096309395,0.0033304095],"category_scores_gemma":[0.008202712,0.0011089715,0.0011185702,0.0011454026,0.0019751885,0.004466179,0.0043993522,0.0023417482,0.0020208757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016169961,0.00085448025,0.0080193635,0.00082080765,0.00045741716,0.0011676408,0.0016091844,0.058863867,0.14155237,0.087980695,0.041005928,0.6560513],"study_design_scores_gemma":[0.0011049098,0.0017010454,0.0025120818,0.00008757214,0.00023191221,0.0017025532,0.00023457734,0.6624189,0.18537985,0.04738251,0.09689727,0.00034685165],"about_ca_topic_score_codex":0.0029403723,"about_ca_topic_score_gemma":0.0032529936,"teacher_disagreement_score":0.0063419794,"about_ca_system_score_codex":0.0007023642,"about_ca_system_score_gemma":0.0018740114,"threshold_uncertainty_score":0.03354001},"labels":[],"label_agreement":null},{"id":"W2169404216","doi":"10.1109/asap.2010.5540769","title":"A formal specification of fault-tolerance in prospecting asteroid mission with Reactive Autonomie Systems Framework","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Prospecting; Computer science; Fault tolerance; Architecture; Asteroid; Swarm behaviour; Systems engineering; Distributed computing; Engineering; Artificial intelligence; Astrobiology; Geography; Mining engineering","score_opus":0.010337931833078871,"score_gpt":0.2397873048397058,"score_spread":0.22944937300662693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169404216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00839725,0.00024164023,0.98353887,0.0005535521,0.00007906241,0.00008044591,0.00009010511,0.00050001405,0.0065189963],"genre_scores_gemma":[0.5784006,0.0005310109,0.4132265,0.0004355913,0.0001398976,0.0005090439,0.00035666948,0.00016894274,0.0062317573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983047,0.00040388192,0.00019955686,0.00022245623,0.00058671174,0.0002826387],"domain_scores_gemma":[0.9983833,0.0006904349,0.00016916922,0.00024489366,0.0003972663,0.00011497095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025874956,0.00055660354,0.00042351944,0.00086898234,0.000976563,0.0025197996,0.0018958965,0.0013838811,0.0015563589],"category_scores_gemma":[0.00271768,0.00045044892,0.0012042365,0.0006203472,0.0031602085,0.0027796517,0.0017828557,0.0019941118,0.00032409272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016817803,0.000034908004,0.00021475548,0.000079676625,0.000014349515,0.00035619576,0.0006091505,0.018447932,0.0028363785,0.9686198,0.00095763535,0.007812408],"study_design_scores_gemma":[0.00009674172,0.00012462024,0.00033991536,0.00017940883,0.00008712549,0.0007167141,0.0005853165,0.28102008,0.01193425,0.625831,0.07898315,0.00010168783],"about_ca_topic_score_codex":0.0056386725,"about_ca_topic_score_gemma":0.003913896,"teacher_disagreement_score":0.0056386725,"about_ca_system_score_codex":0.0015422902,"about_ca_system_score_gemma":0.0018939556,"threshold_uncertainty_score":0.013684154},"labels":[],"label_agreement":null},{"id":"W2170398686","doi":"10.1109/tpds.2010.162","title":"Consensus and Mutual Exclusion in a Multiple Access Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Mutual exclusion; Collision detection; Channel (broadcasting); Collision; Logarithm; Time complexity; Process (computing); Collision problem; Critical section; Mutual information; Algorithm; Theoretical computer science; Distributed computing; Computer network; Mathematics; Artificial intelligence; Computer security","score_opus":0.025493967799435698,"score_gpt":0.2571901699211026,"score_spread":0.23169620212166692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170398686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16176859,0.00047465655,0.824471,0.0017276542,0.000085857246,0.00024907145,0.00029624096,0.0004874574,0.010439567],"genre_scores_gemma":[0.8497061,0.00035687588,0.14178951,0.00016606935,0.00017041256,0.00060049334,0.00033141603,0.00014155358,0.0067376695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99191356,0.0030959493,0.00028632738,0.0014210583,0.001740624,0.0015426398],"domain_scores_gemma":[0.93709916,0.054613937,0.0025630114,0.002878308,0.0017718998,0.0010737568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005021624,0.0013200401,0.0017096497,0.0011578536,0.0018487392,0.0032855195,0.001746003,0.0021659445,0.0039481474],"category_scores_gemma":[0.026782155,0.00075159885,0.0012745466,0.0017050536,0.0039021054,0.0063284333,0.0033537485,0.0027563192,0.00051069364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692307,0.00016151024,0.0012133821,0.00018206703,0.0000784768,0.00024729752,0.00038133364,0.77561945,0.002291971,0.20621563,0.0010999509,0.011839754],"study_design_scores_gemma":[0.00007755041,0.000050741462,0.00012800469,0.000007116388,0.000015113818,0.000033466302,0.000041437837,0.8949542,0.0007948352,0.10332037,0.0005619102,0.000015261629],"about_ca_topic_score_codex":0.0035005282,"about_ca_topic_score_gemma":0.0020492969,"teacher_disagreement_score":0.005021624,"about_ca_system_score_codex":0.0027893004,"about_ca_system_score_gemma":0.003409255,"threshold_uncertainty_score":0.026557148},"labels":[],"label_agreement":null},{"id":"W2170628061","doi":"10.1109/ease.2008.14","title":"A Self-Scheduling Model for NASA Swarm-Based Exploration Missions Using ASSL","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Swarm behaviour; Computer science; Scheduling (production processes); Distributed computing; Fault tolerance; Real-time computing; Artificial intelligence; Engineering","score_opus":0.10779798637003433,"score_gpt":0.29917619026542247,"score_spread":0.19137820389538812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170628061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022310626,0.00013869049,0.96931714,0.00035140198,0.00004859481,0.0001101777,0.00019964536,0.0006094704,0.0069142454],"genre_scores_gemma":[0.59769285,0.00044984833,0.387443,0.00026554,0.0000995084,0.0006783816,0.0006858809,0.0002813325,0.012403633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.00018654253,0.00007372107,0.000090910355,0.0002074428,0.00007459897],"domain_scores_gemma":[0.9991949,0.00029775218,0.00013371863,0.00015493699,0.0001549964,0.00006362186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126969,0.00044302057,0.00037181372,0.00045436097,0.00052527984,0.0014387257,0.0013471447,0.000746099,0.0024449052],"category_scores_gemma":[0.0014467632,0.0003009711,0.0008811942,0.00038466358,0.0010593745,0.0017231421,0.0008654419,0.0010607091,0.00062792795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009295252,0.00009233001,0.0007685818,0.00012135416,0.000025448571,0.00038690236,0.0005877144,0.49779916,0.006115977,0.48113006,0.0014593621,0.011420071],"study_design_scores_gemma":[0.00004272064,0.000056116405,0.0001211234,0.00002044819,0.000014544187,0.00006209969,0.00007136814,0.91867775,0.0013473236,0.06800645,0.011566866,0.000013289545],"about_ca_topic_score_codex":0.0052859806,"about_ca_topic_score_gemma":0.0056637446,"teacher_disagreement_score":0.0052859806,"about_ca_system_score_codex":0.0011987162,"about_ca_system_score_gemma":0.0015593881,"threshold_uncertainty_score":0.010510445},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013292408403417446,"score_gpt":0.24002469651804678,"score_spread":0.22673228811462934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170907411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03674121,0.0013053957,0.9505054,0.0007203692,0.00013144533,0.00015704514,0.00017673335,0.0047127185,0.00554967],"genre_scores_gemma":[0.72382814,0.00091151666,0.26535878,0.0003221224,0.00045745785,0.0003064847,0.00046639034,0.0005427028,0.0078064245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99308103,0.0014332852,0.0006562468,0.0007601841,0.0034835609,0.00058572774],"domain_scores_gemma":[0.9689627,0.006682377,0.002531458,0.016861707,0.0040903166,0.0008713772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052201776,0.0007030603,0.0011626435,0.0009843947,0.001628938,0.0033930521,0.0033079172,0.0013565264,0.0028986712],"category_scores_gemma":[0.026439225,0.0009225401,0.0006181691,0.0020269407,0.002032506,0.0069629815,0.0044644554,0.002431202,0.001519423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011078166,0.00031318842,0.004906214,0.0006555883,0.00016000347,0.0007624455,0.0011322139,0.20714037,0.028490998,0.48362258,0.021358382,0.25035024],"study_design_scores_gemma":[0.00038986094,0.0003066522,0.0007185728,0.00006937332,0.00014266498,0.0005885667,0.00015659885,0.54744744,0.01681919,0.4028128,0.03045421,0.00009398795],"about_ca_topic_score_codex":0.0017900383,"about_ca_topic_score_gemma":0.0020129536,"teacher_disagreement_score":0.0052201776,"about_ca_system_score_codex":0.001231247,"about_ca_system_score_gemma":0.0028145781,"threshold_uncertainty_score":0.027607262},"labels":[],"label_agreement":null},{"id":"W2171359430","doi":"10.1007/978-3-540-39964-3_95","title":"Porting OMTTs to CORBA","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Common Object Request Broker Architecture; Distributed transaction; Transaction processing; Thread (computing); Nested transaction; Online transaction processing; Transaction processing system; Operating system; Database transaction; Distributed computing; Distributed object; Programmer; Compensating transaction; Programming language","score_opus":0.016387851111540046,"score_gpt":0.2478705031778207,"score_spread":0.23148265206628066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171359430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021743642,0.00024315185,0.7336836,0.00076086045,0.0010082609,0.00035575428,0.0007479319,0.17005359,0.07140321],"genre_scores_gemma":[0.26592958,0.0008211825,0.49349606,0.0017304894,0.0005226722,0.00046801416,0.0056421743,0.07169723,0.1596926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902046,0.00014522523,0.000069898604,0.0001048637,0.00045599265,0.00020357207],"domain_scores_gemma":[0.9976548,0.00031697477,0.0000683676,0.0014316543,0.0003972112,0.00013088109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888462,0.0007904747,0.0005117818,0.00095346273,0.00089387863,0.002419104,0.0017115372,0.0008495095,0.029381158],"category_scores_gemma":[0.0042780885,0.0008367458,0.001066987,0.0009776787,0.00069115346,0.0029493847,0.0029090522,0.0023092006,0.010450317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007750403,0.00068341126,0.0030143985,0.00064041547,0.00014152568,0.0007289424,0.0015796141,0.008982762,0.070948295,0.09228049,0.13416544,0.68605965],"study_design_scores_gemma":[0.00020504178,0.000160288,0.0017076267,0.00024061621,0.00012574265,0.0006205207,0.00028300975,0.070859,0.08116731,0.086662725,0.7578377,0.00013044068],"about_ca_topic_score_codex":0.004804836,"about_ca_topic_score_gemma":0.0045929328,"teacher_disagreement_score":0.029381158,"about_ca_system_score_codex":0.0007396783,"about_ca_system_score_gemma":0.0010166009,"threshold_uncertainty_score":0.09828979},"labels":[],"label_agreement":null},{"id":"W2171495836","doi":"10.1109/ideas.1997.625676","title":"A formal specification strategy for electronic commerce","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Correctness; Transaction processing; Dependability; Synchronization (alternating current); Deadlock; Database transaction; Distributed transaction; Programmer; Rollback; Distributed computing; Formal specification; Compensating transaction; Formal methods; Database; Software engineering; Programming language; Computer network","score_opus":0.045268561186980756,"score_gpt":0.25918889643217896,"score_spread":0.2139203352451982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171495836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019525997,0.0009968729,0.94830227,0.0024014625,0.00023407242,0.00022346851,0.00021746902,0.0006013068,0.045070432],"genre_scores_gemma":[0.13723487,0.0021204352,0.8206272,0.0017282802,0.00039022724,0.0012426465,0.0012108186,0.00046974354,0.03497574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765295,0.0009975486,0.00029663596,0.00028758755,0.00056971837,0.00019561875],"domain_scores_gemma":[0.99769163,0.0012200887,0.00015373804,0.00035764652,0.00046370464,0.00011309832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043355487,0.0013353048,0.00056173216,0.0017866045,0.0021460087,0.0054622837,0.002649524,0.0021103977,0.013056595],"category_scores_gemma":[0.00576996,0.0010305513,0.001961204,0.0017702769,0.0052179443,0.007792587,0.0030616333,0.0034220014,0.0048264363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047176222,0.0000120983805,0.000029750137,0.000032276042,0.000002842016,0.00006808148,0.00023998298,0.0009890975,0.00027168772,0.9898413,0.0017846229,0.0067234035],"study_design_scores_gemma":[0.000028720573,0.000031400035,0.000048537368,0.00010673247,0.000015453154,0.00023450721,0.00028733138,0.014767417,0.0009039201,0.8392259,0.14432852,0.00002159297],"about_ca_topic_score_codex":0.00459527,"about_ca_topic_score_gemma":0.0035521395,"teacher_disagreement_score":0.013056595,"about_ca_system_score_codex":0.0030955076,"about_ca_system_score_gemma":0.0027749345,"threshold_uncertainty_score":0.0436787},"labels":[],"label_agreement":null},{"id":"W2171587977","doi":"10.1109/sfcs.1995.492673","title":"Faster approximate agreement with multi-writer registers","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Agreement; Asynchronous communication; Matching (statistics); Upper and lower bounds; Computational complexity theory; Arithmetic; Algorithm; Parallel computing; Theoretical computer science; Mathematics; Telecommunications; Statistics","score_opus":0.03450754894609512,"score_gpt":0.2246097772111796,"score_spread":0.1901022282650845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171587977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3717917,0.00046633038,0.61998993,0.0009706405,0.00009486653,0.000093117655,0.00013018584,0.000952516,0.0055107186],"genre_scores_gemma":[0.95134455,0.00011232305,0.045170147,0.000080263635,0.000045415694,0.000092091184,0.00009240288,0.00008703408,0.0029756885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966916,0.0009531034,0.00017745016,0.0006674612,0.0008782573,0.0006320016],"domain_scores_gemma":[0.9805782,0.013943559,0.0012100828,0.0030198744,0.00077338645,0.00047493234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032897885,0.00061463244,0.0016750338,0.0003418993,0.0010201387,0.002535654,0.002448733,0.001498996,0.0058998717],"category_scores_gemma":[0.015781546,0.0004841056,0.00086183345,0.0008869362,0.0014364935,0.008415285,0.0027485278,0.0024323494,0.000633933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003017005,0.00031367628,0.0028604148,0.00039477996,0.00012898527,0.00050887576,0.0007709158,0.7033733,0.025054246,0.21011342,0.002139973,0.051324464],"study_design_scores_gemma":[0.000113520444,0.000106623476,0.00015456708,0.000006366193,0.000023042061,0.000054978365,0.000057547313,0.91577643,0.0065188045,0.07657297,0.00060011813,0.000014989523],"about_ca_topic_score_codex":0.0013928781,"about_ca_topic_score_gemma":0.001125601,"teacher_disagreement_score":0.0058998717,"about_ca_system_score_codex":0.0011583726,"about_ca_system_score_gemma":0.001153598,"threshold_uncertainty_score":0.019737065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Multi-core processor; Serialization; Operating system; Parallel computing; Database","score_opus":0.04511224232357768,"score_gpt":0.24973414704582975,"score_spread":0.20462190472225206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172197636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782657,0.0020333386,0.010683595,0.00053340447,0.00019588899,0.00004194151,0.00033310356,0.0031599207,0.0047529903],"genre_scores_gemma":[0.9958111,0.00017137779,0.0026296454,0.000049393624,0.000035104244,0.000015511181,0.00018738545,0.00006505865,0.0010355515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99716705,0.0004607956,0.0001768786,0.00046451617,0.0010124436,0.0007183834],"domain_scores_gemma":[0.98764265,0.006438448,0.0007625024,0.0024347843,0.0019053535,0.00081638445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332588,0.0008444802,0.00080024905,0.0012364108,0.00090476905,0.001653621,0.0015956592,0.0006628449,0.004637957],"category_scores_gemma":[0.010958115,0.0004839129,0.00025800272,0.0013305531,0.0010332976,0.0042171995,0.001343323,0.0011599312,0.0003651628],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012938208,0.0022687325,0.046393827,0.0012144543,0.0003599546,0.0008254221,0.0010993382,0.44677347,0.15581764,0.012377153,0.02336645,0.29656532],"study_design_scores_gemma":[0.00034425332,0.0009536664,0.010788786,0.000059011796,0.00016741014,0.0002547102,0.00062833703,0.9268247,0.052782375,0.0055147046,0.001599621,0.00008241854],"about_ca_topic_score_codex":0.0048701228,"about_ca_topic_score_gemma":0.006298512,"teacher_disagreement_score":0.0048701228,"about_ca_system_score_codex":0.0012520106,"about_ca_system_score_gemma":0.0020168044,"threshold_uncertainty_score":0.015515506},"labels":[],"label_agreement":null},{"id":"W2172295952","doi":"10.1109/infcom.1993.253293","title":"Concurrency model and its application to formal protocol specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Concurrency; Computer science; Programming language; Isolation (microbiology); Concurrent computing; Non-lock concurrency control; Protocol (science); Theoretical computer science; Concurrent object-oriented programming; Concurrency control; Distributed computing; Distributed concurrency control; Programming paradigm; Declarative programming","score_opus":0.06003496467427902,"score_gpt":0.284973260544775,"score_spread":0.224938295870496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172295952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077379885,0.00025390973,0.99512,0.0003424581,0.000053765532,0.00009209148,0.00006532382,0.00047220834,0.0028263803],"genre_scores_gemma":[0.08210776,0.0018071245,0.90770376,0.00039995406,0.0002063552,0.0012107459,0.0007351537,0.00052865583,0.005300431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99161184,0.0032212911,0.0010282255,0.00081457716,0.002988038,0.00033603443],"domain_scores_gemma":[0.9861624,0.009132168,0.000862383,0.0017667279,0.0017749235,0.000301361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007925518,0.0015739962,0.0010653589,0.0034436975,0.0023703577,0.0056387554,0.0030617993,0.0022305683,0.005612117],"category_scores_gemma":[0.029058294,0.0016484045,0.0024503528,0.0036930933,0.0055795363,0.008907296,0.004065594,0.004917543,0.0017152588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015699245,0.000020234505,0.00019338941,0.00013271105,0.000020045203,0.0002134339,0.0006371668,0.023737282,0.00063622324,0.94897354,0.0019517209,0.023468532],"study_design_scores_gemma":[0.000027073384,0.00002803569,0.000052097894,0.0001465758,0.00002824114,0.00026008065,0.00014535637,0.11435146,0.0012992474,0.85186505,0.03176191,0.000034853605],"about_ca_topic_score_codex":0.0074468707,"about_ca_topic_score_gemma":0.004020893,"teacher_disagreement_score":0.007925518,"about_ca_system_score_codex":0.0038395098,"about_ca_system_score_gemma":0.004515454,"threshold_uncertainty_score":0.0419147},"labels":[],"label_agreement":null},{"id":"W2181392738","doi":"","title":"Kilo TM Correctness: ABA Tolerance and Validation-Commit Indivisibility","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Commit; Correctness; Computer science; Transactional memory; Database transaction; Value (mathematics); Parallel computing; Algorithm; Database; Machine learning","score_opus":0.015408949313206475,"score_gpt":0.2484148653236343,"score_spread":0.23300591601042783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181392738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1269109,0.0011840397,0.83837026,0.0021260958,0.0005228564,0.00036896096,0.00032795357,0.016706802,0.01348221],"genre_scores_gemma":[0.79821,0.00027275135,0.1940555,0.00079705287,0.00027028186,0.00025399277,0.00042940426,0.0014358627,0.004275159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99217916,0.0013873517,0.00075829047,0.00088692503,0.0036612083,0.0011270155],"domain_scores_gemma":[0.96622837,0.0074812155,0.004017538,0.015739607,0.005644431,0.0008889358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042298096,0.0009425127,0.0011601665,0.0013652588,0.0013812141,0.0031592113,0.004097831,0.0018953038,0.003054632],"category_scores_gemma":[0.028201494,0.00091945345,0.000739047,0.0013468971,0.0041787857,0.0055711586,0.006058349,0.0036186874,0.00096220843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043377345,0.00079580554,0.044768315,0.0013905406,0.00019912468,0.0018809404,0.002383839,0.09227318,0.07029249,0.30416527,0.030944578,0.44656813],"study_design_scores_gemma":[0.0005572382,0.0011568653,0.0045760097,0.0002364384,0.00028535043,0.0022252274,0.0005950714,0.6492039,0.13726564,0.17184334,0.03184812,0.0002068163],"about_ca_topic_score_codex":0.0019027739,"about_ca_topic_score_gemma":0.0015151362,"teacher_disagreement_score":0.0042298096,"about_ca_system_score_codex":0.0014197201,"about_ca_system_score_gemma":0.0037404897,"threshold_uncertainty_score":0.022369683},"labels":[],"label_agreement":null},{"id":"W2185434560","doi":"","title":"Relaxing concurrency control in transactional memory","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Software transactional memory; Transactional memory; Concurrency control; Optimistic concurrency control; Multiversion concurrency control; Distributed computing; Commit; Two-phase locking; Parallel computing; Non-lock concurrency control; Concurrency; Distributed concurrency control; Operating system; Database transaction; Programming language; Transaction processing; Distributed transaction; Database","score_opus":0.010976162444534627,"score_gpt":0.23282419790401912,"score_spread":0.2218480354594845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185434560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075389795,0.0014119796,0.91723573,0.00046044128,0.00011532416,0.0001451379,0.00002347629,0.0010730255,0.0041450155],"genre_scores_gemma":[0.6906273,0.0010797633,0.3040763,0.00023847198,0.0001483434,0.00029276617,0.000098527424,0.00024395729,0.0031946322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944437,0.0016310707,0.0004149219,0.00056947855,0.0024241554,0.00051669683],"domain_scores_gemma":[0.9911198,0.0043781055,0.0005111631,0.002674454,0.0011098335,0.00020677579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038322613,0.0006838448,0.00077170716,0.0006117684,0.0007915146,0.0023886587,0.0026251476,0.00076088234,0.001360494],"category_scores_gemma":[0.013547378,0.0006932691,0.0007527023,0.0010546095,0.002242419,0.0045903325,0.0024664057,0.003004757,0.00034146916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007741654,0.00053764414,0.004572074,0.0006757518,0.00014089298,0.00038805907,0.0016545079,0.31090495,0.08288426,0.26583093,0.0024190766,0.3292176],"study_design_scores_gemma":[0.0003004591,0.00037341102,0.0005704687,0.000075025644,0.0001004658,0.00024495035,0.00013675784,0.80708003,0.050458174,0.12818445,0.012410764,0.00006516824],"about_ca_topic_score_codex":0.0014869559,"about_ca_topic_score_gemma":0.0012889752,"teacher_disagreement_score":0.0038322613,"about_ca_system_score_codex":0.0008973813,"about_ca_system_score_gemma":0.0017036208,"threshold_uncertainty_score":0.020267189},"labels":[],"label_agreement":null},{"id":"W2196446647","doi":"10.1007/978-3-642-00955-6_20","title":"Adaptive Read Validation in Time-Based Software Transactional Memory","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Software; Programming language; Database transaction","score_opus":0.01510676393870801,"score_gpt":0.2296993702201134,"score_spread":0.21459260628140542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196446647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16490424,0.0018683661,0.8225173,0.00029073795,0.0002802342,0.00010921217,0.00008399493,0.0050509092,0.004894898],"genre_scores_gemma":[0.90649766,0.0003140937,0.08638278,0.00012890859,0.00007015352,0.000082685336,0.00011656097,0.0004952247,0.0059120334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969151,0.0009265452,0.00025585917,0.00044467274,0.0011328065,0.00032503804],"domain_scores_gemma":[0.9858466,0.007528603,0.00083700777,0.0040978077,0.0014919427,0.00019802338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031275144,0.0005645746,0.0008900626,0.00061571476,0.0007252535,0.0018230052,0.0031138787,0.00142964,0.0027819208],"category_scores_gemma":[0.013086147,0.0007064611,0.0004790524,0.0006989677,0.0013700221,0.003351914,0.001596812,0.0016859551,0.00049124047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032331655,0.00045468519,0.0066224225,0.00058840855,0.00014387458,0.0008210256,0.0013297121,0.22689173,0.090287544,0.09959928,0.0052600633,0.5647681],"study_design_scores_gemma":[0.00007696687,0.00030770604,0.0007362916,0.000062420564,0.00007709013,0.00032079563,0.00011720275,0.8881759,0.06019001,0.045779068,0.0041042008,0.00005234223],"about_ca_topic_score_codex":0.00089669577,"about_ca_topic_score_gemma":0.001058159,"teacher_disagreement_score":0.0031275144,"about_ca_system_score_codex":0.0006849643,"about_ca_system_score_gemma":0.0010394754,"threshold_uncertainty_score":0.01654005},"labels":[],"label_agreement":null},{"id":"W2208409578","doi":"10.1002/9780470396360.oth1","title":"Wiley Series on Parallel and Distributed Computing","year":2008,"lang":"en","type":"other","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Library science; Citation; Computer science; Series (stratigraphy); Management","score_opus":0.011522316572408747,"score_gpt":0.22403684162693407,"score_spread":0.21251452505452534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208409578","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017851077,0.048722588,0.28182304,0.0046005044,0.03401822,0.00032500314,0.0040094163,0.01328901,0.6114272],"genre_scores_gemma":[0.0058941143,0.028008085,0.052574556,0.0009800692,0.0038534463,0.00025665396,0.0025707644,0.0036027785,0.9022594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990602,0.00008721306,0.000084750645,0.00016259767,0.0005533107,0.00005181849],"domain_scores_gemma":[0.9972452,0.000714473,0.00017259695,0.0007439127,0.00085555227,0.00026821153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084673223,0.0021389134,0.0026150744,0.0025590772,0.0006568447,0.0030083004,0.0017151061,0.0012433656,0.16191985],"category_scores_gemma":[0.003760062,0.00078221277,0.000594455,0.0043313312,0.0007524044,0.0033581962,0.0018950694,0.002627552,0.16234532],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003459482,0.000033769105,0.000088919194,0.00067119894,0.000021621856,0.00006305465,0.000038129067,0.0016086844,0.0010460764,0.01593194,0.43536648,0.54509556],"study_design_scores_gemma":[0.000009444052,0.00002012947,0.00019402467,0.0002772953,0.00002155511,0.00023995299,0.000021085043,0.004254691,0.0006522129,0.016199639,0.9780919,0.000018065324],"about_ca_topic_score_codex":0.0017333481,"about_ca_topic_score_gemma":0.0037216365,"teacher_disagreement_score":0.83808017,"about_ca_system_score_codex":0.000790636,"about_ca_system_score_gemma":0.0016061364,"threshold_uncertainty_score":0.54167587},"labels":[],"label_agreement":null},{"id":"W2211949657","doi":"","title":"Otherworld: giving applications a chance to survive OS kernel crashes","year":2008,"lang":"en","type":"article","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reboot; Operating system; Computer science; Kernel (algebra); Overhead (engineering); Mechanism (biology); Linux kernel; System call; Embedded system; Commodity; Database","score_opus":0.025202014101281242,"score_gpt":0.3009403532743157,"score_spread":0.2757383391730344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211949657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27043247,0.0045968713,0.565488,0.009981087,0.0032210944,0.0009015188,0.00065718306,0.062254425,0.08246739],"genre_scores_gemma":[0.8316974,0.0011686288,0.07985183,0.0039704046,0.0010642902,0.0005342024,0.0007575792,0.0054382244,0.07551733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973199,0.0005528417,0.00020631861,0.00058796117,0.000848977,0.0004840502],"domain_scores_gemma":[0.9840015,0.0023978243,0.0019863548,0.007899296,0.0017398971,0.0019749743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029465032,0.001462479,0.0011300461,0.0016702374,0.002922687,0.004393258,0.0046993783,0.0029257052,0.017928919],"category_scores_gemma":[0.014281115,0.00074100646,0.0008229359,0.0006932492,0.0019898915,0.011504986,0.0089457715,0.0031822976,0.00474395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029320111,0.0019268729,0.03152101,0.0012036026,0.00069175905,0.00253163,0.0042605503,0.011953254,0.07203764,0.14538659,0.08265124,0.64290386],"study_design_scores_gemma":[0.00060009124,0.003460906,0.019186568,0.0004898035,0.001009125,0.0048934645,0.0022127395,0.11166511,0.12949435,0.130399,0.5956261,0.0009625856],"about_ca_topic_score_codex":0.0006926153,"about_ca_topic_score_gemma":0.00083657925,"teacher_disagreement_score":0.017928919,"about_ca_system_score_codex":0.00051014754,"about_ca_system_score_gemma":0.0013273851,"threshold_uncertainty_score":0.059978247},"labels":[],"label_agreement":null},{"id":"W2219929968","doi":"10.1109/bigdata.2015.7363942","title":"Fine-tuning the consistency-latency trade-off in quorum-replicated distributed storage systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eventual consistency; Computer science; Cache coherence; Weak consistency; Consistency (knowledge bases); NoSQL; Latency (audio); Strong consistency; Distributed computing; Scalability; Consistency model; Causal consistency; Data consistency; High availability; Storage management; Sequential consistency; Computer network; Database; Cache; CPU cache; Cache algorithms","score_opus":0.03138961219308502,"score_gpt":0.24977117186806605,"score_spread":0.21838155967498102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219929968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7586417,0.000995715,0.23654039,0.0005155467,0.000091818045,0.00015221476,0.000049523995,0.0009964741,0.0020166144],"genre_scores_gemma":[0.9789601,0.000065126274,0.020661639,0.000038865724,0.000014410632,0.000028395505,0.000010935255,0.000027312482,0.00019341102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956644,0.0017125977,0.0003837535,0.00056207785,0.0011928292,0.00048437854],"domain_scores_gemma":[0.979955,0.013014715,0.0018172762,0.0033937593,0.0012712715,0.0005480413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006662661,0.0005535859,0.00072215166,0.00073987007,0.0010322891,0.0015782049,0.0017930281,0.0010413765,0.00057621533],"category_scores_gemma":[0.019305328,0.0004851209,0.0002967157,0.0008556418,0.0013282374,0.0022777522,0.0015680969,0.00090008514,0.00012560228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015241799,0.000920162,0.0127347745,0.0003543385,0.0001405401,0.00030868954,0.00060951785,0.74687505,0.12324529,0.017113585,0.0009960042,0.095177844],"study_design_scores_gemma":[0.00018520169,0.000597371,0.0023125212,0.000022781596,0.00005573404,0.00017646991,0.000204631,0.9450351,0.038887016,0.011360997,0.0010973784,0.00006470184],"about_ca_topic_score_codex":0.0014735796,"about_ca_topic_score_gemma":0.0018255103,"teacher_disagreement_score":0.006662661,"about_ca_system_score_codex":0.0011935299,"about_ca_system_score_gemma":0.0012035203,"threshold_uncertainty_score":0.03523594},"labels":[],"label_agreement":null},{"id":"W2235750182","doi":"10.1007/978-3-662-48653-5_5","title":"Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Implementation; Computer science; Impossibility; Lock (firearm); Degrees of freedom (physics and chemistry); Theoretical computer science; Algorithm; Programming language","score_opus":0.031070026635925962,"score_gpt":0.2636655829254658,"score_spread":0.23259555628953987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235750182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13850436,0.001187844,0.8246378,0.00889481,0.00028379378,0.0001613623,0.00022961477,0.0014778046,0.024622591],"genre_scores_gemma":[0.92424375,0.0006977502,0.05696729,0.001656925,0.0005210398,0.00051269523,0.0002596442,0.00041890886,0.014722022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99156004,0.0019916839,0.0007163346,0.0024483134,0.0021332758,0.0011502794],"domain_scores_gemma":[0.9460453,0.040678117,0.0025733823,0.008018746,0.0018972625,0.00078729616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063241376,0.0007696754,0.0012804039,0.0005603328,0.0020226894,0.0042614024,0.001979778,0.0027220608,0.0059018238],"category_scores_gemma":[0.025624875,0.0010423602,0.0016497807,0.0010300546,0.008836344,0.014787686,0.0052146786,0.010826922,0.0010277001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033773005,0.0001058618,0.0015605044,0.000278893,0.000058595677,0.00026655517,0.0009649446,0.01611326,0.004748688,0.9392972,0.0027273104,0.03354033],"study_design_scores_gemma":[0.000058444493,0.00006615074,0.00023823928,0.000034646408,0.000023601327,0.00012940078,0.000096826356,0.026645822,0.0039606215,0.9656274,0.0030923446,0.00002643561],"about_ca_topic_score_codex":0.0005037493,"about_ca_topic_score_gemma":0.0003361835,"teacher_disagreement_score":0.0063241376,"about_ca_system_score_codex":0.0014568979,"about_ca_system_score_gemma":0.0017381939,"threshold_uncertainty_score":0.033445656},"labels":[],"label_agreement":null},{"id":"W2242648545","doi":"","title":"The Bionic DBMS is Coming, but What Will It Look Like?","year":2013,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dataflow; Software; Key (lock); Cloud computing; Database transaction; Cloud database; Database; Embedded system; Commodity; Operating system; Computer hardware","score_opus":0.009700825267061591,"score_gpt":0.23745584953517815,"score_spread":0.22775502426811656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242648545","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041083493,0.0530227,0.049752712,0.81894135,0.021229051,0.00007026788,0.001045051,0.002871844,0.048958562],"genre_scores_gemma":[0.16701332,0.11887112,0.26925623,0.27985284,0.04366509,0.00030329375,0.003938586,0.0026448995,0.11445465],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967539,0.00085528736,0.00019173686,0.00042841377,0.0014371573,0.00033344477],"domain_scores_gemma":[0.99290776,0.0012424022,0.00030064673,0.00095387147,0.0025474115,0.0020479364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006489145,0.0006823995,0.0006009165,0.0014084538,0.003016978,0.0128949005,0.0022319101,0.005209089,0.018037016],"category_scores_gemma":[0.011378475,0.0005623257,0.000534868,0.0026339716,0.0051015583,0.030429946,0.0030460593,0.007307197,0.011365914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013853346,0.00008332631,0.0030431456,0.0005318036,0.000026600095,0.00014619691,0.0008283918,0.00042970479,0.0019311459,0.3245877,0.42748195,0.24077146],"study_design_scores_gemma":[0.00001705533,0.000055578497,0.0006794314,0.0003602713,0.000011319758,0.00035571185,0.00087072485,0.0008004586,0.00053186255,0.06420158,0.9320795,0.000036556907],"about_ca_topic_score_codex":0.004513926,"about_ca_topic_score_gemma":0.0032214231,"teacher_disagreement_score":0.018037016,"about_ca_system_score_codex":0.0032970996,"about_ca_system_score_gemma":0.0034303784,"threshold_uncertainty_score":0.060339868},"labels":[],"label_agreement":null},{"id":"W2243405571","doi":"10.1007/978-3-319-09581-3_5","title":"Linearizability Is Not Always a Safety Property","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Linearizability; Property (philosophy); Computer science; Consistency (knowledge bases); Counterexample; Object (grammar); Zeno's paradoxes; Lemma (botany); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.017653175369976837,"score_gpt":0.23456399840075864,"score_spread":0.2169108230307818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243405571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14460684,0.0030021353,0.49206904,0.012558281,0.0016008975,0.0001106506,0.000673985,0.0034891649,0.34188905],"genre_scores_gemma":[0.87857586,0.001138773,0.035949524,0.002179918,0.0009864061,0.00023750971,0.0005687727,0.0006854022,0.07967785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00014566723,0.00007623262,0.00037175446,0.00023612715,0.00017962563],"domain_scores_gemma":[0.99305564,0.0042786407,0.0005055911,0.0013048284,0.0006822258,0.0001730729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092348014,0.00050380407,0.00059644674,0.0004907416,0.001157202,0.0020106484,0.00086298265,0.0010970127,0.014209602],"category_scores_gemma":[0.0040154904,0.00057225797,0.0007208844,0.0006010609,0.0029836968,0.007719651,0.001711287,0.0032333436,0.0030071195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016852592,0.000079870566,0.0010508741,0.00042632403,0.000046881356,0.00028390152,0.0007127597,0.0025266248,0.009347295,0.91324395,0.014545886,0.057567023],"study_design_scores_gemma":[0.000026289554,0.000059654958,0.0004259044,0.000047413938,0.000026501457,0.00026560624,0.00013829603,0.0025398682,0.0059069144,0.9742396,0.016305586,0.00001842959],"about_ca_topic_score_codex":0.00029460806,"about_ca_topic_score_gemma":0.00043757295,"teacher_disagreement_score":0.014209602,"about_ca_system_score_codex":0.00054164854,"about_ca_system_score_gemma":0.0005664833,"threshold_uncertainty_score":0.047535837},"labels":[],"label_agreement":null},{"id":"W2244331736","doi":"10.14778/2536222.2536255","title":"Toward scalable transaction processing","year":2013,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Transaction processing system; Computer science; Transaction processing; Multi-core processor; Online transaction processing; Database transaction; Metadata; Distributed transaction; Distributed computing; Computer architecture; Embedded system; Parallel computing; Database; Operating system","score_opus":0.01483689700489075,"score_gpt":0.2104329737351254,"score_spread":0.19559607673023466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244331736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01074348,0.0036297583,0.9588871,0.00521125,0.0005586085,0.0002977423,0.00021501975,0.0030005511,0.017456502],"genre_scores_gemma":[0.12737776,0.006498398,0.8501528,0.0016642363,0.0009137875,0.00067965814,0.0008535467,0.0006350478,0.011224745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436486,0.0012025201,0.00046591825,0.00066755206,0.0029231647,0.00037599722],"domain_scores_gemma":[0.9927188,0.0018639703,0.00035052473,0.002506778,0.0021598826,0.00040007746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049786353,0.0009217291,0.00094027305,0.0009550798,0.0011199004,0.0038397487,0.0030370827,0.0016072791,0.0062481333],"category_scores_gemma":[0.012218521,0.0011501263,0.00093935785,0.0020351675,0.0019548296,0.008660661,0.0052340277,0.005538691,0.0040599005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031328402,0.00026079928,0.0013828956,0.0012893551,0.00013486043,0.00041824876,0.0010695497,0.047050286,0.044034313,0.58186036,0.047488455,0.27469754],"study_design_scores_gemma":[0.00013505053,0.00023585443,0.00037981407,0.00027781364,0.00006550059,0.00041153003,0.00048488355,0.34961578,0.01956812,0.47206983,0.15669373,0.00006217122],"about_ca_topic_score_codex":0.0011070521,"about_ca_topic_score_gemma":0.0011121691,"teacher_disagreement_score":0.0062481333,"about_ca_system_score_codex":0.0014403234,"about_ca_system_score_gemma":0.0023309106,"threshold_uncertainty_score":0.026329875},"labels":[],"label_agreement":null},{"id":"W2245309906","doi":"10.1109/cscloud.2015.33","title":"Tunable Performance and Consistency Tradeoffs for Geographically Replicated Cloud Services (COLOR)","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cloud computing; Replication (statistics); Consistency model; Latency (audio); Eventual consistency; Distributed computing; Consistency (knowledge bases); Cache; Cache coherence; Causal consistency; Concurrency control; Weak consistency; Replica; Strong consistency; Overhead (engineering); Computer network; Cloud storage; Data consistency; Sequential consistency; Database; Operating system; CPU cache; Cache algorithms; Database transaction","score_opus":0.022129095632465498,"score_gpt":0.23380457148461906,"score_spread":0.21167547585215357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245309906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816205,0.0028314104,0.39167422,0.0014293084,0.0002982748,0.0002587647,0.00029924256,0.003964741,0.017623505],"genre_scores_gemma":[0.976127,0.00013460983,0.022866495,0.00007494538,0.000030177434,0.00003606262,0.000058971003,0.00010980291,0.0005620432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953054,0.0012618842,0.00025814824,0.0006366264,0.0017656783,0.00077230996],"domain_scores_gemma":[0.9912623,0.0033286395,0.00086436217,0.0023929446,0.001558669,0.0005930903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047220564,0.00075238216,0.0006182542,0.00068894745,0.0011697465,0.0030587472,0.0020201153,0.0010654898,0.0014112425],"category_scores_gemma":[0.018334923,0.00044176742,0.00032926348,0.0010167771,0.0009897556,0.0034463299,0.0021622672,0.0012990439,0.0003675398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038718535,0.0007071517,0.010867248,0.00055898173,0.00024542242,0.00079797447,0.0010169615,0.4787227,0.22733875,0.11399424,0.0073505114,0.15452822],"study_design_scores_gemma":[0.00024785462,0.00079485064,0.003009136,0.000051766205,0.00012458481,0.0005644388,0.0005322027,0.86472625,0.0821928,0.041886415,0.0057118097,0.00015789978],"about_ca_topic_score_codex":0.002060401,"about_ca_topic_score_gemma":0.002154573,"teacher_disagreement_score":0.0047220564,"about_ca_system_score_codex":0.0019785678,"about_ca_system_score_gemma":0.0015146472,"threshold_uncertainty_score":0.024972916},"labels":[],"label_agreement":null},{"id":"W2245875467","doi":"10.1109/sbac-pad.2015.11","title":"Serialization Management for Best-Effort Hardware Transactional Memory","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Serialization; Computer science; Transactional memory; Thread (computing); Operating system; Parallel computing; Database transaction; Programming language","score_opus":0.03901510139234759,"score_gpt":0.2712216175368931,"score_spread":0.23220651614454552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245875467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8769067,0.0016478989,0.10669253,0.0003228133,0.00012736909,0.00023690164,0.00025074184,0.007850359,0.0059646503],"genre_scores_gemma":[0.94921964,0.00015871985,0.04841915,0.00008049838,0.000039678107,0.00008188903,0.00024633986,0.00023422982,0.0015197885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969735,0.0008897569,0.0003963994,0.00048061815,0.0009068382,0.0003528875],"domain_scores_gemma":[0.9909849,0.0024635035,0.001087575,0.0041478127,0.0010628119,0.00025336276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030278896,0.00069749117,0.00048225265,0.00084940635,0.00059427205,0.0015034275,0.0022187827,0.0004057596,0.0019676164],"category_scores_gemma":[0.0101513,0.00045945588,0.00025294672,0.0011169013,0.00051172083,0.0023144346,0.00076259684,0.0007445623,0.00035382327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004386166,0.0014122172,0.04463976,0.000924604,0.000315086,0.0004668947,0.0008467879,0.1439872,0.15708685,0.010972455,0.011756541,0.6232053],"study_design_scores_gemma":[0.0003945961,0.0030198377,0.018986914,0.000087942055,0.00027913274,0.0006780213,0.00045060206,0.6751691,0.2812684,0.007775251,0.011752925,0.00013730861],"about_ca_topic_score_codex":0.0013084898,"about_ca_topic_score_gemma":0.0019805233,"teacher_disagreement_score":0.0030278896,"about_ca_system_score_codex":0.0009545962,"about_ca_system_score_gemma":0.0010921863,"threshold_uncertainty_score":0.016013205},"labels":[],"label_agreement":null},{"id":"W2250079764","doi":"","title":"Groupings and Pairings in Anonymous Networks","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; Computer security","score_opus":0.008030641946607747,"score_gpt":0.21823033953245127,"score_spread":0.21019969758584353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250079764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4095859,0.00029485367,0.5689959,0.0014907378,0.00009669607,0.00015069736,0.00019770916,0.00029769918,0.018889863],"genre_scores_gemma":[0.9506562,0.00020286019,0.043320052,0.000087118286,0.00009892038,0.00011909032,0.00018293345,0.000035735582,0.005297135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628603,0.0018208196,0.00022290146,0.0006056912,0.0005725121,0.00049203687],"domain_scores_gemma":[0.9847029,0.00873773,0.0027496768,0.0020504107,0.00094725617,0.0008120661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031308332,0.00042180784,0.0008673936,0.0009932267,0.0027571006,0.0022632645,0.00092680904,0.0014176969,0.0039905836],"category_scores_gemma":[0.014419858,0.00046395886,0.0006210657,0.0012052704,0.002781183,0.006423502,0.0029218062,0.0014153529,0.0005920034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031554786,0.00014400246,0.0023338813,0.00015291486,0.00003925647,0.0004617008,0.0012895125,0.13464794,0.002510146,0.8294072,0.0022053986,0.026492538],"study_design_scores_gemma":[0.000039637547,0.000073008974,0.00035098894,0.000026569549,0.00001602721,0.000254456,0.000384762,0.17261967,0.0019873078,0.8195152,0.004706028,0.000026323063],"about_ca_topic_score_codex":0.00059705134,"about_ca_topic_score_gemma":0.000490685,"teacher_disagreement_score":0.0039905836,"about_ca_system_score_codex":0.001008896,"about_ca_system_score_gemma":0.0010713137,"threshold_uncertainty_score":0.016557634},"labels":[],"label_agreement":null},{"id":"W2256219868","doi":"10.14778/2752939.2752949","title":"Understanding the causes of consistency anomalies in Apache Cassandra","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Garbage collection; Computer science; Consistency (knowledge bases); Garbage; Workload; Java; Server; Throughput; Operating system; Database; Real-time computing; Programming language; Artificial intelligence","score_opus":0.13004382623379485,"score_gpt":0.2601769927376143,"score_spread":0.13013316650381945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256219868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97701955,0.0005981899,0.018246422,0.00059262244,0.000051718365,0.00003643891,0.00020649856,0.0021802587,0.0010682081],"genre_scores_gemma":[0.99691963,0.00009563264,0.0025220704,0.00004835674,0.000017034781,0.000019386009,0.00013700247,0.00009926598,0.00014168891],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557245,0.00079883606,0.00031505534,0.0008238666,0.001768785,0.0007209003],"domain_scores_gemma":[0.98217106,0.008768632,0.0030117938,0.002994998,0.002416972,0.0006366516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003120679,0.00057832483,0.0008518861,0.0014447641,0.0011076487,0.0019388425,0.0015576605,0.0012909109,0.00035887584],"category_scores_gemma":[0.021482365,0.0007282215,0.00038332195,0.0024441422,0.0015850918,0.002230857,0.0011724065,0.0025761237,0.00015975708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028431236,0.0009391641,0.544797,0.00075652276,0.0002968873,0.004759627,0.0061222557,0.18767391,0.12668999,0.022420535,0.0071520545,0.09554883],"study_design_scores_gemma":[0.000117844866,0.0005036405,0.15753701,0.000103253675,0.00017409633,0.0018447526,0.002043379,0.69874877,0.10643466,0.026910415,0.005394138,0.00018810124],"about_ca_topic_score_codex":0.004329236,"about_ca_topic_score_gemma":0.003456367,"teacher_disagreement_score":0.004329236,"about_ca_system_score_codex":0.0014100557,"about_ca_system_score_gemma":0.0022747945,"threshold_uncertainty_score":0.01650393},"labels":[],"label_agreement":null},{"id":"W2266731991","doi":"10.1016/j.tcs.2016.01.037","title":"Topology recognition and leader election in colored networks","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Node (physics); Colored; Leader election; Computer science; Topology (electrical circuits); Upper and lower bounds; Network topology; Path (computing); Theoretical computer science; Mathematics; Computer network; Combinatorics","score_opus":0.013708711981975702,"score_gpt":0.23691358033165807,"score_spread":0.22320486834968237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266731991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13990818,0.00037868728,0.84949565,0.00073479017,0.00023302683,0.000060846505,0.00006396716,0.00049823,0.008626638],"genre_scores_gemma":[0.93752414,0.0002728781,0.054781765,0.00011999671,0.000071054485,0.0000574317,0.00009014756,0.00008450895,0.006998061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00044756004,0.00003844122,0.0002151816,0.00019467142,0.0002366914],"domain_scores_gemma":[0.9948137,0.0032372044,0.0005704502,0.00054487505,0.00045216465,0.00038162238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014655971,0.0003786767,0.0007349601,0.00074158894,0.0010571731,0.0020461008,0.0015824911,0.0011197632,0.0020159255],"category_scores_gemma":[0.009479694,0.00048809714,0.0004307104,0.00087891216,0.0016169909,0.002286204,0.001418337,0.0011040284,0.00035444007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004363003,0.00010769821,0.0016439088,0.00010560748,0.000042464115,0.00022123319,0.0003639442,0.5556809,0.008643077,0.38367984,0.0029683744,0.046106685],"study_design_scores_gemma":[0.000022178174,0.000024113171,0.00019915026,0.000004754971,0.000008079921,0.000030694624,0.000046155492,0.88150537,0.0015400482,0.115922965,0.00068455073,0.00001197216],"about_ca_topic_score_codex":0.0038372397,"about_ca_topic_score_gemma":0.0037212276,"teacher_disagreement_score":0.0038372397,"about_ca_system_score_codex":0.0012231533,"about_ca_system_score_gemma":0.001121482,"threshold_uncertainty_score":0.008874595},"labels":[],"label_agreement":null},{"id":"W2276913102","doi":"10.1007/978-3-319-53058-1_2","title":"Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Synchronization (alternating current); Real-time computing; Fault (geology); Time synchronization; Distributed computing; Computer network","score_opus":0.0199611810559998,"score_gpt":0.26729375602160327,"score_spread":0.24733257496560346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276913102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13998657,0.0005313177,0.84891105,0.00024722028,0.00018480589,0.000064746826,0.000043008196,0.0007899137,0.00924136],"genre_scores_gemma":[0.89232934,0.00028299398,0.09879624,0.000066089284,0.00004495779,0.000070360664,0.000035530906,0.00007768424,0.008296757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.000059327165,0.000016772308,0.000056044515,0.000073909796,0.00003259164],"domain_scores_gemma":[0.99950314,0.00022326599,0.00004247259,0.00012378873,0.00007871388,0.000028632114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037408812,0.00040138463,0.00069152866,0.00032089642,0.00063232786,0.0007860733,0.00088166795,0.0006654191,0.0018501793],"category_scores_gemma":[0.0013214432,0.0002529267,0.00034707075,0.00044272398,0.0005873249,0.001056403,0.00095944246,0.00084087654,0.00026026237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009266707,0.000108606815,0.00096519,0.00025521204,0.000113552895,0.00060375367,0.0005126386,0.6000877,0.07968242,0.19035065,0.002981022,0.123412594],"study_design_scores_gemma":[0.000028857012,0.00008041655,0.00015557179,0.000010119384,0.000019418962,0.000049363654,0.000024822952,0.9704818,0.005685121,0.022235133,0.0012170739,0.000012283532],"about_ca_topic_score_codex":0.0010461804,"about_ca_topic_score_gemma":0.0012228593,"teacher_disagreement_score":0.0018501793,"about_ca_system_score_codex":0.0003994697,"about_ca_system_score_gemma":0.00035083186,"threshold_uncertainty_score":0.0061894655},"labels":[],"label_agreement":null},{"id":"W2278270578","doi":"10.1080/1206212x.2003.11441712","title":"Real-Time Computation: A Formal Definition And Its Applications","year":2003,"lang":"en","type":"article","venue":"International Journal of Computers and Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada; RMIT University","keywords":"Computer science; Computation; Formalism (music); Expressive power; Formal description; Theoretical computer science; Distributed computing; Algorithm; Programming language","score_opus":0.013203026494797926,"score_gpt":0.26124718701877847,"score_spread":0.24804416052398054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278270578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003001951,0.014881136,0.95517665,0.004710863,0.00074909127,0.00008964558,0.00023929462,0.00021536877,0.02093588],"genre_scores_gemma":[0.2665754,0.026670363,0.6841158,0.0036199263,0.003700099,0.0011072743,0.0007733394,0.00044516553,0.012992522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751604,0.00085700647,0.0002878823,0.0005672887,0.00059057673,0.00018122516],"domain_scores_gemma":[0.9964194,0.0021644253,0.00029779263,0.00052004197,0.00041163177,0.00018669112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044229594,0.0013610545,0.001194107,0.0029140175,0.0018209369,0.005261299,0.002439401,0.0024069806,0.004200973],"category_scores_gemma":[0.0064569525,0.0008898935,0.0020529844,0.005463346,0.011356263,0.011869893,0.0035307456,0.006182167,0.0011973018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038421813,0.0000071537493,0.00003088182,0.000049077218,0.00000308075,0.000038174567,0.00017867617,0.0011001901,0.00017785317,0.9933426,0.0008506119,0.0042180386],"study_design_scores_gemma":[0.000008514518,0.000015338808,0.000051118495,0.00009707582,0.000006407053,0.00020590618,0.00010192716,0.0077598947,0.0001835515,0.93067485,0.060879327,0.000016092436],"about_ca_topic_score_codex":0.0019977372,"about_ca_topic_score_gemma":0.0009492447,"teacher_disagreement_score":0.005261299,"about_ca_system_score_codex":0.0025072217,"about_ca_system_score_gemma":0.0018094538,"threshold_uncertainty_score":0.023391128},"labels":[],"label_agreement":null},{"id":"W2286730630","doi":"10.1145/2851141.2851160","title":"Be my guest","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lock (firearm); Computer science; Queue; Context (archaeology); Scheduling (production processes); Queueing theory; Distributed computing; Node (physics); Computer network; Parallel computing; Engineering","score_opus":0.015870236347013914,"score_gpt":0.23266758576121546,"score_spread":0.21679734941420153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286730630","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026328233,0.007436705,0.005313676,0.10086344,0.19632667,0.0002185252,0.0015820345,0.00332376,0.6823023],"genre_scores_gemma":[0.00712438,0.0018915104,0.001053338,0.012846267,0.011030195,0.000060722363,0.00044022952,0.00076092524,0.9647924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999092,0.00013520148,0.000030961786,0.00020207495,0.00033787786,0.00020184461],"domain_scores_gemma":[0.9958788,0.0002238561,0.00015413588,0.00030591319,0.0011434846,0.0022938207],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001171207,0.0010107966,0.0007636284,0.00075398665,0.0032319576,0.0070737153,0.0010926374,0.0019150268,0.5824614],"category_scores_gemma":[0.0066260807,0.00028461262,0.0006831663,0.00055199966,0.0009414698,0.0049556005,0.0052180314,0.0042208037,0.45571497],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029173434,0.000015911499,0.00015693875,0.00003300507,0.0000028385216,0.00009341448,0.000099106044,0.000017770819,0.00015977181,0.0033443172,0.97125894,0.024788905],"study_design_scores_gemma":[0.0000029195883,0.000010446856,0.000092878305,0.00003129948,0.0000019114725,0.00014196381,0.00012253063,0.000026250447,0.00007051645,0.00091619184,0.9985784,0.0000047053913],"about_ca_topic_score_codex":0.00094503316,"about_ca_topic_score_gemma":0.0019611118,"teacher_disagreement_score":0.5824614,"about_ca_system_score_codex":0.0010370876,"about_ca_system_score_gemma":0.0017114778,"threshold_uncertainty_score":0.59556806},"labels":[],"label_agreement":null},{"id":"W2291488275","doi":"","title":"A separation of (n -1)-consensus and n-consensus in read-write shared-memory systems","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Shared memory; Hierarchy; Theoretical computer science; Consensus; Universality (dynamical systems); Asynchronous system; Object (grammar); Distributed computing; Set (abstract data type); Process (computing); Multi-agent system; Artificial intelligence; Programming language; Parallel computing","score_opus":0.013779871668666326,"score_gpt":0.24223801558990224,"score_spread":0.22845814392123592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291488275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057044905,0.00074032845,0.9207684,0.0018963381,0.00020178745,0.00014128783,0.000098530814,0.0002260037,0.018882405],"genre_scores_gemma":[0.86199325,0.00038623044,0.1306987,0.00057852693,0.00039594693,0.00028162042,0.00012579828,0.00007068134,0.0054692687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606895,0.0012089178,0.00038255713,0.00096736575,0.0009945458,0.00037763696],"domain_scores_gemma":[0.9910103,0.004966111,0.0008973096,0.001653198,0.0008613852,0.00061172823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031066756,0.0006225636,0.0014124035,0.000480145,0.0013027751,0.0019702371,0.0014012281,0.0017907335,0.003117657],"category_scores_gemma":[0.00962573,0.000531798,0.000917047,0.0005874066,0.003948671,0.0068434603,0.0041437815,0.0037194216,0.00043004294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015828287,0.000047235906,0.000479997,0.00021601078,0.000027613225,0.00024781754,0.0008891236,0.017770413,0.0048167394,0.96098244,0.0011104548,0.0132538425],"study_design_scores_gemma":[0.00010820607,0.0002264337,0.00061124447,0.00006836835,0.00002996695,0.0002341854,0.0002233641,0.16357209,0.0031649661,0.8255171,0.006198162,0.00004575925],"about_ca_topic_score_codex":0.00081634324,"about_ca_topic_score_gemma":0.0008576514,"teacher_disagreement_score":0.003117657,"about_ca_system_score_codex":0.0013791858,"about_ca_system_score_gemma":0.0018317846,"threshold_uncertainty_score":0.016429842},"labels":[],"label_agreement":null},{"id":"W2293393493","doi":"10.14778/2732967.2732970","title":"ConfluxDB","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Replication (statistics); Distributed computing; Snapshot (computer storage); Database transaction; Database; Transaction processing; Operating system; Parallel computing","score_opus":0.005146339465848849,"score_gpt":0.18617502323385682,"score_spread":0.18102868376800796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293393493","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013962521,0.0034624503,0.118593656,0.002958352,0.0009177927,0.00094767386,0.11049612,0.5535797,0.19508186],"genre_scores_gemma":[0.11617663,0.0028219211,0.14264481,0.0041252775,0.0005038434,0.0012181652,0.58043796,0.04665439,0.10541704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969325,0.0003270889,0.0003190512,0.0006126323,0.0014580959,0.00035054155],"domain_scores_gemma":[0.9955432,0.00052925077,0.00018137734,0.0021096629,0.001328623,0.00030792534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026861338,0.0015210327,0.0012942151,0.0027978015,0.0015945293,0.0065422733,0.0072048507,0.0016636519,0.071781754],"category_scores_gemma":[0.0070629125,0.0010717262,0.00096057437,0.0037711724,0.0008520295,0.0072410135,0.0052771773,0.002050121,0.060867082],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006948901,0.00017525803,0.0011563308,0.0006359159,0.00009148612,0.00021776983,0.00033852432,0.0015709557,0.0048637893,0.0197599,0.86768055,0.102814645],"study_design_scores_gemma":[0.00029419735,0.00009797487,0.0009553619,0.000079881145,0.000043412034,0.00033117965,0.00021340842,0.013001007,0.008180508,0.012422625,0.9643027,0.00007777068],"about_ca_topic_score_codex":0.01643923,"about_ca_topic_score_gemma":0.009976102,"teacher_disagreement_score":0.071781754,"about_ca_system_score_codex":0.0023324501,"about_ca_system_score_gemma":0.0027378805,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05593355483876543,"score_gpt":0.34739906121630515,"score_spread":0.2914655063775397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294047952","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010331104,0.07615718,0.5244602,0.005122221,0.006817839,0.0022487245,0.0015869134,0.01945824,0.35381758],"genre_scores_gemma":[0.12565993,0.12088922,0.36040312,0.0072491374,0.0019082065,0.002066206,0.006825151,0.0031893423,0.37180966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978669,0.00028974502,0.00016186536,0.00044260352,0.0009859103,0.00025299983],"domain_scores_gemma":[0.9978404,0.00034463493,0.00014830205,0.0006733431,0.0008739485,0.000119353645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014974773,0.0012355944,0.00088602304,0.0017181851,0.0014141015,0.0032192096,0.0034660678,0.0021200033,0.030965349],"category_scores_gemma":[0.0050461106,0.0005625399,0.0011703371,0.002858836,0.0007749829,0.0041252044,0.003007262,0.001468475,0.034063496],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012160132,0.00013182905,0.00050341914,0.0020032872,0.0000379343,0.00032897646,0.00038996345,0.001640862,0.008397477,0.036515635,0.08226962,0.8676594],"study_design_scores_gemma":[0.000028027873,0.0000794362,0.0003456427,0.00036131064,0.000044460594,0.0008953792,0.00013160167,0.0021050826,0.007240381,0.011030065,0.9777141,0.000024479144],"about_ca_topic_score_codex":0.0022360277,"about_ca_topic_score_gemma":0.00164914,"teacher_disagreement_score":0.030965349,"about_ca_system_score_codex":0.0011412357,"about_ca_system_score_gemma":0.0025672794,"threshold_uncertainty_score":0.103589416},"labels":[],"label_agreement":null},{"id":"W2294310578","doi":"10.1007/978-3-319-25258-2_27","title":"A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Consensus; Distributed computing; Theoretical computer science; Shared memory; Hierarchy; Process (computing); Scheduling (production processes); Set (abstract data type); Asynchronous system; Multi-agent system; Artificial intelligence; Programming language; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.026949547613479907,"score_gpt":0.2902424270642802,"score_spread":0.2632928794508003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294310578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007897725,0.00027874458,0.98556685,0.00014705388,0.00018897101,0.00005730335,0.000026578482,0.0003972398,0.005439568],"genre_scores_gemma":[0.47603202,0.0004775936,0.51126766,0.00024525635,0.00025732027,0.0002454274,0.00019970875,0.0002109553,0.011064134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.0002459836,0.00007387226,0.00022912936,0.0002912774,0.00011966467],"domain_scores_gemma":[0.9990908,0.00038203478,0.000057171073,0.00023027114,0.00016384186,0.000075871016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718713,0.0005691967,0.0011745251,0.00043555332,0.0007438567,0.0010771604,0.0018105342,0.0008611288,0.0030306114],"category_scores_gemma":[0.002121515,0.00041341383,0.00093641167,0.00068372226,0.00085609354,0.0015078103,0.00210513,0.0019745259,0.0008236588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091125636,0.00022393312,0.0003643567,0.00043999424,0.00011525353,0.00030829126,0.0003629205,0.20578644,0.05494019,0.49610326,0.0063481373,0.23409596],"study_design_scores_gemma":[0.00008239988,0.00015459662,0.00016594355,0.000027034725,0.000037262333,0.0001171487,0.000024259622,0.8467781,0.0077863242,0.13886695,0.0059306985,0.000029266655],"about_ca_topic_score_codex":0.0012879169,"about_ca_topic_score_gemma":0.0012644503,"teacher_disagreement_score":0.0030306114,"about_ca_system_score_codex":0.0009471844,"about_ca_system_score_gemma":0.0016323188,"threshold_uncertainty_score":0.010138333},"labels":[],"label_agreement":null},{"id":"W2295568249","doi":"","title":"A monitor-based synchronization approach for Java packed objects","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"","keywords":"Java; Computer science; Java concurrency; Synchronization (alternating current); Thread (computing); IBM; Operating system; strictfp; Embedded Java; Virtual machine; Distributed computing; Parallel computing; Overhead (engineering); Real time Java; Real-time computing; Computer network","score_opus":0.033373488588804845,"score_gpt":0.25833038234382444,"score_spread":0.2249568937550196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295568249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032372534,0.0001483188,0.9499667,0.00014479652,0.00012552696,0.00014808346,0.000089709385,0.014333517,0.0026708092],"genre_scores_gemma":[0.4108233,0.00016071572,0.5796282,0.00033245474,0.00008086066,0.00030421943,0.0004996025,0.002148729,0.0060219737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980325,0.0003139072,0.00020484446,0.0003884437,0.0008998256,0.00016039603],"domain_scores_gemma":[0.9962985,0.0006518157,0.00041569083,0.0018410413,0.0005612856,0.00023165249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012602624,0.00044709205,0.0005906124,0.0006647586,0.00064290303,0.0013804152,0.002587406,0.0006328268,0.0028194473],"category_scores_gemma":[0.003625497,0.00053639396,0.00045377036,0.00074109546,0.00079535577,0.0023022494,0.0022360468,0.0018275655,0.00077796844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023465054,0.0009115763,0.008075514,0.0005181805,0.0001711552,0.00061398343,0.0017198509,0.02002956,0.391204,0.0793819,0.0141574675,0.48087034],"study_design_scores_gemma":[0.00047163837,0.0014878024,0.0031795409,0.00006482286,0.00021141428,0.0010479684,0.00023769755,0.4317432,0.450164,0.024181824,0.08697939,0.0002306991],"about_ca_topic_score_codex":0.0013058896,"about_ca_topic_score_gemma":0.0015245497,"teacher_disagreement_score":0.0028194473,"about_ca_system_score_codex":0.0006072914,"about_ca_system_score_gemma":0.0014706125,"threshold_uncertainty_score":0.009432018},"labels":[],"label_agreement":null},{"id":"W2296336213","doi":"10.1007/s00453-018-0411-z","title":"Self-Stabilizing Balls and Bins in Batches","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ball (mathematics); Server; Combinatorics; Lambda; Load balancing (electrical power); Exponential distribution; Mathematics; Bin; Discrete mathematics; Computer science; Algorithm; Physics; Mathematical analysis","score_opus":0.006921480146948752,"score_gpt":0.2239426863389863,"score_spread":0.21702120619203757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296336213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1232072,0.00061245216,0.8652118,0.0009323394,0.000271817,0.00013889001,0.00029756885,0.00080745516,0.008520513],"genre_scores_gemma":[0.79741895,0.00061448535,0.1670326,0.00036134585,0.00018880528,0.00032299038,0.00054351735,0.0005375562,0.03297983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.00042907003,0.000092402406,0.00031904664,0.00030549482,0.00032869968],"domain_scores_gemma":[0.9933264,0.0030572554,0.00069430476,0.0012457124,0.00086085324,0.0008154823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019825385,0.0008272183,0.0019203081,0.0010807995,0.0016233905,0.002864097,0.003939999,0.001759518,0.009300851],"category_scores_gemma":[0.0134088,0.0010565539,0.0010042284,0.0019279867,0.0021458012,0.0037186441,0.0041324724,0.002323923,0.001242441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016635376,0.00018086543,0.0017715512,0.00023079792,0.000081306745,0.00014924139,0.00031896998,0.432169,0.0048571695,0.5120574,0.008051641,0.038468424],"study_design_scores_gemma":[0.0001282399,0.00013099813,0.0003724494,0.00002949788,0.000038868377,0.000058139274,0.00010631431,0.6670662,0.0024054032,0.32661596,0.003017676,0.000030325884],"about_ca_topic_score_codex":0.004973599,"about_ca_topic_score_gemma":0.0042229826,"teacher_disagreement_score":0.009300851,"about_ca_system_score_codex":0.0017678561,"about_ca_system_score_gemma":0.001438721,"threshold_uncertainty_score":0.031114459},"labels":[],"label_agreement":null},{"id":"W2301455101","doi":"","title":"RF-MVTC: an efficient risk-free multiversion concurrency control algorithm: Research Articles","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Concurrency; Database transaction; Workstation; Distributed computing; Focus (optics); Serializability; Transaction data; Transactional leadership; Distributed transaction; Transaction processing; Algorithm; Distributed concurrency control; Database; Operating system","score_opus":0.03735774805963148,"score_gpt":0.3623460408416172,"score_spread":0.3249882927819857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301455101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064515998,0.00018102804,0.99118793,0.00012509084,0.00003847148,0.00006451701,0.000023835875,0.0011492542,0.0007782508],"genre_scores_gemma":[0.16755833,0.00011521054,0.8299311,0.00011675541,0.000048161284,0.00014447745,0.00013004775,0.00021315111,0.0017429113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981047,0.00042065533,0.0001564399,0.00037774554,0.0007870378,0.00015337355],"domain_scores_gemma":[0.9963942,0.0015335,0.00035254826,0.00087678956,0.00067736604,0.00016556037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029178287,0.000756026,0.000998608,0.0011398043,0.000671235,0.0012809078,0.0029657122,0.0013471652,0.0038620979],"category_scores_gemma":[0.008710092,0.0004248113,0.0006169213,0.0010905333,0.0011171029,0.0020712526,0.001983251,0.0016465427,0.00082744734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005672899,0.00017070588,0.0017733821,0.00017462978,0.00008311286,0.000109179906,0.00021669905,0.3837042,0.009945182,0.043002743,0.003621087,0.55663174],"study_design_scores_gemma":[0.000065750144,0.000047610058,0.000070567665,0.000011854699,0.000011141547,0.00006301597,0.0000103823595,0.9824936,0.003401832,0.011746881,0.0020637317,0.000013685621],"about_ca_topic_score_codex":0.0056904703,"about_ca_topic_score_gemma":0.0036952435,"teacher_disagreement_score":0.0056904703,"about_ca_system_score_codex":0.001069754,"about_ca_system_score_gemma":0.0023577386,"threshold_uncertainty_score":0.015431106},"labels":[],"label_agreement":null},{"id":"W2311002194","doi":"10.1145/2837019","title":"Byzantine Agreement in Expected Polynomial Time","year":2016,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Asynchronous communication; Adversary; Scheduling (production processes); Time complexity; Computation; Fraction (chemistry); Constant (computer programming); Adversary model; Quantum Byzantine agreement; State (computer science); Polynomial; Theoretical computer science; Byzantine fault tolerance; Algorithm; Distributed computing; Mathematics; Mathematical optimization; Computer network; Fault tolerance; Computer security","score_opus":0.008841307731756204,"score_gpt":0.22041813575760638,"score_spread":0.21157682802585018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311002194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030804815,0.00022540583,0.9581211,0.0014325447,0.00012797497,0.0002148568,0.00014083048,0.0017063265,0.007226223],"genre_scores_gemma":[0.63291043,0.00028926093,0.3518996,0.0005591652,0.00021238947,0.00058229774,0.0004292411,0.000627632,0.012490007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98887306,0.0035642637,0.000497766,0.0021165486,0.0027026548,0.0022455915],"domain_scores_gemma":[0.9757416,0.015322311,0.0017943816,0.0046741953,0.0016240428,0.00084334734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007255043,0.0016594644,0.0026450003,0.0010804145,0.0026800781,0.004094701,0.0036408873,0.0023826484,0.005990475],"category_scores_gemma":[0.02415221,0.0007712866,0.0014484774,0.0021372186,0.0040862183,0.010399644,0.0048408615,0.0047094678,0.001862353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009816501,0.00036765568,0.0012215005,0.00042663413,0.00016973261,0.00028711406,0.0009914859,0.21730053,0.009075728,0.679177,0.009580135,0.0804208],"study_design_scores_gemma":[0.00017065188,0.00011094443,0.00008606478,0.000022540027,0.000038619386,0.000104981686,0.00007508694,0.44704983,0.0044540055,0.543695,0.004167071,0.00002518878],"about_ca_topic_score_codex":0.0014704956,"about_ca_topic_score_gemma":0.0022727286,"teacher_disagreement_score":0.007255043,"about_ca_system_score_codex":0.0032298139,"about_ca_system_score_gemma":0.0046817027,"threshold_uncertainty_score":0.03836882},"labels":[],"label_agreement":null},{"id":"W2319792364","doi":"10.2316/p.2010.676-054","title":"Constructing Non-Dominated &lt;em&gt;m&lt;/em&gt;-Group Coteries for Group Mutual Exclusion","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Group (periodic table); Mutual exclusion; Computer science; Physics; Mathematics; Theoretical computer science","score_opus":0.008023754977007557,"score_gpt":0.22823139202830117,"score_spread":0.22020763705129362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319792364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06838174,0.00008057036,0.92010045,0.00016535544,0.000076339544,0.00015108903,0.000067342684,0.0005020663,0.010475102],"genre_scores_gemma":[0.4756781,0.00012634957,0.5033303,0.00029080999,0.00006640184,0.00036636426,0.00034663372,0.00039395076,0.019401154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987902,0.0004024389,0.00006589151,0.00021371033,0.00031065207,0.0002172162],"domain_scores_gemma":[0.99634725,0.0013959908,0.00031151244,0.00071562745,0.000566834,0.00066281646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019834398,0.00081323524,0.0009349403,0.0011736315,0.0017642446,0.0013567196,0.0019850442,0.000981349,0.0059810476],"category_scores_gemma":[0.006294899,0.0006152499,0.0011098244,0.0009099693,0.001581799,0.0015676133,0.0051664882,0.0016994001,0.0011094719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066435203,0.00037747723,0.0033507212,0.00021279861,0.00007945079,0.00033523925,0.0008351728,0.09188961,0.019434167,0.7631584,0.007816652,0.111846],"study_design_scores_gemma":[0.000096166805,0.00023469787,0.0005713276,0.000044923312,0.00004522115,0.0001348078,0.00021313423,0.6210365,0.009924985,0.3545657,0.013090003,0.000042534608],"about_ca_topic_score_codex":0.0021078135,"about_ca_topic_score_gemma":0.004064851,"teacher_disagreement_score":0.0059810476,"about_ca_system_score_codex":0.0012040822,"about_ca_system_score_gemma":0.0012814349,"threshold_uncertainty_score":0.020008624},"labels":[],"label_agreement":null},{"id":"W2330992411","doi":"10.2514/6.2009-6705","title":"The Exploration Testbeds - Industry Investments Supporting Project Constellation Risk Reduction","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Constellation; Reduction (mathematics); Computer science; Cost reduction; Business; Mathematics","score_opus":0.03035005098942268,"score_gpt":0.29535678711497043,"score_spread":0.26500673612554776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330992411","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23059355,0.01007564,0.3587676,0.012760982,0.001156838,0.0017187052,0.007096926,0.01723111,0.36059865],"genre_scores_gemma":[0.7463117,0.004950505,0.19972736,0.0008436225,0.0002584506,0.00076162844,0.014759767,0.0013121625,0.031074781],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973802,0.0008689208,0.000093013216,0.00024336124,0.0010149978,0.0003994751],"domain_scores_gemma":[0.9930775,0.0017459368,0.0006833347,0.0016464874,0.0015153659,0.00133145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072669694,0.00067835406,0.0003611706,0.0018661594,0.0014951441,0.0020213164,0.0011167974,0.0007309205,0.013904733],"category_scores_gemma":[0.0050706514,0.00034824418,0.00036681135,0.0021466448,0.0013374838,0.0031895149,0.0030101906,0.0016169001,0.0021312484],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010870447,0.0014736546,0.017780555,0.00066009857,0.00009580624,0.00080986955,0.0012942863,0.02241137,0.04028548,0.16777758,0.08923884,0.6570855],"study_design_scores_gemma":[0.00031702177,0.0029001844,0.018508404,0.00029037587,0.00007730322,0.0012940442,0.0009328582,0.021649467,0.05150285,0.024767142,0.8776529,0.00010757985],"about_ca_topic_score_codex":0.0024381843,"about_ca_topic_score_gemma":0.0025548902,"teacher_disagreement_score":0.013904733,"about_ca_system_score_codex":0.0021074745,"about_ca_system_score_gemma":0.0033925988,"threshold_uncertainty_score":0.04651594},"labels":[],"label_agreement":null},{"id":"W2336088419","doi":"10.1109/tpds.2016.2556669","title":"Limitations of Highly-Available Eventually-Consistent Data Stores","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Liveness; Computer science; Consistency (knowledge bases); Concurrency; Consistency model; Causal consistency; Eventual consistency; Sequential consistency; Data consistency; Causality (physics); Weak consistency; Distributed computing; Strong consistency; Concurrency control; Theoretical computer science; Programming language; Database transaction; Artificial intelligence; Mathematics","score_opus":0.101871782258235,"score_gpt":0.2534145340961861,"score_spread":0.15154275183795107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336088419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16784258,0.0034962657,0.7950487,0.0066663325,0.00028003115,0.0005682295,0.001214807,0.0036455144,0.021237424],"genre_scores_gemma":[0.8676436,0.0017870273,0.12133075,0.0008629953,0.00021519198,0.0005550284,0.00076124107,0.00043955105,0.006404518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97598356,0.0064036474,0.002436833,0.0021112938,0.011242905,0.0018217423],"domain_scores_gemma":[0.87736464,0.06235851,0.0050126184,0.039115623,0.01426835,0.0018802062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01725597,0.0008338737,0.0015917327,0.0011056956,0.0023254668,0.006557148,0.008577469,0.0028127923,0.0070060845],"category_scores_gemma":[0.068676345,0.0020310993,0.0016135107,0.0021291047,0.0048050187,0.017227674,0.006382195,0.0046051503,0.0015696461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020459583,0.00050532015,0.00877153,0.0014093423,0.0002341762,0.0012262545,0.0025634805,0.15890875,0.012940433,0.7016583,0.008849598,0.10088693],"study_design_scores_gemma":[0.0006170498,0.0008359221,0.0011827004,0.00044080906,0.00023650138,0.001630234,0.0016804681,0.41899174,0.028147027,0.49550468,0.050509077,0.0002237916],"about_ca_topic_score_codex":0.005177622,"about_ca_topic_score_gemma":0.0033006573,"teacher_disagreement_score":0.01725597,"about_ca_system_score_codex":0.002486422,"about_ca_system_score_gemma":0.0064167287,"threshold_uncertainty_score":0.09125942},"labels":[],"label_agreement":null},{"id":"W2341144241","doi":"10.1145/2904111.2904118","title":"PACOFed","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Interoperability; Cloud computing; Computer science; Modular design; Modular programming; Access control; Standardization; Legacy system; Computer security; World Wide Web; Operating system; Software","score_opus":0.007347687848012642,"score_gpt":0.20487884905327228,"score_spread":0.19753116120525963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341144241","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045047387,0.0006008262,0.54789376,0.0024959454,0.0009792802,0.0021731877,0.0072034,0.16479257,0.22881368],"genre_scores_gemma":[0.5290616,0.0008676475,0.28726503,0.0025107844,0.00028529146,0.0011625076,0.021677118,0.00838113,0.14878887],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976041,0.0001774056,0.00013849922,0.00052617805,0.0011558968,0.00039789052],"domain_scores_gemma":[0.99509996,0.0003475642,0.00024087628,0.00208018,0.001797003,0.000434333],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002140519,0.0006160285,0.00048026425,0.001196567,0.0017745711,0.0032719248,0.0021915827,0.00071791175,0.018914878],"category_scores_gemma":[0.0048939395,0.00045927285,0.00041692195,0.0007898825,0.0011143693,0.0038795774,0.0035116402,0.0016566237,0.006199799],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014138839,0.00047121104,0.011258889,0.000522683,0.00012209463,0.0005116562,0.0013337814,0.012217839,0.025694106,0.14874049,0.28369215,0.5140213],"study_design_scores_gemma":[0.00011370637,0.00016635562,0.0034586848,0.00009505081,0.00005070082,0.0005242378,0.00018313121,0.06673637,0.02538324,0.014857351,0.88832486,0.000106331216],"about_ca_topic_score_codex":0.03239833,"about_ca_topic_score_gemma":0.023757823,"teacher_disagreement_score":0.9810851,"about_ca_system_score_codex":0.0028985112,"about_ca_system_score_gemma":0.0076117883,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2345748148","doi":"10.1007/978-3-642-03259-2_8","title":"Autonomous navigation—behaviors and architectures","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Terrain; Task (project management); Planetary exploration; Computer science; Control (management); Mission control center; Systems engineering; Engineering; Artificial intelligence; Geography; Astrobiology; Mars Exploration Program","score_opus":0.02238615010831061,"score_gpt":0.2519929679918547,"score_spread":0.22960681788354412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345748148","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005989606,0.09929535,0.33689207,0.0027696015,0.0026840428,0.000066603236,0.0005266301,0.0018733296,0.5499028],"genre_scores_gemma":[0.09616199,0.10681663,0.13169427,0.0012043873,0.0014028788,0.00023063162,0.0013105808,0.00075311505,0.66042554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998833,0.000009952722,0.0000042938022,0.000023488605,0.00006938171,0.000009569295],"domain_scores_gemma":[0.9999393,0.000016654116,0.0000041228554,0.000012342155,0.000021295295,0.000006214601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009303665,0.00072200433,0.00037030276,0.000602481,0.00030263187,0.0011989493,0.0007983213,0.00069567584,0.008544448],"category_scores_gemma":[0.00028199077,0.00040538496,0.00025643565,0.0008951818,0.0010113361,0.0016069295,0.0007425765,0.0010654031,0.0050193374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016092983,0.000025541192,0.00016574885,0.00037952088,0.000013673106,0.000033152362,0.00017748337,0.012364222,0.0044505103,0.3475914,0.07665569,0.55812705],"study_design_scores_gemma":[0.000005101782,0.000022983948,0.000353091,0.00024444464,0.0000097074135,0.00015255391,0.00006718415,0.013019127,0.0014426507,0.24311659,0.7415455,0.000021134443],"about_ca_topic_score_codex":0.0019852917,"about_ca_topic_score_gemma":0.0031351799,"teacher_disagreement_score":0.008544448,"about_ca_system_score_codex":0.0006521536,"about_ca_system_score_gemma":0.00074570236,"threshold_uncertainty_score":0.028584003},"labels":[],"label_agreement":null},{"id":"W2361514654","doi":"","title":"Study and Improve on Distributed Mutual Exclusion Alsorithms","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mutual exclusion; Computer science; Suzuki-Kasami algorithm; Lock (firearm); Security token; Tree (set theory); Mutual information; Set (abstract data type); Distributed computing; Theoretical computer science; Data mining; Computer network; Artificial intelligence; Mathematics","score_opus":0.00911501134789368,"score_gpt":0.252448585912408,"score_spread":0.2433335745645143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361514654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043061856,0.0077987257,0.9251965,0.0017154317,0.00038464577,0.00009001188,0.000053711094,0.0003595181,0.02133957],"genre_scores_gemma":[0.6753727,0.009438733,0.29908597,0.00068871357,0.0010970375,0.00013668231,0.00020781862,0.00017854128,0.013793824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986216,0.0003592482,0.000059386373,0.00023655238,0.0005968118,0.00012646941],"domain_scores_gemma":[0.9985948,0.0006914428,0.00007169734,0.00019605194,0.0003887167,0.00005736306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217926,0.00036756168,0.00046815758,0.0006630269,0.0007708079,0.001160843,0.0010608879,0.0006038259,0.0024017033],"category_scores_gemma":[0.0035508603,0.00012978903,0.00046468477,0.00094227074,0.0007836579,0.00392506,0.0011293251,0.0008209844,0.0004231175],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031747084,0.00023186184,0.005645479,0.00082585454,0.00011017265,0.00032117122,0.00087404286,0.06018553,0.012375225,0.5539006,0.005733589,0.359479],"study_design_scores_gemma":[0.00011445046,0.00049406727,0.00191436,0.00016623453,0.00017218529,0.0008821526,0.00047734374,0.50164443,0.021400375,0.33558062,0.13709003,0.000063800064],"about_ca_topic_score_codex":0.0011146606,"about_ca_topic_score_gemma":0.0008476276,"teacher_disagreement_score":0.0024017033,"about_ca_system_score_codex":0.0008253201,"about_ca_system_score_gemma":0.0012420446,"threshold_uncertainty_score":0.008034527},"labels":[],"label_agreement":null},{"id":"W2384713790","doi":"","title":"A Data Synchronization Technology Based Data Access Constraint","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Constraint (computer-aided design); Synchronization (alternating current); Data synchronization; Data access; Poisson distribution; Data loss; Data collection; Real-time computing; Data mining; Database; Computer network; Statistics; Wireless sensor network","score_opus":0.04837575595148713,"score_gpt":0.33417032714658745,"score_spread":0.2857945711951003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2384713790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008179907,0.00038201147,0.98784655,0.00027481056,0.00011158209,0.000103337305,0.000112420144,0.0005930352,0.0023963656],"genre_scores_gemma":[0.45553547,0.0011095577,0.5333517,0.0006440652,0.0005261221,0.00089774636,0.00085119525,0.0003941093,0.0066899327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920156,0.0014895275,0.00081008923,0.0017142802,0.0035484415,0.00042208628],"domain_scores_gemma":[0.9888144,0.0037938738,0.0012916804,0.0030161575,0.0027076772,0.00037616346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002882043,0.000756661,0.0011271321,0.0016455193,0.0016928198,0.0036828928,0.00315822,0.0011933885,0.0028809276],"category_scores_gemma":[0.012199095,0.00058483856,0.00070311053,0.0029182506,0.0017015176,0.007524043,0.003320403,0.002641222,0.00065051427],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007376229,0.00033447894,0.0065128743,0.0009717601,0.00020758282,0.0007579307,0.0011402888,0.066813424,0.08558935,0.50131416,0.013099797,0.32252064],"study_design_scores_gemma":[0.00017575173,0.0005637131,0.0018191441,0.00012134118,0.00019140088,0.0015762106,0.0003565691,0.6951101,0.12642099,0.077008925,0.0964204,0.00023557711],"about_ca_topic_score_codex":0.0022829878,"about_ca_topic_score_gemma":0.00097353593,"teacher_disagreement_score":0.0036828928,"about_ca_system_score_codex":0.0015614585,"about_ca_system_score_gemma":0.003252312,"threshold_uncertainty_score":0.015241921},"labels":[],"label_agreement":null},{"id":"W2386452338","doi":"10.1007/s00778-017-0463-8","title":"Efficiently making (almost) any concurrency control mechanism serializable","year":2017,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Serialization; Concurrency control; Serializability; Commit; Transactional memory; Distributed transaction; Online transaction processing; Database transaction","score_opus":0.018270925180170403,"score_gpt":0.27674830958537444,"score_spread":0.258477384405204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2386452338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10558655,0.0004201545,0.86240673,0.0007853316,0.00040908498,0.0002991787,0.0002206264,0.01722453,0.012647817],"genre_scores_gemma":[0.7097064,0.0003176954,0.27130136,0.0004653296,0.00022103479,0.0002560393,0.00060096954,0.0018262271,0.0153049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947259,0.0010000414,0.00042707226,0.0008942952,0.002168217,0.00078437873],"domain_scores_gemma":[0.98430204,0.0033077095,0.0007012943,0.0100377295,0.0012507563,0.00040041667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004282639,0.001183663,0.0011441654,0.00088226586,0.0013042879,0.0038390209,0.00282738,0.0010068446,0.0067019234],"category_scores_gemma":[0.013254509,0.001168532,0.0008838439,0.0015952217,0.0022242828,0.0053798477,0.0043801465,0.002408984,0.0020127485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038681205,0.00076467596,0.005819903,0.0006029899,0.0002458489,0.0005565429,0.0011357394,0.09781514,0.14040563,0.16876197,0.021944763,0.5580787],"study_design_scores_gemma":[0.0009028547,0.00065565953,0.0013628001,0.00011698286,0.00039593494,0.0004161755,0.00041377984,0.48317978,0.1474164,0.32817388,0.036818035,0.0001477126],"about_ca_topic_score_codex":0.002168544,"about_ca_topic_score_gemma":0.0030153622,"teacher_disagreement_score":0.0067019234,"about_ca_system_score_codex":0.0007705898,"about_ca_system_score_gemma":0.0030858328,"threshold_uncertainty_score":0.02264905},"labels":[],"label_agreement":null},{"id":"W2398231325","doi":"10.1109/icse.2013.6606578","title":"Detecting deadlock in programs with data-centric synchronization","year":2013,"lang":"en","type":"article","venue":"2013 35th International Conference on Software Engineering (ICSE)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Atomicity; Programmer; Concurrency; Java; Programming language; Concurrency control; Deadlock; Synchronization (alternating current); Deadlock prevention algorithms; Compiler; Parallel computing; Distributed computing; Lock (firearm); Correctness; Semaphore; Concurrent computing; Operating system; Database transaction; Computer network","score_opus":0.031128657257415572,"score_gpt":0.24325015743162573,"score_spread":0.21212150017421016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398231325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17069985,0.0001062609,0.8206158,0.000113167654,0.000030709234,0.000087445274,0.000045242527,0.0075634713,0.00073811965],"genre_scores_gemma":[0.6287329,0.00006630522,0.36964542,0.00010576059,0.000015810705,0.00010171334,0.00015362196,0.00051480444,0.00066371204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520266,0.0016379574,0.0004627687,0.00066232943,0.0015329617,0.0005013639],"domain_scores_gemma":[0.98063743,0.011383231,0.0021112459,0.0032589766,0.0022840882,0.0003249418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059772045,0.0006228514,0.00082912337,0.0011659919,0.000881962,0.0017901992,0.0018883331,0.0008222571,0.0006050573],"category_scores_gemma":[0.017761488,0.0009352294,0.00082703115,0.0007999883,0.0020477274,0.0024147022,0.00266028,0.001222727,0.00013025955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002909182,0.0008003608,0.08098695,0.0014706288,0.00041572595,0.001865486,0.0036573,0.27193257,0.26493433,0.07429733,0.002570138,0.29416004],"study_design_scores_gemma":[0.00018019689,0.000353275,0.0028584565,0.0000724186,0.00018668643,0.00041511995,0.00023120444,0.80909556,0.15188539,0.030570585,0.004067301,0.00008386305],"about_ca_topic_score_codex":0.0024953624,"about_ca_topic_score_gemma":0.002544748,"teacher_disagreement_score":0.0059772045,"about_ca_system_score_codex":0.00086160644,"about_ca_system_score_gemma":0.0025463847,"threshold_uncertainty_score":0.031610847},"labels":[],"label_agreement":null},{"id":"W2399504268","doi":"","title":"Facilitating multi-device usage in mhealth","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Mobile device; Middleware (distributed applications); mHealth; Partition (number theory); Computer network; Mobile computing; Wireless; Architecture; Computer security; Distributed computing; Health care; World Wide Web; Telecommunications","score_opus":0.036347299751298565,"score_gpt":0.2934388624172059,"score_spread":0.2570915626659073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399504268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35293898,0.001112175,0.62995315,0.0014611731,0.0002157515,0.00050313305,0.00006815497,0.004881754,0.008865659],"genre_scores_gemma":[0.918038,0.00012757319,0.07991755,0.0001324122,0.000037330417,0.00010979115,0.000035268236,0.00011190642,0.0014902254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759907,0.0009816545,0.00023025757,0.00035489415,0.0005324575,0.00030175797],"domain_scores_gemma":[0.9951905,0.001739975,0.00039276248,0.001835157,0.0005527889,0.00028869652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201934,0.000485503,0.00048772624,0.00054711074,0.0008560251,0.0013151523,0.0018253312,0.0010621323,0.0012013842],"category_scores_gemma":[0.0077585024,0.00052215764,0.00037485725,0.00032384993,0.00070951623,0.0023241972,0.003717468,0.001059861,0.00049657095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020661214,0.0014788164,0.049627706,0.00089295185,0.0002477,0.0064528286,0.013586231,0.065872304,0.26818672,0.052732065,0.0073562027,0.5315004],"study_design_scores_gemma":[0.0004837269,0.003181105,0.031985056,0.00031180182,0.0003236869,0.004572385,0.0048940447,0.6023971,0.21407469,0.04683894,0.090553045,0.00038450977],"about_ca_topic_score_codex":0.0010097249,"about_ca_topic_score_gemma":0.0010149857,"teacher_disagreement_score":0.003201934,"about_ca_system_score_codex":0.00040800328,"about_ca_system_score_gemma":0.00090831355,"threshold_uncertainty_score":0.01693362},"labels":[],"label_agreement":null},{"id":"W2400133291","doi":"","title":"Robust concurrency control in main-memory DBMS: What main memory giveth, the application taketh away.","year":2014,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency control; Multiversion concurrency control; Non-lock concurrency control; Concurrency; Database; Optimistic concurrency control; Memory management; Distributed concurrency control; Parallel computing; Programming language; Operating system; Database transaction; Overlay","score_opus":0.027956875898266287,"score_gpt":0.25220511764092207,"score_spread":0.22424824174265579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400133291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06354129,0.03829704,0.8436385,0.030155472,0.0029400932,0.00010340091,0.0001815319,0.0045832316,0.016559528],"genre_scores_gemma":[0.8988123,0.007834743,0.07454379,0.0026172919,0.0021700212,0.00010195866,0.00015533902,0.0011068665,0.012657665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720687,0.00073618273,0.00015204136,0.0003682455,0.001130802,0.0004059456],"domain_scores_gemma":[0.99245304,0.002724254,0.0003474038,0.002682819,0.0012908374,0.0005016149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003904853,0.0005264324,0.000865498,0.00043304576,0.00078254903,0.0044812844,0.0025428713,0.0017760491,0.0041165296],"category_scores_gemma":[0.020115884,0.0007530269,0.0005249267,0.0005178711,0.003653837,0.012297507,0.0028419949,0.0047403965,0.0010836578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009655048,0.00025480907,0.0046198457,0.00095779344,0.00024057279,0.00027534578,0.0014014539,0.07101655,0.02079394,0.44645157,0.034536064,0.4184866],"study_design_scores_gemma":[0.00011459263,0.0002389335,0.0011375223,0.00035198862,0.00013103249,0.0002844229,0.0005678135,0.3165948,0.01956395,0.6127646,0.048104614,0.00014563547],"about_ca_topic_score_codex":0.002900196,"about_ca_topic_score_gemma":0.0020035792,"teacher_disagreement_score":0.0044812844,"about_ca_system_score_codex":0.00092840526,"about_ca_system_score_gemma":0.0014771038,"threshold_uncertainty_score":0.020651042},"labels":[],"label_agreement":null},{"id":"W2401965054","doi":"","title":"FASTER AGREEMENT VIA A SPECTRAL METHOD FOR DETECTING MALICIOUS BEHAVIOR","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Asynchronous communication; Scheduling (production processes); Blacklist; Parallel computing; Algorithm; Mathematics; Computer network; Mathematical optimization","score_opus":0.017776082241152374,"score_gpt":0.2871726591001916,"score_spread":0.26939657685903917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401965054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02142054,0.00005429678,0.97663695,0.0001346144,0.000033727727,0.00005770092,0.000022509928,0.0006868134,0.00095291005],"genre_scores_gemma":[0.67810154,0.0000745482,0.3193966,0.00014799942,0.0000816208,0.00016541292,0.00008896448,0.00017563872,0.0017677402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953993,0.0020333172,0.00018004507,0.0006841255,0.0013547997,0.00034846406],"domain_scores_gemma":[0.98485976,0.008030022,0.0019203895,0.0022219438,0.0024735953,0.0004942699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034527802,0.0009836489,0.0010944407,0.002601826,0.0009162831,0.0012197648,0.0013606864,0.0011515619,0.0023483927],"category_scores_gemma":[0.016779006,0.00043797336,0.00064360554,0.0009726811,0.0024648951,0.0026944499,0.0019504739,0.001716658,0.00080380053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010080091,0.00041441302,0.0054226276,0.00023138055,0.00015477127,0.00027816644,0.00056117104,0.5035141,0.0465167,0.22455761,0.0035248867,0.21381609],"study_design_scores_gemma":[0.000011669932,0.0000332868,0.000099191675,0.0000054059883,0.00000419455,0.000027218257,0.0000152268785,0.975901,0.002493958,0.02111038,0.0002889522,0.000009516494],"about_ca_topic_score_codex":0.0010605857,"about_ca_topic_score_gemma":0.0008407299,"teacher_disagreement_score":0.0034527802,"about_ca_system_score_codex":0.0010567744,"about_ca_system_score_gemma":0.0013635597,"threshold_uncertainty_score":0.01826024},"labels":[],"label_agreement":null},{"id":"W2402627327","doi":"","title":"Spanning trees with bounded total excess","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Bounded function; Spanning tree; Combinatorics; Mathematical analysis","score_opus":0.01870950757343491,"score_gpt":0.2196476283567328,"score_spread":0.20093812078329787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402627327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926771,0.0020983757,0.6323339,0.0031137206,0.00027803826,0.00015403365,0.0013300603,0.001703778,0.06631103],"genre_scores_gemma":[0.861912,0.0016674739,0.10581286,0.0005812523,0.00033437915,0.0002236239,0.0009079114,0.0006014793,0.02795907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857914,0.00035807956,0.00010251943,0.0002443822,0.00044236134,0.00027349885],"domain_scores_gemma":[0.98993146,0.0061171474,0.00067551405,0.001549451,0.0007944954,0.0009319666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017053507,0.0009865537,0.0017319964,0.0018081884,0.0015696797,0.004056441,0.0022313145,0.001665836,0.009300838],"category_scores_gemma":[0.011890666,0.00084041397,0.00074332557,0.002858886,0.001687615,0.0064005484,0.0036758482,0.0026959262,0.001588315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027364938,0.00008038919,0.0005217848,0.00025106999,0.000044492783,0.00018584258,0.0002625018,0.03896019,0.005727068,0.91625595,0.005253286,0.03218381],"study_design_scores_gemma":[0.000042352232,0.00004064725,0.00019770113,0.000036162757,0.000049391452,0.00025318115,0.000074525116,0.082771145,0.0018516822,0.91041416,0.0042522606,0.000016663358],"about_ca_topic_score_codex":0.0005736836,"about_ca_topic_score_gemma":0.0012370156,"teacher_disagreement_score":0.009300838,"about_ca_system_score_codex":0.0016644447,"about_ca_system_score_gemma":0.0009171125,"threshold_uncertainty_score":0.03111434},"labels":[],"label_agreement":null},{"id":"W2406835255","doi":"10.1007/s00446-018-0331-9","title":"On the optimal space complexity of consensus for anonymous processes","year":2018,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy","keywords":"Space (punctuation); Computer science; Psychology","score_opus":0.043456980142650946,"score_gpt":0.27990980350561945,"score_spread":0.2364528233629685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406835255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3790558,0.0038016527,0.5621186,0.014964501,0.000653491,0.00027989302,0.0010272262,0.00095047936,0.037148308],"genre_scores_gemma":[0.94856197,0.0011852371,0.04138478,0.00064857095,0.00062230777,0.00028398336,0.0004131169,0.000433033,0.006467007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931886,0.0029809123,0.00025476667,0.00078012666,0.001616843,0.0011787922],"domain_scores_gemma":[0.90825653,0.08062414,0.0026688636,0.0039996435,0.0022590358,0.0021918663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066253557,0.0015361294,0.003019097,0.002113162,0.0023370152,0.005155601,0.0035839295,0.003652348,0.010378534],"category_scores_gemma":[0.06055605,0.0010570745,0.0013768413,0.0025744166,0.0049723675,0.0133967195,0.006020017,0.005697308,0.0007843381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017776558,0.00033517618,0.0019125392,0.00041614866,0.00013140247,0.00014860953,0.0007441333,0.5359023,0.0033787393,0.41551232,0.008829894,0.030911066],"study_design_scores_gemma":[0.00011848137,0.00011447011,0.00033628152,0.000028427556,0.00003850961,0.00003809204,0.0001546316,0.63216174,0.0006130379,0.36569986,0.0006670602,0.000029427527],"about_ca_topic_score_codex":0.004022144,"about_ca_topic_score_gemma":0.0040675425,"teacher_disagreement_score":0.010378534,"about_ca_system_score_codex":0.0049962075,"about_ca_system_score_gemma":0.0049723936,"threshold_uncertainty_score":0.036250234},"labels":[],"label_agreement":null},{"id":"W240851389","doi":"10.1007/978-3-662-45174-8_21","title":"Space Bounds for Adaptive Renaming","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Asynchronous communication; Computer science; Upper and lower bounds; Combinatorics; Integer (computer science); Discrete mathematics; Space (punctuation); Arithmetic; Algorithm; Mathematics; Programming language; Telecommunications; Operating system","score_opus":0.017065302125838296,"score_gpt":0.24228609566146675,"score_spread":0.22522079353562846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W240851389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017208802,0.006947707,0.8840722,0.0020988581,0.0008558981,0.000102900856,0.00035286442,0.0019867327,0.08637412],"genre_scores_gemma":[0.6331099,0.0073118,0.2892582,0.0013465142,0.0018741445,0.0007416632,0.0009834224,0.002468208,0.06290599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919418,0.0018859728,0.00037931817,0.0012094964,0.0030884424,0.0014949809],"domain_scores_gemma":[0.9709089,0.018914802,0.00092384085,0.0062334375,0.0020848897,0.000934156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056031113,0.002492257,0.0029907764,0.0027519215,0.0022330212,0.006398289,0.0056188004,0.0027187467,0.028396958],"category_scores_gemma":[0.028559044,0.0011641225,0.0017168263,0.003858214,0.0039584744,0.017543862,0.008310845,0.009207073,0.004438992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002982277,0.000074314004,0.00018453333,0.00020974438,0.000036977726,0.00003498661,0.00024612574,0.050401293,0.0019001531,0.8587526,0.010631588,0.077229425],"study_design_scores_gemma":[0.00002386826,0.0000413432,0.0001270962,0.0000876858,0.00003666775,0.000056903693,0.00006661896,0.19730097,0.0015476298,0.7904713,0.010205511,0.000034424487],"about_ca_topic_score_codex":0.0026161552,"about_ca_topic_score_gemma":0.0024681839,"teacher_disagreement_score":0.028396958,"about_ca_system_score_codex":0.0043258257,"about_ca_system_score_gemma":0.0020545872,"threshold_uncertainty_score":0.09499729},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency control; Concurrency; Parallel computing; Programming language","score_opus":0.00973584720965117,"score_gpt":0.21735354425009007,"score_spread":0.2076176970404389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408624168","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013256636,0.13584393,0.2610479,0.0040257187,0.005182542,0.0002834994,0.0008406661,0.003939065,0.58751106],"genre_scores_gemma":[0.033918902,0.08715728,0.10588112,0.0024540469,0.004091243,0.00047031412,0.002345783,0.001517982,0.7621634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989858,0.00010673599,0.000063698266,0.0002237341,0.00054671295,0.00007326097],"domain_scores_gemma":[0.99929047,0.0001939402,0.000034203113,0.00022218016,0.0002038517,0.000055373624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088752,0.001446301,0.001329403,0.0018564457,0.0011388216,0.0043981583,0.0019921798,0.0011807183,0.038018163],"category_scores_gemma":[0.0017983195,0.0008587059,0.0006263246,0.003413603,0.0025533328,0.004146791,0.001914264,0.0031411317,0.026655471],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038286136,0.000057279223,0.00012826787,0.0005121212,0.000022400938,0.0000705543,0.00041163948,0.0014978889,0.0020059152,0.32612798,0.23298183,0.43614578],"study_design_scores_gemma":[0.000010818895,0.000021194835,0.00017582711,0.00023395693,0.0000133562025,0.0002574425,0.00004786092,0.001938778,0.00081421045,0.14567548,0.8507912,0.000019889563],"about_ca_topic_score_codex":0.0023902433,"about_ca_topic_score_gemma":0.0036986065,"teacher_disagreement_score":0.038018163,"about_ca_system_score_codex":0.0014439883,"about_ca_system_score_gemma":0.0017480712,"threshold_uncertainty_score":0.12718344},"labels":[],"label_agreement":null},{"id":"W2415890791","doi":"10.82308/28801","title":"Practical and consistent database replication","year":2007,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Serializability; Database; Data integrity; Scalability; Correctness; Distributed database; Concurrency control; Rollback; Distributed computing; Isolation (microbiology); Distributed transaction; Database transaction; Transaction processing; Programming language","score_opus":0.03687329347380206,"score_gpt":0.2903931522649677,"score_spread":0.2535198587911656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415890791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054651755,0.001273696,0.9656776,0.0016619202,0.0004960215,0.00046565675,0.00032069016,0.0021172808,0.022521874],"genre_scores_gemma":[0.22609735,0.00164553,0.7493341,0.0009901142,0.0006256876,0.0007404123,0.0016232483,0.00047076077,0.018472753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98348075,0.0038133846,0.0016121167,0.0031968853,0.007195075,0.00070174],"domain_scores_gemma":[0.97313064,0.0036521098,0.0011452636,0.015903497,0.0056663114,0.00050225324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008977454,0.0009977435,0.0011415428,0.0010683953,0.0020144505,0.00514792,0.0038058916,0.0026625977,0.008253058],"category_scores_gemma":[0.034356494,0.0011622488,0.0011948227,0.0019574277,0.0024983578,0.00721822,0.005908063,0.003104231,0.005784062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019983052,0.00018693983,0.0020305435,0.0008782403,0.000117175325,0.00048898684,0.0008049139,0.037535813,0.0134100225,0.60184777,0.0369102,0.30558956],"study_design_scores_gemma":[0.00021816128,0.00030205934,0.0007211606,0.00021065885,0.000075911026,0.0018112278,0.0004839097,0.13383102,0.013728318,0.57892233,0.2696004,0.00009477167],"about_ca_topic_score_codex":0.0009317283,"about_ca_topic_score_gemma":0.0009995274,"teacher_disagreement_score":0.008977454,"about_ca_system_score_codex":0.0012652387,"about_ca_system_score_gemma":0.00438253,"threshold_uncertainty_score":0.0474779},"labels":[],"label_agreement":null},{"id":"W2417507107","doi":"10.1145/2897518.2897565","title":"A tight space bound for consensus","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Identifier; Omega; Computer science; Protocol (science); Closing (real estate); Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Computer network; Medicine; Physics","score_opus":0.016285424255716763,"score_gpt":0.24655024952095916,"score_spread":0.2302648252652424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417507107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1352845,0.0075479103,0.75504017,0.017465713,0.0011579742,0.00031164254,0.0015479042,0.0053756903,0.07626855],"genre_scores_gemma":[0.893188,0.002126399,0.080432616,0.0019770414,0.0009532853,0.00095682737,0.0009649124,0.0008077461,0.018593233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864557,0.002976465,0.0007313519,0.0033417428,0.0037264263,0.0027682774],"domain_scores_gemma":[0.9598856,0.024738567,0.0020620625,0.00842588,0.0029178578,0.0019700387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067304224,0.0018357709,0.0028786066,0.0021185584,0.0046054604,0.006613426,0.003976719,0.004103164,0.019492049],"category_scores_gemma":[0.03724137,0.0013521359,0.0021976272,0.0029587862,0.0061737937,0.019010551,0.0117384195,0.008109345,0.00427675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016064582,0.00031493968,0.0013484263,0.00068749243,0.00014406358,0.00034965193,0.0012480351,0.10162169,0.011888471,0.8021835,0.01891257,0.05969473],"study_design_scores_gemma":[0.00020223249,0.00026975945,0.00032380212,0.00008928947,0.000083619714,0.0001497952,0.00024186568,0.18034084,0.004409468,0.80209285,0.0117408205,0.00005562444],"about_ca_topic_score_codex":0.0023935577,"about_ca_topic_score_gemma":0.0019502364,"teacher_disagreement_score":0.019492049,"about_ca_system_score_codex":0.0037845029,"about_ca_system_score_gemma":0.0036935778,"threshold_uncertainty_score":0.06520742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007192279634665803,"score_gpt":0.20564711780255748,"score_spread":0.19845483816789167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423891596","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075814277,0.008046645,0.014162127,0.011174466,0.0065151746,0.0003000429,0.0052731484,0.004981079,0.94196594],"genre_scores_gemma":[0.0442132,0.005275167,0.009417873,0.00302678,0.001162017,0.00020876138,0.0064273514,0.00091896456,0.92934996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987802,0.00016098021,0.00009319326,0.00031197455,0.000484949,0.00016867943],"domain_scores_gemma":[0.99861705,0.00012759818,0.00011665753,0.00029853932,0.00057223235,0.0002678622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116618,0.0010263553,0.000611481,0.0021365026,0.0016342151,0.0040474967,0.0014321937,0.0021631946,0.4147835],"category_scores_gemma":[0.0031993326,0.00034698404,0.0005677755,0.0013525608,0.00075479975,0.002262737,0.002894153,0.0016677935,0.31609377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003886579,0.00016737082,0.0025207598,0.0006582439,0.00003853084,0.0007470043,0.00045821088,0.00064187055,0.004795794,0.05435974,0.388254,0.54696983],"study_design_scores_gemma":[0.000016113598,0.00003267502,0.0008147293,0.00010436021,0.000008114326,0.0004061507,0.000094253635,0.00026962187,0.000965415,0.0030467347,0.99423236,0.000009505781],"about_ca_topic_score_codex":0.0020625247,"about_ca_topic_score_gemma":0.0023882713,"teacher_disagreement_score":0.4147835,"about_ca_system_score_codex":0.0016041473,"about_ca_system_score_gemma":0.0018792411,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2424113023","doi":"10.1109/maes.2016.150117","title":"Aggressive congestion control mechanism for space systems","year":2016,"lang":"en","type":"article","venue":"IEEE Aerospace and Electronic Systems Magazine","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spacecraft; Space (punctuation); The Internet; Space exploration; NASA Deep Space Network; Computer science; Space technology; Space environment; Satellite; Point (geometry); Aerospace engineering; Deep space exploration; Systems engineering; Engineering; Physics","score_opus":0.007366151805799662,"score_gpt":0.21715111292833014,"score_spread":0.20978496112253048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2424113023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055133972,0.0017013073,0.9034124,0.001787163,0.0012067434,0.00035622515,0.00015725345,0.003828332,0.03241661],"genre_scores_gemma":[0.9606071,0.0004415405,0.029501693,0.00038586106,0.00037051633,0.00017819121,0.00010569226,0.00008523372,0.008324138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988876,0.00021052518,0.00006345465,0.00022066467,0.00041153625,0.00020625841],"domain_scores_gemma":[0.9973761,0.000946172,0.00029311934,0.00045825198,0.0006804014,0.00024600778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015051126,0.0007157012,0.00054894754,0.0011814035,0.0014379259,0.0019211483,0.0019105906,0.0009565221,0.0062291687],"category_scores_gemma":[0.005309019,0.00021974984,0.0003649712,0.00073196046,0.0011266024,0.0029115635,0.0016040152,0.0015722482,0.0005982652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004980172,0.00030507625,0.0013024969,0.00037063603,0.00010832595,0.0004905337,0.0006529169,0.19311434,0.025746532,0.60302603,0.03501676,0.13936827],"study_design_scores_gemma":[0.000095421005,0.00015514242,0.00043678275,0.000026681299,0.00004828337,0.00017306877,0.000053330314,0.89266956,0.004493967,0.08069967,0.021099355,0.000048817965],"about_ca_topic_score_codex":0.002790315,"about_ca_topic_score_gemma":0.0022027758,"teacher_disagreement_score":0.0062291687,"about_ca_system_score_codex":0.0014448907,"about_ca_system_score_gemma":0.0013093781,"threshold_uncertainty_score":0.020838618},"labels":[],"label_agreement":null},{"id":"W2425734003","doi":"10.1109/icde.2016.7498354","title":"WatCA: The Waterloo consistency analyzer","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Consistency (knowledge bases); Correctness; Data consistency; Eventual consistency; Replication (statistics); Key (lock); Consistency model; Distributed computing; Software; Cache coherence; Strong consistency; Variety (cybernetics); Weak consistency; Computer data storage; Operating system; Programming language","score_opus":0.010989945045720224,"score_gpt":0.21307388019892265,"score_spread":0.20208393515320242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2425734003","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008199883,0.00093208416,0.44110745,0.00075973826,0.000429298,0.0007997055,0.0142845465,0.47672772,0.056759626],"genre_scores_gemma":[0.13771255,0.0011774853,0.7073657,0.0012480613,0.00029877355,0.001704235,0.04256442,0.04919545,0.058733296],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953679,0.00058023,0.0004861193,0.0009273261,0.002143855,0.0004945838],"domain_scores_gemma":[0.991799,0.0018724671,0.0006048601,0.0016908926,0.0037218272,0.00031099876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031227681,0.001659068,0.0011205998,0.005728731,0.0016228225,0.004626981,0.0043214206,0.0009915705,0.044809334],"category_scores_gemma":[0.014618335,0.0020374476,0.0011405097,0.0035370323,0.0010932471,0.0064591123,0.002350162,0.0024793714,0.016778449],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007464576,0.00026545065,0.009470105,0.0007858108,0.00024994768,0.0002707629,0.0004965094,0.007030179,0.0134214545,0.056959208,0.62640876,0.28389537],"study_design_scores_gemma":[0.00053817075,0.00012397644,0.0043161777,0.0003158045,0.00021596154,0.00041086593,0.00032587134,0.25649282,0.05150579,0.05177537,0.63371485,0.00026435772],"about_ca_topic_score_codex":0.06518877,"about_ca_topic_score_gemma":0.07209944,"teacher_disagreement_score":0.06518877,"about_ca_system_score_codex":0.0031919882,"about_ca_system_score_gemma":0.008585514,"threshold_uncertainty_score":0.14990216},"labels":[],"label_agreement":null},{"id":"W2466649529","doi":"10.1145/2935764.2935796","title":"Investigating the Performance of Hardware Transactions on a Multi-Socket Machine","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Transactional memory; Bandwidth throttling; Lock (firearm); Thread (computing); Operating system; Synchronization (alternating current); Speculative execution; Hypervisor; Embedded system; Yarn; Computer hardware; Parallel computing; Database transaction; Cloud computing; Virtualization; Database; Computer network","score_opus":0.024632379117382034,"score_gpt":0.24429478477309274,"score_spread":0.2196624056557107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466649529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941057,0.00017035783,0.004097322,0.000055324337,0.000023607527,0.000020017056,0.000062245024,0.0002754392,0.0011899002],"genre_scores_gemma":[0.99750865,0.00004643962,0.0019999163,0.000006177021,0.000006809683,0.0000075887124,0.00006529043,0.000025381274,0.00033383697],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983354,0.00038285612,0.00012786986,0.00025879094,0.00059612043,0.00029907],"domain_scores_gemma":[0.99382246,0.0028976777,0.0005396705,0.0012372984,0.001159191,0.00034380626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014326082,0.00060649635,0.0005452164,0.00063515885,0.0005863335,0.000979674,0.00083320803,0.00050695334,0.0017895765],"category_scores_gemma":[0.008138612,0.00030223542,0.00026858653,0.0014766537,0.0007504606,0.0021465558,0.000599693,0.00088463293,0.00028536635],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004731216,0.0018328786,0.109984465,0.0008497733,0.00031181716,0.0013983715,0.0015547946,0.3448521,0.37719327,0.014779165,0.0047524953,0.1377597],"study_design_scores_gemma":[0.000080129976,0.0013721302,0.019207988,0.000015569363,0.00004167591,0.00020953418,0.00029690462,0.8966827,0.07853347,0.002438089,0.0010852477,0.000036638412],"about_ca_topic_score_codex":0.0016361192,"about_ca_topic_score_gemma":0.0010590153,"teacher_disagreement_score":0.0017895765,"about_ca_system_score_codex":0.0007153497,"about_ca_system_score_gemma":0.0005873353,"threshold_uncertainty_score":0.0075764656},"labels":[],"label_agreement":null},{"id":"W2468139380","doi":"","title":"Stabilizing Consensus with the Power of Two Choices","year":2010,"lang":"en","type":"article","venue":"Dagstuhl Seminar Proceedings","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Adversarial system; Bounded function; Commit; Adversary; Consensus; Uniform consensus; Value (mathematics); Point (geometry); Simple (philosophy); Computer science; Upper and lower bounds; Discrete mathematics; State (computer science); Combinatorics; Binary logarithm; Mathematics; Mathematical economics; Multi-agent system; Algorithm; Artificial intelligence; Computer security; Statistics","score_opus":0.008231374927955223,"score_gpt":0.241416463779167,"score_spread":0.23318508885121178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468139380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04765029,0.0005460007,0.9279261,0.001997203,0.00017768555,0.00013669292,0.00014412338,0.00056822813,0.020853586],"genre_scores_gemma":[0.8326928,0.0004465639,0.14780872,0.0006043305,0.00022161704,0.00040335895,0.00024415378,0.00024199493,0.017336449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99147475,0.0030990394,0.00052975625,0.001826139,0.0022357942,0.00083461276],"domain_scores_gemma":[0.971753,0.01956666,0.0013741883,0.0047043604,0.0014525483,0.0011492432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067752427,0.0010146744,0.0016752811,0.0011822494,0.001634331,0.0033105623,0.0021626987,0.0025045006,0.0063090795],"category_scores_gemma":[0.02918198,0.0008456369,0.0014137587,0.0010962485,0.0054196725,0.0060772686,0.006300548,0.0038278277,0.0014392355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007004168,0.00009682806,0.00085946923,0.00021337296,0.0001461352,0.00061572465,0.0007858575,0.14665051,0.0043081976,0.81335026,0.0031955454,0.029077757],"study_design_scores_gemma":[0.00014709152,0.000056135024,0.0000697973,0.000033821852,0.000031219213,0.00007954692,0.00007255972,0.3252959,0.0012157233,0.6695413,0.0034207306,0.000036154153],"about_ca_topic_score_codex":0.0007983384,"about_ca_topic_score_gemma":0.0008435389,"teacher_disagreement_score":0.0067752427,"about_ca_system_score_codex":0.0014677995,"about_ca_system_score_gemma":0.0014994394,"threshold_uncertainty_score":0.035831332},"labels":[],"label_agreement":null},{"id":"W2468564096","doi":"10.1093/logcom/exv031","title":"A modal separation logic for resource dynamics","year":2015,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Separation logic; Computer science; Modal logic; Modal; Dynamic logic (digital electronics); Resource (disambiguation); Epistemic modal logic; Theoretical computer science; Algorithm; Multimodal logic; Description logic; Engineering","score_opus":0.04541417762651414,"score_gpt":0.31910102263639717,"score_spread":0.27368684500988305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468564096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076998253,0.00043231706,0.9779984,0.0009444866,0.00014466065,0.00008496979,0.00022335505,0.000615133,0.01185683],"genre_scores_gemma":[0.33254611,0.0007715883,0.64998245,0.0013564862,0.0002833672,0.0003475818,0.00050515734,0.00020843654,0.013998751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984798,0.00033629822,0.00014007582,0.00033225285,0.0005182798,0.00019334687],"domain_scores_gemma":[0.99875546,0.0006327893,0.00010853965,0.00011104929,0.0002817929,0.00011032821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941621,0.000730785,0.000499278,0.0012374305,0.0017788792,0.0028625028,0.0013414072,0.0012005554,0.0052716457],"category_scores_gemma":[0.0028669147,0.0004520913,0.0012787458,0.0014113104,0.0026325001,0.006612677,0.002843283,0.003353184,0.0007339393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005834732,0.0000310732,0.00009573355,0.00009717346,0.000013756127,0.00012105734,0.00025483896,0.0042052744,0.0042491076,0.9678541,0.0015697246,0.021449814],"study_design_scores_gemma":[0.000059986287,0.000049319944,0.00009897172,0.00005381466,0.00005250281,0.00021762142,0.00013372304,0.06654484,0.0062978985,0.8984457,0.028002815,0.000042756677],"about_ca_topic_score_codex":0.00362665,"about_ca_topic_score_gemma":0.0030604636,"teacher_disagreement_score":0.0052716457,"about_ca_system_score_codex":0.0024058016,"about_ca_system_score_gemma":0.002140579,"threshold_uncertainty_score":0.017635405},"labels":[],"label_agreement":null},{"id":"W2475512092","doi":"10.1145/2933057.2933115","title":"Are Shared Objects Composable under an Oblivious Adversary?","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Linearizability; Adversary; Object (grammar); Probabilistic logic; Distributed computing; Theoretical computer science; Algorithm; Computer security; Artificial intelligence","score_opus":0.022936845519653644,"score_gpt":0.2455375012105283,"score_spread":0.22260065569087467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475512092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19100928,0.00078940747,0.7665833,0.015068853,0.00031688364,0.00025751034,0.00027369073,0.001285376,0.024415677],"genre_scores_gemma":[0.9505385,0.0005614156,0.039906777,0.0013632353,0.00033904793,0.00026398228,0.00016770711,0.00019098965,0.0066684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9891017,0.002352667,0.0004817784,0.002505499,0.0037324547,0.0018259011],"domain_scores_gemma":[0.9604872,0.015999196,0.005334681,0.01558712,0.0013951461,0.0011965196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060032825,0.000643597,0.0019167637,0.0007124745,0.002949595,0.006026346,0.0025628046,0.0050196135,0.004735452],"category_scores_gemma":[0.031444322,0.0013436723,0.0016721761,0.0010199662,0.009324441,0.02625468,0.005177539,0.005128982,0.0012500124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010138747,0.0001789566,0.0051842057,0.0001663779,0.00031799974,0.00069191924,0.0015128956,0.045356993,0.005229719,0.9028815,0.0035994803,0.033866],"study_design_scores_gemma":[0.000088162175,0.00006986844,0.0005160797,0.000036485882,0.00005497667,0.0002432303,0.0002615205,0.0755953,0.0041327993,0.9135658,0.0053970097,0.000038664653],"about_ca_topic_score_codex":0.000823172,"about_ca_topic_score_gemma":0.0004607666,"teacher_disagreement_score":0.006026346,"about_ca_system_score_codex":0.0021516155,"about_ca_system_score_gemma":0.0016586644,"threshold_uncertainty_score":0.031748712},"labels":[],"label_agreement":null},{"id":"W2481199248","doi":"10.1145/2933057.2933087","title":"Recoverable Mutual Exclusion","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Critical section; Lock (firearm); Robustness (evolution); Process (computing); Code (set theory); Distributed computing; Operating system; Programming language; Engineering","score_opus":0.00963252774622098,"score_gpt":0.21324823268767798,"score_spread":0.203615704941457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481199248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02345419,0.0019598391,0.8843715,0.0015336628,0.000548921,0.00029022622,0.00075258064,0.00972508,0.077363946],"genre_scores_gemma":[0.77474284,0.0015955725,0.15432805,0.00075750746,0.00048485651,0.00050636,0.0014052264,0.0008492464,0.065330364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760664,0.00041261516,0.00009158061,0.0004215212,0.0010086044,0.0004590263],"domain_scores_gemma":[0.9968274,0.0007635643,0.00037946465,0.0014352519,0.0004477587,0.00014660181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010128529,0.0006176417,0.0007865236,0.00061733095,0.0012152935,0.001566146,0.0024639422,0.0011235339,0.01331135],"category_scores_gemma":[0.005678038,0.00030074164,0.00051479466,0.0006180822,0.0015731369,0.0024139143,0.004291416,0.0015584367,0.0043843533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005738163,0.00011681434,0.0006855792,0.00042286658,0.00008437493,0.00059902214,0.00039756723,0.06618287,0.015566534,0.62218106,0.037729267,0.2554603],"study_design_scores_gemma":[0.00013877814,0.000119119875,0.0003464317,0.00009132941,0.000044268258,0.00055055,0.00008465751,0.22831678,0.021278543,0.6079908,0.14097054,0.00006818283],"about_ca_topic_score_codex":0.00090013957,"about_ca_topic_score_gemma":0.0011332477,"teacher_disagreement_score":0.01331135,"about_ca_system_score_codex":0.00089536095,"about_ca_system_score_gemma":0.0014311561,"threshold_uncertainty_score":0.044530928},"labels":[],"label_agreement":null},{"id":"W2484233765","doi":"10.22215/etd/2007-06184","title":"Performance modeling of replication techniques in parallel and distributed layered service architectures","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Replication (statistics); Computer science; Distributed computing; Mathematics; Statistics","score_opus":0.016772917281752134,"score_gpt":0.28640068574884775,"score_spread":0.26962776846709563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484233765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39432436,0.0014724076,0.5855091,0.0009887817,0.00013392199,0.00018478064,0.00021674507,0.0014000917,0.015769795],"genre_scores_gemma":[0.95439845,0.00039273215,0.040816616,0.00003707805,0.00004060717,0.00009667283,0.0001390067,0.00011716036,0.0039616507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991787,0.00031313387,0.00004852829,0.0000864378,0.00026039974,0.00011279702],"domain_scores_gemma":[0.9970393,0.0017322705,0.00023303855,0.00030473483,0.00060387637,0.00008669682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766067,0.0005521986,0.00047722092,0.0005458005,0.0004099063,0.0015360444,0.0014004289,0.0008749265,0.0020283232],"category_scores_gemma":[0.0071252296,0.00038595079,0.0005776588,0.0005949172,0.00043359905,0.0014204802,0.00054439355,0.00070889783,0.00041320268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009789595,0.000057807774,0.00094840006,0.000035301106,0.000016977228,0.00002390224,0.000065563276,0.97520643,0.0029562656,0.007288031,0.00034761656,0.012955746],"study_design_scores_gemma":[0.000002596426,0.000013735419,0.0000673426,0.0000013725407,0.0000034646175,0.0000037220184,0.0000050403683,0.99849164,0.00039211777,0.0008889804,0.00012794184,0.0000020862349],"about_ca_topic_score_codex":0.011000536,"about_ca_topic_score_gemma":0.0050147194,"teacher_disagreement_score":0.011000536,"about_ca_system_score_codex":0.0018570942,"about_ca_system_score_gemma":0.0013047843,"threshold_uncertainty_score":0.021873057},"labels":[],"label_agreement":null},{"id":"W2485506858","doi":"10.2316/journal.201.2016.2.201-2778","title":"FORMATION CONTROL AND ROLE ASSIGNMENT OF AUTONOMOUS MOBILE ROBOTS IN UNSTRUCTURED ENVIRONMENT","year":2016,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mobile robot; Obstacle; Robot; Obstacle avoidance; Holonomic; Computer science; Formalism (music); Petri net; Distributed computing; Control engineering; Robot control; Artificial intelligence; Engineering","score_opus":0.005516616313445586,"score_gpt":0.19167190754682448,"score_spread":0.1861552912333789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485506858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2640361,0.00041712125,0.72494054,0.000505373,0.00021042705,0.000052379684,0.00004115699,0.00019657421,0.0096004205],"genre_scores_gemma":[0.9799875,0.00015374958,0.014336029,0.000026707536,0.000047783178,0.000028373684,0.000029606023,0.000017176193,0.005372915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987173,0.000032006184,0.000003690224,0.000034188102,0.000033352848,0.000024959032],"domain_scores_gemma":[0.99973327,0.00010153507,0.00005622335,0.00002248086,0.00004845046,0.000037984835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025094382,0.00032775424,0.00045200853,0.00020945068,0.00041891128,0.00057039206,0.00058607484,0.000338143,0.0013346646],"category_scores_gemma":[0.0013922931,0.00015431276,0.00019189274,0.00019711735,0.0008480844,0.00043473285,0.0006915415,0.0004923682,0.00015224903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020508404,0.000068159774,0.000849101,0.00005768487,0.000017281363,0.00011688201,0.00023945289,0.90900123,0.0128205465,0.024344534,0.0015804803,0.050699525],"study_design_scores_gemma":[0.000010526189,0.00004401512,0.00024321616,0.0000021809801,0.0000025570125,0.000013291497,0.000035038076,0.99084115,0.0008208925,0.00759652,0.00038704803,0.0000036420472],"about_ca_topic_score_codex":0.0035527826,"about_ca_topic_score_gemma":0.0026301914,"teacher_disagreement_score":0.0035527826,"about_ca_system_score_codex":0.00030660562,"about_ca_system_score_gemma":0.00045152145,"threshold_uncertainty_score":0.0070642233},"labels":[],"label_agreement":null},{"id":"W2486562057","doi":"10.4018/978-1-59140-935-9.ch012","title":"Toward Autonomic DBMSs","year":2006,"lang":"en","type":"book-chapter","venue":"Advances in database research (ADR) book series/Advances in database research series","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Control reconfiguration; Key (lock); Database; Database administrator; Database transaction; Distributed computing; Autonomic computing; Set (abstract data type); Class (philosophy); Greedy algorithm; Algorithm; Operating system; Cloud computing; Artificial intelligence; Programming language; Embedded system","score_opus":0.0686776269295327,"score_gpt":0.3809128945607399,"score_spread":0.3122352676312072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486562057","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066572516,0.016683651,0.9060734,0.006117809,0.0014793553,0.00022421806,0.00015499422,0.00424665,0.05836265],"genre_scores_gemma":[0.03826881,0.013854988,0.9160856,0.0019398477,0.0009283401,0.00027504313,0.00056076644,0.0005336423,0.027552942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841857,0.0003020197,0.00010666226,0.00024781373,0.0008209708,0.00010398525],"domain_scores_gemma":[0.99902225,0.00023485674,0.000058561913,0.0002603701,0.0003045368,0.00011939955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024956295,0.00065767684,0.0006375527,0.0009027843,0.0010786323,0.005192326,0.002413595,0.0018462156,0.005303525],"category_scores_gemma":[0.004013256,0.0010581752,0.0007536239,0.0015001511,0.0009769337,0.006400242,0.0029745644,0.004745092,0.0037250766],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036278303,0.00009039004,0.0007651324,0.0003797569,0.00004168338,0.00015675777,0.00051624945,0.012872363,0.005443942,0.6139942,0.039855175,0.32584798],"study_design_scores_gemma":[0.0000340979,0.00006642867,0.0003735635,0.0003393678,0.000027836,0.00046770714,0.0001971207,0.06996619,0.0037950492,0.32862857,0.59607255,0.0000314484],"about_ca_topic_score_codex":0.0008847754,"about_ca_topic_score_gemma":0.001317247,"teacher_disagreement_score":0.005303525,"about_ca_system_score_codex":0.0011353316,"about_ca_system_score_gemma":0.0010697193,"threshold_uncertainty_score":0.017742097},"labels":[],"label_agreement":null},{"id":"W2494626219","doi":"10.1007/978-3-319-49259-9","title":"Stabilization, Safety, and Security of Distributed Systems","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer security; Computer science; Business","score_opus":0.007605438438604697,"score_gpt":0.22615077781393392,"score_spread":0.21854533937532922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494626219","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030920034,0.09247642,0.4423964,0.007018544,0.0039572543,0.0000785923,0.00037049092,0.0019630003,0.42081922],"genre_scores_gemma":[0.5501996,0.050849836,0.058702547,0.00090537075,0.004640313,0.000222448,0.00066490547,0.00048707082,0.33332783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997416,0.000027809487,0.000010175765,0.000045883728,0.00015363329,0.00002089254],"domain_scores_gemma":[0.99967754,0.00013815993,0.000025910858,0.00006557194,0.00006731426,0.000025580428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020576967,0.00059258315,0.00038814565,0.0006409437,0.00042528068,0.0013724765,0.00046200556,0.00044395425,0.0056726374],"category_scores_gemma":[0.0009178971,0.0002497787,0.00023751523,0.00084394455,0.0012861217,0.0015942809,0.000811071,0.0014884482,0.0017773946],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011100217,0.000057528436,0.00022429021,0.000373752,0.000020476395,0.0000719397,0.00033228056,0.025780369,0.008927399,0.59022915,0.057913825,0.31595805],"study_design_scores_gemma":[0.00002623768,0.000075061784,0.00032593973,0.00009650494,0.000014503744,0.00012426023,0.000066885856,0.028335635,0.0022738848,0.7929028,0.17574485,0.000013364801],"about_ca_topic_score_codex":0.0006485621,"about_ca_topic_score_gemma":0.00035650848,"teacher_disagreement_score":0.0056726374,"about_ca_system_score_codex":0.00054834806,"about_ca_system_score_gemma":0.00065744127,"threshold_uncertainty_score":0.018976867},"labels":[],"label_agreement":null},{"id":"W2497964538","doi":"10.1145/2933057.2933078","title":"Brief Announcement","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Identifier; Computer science; Process (computing); Computer network; Programming language","score_opus":0.01064864341141926,"score_gpt":0.21822121876327222,"score_spread":0.20757257535185294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497964538","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014588154,0.022814278,0.0037618591,0.179742,0.5402931,0.0004089459,0.0049135326,0.0013330393,0.24527445],"genre_scores_gemma":[0.015030395,0.02232733,0.0024637303,0.07495009,0.15265615,0.00043279873,0.0048902757,0.00039630482,0.7268529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975261,0.0003502761,0.00014844649,0.00051525765,0.0010387056,0.00042129506],"domain_scores_gemma":[0.99152946,0.0010273359,0.00032633072,0.0005538746,0.0032186268,0.0033443614],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026028026,0.0010404156,0.0008789674,0.001252511,0.0021500497,0.004047941,0.0027287262,0.007901384,0.31901485],"category_scores_gemma":[0.011666347,0.00037679734,0.0009447168,0.0008677829,0.0008458223,0.0028412056,0.0025156396,0.004736823,0.18940192],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014782722,0.000050912866,0.00013943415,0.00025804006,0.000008442236,0.00019628894,0.000029122508,0.00004631529,0.0004536012,0.004915729,0.95251036,0.04124397],"study_design_scores_gemma":[0.000016829408,0.00004462717,0.00019189726,0.00008437293,0.000007711468,0.00016496275,0.000040772,0.000028151426,0.00026183133,0.0014100838,0.99774086,0.000007878606],"about_ca_topic_score_codex":0.0012573979,"about_ca_topic_score_gemma":0.0021527861,"teacher_disagreement_score":0.68098515,"about_ca_system_score_codex":0.0021149223,"about_ca_system_score_gemma":0.0038104395,"threshold_uncertainty_score":0.9713427},"labels":[],"label_agreement":null},{"id":"W2498851521","doi":"10.1145/2933057.2933111","title":"An Algorithm for Replicated Objects with Efficient Reads","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Object (grammar); Distributed computing; Lock (firearm); Message passing; Distributed object; Interval (graph theory); Process (computing); Algorithm; Parallel computing; Theoretical computer science; Programming language; Common Object Request Broker Architecture; Mathematics; Artificial intelligence","score_opus":0.008926375070764941,"score_gpt":0.2429389202860076,"score_spread":0.23401254521524267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498851521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036251673,0.00029278357,0.9842966,0.00046287643,0.00023339558,0.0003519919,0.00017981468,0.0034435063,0.0071138814],"genre_scores_gemma":[0.07515468,0.00018538852,0.90612197,0.0003069302,0.0001495884,0.00074039877,0.00082073594,0.0007640917,0.015756221],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969236,0.0007737408,0.00026894378,0.00071812654,0.001017279,0.00029822643],"domain_scores_gemma":[0.99614704,0.0012640448,0.00020262566,0.0014635883,0.0007760926,0.0001465659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023543302,0.0013135874,0.0014829201,0.001116597,0.0021176564,0.003975248,0.0042621307,0.0026199839,0.01924093],"category_scores_gemma":[0.009480715,0.00088495325,0.0012064725,0.0015551352,0.0014534405,0.006638465,0.004748223,0.002212101,0.00696131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010405065,0.00037625898,0.001151326,0.00067093107,0.00017348772,0.00042391493,0.00059807993,0.0712234,0.009991167,0.27686727,0.0483354,0.5891483],"study_design_scores_gemma":[0.0007897418,0.00029645444,0.00029169416,0.00014750611,0.00012802203,0.00062933995,0.00030690877,0.50440365,0.015723703,0.40682185,0.07034095,0.00012017808],"about_ca_topic_score_codex":0.0014702127,"about_ca_topic_score_gemma":0.0019842866,"teacher_disagreement_score":0.01924093,"about_ca_system_score_codex":0.0014593718,"about_ca_system_score_gemma":0.002629911,"threshold_uncertainty_score":0.064367354},"labels":[],"label_agreement":null},{"id":"W2502078092","doi":"10.1007/978-3-319-21741-3","title":"Stabilization, Safety, and Security of Distributed Systems","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Computer security; Distributed computing","score_opus":0.010965314054209285,"score_gpt":0.23697484148915335,"score_spread":0.22600952743494407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502078092","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030330988,0.09825991,0.44860694,0.006866052,0.0039699287,0.00008047915,0.0003589678,0.0019432802,0.40958354],"genre_scores_gemma":[0.55721116,0.0551135,0.059593905,0.00093275384,0.0048866635,0.00023295265,0.00064929936,0.00047555342,0.32090423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973613,0.000028759187,0.000010167639,0.000045929533,0.00015756804,0.000021456643],"domain_scores_gemma":[0.9996587,0.0001506724,0.00002706309,0.00006815792,0.00006907652,0.000026354917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190334,0.000600006,0.0004098391,0.0006464685,0.00042154035,0.0013631553,0.00047622525,0.00043496268,0.0052876403],"category_scores_gemma":[0.0009512369,0.00026183508,0.00024708582,0.00088309596,0.00134882,0.0016170933,0.00080102263,0.0015409045,0.0016418681],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010926595,0.000056694756,0.00023024046,0.00036834032,0.000021830863,0.00006741587,0.00031804136,0.027498579,0.008125887,0.58844936,0.059327852,0.31542647],"study_design_scores_gemma":[0.000026963571,0.00007355528,0.00033007833,0.000098346965,0.0000147379205,0.000111112844,0.000062509505,0.02882175,0.0020521218,0.80460614,0.16378939,0.00001328102],"about_ca_topic_score_codex":0.00070055586,"about_ca_topic_score_gemma":0.0003782057,"teacher_disagreement_score":0.0052876403,"about_ca_system_score_codex":0.00057543576,"about_ca_system_score_gemma":0.0006623227,"threshold_uncertainty_score":0.01768893},"labels":[],"label_agreement":null},{"id":"W2506347696","doi":"10.1145/2933057.2933123","title":"Concurrent Data Structures","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrent data structure; Construct (python library); Data structure; Component (thermodynamics); Distributed computing; Lock (firearm); Process (computing); Concurrency control; Data access; Simple (philosophy); Concurrency; Programming language","score_opus":0.05550809640821099,"score_gpt":0.2929852147392835,"score_spread":0.23747711833107252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506347696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005126471,0.0066177486,0.93847924,0.002547761,0.0016937687,0.00078285125,0.0011819563,0.0048606396,0.038709544],"genre_scores_gemma":[0.1190453,0.009577905,0.8245375,0.0021620593,0.002507582,0.0017737772,0.003520825,0.0021676202,0.034707353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98967487,0.0018008162,0.0013620094,0.0013986969,0.0051760506,0.00058746914],"domain_scores_gemma":[0.9849429,0.0047713006,0.0010956606,0.005342411,0.0032099923,0.0006377157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054914514,0.0012239821,0.0014007083,0.0024243768,0.0033039371,0.009667637,0.0036460354,0.0023188605,0.011787731],"category_scores_gemma":[0.022161148,0.0014096247,0.0017227869,0.004200939,0.005045941,0.013530112,0.0062375367,0.004218245,0.006202209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083533,0.00006270399,0.00050225307,0.00054961094,0.000052417887,0.00017329102,0.00062335434,0.0030077344,0.0023615556,0.8771969,0.018010104,0.09737649],"study_design_scores_gemma":[0.000069893555,0.000091875714,0.00012228588,0.00025988178,0.00005667185,0.0004920551,0.00014282292,0.010150496,0.0061456114,0.6005881,0.38182196,0.00005835494],"about_ca_topic_score_codex":0.0014287967,"about_ca_topic_score_gemma":0.0013801904,"teacher_disagreement_score":0.011787731,"about_ca_system_score_codex":0.0021711509,"about_ca_system_score_gemma":0.0041136,"threshold_uncertainty_score":0.039433956},"labels":[],"label_agreement":null},{"id":"W2507880456","doi":"10.1145/2993231.2993235","title":"Efficient SQL querying on embedded devices using pre-compilation","year":2016,"lang":"en","type":"article","venue":"ACM SIGAPP Applied Computing Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Initialization; Overhead (engineering); Mobile device; SQL; Relational database management system; Compiler; Database; Embedded system; Relational database; Operating system; Programming language","score_opus":0.029031963488662587,"score_gpt":0.297770857721368,"score_spread":0.2687388942327054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507880456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09182461,0.0009781425,0.78217244,0.00031270663,0.00013245328,0.0003285972,0.00082800596,0.11066207,0.012760918],"genre_scores_gemma":[0.526013,0.000954816,0.44932064,0.0004962068,0.00011939827,0.0002829551,0.0032601384,0.008801489,0.010751365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862385,0.00022660533,0.00015892912,0.0003119052,0.00052567717,0.00015299887],"domain_scores_gemma":[0.9960659,0.0014304039,0.00020165571,0.0016235241,0.00061069336,0.00006781743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746785,0.0012205748,0.00067899725,0.00067374954,0.00049229333,0.0015151115,0.0018946157,0.00034034823,0.0034228943],"category_scores_gemma":[0.0030642238,0.0007051942,0.00083687063,0.0010352505,0.0006505573,0.0021446876,0.001216706,0.0011348856,0.0018084035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082974887,0.00046022047,0.006338584,0.0009319185,0.00012711258,0.0008563431,0.0010439894,0.027088292,0.17314593,0.016042102,0.026187032,0.74694866],"study_design_scores_gemma":[0.0002956337,0.00061805657,0.0070465435,0.00016261677,0.0002247534,0.001213788,0.00055531645,0.39469895,0.5204137,0.016515603,0.058100622,0.00015434955],"about_ca_topic_score_codex":0.0026257406,"about_ca_topic_score_gemma":0.0036647723,"teacher_disagreement_score":0.0034228943,"about_ca_system_score_codex":0.0005337839,"about_ca_system_score_gemma":0.001455352,"threshold_uncertainty_score":0.011450708},"labels":[],"label_agreement":null},{"id":"W2508181594","doi":"","title":"Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Space (punctuation); Theoretical computer science; Computer network","score_opus":0.0212865957930315,"score_gpt":0.24472290542699277,"score_spread":0.22343630963396127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508181594","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018792076,0.056894105,0.2858032,0.35076898,0.21069908,0.0002603877,0.004364218,0.0055853836,0.06683249],"genre_scores_gemma":[0.45226404,0.038225356,0.06949438,0.04099342,0.26768184,0.00095224695,0.005382127,0.002377815,0.1226288],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99371487,0.0017300629,0.00033169755,0.0011530744,0.0022351728,0.0008351442],"domain_scores_gemma":[0.9738462,0.016627891,0.00094173366,0.0017539705,0.004799087,0.0020310644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070376093,0.0020804596,0.0024534015,0.0023341165,0.002885893,0.005849636,0.0028139467,0.0055855187,0.026117727],"category_scores_gemma":[0.03757741,0.0014119612,0.0011976268,0.0036545594,0.0035947345,0.013878023,0.0034245963,0.011495766,0.0089963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011296648,0.000097249685,0.00031454692,0.0010569213,0.0000933062,0.00024032587,0.00026101177,0.0077456245,0.002532723,0.23693092,0.67612046,0.0734773],"study_design_scores_gemma":[0.0002765423,0.00036939126,0.00065445167,0.0002580646,0.0001990069,0.00030463026,0.00025803677,0.035898924,0.0043529016,0.62858504,0.32863423,0.00020886355],"about_ca_topic_score_codex":0.0017369715,"about_ca_topic_score_gemma":0.0013267284,"teacher_disagreement_score":0.026117727,"about_ca_system_score_codex":0.0036146545,"about_ca_system_score_gemma":0.0029272633,"threshold_uncertainty_score":0.08737242},"labels":[],"label_agreement":null},{"id":"W2509335285","doi":"10.1007/978-3-662-53426-7_32","title":"Upper Bounds for Boundless Tagging with Bounded Objects","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Computer science; Mathematics; Mathematical analysis","score_opus":0.012222769239287636,"score_gpt":0.23689799484546392,"score_spread":0.22467522560617628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509335285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010866385,0.0030564743,0.9344525,0.0026002137,0.0007836447,0.00018698859,0.000959192,0.003302664,0.04379188],"genre_scores_gemma":[0.41622213,0.0069779945,0.49558613,0.004309473,0.004429544,0.001513753,0.00562373,0.008186273,0.0571509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96556526,0.005459818,0.0022855862,0.0058126994,0.013717925,0.007158643],"domain_scores_gemma":[0.84030175,0.102278255,0.004867464,0.035410196,0.0113742035,0.0057681203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01649953,0.0060841595,0.006173674,0.008516897,0.006705185,0.0188352,0.01932932,0.007976792,0.029451557],"category_scores_gemma":[0.099195614,0.004737974,0.0055025327,0.009772763,0.010618868,0.05292545,0.023797764,0.01863228,0.013427453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075566926,0.00029846682,0.0009794189,0.00069807447,0.00011765503,0.00022805062,0.00062429975,0.042389747,0.0037771591,0.8602591,0.018784722,0.07108758],"study_design_scores_gemma":[0.000026596334,0.000056122863,0.00016289014,0.00017473444,0.00011778367,0.00017767967,0.00007383004,0.08421112,0.0026477275,0.9051318,0.007152444,0.00006722237],"about_ca_topic_score_codex":0.0025814665,"about_ca_topic_score_gemma":0.0028420219,"teacher_disagreement_score":0.029451557,"about_ca_system_score_codex":0.008200109,"about_ca_system_score_gemma":0.0059262044,"threshold_uncertainty_score":0.098525226},"labels":[],"label_agreement":null},{"id":"W2516467118","doi":"","title":"Local-spin abortable mutual exclusion","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Critical section; Suzuki-Kasami algorithm; Abort; Bounded function; Queue; Computer science; Mathematics; Theoretical computer science; Algorithm; Distributed computing; Computer network","score_opus":0.012697428747762795,"score_gpt":0.25432818058442247,"score_spread":0.24163075183665966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516467118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02649288,0.00031024907,0.94040763,0.00026372567,0.00015119641,0.00016129256,0.00014292971,0.006214327,0.025855739],"genre_scores_gemma":[0.6012853,0.0003877292,0.3563164,0.0005053693,0.00012346692,0.00041231973,0.00091947336,0.0015697882,0.038480166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978865,0.000345475,0.00013645864,0.00039181847,0.0008026478,0.00043718264],"domain_scores_gemma":[0.9955136,0.001140208,0.00031079326,0.0018548272,0.0009623497,0.00021814152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013358976,0.0007117101,0.00093151437,0.00063635403,0.0017395142,0.002334797,0.0029604493,0.00074170384,0.008604811],"category_scores_gemma":[0.005036742,0.00039217836,0.00069778203,0.0007876562,0.0015399086,0.0032526369,0.003514249,0.00194943,0.0024359468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011245706,0.00025991333,0.0041801482,0.0005808492,0.000121122,0.0005018919,0.0015510196,0.045809597,0.02284449,0.5097733,0.025482543,0.38777056],"study_design_scores_gemma":[0.00023254547,0.00043667154,0.00092754385,0.00012299338,0.000154333,0.0006472901,0.00054584775,0.5674672,0.084593244,0.23384604,0.1108775,0.00014882738],"about_ca_topic_score_codex":0.0034071172,"about_ca_topic_score_gemma":0.007246647,"teacher_disagreement_score":0.008604811,"about_ca_system_score_codex":0.0012926162,"about_ca_system_score_gemma":0.0019537087,"threshold_uncertainty_score":0.028786004},"labels":[],"label_agreement":null},{"id":"W2521857543","doi":"10.4204/eptcs.222","title":"Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, Québec City, Canada, 22nd August 2016","year":2016,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Computer science; Programming language; Operational semantics; Semantics (computer science); Petri net; Field (mathematics); Formal semantics (linguistics); Concurrent object-oriented programming; Software engineering; Programming paradigm; Declarative programming; Mathematics; Inductive programming","score_opus":0.007193294609170283,"score_gpt":0.2506999194488999,"score_spread":0.24350662483972962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521857543","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013539393,0.058410138,0.28842348,0.03664887,0.03535108,0.0010048208,0.01636002,0.009681011,0.5405812],"genre_scores_gemma":[0.039085895,0.023727806,0.074550316,0.0023726358,0.002558055,0.00042900874,0.01661578,0.003366649,0.837294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967489,0.0004318475,0.0001487805,0.00042464663,0.001832279,0.00041360367],"domain_scores_gemma":[0.99531436,0.0006218573,0.00006272281,0.0005328803,0.0028063327,0.0006618077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004690494,0.001592186,0.0019061465,0.0017437688,0.0027350865,0.0074415477,0.0025759412,0.0011975414,0.1186886],"category_scores_gemma":[0.0056524957,0.00090163277,0.0012553433,0.0019382539,0.0033626056,0.0034012434,0.0033551797,0.0033409488,0.023410697],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002453494,0.00013588172,0.0009063936,0.0003657261,0.00006515083,0.00018555904,0.0007738424,0.0026498467,0.004129471,0.054515284,0.72607166,0.20995583],"study_design_scores_gemma":[0.000026805305,0.000025292396,0.0009521063,0.00022078848,0.000022055372,0.00010623513,0.00028507863,0.00332252,0.0013643926,0.0104470095,0.98318106,0.00004676872],"about_ca_topic_score_codex":0.56238997,"about_ca_topic_score_gemma":0.6858001,"teacher_disagreement_score":0.43761003,"about_ca_system_score_codex":0.020038437,"about_ca_system_score_gemma":0.030181784,"threshold_uncertainty_score":0.88037443},"labels":[],"label_agreement":null},{"id":"W252955003","doi":"","title":"Java-Based DSM with Object-Level Coherence Protocol Selection","year":2003,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Java; Coherence (philosophical gambling strategy); Protocol (science); Leverage (statistics); Programming language; Cache coherence; Object (grammar); Operating system; Artificial intelligence","score_opus":0.019995308566241002,"score_gpt":0.22726334712375187,"score_spread":0.20726803855751086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252955003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029122215,0.0004740041,0.94275665,0.00033116218,0.00029643357,0.00029453175,0.00015589432,0.014744218,0.011825031],"genre_scores_gemma":[0.3483272,0.00034158322,0.63655055,0.00047508106,0.00015637209,0.00036608597,0.0006725685,0.0009138783,0.012196677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988167,0.00027027345,0.00012004639,0.00014567579,0.000530361,0.00011697366],"domain_scores_gemma":[0.99887997,0.00016941228,0.00007748556,0.00041432513,0.00032350773,0.00013527814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012636791,0.00030478847,0.00049062655,0.00050240185,0.00075892924,0.0014043053,0.0017788166,0.000553464,0.0018910374],"category_scores_gemma":[0.0017830278,0.00036263795,0.00031553736,0.0006301771,0.0005695674,0.0012140996,0.0017728515,0.0010457903,0.00096377276],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017615154,0.0011484508,0.0073579648,0.0009233335,0.00019384007,0.0011912066,0.0013974925,0.048516914,0.11402666,0.11965472,0.05105487,0.65277296],"study_design_scores_gemma":[0.0011507681,0.0007081592,0.0024300886,0.000120738536,0.0003011903,0.0013689097,0.00028934542,0.53413546,0.120821536,0.05202166,0.28644055,0.00021159399],"about_ca_topic_score_codex":0.0015557307,"about_ca_topic_score_gemma":0.0027105955,"teacher_disagreement_score":0.0018910374,"about_ca_system_score_codex":0.00045862581,"about_ca_system_score_gemma":0.001440783,"threshold_uncertainty_score":0.0066830516},"labels":[],"label_agreement":null},{"id":"W2536432570","doi":"10.1109/tic-sth.2009.5444485","title":"Evaluating security measures of a layered system","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Vulnerability (computing); Layer (electronics); Host (biology); Enterprise information security architecture; Intrusion detection system; Distributed computing; Computer security","score_opus":0.06403195860910826,"score_gpt":0.32054476469677473,"score_spread":0.25651280608766647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536432570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77365434,0.0002163017,0.22375324,0.00010843118,0.000012029184,0.00009311169,0.00017714323,0.00037070646,0.0016147007],"genre_scores_gemma":[0.98506653,0.000058950438,0.014610189,0.0000075949583,0.0000038918383,0.000023931221,0.000097865865,0.000010887682,0.0001200926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595994,0.0012447676,0.0003006531,0.00031673093,0.0018314722,0.00034649545],"domain_scores_gemma":[0.98169714,0.009509047,0.003845292,0.0023888522,0.0020877926,0.00047191881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038563914,0.0007229153,0.0005186996,0.00236248,0.00041354293,0.0014185855,0.00068480766,0.0007844854,0.0007200738],"category_scores_gemma":[0.019365305,0.00032471,0.0007445762,0.00078434,0.0012160167,0.0029872053,0.0014790476,0.0005952504,0.00012614444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004602975,0.00016855917,0.07719291,0.00016460646,0.0003160792,0.00017968376,0.00037421033,0.8452378,0.022886995,0.016140772,0.00024104402,0.036637064],"study_design_scores_gemma":[0.000008301817,0.0003825457,0.012383239,0.000022399541,0.000054346365,0.00009058484,0.00015524523,0.97211546,0.007113799,0.0074104303,0.00022387721,0.000039713846],"about_ca_topic_score_codex":0.0026609735,"about_ca_topic_score_gemma":0.0012846703,"teacher_disagreement_score":0.0038563914,"about_ca_system_score_codex":0.0015341465,"about_ca_system_score_gemma":0.0009048902,"threshold_uncertainty_score":0.020394802},"labels":[],"label_agreement":null},{"id":"W2539914081","doi":"10.1109/icccas.2002.1180656","title":"A reliable multicast transport protocol for broadband satellite networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Protocol Independent Multicast; Reliable multicast; IP multicast; Pragmatic General Multicast; Source-specific multicast; Xcast; Protocol (science); Broadband; Distance Vector Multicast Routing Protocol; Distributed computing; Telecommunications","score_opus":0.022754793860457926,"score_gpt":0.28271632565292903,"score_spread":0.2599615317924711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539914081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117854895,0.009237519,0.9563858,0.0016273485,0.0014829193,0.0008708036,0.00057144323,0.003830403,0.014208403],"genre_scores_gemma":[0.22075084,0.015498286,0.7237126,0.0011437812,0.0023296727,0.0034676304,0.003389201,0.00075170625,0.028956307],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930537,0.00016780183,0.000051797404,0.000045329984,0.00038081594,0.000048834423],"domain_scores_gemma":[0.99953234,0.00010818192,0.000071564325,0.000082628576,0.0001657865,0.000039488907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076052453,0.000648322,0.00049908936,0.00092363235,0.0010959733,0.0008179024,0.0011346202,0.0011341339,0.0037369945],"category_scores_gemma":[0.0018599523,0.0003367683,0.00048424123,0.0011553895,0.0004980009,0.0013957468,0.0009854997,0.0013178781,0.00196626],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045943967,0.00020443136,0.0006083464,0.0016501347,0.0001587042,0.0016707423,0.00056395103,0.03507326,0.10465071,0.14991242,0.09044505,0.6146028],"study_design_scores_gemma":[0.000304115,0.0008789455,0.0011343338,0.00035759425,0.00026625823,0.0030605362,0.00016265037,0.2183384,0.04821303,0.093924224,0.63312125,0.00023868872],"about_ca_topic_score_codex":0.00079491024,"about_ca_topic_score_gemma":0.00066357845,"teacher_disagreement_score":0.0037369945,"about_ca_system_score_codex":0.00041377934,"about_ca_system_score_gemma":0.0006926846,"threshold_uncertainty_score":0.012501538},"labels":[],"label_agreement":null},{"id":"W2543985132","doi":"10.11606/d.45.2002.tde-22072003-132213","title":"\"Desenvolvimento e comparação de dois protocolos para multicast atômico em computação móvel\"","year":2002,"lang":"pt","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto Mexicano del Seguro Social; Svenska Forskningsrådet Formas; Ministère de la Santé et des Services sociaux","keywords":"Multicast; Computer science; Computer network; Scalability; Reliable multicast; Distributed computing; Protocol (science); Protocol Independent Multicast; Mobile computing; IP multicast; Operating system","score_opus":0.057001838908005635,"score_gpt":0.3279712878473529,"score_spread":0.27096944893934727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543985132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30124488,0.019864487,0.6373138,0.0025740447,0.0017152099,0.0010192177,0.00016518368,0.003750195,0.032353032],"genre_scores_gemma":[0.6307868,0.008346359,0.3514132,0.000567907,0.00043556708,0.000681261,0.0003780247,0.00065364887,0.00673729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995427,0.00202343,0.00022325962,0.0003998866,0.0016603625,0.0002661229],"domain_scores_gemma":[0.99064094,0.004885321,0.00056138576,0.0013571195,0.002331551,0.00022362063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00848481,0.00073906494,0.00085778424,0.0022242377,0.0014351098,0.0033189624,0.0018143221,0.0018103885,0.0024009827],"category_scores_gemma":[0.021977128,0.0006368145,0.0009082141,0.0014639336,0.0020407913,0.005355086,0.001537778,0.0023493303,0.000568784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025193412,0.0011394587,0.0065768096,0.0014507462,0.00023657837,0.0004623942,0.0023714174,0.02977525,0.064163856,0.20788975,0.009237294,0.67417705],"study_design_scores_gemma":[0.0006224427,0.002947973,0.007434933,0.00048518018,0.00078093546,0.0010426897,0.0021986873,0.64539975,0.16448162,0.06679898,0.107503586,0.00030317545],"about_ca_topic_score_codex":0.0023912997,"about_ca_topic_score_gemma":0.0021570544,"teacher_disagreement_score":0.00848481,"about_ca_system_score_codex":0.0018605598,"about_ca_system_score_gemma":0.001165888,"threshold_uncertainty_score":0.044872522},"labels":[],"label_agreement":null},{"id":"W2546879687","doi":"10.1002/9781118640708.ch10","title":"Multicast Transport Protocols for Large‐Scale Distributed Collaborative Environments","year":2013,"lang":"en","type":"other","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Protocol Independent Multicast; Pragmatic General Multicast; IP multicast; Distance Vector Multicast Routing Protocol; Xcast; Reliable multicast; Computer network; Source-specific multicast; Computer science; Distributed computing; Inter-domain; Internet Group Management Protocol","score_opus":0.011641141393821011,"score_gpt":0.2658475797661773,"score_spread":0.2542064383723563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546879687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002332665,0.033542905,0.853939,0.0031800668,0.0030075496,0.0009087003,0.00075022917,0.004565767,0.09777316],"genre_scores_gemma":[0.08332662,0.07470422,0.68703365,0.0024318853,0.003390426,0.0034523292,0.0052463617,0.001647678,0.13876678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986791,0.00030469737,0.00010716447,0.000084919724,0.0007381026,0.000085986474],"domain_scores_gemma":[0.9991793,0.0002912949,0.00006277253,0.00017569904,0.00024511555,0.000045754437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384055,0.0011141368,0.00078064564,0.0014131052,0.0015850957,0.0026247655,0.002251964,0.0018734944,0.012860368],"category_scores_gemma":[0.0025547177,0.00059006753,0.0006941675,0.0026605143,0.00079477014,0.0033478036,0.0019806912,0.0027170908,0.00693275],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007265486,0.00007488772,0.00020277752,0.0011923758,0.0000686943,0.00069311494,0.0005040511,0.009329243,0.006990386,0.46957856,0.13522844,0.3760648],"study_design_scores_gemma":[0.000040134175,0.000051717885,0.0001939342,0.00043175084,0.000037579804,0.00067681103,0.00012409872,0.025404194,0.0029131721,0.13331254,0.8367603,0.000053868174],"about_ca_topic_score_codex":0.0016005633,"about_ca_topic_score_gemma":0.0015959417,"teacher_disagreement_score":0.012860368,"about_ca_system_score_codex":0.0013698041,"about_ca_system_score_gemma":0.0016041755,"threshold_uncertainty_score":0.043022156},"labels":[],"label_agreement":null},{"id":"W2550930467","doi":"","title":"A new model for evaluating performability under the effects of software aging and rejuvenation","year":2007,"lang":"en","type":"article","venue":"International Conference on Software Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dependability; Computer science; Reliability engineering; Rejuvenation; Component (thermodynamics); Queueing theory; Software; Software fault tolerance; Fault tree analysis; Fault tolerance; Embedded system; Distributed computing; Operating system; Computer network; Engineering; Software engineering","score_opus":0.03134441998700631,"score_gpt":0.30435959270618745,"score_spread":0.27301517271918113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550930467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025097696,0.000109736655,0.9717885,0.0001584359,0.000047368903,0.00007097277,0.00015927201,0.0003560746,0.0022118709],"genre_scores_gemma":[0.8305248,0.00041088337,0.16159338,0.00013576956,0.00008163761,0.000566693,0.0003675927,0.00012746551,0.0061916937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985475,0.00035574654,0.00008068395,0.0002201079,0.0006143449,0.00018161196],"domain_scores_gemma":[0.9978131,0.0009287322,0.00038905564,0.00020892578,0.0005467942,0.00011332242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019064604,0.0012361241,0.0006522456,0.00087896234,0.00039561177,0.0012221838,0.0020986064,0.0012854652,0.0016037754],"category_scores_gemma":[0.005824721,0.0003390087,0.00082146964,0.000609881,0.00083398377,0.0027900788,0.0006965047,0.0011043666,0.00029524128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058769805,0.00005952679,0.0009406066,0.00004589572,0.000028948192,0.00006456865,0.00006514201,0.9612248,0.004406222,0.02490237,0.00044197825,0.0077611147],"study_design_scores_gemma":[0.0000046155965,0.000033703163,0.00012121129,0.0000029688965,0.000008702271,0.000012967545,0.000005163222,0.9952625,0.00037725564,0.0038599365,0.0003063841,0.0000046294085],"about_ca_topic_score_codex":0.009143147,"about_ca_topic_score_gemma":0.0045434046,"teacher_disagreement_score":0.009143147,"about_ca_system_score_codex":0.0022257047,"about_ca_system_score_gemma":0.0016903807,"threshold_uncertainty_score":0.018179834},"labels":[],"label_agreement":null},{"id":"W2556309115","doi":"10.1145/3576900","title":"On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; École Normale Supérieure; Simon Fraser University; Alan Turing Institute; National Science Foundation","keywords":"Upper and lower bounds; Hypercube; Combinatorics; Mathematics; Random walk; Discrete mathematics; Random graph; Coalescence (physics); Graph; Physics; Statistics","score_opus":0.014201466148242768,"score_gpt":0.2595415855637024,"score_spread":0.2453401194154596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556309115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14579394,0.012254845,0.81690836,0.0060410844,0.00048270516,0.00017005397,0.0006136981,0.001161007,0.016574347],"genre_scores_gemma":[0.8702073,0.009954402,0.10890579,0.0014244922,0.0015106885,0.00042253648,0.00079257484,0.001725268,0.0050569284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568474,0.001141104,0.00021606266,0.0012907445,0.000743895,0.0009234798],"domain_scores_gemma":[0.9049739,0.078505926,0.005119987,0.005747787,0.0025685905,0.0030838463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060252887,0.0023689293,0.0026844544,0.0039055767,0.0026186348,0.0044459663,0.0036888726,0.0035662637,0.0064535607],"category_scores_gemma":[0.069785915,0.0013388806,0.0024297463,0.0043012374,0.0057691694,0.02156834,0.0040577683,0.006244033,0.001404732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009100633,0.00025781264,0.008539911,0.0009978946,0.0002500348,0.0006287187,0.002118349,0.20497507,0.0146335475,0.68286467,0.0108831795,0.07294088],"study_design_scores_gemma":[0.000052625233,0.00020613873,0.0019513594,0.00014162385,0.0001764771,0.0004574888,0.00044659863,0.31320986,0.003836329,0.67283046,0.006570362,0.00012063948],"about_ca_topic_score_codex":0.002773824,"about_ca_topic_score_gemma":0.0020350756,"teacher_disagreement_score":0.0064535607,"about_ca_system_score_codex":0.003947002,"about_ca_system_score_gemma":0.0014412248,"threshold_uncertainty_score":0.03186512},"labels":[],"label_agreement":null},{"id":"W2560069940","doi":"10.1109/cluster.2016.68","title":"An ABFT Scheme Based on Communication Characteristics","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fault tolerance; Computer science; Overhead (engineering); Scheme (mathematics); Class (philosophy); Distributed computing; Software fault tolerance; Context (archaeology); Process (computing); Parallel computing; Programming language","score_opus":0.011990440905333534,"score_gpt":0.2496363598837448,"score_spread":0.23764591897841128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560069940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08999011,0.0004046827,0.89817697,0.00031236373,0.00014267529,0.00023046207,0.00010333427,0.0023578082,0.008281687],"genre_scores_gemma":[0.72376025,0.00026951847,0.26702598,0.00014517167,0.000091242815,0.00031963547,0.00021885468,0.0002535156,0.007915804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889565,0.00016726754,0.000103640516,0.00018042418,0.00044115007,0.00021180403],"domain_scores_gemma":[0.99746466,0.0005322645,0.00027256695,0.0010741941,0.00050257915,0.00015373429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074251805,0.0005216512,0.0005774956,0.0011407324,0.0013833288,0.0011545413,0.001540361,0.0009532987,0.0032668295],"category_scores_gemma":[0.003003603,0.00020266206,0.00034609833,0.0011855199,0.0008241349,0.0027960634,0.0024825034,0.0012974545,0.0006065701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001529696,0.00036973113,0.003309476,0.00034899788,0.00006625599,0.00039034057,0.00064359134,0.15090987,0.09834018,0.17778818,0.006511024,0.55979264],"study_design_scores_gemma":[0.00015037003,0.0006265072,0.0011995024,0.00006791769,0.00006848387,0.00076099945,0.00018318498,0.81277317,0.07969243,0.07363181,0.030747136,0.000098570796],"about_ca_topic_score_codex":0.0010310737,"about_ca_topic_score_gemma":0.0007659208,"teacher_disagreement_score":0.0032668295,"about_ca_system_score_codex":0.0010371172,"about_ca_system_score_gemma":0.0010196865,"threshold_uncertainty_score":0.01092869},"labels":[],"label_agreement":null},{"id":"W2560396680","doi":"10.1016/j.ic.2016.12.002","title":"Constructing self-stabilizing oscillators in population protocols","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Computer science; Self-stabilization; Population; Distributed computing; Sociology; Demography","score_opus":0.012148811611680278,"score_gpt":0.2649389643486553,"score_spread":0.252790152736975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560396680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10628767,0.00013910365,0.8855791,0.00044360562,0.00009225097,0.00007201807,0.000025053527,0.0003690405,0.0069922097],"genre_scores_gemma":[0.8761548,0.0002034158,0.118818924,0.00015362071,0.00004421724,0.00019570424,0.000044659428,0.00014035053,0.004244319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960726,0.0001833836,0.000022680739,0.00006222217,0.000080791455,0.000043770706],"domain_scores_gemma":[0.99832994,0.0010302677,0.000112826056,0.00026008152,0.00014955779,0.00011734851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111015,0.0003181327,0.0004977754,0.00043681797,0.000739734,0.00087583356,0.001330764,0.0011312374,0.002131578],"category_scores_gemma":[0.0057247537,0.00045199756,0.00040453102,0.00036063007,0.0014953278,0.0014049856,0.0022696243,0.0012836136,0.00040243767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014635384,0.00011156332,0.0012132227,0.000100761485,0.00004358537,0.0001722287,0.00055280677,0.39330834,0.015345849,0.5323138,0.0016704737,0.055021003],"study_design_scores_gemma":[0.000048234004,0.00004715951,0.000083694365,0.000012891722,0.00001567997,0.000035166395,0.00007034598,0.79421675,0.0034803997,0.20044103,0.0015350614,0.000013535788],"about_ca_topic_score_codex":0.00039601096,"about_ca_topic_score_gemma":0.00065464986,"teacher_disagreement_score":0.002131578,"about_ca_system_score_codex":0.0005091871,"about_ca_system_score_gemma":0.00054873625,"threshold_uncertainty_score":0.0071308613},"labels":[],"label_agreement":null},{"id":"W2561500882","doi":"10.1109/edcc.2016.17","title":"A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum Byzantine agreement; Testbed; Computer science; Latency (audio); Algorithm; Byzantine fault tolerance; Distributed algorithm; Randomized algorithm; Key (lock); Algorithm design; Distributed computing; Fault tolerance; Computer network","score_opus":0.03311945545120502,"score_gpt":0.2890089048919372,"score_spread":0.25588944944073216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561500882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52717894,0.0018487743,0.45349485,0.0009070916,0.00023513542,0.0007186934,0.00033177406,0.004366427,0.0109182885],"genre_scores_gemma":[0.84022516,0.00034066194,0.1577584,0.000073188225,0.000037862228,0.00026444084,0.0002990568,0.00017031303,0.00083094666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9867264,0.004858634,0.0012867925,0.0017411672,0.0043111607,0.0010758236],"domain_scores_gemma":[0.96101326,0.023884455,0.0023874193,0.007578366,0.0042433096,0.0008930864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102883885,0.0010604383,0.0017656493,0.0018659738,0.0016574883,0.0031881428,0.0025504902,0.0027179322,0.0018074937],"category_scores_gemma":[0.039747603,0.00040222576,0.00063951925,0.0021077783,0.00203993,0.0054661683,0.0018655448,0.0012899628,0.0006412957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045431782,0.0012003878,0.010769662,0.00079749373,0.00038765272,0.00011436558,0.00075252866,0.6875925,0.03561222,0.06620225,0.003746184,0.18828161],"study_design_scores_gemma":[0.00026533642,0.0008362779,0.0014831589,0.00003333523,0.0000386646,0.00012591337,0.00019177904,0.96243316,0.0201442,0.0129587045,0.0014305051,0.000058915215],"about_ca_topic_score_codex":0.0017574632,"about_ca_topic_score_gemma":0.0012266313,"teacher_disagreement_score":0.0102883885,"about_ca_system_score_codex":0.0028534296,"about_ca_system_score_gemma":0.003823381,"threshold_uncertainty_score":0.054410815},"labels":[],"label_agreement":null},{"id":"W2563385979","doi":"10.4230/lipics.opodis.2015.3","title":"Time to Change: On Distributed Computing in Dynamic Networks (Keynote)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; CLARITY; Focus (optics); Field (mathematics); Order (exchange); Data science; Distributed computing; Network topology; Ubiquitous computing; Human–computer interaction; Computer network","score_opus":0.011793917093032246,"score_gpt":0.2500765987211474,"score_spread":0.23828268162811517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563385979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041481135,0.24762657,0.34293428,0.16776107,0.06134446,0.00018099183,0.00039827454,0.0010135701,0.17459272],"genre_scores_gemma":[0.24697459,0.30718824,0.10824039,0.059701532,0.11270455,0.0012891982,0.0008298294,0.001428895,0.16164276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978709,0.0006638678,0.00013719559,0.0004975529,0.0006470944,0.00018342276],"domain_scores_gemma":[0.99507433,0.0034447105,0.00022150518,0.0004777768,0.00057333766,0.00020844812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029331842,0.00093615387,0.0010641164,0.0025414932,0.0023910599,0.004877366,0.0018513103,0.0034473373,0.012599771],"category_scores_gemma":[0.012609705,0.00058589416,0.00092736684,0.0060513755,0.0062998254,0.016445862,0.0032673376,0.0057674935,0.0036007757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058398982,0.000018000757,0.00021363744,0.00024203697,0.000021904027,0.00019907976,0.00044530048,0.0021096976,0.00017106421,0.82929474,0.12542288,0.041803278],"study_design_scores_gemma":[0.000021780303,0.00003309925,0.00025655236,0.00036852292,0.000026285918,0.00023294397,0.0002124224,0.0035669229,0.00018166644,0.5878205,0.4072519,0.000027528682],"about_ca_topic_score_codex":0.0032784112,"about_ca_topic_score_gemma":0.001861178,"teacher_disagreement_score":0.012599771,"about_ca_system_score_codex":0.0042998902,"about_ca_system_score_gemma":0.0012266133,"threshold_uncertainty_score":0.042150438},"labels":[],"label_agreement":null},{"id":"W2569211293","doi":"10.1145/3007748.3007775","title":"Time-communication trade-offs for minimum spanning tree construction","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Binary logarithm; Node (physics); Distributed minimum spanning tree; Upper and lower bounds; Time complexity; Combinatorics; Tree (set theory); Computer science; Communication complexity; Computational complexity theory; K-ary tree; Discrete mathematics; Mathematics; Theoretical computer science; Tree structure; Algorithm; Binary tree; Physics","score_opus":0.02253437708826871,"score_gpt":0.27048354746419384,"score_spread":0.24794917037592512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569211293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13280809,0.0073070633,0.8281138,0.005066953,0.00032876752,0.00022129495,0.00037372703,0.0012556914,0.024524558],"genre_scores_gemma":[0.80702066,0.0029349923,0.1828592,0.0006036654,0.0005710859,0.00043875625,0.00038708473,0.00084009144,0.0043443646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99254096,0.0034227702,0.00043273543,0.0010301174,0.0017686841,0.00080472627],"domain_scores_gemma":[0.9341813,0.05745904,0.0019840864,0.0037970953,0.0014710523,0.0011073692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068460926,0.0012779173,0.0017710212,0.0013936057,0.001808691,0.0025543093,0.0024779097,0.0030389475,0.0073923133],"category_scores_gemma":[0.050406422,0.0009126155,0.00096637575,0.0024716696,0.0021819533,0.009068032,0.0029639828,0.0024219838,0.001219274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025605173,0.00031753074,0.0018894309,0.0009282118,0.0001528343,0.00036073543,0.0007379594,0.56792074,0.016760549,0.22364476,0.008488618,0.1762381],"study_design_scores_gemma":[0.00015776014,0.00045611247,0.0005421839,0.00009935499,0.00009966408,0.00049302843,0.0002105404,0.7787717,0.005397347,0.20928103,0.0044449684,0.00004634938],"about_ca_topic_score_codex":0.0006704425,"about_ca_topic_score_gemma":0.000931415,"teacher_disagreement_score":0.0073923133,"about_ca_system_score_codex":0.0020919004,"about_ca_system_score_gemma":0.001233049,"threshold_uncertainty_score":0.036206007},"labels":[],"label_agreement":null},{"id":"W2570673800","doi":"10.4230/lipics.opodis.2015.2","title":"Dynamic Reconfiguration: A Tutorial (Tutorial)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Azrieli Foundation; National Science Foundation","keywords":"Control reconfiguration; Computer science; Distributed computing; Reliability (semiconductor); Server; Key (lock); Object (grammar); Embedded system; Reliability engineering; Computer network; Engineering; Power (physics); Operating system; Artificial intelligence","score_opus":0.008623260246433827,"score_gpt":0.2393983755626764,"score_spread":0.23077511531624256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570673800","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002408824,0.7059439,0.08555731,0.0042248005,0.016009424,0.00011712468,0.00085749634,0.0019963796,0.18288478],"genre_scores_gemma":[0.026148127,0.6627362,0.090964966,0.0063470188,0.024683693,0.00048832915,0.003286747,0.0016719878,0.18367301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996506,0.00004571045,0.000026709089,0.0000968257,0.00012723116,0.00005288062],"domain_scores_gemma":[0.99961805,0.00017657578,0.000028872715,0.000032994027,0.000078761535,0.000064726206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004233313,0.002282358,0.001157563,0.0024385983,0.0005648367,0.0022570223,0.0010390972,0.0013607745,0.030935137],"category_scores_gemma":[0.0010863479,0.0006728035,0.00083563913,0.0038863125,0.00067801983,0.003737602,0.001197886,0.003013992,0.0316107],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006110006,0.00020739913,0.00022356743,0.0017898524,0.00004324111,0.00019624876,0.00013472975,0.004659212,0.002560632,0.04278999,0.44325057,0.5040836],"study_design_scores_gemma":[0.0000073912674,0.000052593867,0.0005075416,0.00055117346,0.00001930095,0.00060630357,0.000041090156,0.0016264963,0.00036506058,0.021198863,0.9750025,0.000021498014],"about_ca_topic_score_codex":0.0014019021,"about_ca_topic_score_gemma":0.0014657024,"teacher_disagreement_score":0.030935137,"about_ca_system_score_codex":0.0011102564,"about_ca_system_score_gemma":0.00071631663,"threshold_uncertainty_score":0.103488326},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010182189561394737,"score_gpt":0.23399981616808416,"score_spread":0.2238176266066894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571118757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67711115,0.0018972154,0.30541518,0.0004502787,0.00013966481,0.00014751487,0.00007773902,0.00788448,0.0068768705],"genre_scores_gemma":[0.96931255,0.0001559821,0.029149342,0.00007615101,0.000022846765,0.000038292153,0.000062452105,0.00008965648,0.0010927449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998418,0.00025544266,0.00012284039,0.00021494472,0.0007040303,0.00028485787],"domain_scores_gemma":[0.99663687,0.0009183764,0.00041362818,0.0011392161,0.0006372695,0.00025464626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015776413,0.000656544,0.00047593552,0.0004805995,0.0008446991,0.0011149192,0.0015775769,0.00028285594,0.0010311661],"category_scores_gemma":[0.004224886,0.00034733306,0.0002272773,0.00059301395,0.000811714,0.0013729386,0.0010154383,0.00075317227,0.0002181784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019333636,0.00053676177,0.02545721,0.00037047194,0.00015871105,0.00054821017,0.0010619925,0.2789944,0.27800933,0.021835424,0.007989328,0.3831048],"study_design_scores_gemma":[0.00011757374,0.0003794762,0.0022557748,0.000025231659,0.000046602694,0.0002164148,0.00016611893,0.9101683,0.076738186,0.0054957103,0.0043422976,0.000048251382],"about_ca_topic_score_codex":0.0048182937,"about_ca_topic_score_gemma":0.0065444154,"teacher_disagreement_score":0.0048182937,"about_ca_system_score_codex":0.0007770901,"about_ca_system_score_gemma":0.0025507486,"threshold_uncertainty_score":0.009580493},"labels":[],"label_agreement":null},{"id":"W2579368542","doi":"10.14778/3025111.3025122","title":"Persistent hybrid transactional memory for databases","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Computer science; Scalability; Software transactional memory; Synchronization (alternating current); Concurrency; Implementation; Transactional leadership; Database transaction; Concurrency control; Embedded system; Operating system; Parallel computing; Database; Software engineering; Computer network","score_opus":0.023698588738854606,"score_gpt":0.2329220493524717,"score_spread":0.2092234606136171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579368542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04103238,0.002719835,0.94939816,0.0003782783,0.00013463869,0.0001020751,0.00014150035,0.002748339,0.003344889],"genre_scores_gemma":[0.6082025,0.0013328879,0.38440448,0.00027818952,0.00010529872,0.0002658383,0.0003816769,0.000243506,0.0047856937],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994261,0.0001265777,0.00006581379,0.00011539537,0.00020752139,0.000058562127],"domain_scores_gemma":[0.99854445,0.00042277056,0.0000953996,0.0006346301,0.00023754936,0.00006516752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007427053,0.00038876056,0.00039472026,0.0005170881,0.000615366,0.0019631407,0.0022782353,0.0006718583,0.0022047784],"category_scores_gemma":[0.002523879,0.00030636106,0.00038529516,0.0009740925,0.0006611276,0.0027235097,0.0016555192,0.0010361297,0.00067017064],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012963921,0.00020308592,0.0036097243,0.0008778501,0.00015665182,0.0004067372,0.00044790746,0.08536195,0.05305982,0.2138369,0.012643249,0.62809986],"study_design_scores_gemma":[0.00015693554,0.0003654445,0.0005533812,0.00007077148,0.00009285292,0.0006310086,0.00019537576,0.7998106,0.0367536,0.1324384,0.028888572,0.000043100474],"about_ca_topic_score_codex":0.00095617457,"about_ca_topic_score_gemma":0.0012117928,"teacher_disagreement_score":0.0022782353,"about_ca_system_score_codex":0.0006601167,"about_ca_system_score_gemma":0.0008730361,"threshold_uncertainty_score":0.007375717},"labels":[],"label_agreement":null},{"id":"W2580278802","doi":"10.1145/2993585.2993587","title":"Web and file based document collaboration via aysnchronous and synchronous updates","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Asynchronous communication; World Wide Web; Collaborative editing; Web application; Software; Database; Operating system","score_opus":0.003254611756594292,"score_gpt":0.2033729022625262,"score_spread":0.20011829050593188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580278802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03604468,0.00045093757,0.9163522,0.00044044503,0.00025077045,0.00017043503,0.00021552405,0.004091748,0.041983247],"genre_scores_gemma":[0.54481024,0.0006370308,0.4130567,0.00020267013,0.00022492898,0.0003383737,0.0005558001,0.0009448322,0.03922947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953762,0.001373892,0.00040201776,0.00066568586,0.0017944771,0.0003876427],"domain_scores_gemma":[0.9923293,0.001823039,0.0005135286,0.003787803,0.0011101869,0.00043617867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033481587,0.00033002152,0.00060422026,0.0012898466,0.00117234,0.0056408597,0.0015546549,0.001249034,0.007757074],"category_scores_gemma":[0.010705327,0.0005241348,0.0006883197,0.0023039926,0.0021964,0.008782537,0.004471499,0.0014670353,0.0028228988],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079744565,0.0002022906,0.0023937062,0.00017980623,0.000048389848,0.00075655774,0.0030831473,0.017000407,0.018545609,0.6518694,0.008477366,0.2966458],"study_design_scores_gemma":[0.0003092542,0.0004485241,0.0024371326,0.00017597883,0.00016676601,0.0022516826,0.0019682087,0.26399925,0.06997361,0.38382462,0.274263,0.00018199492],"about_ca_topic_score_codex":0.0024195323,"about_ca_topic_score_gemma":0.0016784574,"teacher_disagreement_score":0.007757074,"about_ca_system_score_codex":0.0008596801,"about_ca_system_score_gemma":0.0015745319,"threshold_uncertainty_score":0.025949955},"labels":[],"label_agreement":null},{"id":"W2581521131","doi":"10.1109/cloudcom.2016.0099","title":"Self-Healing Redundancy for OpenStack Applications through Fault-Tolerant Multi-Agent Task Scheduling","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Ericsson (Canada)","funders":"","keywords":"Operating system; Computer science; Virtual machine; Failover; Redundancy (engineering); Embedded system; Fault tolerance; Plug-in","score_opus":0.03536390974046174,"score_gpt":0.30002433402756173,"score_spread":0.2646604242871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581521131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27933216,0.0008793008,0.62117666,0.000571698,0.00060067215,0.00038721925,0.0003424922,0.06701639,0.029693464],"genre_scores_gemma":[0.92920506,0.00013597407,0.063245825,0.00009682828,0.000051411476,0.0001415249,0.00037474802,0.00119694,0.005551677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947006,0.00008708607,0.000044163975,0.00007567207,0.00019809783,0.00012480287],"domain_scores_gemma":[0.9989268,0.00019648198,0.00011482431,0.00039592123,0.00022685358,0.000139107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073566014,0.00048168463,0.0003954415,0.00058034,0.00063390005,0.0009153765,0.0015801731,0.00043420104,0.0039904374],"category_scores_gemma":[0.0021192683,0.0002428211,0.00034369295,0.0003208487,0.00049895496,0.0011919535,0.0012448432,0.0007384592,0.0009356497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030206926,0.0007021861,0.004963169,0.00090305024,0.0002488025,0.0012696948,0.001324396,0.24478626,0.19697677,0.04560277,0.0577366,0.4424656],"study_design_scores_gemma":[0.00015604262,0.00024436179,0.0016838587,0.000045344306,0.00006488406,0.00042387808,0.0001193446,0.8855856,0.061043784,0.015925707,0.034635115,0.00007208237],"about_ca_topic_score_codex":0.0009702473,"about_ca_topic_score_gemma":0.0007968715,"teacher_disagreement_score":0.0039904374,"about_ca_system_score_codex":0.00061988475,"about_ca_system_score_gemma":0.0008900685,"threshold_uncertainty_score":0.013349354},"labels":[],"label_agreement":null},{"id":"W2582333409","doi":"10.1145/3018743.3019027","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software transactional memory; Scalability; Transactional memory; Software; Benchmark (surveying); Database transaction; Parallel computing; Operating system; Throughput; Embedded system; Programming language","score_opus":0.019539763568100315,"score_gpt":0.2677059647618047,"score_spread":0.2481662011937044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582333409","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01857256,0.005175849,0.07282793,0.008823602,0.026855715,0.0010361382,0.00706684,0.00965219,0.8499892],"genre_scores_gemma":[0.08683084,0.0032235659,0.04205317,0.0047223363,0.0030583611,0.000511053,0.012106733,0.002150836,0.8453432],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987477,0.0001875801,0.00006963875,0.00033142033,0.0005060697,0.00015746165],"domain_scores_gemma":[0.9985091,0.00021858289,0.0000657141,0.00034837227,0.0005247493,0.0003335147],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011727035,0.000627825,0.0004839231,0.0009616655,0.0016909126,0.004236754,0.0016509505,0.001608219,0.32811913],"category_scores_gemma":[0.0027964397,0.0002699603,0.00059159525,0.00081047765,0.0005278214,0.0030065875,0.0029013322,0.0015206727,0.15236264],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055968744,0.00028454434,0.001778913,0.0006818834,0.00003686937,0.00054463133,0.0004040476,0.0015209473,0.0089531075,0.04312929,0.5974141,0.3446919],"study_design_scores_gemma":[0.000034170465,0.00010797566,0.00059695286,0.00008710428,0.000012641916,0.0003649389,0.00021148635,0.0009987579,0.003378395,0.0050104903,0.9891789,0.0000183393],"about_ca_topic_score_codex":0.00089766865,"about_ca_topic_score_gemma":0.0014410329,"teacher_disagreement_score":0.67188084,"about_ca_system_score_codex":0.0007680773,"about_ca_system_score_gemma":0.0010297181,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2582762235","doi":"10.1145/3018743.3019035","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Lock (firearm); Computer science; Overhead (engineering); Scheme (mathematics); Distributed computing; Parallel computing; Embedded system; Computer engineering; Operating system; Engineering; Mathematics","score_opus":0.019539763568100315,"score_gpt":0.2677059647618047,"score_spread":0.2481662011937044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582762235","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046714474,0.0073475814,0.016421339,0.017670002,0.06745305,0.00059973355,0.0054674395,0.0033189936,0.87705046],"genre_scores_gemma":[0.01856677,0.0028352153,0.006114448,0.0032413919,0.00684676,0.00019503747,0.005310653,0.00083990034,0.95604986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886596,0.00014843268,0.000068718306,0.0003617585,0.0004016073,0.00015355977],"domain_scores_gemma":[0.9979589,0.00019045058,0.00006986661,0.00029907867,0.0008409279,0.00064073177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012455063,0.0010000841,0.0006926721,0.0013857345,0.0023092488,0.0046837004,0.0016576706,0.0023514915,0.5897047],"category_scores_gemma":[0.002783346,0.0004196979,0.00097086263,0.00087569177,0.00062014477,0.0028867703,0.002945828,0.0024681392,0.35870877],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026804104,0.00013317764,0.00043391957,0.00026982176,0.000019669218,0.00022702556,0.00011463313,0.00021468679,0.0019557737,0.012002593,0.86505055,0.119309954],"study_design_scores_gemma":[0.00002640842,0.000041559153,0.00034642918,0.0000805235,0.000010351512,0.00024052423,0.00008653968,0.00017777512,0.0007415874,0.0042440067,0.99399525,0.000009025083],"about_ca_topic_score_codex":0.0010481298,"about_ca_topic_score_gemma":0.0019875653,"teacher_disagreement_score":0.4102953,"about_ca_system_score_codex":0.0013858059,"about_ca_system_score_gemma":0.001542147,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2592247214","doi":"","title":"String deduplication during garbage collection in virtual machines","year":2016,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"","keywords":"Garbage collection; Manual memory management; Computer science; Memory leak; Garbage; Heap (data structure); Copying; Memory management; Data deduplication; Operating system; Java; Virtual machine; Database; Virtual memory; Storage management; Python (programming language); Programming language","score_opus":0.004434958098193664,"score_gpt":0.1909042989907788,"score_spread":0.18646934089258513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592247214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18658137,0.0028709476,0.7916788,0.0003441454,0.00017946743,0.00034234405,0.00025118428,0.014575888,0.003175827],"genre_scores_gemma":[0.5292993,0.00082306133,0.461786,0.00024218748,0.00005265483,0.00027436108,0.0005266495,0.0023127673,0.004682972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971726,0.0010637154,0.00033563364,0.00041337186,0.000728189,0.00028652375],"domain_scores_gemma":[0.9897787,0.0038010248,0.0010029989,0.0042233323,0.0009819912,0.00021188275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021275806,0.0008182902,0.0011743814,0.0015741017,0.001247407,0.0020622027,0.002790863,0.0007826933,0.0014001195],"category_scores_gemma":[0.009552634,0.00079347997,0.00077219633,0.0023048697,0.0016614927,0.004157586,0.0021600116,0.0007750689,0.000646747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023254063,0.00030282786,0.011195207,0.0016476789,0.00018502034,0.0009262292,0.0038482223,0.101436116,0.13965239,0.040537834,0.0054466357,0.6924965],"study_design_scores_gemma":[0.00015093522,0.00085569924,0.0039354363,0.00030454586,0.00025169645,0.0011949863,0.00082222995,0.2509783,0.641183,0.044882607,0.05526336,0.0001771903],"about_ca_topic_score_codex":0.0010864685,"about_ca_topic_score_gemma":0.0018677828,"teacher_disagreement_score":0.002790863,"about_ca_system_score_codex":0.0010218215,"about_ca_system_score_gemma":0.0018007333,"threshold_uncertainty_score":0.011251867},"labels":[],"label_agreement":null},{"id":"W2593456972","doi":"","title":"A concurrent multiway tree using the lazy locking mechanism","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"","keywords":"Computer science; Tree (set theory); Traverse; Node (physics); Search tree; Algorithm; Theoretical computer science; Mathematics; Search algorithm","score_opus":0.03387782352014128,"score_gpt":0.2654338708779109,"score_spread":0.23155604735776963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593456972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01232545,0.00013801854,0.9841436,0.000050245526,0.00003640848,0.000077500285,0.0000306118,0.0019332179,0.0012648564],"genre_scores_gemma":[0.19390076,0.00015233098,0.80233383,0.00009978389,0.000036263405,0.00013776532,0.0001625799,0.00038439766,0.002792303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870706,0.00017732942,0.0001389466,0.00026264787,0.0005364171,0.00017751993],"domain_scores_gemma":[0.99817383,0.00037755846,0.00021281965,0.00056547724,0.00056171557,0.00010844976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009987649,0.00045145303,0.0006283012,0.00095837895,0.0011041032,0.0016909812,0.00226309,0.0006894706,0.002039738],"category_scores_gemma":[0.0027671116,0.00037275263,0.0005940175,0.0012107838,0.0007197161,0.0036454953,0.0016843547,0.00084171427,0.00078219303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078046846,0.00032729327,0.0048175086,0.00037838292,0.00016352735,0.00040272545,0.00074891245,0.10445736,0.09929864,0.1254356,0.0057362523,0.6574533],"study_design_scores_gemma":[0.00024185506,0.0003338335,0.0006625309,0.00006432713,0.0001388984,0.0006389021,0.00015179915,0.82384104,0.09078386,0.04928698,0.03373011,0.00012593885],"about_ca_topic_score_codex":0.0035043426,"about_ca_topic_score_gemma":0.0039705345,"teacher_disagreement_score":0.0035043426,"about_ca_system_score_codex":0.00086365436,"about_ca_system_score_gemma":0.0024696856,"threshold_uncertainty_score":0.006967902},"labels":[],"label_agreement":null},{"id":"W2595598880","doi":"10.1145/3087801.3087816","title":"Towards Efficient Verification of Population Protocols","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Computer science; Reachability; Reachability problem; Petri net; Protocol (science); Theoretical computer science; Population; Formal verification; Model checking; Automaton; Computational complexity theory; Communications protocol; Theory of computation; Distributed computing; Algorithm","score_opus":0.04526719905041192,"score_gpt":0.33731733378390444,"score_spread":0.2920501347334925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595598880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015072201,0.00028981848,0.97850376,0.001166903,0.00008159299,0.0001500828,0.00022005834,0.0017888477,0.0027266291],"genre_scores_gemma":[0.44139352,0.00075679214,0.5501039,0.00090751506,0.00019677282,0.00075646135,0.0012904124,0.00071783917,0.00387667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9830715,0.007067352,0.0010843365,0.0023155757,0.005031386,0.0014298817],"domain_scores_gemma":[0.9613452,0.024363099,0.0015814939,0.008566933,0.0035529833,0.000590295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009125733,0.0010175321,0.001625514,0.0013878121,0.0015665098,0.0047289254,0.003703535,0.0027377764,0.0052754153],"category_scores_gemma":[0.04833832,0.001312702,0.002570901,0.0013839593,0.00468735,0.010466721,0.009301669,0.006713186,0.001763516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035139156,0.00017919346,0.0017152762,0.0005801053,0.00017263526,0.00050402724,0.000997475,0.1756431,0.01601546,0.7301534,0.0067209085,0.06696702],"study_design_scores_gemma":[0.00008120227,0.000034113487,0.000108895205,0.000058619087,0.000027893431,0.00007568314,0.000098607336,0.32654268,0.006420365,0.66050625,0.0060205823,0.000025141813],"about_ca_topic_score_codex":0.0018927122,"about_ca_topic_score_gemma":0.0016028297,"teacher_disagreement_score":0.009125733,"about_ca_system_score_codex":0.0026403957,"about_ca_system_score_gemma":0.0036746261,"threshold_uncertainty_score":0.04826212},"labels":[],"label_agreement":null},{"id":"W2600740027","doi":"10.1007/s11227-017-2003-0","title":"Dependability enhancing mechanisms for integrated clinical environments","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Food and Drug Administration; Hamilton Health Sciences Foundation; National Institute for Health and Care Research; Arkansas Research Alliance; National Institutes of Health; Arkansas Science and Technology Authority; National Institute of General Medical Sciences; Cleveland State University","keywords":"Dependability; Computer science; Supervisor; Component (thermodynamics); Overhead (engineering); Set (abstract data type); Distributed computing; Embedded system; Operating system; Software engineering","score_opus":0.04021160288853961,"score_gpt":0.3230690008375627,"score_spread":0.2828573979490231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600740027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03005581,0.0011519004,0.9629452,0.0003346282,0.00012257759,0.00021853861,0.000030600328,0.0028252853,0.0023153732],"genre_scores_gemma":[0.6790197,0.0007686221,0.31569305,0.00031058455,0.0003224008,0.0003466887,0.00009375985,0.00036281216,0.0030822945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483067,0.0013390675,0.00046553498,0.0005742472,0.0022193438,0.0005711836],"domain_scores_gemma":[0.97265255,0.00981082,0.005124362,0.008583039,0.0028331862,0.0009960382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00698382,0.00097591145,0.00062975165,0.0014949632,0.0008008315,0.00182722,0.0026268847,0.0010428111,0.0034798244],"category_scores_gemma":[0.016921235,0.00057452515,0.0008457151,0.00060520007,0.0017865417,0.0041460725,0.005160891,0.0024844182,0.0007537722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011820656,0.0007597871,0.006196181,0.0016714433,0.00038509865,0.001162058,0.0019125434,0.07520335,0.1539227,0.28255305,0.005339091,0.46971262],"study_design_scores_gemma":[0.0006320463,0.002828339,0.007192901,0.0007397493,0.00078536884,0.0031749236,0.0004473476,0.47105289,0.17878789,0.24918747,0.08473376,0.00043728325],"about_ca_topic_score_codex":0.00029448618,"about_ca_topic_score_gemma":0.00022537207,"teacher_disagreement_score":0.00698382,"about_ca_system_score_codex":0.0007854964,"about_ca_system_score_gemma":0.001044682,"threshold_uncertainty_score":0.036934376},"labels":[],"label_agreement":null},{"id":"W2604716105","doi":"","title":"Autonomous Mobile Systems for Long-Term Operations in Spatio-Temporal Environments","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Space Agency; Fonds Québécois de la Recherche sur la Nature et les Technologies; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Commonwealth Scientific and Industrial Research Organisation; National Science Foundation","keywords":"Robotics; Artificial intelligence; Mechatronics; Plan (archaeology); Field (mathematics); Engineering; Engineering management; Computer science; Operations research; Aeronautics; Robot; Geography; Mathematics","score_opus":0.019621713978208992,"score_gpt":0.2485733109029117,"score_spread":0.2289515969247027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604716105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027076777,0.0035835914,0.93703383,0.0017902688,0.00054036046,0.00016822285,0.000310779,0.0030671149,0.026429053],"genre_scores_gemma":[0.6679348,0.0043501407,0.26544282,0.0005438078,0.0006071166,0.0005351162,0.0012772557,0.00026683495,0.059042193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996147,0.00006905873,0.0000268658,0.000067284935,0.00016243738,0.00005964464],"domain_scores_gemma":[0.9994779,0.000119645214,0.000078602076,0.00016172796,0.00012072098,0.000041348867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037322144,0.00062244816,0.0004085703,0.00032375177,0.00069345935,0.0016366371,0.0009436265,0.0010033122,0.008009004],"category_scores_gemma":[0.0011858491,0.00020052733,0.00035810895,0.0005534316,0.00069805706,0.0019324761,0.0018807354,0.0010554424,0.0025872262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022189335,0.00014477358,0.002938453,0.00081257615,0.00011078761,0.0006531232,0.0011099472,0.15890856,0.038107287,0.2547655,0.028602798,0.51362425],"study_design_scores_gemma":[0.000084667,0.00036275366,0.0029110573,0.00023847232,0.00007085056,0.00083418423,0.0008322799,0.5157115,0.0096081225,0.11556349,0.35372603,0.000056628094],"about_ca_topic_score_codex":0.0018785255,"about_ca_topic_score_gemma":0.0030132127,"teacher_disagreement_score":0.008009004,"about_ca_system_score_codex":0.0005698204,"about_ca_system_score_gemma":0.00096422835,"threshold_uncertainty_score":0.026792824},"labels":[],"label_agreement":null},{"id":"W2609765979","doi":"10.1090/crmp/030/10","title":"Linear dependencies among completely replicable functions","year":2001,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.024507976656946585,"score_gpt":0.228069833813265,"score_spread":0.20356185715631842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609765979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115722574,0.0011811309,0.8481631,0.00030503233,0.00012469114,0.00016077263,0.00054917054,0.0034955875,0.030298045],"genre_scores_gemma":[0.8352315,0.00097571075,0.11590324,0.00029252277,0.00022969706,0.00028063526,0.0010470629,0.0009678874,0.04507175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814296,0.00047768827,0.000081707,0.0003004456,0.00067163416,0.00032551377],"domain_scores_gemma":[0.98974854,0.005312781,0.00056436745,0.0029111817,0.0011992042,0.00026393463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012497987,0.000724224,0.00078575313,0.0009479139,0.00089145376,0.0018568389,0.0015832026,0.0008257153,0.008464752],"category_scores_gemma":[0.007114844,0.0010338781,0.0006232805,0.0013847649,0.0012370511,0.0036242332,0.0018172772,0.001620501,0.0024363988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007203106,0.00020666489,0.002187038,0.0006287953,0.00009947848,0.0006870964,0.0006687519,0.07861367,0.035093445,0.6750434,0.011922332,0.19412905],"study_design_scores_gemma":[0.00010340846,0.00036175182,0.0023405943,0.00008909293,0.00013227896,0.0007410737,0.00011533672,0.34592837,0.049468,0.57846147,0.022154257,0.00010437457],"about_ca_topic_score_codex":0.00097583287,"about_ca_topic_score_gemma":0.0013052032,"teacher_disagreement_score":0.008464752,"about_ca_system_score_codex":0.0009485255,"about_ca_system_score_gemma":0.0011891101,"threshold_uncertainty_score":0.028317451},"labels":[],"label_agreement":null},{"id":"W2611856048","doi":"10.1007/s00446-013-0190-3","title":"Byzantine agreement with homonyms","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Identifier; Impossibility; Computer science; Byzantine architecture; Agreement; Process (computing); Unique identifier; Theoretical computer science; Distributed computing; Computer network; Programming language; Political science; Geography","score_opus":0.006880588067287215,"score_gpt":0.20448400230934033,"score_spread":0.1976034142420531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611856048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028045367,0.00054973963,0.9160599,0.0023662539,0.0009790169,0.00022048435,0.00024659894,0.0016577309,0.04987488],"genre_scores_gemma":[0.7429169,0.0007265901,0.21448733,0.0010669798,0.0007904036,0.000563533,0.0004734466,0.00094679167,0.038028006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918767,0.0036173838,0.0004972022,0.0011646212,0.002027472,0.00081655197],"domain_scores_gemma":[0.98885286,0.0038828682,0.0005253913,0.0053125788,0.0011178997,0.00030843305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005082103,0.00064764323,0.0017397469,0.0010440835,0.0038412025,0.005487614,0.0016152483,0.0028158005,0.009958551],"category_scores_gemma":[0.013467846,0.0006376198,0.0007554621,0.0016928898,0.0043472624,0.012679231,0.00676069,0.004428754,0.0037121258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018967902,0.00002646238,0.000081288934,0.00006490147,0.000009869775,0.00007512758,0.000321854,0.0017414445,0.0015944192,0.9773605,0.0028552224,0.01567915],"study_design_scores_gemma":[0.000059762664,0.000036931207,0.000033579494,0.00003331103,0.000017513079,0.00010525008,0.00007952972,0.015420149,0.0049504945,0.95505595,0.024183799,0.000023834535],"about_ca_topic_score_codex":0.00033406162,"about_ca_topic_score_gemma":0.0003241483,"teacher_disagreement_score":0.009958551,"about_ca_system_score_codex":0.0012260339,"about_ca_system_score_gemma":0.0017599871,"threshold_uncertainty_score":0.033314705},"labels":[],"label_agreement":null},{"id":"W2617314870","doi":"","title":"Incremental Proof-Based Development for Resilient Distributed Systems","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Dependability; Distributed computing; Computer science; Resilience (materials science); Process (computing); Event (particle physics); Theoretical computer science; Software engineering; Algorithm; Programming language","score_opus":0.01689904477050497,"score_gpt":0.2344789805578724,"score_spread":0.21757993578736742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617314870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064982576,0.00018963961,0.98320067,0.00036261242,0.00008154236,0.00020835723,0.00011704625,0.004868017,0.0044738795],"genre_scores_gemma":[0.25403,0.00034487338,0.73650956,0.00030980597,0.00008066386,0.00036003557,0.000525226,0.0013555031,0.0064843097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938479,0.002255658,0.00050694786,0.00070060056,0.002162103,0.00052685966],"domain_scores_gemma":[0.9754023,0.014973841,0.00056886586,0.0057046944,0.002839749,0.0005106213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054188445,0.0008586654,0.0008096965,0.0015018114,0.0011781887,0.0022844903,0.0032977797,0.001222663,0.011896286],"category_scores_gemma":[0.024001982,0.0011577785,0.0016704593,0.0009895774,0.0024857302,0.004569559,0.007049195,0.0032267573,0.0023350092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068783644,0.00036163448,0.0014351516,0.0015868463,0.00018714977,0.0010483848,0.001395417,0.09182084,0.027704213,0.45156148,0.016553795,0.4056573],"study_design_scores_gemma":[0.00024664844,0.00018747943,0.00027497887,0.00018339846,0.000189589,0.0005199539,0.0001438147,0.46578625,0.03713968,0.44871643,0.046535287,0.00007649196],"about_ca_topic_score_codex":0.001259744,"about_ca_topic_score_gemma":0.001939495,"teacher_disagreement_score":0.011896286,"about_ca_system_score_codex":0.0011171167,"about_ca_system_score_gemma":0.0023645994,"threshold_uncertainty_score":0.039797008},"labels":[],"label_agreement":null},{"id":"W2621329446","doi":"","title":"Fast asynchronous byzantine agreement and leader election with full information","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leader election; Asynchronous communication; Quantum Byzantine agreement; Computer science; Protocol (science); Adversary; Constant (computer programming); Computation; Byzantine architecture; Theoretical computer science; Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Algorithm; Fault tolerance","score_opus":0.007174048911562459,"score_gpt":0.18805842378689064,"score_spread":0.18088437487532819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621329446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031894457,0.00029025375,0.96027887,0.0007506972,0.00010924034,0.00024290822,0.000079884216,0.0008600485,0.0054936754],"genre_scores_gemma":[0.6061926,0.0005504582,0.37925246,0.00032380482,0.0003050496,0.000829053,0.00026834215,0.00032719618,0.01195095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934569,0.002081783,0.00026492507,0.0011757219,0.0021768308,0.00084384007],"domain_scores_gemma":[0.98378724,0.0071997815,0.0021458794,0.004997577,0.0012241746,0.000645406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054252422,0.0010506825,0.0016164391,0.0011188894,0.0020234587,0.0029922314,0.003472266,0.001887776,0.0035111748],"category_scores_gemma":[0.015183758,0.00070832786,0.0009754513,0.0015199598,0.0031555058,0.010192925,0.004944036,0.003749312,0.0013570846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012696529,0.00032413527,0.001364164,0.0004415291,0.00010724907,0.00042968395,0.0012700992,0.20975094,0.021133423,0.6299908,0.006897804,0.12702048],"study_design_scores_gemma":[0.00032209404,0.00032835032,0.00024379198,0.00004572602,0.000046877478,0.00021877917,0.00011931469,0.6537445,0.026917653,0.30634263,0.011600425,0.00006976642],"about_ca_topic_score_codex":0.0010072533,"about_ca_topic_score_gemma":0.00088045397,"teacher_disagreement_score":0.0054252422,"about_ca_system_score_codex":0.0013004699,"about_ca_system_score_gemma":0.00237308,"threshold_uncertainty_score":0.028691769},"labels":[],"label_agreement":null},{"id":"W2625691728","doi":"","title":"Brief Announcement: Faster Data Structures in Transactional Memory using Three Paths","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Computer science; Transactional leadership; Parallel computing; Programming language; Database transaction; Management; Economics","score_opus":0.04835705722159702,"score_gpt":0.26504552933475956,"score_spread":0.21668847211316253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625691728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052577954,0.07402889,0.5000127,0.08905686,0.1310133,0.0006315657,0.0031642057,0.017893337,0.13162126],"genre_scores_gemma":[0.35419026,0.033293452,0.26347002,0.012869642,0.03677465,0.0007088437,0.007589112,0.0059238025,0.28518024],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770796,0.00051903346,0.00019272484,0.00038359137,0.0009299415,0.00026676015],"domain_scores_gemma":[0.99545705,0.0016835311,0.00014693335,0.00078817183,0.0015422828,0.00038197884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003347312,0.0007412134,0.00071739196,0.0009241896,0.0011079394,0.0037659914,0.0014293765,0.0023301656,0.044833414],"category_scores_gemma":[0.009677109,0.0007897659,0.0007755332,0.0016593902,0.0013257382,0.010278567,0.0015135717,0.0038971545,0.010468301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018334256,0.00016770481,0.0008939128,0.0009612214,0.000072533236,0.0003865771,0.0004960795,0.0028362037,0.010162208,0.28709888,0.4060041,0.28908727],"study_design_scores_gemma":[0.00036968655,0.00041754768,0.0005770423,0.00017217273,0.00006408103,0.00038697768,0.00016299868,0.01231067,0.017815417,0.09261919,0.8749973,0.0001069214],"about_ca_topic_score_codex":0.0010875304,"about_ca_topic_score_gemma":0.00086117676,"teacher_disagreement_score":0.044833414,"about_ca_system_score_codex":0.0015547985,"about_ca_system_score_gemma":0.0011483233,"threshold_uncertainty_score":0.14998275},"labels":[],"label_agreement":null},{"id":"W2645852407","doi":"10.1007/s00446-017-0305-3","title":"Inherent limitations of hybrid transactional memory","year":2017,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy; Agence Nationale de la Recherche; National Science Foundation","keywords":"Transactional memory; Computer science; Instrumentation (computer programming); Software transactional memory; Concurrency; Overhead (engineering); Database transaction; Software; Operating system; Distributed computing; Embedded system; Parallel computing; Programming language","score_opus":0.058459097462485156,"score_gpt":0.27225957813678897,"score_spread":0.21380048067430382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2645852407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38537452,0.027324956,0.49094108,0.011305375,0.0018464471,0.00016517132,0.00057721365,0.0031361412,0.0793291],"genre_scores_gemma":[0.95575434,0.0021445404,0.03585035,0.0004808935,0.00047520845,0.00013593465,0.00014555259,0.0001792039,0.00483402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971655,0.0007106781,0.00016026401,0.00031152755,0.0014100396,0.00024198198],"domain_scores_gemma":[0.98147005,0.010422555,0.0005164348,0.005146555,0.0020896143,0.00035470884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003974942,0.00037381914,0.00091055,0.0007252148,0.0008656724,0.003408688,0.004453442,0.0015889617,0.0074009052],"category_scores_gemma":[0.017256996,0.00062438013,0.00031281466,0.001399871,0.0019683861,0.008172616,0.0021797067,0.0017790571,0.0015502815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017525998,0.00033493162,0.006293323,0.0017154207,0.00025442193,0.0005167584,0.001001749,0.077203386,0.034435067,0.5142206,0.018453015,0.3438187],"study_design_scores_gemma":[0.00020650226,0.0004602978,0.0017978626,0.00021034814,0.0002324151,0.0015329176,0.0005852485,0.41861102,0.03029726,0.5109716,0.03496682,0.00012759525],"about_ca_topic_score_codex":0.00052771176,"about_ca_topic_score_gemma":0.0006269795,"teacher_disagreement_score":0.0074009052,"about_ca_system_score_codex":0.000753009,"about_ca_system_score_gemma":0.0008245474,"threshold_uncertainty_score":0.024758458},"labels":[],"label_agreement":null},{"id":"W26496507","doi":"10.1371/journal.pone.0141051","title":"Using Autonomous Agents to Improve Efficiency and Robustness in Slow, Unreliable Networks","year":2000,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Task (project management); Distributed computing; Robustness (evolution); Function (biology); Autonomous agent; Core (optical fiber); Artificial intelligence","score_opus":0.03579878298114378,"score_gpt":0.23824426869091653,"score_spread":0.20244548570977275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26496507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06539136,0.00046854076,0.92770875,0.0006007021,0.00011434693,0.0001979253,0.00011611273,0.0016756303,0.0037265145],"genre_scores_gemma":[0.8699762,0.00023511003,0.126166,0.00020732249,0.00008019519,0.0003449116,0.00016727507,0.00025368418,0.0025693106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976666,0.00085206074,0.00018050386,0.00050686556,0.0004349494,0.00035902718],"domain_scores_gemma":[0.9800948,0.013459406,0.001731125,0.0022748245,0.0017384128,0.0007013257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053363116,0.0016965775,0.0018215516,0.0014156658,0.0013930597,0.002344506,0.0033227785,0.0016850107,0.0023022406],"category_scores_gemma":[0.026020182,0.0010123864,0.0008211499,0.0008364824,0.0021519933,0.0033571655,0.0041467575,0.0019878007,0.00052481267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016145175,0.0000444577,0.0011403102,0.00007935047,0.000053890923,0.00009464224,0.00012008801,0.96752936,0.0013099299,0.0078730155,0.0007028725,0.0208907],"study_design_scores_gemma":[0.00002295024,0.000036593923,0.00008761396,0.000006992856,0.000009634251,0.000015372309,0.000016623791,0.9934623,0.00035878533,0.0056038294,0.00037401088,0.00000532463],"about_ca_topic_score_codex":0.007989015,"about_ca_topic_score_gemma":0.0053358558,"teacher_disagreement_score":0.007989015,"about_ca_system_score_codex":0.0017185058,"about_ca_system_score_gemma":0.0020213681,"threshold_uncertainty_score":0.028221488},"labels":[],"label_agreement":null},{"id":"W2729364654","doi":"10.1109/isorc.2017.6","title":"A Reordering Framework for Testing Message-Passing Systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Timeout; Debugging; Message passing; Overhead (engineering); Concurrency; Speedup; Process (computing); Isolation (microbiology); Component (thermodynamics); Distributed computing; Blocking (statistics); Operating system; Parallel computing; Computer network","score_opus":0.0700465447451735,"score_gpt":0.3184291099397978,"score_spread":0.2483825651946243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729364654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012859282,0.00019627303,0.978467,0.00006317203,0.000023494358,0.0001567702,0.000065792716,0.0073252968,0.00084282935],"genre_scores_gemma":[0.28090242,0.00021883329,0.71517444,0.00009237037,0.000042967604,0.00030654864,0.00032983086,0.0010812614,0.0018512795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609804,0.0012683822,0.00030183946,0.00049481227,0.0014486789,0.0003882036],"domain_scores_gemma":[0.99497414,0.0023924017,0.0005242827,0.0010271429,0.00088639796,0.0001956532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033635579,0.002326643,0.0010444914,0.001715302,0.00056356925,0.0012454232,0.003687266,0.0010467776,0.0021447896],"category_scores_gemma":[0.006095164,0.0008162825,0.0010653873,0.00065438193,0.001693704,0.002164392,0.001059311,0.0017833028,0.0005498053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067587296,0.0005588921,0.0057595805,0.0007710637,0.0001316526,0.00077561673,0.00097318087,0.4282687,0.13062164,0.08498965,0.0044252775,0.3420488],"study_design_scores_gemma":[0.00010493513,0.00054481253,0.00072561874,0.00008132355,0.00009076036,0.0004060249,0.00009194212,0.87540746,0.085056596,0.02342959,0.0139711965,0.00008969347],"about_ca_topic_score_codex":0.0067809145,"about_ca_topic_score_gemma":0.00436365,"teacher_disagreement_score":0.0067809145,"about_ca_system_score_codex":0.0014236614,"about_ca_system_score_gemma":0.0020083992,"threshold_uncertainty_score":0.01778847},"labels":[],"label_agreement":null},{"id":"W2733710724","doi":"10.1109/ipdps.2017.36","title":"Corrected Gossip Algorithms for Fast Reliable Broadcast on Unreliable Systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Council on Graduate Studies, Council of Ontario Universities","keywords":"Gossip; Computer science; Latency (audio); Broadcasting (networking); Distributed computing; Gossip protocol; Algorithm; Las vegas; Reliability (semiconductor); Computer network; Scalability; Telecommunications","score_opus":0.03612847852043521,"score_gpt":0.2904677314147319,"score_spread":0.2543392528942967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733710724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020464815,0.0003046282,0.976712,0.00015732682,0.000075531025,0.00004862481,0.000031348674,0.000860663,0.0013450751],"genre_scores_gemma":[0.6342516,0.00039463362,0.36186397,0.00011579535,0.00009476229,0.00019246996,0.00011272334,0.00027666398,0.0026973302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991221,0.00031067588,0.000045976853,0.00006970327,0.00036266452,0.000088857974],"domain_scores_gemma":[0.9974602,0.0013717161,0.0002134343,0.0004443672,0.000420568,0.0000897093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013413191,0.00057280634,0.0005990783,0.00076098857,0.0007569996,0.0007420881,0.0011871097,0.0005864347,0.0013918503],"category_scores_gemma":[0.006040146,0.000353347,0.0003636003,0.00070360524,0.0009917921,0.0013414065,0.0010963812,0.001170312,0.0003516281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004397113,0.00006292998,0.0009757343,0.00021830694,0.00009485945,0.00020752395,0.0004596655,0.69398826,0.016736127,0.14392546,0.0045847953,0.1383066],"study_design_scores_gemma":[0.000051054045,0.0000698017,0.000121322,0.000009637454,0.000016651044,0.000050244314,0.000033830085,0.9418736,0.0054189805,0.048587468,0.0037458334,0.000021573755],"about_ca_topic_score_codex":0.0016637525,"about_ca_topic_score_gemma":0.0023103214,"teacher_disagreement_score":0.0016637525,"about_ca_system_score_codex":0.0006816218,"about_ca_system_score_gemma":0.0010000431,"threshold_uncertainty_score":0.0070936084},"labels":[],"label_agreement":null},{"id":"W2735995135","doi":"10.1007/978-3-319-67531-2_22","title":"Event Stream Processing with Multiple Threads","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Event (particle physics); Threading (protein sequence); Property (philosophy); Parallel computing; Extension (predicate logic); Stream processing; Simple (philosophy); Sample (material); Programming language","score_opus":0.01770193912692553,"score_gpt":0.2777150490051311,"score_spread":0.2600131098782056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735995135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06852867,0.00033109248,0.92475206,0.0002892432,0.00033248725,0.00012557425,0.00007160152,0.0032178552,0.0023513646],"genre_scores_gemma":[0.60189134,0.00017195608,0.390562,0.00014232783,0.00028381145,0.00014646356,0.00015951639,0.00026612513,0.0063764257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00027910032,0.00015574812,0.00036814602,0.0004878349,0.00017988545],"domain_scores_gemma":[0.9970415,0.0010399088,0.00013610444,0.0008506423,0.0006443635,0.00028751438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844,0.0007535043,0.0011674272,0.0006135789,0.0008267546,0.0024890027,0.0012070886,0.0008416133,0.0041560326],"category_scores_gemma":[0.005844309,0.0006768581,0.0006133561,0.0008919575,0.0005567523,0.0016210852,0.0018577973,0.001469585,0.0007988251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009654147,0.0010041788,0.009197181,0.00034088214,0.00051379664,0.0010304112,0.0007005032,0.1842309,0.13191676,0.039449584,0.010583059,0.6113786],"study_design_scores_gemma":[0.00026943308,0.00020361085,0.0004771665,0.000008705629,0.00005746291,0.00013259613,0.000037123387,0.9573971,0.024165781,0.014006039,0.00322358,0.000021427806],"about_ca_topic_score_codex":0.0018522781,"about_ca_topic_score_gemma":0.0020843938,"teacher_disagreement_score":0.0041560326,"about_ca_system_score_codex":0.0005228013,"about_ca_system_score_gemma":0.0011359027,"threshold_uncertainty_score":0.01390326},"labels":[],"label_agreement":null},{"id":"W2736699952","doi":"10.1145/3087801.3087837","title":"Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Constant (computer programming); Deadlock; Binary logarithm; Amortized analysis; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Combinatorics; Algorithm; Discrete mathematics; Data structure; Distributed computing","score_opus":0.06984348159744433,"score_gpt":0.2909975523089776,"score_spread":0.22115407071153328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736699952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10268267,0.0006710998,0.87901056,0.0014544791,0.00010055765,0.00020484865,0.00031861753,0.006775997,0.008781055],"genre_scores_gemma":[0.8427842,0.0001919865,0.1516033,0.00041522583,0.00011134801,0.00032107826,0.00042985694,0.00056078756,0.0035822336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393725,0.0019508441,0.00027591755,0.0009549871,0.0015921431,0.0012888509],"domain_scores_gemma":[0.9791358,0.01116477,0.0015491924,0.006388942,0.0011120087,0.00064928614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030866412,0.0011864478,0.0016969346,0.00079296966,0.0017316197,0.00270419,0.0044045667,0.0017843125,0.0033852083],"category_scores_gemma":[0.011944642,0.0005643737,0.0011482965,0.0011640121,0.002398613,0.0058569065,0.00467261,0.0033844488,0.0009541038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026320068,0.00045443876,0.0025379055,0.0005274868,0.0001807342,0.0004325915,0.0006122929,0.46904406,0.029710274,0.37776747,0.015239154,0.10086149],"study_design_scores_gemma":[0.00019351309,0.000121527315,0.00018889646,0.000015845575,0.00005543281,0.0001212985,0.00004074861,0.8468269,0.009962777,0.1399517,0.0024681662,0.000053252446],"about_ca_topic_score_codex":0.0026904538,"about_ca_topic_score_gemma":0.0036416294,"teacher_disagreement_score":0.0044045667,"about_ca_system_score_codex":0.0033495063,"about_ca_system_score_gemma":0.00403225,"threshold_uncertainty_score":0.024302542},"labels":[],"label_agreement":null},{"id":"W2737725874","doi":"10.1145/3087801.3087822","title":"Life Beyond Set Agreement","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Computer science; Programming language","score_opus":0.029118957619733616,"score_gpt":0.27881573536401116,"score_spread":0.24969677774427754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737725874","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03331318,0.015173328,0.43056002,0.042608008,0.002478017,0.00022863477,0.00055265706,0.0010421501,0.47404402],"genre_scores_gemma":[0.77277833,0.008975287,0.1255698,0.009073527,0.0029792544,0.0007837681,0.00079426175,0.0006697488,0.07837608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934556,0.0024632404,0.00038612803,0.0015304931,0.0014450371,0.00071956334],"domain_scores_gemma":[0.9882643,0.0047165276,0.0006999446,0.0034699177,0.0015915025,0.0012578109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052252067,0.000816979,0.0009978457,0.00157171,0.0049028364,0.008953232,0.0017650477,0.003942303,0.012152252],"category_scores_gemma":[0.012058062,0.00063429715,0.0010590284,0.0014048438,0.019615874,0.025185157,0.008287588,0.007326994,0.0039733965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013939694,0.000007326924,0.00009789209,0.000036719124,0.0000038810044,0.000027193479,0.0005907625,0.00035489703,0.00020312458,0.99029785,0.0019109314,0.0064555597],"study_design_scores_gemma":[0.000008656622,0.000025798317,0.00005701271,0.000057533784,0.0000040619116,0.00007169043,0.00016872746,0.0011198214,0.00031955517,0.9275107,0.070644364,0.000012162322],"about_ca_topic_score_codex":0.0017070139,"about_ca_topic_score_gemma":0.0007182748,"teacher_disagreement_score":0.012152252,"about_ca_system_score_codex":0.004127354,"about_ca_system_score_gemma":0.0024536278,"threshold_uncertainty_score":0.040653348},"labels":[],"label_agreement":null},{"id":"W2738585687","doi":"10.82308/55359","title":"Adaptable stateful application server replication","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Stateful firewall; Replication (statistics); Distributed computing; Failover; Application server; High availability; Fault tolerance; Multitier architecture; Architecture; Operating system; Computer network","score_opus":0.022468559685079152,"score_gpt":0.22825107805270814,"score_spread":0.20578251836762898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738585687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044413194,0.00059351354,0.9301628,0.00042483906,0.00030451338,0.00028516905,0.00015827097,0.012709167,0.010948644],"genre_scores_gemma":[0.7374199,0.0007603517,0.23936978,0.00036190162,0.00021093014,0.000384034,0.00069486303,0.0008593372,0.01993896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978929,0.00039432698,0.00018645437,0.00033561772,0.0009054435,0.00028537598],"domain_scores_gemma":[0.9954045,0.0006139957,0.00025821035,0.0026468395,0.0009033501,0.0001730642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016934316,0.0005926642,0.00059630466,0.0006807665,0.0007778132,0.0023467522,0.0023099731,0.00089676585,0.0022517915],"category_scores_gemma":[0.0044622496,0.00057065906,0.00082159525,0.0009110777,0.0009741789,0.003041543,0.0027443927,0.0016686035,0.0012379587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088301604,0.0004531944,0.005828826,0.00045890527,0.00019491863,0.0014347022,0.0016289433,0.19691472,0.14084387,0.2058741,0.022786813,0.42269793],"study_design_scores_gemma":[0.000065868466,0.00015785496,0.0009108389,0.00004424592,0.000056889443,0.00061535416,0.00013390105,0.8477005,0.04306152,0.06089754,0.046264797,0.00009064208],"about_ca_topic_score_codex":0.001259579,"about_ca_topic_score_gemma":0.0012904721,"teacher_disagreement_score":0.0023467522,"about_ca_system_score_codex":0.00074437715,"about_ca_system_score_gemma":0.0011650809,"threshold_uncertainty_score":0.008955836},"labels":[],"label_agreement":null},{"id":"W2739312141","doi":"10.15803/ijnc.7.2_336","title":"On the Cost of Waking Up","year":2017,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Asynchronous communication; Hypercube; Bipartite graph; Broadcasting (networking); Enhanced Data Rates for GSM Evolution; Task (project management); Interconnection; Flooding (psychology); Computer network; Theoretical computer science; Distributed computing; Parallel computing; Graph; Telecommunications","score_opus":0.03430785495083603,"score_gpt":0.30465639012498613,"score_spread":0.2703485351741501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739312141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36019176,0.009766054,0.26418483,0.040093426,0.007651594,0.0007394888,0.0016189201,0.012722343,0.30303162],"genre_scores_gemma":[0.84930426,0.0018576318,0.048780154,0.004180898,0.0004793265,0.00022500273,0.0008335378,0.001559749,0.09277948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984843,0.00036136998,0.00007796162,0.00020556299,0.00049287453,0.00037789586],"domain_scores_gemma":[0.9889008,0.005049813,0.0004297254,0.0033232996,0.0014475652,0.0008488487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014660457,0.0011503465,0.0011695671,0.0008884379,0.0017681429,0.002731714,0.002242119,0.0022282011,0.07681492],"category_scores_gemma":[0.01690529,0.0005945117,0.00083199976,0.0010536164,0.0012015925,0.0071756584,0.002945639,0.0027206244,0.013975653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028032074,0.0006231483,0.005039897,0.000772821,0.00018266069,0.0015964322,0.00073258724,0.050098695,0.036072336,0.14807005,0.09458448,0.65942365],"study_design_scores_gemma":[0.0004999632,0.0024396533,0.014587495,0.00075357815,0.0008873129,0.007093648,0.0053682076,0.3040768,0.034613412,0.3394076,0.2898907,0.00038171207],"about_ca_topic_score_codex":0.0027604604,"about_ca_topic_score_gemma":0.00330817,"teacher_disagreement_score":0.07681492,"about_ca_system_score_codex":0.0008722624,"about_ca_system_score_gemma":0.0013496039,"threshold_uncertainty_score":0.25697148},"labels":[],"label_agreement":null},{"id":"W2739388583","doi":"10.1145/3102980.3102994","title":"Consistency Oracles","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Consistency (knowledge bases); Consistency model; Computer science; Weak consistency; Eventual consistency; Oracle; Data consistency; Strong consistency; Causal consistency; Sequential consistency; Distributed computing; Software; Partition (number theory); Programming language; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.024683389588920364,"score_gpt":0.2751312502238158,"score_spread":0.25044786063489544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739388583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058553414,0.0008610136,0.96527004,0.0011808279,0.000528632,0.0006184111,0.001333943,0.0094619775,0.014889827],"genre_scores_gemma":[0.22758995,0.0019012844,0.74365366,0.0021089965,0.0007836399,0.001386499,0.0044350247,0.0040783123,0.014062665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97151595,0.008685015,0.005441543,0.0032755078,0.008693592,0.0023884876],"domain_scores_gemma":[0.9510994,0.019344678,0.0031938173,0.016559916,0.008445339,0.001356918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018807057,0.0022335132,0.0024130773,0.00300006,0.002351778,0.009669755,0.00669797,0.0044027837,0.012213257],"category_scores_gemma":[0.06420411,0.001925247,0.0032557622,0.0028838,0.00604776,0.0183416,0.00834202,0.0071826805,0.00470054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025397757,0.00012288502,0.0020634364,0.00052087125,0.0000812297,0.00039373353,0.0008268186,0.009367657,0.003062148,0.9201645,0.011507245,0.0516356],"study_design_scores_gemma":[0.00020987102,0.00019528391,0.0004043206,0.00047949026,0.00020807958,0.00085112615,0.0004774458,0.06856926,0.016506756,0.71740514,0.19452068,0.00017267915],"about_ca_topic_score_codex":0.0032420226,"about_ca_topic_score_gemma":0.002107358,"teacher_disagreement_score":0.018807057,"about_ca_system_score_codex":0.0022209182,"about_ca_system_score_gemma":0.004467097,"threshold_uncertainty_score":0.09946239},"labels":[],"label_agreement":null},{"id":"W2754073485","doi":"10.1109/hpcs.2017.100","title":"An Efficient Transaction-Based GPU Implementation of Minimum Spanning Forest Algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Computer science; Parallel computing; Scalability; Distributed computing; Compiler; Algorithm; Operating system","score_opus":0.015929630507476523,"score_gpt":0.3081601570857995,"score_spread":0.292230526578323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754073485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18362105,0.0008102131,0.7854272,0.00028374983,0.00019417252,0.00017435633,0.00047956343,0.013865048,0.015144629],"genre_scores_gemma":[0.54513025,0.00021439904,0.44809532,0.00007928277,0.000019420278,0.00013209529,0.0010038088,0.00032501284,0.0050004018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997677,0.000033804783,0.000023878229,0.00003613501,0.000099740006,0.000038788807],"domain_scores_gemma":[0.9997552,0.000042352436,0.0000180496,0.00006293445,0.00009751894,0.00002403736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019214742,0.00029574105,0.00037038868,0.0004018103,0.000385225,0.0005595685,0.0014681846,0.00037647024,0.004043881],"category_scores_gemma":[0.00089575176,0.00020591983,0.0002798719,0.0008377894,0.00019394039,0.00068250485,0.000446196,0.0004471136,0.00083228486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012658893,0.00037309702,0.008168714,0.00043613426,0.00016758605,0.00088879373,0.00042561375,0.180627,0.111874394,0.02549568,0.023674658,0.6466024],"study_design_scores_gemma":[0.00013645951,0.000228911,0.0010163707,0.0000148142835,0.000025951396,0.00026482344,0.0000585336,0.9593046,0.022632916,0.0031429073,0.013148475,0.000025342184],"about_ca_topic_score_codex":0.005674079,"about_ca_topic_score_gemma":0.007607324,"teacher_disagreement_score":0.005674079,"about_ca_system_score_codex":0.00036199222,"about_ca_system_score_gemma":0.0008848158,"threshold_uncertainty_score":0.013528109},"labels":[],"label_agreement":null},{"id":"W2758674126","doi":"10.1002/cpe.4183","title":"Fast mutual exclusion by the Triangle algorithm","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Thread (computing); Computer science; Critical section; Software; Algorithm; Lock (firearm); Parallel computing; Linux kernel; Theoretical computer science; Operating system","score_opus":0.021763926036587677,"score_gpt":0.326384382161828,"score_spread":0.30462045612524036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758674126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018202282,0.0002545948,0.9698747,0.00031047233,0.00015049412,0.00007994848,0.00004409485,0.0014673984,0.009616063],"genre_scores_gemma":[0.40160024,0.000268006,0.58564675,0.0002180661,0.00012967749,0.0002466572,0.00027152977,0.00046371535,0.011155363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.00039872344,0.00010154545,0.00022897396,0.00067676924,0.00023063408],"domain_scores_gemma":[0.997542,0.0008656274,0.00017172628,0.00062755705,0.00063978625,0.0001533327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012074204,0.00050827203,0.0007551285,0.00082577905,0.00087769155,0.001072053,0.0017716367,0.0006882193,0.0068199034],"category_scores_gemma":[0.0049226577,0.00024669577,0.0005334897,0.0010236246,0.00082016375,0.0018496237,0.00232361,0.0011856491,0.0017050073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010273879,0.00017022493,0.0013243415,0.00023930911,0.00006982234,0.00014339667,0.00035108594,0.19578212,0.017642295,0.24618232,0.016397642,0.5206701],"study_design_scores_gemma":[0.00013175268,0.00010057456,0.00011174476,0.000020438863,0.000013045754,0.000094468254,0.000037052945,0.91237974,0.0061939857,0.06751441,0.013381191,0.000021580994],"about_ca_topic_score_codex":0.002619817,"about_ca_topic_score_gemma":0.0024212294,"teacher_disagreement_score":0.0068199034,"about_ca_system_score_codex":0.0009505262,"about_ca_system_score_gemma":0.0014951556,"threshold_uncertainty_score":0.02281487},"labels":[],"label_agreement":null},{"id":"W2759265794","doi":"10.1145/3127479.3127487","title":"ALOHA-KV","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Aloha; Computer science; Telecommunications; Throughput; Wireless","score_opus":0.017980257548796136,"score_gpt":0.2692528483132126,"score_spread":0.2512725907644165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759265794","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013575869,0.0031331927,0.09234604,0.007465265,0.005595562,0.00043028058,0.002081749,0.010005217,0.8653668],"genre_scores_gemma":[0.16333531,0.0020895628,0.07385623,0.004293945,0.0011276772,0.00037771874,0.004671705,0.0020677422,0.74818003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980849,0.0003431759,0.00012742283,0.0005129729,0.0006253051,0.00030614555],"domain_scores_gemma":[0.9974099,0.00033691223,0.00010342736,0.0008293287,0.0009843663,0.00033603815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010368347,0.00053204666,0.00058822066,0.0012622391,0.0023314175,0.0040833936,0.002416683,0.001768856,0.21328317],"category_scores_gemma":[0.0041696345,0.00041647386,0.0006347035,0.0014866034,0.00095257285,0.0046255495,0.0043718237,0.0018040807,0.095607266],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008955429,0.00016967961,0.0016049686,0.00071611523,0.00006308414,0.0005160352,0.00050145993,0.0015693543,0.0047089183,0.13846268,0.19766663,0.6531255],"study_design_scores_gemma":[0.00009144137,0.00007392679,0.00045082523,0.0001900906,0.00003748286,0.000641184,0.0002981603,0.00474526,0.0034311058,0.04786534,0.94213945,0.000035638303],"about_ca_topic_score_codex":0.0016114616,"about_ca_topic_score_gemma":0.0021054568,"teacher_disagreement_score":0.21328317,"about_ca_system_score_codex":0.0014933932,"about_ca_system_score_gemma":0.0021710838,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2765782779","doi":"10.14778/3151106.3151107","title":"Scalable replay-based replication for fast databases","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backup; Computer science; Scalability; Bottleneck; Transaction log; Backup software; Replication (statistics); Database; Fault tolerance; Computer network; Database transaction; Bandwidth (computing); High availability; Throughput; Distributed computing; Operating system; Embedded system","score_opus":0.038431743002288236,"score_gpt":0.292418312224537,"score_spread":0.25398656922224877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765782779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062307183,0.0021225128,0.9236784,0.0004686229,0.0002109362,0.00019312819,0.00027180975,0.0072370055,0.0035103587],"genre_scores_gemma":[0.70718056,0.00091629784,0.28626624,0.00016202162,0.00020856393,0.00024867788,0.0006093559,0.00031888604,0.0040894053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983455,0.00037743006,0.00014214132,0.00029837876,0.0006284139,0.00020819192],"domain_scores_gemma":[0.99645954,0.00062854687,0.00025308115,0.001676694,0.0008395651,0.00014254304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016494234,0.0005955813,0.0009994035,0.0007903667,0.0010154718,0.0012118609,0.0021977066,0.00074349844,0.0023406155],"category_scores_gemma":[0.0041582654,0.0005048612,0.0006201468,0.0009858547,0.0005764005,0.002560643,0.0023462535,0.0011395246,0.0011735467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001544437,0.00040860428,0.0028537298,0.00071319303,0.00023434182,0.00084669294,0.0006327295,0.20675492,0.24168737,0.049650762,0.024688732,0.4699844],"study_design_scores_gemma":[0.00017710819,0.00043099048,0.0009643317,0.000044122182,0.00008961072,0.0006599533,0.00017472645,0.89764273,0.057683643,0.021484884,0.020552069,0.00009575277],"about_ca_topic_score_codex":0.0018382714,"about_ca_topic_score_gemma":0.0018843182,"teacher_disagreement_score":0.0023406155,"about_ca_system_score_codex":0.00082879787,"about_ca_system_score_gemma":0.0012329803,"threshold_uncertainty_score":0.00872308},"labels":[],"label_agreement":null},{"id":"W2765883112","doi":"10.23638/lmcs-14(1:12)2018","title":"Automated Synthesis of Distributed Self-Stabilizing Protocols","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Computer science; Token ring; Dijkstra's algorithm; Distributed computing; Monotonic function; Protocol (science); Ideal (ethics); Self-stabilization; State (computer science); Set (abstract data type); Security token; Leader election; Theoretical computer science; Distributed algorithm; Topology (electrical circuits); Algorithm; Computer network; Mathematics; Graph; Programming language","score_opus":0.07643261077141357,"score_gpt":0.4151600025821575,"score_spread":0.33872739181074396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765883112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009801869,0.0000485429,0.98643064,0.000065063236,0.000026223594,0.00006349757,0.000055977765,0.0012276847,0.0022806118],"genre_scores_gemma":[0.25339103,0.00015342406,0.7431851,0.00004572315,0.000015355337,0.0002602529,0.00029103333,0.00042708998,0.0022310524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899596,0.00027017115,0.00007636867,0.00015757591,0.0004384152,0.000061621635],"domain_scores_gemma":[0.998692,0.0006790087,0.000088340064,0.000284478,0.00022038174,0.000035895722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443964,0.000562634,0.00041546545,0.0004961504,0.00048061827,0.0007010812,0.000942224,0.000488267,0.0024983694],"category_scores_gemma":[0.0029890295,0.00040587256,0.0006457899,0.00027921572,0.0008967001,0.00082236476,0.0011010555,0.00075110374,0.0005146139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013316903,0.00012240291,0.0009842792,0.0006427204,0.000079077814,0.00049832277,0.00052296335,0.48928246,0.1082363,0.21364456,0.0027847155,0.18306907],"study_design_scores_gemma":[0.00005252434,0.000057468544,0.00008827239,0.0000452811,0.000026080033,0.00009090083,0.00006404761,0.8804877,0.05515043,0.05062761,0.013296303,0.000013433662],"about_ca_topic_score_codex":0.00045312717,"about_ca_topic_score_gemma":0.00081014837,"teacher_disagreement_score":0.0024983694,"about_ca_system_score_codex":0.0006110904,"about_ca_system_score_gemma":0.0010970995,"threshold_uncertainty_score":0.008357823},"labels":[],"label_agreement":null},{"id":"W2766916843","doi":"10.1145/3110214","title":"Blazes","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Debugging; Consistency (knowledge bases); Scalability; Distributed computing; Programming language; Database; Artificial intelligence","score_opus":0.03784811562260383,"score_gpt":0.288350591027029,"score_spread":0.25050247540442516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766916843","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018104099,0.0019864016,0.39834058,0.0041402024,0.0017200253,0.00067939825,0.018431688,0.21996705,0.3366305],"genre_scores_gemma":[0.13888545,0.0023145822,0.26824355,0.0036659995,0.0005123036,0.00076159806,0.044067767,0.0471832,0.49436566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998725,0.00015770226,0.00008425568,0.0002863727,0.00058527105,0.00016137911],"domain_scores_gemma":[0.9982772,0.00028461107,0.000107140346,0.0006670548,0.00053478597,0.00012930422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012526929,0.0010970843,0.0005866899,0.001251886,0.0012119695,0.0032391194,0.002169505,0.0011789454,0.12657598],"category_scores_gemma":[0.0038946061,0.0007226714,0.0007934598,0.0008883757,0.0008143197,0.0048178555,0.0033950054,0.0020781315,0.07684606],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008645735,0.00019996821,0.0033592586,0.00087926706,0.00008109592,0.0003465731,0.00087289145,0.004466765,0.018140543,0.16761847,0.44459453,0.35857597],"study_design_scores_gemma":[0.00005149277,0.000053961954,0.00073983206,0.000095073585,0.000024174005,0.00023939842,0.00011656416,0.0075496137,0.009382621,0.021506313,0.9602034,0.00003758546],"about_ca_topic_score_codex":0.004654299,"about_ca_topic_score_gemma":0.0066144494,"teacher_disagreement_score":0.12657598,"about_ca_system_score_codex":0.0011936852,"about_ca_system_score_gemma":0.0018791505,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2767391894","doi":"10.48550/arxiv.1711.02455","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Upper and lower bounds; Impossibility; Combinatorics; Snapshot (computer storage); Discrete mathematics; Computer science; Mathematics; Algorithm","score_opus":0.08944707148155469,"score_gpt":0.22081385442992357,"score_spread":0.1313667829483689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767391894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03104811,0.00047547847,0.94793653,0.0030956415,0.00017503924,0.00020267337,0.0002772545,0.0012034798,0.015585679],"genre_scores_gemma":[0.62835515,0.0013047245,0.34949112,0.0024072325,0.0011748183,0.0012343109,0.000928424,0.0013501175,0.0137541415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9826638,0.006395229,0.001078427,0.0030922801,0.0045238147,0.0022464027],"domain_scores_gemma":[0.8983725,0.077066764,0.0033081402,0.015407326,0.003615084,0.002230207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010353641,0.0026538079,0.0024701627,0.0025959082,0.0033599955,0.0073366216,0.0059948433,0.0031490673,0.0127355205],"category_scores_gemma":[0.05180539,0.0019708383,0.0071962504,0.0026837524,0.010377539,0.02569878,0.015721135,0.0150181465,0.0017986054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034417206,0.00015577376,0.001509431,0.00029459855,0.00015559499,0.00022219894,0.00077453157,0.045426548,0.0051145586,0.9242645,0.0024729911,0.01926497],"study_design_scores_gemma":[0.00007004347,0.00016741038,0.00028825627,0.000089529734,0.00009874416,0.00011190492,0.0001253107,0.1580459,0.0065682954,0.82697004,0.0073868455,0.00007776164],"about_ca_topic_score_codex":0.002369397,"about_ca_topic_score_gemma":0.002397188,"teacher_disagreement_score":0.0127355205,"about_ca_system_score_codex":0.0047609895,"about_ca_system_score_gemma":0.0044181244,"threshold_uncertainty_score":0.054755926},"labels":[],"label_agreement":null},{"id":"W2770467610","doi":"10.1145/3143361.3143394","title":"Canopus","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network topology; Consensus; Set (abstract data type); Uniform consensus; Distributed computing; Consensus conference; Computer network; Topology (electrical circuits); Multi-agent system; Artificial intelligence; Mathematics","score_opus":0.01624287539169764,"score_gpt":0.26438292405820146,"score_spread":0.24814004866650383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770467610","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015007182,0.0018875023,0.011976892,0.0028720184,0.0024629245,0.0004091808,0.015465395,0.01456722,0.94885826],"genre_scores_gemma":[0.017837934,0.002545073,0.010303551,0.00277214,0.00048656168,0.00042693186,0.029212905,0.004407222,0.9320077],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986331,0.00018211806,0.00008267154,0.00031915563,0.0005744943,0.0002084657],"domain_scores_gemma":[0.99776447,0.00030924584,0.00011224757,0.00064005953,0.0007511288,0.00042286835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020036,0.0015194489,0.0012081336,0.0034153764,0.0026345192,0.005751602,0.0027548177,0.002869735,0.6953427],"category_scores_gemma":[0.0046183295,0.0006901089,0.00095169066,0.002885033,0.00085941143,0.0046892767,0.004333991,0.0022480001,0.5317426],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048985396,0.00012322544,0.0006004433,0.0008257032,0.00003569564,0.0003509816,0.0002456149,0.00057839655,0.0026371588,0.04089472,0.7321381,0.2210801],"study_design_scores_gemma":[0.000027052678,0.000021165011,0.00015525901,0.00007651673,0.000009615951,0.00008242701,0.00003799742,0.00019923392,0.0005126981,0.0036187076,0.99524826,0.000011089053],"about_ca_topic_score_codex":0.0056384695,"about_ca_topic_score_gemma":0.0070670135,"teacher_disagreement_score":0.6953427,"about_ca_system_score_codex":0.0014627499,"about_ca_system_score_gemma":0.0026966725,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2771425872","doi":"10.21203/rs.3.rs-2540689/v1","title":"Cost of Concurrency in Hybrid Transactional Memory","year":2023,"lang":"en","type":"article","venue":"Research Square","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto; Ontario Centres of Excellence","keywords":"Transactional memory; Computer science; Concurrency; Multiversion concurrency control; Concurrency control; Parallel computing; Software transactional memory; Programming language; Distributed concurrency control; Database transaction","score_opus":0.11149595535812963,"score_gpt":0.40978261652736836,"score_spread":0.29828666116923874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771425872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7377899,0.0011036298,0.25652328,0.00032407415,0.0000387696,0.00007919301,0.00005536477,0.0014984494,0.0025872865],"genre_scores_gemma":[0.9717453,0.00005751467,0.027781291,0.00002615571,0.000006277436,0.00002724626,0.000023974744,0.000041921336,0.00029040652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962368,0.0012112272,0.00030371116,0.00047149515,0.0012547378,0.00052201154],"domain_scores_gemma":[0.9739562,0.016702143,0.0018912654,0.0049190964,0.0019251835,0.0006061872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038146372,0.00062164635,0.0008024177,0.0008986498,0.00077236886,0.002560347,0.0029630738,0.0007453976,0.0013942264],"category_scores_gemma":[0.018395718,0.00056639046,0.0003592236,0.0014913263,0.0021647122,0.005087678,0.0023992495,0.0011342787,0.00018713856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004605192,0.0005956314,0.0187644,0.00051020866,0.00019530831,0.0004637084,0.0006541688,0.6136631,0.08494727,0.07644368,0.0015455369,0.19761188],"study_design_scores_gemma":[0.00008713846,0.0002969209,0.00072372163,0.000017095028,0.000055808356,0.00013565304,0.00009679009,0.9490517,0.026380286,0.02261508,0.00051946385,0.000020311692],"about_ca_topic_score_codex":0.0011164342,"about_ca_topic_score_gemma":0.0011105663,"teacher_disagreement_score":0.0038146372,"about_ca_system_score_codex":0.0014587917,"about_ca_system_score_gemma":0.0011643143,"threshold_uncertainty_score":0.020173967},"labels":[],"label_agreement":null},{"id":"W2777032998","doi":"10.1002/cpe.4397","title":"Improving performance of transactional memory through machine learning","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Benchmark (surveying); Exploit; Overhead (engineering); Parallel computing; Database transaction; Software; Embedded system; Distributed computing; Operating system; Database","score_opus":0.023908557378091763,"score_gpt":0.30670713754821877,"score_spread":0.282798580170127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777032998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5916828,0.0035260639,0.38894904,0.0010152458,0.00013485443,0.00009521851,0.00025748665,0.009474346,0.0048648682],"genre_scores_gemma":[0.8937047,0.00030280135,0.10463502,0.000101990794,0.000044036417,0.000045407945,0.00025564086,0.00013182501,0.00077856274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998885,0.00031454468,0.000090833,0.0002657162,0.00033093808,0.000113060305],"domain_scores_gemma":[0.995904,0.002104621,0.00044103013,0.00057550333,0.0008778948,0.00009687859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835685,0.0008523648,0.0006872218,0.001028373,0.00034366068,0.000856717,0.0013548881,0.000409202,0.0011346705],"category_scores_gemma":[0.0052179545,0.0002611435,0.00041534766,0.0010945591,0.000367125,0.0014178718,0.00039244542,0.0009909752,0.00035124668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045235798,0.0004135356,0.012795396,0.0001419288,0.00010656062,0.000047867386,0.00003528793,0.5236889,0.019273346,0.0013983959,0.0029673942,0.43867892],"study_design_scores_gemma":[0.000007513802,0.00004399452,0.00045422494,0.0000038042306,0.000009786808,0.000007066316,0.0000058904334,0.9939512,0.0046050884,0.00069251953,0.00021404943,0.0000048594243],"about_ca_topic_score_codex":0.004137324,"about_ca_topic_score_gemma":0.003974636,"teacher_disagreement_score":0.004137324,"about_ca_system_score_codex":0.00079940795,"about_ca_system_score_gemma":0.0011664013,"threshold_uncertainty_score":0.008226514},"labels":[],"label_agreement":null},{"id":"W2786219394","doi":"10.1109/hpcc-smartcity-dss.2017.74","title":"Adaptive Deadlock Detection and Resolution in Real-Time Distributed Environments","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Distributed computing; Workload; Deadlock prevention algorithms; Concurrency control; Transaction processing; Distributed transaction; Protocol (science); Overhead (engineering); Deadlock; Database transaction; Real-time computing; Computer network; Operating system; Database","score_opus":0.015295460711388499,"score_gpt":0.2336596082993405,"score_spread":0.218364147587952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786219394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36068302,0.0008062089,0.63490915,0.00017736958,0.00005200363,0.00012638721,0.000033239245,0.0018210271,0.0013917001],"genre_scores_gemma":[0.9041141,0.00014891598,0.09505027,0.00003864552,0.000011445994,0.000111413414,0.00004752565,0.00006562481,0.00041205698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596643,0.0021934193,0.00020907639,0.0004910445,0.0008184992,0.00032145492],"domain_scores_gemma":[0.9890209,0.0070113745,0.0011842644,0.0016382814,0.000808267,0.00033684107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066392287,0.00048441533,0.0006699382,0.0010703115,0.00074455707,0.0009418686,0.0016882947,0.0009295599,0.0006420292],"category_scores_gemma":[0.016064648,0.0005902582,0.0004084829,0.0008355615,0.0019277061,0.0021708617,0.0014203233,0.00096563075,0.00014462002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042263215,0.00022900036,0.008068292,0.00018866523,0.00010972206,0.0002826779,0.000433524,0.8767267,0.023357468,0.010050215,0.00047838007,0.0796527],"study_design_scores_gemma":[0.000071706345,0.00017271448,0.0009063528,0.000011433649,0.000026183689,0.00014356752,0.000055389497,0.9809653,0.0094966935,0.0074903048,0.0006322063,0.000028210708],"about_ca_topic_score_codex":0.0012278863,"about_ca_topic_score_gemma":0.00086530665,"teacher_disagreement_score":0.0066392287,"about_ca_system_score_codex":0.0006501671,"about_ca_system_score_gemma":0.0009796582,"threshold_uncertainty_score":0.035112023},"labels":[],"label_agreement":null},{"id":"W2786902291","doi":"10.1002/cpe.4475","title":"High‐contention mutual exclusion by elevator algorithms","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Thread (computing); Critical section; Algorithm; Software; Parallel computing; Concurrency; Operating system; Theoretical computer science","score_opus":0.016763403937617015,"score_gpt":0.30754542772180704,"score_spread":0.29078202378419005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786902291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12818685,0.00072775147,0.85465693,0.00042944794,0.00014218499,0.000089807174,0.00006996344,0.0031241719,0.012572859],"genre_scores_gemma":[0.66296595,0.00021003828,0.3303303,0.000109090375,0.000081614344,0.000103652055,0.00017222941,0.00021542027,0.005811693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.00039837408,0.000081518825,0.0001555726,0.00046968195,0.00020406517],"domain_scores_gemma":[0.9972108,0.0012253302,0.00022689925,0.00070785417,0.00048942,0.00013967385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567991,0.00046282963,0.0006216345,0.00069182,0.00092277786,0.0010583078,0.0019298824,0.0005031569,0.0035957783],"category_scores_gemma":[0.0033862896,0.00025000912,0.00044140377,0.0007407375,0.00067977,0.0016030067,0.0017519672,0.00108782,0.0007052668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012667929,0.00030471024,0.0041348785,0.00025601342,0.00013849375,0.00016392735,0.00037934713,0.4686196,0.021405818,0.12227965,0.010398822,0.37065196],"study_design_scores_gemma":[0.000113197166,0.00007853675,0.00033871806,0.000014225639,0.000017885335,0.00007428715,0.000029997182,0.9560783,0.009746246,0.026564408,0.0069233403,0.000020831894],"about_ca_topic_score_codex":0.0016176092,"about_ca_topic_score_gemma":0.0023618303,"teacher_disagreement_score":0.0035957783,"about_ca_system_score_codex":0.0010475043,"about_ca_system_score_gemma":0.0014450441,"threshold_uncertainty_score":0.012029052},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024349013921160394,"score_gpt":0.2591629562395728,"score_spread":0.2348139423184124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791526170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10211343,0.008068644,0.8074611,0.00051357923,0.0006007947,0.00037901112,0.0032832497,0.05490519,0.022675041],"genre_scores_gemma":[0.5429686,0.0023322357,0.41308543,0.0006378849,0.00021445307,0.0006226764,0.011410766,0.003927645,0.024800362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995858,0.000028586379,0.0000335848,0.000040532683,0.00025614904,0.00005530733],"domain_scores_gemma":[0.9994018,0.000095405136,0.00007582967,0.0001638327,0.00020185232,0.00006136617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026611178,0.00036020164,0.00039229618,0.0010443452,0.00051621103,0.0011831502,0.0019511488,0.0004372377,0.0056242216],"category_scores_gemma":[0.0010082782,0.00031900738,0.000247334,0.0013721433,0.00029028507,0.0023210228,0.0012947761,0.00065309094,0.0027030844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016292457,0.00025554735,0.004006941,0.0010192015,0.00014629694,0.000510006,0.000395564,0.009983262,0.23651907,0.029464679,0.10342148,0.6126488],"study_design_scores_gemma":[0.00070206093,0.0017454068,0.0051034708,0.00018384894,0.00016499078,0.0016926908,0.00027817767,0.22746651,0.40816092,0.024687236,0.3294839,0.00033081925],"about_ca_topic_score_codex":0.0014116378,"about_ca_topic_score_gemma":0.0019002435,"teacher_disagreement_score":0.0056242216,"about_ca_system_score_codex":0.0005346498,"about_ca_system_score_gemma":0.00082502404,"threshold_uncertainty_score":0.018814921},"labels":[],"label_agreement":null},{"id":"W2794802501","doi":"10.1109/hpca.2018.00029","title":"High-Performance GPU Transactional Memory via Eager Conflict Detection","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Parallel computing; Thread (computing); Cache coherence; Concurrency; Cache; Latency (audio); Multi-core processor; CAS latency; Scalability; Operating system; CPU cache; Cache algorithms; Database transaction","score_opus":0.010726612010823823,"score_gpt":0.2166024856479129,"score_spread":0.2058758736370891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794802501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30159584,0.002255208,0.6666304,0.00058449,0.00030049199,0.00019235174,0.00025851635,0.014633566,0.013549142],"genre_scores_gemma":[0.87320185,0.00017492811,0.12275465,0.00019164846,0.00004899563,0.00011111602,0.00017508584,0.0002130127,0.003128747],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991431,0.00017968989,0.00006633205,0.00016337873,0.00032252143,0.00012491539],"domain_scores_gemma":[0.99833614,0.00033683493,0.0001633611,0.0007263083,0.0003292864,0.00010799445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006353066,0.00051406695,0.0004921854,0.00053843757,0.0005358469,0.0014869134,0.0025979213,0.0004860663,0.0026826158],"category_scores_gemma":[0.002930309,0.00034411805,0.0002633779,0.00092859,0.00069464603,0.0020206096,0.0013312681,0.0010713317,0.00050576986],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021859373,0.00043243228,0.014433991,0.00054437586,0.00023055325,0.00068982877,0.0007173043,0.12228267,0.14422314,0.048137106,0.024671512,0.6414512],"study_design_scores_gemma":[0.00022272546,0.00053987664,0.0012993247,0.00004258775,0.000083402105,0.00034706527,0.00011815072,0.87745255,0.08658984,0.017354365,0.015893066,0.00005697453],"about_ca_topic_score_codex":0.00210431,"about_ca_topic_score_gemma":0.0036704247,"teacher_disagreement_score":0.0026826158,"about_ca_system_score_codex":0.00080925756,"about_ca_system_score_gemma":0.0010421145,"threshold_uncertainty_score":0.008974254},"labels":[],"label_agreement":null},{"id":"W2795589868","doi":"10.1016/j.dam.2018.03.033","title":"Optimal odd gossiping","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Nantes; Université Nice Sophia Antipolis","keywords":"Gossip; Computer science; Node (physics); Pairwise comparison; Conjecture; Computer network; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Psychology","score_opus":0.014437536862694585,"score_gpt":0.251516784337339,"score_spread":0.2370792474746444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795589868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32424027,0.00094427285,0.57174414,0.0024706717,0.0009384125,0.00018540236,0.0007377248,0.0011836326,0.09755555],"genre_scores_gemma":[0.9050543,0.00041979746,0.078590825,0.00032808864,0.00018236866,0.000102624355,0.00032824263,0.00027446524,0.014719338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924755,0.00020950187,0.000043846478,0.00013677162,0.00013817138,0.00022415756],"domain_scores_gemma":[0.9974196,0.0010723999,0.00017318927,0.00067649875,0.00024716233,0.00041108785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013594726,0.0007715189,0.0012563313,0.0007191426,0.0010803425,0.0017815102,0.0013281216,0.00092574157,0.008439695],"category_scores_gemma":[0.007325583,0.00038030432,0.00048883306,0.00072891894,0.0013300616,0.0028654689,0.002695589,0.0016290434,0.0005680169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499987,0.00013784131,0.000683746,0.00024609434,0.000042171538,0.00008728317,0.00017795632,0.07551576,0.007819863,0.84217745,0.012364315,0.059297524],"study_design_scores_gemma":[0.0001107502,0.00010667445,0.0003188485,0.00003093731,0.000040366525,0.00007450757,0.000078750476,0.32399464,0.0028661648,0.66806,0.0042918078,0.000026654145],"about_ca_topic_score_codex":0.0006947708,"about_ca_topic_score_gemma":0.0013515281,"teacher_disagreement_score":0.008439695,"about_ca_system_score_codex":0.0010426397,"about_ca_system_score_gemma":0.0014903807,"threshold_uncertainty_score":0.028233588},"labels":[],"label_agreement":null},{"id":"W2798304533","doi":"10.1145/3183713.3196912","title":"Carousel","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Distributed transaction; Computer science; Commit; Transaction processing; Online transaction processing; Database transaction; Compensating transaction; Serializability; Transaction processing system; Distributed database; Nested transaction; Database; Distributed computing","score_opus":0.008907207744108159,"score_gpt":0.23127297076973116,"score_spread":0.222365763025623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798304533","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021636852,0.0024395722,0.010419042,0.0049599498,0.001849702,0.00021777311,0.0034132872,0.011580136,0.9629567],"genre_scores_gemma":[0.010604278,0.0015444796,0.007818697,0.0020111343,0.0003756034,0.00012571034,0.0041570854,0.0028949054,0.9704681],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884725,0.000097376775,0.00003721017,0.00027964538,0.0006083194,0.00013010832],"domain_scores_gemma":[0.99836594,0.00020200844,0.00006632017,0.00030901027,0.00064546353,0.0004113837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081473606,0.0009838997,0.0005056599,0.0027153858,0.0022326345,0.0037116588,0.0016724794,0.00208599,0.55149263],"category_scores_gemma":[0.0030743903,0.00049191614,0.00048017406,0.0017184312,0.00077482814,0.0039506233,0.0030368604,0.0016724707,0.35221377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020905219,0.00006713826,0.00056196697,0.00022935797,0.000010332518,0.00025385653,0.0002053265,0.00016733525,0.0026637118,0.026494313,0.7303696,0.23876798],"study_design_scores_gemma":[0.000011416229,0.000013173464,0.00016544724,0.00003216451,0.000002650694,0.000120320794,0.00003321788,0.0001608181,0.00050790916,0.0017188254,0.9972264,0.000007639879],"about_ca_topic_score_codex":0.0054194178,"about_ca_topic_score_gemma":0.010465654,"teacher_disagreement_score":0.55149263,"about_ca_system_score_codex":0.0014303098,"about_ca_system_score_gemma":0.0017708745,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2800247627","doi":"10.4212/cjhp.v52i6.1871","title":"Entry-Level PharmD on the Horizon","year":2018,"lang":"en","type":"article","venue":"The Canadian Journal of Hospital Pharmacy","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.03517906728318412,"score_gpt":0.26975318684622923,"score_spread":0.2345741195630451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800247627","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0839707,0.0052143834,0.0042326124,0.44696435,0.00968456,0.00025148815,0.005206656,0.0011690937,0.4433062],"genre_scores_gemma":[0.6530597,0.0077954726,0.004701722,0.076599434,0.005331767,0.000086927204,0.004196492,0.0002399462,0.24798854],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710363,0.0002332893,0.000108316024,0.00025515942,0.0012501464,0.001049531],"domain_scores_gemma":[0.98546267,0.000651813,0.00077265827,0.0003253228,0.0018366496,0.01095091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010665654,0.00023065621,0.00056503405,0.0005623105,0.0022831452,0.0031349238,0.0010159488,0.0021396962,0.08720604],"category_scores_gemma":[0.008202976,0.00021967903,0.00051817036,0.00069436734,0.00054854876,0.001944519,0.0021449602,0.0032017513,0.011967981],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007543187,0.00068151206,0.035401426,0.0001635937,0.000066730696,0.002360937,0.00025619735,0.0011438295,0.0007244865,0.0140388515,0.7007204,0.24368773],"study_design_scores_gemma":[0.00047264615,0.0012472213,0.077774204,0.00056721864,0.0001168375,0.0032219298,0.0018566254,0.005132752,0.0013519803,0.021277461,0.8869012,0.000079926554],"about_ca_topic_score_codex":0.027368579,"about_ca_topic_score_gemma":0.061831053,"teacher_disagreement_score":0.08720604,"about_ca_system_score_codex":0.006016161,"about_ca_system_score_gemma":0.018111851,"threshold_uncertainty_score":0.29173326},"labels":[],"label_agreement":null},{"id":"W2800563874","doi":"10.3233/hsn-2005-257","title":"Transformations of self-stabilizing algorithms","year":2005,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.00907508062188082,"score_gpt":0.23040092510521024,"score_spread":0.22132584448332943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800563874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042229533,0.00009220492,0.945849,0.0001981846,0.000093676776,0.00013609303,0.000071526236,0.002729248,0.008600586],"genre_scores_gemma":[0.780024,0.00019589835,0.21023117,0.00025658938,0.000082638035,0.0002826653,0.00027355182,0.00075669045,0.007896778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977182,0.00038451646,0.00015687838,0.00042655595,0.001108259,0.00020562536],"domain_scores_gemma":[0.9967175,0.0010908453,0.0002764873,0.0012451336,0.0005851874,0.000084822954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633897,0.00045456804,0.00039003717,0.0004891276,0.00061717886,0.0010302999,0.0011594903,0.0006131419,0.0037504255],"category_scores_gemma":[0.0055638193,0.00031615555,0.00096075324,0.00032213848,0.0015433456,0.002141337,0.0014966968,0.0017353145,0.00090004096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034771723,0.00023040929,0.0013989084,0.00021864117,0.00009472143,0.00042790553,0.0008549383,0.12288054,0.04960868,0.7139532,0.0029668787,0.10701742],"study_design_scores_gemma":[0.000120315264,0.00023057005,0.00026190124,0.000039332477,0.00005880879,0.0002650625,0.00012649302,0.48083103,0.08459759,0.4129343,0.020501934,0.000032606742],"about_ca_topic_score_codex":0.0006131148,"about_ca_topic_score_gemma":0.0004537667,"teacher_disagreement_score":0.0037504255,"about_ca_system_score_codex":0.0007170601,"about_ca_system_score_gemma":0.00086903654,"threshold_uncertainty_score":0.0125463605},"labels":[],"label_agreement":null},{"id":"W2800605324","doi":"10.4230/lipics.disc.2018.21","title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Computer science; Omega; Constant (computer programming); Set (abstract data type); Upper and lower bounds; Cache; Theoretical computer science; Parallel computing; Mathematics; Programming language","score_opus":0.018384321435701824,"score_gpt":0.2866736917350727,"score_spread":0.26828937029937083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800605324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07888873,0.004358439,0.84753084,0.011463273,0.0011932418,0.00082210975,0.0016429396,0.0130710285,0.04102939],"genre_scores_gemma":[0.60294276,0.0015588991,0.35644707,0.005061412,0.0014975796,0.0017752552,0.003043079,0.0048790914,0.022794968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9735724,0.006502231,0.0013739949,0.0045352583,0.008672027,0.005344115],"domain_scores_gemma":[0.889586,0.06585898,0.0048338003,0.032707695,0.004203244,0.0028102142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010329455,0.0038533732,0.0044949325,0.002344565,0.003298142,0.007346414,0.010347364,0.004274599,0.027264044],"category_scores_gemma":[0.058088038,0.0019379201,0.005487635,0.0027745557,0.0055301012,0.020145247,0.011632544,0.013679618,0.007941881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062953252,0.0019460049,0.008227481,0.0030763163,0.00063714496,0.0011368502,0.0013978163,0.23974694,0.060883638,0.35805845,0.066141106,0.25245303],"study_design_scores_gemma":[0.00046856378,0.00063105696,0.0015948643,0.00023662976,0.00045334833,0.00080361863,0.00025098346,0.6805738,0.02201532,0.2787217,0.0140611725,0.00018888571],"about_ca_topic_score_codex":0.0030653935,"about_ca_topic_score_gemma":0.004219621,"teacher_disagreement_score":0.027264044,"about_ca_system_score_codex":0.008082372,"about_ca_system_score_gemma":0.007545148,"threshold_uncertainty_score":0.091207266},"labels":[],"label_agreement":null},{"id":"W2801305430","doi":"10.5281/zenodo.1245968","title":"Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries","year":2018,"lang":"en","type":"report","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Blocking (statistics); Binary search tree; Computer science; Binary number; Range (aeronautics); Binary tree; Combinatorics; Mathematics; Algorithm; Computer network; Arithmetic; Materials science","score_opus":0.05505912739471834,"score_gpt":0.2802276225350706,"score_spread":0.22516849514035225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801305430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06090138,0.0007074736,0.91729003,0.0002215321,0.00015548931,0.00024839822,0.0003568136,0.0153438235,0.004775117],"genre_scores_gemma":[0.5325652,0.0004911795,0.45582685,0.00018543552,0.00012694685,0.00041313702,0.0011163363,0.0012078487,0.008066987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972994,0.00033400577,0.00035212998,0.00028999944,0.0012966369,0.00042791752],"domain_scores_gemma":[0.99218035,0.0021931303,0.00076275156,0.0029281154,0.0014592471,0.00047630916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021922323,0.00061738683,0.000972171,0.00093865243,0.0011498935,0.003200143,0.004317774,0.0011521445,0.003637523],"category_scores_gemma":[0.008064661,0.000774026,0.0005249528,0.0016247985,0.0012558444,0.0058166776,0.0029475805,0.0017232284,0.0017743035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004739804,0.0012574458,0.011148765,0.002027926,0.00029092515,0.000977788,0.0024025852,0.075343624,0.15435821,0.2482741,0.027809957,0.47136894],"study_design_scores_gemma":[0.0009869953,0.0012126018,0.002326769,0.00017125794,0.0002966735,0.00087025226,0.00045972047,0.70108205,0.14043057,0.07323788,0.078719154,0.00020605471],"about_ca_topic_score_codex":0.003772013,"about_ca_topic_score_gemma":0.004407242,"teacher_disagreement_score":0.004317774,"about_ca_system_score_codex":0.0012120618,"about_ca_system_score_gemma":0.002539044,"threshold_uncertainty_score":0.012168705},"labels":[],"label_agreement":null},{"id":"W2807084807","doi":"","title":"Communication Patterns for Randomized Algorithms","year":2018,"lang":"en","type":"dissertation","venue":"Durham e-Theses (Durham University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Simon Fraser University; Durham University","keywords":"Computer science; Load balancing (electrical power); Randomized algorithm; Greedy algorithm; Distributed computing; Distributed algorithm; Scheme (mathematics); Algorithm; Theoretical computer science; Mathematics","score_opus":0.012543398707034088,"score_gpt":0.24225994191804276,"score_spread":0.22971654321100868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807084807","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075698197,0.0030930256,0.9272705,0.008102019,0.0013744833,0.00040926586,0.00038333875,0.0011270574,0.050670523],"genre_scores_gemma":[0.33916938,0.0067315698,0.5869819,0.008886669,0.003839471,0.0053777583,0.0013182333,0.0015316337,0.046163417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98836946,0.0053089866,0.0006938343,0.0024738067,0.0023510815,0.00080282],"domain_scores_gemma":[0.95493746,0.032637518,0.0025102603,0.006882972,0.0023114465,0.0007203157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007999274,0.0018966122,0.0017493523,0.0018516453,0.002201815,0.0052670967,0.0028696188,0.0038366327,0.016319035],"category_scores_gemma":[0.055806,0.0009535876,0.0020759858,0.0024571072,0.005650307,0.010627273,0.0048360215,0.0074692,0.004155865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000850461,0.00006151609,0.00036691065,0.00018300556,0.00004491053,0.000057924208,0.00012116802,0.01844736,0.00045113807,0.94256765,0.006752595,0.030860737],"study_design_scores_gemma":[0.00009286915,0.00006540246,0.00009304043,0.000072494935,0.000017413873,0.00007715544,0.000027506134,0.06787408,0.00035284105,0.91294324,0.018362233,0.00002173697],"about_ca_topic_score_codex":0.0015598439,"about_ca_topic_score_gemma":0.0010412297,"teacher_disagreement_score":0.016319035,"about_ca_system_score_codex":0.0030290142,"about_ca_system_score_gemma":0.003209844,"threshold_uncertainty_score":0.05459261},"labels":[],"label_agreement":null},{"id":"W2807689278","doi":"10.1109/tvlsi.2018.2838044","title":"A Fast, Single-Instruction–Multiple-Data, Scalable Priority Queue","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Priority queue; Parallel computing; Queue; Computer network; Operating system","score_opus":0.023785537106581815,"score_gpt":0.2562481678239242,"score_spread":0.23246263071734236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807689278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010240447,0.0008671138,0.9804931,0.00028062207,0.0003605462,0.00023239774,0.00018471568,0.00336755,0.0039735097],"genre_scores_gemma":[0.24977979,0.0006694583,0.7419015,0.0003739045,0.00029960877,0.0002251952,0.00064195466,0.000230012,0.00587848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.00011900214,0.00008386656,0.00015981265,0.00047265703,0.00011940514],"domain_scores_gemma":[0.99877816,0.0002718152,0.0001203299,0.00020331377,0.0005191071,0.000107213746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359274,0.0005058108,0.0004682263,0.00075672055,0.0006424558,0.0015558982,0.0028876446,0.0005248104,0.004207143],"category_scores_gemma":[0.0022219317,0.0003757657,0.0003970348,0.0007947077,0.0003999241,0.0016147178,0.0007790561,0.0010063943,0.0013632729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012720617,0.00045505512,0.0024051478,0.0008029938,0.00013585016,0.00037160394,0.00028410627,0.065146975,0.1354244,0.119107805,0.02862988,0.6459641],"study_design_scores_gemma":[0.00069979735,0.0012885816,0.000651526,0.000065033404,0.00016114,0.00048396637,0.00006186628,0.83206064,0.061698537,0.019630918,0.08308652,0.00011152606],"about_ca_topic_score_codex":0.0032415402,"about_ca_topic_score_gemma":0.004199617,"teacher_disagreement_score":0.004207143,"about_ca_system_score_codex":0.0010549768,"about_ca_system_score_gemma":0.0031791332,"threshold_uncertainty_score":0.014074266},"labels":[],"label_agreement":null},{"id":"W2808526906","doi":"10.1109/icdcs.2018.00101","title":"Scalable Transaction Processing Using Functors","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Scalability; Parallel computing; Concurrency; Serialization; Cache coherence; Distributed computing; Programming language; Operating system; Cache","score_opus":0.025687825428423454,"score_gpt":0.2621826773083543,"score_spread":0.23649485187993086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808526906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810415,0.000902728,0.93866867,0.0003234158,0.0001687093,0.00024077234,0.0004248298,0.016885525,0.0042812056],"genre_scores_gemma":[0.4899144,0.0006629994,0.5026612,0.00026443705,0.00011208535,0.00040191974,0.001711642,0.0008659645,0.0034053915],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667764,0.00069136894,0.0005383257,0.0007265252,0.0010749068,0.0002912017],"domain_scores_gemma":[0.99378926,0.0014635901,0.00032155347,0.0029249059,0.0012593847,0.0002412319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034653186,0.00084797817,0.0008939131,0.0017126766,0.00092636276,0.0020956695,0.0026063072,0.00070892717,0.003541844],"category_scores_gemma":[0.0065974426,0.0006732127,0.0013055439,0.002001957,0.0015098692,0.0058243647,0.0033148022,0.0012647917,0.0014368027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001375054,0.00026696362,0.006519996,0.00086044415,0.0002666438,0.00082113,0.0010669633,0.118663915,0.0864025,0.17162997,0.019070145,0.5930563],"study_design_scores_gemma":[0.00018929664,0.00044106322,0.0009232803,0.00007936961,0.000100930374,0.00053171284,0.00018677981,0.76502395,0.037766453,0.14470953,0.0499146,0.00013303386],"about_ca_topic_score_codex":0.0024573058,"about_ca_topic_score_gemma":0.0017149273,"teacher_disagreement_score":0.003541844,"about_ca_system_score_codex":0.001020792,"about_ca_system_score_gemma":0.0016673458,"threshold_uncertainty_score":0.01832658},"labels":[],"label_agreement":null},{"id":"W2810425581","doi":"10.1145/3212734.3212775","title":"On the Classification of Deterministic Objects via Set Agreement Power","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Power (physics); Artificial intelligence; Physics; Programming language","score_opus":0.028068337653706775,"score_gpt":0.2678966076606491,"score_spread":0.23982827000694232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810425581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1789467,0.001348496,0.76044095,0.0035760703,0.00027655583,0.0001900532,0.00042831764,0.00057792803,0.05421498],"genre_scores_gemma":[0.91178066,0.0010874737,0.072213225,0.00057478546,0.0005807165,0.00029470245,0.00058450166,0.00026272188,0.012621196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573517,0.001040243,0.00033627343,0.0007595606,0.0015181546,0.0006105596],"domain_scores_gemma":[0.97108275,0.020773375,0.0015196329,0.004069571,0.0015420429,0.0010126403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003903325,0.00059719017,0.001522905,0.0025339143,0.002768563,0.005808028,0.0020956027,0.001453307,0.0050088107],"category_scores_gemma":[0.026571201,0.00056961464,0.0013506177,0.0033336242,0.0077838167,0.015603858,0.0050028684,0.004012097,0.0009097366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057040386,0.000022363063,0.0006617533,0.000028419641,0.000007858735,0.000031157047,0.00030123102,0.007513559,0.00030748293,0.97825444,0.00087159174,0.0119430795],"study_design_scores_gemma":[0.000011943188,0.000016060101,0.00015784634,0.000014001793,0.000007062682,0.00003209376,0.000045232922,0.04127203,0.0002981805,0.95616037,0.0019748027,0.000010331485],"about_ca_topic_score_codex":0.0015930723,"about_ca_topic_score_gemma":0.000795385,"teacher_disagreement_score":0.005808028,"about_ca_system_score_codex":0.0018349505,"about_ca_system_score_gemma":0.0013766839,"threshold_uncertainty_score":0.020642996},"labels":[],"label_agreement":null},{"id":"W2810665464","doi":"10.1145/3212734.3212755","title":"Recoverable Mutual Exclusion Under System-Wide Failures","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutual exclusion; Computer science; Semaphore; Word (group theory); Parallel computing; Traverse; Class (philosophy); Theoretical computer science; Algorithm; Arithmetic; Programming language; Mathematics; Artificial intelligence","score_opus":0.010397957065844059,"score_gpt":0.22820557703529712,"score_spread":0.21780761996945305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810665464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19914015,0.0009749281,0.77993774,0.0031981235,0.00017287293,0.00022483944,0.00068566826,0.0034110001,0.012254653],"genre_scores_gemma":[0.96161586,0.00033901882,0.032499462,0.00038347347,0.00019961447,0.00024406156,0.0003888142,0.0003040827,0.0040257107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894772,0.002861562,0.0004475026,0.002354216,0.0027185695,0.0021407923],"domain_scores_gemma":[0.9441003,0.036412593,0.005562192,0.0097156055,0.0028183607,0.0013908861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005715386,0.0013703568,0.0027205,0.000984301,0.002221975,0.0034420728,0.0039178426,0.0027258978,0.0065897536],"category_scores_gemma":[0.04626292,0.0008464447,0.0015392693,0.001230275,0.004296215,0.01170071,0.007717493,0.005385791,0.0013225531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094625587,0.00014573854,0.0032578446,0.00036756255,0.00013425526,0.0005283822,0.0007041963,0.6639314,0.0068234527,0.29244167,0.0048426106,0.02587667],"study_design_scores_gemma":[0.00008330184,0.000064295215,0.00039289237,0.000016488522,0.000023035138,0.00013643072,0.00008496687,0.6558585,0.0018419827,0.34025586,0.0012135974,0.000028589388],"about_ca_topic_score_codex":0.0030158625,"about_ca_topic_score_gemma":0.0025371125,"teacher_disagreement_score":0.0065897536,"about_ca_system_score_codex":0.0029105353,"about_ca_system_score_gemma":0.0026592251,"threshold_uncertainty_score":0.03022623},"labels":[],"label_agreement":null},{"id":"W2811181433","doi":"10.4230/lipics.concur.2018.33","title":"Automatic Analysis of Expected Termination Time for Population Protocols","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Grantová Agentura České Republiky; Alexander von Humboldt-Stiftung","keywords":"Computation; Computer science; Protocol (science); Population; Parametric statistics; Upper and lower bounds; Function (biology); Distributed computing; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01829018276171908,"score_gpt":0.3099208662115419,"score_spread":0.29163068344982285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811181433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0827189,0.0001815779,0.9123993,0.0005247146,0.00003793527,0.00011624443,0.00014724847,0.0012223725,0.0026516712],"genre_scores_gemma":[0.8205238,0.00017327964,0.17525263,0.00017116615,0.00009958169,0.00066154235,0.0005080553,0.0006760018,0.0019339095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903976,0.0034550715,0.0005335596,0.0016718855,0.0028130307,0.0011289888],"domain_scores_gemma":[0.859639,0.118165165,0.0066421786,0.0072344677,0.0064101536,0.0019091639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01121398,0.0013825715,0.0015354815,0.0020839504,0.0013551932,0.0033285932,0.0037530402,0.00226814,0.003961354],"category_scores_gemma":[0.0969535,0.0009643643,0.0015430916,0.0011651508,0.004830556,0.00555782,0.003177349,0.0049947905,0.0006222172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007995296,0.00020485779,0.0057246983,0.00030083454,0.00013476683,0.00029796668,0.00091906806,0.7283048,0.015128978,0.21142921,0.0022211066,0.03453425],"study_design_scores_gemma":[0.00003606528,0.000043272517,0.00019603316,0.000013062466,0.000014251537,0.000036513276,0.000021850283,0.9394023,0.0023955689,0.057567943,0.00025891184,0.000014164345],"about_ca_topic_score_codex":0.001143565,"about_ca_topic_score_gemma":0.0007395483,"teacher_disagreement_score":0.01121398,"about_ca_system_score_codex":0.003874973,"about_ca_system_score_gemma":0.0029175817,"threshold_uncertainty_score":0.059305847},"labels":[],"label_agreement":null},{"id":"W2811437435","doi":"10.1016/j.jpdc.2018.06.004","title":"Nontrivial and universal helping for wait-free queues and stacks","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation; Ben-Gurion University of the Negev; University of Toronto","keywords":"Computer science; Queue; Implementation; Set (abstract data type); Priority queue; Stack (abstract data type); Theoretical computer science; Distributed computing; Operating system; Programming language","score_opus":0.012429609724443156,"score_gpt":0.25061420682172564,"score_spread":0.23818459709728249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811437435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5095374,0.0007133218,0.42707056,0.0037765377,0.0005402487,0.00021348255,0.0005164354,0.0038035884,0.053828545],"genre_scores_gemma":[0.9323542,0.00026278308,0.049329113,0.00059918227,0.00027245388,0.00017195058,0.0002778763,0.00064212043,0.016090304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957729,0.0006872817,0.00030203172,0.0007540018,0.00093887124,0.0015450403],"domain_scores_gemma":[0.9779197,0.01052575,0.0016919518,0.004707312,0.0020631298,0.0030920217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004039144,0.0010984684,0.0021219875,0.0026856994,0.0071957153,0.0067141177,0.003344833,0.0036599005,0.007998612],"category_scores_gemma":[0.028993756,0.001604727,0.0024144459,0.0021134939,0.009620768,0.0140626235,0.011535449,0.0057498976,0.0010254751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009699534,0.000043155105,0.00047030798,0.000038061808,0.00001124472,0.00007295538,0.0005279128,0.0018277074,0.0006408809,0.9920107,0.0013063368,0.0029538493],"study_design_scores_gemma":[0.000035919365,0.000015304387,0.0001298659,0.000012391519,0.00002681494,0.000059765243,0.00015808592,0.01069208,0.00079769717,0.9865143,0.0015271286,0.000030729847],"about_ca_topic_score_codex":0.0034329044,"about_ca_topic_score_gemma":0.0041877883,"teacher_disagreement_score":0.007998612,"about_ca_system_score_codex":0.0028519253,"about_ca_system_score_gemma":0.0046088393,"threshold_uncertainty_score":0.026758015},"labels":[],"label_agreement":null},{"id":"W2883140496","doi":"10.1145/3241950.3241953","title":"Synchronous Signals","year":2018,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Synchronizing; Concurrency; Synchronization (alternating current); Abstraction; Code (set theory); Interface (matter); Blocking (statistics); Concurrency control; Parallel computing; Distributed computing; Programming language; Computer network; Transmission (telecommunications); Set (abstract data type); Telecommunications","score_opus":0.012155640413538874,"score_gpt":0.23664149251902894,"score_spread":0.22448585210549007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883140496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008825378,0.00098896,0.9182711,0.0004957753,0.0018009942,0.0002608024,0.0011219587,0.017785624,0.050449416],"genre_scores_gemma":[0.28616205,0.0021518727,0.5778896,0.0019500842,0.0015619207,0.001066049,0.003447381,0.006692103,0.11907893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770576,0.00050758594,0.00021137789,0.00044462582,0.0008645208,0.00026612432],"domain_scores_gemma":[0.9978047,0.00065230846,0.00026052966,0.00042373038,0.0007206164,0.00013814514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014847853,0.0012080243,0.00069409044,0.0010702932,0.0007877819,0.0034900764,0.0013776276,0.0010994131,0.033680778],"category_scores_gemma":[0.003906274,0.00057884323,0.0008031352,0.0009406194,0.0011729515,0.0033369164,0.0017798999,0.0017578128,0.0122911325],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014666244,0.00012425275,0.0011142167,0.0010012714,0.000066610024,0.0004985137,0.0007967848,0.007483023,0.019120432,0.6225494,0.0726143,0.2731646],"study_design_scores_gemma":[0.00022282617,0.00049465575,0.0003187433,0.00018171701,0.00008067367,0.00065762445,0.00013967635,0.030464973,0.027797189,0.08437092,0.8551791,0.00009189091],"about_ca_topic_score_codex":0.00084291777,"about_ca_topic_score_gemma":0.0010711362,"teacher_disagreement_score":0.033680778,"about_ca_system_score_codex":0.0008240082,"about_ca_system_score_gemma":0.0011501724,"threshold_uncertainty_score":0.1126734},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031245055841411285,"score_gpt":0.29786935584384455,"score_spread":0.26662430000243326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883173799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375726,0.00018903652,0.98052365,0.00017956807,0.000040184495,0.000101154634,0.000046514335,0.00017056655,0.0023735901],"genre_scores_gemma":[0.7098916,0.00068175554,0.28276503,0.00022039587,0.0002891344,0.00061608135,0.00024120914,0.000242038,0.0050526517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987482,0.00042806086,0.00006422833,0.00019507337,0.0004294212,0.00013498351],"domain_scores_gemma":[0.997677,0.001007935,0.0003494633,0.00038253577,0.0004075495,0.00017548406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020029396,0.000635494,0.00047308684,0.0015430613,0.0005371289,0.0010701234,0.0010446666,0.0008511576,0.0024469947],"category_scores_gemma":[0.005710979,0.0002859868,0.001133739,0.00075304776,0.0018378313,0.0021038405,0.0027771906,0.0015056016,0.00053232466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013371525,0.00010551823,0.0020472778,0.0002505306,0.00015704952,0.0007472351,0.00073880295,0.27136695,0.031324323,0.6428873,0.0026393626,0.04760198],"study_design_scores_gemma":[0.000011028836,0.00008208939,0.000419416,0.000026608772,0.000034407098,0.00014676659,0.000052368185,0.79475665,0.0030446425,0.1986323,0.0027762644,0.000017472392],"about_ca_topic_score_codex":0.00053463347,"about_ca_topic_score_gemma":0.00027422764,"teacher_disagreement_score":0.0024469947,"about_ca_system_score_codex":0.00074579084,"about_ca_system_score_gemma":0.00078353955,"threshold_uncertainty_score":0.010592699},"labels":[],"label_agreement":null},{"id":"W2885177983","doi":"10.1109/ipdpsw.2018.00124","title":"Barrier Synchronization: Simplified, Generalized, and Solved Without Mutual Exclusion","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Synchronization (alternating current); Bulk synchronous parallel; Correctness; Parallel computing; Distributed computing; Mutual exclusion; Concurrency; Parallel algorithm; Concurrent computing; Shared memory; Component (thermodynamics); Node (physics); Algorithm; Computer network","score_opus":0.011964239748680886,"score_gpt":0.24901000156822728,"score_spread":0.2370457618195464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885177983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00955178,0.0007397265,0.98309994,0.00031633806,0.00014685097,0.00009584059,0.00007150614,0.0008922384,0.005085836],"genre_scores_gemma":[0.43683317,0.0018708326,0.5451009,0.0002663686,0.00025103852,0.00046761497,0.00043264125,0.0006993909,0.014077954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998793,0.0002858601,0.00006729357,0.00020720292,0.00046564447,0.00018099777],"domain_scores_gemma":[0.99895287,0.00033314177,0.00014651859,0.00026031703,0.00023621375,0.000070857976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009178271,0.00079942134,0.0010054201,0.0006987243,0.0008809071,0.0015435162,0.0024647554,0.001071325,0.002850125],"category_scores_gemma":[0.0044809273,0.00043205346,0.0010199244,0.0012773083,0.001440285,0.00280737,0.0028230087,0.0019780472,0.0009129368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030730758,0.00006542188,0.0009416709,0.00055810297,0.00008206658,0.00042953543,0.000617013,0.27785984,0.013052694,0.58134246,0.008489822,0.11625415],"study_design_scores_gemma":[0.000070926515,0.00006041372,0.00021184157,0.0000385273,0.00004766542,0.0002076925,0.000065655135,0.84535706,0.0055006193,0.12402849,0.02437564,0.000035559657],"about_ca_topic_score_codex":0.0036544183,"about_ca_topic_score_gemma":0.0021122764,"teacher_disagreement_score":0.0036544183,"about_ca_system_score_codex":0.0009782121,"about_ca_system_score_gemma":0.0021960614,"threshold_uncertainty_score":0.009534597},"labels":[],"label_agreement":null},{"id":"W2885270395","doi":"10.1109/iri.2018.00079","title":"Tally Keeping-LTL: An LTL Semantics for Quantitative Evaluation of LTL Specifications","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Semantics (computer science); Temporal logic; Linear temporal logic; Programming language; Automaton; Representation (politics); Generalization; Event (particle physics); Theoretical computer science; Mathematics","score_opus":0.2256977613070723,"score_gpt":0.3902528449083916,"score_spread":0.16455508360131932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885270395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027307377,0.00006256243,0.9928867,0.00020580209,0.000044146134,0.000121869074,0.0002636301,0.0022118764,0.0014727515],"genre_scores_gemma":[0.23227277,0.00025273694,0.76025426,0.00073628087,0.0001531038,0.000780791,0.00091369194,0.001296802,0.003339516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943258,0.0018678408,0.0008080846,0.0007396346,0.0018183535,0.00044034212],"domain_scores_gemma":[0.98522264,0.008770442,0.0014409459,0.0021376559,0.002101373,0.00032699268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007686,0.0010185165,0.00074639416,0.001800284,0.00095400977,0.0034419652,0.0021831424,0.0014395282,0.005151323],"category_scores_gemma":[0.019894995,0.0007772808,0.0019480119,0.0013329801,0.0035403683,0.0058430596,0.0022519159,0.003567213,0.0011672948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004176638,0.00019605456,0.0017770586,0.0007050073,0.00013420206,0.0007533343,0.0014926926,0.06695402,0.016713038,0.80819714,0.006735454,0.0959243],"study_design_scores_gemma":[0.0001581296,0.00023475183,0.0003614721,0.00024827814,0.00015595474,0.00032111385,0.00022770512,0.35863596,0.036105964,0.57261914,0.030792559,0.0001389089],"about_ca_topic_score_codex":0.0033480043,"about_ca_topic_score_gemma":0.0042088837,"teacher_disagreement_score":0.007686,"about_ca_system_score_codex":0.0020960115,"about_ca_system_score_gemma":0.002846145,"threshold_uncertainty_score":0.040647984},"labels":[],"label_agreement":null},{"id":"W2888306752","doi":"10.1371/journal.pone.0202337","title":"Assessing the resilience of stochastic dynamic systems under partial observability","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Bloomberg L.P.","keywords":"Observability; Computer science; Probabilistic logic; Resilience (materials science); Flexibility (engineering); Inference; Construct (python library); Theoretical computer science; Property (philosophy); Model checking; Distributed computing; Artificial intelligence; Mathematics; Programming language","score_opus":0.06859177516777418,"score_gpt":0.29216751314726364,"score_spread":0.22357573797948946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888306752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34801698,0.00016359903,0.64863926,0.0004916565,0.000017951488,0.00007677464,0.00047421094,0.00078039645,0.0013391287],"genre_scores_gemma":[0.97873676,0.000069627415,0.02076968,0.000026779888,0.000009111345,0.00003748106,0.00019654352,0.00002910458,0.0001249065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746776,0.00079172716,0.00020457064,0.00054516416,0.0006671199,0.00032376806],"domain_scores_gemma":[0.9568206,0.034547776,0.0046271044,0.0022941756,0.0011174821,0.0005927982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004318697,0.00084433024,0.0007887363,0.0013488105,0.00057850924,0.0012943773,0.0012965865,0.0010090676,0.0013774479],"category_scores_gemma":[0.044571426,0.00052474835,0.0010878833,0.00084157987,0.0024555274,0.0030511967,0.0020251425,0.0010995776,0.00008910319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007275046,0.000015720761,0.007060813,0.000062291365,0.000068544825,0.00010367425,0.000068349706,0.9715001,0.0014778688,0.014368153,0.000094608535,0.00510703],"study_design_scores_gemma":[0.000005904607,0.000024047056,0.0013079789,0.000008763389,0.000015078458,0.000028184757,0.00002966726,0.9768147,0.0010455443,0.020627333,0.000080871025,0.0000119130145],"about_ca_topic_score_codex":0.0062937057,"about_ca_topic_score_gemma":0.0030083891,"teacher_disagreement_score":0.0062937057,"about_ca_system_score_codex":0.0015586629,"about_ca_system_score_gemma":0.0014097932,"threshold_uncertainty_score":0.022839725},"labels":[],"label_agreement":null},{"id":"W2888390543","doi":"10.1109/saci.2018.8440930","title":"Modeling and Simulation of an Operational Transformation Algorithm Using Finite State Machines","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Collaborative editing; Computer science; Scalability; Server; Consistency (knowledge bases); Distributed computing; Finite-state machine; Web server; Collaborative software; Reliability (semiconductor); Algorithm; Database; Operating system; The Internet; Artificial intelligence","score_opus":0.025953442561793834,"score_gpt":0.2916260590307658,"score_spread":0.265672616468972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888390543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061416674,0.00013833032,0.93179154,0.00015595507,0.000043507396,0.000099512334,0.000112219735,0.0010808037,0.0051615317],"genre_scores_gemma":[0.89792025,0.00019052907,0.09863793,0.00003357958,0.000018238978,0.0002896692,0.00016611491,0.00007291341,0.0026708862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.00020785374,0.00004019208,0.000111549416,0.00019607597,0.00008600033],"domain_scores_gemma":[0.99773043,0.0016288549,0.00017748983,0.00017270974,0.00023728395,0.00005333421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000962788,0.00059696654,0.0006158967,0.00066448527,0.0006242412,0.0012450069,0.001316946,0.0011084308,0.002577412],"category_scores_gemma":[0.0029585976,0.00033530602,0.00084272225,0.0004116263,0.0013090875,0.0010660489,0.0006051334,0.0010103148,0.00030399187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033088723,0.000031390697,0.00046468116,0.000022012451,0.000008374689,0.000054760447,0.000051859497,0.97998285,0.0009854658,0.015192998,0.00011998184,0.0030524943],"study_design_scores_gemma":[0.0000039348392,0.000008217019,0.000029591441,0.0000019176139,0.0000022100016,0.0000045731026,0.0000031468833,0.99771,0.00033464588,0.0017419453,0.0001579616,0.0000017936404],"about_ca_topic_score_codex":0.010223945,"about_ca_topic_score_gemma":0.005776664,"teacher_disagreement_score":0.010223945,"about_ca_system_score_codex":0.0010991498,"about_ca_system_score_gemma":0.0017790833,"threshold_uncertainty_score":0.02032888},"labels":[],"label_agreement":null},{"id":"W2891053194","doi":"10.1016/j.tcs.2018.09.005","title":"Population protocols with faulty interactions: The impact of a leader","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Impossibility; Mathematical proof; Computer science; Focus (optics); Theoretical computer science; Population; Distributed computing; State (computer science); Algorithm; Mathematics","score_opus":0.019973799382233298,"score_gpt":0.34060739758259034,"score_spread":0.32063359820035703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891053194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6525756,0.0012679796,0.28594518,0.009855659,0.0008734445,0.00021614978,0.00026125705,0.000732036,0.04827273],"genre_scores_gemma":[0.98830146,0.00023906071,0.0074376664,0.00023141254,0.00015874761,0.00006773238,0.000033044835,0.00007466281,0.0034561784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720746,0.0014343136,0.00006551355,0.000317105,0.0004952191,0.00048031527],"domain_scores_gemma":[0.9600351,0.02888827,0.0024350763,0.0043515665,0.002272215,0.0020178598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004555863,0.0005143603,0.0010956806,0.0007936425,0.0018058496,0.0023215793,0.0028208846,0.002667156,0.005893465],"category_scores_gemma":[0.044554684,0.0004640854,0.00057909044,0.00063287024,0.0030255918,0.005586682,0.0026667933,0.0026095705,0.0005169149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012689673,0.0005468086,0.00484875,0.00028426744,0.00016388677,0.0012493867,0.0012730624,0.45759484,0.0065554525,0.48294857,0.010508623,0.032757524],"study_design_scores_gemma":[0.00020888394,0.00033290248,0.0007609934,0.00002686607,0.0000864853,0.00031152292,0.0004518342,0.7690278,0.0014898964,0.22504467,0.0022178488,0.000040233783],"about_ca_topic_score_codex":0.0018592328,"about_ca_topic_score_gemma":0.0014081113,"teacher_disagreement_score":0.005893465,"about_ca_system_score_codex":0.0013789429,"about_ca_system_score_gemma":0.002011365,"threshold_uncertainty_score":0.024093986},"labels":[],"label_agreement":null},{"id":"W2896055537","doi":"10.1002/cpe.5024","title":"A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Center for Advanced Study, University of Illinois at Urbana-Champaign; New Brunswick Innovation Foundation; International Business Machines Corporation","keywords":"Computer science; Java; Granularity; Concurrent data structure; Tree (set theory); Java concurrency; Parallel computing; Synchronization (alternating current); Consistency (knowledge bases); Distributed computing; Data structure; Workload; Object (grammar); Operating system; Real time Java; Artificial intelligence","score_opus":0.04154552241589729,"score_gpt":0.3547900129040608,"score_spread":0.3132444904881635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896055537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07746359,0.00021365771,0.9145383,0.000087891916,0.00010570552,0.00015893449,0.000063992935,0.005295938,0.002071949],"genre_scores_gemma":[0.5886863,0.00011797174,0.40621024,0.0001378785,0.000041649222,0.00016660626,0.0002512416,0.0006096325,0.003778622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984274,0.00022647931,0.000229528,0.00022489735,0.0006798249,0.00021195525],"domain_scores_gemma":[0.99687374,0.0004600342,0.00025703784,0.0014110884,0.00074644154,0.00025164118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012792996,0.00027537651,0.00047267487,0.0007741732,0.0009272595,0.0012384021,0.0019229586,0.0004276098,0.0017745441],"category_scores_gemma":[0.0024763613,0.00031418985,0.00040453335,0.00077980175,0.0006857406,0.0020260408,0.0016184356,0.0007812012,0.0004527906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021827498,0.0005625676,0.008629394,0.0003505386,0.00014963432,0.00042161666,0.0012543475,0.08367521,0.26919878,0.08570321,0.0074491194,0.54042286],"study_design_scores_gemma":[0.00028430184,0.00073530705,0.0019763964,0.000042025527,0.000113478665,0.00038494478,0.00017267163,0.78363526,0.16370124,0.014808767,0.033989336,0.000156223],"about_ca_topic_score_codex":0.0031194773,"about_ca_topic_score_gemma":0.003208532,"teacher_disagreement_score":0.0031194773,"about_ca_system_score_codex":0.0008373756,"about_ca_system_score_gemma":0.0015807374,"threshold_uncertainty_score":0.0067656636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025634826433566998,"score_gpt":0.3262800787899436,"score_spread":0.30064525235637657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898165178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006129992,0.049697485,0.82911676,0.015604863,0.0018762453,0.00014116114,0.00030935457,0.0003789619,0.096745156],"genre_scores_gemma":[0.28506923,0.11094963,0.5313735,0.007728835,0.010485334,0.0013349887,0.0013235473,0.00068468164,0.05105026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660695,0.0011664372,0.00016490984,0.00068902376,0.0011246266,0.0002480605],"domain_scores_gemma":[0.9926029,0.0050571803,0.00029575624,0.0010301728,0.00076942914,0.0002445488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038611786,0.0013797791,0.0013618837,0.0017488993,0.0016180234,0.003543909,0.003345049,0.0027484426,0.008053949],"category_scores_gemma":[0.014652291,0.0009252434,0.0017601722,0.0029907578,0.004325238,0.006510296,0.004534166,0.0068195225,0.0023367617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019933173,0.000027852448,0.00023574707,0.00022625737,0.000032214273,0.00004543859,0.00015267028,0.014278002,0.00016602624,0.93916285,0.0061853323,0.039467763],"study_design_scores_gemma":[0.000030306739,0.000026195077,0.00014135531,0.00010510747,0.000021116473,0.00009220913,0.00005194917,0.0479811,0.00016459421,0.8780268,0.07334056,0.000018825727],"about_ca_topic_score_codex":0.0021031168,"about_ca_topic_score_gemma":0.0012850306,"teacher_disagreement_score":0.008053949,"about_ca_system_score_codex":0.0026352182,"about_ca_system_score_gemma":0.0021079148,"threshold_uncertainty_score":0.026943147},"labels":[],"label_agreement":null},{"id":"W2898525980","doi":"10.1007/s10951-020-00644-9","title":"Interruptible algorithms for multiproblem solving","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Schedule; Multiprocessing; Scheduling (production processes); Upper and lower bounds; Computation; Class (philosophy); Job shop scheduling; Multiprocessor scheduling; Mathematical optimization; Quality (philosophy); Algorithm; Parallel computing; Mathematics; Artificial intelligence","score_opus":0.06143264323058698,"score_gpt":0.2962638072315829,"score_spread":0.23483116400099593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898525980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052297586,0.0006058855,0.98893446,0.00023791225,0.00017292827,0.000051209034,0.00004290287,0.0007787607,0.0039461553],"genre_scores_gemma":[0.18342036,0.0006182925,0.805072,0.000188892,0.00022130684,0.0002933015,0.00027282696,0.00044613518,0.009466947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818075,0.00065431045,0.00012737892,0.0002433713,0.0005457081,0.00024855955],"domain_scores_gemma":[0.991621,0.006013673,0.0003429109,0.0011042587,0.0005968138,0.00032133414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003564575,0.0014487788,0.0016539696,0.0010428836,0.0014251351,0.0021502208,0.0037125223,0.0014393883,0.007616589],"category_scores_gemma":[0.016834667,0.00100082,0.0011211396,0.0014974038,0.0021024833,0.0032003606,0.0022458674,0.005898957,0.0010016217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010162449,0.00039254702,0.0007449529,0.00045848708,0.000095810916,0.00009952987,0.0004302178,0.46461138,0.0021604549,0.29238376,0.010862279,0.22674432],"study_design_scores_gemma":[0.00016678142,0.000054644934,0.00007604242,0.000027419117,0.000022427992,0.00002463677,0.000028953093,0.84628814,0.00058076304,0.14916888,0.0035490908,0.000012275985],"about_ca_topic_score_codex":0.005503117,"about_ca_topic_score_gemma":0.0072928118,"teacher_disagreement_score":0.007616589,"about_ca_system_score_codex":0.0016962417,"about_ca_system_score_gemma":0.0021221924,"threshold_uncertainty_score":0.025479972},"labels":[],"label_agreement":null},{"id":"W2903124943","doi":"10.1145/3274808.3274829","title":"SpecRPC","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Commit; Computer science; Compensating transaction; Correctness; Two-phase commit protocol; Distributed transaction; Speculative execution; Database transaction; Latency (audio); Transaction processing; Distributed computing; Speculative multithreading; CAS latency; Parallel computing; Operating system; Database; Programming language; Multithreading","score_opus":0.009481430886041852,"score_gpt":0.23458708652401183,"score_spread":0.22510565563796997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903124943","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022119727,0.0017738562,0.6634764,0.0010529042,0.0010514057,0.0010364242,0.004704269,0.23215772,0.072627306],"genre_scores_gemma":[0.308292,0.0018248498,0.568357,0.0028283566,0.0005420184,0.0013621865,0.028022924,0.032686368,0.056084275],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99592704,0.0005170253,0.00029444162,0.00053849665,0.0021831342,0.00053992623],"domain_scores_gemma":[0.99205774,0.0010394171,0.0003526786,0.0038247264,0.0024710428,0.00025437103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002573355,0.0013914104,0.00073324714,0.0011271805,0.0008635461,0.0022317583,0.004408374,0.0013752871,0.019304262],"category_scores_gemma":[0.00857796,0.00087306777,0.00097358035,0.0009222224,0.0010681933,0.0034682292,0.003116205,0.002496761,0.012700608],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016219014,0.00041372786,0.004660599,0.0013469964,0.00015975215,0.0008837615,0.000478743,0.032469213,0.032998603,0.08845336,0.3046819,0.5318315],"study_design_scores_gemma":[0.00030079207,0.000564043,0.0018657369,0.0002237993,0.00014672526,0.0013552104,0.00012373453,0.22990826,0.053274482,0.032843463,0.67918336,0.00021037135],"about_ca_topic_score_codex":0.0066681225,"about_ca_topic_score_gemma":0.005252088,"teacher_disagreement_score":0.019304262,"about_ca_system_score_codex":0.0010534097,"about_ca_system_score_gemma":0.0038744616,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2904813721","doi":"10.1145/3300150.3300166","title":"SIROCCO 2018 Review","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Milestone; Focus (optics); Library science; Computer science; Telecommunications; History; Archaeology","score_opus":0.02836137454252424,"score_gpt":0.2893704127327221,"score_spread":0.2610090381901979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904813721","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021179001,0.97044295,0.00025709844,0.007812502,0.007924308,0.000038377853,0.0006206715,0.00006520279,0.012627013],"genre_scores_gemma":[0.0022328363,0.96671975,0.0004553099,0.009006259,0.0072502657,0.00006257846,0.0011437356,0.000042189495,0.013087108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912435,0.00014525253,0.00013233114,0.00016555487,0.0003313901,0.00010116634],"domain_scores_gemma":[0.99619687,0.0011154868,0.00046632884,0.00015027051,0.0016062688,0.00046474295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628038,0.00082372123,0.0013123914,0.0048562237,0.0008167124,0.0033690615,0.0015353076,0.002030133,0.052794944],"category_scores_gemma":[0.007085585,0.00039682232,0.00072809483,0.0042073308,0.00069095916,0.0024599922,0.0015853484,0.0020076318,0.025092483],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120913595,0.000032303968,0.0002895731,0.01266733,0.00007223979,0.0003026421,0.00010104637,0.000125602,0.0005406178,0.0040461663,0.5096422,0.47205946],"study_design_scores_gemma":[0.000005105641,0.0000127106005,0.00032923717,0.002854229,0.000023846449,0.0002869878,0.000022072709,0.000007941789,0.000053880078,0.00036090158,0.9960377,0.0000052877135],"about_ca_topic_score_codex":0.0035498263,"about_ca_topic_score_gemma":0.0050072875,"teacher_disagreement_score":0.052794944,"about_ca_system_score_codex":0.0026056503,"about_ca_system_score_gemma":0.006424473,"threshold_uncertainty_score":0.17661667},"labels":[],"label_agreement":null},{"id":"W2907775321","doi":"10.1145/3309202","title":"Group Mutual Exclusion by Fetch-and-increment","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Concurrency; Computer science; Scalability; Synchronization (alternating current); Fetch; Shared memory; Parallel computing; Distributed computing; Concurrency control; Shared resource; Group (periodic table); Resource (disambiguation); Simple (philosophy); Operating system; Computer network; Programming language; Channel (broadcasting)","score_opus":0.01568523912858472,"score_gpt":0.25720906230243795,"score_spread":0.24152382317385324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907775321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030889275,0.0003208349,0.96021926,0.0003510368,0.00013425761,0.00022143194,0.00006689692,0.002330837,0.0054661646],"genre_scores_gemma":[0.4392828,0.00021573999,0.55075073,0.00025939572,0.000099347395,0.00040927823,0.0002217014,0.00034157123,0.008419463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839264,0.00036654132,0.00010537224,0.0003227907,0.0005316897,0.00028101113],"domain_scores_gemma":[0.9960751,0.0014997477,0.00033947578,0.0013073237,0.0006025024,0.00017585329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385307,0.0008545662,0.001142134,0.0009219939,0.0016679508,0.0012790535,0.0020501348,0.0010703497,0.0042172996],"category_scores_gemma":[0.005561622,0.00039762037,0.0007174344,0.0011340566,0.001585799,0.0028109576,0.002421736,0.0014396076,0.0009963547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015318418,0.0003939051,0.003320701,0.0003633104,0.00015228393,0.00036386168,0.00088335254,0.1947221,0.030364081,0.21262608,0.013020845,0.54225767],"study_design_scores_gemma":[0.00023112306,0.00032724152,0.00039994682,0.000042391235,0.00007318446,0.00025816783,0.00010702049,0.81569713,0.03375153,0.12693746,0.022101102,0.000073698124],"about_ca_topic_score_codex":0.0026499878,"about_ca_topic_score_gemma":0.003966863,"teacher_disagreement_score":0.0042172996,"about_ca_system_score_codex":0.00096740155,"about_ca_system_score_gemma":0.0018356905,"threshold_uncertainty_score":0.014108241},"labels":[],"label_agreement":null},{"id":"W2911325612","doi":"10.1007/978-0-387-39940-9_3864","title":"Transaction Processing","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transaction processing; Database transaction; Transaction processing system; Database","score_opus":0.014378989687380312,"score_gpt":0.23221824877704855,"score_spread":0.21783925908966825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911325612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027580878,0.024390295,0.38240382,0.0025804914,0.0042065806,0.00085604127,0.009424073,0.024439558,0.54894096],"genre_scores_gemma":[0.023994163,0.016828129,0.17509048,0.0018615345,0.0013376285,0.0005946163,0.027060017,0.003212887,0.75002044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854773,0.0001520682,0.00014119106,0.0002672471,0.0008044307,0.00008729444],"domain_scores_gemma":[0.99843985,0.00024288835,0.000046700563,0.00065454835,0.0005221919,0.00009396411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662256,0.0015532648,0.0013459764,0.0020154275,0.00090020086,0.0051750634,0.0027771008,0.0011995599,0.13315195],"category_scores_gemma":[0.0027923512,0.0009187716,0.00081799785,0.004535731,0.0006308312,0.0034134844,0.0018177623,0.001828547,0.19454034],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007869018,0.000091767855,0.00019399317,0.0006082669,0.00004788087,0.00011294735,0.00012004874,0.0013470296,0.005466155,0.032448135,0.40224048,0.55724454],"study_design_scores_gemma":[0.000022584216,0.000059160466,0.00029014796,0.00019474096,0.00002952943,0.000502193,0.00004715078,0.0053064595,0.00402873,0.027167317,0.96232384,0.000028116432],"about_ca_topic_score_codex":0.0011262327,"about_ca_topic_score_gemma":0.0014032198,"teacher_disagreement_score":0.13315195,"about_ca_system_score_codex":0.0006836939,"about_ca_system_score_gemma":0.0014189273,"threshold_uncertainty_score":0.44543767},"labels":[],"label_agreement":null},{"id":"W2914331268","doi":"10.1098/rspa.2019.0170","title":"S-money: virtual tokens for a relativistic economy","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council","keywords":"Implementation; Point (geometry); Issuer; State (computer science); Security token; Scheme (mathematics)","score_opus":0.006937457970678929,"score_gpt":0.20191085007066548,"score_spread":0.19497339209998654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914331268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027252976,0.0008842522,0.90388685,0.0037245203,0.0009550474,0.00019856959,0.00023795695,0.001035395,0.061824415],"genre_scores_gemma":[0.7165367,0.0009541601,0.24890526,0.0011117294,0.00034343704,0.00062779296,0.00017505937,0.00047981384,0.030865954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741507,0.0009519247,0.00023374392,0.0003192927,0.0006814424,0.00039850888],"domain_scores_gemma":[0.9971668,0.0009012607,0.00033606007,0.0009438324,0.00032261614,0.00032945324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003127037,0.0007309881,0.0009904966,0.0011241687,0.0019288072,0.0058761723,0.0030938217,0.0023141361,0.0107476525],"category_scores_gemma":[0.0070120515,0.0006288928,0.0011395894,0.0013719669,0.007288253,0.01220823,0.004896748,0.0035592553,0.0022669209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022408864,0.0000061591536,0.000036769834,0.000017603015,0.0000026944376,0.0000308258,0.000071156224,0.0016036765,0.0001954412,0.99543935,0.00055617985,0.0020177194],"study_design_scores_gemma":[0.000037082045,0.000047880578,0.000047701782,0.00005867005,0.000013876648,0.00011464046,0.0001101362,0.027677238,0.0017063346,0.9325433,0.03760302,0.000040160114],"about_ca_topic_score_codex":0.0007212046,"about_ca_topic_score_gemma":0.0007437383,"teacher_disagreement_score":0.0107476525,"about_ca_system_score_codex":0.0023378893,"about_ca_system_score_gemma":0.001790414,"threshold_uncertainty_score":0.035954416},"labels":[],"label_agreement":null},{"id":"W2914984780","doi":"10.1145/3251652","title":"Session details: Technical Session 3: Architecture 1","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Architecture; Computer architecture; World Wide Web; Art; Visual arts","score_opus":0.024508735415164927,"score_gpt":0.2747161182500326,"score_spread":0.2502073828348677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914984780","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00484912,0.0022270528,0.027004316,0.012017934,0.02227742,0.0024116377,0.019294059,0.022511013,0.8874075],"genre_scores_gemma":[0.019599516,0.0011440546,0.005000128,0.0012618549,0.0025625448,0.00047600272,0.011374368,0.0023520626,0.95622945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991767,0.00013416685,0.000035691144,0.00020897221,0.00025889787,0.00018552937],"domain_scores_gemma":[0.9972638,0.00028803165,0.00005304297,0.0006421571,0.0008481099,0.00090487784],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018253392,0.0011980536,0.0013629964,0.00063037494,0.002221955,0.005572086,0.001422731,0.0042562135,0.8093835],"category_scores_gemma":[0.0023037042,0.00042926127,0.0011754166,0.0008681055,0.0003962315,0.0023562317,0.002395437,0.0023145305,0.71413577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032255347,0.00010877634,0.00025683633,0.00019772962,0.000013751739,0.000050920928,0.000050238345,0.00018923335,0.0040303003,0.002381933,0.9530483,0.03934952],"study_design_scores_gemma":[0.000089033936,0.00012911008,0.00070455356,0.0000572651,0.00001705727,0.00006717846,0.00004290202,0.00084420096,0.0023404246,0.0016010465,0.9940889,0.000018367567],"about_ca_topic_score_codex":0.0018899614,"about_ca_topic_score_gemma":0.0031240985,"teacher_disagreement_score":0.19061649,"about_ca_system_score_codex":0.0012149278,"about_ca_system_score_gemma":0.0017519414,"threshold_uncertainty_score":0.27189124},"labels":[],"label_agreement":null},{"id":"W2919503362","doi":"10.1007/978-1-4899-7993-3_80723-1","title":"Replication for Availability and Fault Tolerance","year":2017,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Fault tolerance; Computer science; Reliability engineering; Biology; Distributed computing; Engineering; Virology","score_opus":0.024603713140186403,"score_gpt":0.26838100624533584,"score_spread":0.24377729310514945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919503362","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001954588,0.2904307,0.16285607,0.006190733,0.010876788,0.00015195755,0.0006701108,0.002385854,0.52448314],"genre_scores_gemma":[0.035116106,0.17366241,0.07812458,0.002210656,0.0088133095,0.00023667821,0.0014708065,0.0011623515,0.6992031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.000067463465,0.000029082605,0.000100050296,0.0002539192,0.000036225138],"domain_scores_gemma":[0.9995567,0.00014632262,0.000025959365,0.00012232407,0.00011654169,0.00003214223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044649452,0.0009813743,0.0009290888,0.0013444051,0.0007338421,0.0032951133,0.0015257043,0.0012925689,0.042194534],"category_scores_gemma":[0.0011610067,0.00044780687,0.0004487004,0.0030994993,0.0010823713,0.004483955,0.0015292924,0.0023355093,0.020378765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029047585,0.00004575771,0.00006740183,0.0008099718,0.000019288678,0.00009524183,0.000277368,0.0015677083,0.0026079942,0.31457174,0.24220638,0.43770218],"study_design_scores_gemma":[0.0000060120974,0.00001878631,0.00008857043,0.0002185841,0.000007766206,0.0002816078,0.00004856857,0.0011801088,0.0005010311,0.09270858,0.90492797,0.000012485269],"about_ca_topic_score_codex":0.0007908146,"about_ca_topic_score_gemma":0.0010721561,"teacher_disagreement_score":0.042194534,"about_ca_system_score_codex":0.0009525452,"about_ca_system_score_gemma":0.0010705191,"threshold_uncertainty_score":0.14115483},"labels":[],"label_agreement":null},{"id":"W2920630112","doi":"10.1007/978-1-4614-8265-9_433","title":"Concurrency Control for Replicated Databases","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Concurrency control; Database; Computer science; Multiversion concurrency control; Non-lock concurrency control; Distributed concurrency control; Database transaction","score_opus":0.0277880456339579,"score_gpt":0.26890785330976885,"score_spread":0.24111980767581095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920630112","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005603899,0.06324653,0.7768278,0.0018650301,0.0023315768,0.00020265195,0.00030995326,0.0028518026,0.14676067],"genre_scores_gemma":[0.36633727,0.055706926,0.29820246,0.0012451439,0.0044913604,0.0007196223,0.0017848401,0.0014349625,0.27007738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983924,0.0002058972,0.00009597837,0.00026257738,0.00094288227,0.00010034934],"domain_scores_gemma":[0.99918264,0.00024166626,0.000042700423,0.00031737876,0.00016919749,0.00004649972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008932707,0.0007353976,0.0007186336,0.00076509756,0.0006915365,0.0033111556,0.0019523732,0.00080030935,0.00974234],"category_scores_gemma":[0.0025373236,0.00060380547,0.00052208174,0.0015256956,0.001500427,0.0025471542,0.001923406,0.0025730284,0.0030232568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010175787,0.000085689295,0.00014173471,0.00048780983,0.000042517735,0.00010632704,0.00033554237,0.016298182,0.006328594,0.60028917,0.04587476,0.32990786],"study_design_scores_gemma":[0.00005306501,0.000058481954,0.00018344051,0.00022821834,0.000032912067,0.00022317661,0.00006829315,0.06648462,0.004002642,0.62002504,0.30860323,0.000036870668],"about_ca_topic_score_codex":0.0016519151,"about_ca_topic_score_gemma":0.0012971745,"teacher_disagreement_score":0.00974234,"about_ca_system_score_codex":0.0013044868,"about_ca_system_score_gemma":0.0013579521,"threshold_uncertainty_score":0.032591403},"labels":[],"label_agreement":null},{"id":"W2928599599","doi":"10.1007/s00037-021-00210-5","title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","year":2021,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Hierarchy; Randomness; Theoretical computer science; Boolean function; Product term; Boolean expression; Computer science; Mathematics; Communication complexity; Discrete mathematics; Parity function; Standard Boolean model; And-inverter graph; Two-element Boolean algebra; Algebra over a field","score_opus":0.047338408468813244,"score_gpt":0.29101494548610046,"score_spread":0.24367653701728723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928599599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20688125,0.009183376,0.6791725,0.03174949,0.00076365005,0.00014919117,0.0007263135,0.0005461914,0.070827976],"genre_scores_gemma":[0.925299,0.0027660434,0.0562499,0.001253321,0.0013646277,0.00033021363,0.00031519152,0.0001788933,0.012242925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99302846,0.0032107679,0.0003078508,0.0010479895,0.0016353925,0.00076946657],"domain_scores_gemma":[0.9299933,0.06206466,0.0017485572,0.003467804,0.0016183715,0.0011073857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006833719,0.00094205746,0.0020191849,0.001986959,0.0025217338,0.0069632553,0.0028787053,0.0033413966,0.00821635],"category_scores_gemma":[0.046042677,0.0012070806,0.0013773509,0.0029019988,0.008578528,0.0226169,0.0034189343,0.008274473,0.00051013415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036442514,0.000030814394,0.00018760528,0.00004264171,0.0000062025365,0.000015093849,0.000093216964,0.0060692104,0.000113137925,0.9890189,0.00092937314,0.0034574377],"study_design_scores_gemma":[0.000013813038,0.0000055281216,0.00008872376,0.000008038562,0.000005827234,0.0000148233685,0.000022420601,0.029558234,0.00007562034,0.96964,0.000559744,0.000007176574],"about_ca_topic_score_codex":0.0034064937,"about_ca_topic_score_gemma":0.0034647125,"teacher_disagreement_score":0.00821635,"about_ca_system_score_codex":0.006531429,"about_ca_system_score_gemma":0.0029028652,"threshold_uncertainty_score":0.04738909},"labels":[],"label_agreement":null},{"id":"W2943456054","doi":"10.1007/978-3-030-18419-3_8","title":"Configuring Data Flows in the Internet of Things for Security and Privacy Requirements","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Secrecy; Data flow diagram; Transitive relation; Theoretical computer science; The Internet; Internet of Things; Flow (mathematics); Computer security; Distributed computing; Database; World Wide Web","score_opus":0.040748535938061776,"score_gpt":0.28392849178172974,"score_spread":0.24317995584366797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943456054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10062526,0.0014399933,0.864811,0.0009559916,0.0006328745,0.00037455384,0.00019774941,0.0019039762,0.029058712],"genre_scores_gemma":[0.7466319,0.0015012511,0.23805086,0.0003345361,0.00023955049,0.0001533714,0.00035050593,0.00032947148,0.012408602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922156,0.00017188652,0.00006728843,0.00014648573,0.00026040393,0.00013237317],"domain_scores_gemma":[0.9984066,0.00063032453,0.000108339606,0.0005802025,0.00018814836,0.00008637999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014627909,0.0005860039,0.00044554807,0.000644346,0.0011938893,0.0024604602,0.0011228605,0.0010361173,0.0020059347],"category_scores_gemma":[0.0027988062,0.00043056245,0.0005021886,0.0006594047,0.00080632756,0.0032388591,0.0009871296,0.0013039774,0.00058556336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008377234,0.0003051326,0.00478669,0.00045192154,0.000086922686,0.0009642238,0.0013702168,0.093049005,0.08879127,0.30183652,0.014825163,0.49269515],"study_design_scores_gemma":[0.00006889896,0.00033789646,0.00220036,0.00028023956,0.00012303237,0.0017088882,0.0006850797,0.5412514,0.081136905,0.29261228,0.0794887,0.00010636288],"about_ca_topic_score_codex":0.0006830706,"about_ca_topic_score_gemma":0.0009033676,"teacher_disagreement_score":0.0024604602,"about_ca_system_score_codex":0.0005517306,"about_ca_system_score_gemma":0.00063420524,"threshold_uncertainty_score":0.0077360272},"labels":[],"label_agreement":null},{"id":"W2946052740","doi":"10.1007/s00446-019-00354-2","title":"The complexity of leader election in diameter-two networks","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Computing and Communication Foundations; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Upper and lower bounds; Combinatorics; Constant (computer programming); Randomized algorithm; Monte Carlo method; Monte Carlo algorithm; Theory of computation; Mathematics; Discrete mathematics; Deterministic algorithm; Binary logarithm; Communication complexity; Computer science; Algorithm; Theoretical computer science; Statistics","score_opus":0.021335128452466,"score_gpt":0.25505197559873033,"score_spread":0.23371684714626434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946052740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4379986,0.0023688741,0.49320945,0.017636253,0.0005840206,0.00032280886,0.0012905275,0.0009794493,0.04561004],"genre_scores_gemma":[0.9614315,0.00090026757,0.03024424,0.00040769338,0.0002849874,0.00020820479,0.0004103261,0.0001737812,0.005938951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545825,0.0017225161,0.00021550691,0.0006794198,0.0012390502,0.0006853493],"domain_scores_gemma":[0.93717235,0.054085016,0.0025503703,0.0031385366,0.0013891509,0.0016646266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017615,0.00058751134,0.0018907235,0.0010373875,0.0023065237,0.0050340546,0.002974249,0.0029061865,0.0061129523],"category_scores_gemma":[0.041818973,0.0010880247,0.0009495124,0.0018395572,0.0028193896,0.009181184,0.0035359669,0.0030864389,0.0006960741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012461878,0.00018467807,0.0041906754,0.00037071918,0.00012163432,0.00042892483,0.00076639553,0.5454755,0.0035587088,0.39682168,0.013091053,0.033743925],"study_design_scores_gemma":[0.00012828891,0.000049421822,0.0007549059,0.000021795526,0.000040574036,0.00013194016,0.00018334367,0.7036515,0.0007807176,0.29271302,0.0015180509,0.000026486108],"about_ca_topic_score_codex":0.0029827892,"about_ca_topic_score_gemma":0.0029410196,"teacher_disagreement_score":0.0061129523,"about_ca_system_score_codex":0.0034463939,"about_ca_system_score_gemma":0.0023862375,"threshold_uncertainty_score":0.02500552},"labels":[],"label_agreement":null},{"id":"W2949143797","doi":"10.11575/prism/18696","title":"RMR-Efficient Randomized Abortable Mutual Exclusion","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Computer science; Binary logarithm; Abort; Asynchronous communication; Swap (finance); Adversary model; Scheduling (production processes); Upper and lower bounds; Logarithm; Omega; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Adversary; Operating system; Computer network; Physics; Computer security; Mathematical optimization","score_opus":0.04592313956739367,"score_gpt":0.18561762495287462,"score_spread":0.13969448538548096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949143797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09981,0.00083663384,0.87769467,0.0014452758,0.00023888808,0.00039319484,0.0004756941,0.0067331577,0.012372491],"genre_scores_gemma":[0.7799447,0.00020307639,0.20985965,0.0005530936,0.0001210831,0.0004428677,0.0007107984,0.0004101802,0.007754509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947055,0.0016581458,0.00023200845,0.0009839543,0.0013314201,0.0010889787],"domain_scores_gemma":[0.9877101,0.0068876604,0.0011432444,0.0027956746,0.00082801224,0.0006353169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025598113,0.0009146224,0.0018243323,0.000537174,0.0014105614,0.0017106746,0.004237209,0.0016342392,0.005986742],"category_scores_gemma":[0.011372088,0.0005030188,0.00095640187,0.0008991315,0.0016881339,0.003162688,0.003985755,0.0024543316,0.0017568417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044230116,0.0008887195,0.0030240938,0.00084052444,0.00020695482,0.00068040873,0.00081427314,0.48145324,0.036021516,0.21833915,0.021871148,0.23143701],"study_design_scores_gemma":[0.00035836734,0.00023056193,0.00018755977,0.000021749504,0.00003330085,0.00015576501,0.000050988434,0.9241183,0.0075424323,0.06415268,0.00310783,0.00004035337],"about_ca_topic_score_codex":0.0016275414,"about_ca_topic_score_gemma":0.0029337814,"teacher_disagreement_score":0.005986742,"about_ca_system_score_codex":0.0016246351,"about_ca_system_score_gemma":0.0035869055,"threshold_uncertainty_score":0.020027697},"labels":[],"label_agreement":null},{"id":"W2950288029","doi":"10.48550/arxiv.1603.04067","title":"Space Bounds for Adaptive Renaming","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Asynchronous communication; Upper and lower bounds; Combinatorics; Function (biology); Space (punctuation); Discrete mathematics; Algorithm; Computer science; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.06983675622700306,"score_gpt":0.19168659251151732,"score_spread":0.12184983628451426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950288029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21806654,0.0012360585,0.7605154,0.0017183506,0.00011860114,0.0003401142,0.00032237038,0.0039057315,0.013776808],"genre_scores_gemma":[0.77464426,0.00038578516,0.21723428,0.0003862037,0.000081541104,0.0005388816,0.00048183335,0.00064226164,0.005604989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98474056,0.004823542,0.0012073698,0.0030298445,0.003222519,0.0029762588],"domain_scores_gemma":[0.953135,0.029452918,0.0026575716,0.011744989,0.0018775356,0.001132009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006446328,0.0015721403,0.0018811928,0.0010244796,0.0021957073,0.004906176,0.005983724,0.002460678,0.011424784],"category_scores_gemma":[0.030566573,0.0009624417,0.002407977,0.0018617494,0.00418861,0.016923964,0.00781408,0.004182947,0.0014758095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030941179,0.00050473056,0.004735504,0.0009676964,0.00025868686,0.0003008254,0.0018406514,0.4545562,0.04009516,0.3410772,0.0046545677,0.14791466],"study_design_scores_gemma":[0.0001432653,0.00033600297,0.00051673653,0.00005198944,0.00012750474,0.0001630417,0.00020576367,0.8308794,0.015879188,0.14818907,0.0034325519,0.00007543916],"about_ca_topic_score_codex":0.0023891667,"about_ca_topic_score_gemma":0.0028566793,"teacher_disagreement_score":0.011424784,"about_ca_system_score_codex":0.0036499908,"about_ca_system_score_gemma":0.0037059127,"threshold_uncertainty_score":0.03821969},"labels":[],"label_agreement":null},{"id":"W2950841231","doi":"10.1145/2692916.2555267","title":"A general technique for non-blocking trees","year":2014,"lang":"en","type":"preprint","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Computer science; Tree (set theory); Java; Word (group theory); Class (philosophy); Theoretical computer science; Algorithm; Parallel computing; Programming language; Mathematics; Combinatorics; Artificial intelligence; Computer network","score_opus":0.024628206831011055,"score_gpt":0.28293714052447555,"score_spread":0.25830893369346447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950841231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023647416,0.0001249014,0.99056983,0.00018114752,0.00007132343,0.0000974647,0.00006965209,0.0023807057,0.004140253],"genre_scores_gemma":[0.07810138,0.0004575026,0.9026194,0.000583488,0.00014028868,0.0006107786,0.00031797081,0.0024498221,0.014719385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595696,0.0005258329,0.0003993963,0.0007449593,0.0017967607,0.00057604763],"domain_scores_gemma":[0.99340993,0.0018932772,0.0004373847,0.0027212368,0.0013125238,0.00022567753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024048244,0.0008460822,0.0008021631,0.0009897433,0.0019832274,0.0029814255,0.004126574,0.0012346514,0.012464171],"category_scores_gemma":[0.0083907945,0.0011593153,0.0013910785,0.0017632288,0.002694538,0.007194694,0.00480183,0.0047670216,0.0045069847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028648594,0.00011767084,0.00061987044,0.00058910943,0.0000503409,0.00015703928,0.0010112417,0.011007719,0.047472678,0.76703644,0.010809934,0.16084155],"study_design_scores_gemma":[0.00020808514,0.00026584385,0.00034700654,0.00022459344,0.00012307726,0.00086490065,0.00031194944,0.11966343,0.099213265,0.52545583,0.25318474,0.00013722864],"about_ca_topic_score_codex":0.0036493558,"about_ca_topic_score_gemma":0.0045705023,"teacher_disagreement_score":0.012464171,"about_ca_system_score_codex":0.0015514621,"about_ca_system_score_gemma":0.0034294755,"threshold_uncertainty_score":0.041696787},"labels":[],"label_agreement":null},{"id":"W2951157870","doi":"10.1137/1.9781611974331.ch44","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Upper and lower bounds; Node (physics); Logarithm; Computer science; Computer network; String (physics); Binary logarithm; Advice (programming); Tree (set theory); Time complexity; Discrete mathematics; Mathematics; Combinatorics; Algorithm","score_opus":0.02140562872449713,"score_gpt":0.2534460718057035,"score_spread":0.23204044308120636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951157870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3145046,0.0047594355,0.6467813,0.0051632375,0.00034513144,0.00028696595,0.00069214514,0.0015555647,0.025911596],"genre_scores_gemma":[0.9113077,0.0015372097,0.082696214,0.0004176253,0.00026568724,0.0002602434,0.0002909084,0.0004151937,0.0028092435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927861,0.0024562492,0.00032569398,0.0010577482,0.0017013843,0.0016728205],"domain_scores_gemma":[0.8671459,0.11324604,0.0063298056,0.008125555,0.0024448335,0.0027079615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008619079,0.0011244483,0.0013424839,0.001290405,0.001869421,0.0035542191,0.00221947,0.0018767696,0.004069925],"category_scores_gemma":[0.07350697,0.000704208,0.00089334475,0.0014970397,0.0027099547,0.008073768,0.0029476844,0.0027708746,0.00067813107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046979,0.0005165958,0.0036435518,0.0008741268,0.00015643254,0.00034915438,0.0012520626,0.59321904,0.03572197,0.27027813,0.006086446,0.08320454],"study_design_scores_gemma":[0.00014608048,0.0005058826,0.0009090403,0.00008289114,0.00010362411,0.000256616,0.00024772418,0.86143047,0.010443212,0.123292044,0.0025208234,0.000061634964],"about_ca_topic_score_codex":0.0007632981,"about_ca_topic_score_gemma":0.0010823961,"teacher_disagreement_score":0.008619079,"about_ca_system_score_codex":0.002951691,"about_ca_system_score_gemma":0.0024220587,"threshold_uncertainty_score":0.045582652},"labels":[],"label_agreement":null},{"id":"W2951207499","doi":"10.1007/s00446-019-00355-1","title":"Deciding and verifying network properties locally with few output bits","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Predicate (mathematical logic); Verdict; Computer science; Theory of computation; Boolean network; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Boolean function; Law; Programming language","score_opus":0.013251922115166466,"score_gpt":0.1993719256950851,"score_spread":0.18612000357991865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951207499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853365,0.00016794707,0.6046528,0.0011466908,0.00010423656,0.00020873822,0.00042864642,0.003729487,0.0042249546],"genre_scores_gemma":[0.9338028,0.00007204226,0.06329946,0.00022229234,0.00009666677,0.000136777,0.00034894136,0.00050710054,0.0015140339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98905563,0.0035774854,0.0008443103,0.0024984688,0.0025263485,0.0014977744],"domain_scores_gemma":[0.87541014,0.10307584,0.005516218,0.012189192,0.002625892,0.0011827032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005431774,0.0014236518,0.0020467883,0.00086665794,0.00166977,0.0045841425,0.0025038323,0.0026486926,0.0057240073],"category_scores_gemma":[0.037467387,0.0012555424,0.001755454,0.0008867824,0.0041077402,0.011793715,0.0049613626,0.0033786285,0.0013287055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011945098,0.0010697522,0.024783786,0.001479532,0.0006937979,0.002330169,0.001882946,0.40716425,0.20587635,0.16676831,0.0065820375,0.16942397],"study_design_scores_gemma":[0.00049709075,0.00056969567,0.0011095196,0.00006865699,0.00019974276,0.0002563391,0.000437966,0.63497597,0.14611427,0.21463433,0.001056556,0.000079874735],"about_ca_topic_score_codex":0.0012044791,"about_ca_topic_score_gemma":0.0021121155,"teacher_disagreement_score":0.0057240073,"about_ca_system_score_codex":0.0017932643,"about_ca_system_score_gemma":0.0026684224,"threshold_uncertainty_score":0.02872628},"labels":[],"label_agreement":null},{"id":"W2951609085","doi":"10.48550/arxiv.1610.09435","title":"On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Pairwise comparison; Anonymity; Context (archaeology); Population; Task (project management); Communications protocol; Focus (optics); Feature (linguistics); Distributed computing; Power (physics); Theoretical computer science; Artificial intelligence; Computer security; Computer network; Engineering","score_opus":0.07358801294285953,"score_gpt":0.2360105798324253,"score_spread":0.16242256688956574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951609085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15965366,0.00022368065,0.8317909,0.0012469767,0.00007161067,0.000098359,0.000047619724,0.00024387146,0.006623366],"genre_scores_gemma":[0.935096,0.00031548954,0.062123224,0.0002756947,0.00007270778,0.00022709754,0.000056576406,0.00008780459,0.0017453753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994896,0.0033118187,0.00020419582,0.00040486027,0.0008680437,0.0003149794],"domain_scores_gemma":[0.96819645,0.025932785,0.0016643541,0.0029018132,0.00073213875,0.0005724828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005288049,0.0007395596,0.0011884946,0.0008780659,0.00097482087,0.0016993192,0.0020198259,0.0017136927,0.002189267],"category_scores_gemma":[0.034534097,0.00044730373,0.0012431892,0.000686144,0.0058699665,0.0053711543,0.003914476,0.0028502701,0.00024512722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015621605,0.000058355246,0.0014562735,0.0000929695,0.00005553315,0.00019355369,0.00062567997,0.5586681,0.00313233,0.42932922,0.00027027246,0.005961467],"study_design_scores_gemma":[0.00003021553,0.000050502902,0.000083861705,0.000011383701,0.000012625388,0.000029950614,0.000040799114,0.86495066,0.0009212809,0.13330041,0.0005554504,0.000012903287],"about_ca_topic_score_codex":0.001150763,"about_ca_topic_score_gemma":0.0005072622,"teacher_disagreement_score":0.005288049,"about_ca_system_score_codex":0.0011357631,"about_ca_system_score_gemma":0.000897386,"threshold_uncertainty_score":0.027966201},"labels":[],"label_agreement":null},{"id":"W2951937026","doi":"10.48550/arxiv.1510.04347","title":"Processing Regular Path Queries on Arbitrarily Distributed Data","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Query optimization; Path (computing); Graph; Distributed database; Matching (statistics); Path expression; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Process (computing); Data mining; Query language; Database; Mathematics; Artificial intelligence","score_opus":0.13218381841354576,"score_gpt":0.21472078158151567,"score_spread":0.0825369631679699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951937026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15715316,0.0003407303,0.8358729,0.001342625,0.00008584715,0.00025897403,0.00052754517,0.0029934738,0.0014248884],"genre_scores_gemma":[0.6850526,0.00022997898,0.31073204,0.0003318596,0.00009978163,0.000190833,0.0010815469,0.00045094034,0.0018303937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934396,0.0019805846,0.0005546974,0.0013880602,0.0021051902,0.00053192355],"domain_scores_gemma":[0.9677902,0.020636443,0.0022130942,0.0065426365,0.0022830951,0.00053456915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004916283,0.0008530843,0.0012968292,0.0012643225,0.0010648165,0.0020232631,0.0024305289,0.0015068774,0.0016752613],"category_scores_gemma":[0.032027975,0.00046084131,0.0008095364,0.0025141395,0.0019271022,0.005657633,0.0031273686,0.0017867022,0.00042335477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001635279,0.000509567,0.010476141,0.00049397704,0.00025506402,0.00091332616,0.0014235388,0.6193915,0.04267508,0.08496126,0.013407951,0.22385727],"study_design_scores_gemma":[0.000083583895,0.00015680591,0.0007637392,0.000012467802,0.0000367884,0.0002580147,0.00036616717,0.8744753,0.013970636,0.10717265,0.0026765894,0.000027296248],"about_ca_topic_score_codex":0.003933604,"about_ca_topic_score_gemma":0.0036734042,"teacher_disagreement_score":0.004916283,"about_ca_system_score_codex":0.0013170375,"about_ca_system_score_gemma":0.0014900741,"threshold_uncertainty_score":0.026000082},"labels":[],"label_agreement":null},{"id":"W2952255530","doi":"10.48550/arxiv.1507.02722","title":"On the Time and Space Complexity of ABA Prevention and Detection","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Bounded function; Computer science; Base (topology); Discrete mathematics; Upper and lower bounds; Algorithm; Parallel computing; Mathematics","score_opus":0.08427769752995458,"score_gpt":0.19520519659250207,"score_spread":0.1109274990625475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952255530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41992995,0.00411498,0.5346201,0.0067416155,0.00034026994,0.0008439301,0.0012224324,0.005715994,0.026470678],"genre_scores_gemma":[0.7519103,0.0011008944,0.23743422,0.0009202072,0.0002480763,0.0007737535,0.0009766639,0.0012181329,0.005417733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98151153,0.006013395,0.0011623434,0.0027788118,0.0038118658,0.0047219982],"domain_scores_gemma":[0.9155783,0.06963825,0.003591054,0.007673997,0.0021580616,0.0013603314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008573999,0.0026456194,0.0024998183,0.0019303636,0.0027485525,0.007267293,0.0052989055,0.0032690864,0.013537899],"category_scores_gemma":[0.039228726,0.0018943002,0.0033653888,0.0030568822,0.005625894,0.020511592,0.0061685825,0.0061702114,0.0017080716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062706163,0.0008527931,0.010703421,0.0018796149,0.0005218803,0.00039745137,0.0015470412,0.5796951,0.029950535,0.13495678,0.009448022,0.22377676],"study_design_scores_gemma":[0.0004082503,0.00045079508,0.0012613067,0.000098621385,0.0002875845,0.00018155223,0.00032873295,0.8864874,0.012482699,0.09593398,0.0019983035,0.00008070165],"about_ca_topic_score_codex":0.007862968,"about_ca_topic_score_gemma":0.010468958,"teacher_disagreement_score":0.013537899,"about_ca_system_score_codex":0.007835374,"about_ca_system_score_gemma":0.010242818,"threshold_uncertainty_score":0.056849897},"labels":[],"label_agreement":null},{"id":"W2953072692","doi":"10.1007/978-3-031-01873-2_1","title":"On Transactional Concurrency Control","year":2019,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on data management","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Lock (firearm); Optimistic concurrency control; Multiversion concurrency control; Concurrency control; Non-lock concurrency control; Serializability; Transactional memory; Isolation (microbiology); Timestamp-based concurrency control; Software transactional memory; Concurrency; Distributed concurrency control; Atomicity; Programming language; Distributed computing; Database transaction; Parallel computing; Operating system; Transaction processing; Distributed transaction; Engineering","score_opus":0.025036753098219146,"score_gpt":0.24090283150141617,"score_spread":0.21586607840319702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953072692","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026992226,0.07148541,0.35787183,0.0056309155,0.008963264,0.00010501982,0.0003567324,0.0012677192,0.5516199],"genre_scores_gemma":[0.12450145,0.049935978,0.08376299,0.002809014,0.00670695,0.00034193945,0.0009576635,0.0010457755,0.7299382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991059,0.00013923227,0.00004439589,0.00014395411,0.00049289974,0.000073596406],"domain_scores_gemma":[0.99940073,0.0002515365,0.000022877539,0.0001657544,0.0001253051,0.000033766923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000878337,0.0011891956,0.00084632495,0.0013380641,0.0008822915,0.0029197743,0.0011883214,0.000925064,0.024736725],"category_scores_gemma":[0.0017803056,0.0006705422,0.0005132914,0.0024981475,0.0026248342,0.0038895574,0.0014413896,0.0033209615,0.0076619107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026913473,0.000027086247,0.000051203693,0.00017431127,0.000014169276,0.000033753484,0.00022438324,0.0026678932,0.0011193535,0.7699822,0.077271275,0.14840747],"study_design_scores_gemma":[0.000012784355,0.000026126187,0.00014275973,0.00015994538,0.0000145445465,0.00009841582,0.000045675864,0.0074704695,0.0012078471,0.5900534,0.40075174,0.000016376205],"about_ca_topic_score_codex":0.001352517,"about_ca_topic_score_gemma":0.0013861432,"teacher_disagreement_score":0.024736725,"about_ca_system_score_codex":0.0015243625,"about_ca_system_score_gemma":0.0008436229,"threshold_uncertainty_score":0.082752585},"labels":[],"label_agreement":null},{"id":"W2953319764","doi":"10.48550/arxiv.1501.02716","title":"Gracefully Degrading Consensus and $k$-Set Agreement in Directed Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Adversary; Impossibility; Adversary model; Computer science; Vertex (graph theory); Set (abstract data type); Consensus; Graph; Theoretical computer science; Discrete mathematics; Computer network; Mathematics; Combinatorics; Computer security; Artificial intelligence; Multi-agent system","score_opus":0.059658235111609136,"score_gpt":0.19923136335250058,"score_spread":0.13957312824089144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953319764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12240034,0.00019358392,0.8729175,0.0004831567,0.00004703793,0.00008170261,0.00008060426,0.00049831194,0.003297716],"genre_scores_gemma":[0.91667,0.00019434496,0.080555946,0.00012835511,0.0000367434,0.0001447172,0.00010865105,0.000090300055,0.0020709303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954965,0.0015504499,0.0002790453,0.0010784433,0.0009010245,0.00069457915],"domain_scores_gemma":[0.9765777,0.016377736,0.0019972867,0.0031202845,0.0011614035,0.0007657058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003265397,0.0008167112,0.0010672875,0.00066112255,0.001182763,0.0017503044,0.002127945,0.0014859771,0.0012901162],"category_scores_gemma":[0.020467881,0.00047670188,0.00096695416,0.0008944895,0.0029053008,0.0034259814,0.0032785127,0.0023499462,0.00031957784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038912188,0.00008921783,0.0021002174,0.0002060066,0.00009522173,0.00031890787,0.00078700186,0.7963044,0.01327403,0.15609546,0.0008949205,0.029445551],"study_design_scores_gemma":[0.000031143987,0.000077236415,0.00017846568,0.00001266851,0.000019398676,0.00007398555,0.0000772331,0.90848154,0.0066501675,0.08324224,0.0011352866,0.00002062524],"about_ca_topic_score_codex":0.0019013861,"about_ca_topic_score_gemma":0.0010616032,"teacher_disagreement_score":0.003265397,"about_ca_system_score_codex":0.0018224256,"about_ca_system_score_gemma":0.0011767879,"threshold_uncertainty_score":0.017269254},"labels":[],"label_agreement":null},{"id":"W2953374196","doi":"10.48550/arxiv.cs/0405088","title":"High-Level Networking With Mobile Code And First Order AND-Continuations","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Code (set theory); Scheme (mathematics); Programming language; Unification; Set (abstract data type); Hierarchy; Server; Operating system; Distributed computing","score_opus":0.0338302716134397,"score_gpt":0.24271902424980993,"score_spread":0.20888875263637025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953374196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04021934,0.00056184817,0.9458305,0.0005441801,0.00013699838,0.000056583023,0.00002844663,0.0018628192,0.01075921],"genre_scores_gemma":[0.55664057,0.00061544625,0.42520055,0.00023357323,0.0001243043,0.00025090386,0.00007655369,0.00033668816,0.016521355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00013879382,0.000041933712,0.0000920419,0.00021158019,0.000091823065],"domain_scores_gemma":[0.999126,0.00024004199,0.0001012053,0.00034510347,0.00009213705,0.00009547282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078304287,0.00039159786,0.00037332342,0.0006048863,0.001377827,0.0022813668,0.00121566,0.00090911705,0.002628042],"category_scores_gemma":[0.0020091285,0.00035586106,0.0004682089,0.00050881715,0.0026375116,0.0032409364,0.0022678508,0.0018104367,0.00070660684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007879714,0.00003942246,0.0005671582,0.00005670741,0.000011555085,0.00021861204,0.000677886,0.022235136,0.008887017,0.92836356,0.0013032552,0.03756091],"study_design_scores_gemma":[0.00006919937,0.00012708051,0.0002890956,0.00008235006,0.000032196414,0.0004669428,0.00016360343,0.23976025,0.023231441,0.6593267,0.0763883,0.00006282123],"about_ca_topic_score_codex":0.0012924247,"about_ca_topic_score_gemma":0.0016680126,"teacher_disagreement_score":0.002628042,"about_ca_system_score_codex":0.0011023008,"about_ca_system_score_gemma":0.0008369141,"threshold_uncertainty_score":0.0087916255},"labels":[],"label_agreement":null},{"id":"W2961418545","doi":"10.1109/icc.2019.8761162","title":"Using Aiders for Securing Communications of Resource-Challenged Mobile Devices","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mobile telephony; Mobile computing; Resource (disambiguation); Computer security; Telecommunications; Computer network; Mobile radio","score_opus":0.060966013043566,"score_gpt":0.31914907566980294,"score_spread":0.2581830626262369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961418545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0732203,0.0012902758,0.9015842,0.00088999065,0.0002304037,0.0002474064,0.000044912853,0.002435035,0.020057522],"genre_scores_gemma":[0.78323257,0.0007177053,0.20632087,0.0003439928,0.00012887287,0.0001304823,0.0000444324,0.00008766234,0.008993436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.00019712959,0.000047971338,0.000088902256,0.00018396344,0.00008505682],"domain_scores_gemma":[0.99824023,0.0005085633,0.00031546876,0.00051470334,0.00030634977,0.00011477231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530728,0.000610124,0.00044776508,0.0005316928,0.00074408995,0.0014421324,0.0011654744,0.00089586526,0.0026640615],"category_scores_gemma":[0.0027756365,0.00021556679,0.00023553119,0.0002632323,0.0011199265,0.0025404126,0.0021460932,0.0010100493,0.0009387897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006427735,0.0002556686,0.004408137,0.0007344779,0.00011640695,0.0014419607,0.002033032,0.06808383,0.22110096,0.24932522,0.007741518,0.44411606],"study_design_scores_gemma":[0.00018411943,0.0021548911,0.0022829466,0.00048480244,0.0003385751,0.0034717137,0.0010526492,0.42364764,0.27510747,0.05857958,0.23247932,0.0002163224],"about_ca_topic_score_codex":0.00022043793,"about_ca_topic_score_gemma":0.00037765322,"teacher_disagreement_score":0.0026640615,"about_ca_system_score_codex":0.00030448264,"about_ca_system_score_gemma":0.00034409604,"threshold_uncertainty_score":0.008912146},"labels":[],"label_agreement":null},{"id":"W2963106249","doi":"10.1145/3313276.3316407","title":"Why extension-based proofs fail","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Wind Energy Technologies Office; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of Toronto; U.S. Department of Energy; National Science Foundation","keywords":"Mathematical proof; Impossibility; Computer science; Extension (predicate logic); Valency; Gas meter prover; Class (philosophy); Asynchronous communication; Theoretical computer science; Argument (complex analysis); Calculus (dental); Programming language; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.020778679685950208,"score_gpt":0.2493409539084068,"score_spread":0.2285622742224566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963106249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05645977,0.0104216095,0.8034471,0.06330151,0.002634635,0.00019979483,0.00024538417,0.0033618773,0.059928313],"genre_scores_gemma":[0.79882324,0.005201969,0.17085232,0.009063574,0.0016666789,0.0005062825,0.00027904115,0.001477636,0.012129286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9767417,0.010856426,0.0013057867,0.002926633,0.0065721637,0.0015973131],"domain_scores_gemma":[0.8601513,0.1122746,0.0033054664,0.015068464,0.0077768336,0.0014234991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025354922,0.0007950625,0.0011810618,0.001182785,0.0021823645,0.0060574873,0.002636546,0.0054250904,0.006928027],"category_scores_gemma":[0.113544986,0.0013154217,0.0015586681,0.0010338397,0.011077941,0.022556083,0.006331033,0.0093616815,0.0028081443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011676768,0.000031635536,0.0004319725,0.00028008304,0.000043125998,0.00027248566,0.00078476366,0.0039093075,0.0006795544,0.9664324,0.0069941916,0.020023672],"study_design_scores_gemma":[0.00004914104,0.000016341284,0.000044015727,0.0000693206,0.000011778922,0.00019441091,0.000064192805,0.005001921,0.0010254264,0.9797221,0.013780081,0.000021183205],"about_ca_topic_score_codex":0.00053860695,"about_ca_topic_score_gemma":0.0003306797,"teacher_disagreement_score":0.025354922,"about_ca_system_score_codex":0.001628335,"about_ca_system_score_gemma":0.00204104,"threshold_uncertainty_score":0.13409126},"labels":[],"label_agreement":null},{"id":"W2963266914","doi":"10.1145/3293611.3331632","title":"Strongly Linearizable Implementations of Snapshots and Other Types","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linearizability; Correctness; Atomicity; Computer science; Implementation; Theoretical computer science; Programming language; Algorithm","score_opus":0.012529728348241639,"score_gpt":0.262734162641988,"score_spread":0.2502044342937464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963266914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0201751,0.0003964932,0.9666314,0.000715504,0.00023237156,0.00013896993,0.00041119242,0.0033800271,0.0079189595],"genre_scores_gemma":[0.6148348,0.00072136475,0.35234845,0.0011778814,0.0004978781,0.00071101997,0.0010301508,0.0013664864,0.027311845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995178,0.0009341281,0.00062084506,0.0010674801,0.0015345552,0.00066506566],"domain_scores_gemma":[0.9757523,0.0058832983,0.0023643465,0.0132151395,0.002367039,0.00041786145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038536245,0.00073941017,0.0008675853,0.0009273973,0.0009768328,0.0039425427,0.0028803358,0.0015542116,0.0105187725],"category_scores_gemma":[0.020039897,0.00074215024,0.0011390065,0.0015415032,0.0037192148,0.010047487,0.004146002,0.0032392594,0.002377186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033011526,0.00006860102,0.001971308,0.0002835061,0.00004626309,0.00023424512,0.00042898252,0.009844937,0.0047713774,0.92632544,0.004007647,0.051687643],"study_design_scores_gemma":[0.000109569155,0.00019676196,0.00046086984,0.00012829591,0.0001065445,0.00054239243,0.00018889994,0.07851551,0.025151093,0.8622497,0.032268587,0.00008184842],"about_ca_topic_score_codex":0.0007342908,"about_ca_topic_score_gemma":0.0007464255,"teacher_disagreement_score":0.0105187725,"about_ca_system_score_codex":0.0011190333,"about_ca_system_score_gemma":0.0015745403,"threshold_uncertainty_score":0.035188735},"labels":[],"label_agreement":null},{"id":"W2963560569","doi":"10.1007/s00446-013-0205-0","title":"Partition consistency","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Consistency model; Sequential consistency; Computer science; Weak consistency; Correctness; Consistency (knowledge bases); Implementation; Partition (number theory); Causal consistency; Cache coherence; Theoretical computer science; Strong consistency; Mathematical proof; Abstraction; Programming language; Class (philosophy); Parallel computing; Mathematics; Artificial intelligence; CPU cache; Cache algorithms; Cache","score_opus":0.010681241435513439,"score_gpt":0.22914644566822248,"score_spread":0.21846520423270904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963560569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023733225,0.0010960805,0.8201859,0.0016751266,0.0013369744,0.0008720176,0.00176501,0.006678612,0.142657],"genre_scores_gemma":[0.54682696,0.0011136506,0.33774698,0.0019039692,0.00075163785,0.0010223035,0.006232509,0.0038939961,0.10050805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590224,0.0007738778,0.00022275568,0.0009987864,0.0015763079,0.00052612874],"domain_scores_gemma":[0.98848224,0.0014693666,0.0003816761,0.0068324693,0.0024781933,0.00035606927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023959228,0.0010051749,0.0015441556,0.0017318932,0.003040956,0.0043736007,0.0032133136,0.0015371009,0.03363634],"category_scores_gemma":[0.01422746,0.0008644216,0.0010794438,0.0023899034,0.0018438735,0.005521729,0.005407949,0.0032819347,0.009969332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012855522,0.00033363086,0.002707718,0.0006244082,0.00018462709,0.00029019458,0.0008228334,0.028820017,0.019524755,0.50657904,0.07322887,0.36559838],"study_design_scores_gemma":[0.00040364952,0.0003388325,0.0021007983,0.00021218351,0.00028056387,0.00097458897,0.0008748248,0.09697404,0.0505958,0.5801238,0.26700723,0.00011366321],"about_ca_topic_score_codex":0.0019673344,"about_ca_topic_score_gemma":0.0027552983,"teacher_disagreement_score":0.03363634,"about_ca_system_score_codex":0.001455557,"about_ca_system_score_gemma":0.0034955286,"threshold_uncertainty_score":0.11252475},"labels":[],"label_agreement":null},{"id":"W2963800009","doi":"10.1145/3293611.3331574","title":"The Recoverable Consensus Hierarchy","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Computer science; Consensus; Set (abstract data type); Asynchronous communication; Theoretical computer science; Computability; Process (computing); Crash; Bounded function; Distributed computing; Multi-agent system; Mathematics; Artificial intelligence; Programming language; Computer network","score_opus":0.005280946996092166,"score_gpt":0.2022921862060712,"score_spread":0.19701123920997904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963800009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095568396,0.0015989584,0.82455784,0.0030564289,0.00017144007,0.00026021723,0.00057886355,0.0019659721,0.07224193],"genre_scores_gemma":[0.82552624,0.0010975034,0.15621321,0.0007157075,0.00022702519,0.00026223806,0.00055587874,0.00015651039,0.015245693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744403,0.00039962222,0.00015058927,0.00043608874,0.0011834308,0.00038632925],"domain_scores_gemma":[0.9966928,0.00096236326,0.00032728852,0.0008483982,0.00085247617,0.00031659784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016503432,0.00035822537,0.0005308811,0.0008923792,0.0015426178,0.0016465982,0.0014652901,0.0012519391,0.0039412733],"category_scores_gemma":[0.0058330465,0.00032008308,0.0006567536,0.00067775464,0.002487488,0.003479444,0.0028461423,0.0020684346,0.00072428136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036940113,0.00001863811,0.00025196988,0.00009374758,0.000016678327,0.00010574254,0.0004790517,0.018556641,0.0025864195,0.9534431,0.0023605004,0.022050569],"study_design_scores_gemma":[0.00005944272,0.000060865474,0.0003598973,0.000040581857,0.000023950834,0.00011152379,0.00014586617,0.10793718,0.00176962,0.8661462,0.02331647,0.00002842166],"about_ca_topic_score_codex":0.0040572463,"about_ca_topic_score_gemma":0.003147647,"teacher_disagreement_score":0.0040572463,"about_ca_system_score_codex":0.0021688722,"about_ca_system_score_gemma":0.0025222457,"threshold_uncertainty_score":0.015736401},"labels":[],"label_agreement":null},{"id":"W2963817766","doi":"","title":"Predictable Cache Coherence for Multi-Core Real-Time Systems","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MESI protocol; Cache coherence; Computer science; Predictability; Latency (audio); MESIF protocol; Multi-core processor; Coherence (philosophical gambling strategy); Parallel computing; Cache; Distributed computing; CPU cache; Cache algorithms; Mathematics","score_opus":0.13177154461146187,"score_gpt":0.22343257211195575,"score_spread":0.09166102750049387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963817766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17244205,0.0023126132,0.8196683,0.0004283619,0.000075094125,0.0000635998,0.00008457565,0.0016069588,0.0033184346],"genre_scores_gemma":[0.9504313,0.00032097552,0.04849143,0.000047223268,0.000022970533,0.000054659715,0.00006127689,0.000067926776,0.0005023017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987324,0.00034218113,0.00008501275,0.00013069487,0.00056630996,0.00014336129],"domain_scores_gemma":[0.9967539,0.001350908,0.00053970236,0.00076783734,0.0004922071,0.00009549134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112782,0.00037879567,0.00032906706,0.00050764676,0.0005063924,0.0010132446,0.0008985119,0.0003348345,0.0007860718],"category_scores_gemma":[0.005011782,0.0002798532,0.00021852693,0.0005835457,0.0006931961,0.0013316948,0.000619381,0.00085540576,0.00012113277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002519477,0.00010663885,0.0032628144,0.0002849641,0.00006590248,0.00016283464,0.00024413413,0.8255563,0.042707745,0.05086366,0.001622166,0.07487088],"study_design_scores_gemma":[0.00001749534,0.00012124939,0.00033528035,0.000011984954,0.000017953069,0.0000621077,0.00003253166,0.97227275,0.013939135,0.0114347,0.0017435179,0.000011157715],"about_ca_topic_score_codex":0.0016641264,"about_ca_topic_score_gemma":0.0032268446,"teacher_disagreement_score":0.0016641264,"about_ca_system_score_codex":0.00092494814,"about_ca_system_score_gemma":0.0015810113,"threshold_uncertainty_score":0.007463634},"labels":[],"label_agreement":null},{"id":"W2963853267","doi":"10.48550/arxiv.1705.07212","title":"Space Complexity of Fault Tolerant Register Emulations","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Server; Computer science; Emulation; Base (topology); Object (grammar); Fault tolerance; Upper and lower bounds; Register (sociolinguistics); Distributed computing; Operating system; Parallel computing; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.15881419089398563,"score_gpt":0.22961365822930876,"score_spread":0.07079946733532314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963853267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073278,0.0010059769,0.37392738,0.0024538306,0.00010246002,0.00019291264,0.0012762293,0.0021420957,0.011571275],"genre_scores_gemma":[0.954282,0.0003690908,0.041144967,0.00022078674,0.0000757634,0.00018187714,0.00059974747,0.0002322354,0.0028934898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643695,0.0011124598,0.0003050719,0.0005804165,0.00076020183,0.0008049335],"domain_scores_gemma":[0.98048383,0.013667549,0.0015248001,0.0032944542,0.000615213,0.00041402222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019955577,0.00080893224,0.0013242856,0.00074994727,0.00089732563,0.0032654838,0.0024850103,0.0012686182,0.007062254],"category_scores_gemma":[0.01797273,0.00053072773,0.0011970926,0.0011463845,0.0018750402,0.0067525683,0.0034627211,0.0016642562,0.00088888156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014086273,0.00013397887,0.0036451672,0.000420373,0.00012162184,0.00028031148,0.00037665808,0.7815077,0.010713042,0.1327461,0.0048035285,0.06384297],"study_design_scores_gemma":[0.00006470251,0.00013710235,0.00044461788,0.000035562953,0.000047137255,0.00019172,0.00014940681,0.85201585,0.006459073,0.13882749,0.0016000888,0.000027204307],"about_ca_topic_score_codex":0.001186258,"about_ca_topic_score_gemma":0.0009865452,"teacher_disagreement_score":0.007062254,"about_ca_system_score_codex":0.0020353477,"about_ca_system_score_gemma":0.0016949461,"threshold_uncertainty_score":0.023625612},"labels":[],"label_agreement":null},{"id":"W2963930234","doi":"10.1145/3212734.3212749","title":"Revisionist Simulations","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Intel Corporation; National Science Foundation","keywords":"Upper and lower bounds; Synchronization (alternating current); Computer science; Set (abstract data type); Discrete mathematics; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Topology (electrical circuits)","score_opus":0.014760672293984749,"score_gpt":0.2741786251605576,"score_spread":0.2594179528665728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963930234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18226112,0.0010570749,0.4949408,0.0063673826,0.000995239,0.0005920273,0.0046103904,0.0028308898,0.30634513],"genre_scores_gemma":[0.89094394,0.00040961176,0.07033188,0.0007154952,0.0001525075,0.00074150815,0.001393424,0.0005064767,0.034805175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982235,0.00075399486,0.00009483201,0.00029639175,0.0002934669,0.00033782277],"domain_scores_gemma":[0.98935366,0.0060911626,0.00056377175,0.002327288,0.0010312623,0.00063288765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017696999,0.0005440963,0.0011145826,0.0007531034,0.0013767357,0.0018583154,0.0022209117,0.0018840788,0.04336212],"category_scores_gemma":[0.019691141,0.00040923088,0.0011094111,0.0006503639,0.0014286117,0.0028947128,0.0025922477,0.0018385199,0.0036133293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000450909,0.000119423625,0.002104654,0.00024131413,0.00008981222,0.0002098596,0.0003501071,0.21904404,0.0008553721,0.7437875,0.0151476,0.017599413],"study_design_scores_gemma":[0.00014518607,0.000052396445,0.00027500154,0.00004726046,0.000023032557,0.00007590513,0.0001364585,0.5050657,0.0006202953,0.47915018,0.014379249,0.00002940374],"about_ca_topic_score_codex":0.0031612122,"about_ca_topic_score_gemma":0.0060323128,"teacher_disagreement_score":0.04336212,"about_ca_system_score_codex":0.0015715042,"about_ca_system_score_gemma":0.0019286859,"threshold_uncertainty_score":0.14506072},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.060894713327692196,"score_gpt":0.2741779008733097,"score_spread":0.21328318754561748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963943319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1316223,0.0006917914,0.84668493,0.001972733,0.00010676022,0.00024995097,0.00025408986,0.0010869434,0.017330592],"genre_scores_gemma":[0.84696347,0.0006273204,0.13981718,0.00064468756,0.00010811214,0.0005805025,0.00035292358,0.00026490848,0.010640867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968767,0.0011191784,0.00015799231,0.00072909053,0.0006040325,0.00051304064],"domain_scores_gemma":[0.9895761,0.007376071,0.0006423031,0.0013283502,0.00058518513,0.0004919405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027585693,0.0009380052,0.0013467701,0.0008380588,0.002095922,0.0023022548,0.0020988798,0.0017891463,0.0046837027],"category_scores_gemma":[0.013914733,0.00057310646,0.0010756083,0.0009548817,0.003721652,0.005698786,0.0057762554,0.002936839,0.00085377437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048759437,0.000121760866,0.0008745346,0.0002326318,0.00006831736,0.00029319344,0.0009847429,0.40781936,0.008665551,0.53178227,0.0041027665,0.044567276],"study_design_scores_gemma":[0.00009571727,0.00012892934,0.000116427866,0.000030973242,0.000024442177,0.0000819474,0.00014881145,0.5646426,0.0045461017,0.4270224,0.0031290837,0.000032649034],"about_ca_topic_score_codex":0.0014495917,"about_ca_topic_score_gemma":0.0016971277,"teacher_disagreement_score":0.0046837027,"about_ca_system_score_codex":0.0017381535,"about_ca_system_score_gemma":0.0019084521,"threshold_uncertainty_score":0.015668571},"labels":[],"label_agreement":null},{"id":"W2965752936","doi":"10.22215/etd/2014-10102","title":"A Client-Oriented Solution for Optimistic Replication of Cloud Services","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Replication (statistics); Consistency (knowledge bases); Commit; Eventual consistency; Bottleneck; Leverage (statistics); Consistency model; Strong consistency; Data consistency; Database; Operating system; Embedded system","score_opus":0.011015799315358473,"score_gpt":0.2759221294014787,"score_spread":0.26490633008612025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965752936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01721809,0.00068300427,0.964718,0.0014407143,0.00031982746,0.00043700996,0.000089529334,0.003458791,0.011635054],"genre_scores_gemma":[0.2908319,0.0008490511,0.68131083,0.0003902416,0.00019811517,0.0003915945,0.00024884642,0.0006260235,0.025153436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997426,0.00047319607,0.00014223812,0.00030212774,0.0013883688,0.00026801776],"domain_scores_gemma":[0.9974547,0.00028247264,0.00013055568,0.0011236131,0.0008041979,0.00020445621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027623484,0.0005952785,0.00059466495,0.0007007008,0.0017197856,0.0031009894,0.0039734985,0.001636342,0.0036635553],"category_scores_gemma":[0.0040148706,0.00075464044,0.0006084223,0.000849497,0.0007440768,0.002675934,0.0027999403,0.0032531654,0.0015977968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007894123,0.000591808,0.0018430264,0.000536104,0.00021548272,0.000800265,0.001568444,0.0801093,0.09342376,0.41163665,0.026198184,0.38228756],"study_design_scores_gemma":[0.00023844921,0.00025995157,0.0006024822,0.00012635218,0.00017227675,0.0008268771,0.00047354941,0.72489774,0.06621177,0.098455355,0.10755172,0.00018340738],"about_ca_topic_score_codex":0.0030306417,"about_ca_topic_score_gemma":0.0038318208,"teacher_disagreement_score":0.0039734985,"about_ca_system_score_codex":0.0015228587,"about_ca_system_score_gemma":0.004078227,"threshold_uncertainty_score":0.01460886},"labels":[],"label_agreement":null},{"id":"W2966516840","doi":"10.1007/978-3-031-11321-5_10","title":"The Fault-Tolerant Cluster-Sending Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scalability; Byzantine fault tolerance; Distributed computing; Fault tolerance; Cluster (spacecraft); Computer network; Database","score_opus":0.013027981996962527,"score_gpt":0.23651509434461376,"score_spread":0.22348711234765123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966516840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1610739,0.003178709,0.71512675,0.024390807,0.0012161784,0.00024913877,0.00076864654,0.0019526948,0.092043154],"genre_scores_gemma":[0.84856105,0.0024748745,0.0957747,0.0016266062,0.0014747789,0.0002921023,0.0007175218,0.00066212285,0.048416287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801934,0.00059332425,0.00008587314,0.00040878647,0.00057916157,0.00031343912],"domain_scores_gemma":[0.98926544,0.007843724,0.000532754,0.0013372261,0.0005929323,0.00042789357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025722953,0.00075725396,0.001741898,0.0010026079,0.0032819486,0.0041550756,0.0033945807,0.004352411,0.00838797],"category_scores_gemma":[0.017160779,0.0008471467,0.0007333038,0.0029213214,0.0033268994,0.0077865724,0.0030519352,0.0041526,0.0011932112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051098526,0.000119480675,0.00048702277,0.00033169176,0.000056860612,0.0002489517,0.00048708523,0.08895333,0.0017726046,0.8119982,0.035089433,0.059944384],"study_design_scores_gemma":[0.00010892319,0.000028170614,0.00017551244,0.00003367744,0.00003463895,0.00022639363,0.00018313645,0.15707578,0.0021398093,0.8314067,0.008561442,0.000025812182],"about_ca_topic_score_codex":0.0016135912,"about_ca_topic_score_gemma":0.0010235021,"teacher_disagreement_score":0.00838797,"about_ca_system_score_codex":0.0021867151,"about_ca_system_score_gemma":0.001933477,"threshold_uncertainty_score":0.028060615},"labels":[],"label_agreement":null},{"id":"W2969446929","doi":"10.1109/dsn-s.2019.00012","title":"Towards Predicting the Impact of Roll-Forward Failure Recovery for HPC Applications","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Scheme (mathematics); Reliability engineering; Point (geometry); Risk analysis (engineering); Distributed computing; Artificial intelligence; Engineering","score_opus":0.008688041940521961,"score_gpt":0.264289258437508,"score_spread":0.25560121649698603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969446929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5562072,0.0011050676,0.43799928,0.0006612127,0.00007555309,0.000101247104,0.00065751624,0.0019650836,0.0012278481],"genre_scores_gemma":[0.95700234,0.0002704284,0.04151098,0.0000397159,0.000051126197,0.000036171466,0.00037661675,0.00009875294,0.0006139001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994429,0.00016953459,0.000034276418,0.0000936125,0.00018188199,0.00007772941],"domain_scores_gemma":[0.98695785,0.009386287,0.0013243915,0.0008626013,0.0011850502,0.00028382355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021948207,0.0012392175,0.0006332389,0.0016903614,0.00026930476,0.0009793041,0.0008475181,0.0016200845,0.0010495286],"category_scores_gemma":[0.017846908,0.00036687782,0.00046396197,0.00079245795,0.0006916957,0.001728946,0.00074945105,0.0014135776,0.00035465098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015652816,0.0000806159,0.012095894,0.000056191875,0.00003401884,0.000034099587,0.000021668817,0.9665187,0.0031176193,0.0006039059,0.00031333094,0.016967557],"study_design_scores_gemma":[0.000001960634,0.000023701705,0.0014644006,0.0000040488517,0.0000043809096,0.000007756092,0.0000075137564,0.99614775,0.0012153595,0.0010644764,0.00005499744,0.0000036969811],"about_ca_topic_score_codex":0.0044536367,"about_ca_topic_score_gemma":0.0030293337,"teacher_disagreement_score":0.0044536367,"about_ca_system_score_codex":0.0005634742,"about_ca_system_score_gemma":0.0006802055,"threshold_uncertainty_score":0.011607468},"labels":[],"label_agreement":null},{"id":"W2970367809","doi":"10.48550/arxiv.1908.10826","title":"Strongly Linearizable Implementations of Snapshots and Other Types","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Computer science; Correctness; Bounded function; Atomicity; Implementation; Theoretical computer science; Algorithm; Parallel computing; Mathematics; Programming language","score_opus":0.06657815158923644,"score_gpt":0.21178545159157025,"score_spread":0.1452073000023338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970367809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013764408,0.00012928627,0.97895414,0.0003094969,0.00006530449,0.00010113883,0.00012133558,0.002941996,0.0036129358],"genre_scores_gemma":[0.43254054,0.00029511718,0.54885095,0.0008908775,0.00021071499,0.00067444454,0.00044687968,0.0010260169,0.015064555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596906,0.00063168956,0.0004908859,0.00088830164,0.0014836758,0.000536357],"domain_scores_gemma":[0.9882117,0.0038029088,0.0014396608,0.0049782726,0.0013254015,0.00024206645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020610068,0.0007578315,0.0005660469,0.00067054696,0.00067337917,0.0030475957,0.0028190596,0.0012756337,0.0073887846],"category_scores_gemma":[0.010188193,0.0007401003,0.0010811017,0.0010172189,0.0036860888,0.007231771,0.0028425853,0.0038469965,0.001635251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037879622,0.00012745048,0.001665812,0.00029955333,0.000042718904,0.00021716226,0.0006143221,0.013684228,0.013632288,0.88788134,0.0030187713,0.07843756],"study_design_scores_gemma":[0.00015605526,0.00040332467,0.0004560147,0.00012980196,0.00012436307,0.000496354,0.00020338659,0.13480967,0.11149434,0.7173312,0.034278262,0.000117246396],"about_ca_topic_score_codex":0.00070427306,"about_ca_topic_score_gemma":0.00064208,"teacher_disagreement_score":0.0073887846,"about_ca_system_score_codex":0.0012640884,"about_ca_system_score_gemma":0.0014549168,"threshold_uncertainty_score":0.024717927},"labels":[],"label_agreement":null},{"id":"W2970698689","doi":"10.4230/lipics.concur.2019.31","title":"Expressive Power of Broadcast Consensus Protocols","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Unary operation; Computer science; Class (philosophy); Population; Theoretical computer science; Decidability; Protocol (science); Atomic broadcast; Expressive power; Computation; Power (physics); Distributed computing; Discrete mathematics; Broadcasting (networking); Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.01223587976930665,"score_gpt":0.26594943568258356,"score_spread":0.25371355591327693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970698689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13416809,0.0012728216,0.7839149,0.0054485793,0.00016781941,0.00018376806,0.0007634814,0.001083274,0.07299715],"genre_scores_gemma":[0.93846256,0.0006606192,0.050770625,0.00054719066,0.00021900958,0.00045558802,0.00046484935,0.00017516139,0.00824436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936498,0.0022118734,0.00043103757,0.0009725891,0.002279595,0.00045505332],"domain_scores_gemma":[0.9885222,0.008118692,0.0005693794,0.0017554167,0.00067129865,0.0003630337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895981,0.0005231176,0.000855112,0.0008229343,0.0010659305,0.004061879,0.0019163414,0.0012071293,0.002708548],"category_scores_gemma":[0.016135173,0.0006383203,0.0011404,0.0010173818,0.0041577066,0.0072822664,0.00527736,0.0039742608,0.0003809435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001295855,0.000036058078,0.0003101121,0.00012510712,0.000027321988,0.00015890585,0.0009855437,0.021367295,0.0042981966,0.9602935,0.0011000942,0.0111683775],"study_design_scores_gemma":[0.00007468844,0.000031428768,0.00009668297,0.000039069113,0.000030549607,0.00009564529,0.00012842537,0.09154295,0.0028582595,0.89748025,0.007606257,0.000015780486],"about_ca_topic_score_codex":0.0008665398,"about_ca_topic_score_gemma":0.0004635449,"teacher_disagreement_score":0.004895981,"about_ca_system_score_codex":0.0015845448,"about_ca_system_score_gemma":0.0010618722,"threshold_uncertainty_score":0.025892735},"labels":[],"label_agreement":null},{"id":"W2970882829","doi":"10.14778/3352063.3352146","title":"PNUTS to Sherpa","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Computer science; Operating system","score_opus":0.0041628378496365685,"score_gpt":0.19134434637664263,"score_spread":0.18718150852700607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970882829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03324667,0.009089656,0.40900347,0.08236482,0.013271174,0.00033644197,0.0026968636,0.0631459,0.386845],"genre_scores_gemma":[0.25394446,0.0101842,0.2619002,0.032340966,0.006458567,0.0006386358,0.0064016557,0.022710182,0.40542117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971318,0.0006418346,0.000118820906,0.0005570102,0.0011249463,0.00042553636],"domain_scores_gemma":[0.9946571,0.001029089,0.00023659613,0.002274211,0.0011442014,0.00065880286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029301094,0.0006312766,0.00044795012,0.0011016657,0.001650714,0.0041634063,0.0024644134,0.001291406,0.057156738],"category_scores_gemma":[0.010300068,0.0006193373,0.0006014323,0.0019123371,0.0025904435,0.009544611,0.006048755,0.004476679,0.019108078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004807139,0.00009761948,0.001266678,0.00027446027,0.000029237675,0.00026157644,0.0006558964,0.0024321154,0.002253409,0.32139426,0.3343387,0.3365153],"study_design_scores_gemma":[0.00005343618,0.000059290374,0.00038460476,0.00010833593,0.000013703849,0.00022322565,0.0002575091,0.004513705,0.0019415313,0.038036797,0.9543762,0.000031731826],"about_ca_topic_score_codex":0.0112444125,"about_ca_topic_score_gemma":0.007442125,"teacher_disagreement_score":0.057156738,"about_ca_system_score_codex":0.002071631,"about_ca_system_score_gemma":0.0033249413,"threshold_uncertainty_score":0.19120836},"labels":[],"label_agreement":null},{"id":"W2970956651","doi":"10.14778/3342263.3342627","title":"Ocean vista","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Computer network; Distributed computing; Gossip; Latency (audio); Concurrency control; Distributed transaction; Serializability; Transaction processing; Replication (statistics); Asynchronous communication; Database transaction; Database; Telecommunications","score_opus":0.004017234516262306,"score_gpt":0.1842977793246883,"score_spread":0.18028054480842598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970956651","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03573363,0.0034736102,0.20812142,0.002677773,0.0020775145,0.001014616,0.012393084,0.2254609,0.50904745],"genre_scores_gemma":[0.27276334,0.0030612773,0.24938487,0.0018941647,0.00055427046,0.0012435861,0.04653596,0.027585134,0.3969774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991315,0.00010232338,0.000058854097,0.00018790092,0.00037446333,0.00014493447],"domain_scores_gemma":[0.9983541,0.00022314569,0.00012388166,0.00063006446,0.000409912,0.00025894464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009868338,0.0009067277,0.000733367,0.0011392349,0.00089168857,0.0028790243,0.0021082517,0.001162426,0.09179307],"category_scores_gemma":[0.0030124807,0.0006930445,0.00058921304,0.0011748329,0.0007637532,0.003783926,0.0039130147,0.0017944222,0.041170564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033094604,0.0002714144,0.005665063,0.0012892159,0.00016870239,0.00073729904,0.0007097545,0.009979264,0.053193223,0.06308549,0.4180267,0.44356447],"study_design_scores_gemma":[0.0003583906,0.00029653526,0.0015425122,0.00016065415,0.000057028883,0.00047502207,0.00016337437,0.036845364,0.014606983,0.013791334,0.93162173,0.000081116326],"about_ca_topic_score_codex":0.0042229868,"about_ca_topic_score_gemma":0.0040454734,"teacher_disagreement_score":0.09179307,"about_ca_system_score_codex":0.0009861407,"about_ca_system_score_gemma":0.001985956,"threshold_uncertainty_score":0.30707836},"labels":[],"label_agreement":null},{"id":"W2971627429","doi":"10.1007/s00446-019-00361-3","title":"A complexity-based classification for multiprocessor synchronization","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Computer science; Computability; Theory of computation; Hierarchy; Synchronization (alternating current); Multiprocessing; Theoretical computer science; Parallel computing; Programming language","score_opus":0.03210111754726115,"score_gpt":0.27591656205991083,"score_spread":0.2438154445126497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971627429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078533575,0.0034992036,0.88471955,0.002415643,0.00070336374,0.0003555362,0.0008198583,0.0010964914,0.027856745],"genre_scores_gemma":[0.6819996,0.0031667051,0.29075193,0.0005670101,0.0021952223,0.00049320114,0.0035300646,0.0005919248,0.01670429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974158,0.0002814686,0.00029414616,0.00040202387,0.0012572972,0.00034932618],"domain_scores_gemma":[0.98934865,0.0043831775,0.0012807052,0.0021443022,0.0020524696,0.0007906395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014674175,0.0011630107,0.0011565302,0.0056540077,0.0016596201,0.0043168063,0.0021906213,0.001696756,0.006388889],"category_scores_gemma":[0.012160234,0.00044832885,0.001962558,0.004015557,0.0021320537,0.0072043524,0.003521077,0.002901982,0.0017298327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004290485,0.00021661201,0.010900692,0.00052920904,0.00009424226,0.00033400758,0.0006591558,0.052813593,0.0136065595,0.6635479,0.017603407,0.2392656],"study_design_scores_gemma":[0.00006275659,0.00029493292,0.0067589097,0.0001197923,0.00008596603,0.0008090624,0.00028836966,0.39948162,0.004698737,0.56258464,0.024709402,0.000105828505],"about_ca_topic_score_codex":0.0013635372,"about_ca_topic_score_gemma":0.0009733513,"teacher_disagreement_score":0.006388889,"about_ca_system_score_codex":0.0019417197,"about_ca_system_score_gemma":0.0013852997,"threshold_uncertainty_score":0.021373034},"labels":[],"label_agreement":null},{"id":"W2971939654","doi":"10.1109/ipdps.2019.00094","title":"Network Size Estimation in Small-World Networks Under Byzantine Faults","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fraction (chemistry); Node (physics); Constant (computer programming); Expander graph; Computer science; Distributed algorithm; Binary logarithm; Upper and lower bounds; Computation; Randomized algorithm; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Distributed computing","score_opus":0.010352321932888289,"score_gpt":0.22561629329898225,"score_spread":0.21526397136609396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971939654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20082915,0.00050425035,0.79495555,0.00092692254,0.000050020484,0.00008792736,0.00022379648,0.0008429968,0.001579248],"genre_scores_gemma":[0.89613616,0.00039161587,0.1014212,0.000106044536,0.0001294365,0.00015097589,0.00028342585,0.00010237064,0.0012787522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977465,0.00077292114,0.000085699154,0.0006444036,0.00051702774,0.00023330173],"domain_scores_gemma":[0.95086384,0.037251126,0.0061931913,0.00344015,0.0016569564,0.00059475895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684115,0.0008127642,0.0012904727,0.0015194091,0.0008205699,0.0016011373,0.002320432,0.0015856713,0.0007780571],"category_scores_gemma":[0.034561984,0.0006127511,0.00047988395,0.0010473117,0.002583949,0.006280878,0.001807758,0.0015390202,0.00018130292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035745933,0.000050322593,0.0061651035,0.00021044914,0.00007292813,0.00032593447,0.0004196628,0.90516526,0.010359436,0.04134997,0.001195279,0.034328237],"study_design_scores_gemma":[0.000015100417,0.000036035337,0.0008191803,0.00001333169,0.000010647211,0.00009375888,0.000057211044,0.9697233,0.0036119015,0.025055181,0.0005514335,0.000012854066],"about_ca_topic_score_codex":0.0019049086,"about_ca_topic_score_gemma":0.0015468819,"teacher_disagreement_score":0.002684115,"about_ca_system_score_codex":0.0016746416,"about_ca_system_score_gemma":0.00069990294,"threshold_uncertainty_score":0.014195144},"labels":[],"label_agreement":null},{"id":"W2974488648","doi":"10.1016/j.tcs.2019.09.020","title":"Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Parallel computing; Clock synchronization; Channel (broadcasting); Real-time computing; Task (project management); Computer network","score_opus":0.015206644522195873,"score_gpt":0.2740966418056096,"score_spread":0.2588899972834137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974488648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34624237,0.0002455984,0.6487606,0.00031183148,0.00013644362,0.00006265417,0.00004847684,0.0006347487,0.0035572203],"genre_scores_gemma":[0.976096,0.00006801287,0.021975832,0.00003692492,0.000015379408,0.000032612897,0.000016173342,0.00002602665,0.0017330059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995054,0.00014803925,0.000028387207,0.00010062028,0.00012696037,0.00009057212],"domain_scores_gemma":[0.99806803,0.0010931675,0.0001657613,0.00030734795,0.00023724792,0.00012849981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006493707,0.00035947884,0.00083487114,0.00042488764,0.0009626371,0.00088758505,0.0009317993,0.00096701545,0.0014032766],"category_scores_gemma":[0.0032055,0.00028891533,0.00028649168,0.00055744586,0.0009301995,0.0014000022,0.0012697642,0.00087379635,0.00018012228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013116206,0.00013843113,0.0017252365,0.00012194121,0.00009344503,0.00076635473,0.0004569367,0.80817366,0.05102879,0.08824274,0.0013751717,0.046565715],"study_design_scores_gemma":[0.00003451403,0.00006339982,0.00014260145,0.000003222719,0.000008554846,0.000028991251,0.000022962528,0.98738074,0.002641162,0.0094252825,0.00023782633,0.000010826681],"about_ca_topic_score_codex":0.00203621,"about_ca_topic_score_gemma":0.0019571371,"teacher_disagreement_score":0.00203621,"about_ca_system_score_codex":0.0004848389,"about_ca_system_score_gemma":0.00061056495,"threshold_uncertainty_score":0.004694402},"labels":[],"label_agreement":null},{"id":"W2974701520","doi":"10.48550/arxiv.1909.10378","title":"Decentralized Connectivity Control in Quadcopters: a Field Study of Communication Performance","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Exploit; Computer science; Distributed computing; Redundancy (engineering); Implementation; Algebraic connectivity; Field (mathematics); Graph; Decentralised system; Software; Control (management); Theoretical computer science; Artificial intelligence; Software engineering; Computer security","score_opus":0.04696610337282059,"score_gpt":0.19994381644840534,"score_spread":0.15297771307558475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974701520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8245753,0.0012021338,0.16122177,0.00083884934,0.000047186015,0.00007200459,0.000062360436,0.00021147061,0.011769042],"genre_scores_gemma":[0.9953485,0.00017867418,0.003938889,0.000024838067,0.000020424884,0.000017672017,0.000017232036,0.000014471111,0.00043939785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9995696,0.00014660148,0.00001181044,0.000090016554,0.000120368306,0.00006163351],"domain_scores_gemma":[0.9957164,0.0026476043,0.0005509447,0.00051907473,0.00042992033,0.0001359828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095309666,0.00028826657,0.00040923865,0.00046635902,0.00028503436,0.0004513664,0.0005768772,0.00054301554,0.0010572482],"category_scores_gemma":[0.006014031,0.00012671396,0.00020264601,0.00039541684,0.000832814,0.0011194417,0.0005968118,0.0007953838,0.0001146713],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031191093,0.00031926046,0.003651043,0.00017592876,0.00007315459,0.00012254837,0.00036830333,0.82747555,0.028769007,0.075323075,0.0024584683,0.06095175],"study_design_scores_gemma":[0.000031034222,0.00036891783,0.0017584339,0.000014440348,0.000012686546,0.000052729705,0.000067263165,0.974794,0.004442993,0.017546775,0.0008941812,0.000016635995],"about_ca_topic_score_codex":0.0007773819,"about_ca_topic_score_gemma":0.00034064997,"teacher_disagreement_score":0.0010572482,"about_ca_system_score_codex":0.0006021383,"about_ca_system_score_gemma":0.00024649076,"threshold_uncertainty_score":0.0050405264},"labels":[],"label_agreement":null},{"id":"W2977451371","doi":"","title":"Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Queue; Priority queue; Graph; Algorithm; Theoretical computer science; Computer network; Computer security","score_opus":0.022592455842327188,"score_gpt":0.17403201947294328,"score_spread":0.1514395636306161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977451371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014197328,0.0008117616,0.96598065,0.0009812304,0.00044227098,0.00026266233,0.00047869305,0.008482634,0.008362675],"genre_scores_gemma":[0.2967335,0.0010277146,0.6762971,0.0014619242,0.00058339466,0.0005986316,0.0010006157,0.0034613498,0.018835729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937365,0.0013540557,0.0004268007,0.0010004363,0.0016399989,0.001842148],"domain_scores_gemma":[0.98785233,0.0034018003,0.0007533557,0.005368227,0.0019017085,0.0007225244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049266233,0.0023768344,0.0023278776,0.0023339863,0.0029347953,0.007945301,0.009362477,0.0023554382,0.015343397],"category_scores_gemma":[0.016135778,0.0015032621,0.0020231872,0.0052460977,0.0033640887,0.014434455,0.0060421987,0.00579244,0.0046636704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002113971,0.0009899567,0.0012970411,0.00072127994,0.00018724967,0.00019410982,0.0005137268,0.12393338,0.009877104,0.66405696,0.042516157,0.15359913],"study_design_scores_gemma":[0.00025463366,0.00021742428,0.00013750953,0.00007501474,0.0001499692,0.0001093277,0.00007508432,0.6041521,0.0098109385,0.36758703,0.017320074,0.000110903726],"about_ca_topic_score_codex":0.011942132,"about_ca_topic_score_gemma":0.013337786,"teacher_disagreement_score":0.015343397,"about_ca_system_score_codex":0.0075285025,"about_ca_system_score_gemma":0.011405385,"threshold_uncertainty_score":0.054623365},"labels":[],"label_agreement":null},{"id":"W2980232248","doi":"10.1145/3360582","title":"DProf: distributed profiler with strong guarantees","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Timestamp; Computer science; Bottleneck; Synchronization (alternating current); Distributed computing; Context (archaeology); Parallel computing; Real-time computing; Algorithm; Embedded system","score_opus":0.008038752805000207,"score_gpt":0.23542261593204922,"score_spread":0.227383863127049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980232248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075308043,0.00011627099,0.96270514,0.00019057287,0.000045379307,0.000169167,0.00037441074,0.027604794,0.0012635669],"genre_scores_gemma":[0.41633302,0.00025981842,0.57306373,0.00038119973,0.00015687237,0.0006991625,0.0016786373,0.0036586327,0.003768903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98944175,0.002075784,0.0011869207,0.0016818317,0.0047692903,0.00084431784],"domain_scores_gemma":[0.9814866,0.0047081416,0.0019310659,0.008252989,0.0029029981,0.00071822596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007939357,0.001429335,0.0016036289,0.00161495,0.0011703762,0.0035983627,0.0049051335,0.0015881389,0.0032232718],"category_scores_gemma":[0.026706891,0.0016110804,0.00097005273,0.0012831405,0.0014622756,0.0065879025,0.006342374,0.0041840477,0.0023526554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028851146,0.0004775429,0.009560112,0.0006504755,0.00023224803,0.0007586075,0.0013043213,0.2045632,0.037337393,0.14320949,0.044345368,0.5546761],"study_design_scores_gemma":[0.0002510433,0.00023240196,0.00074286474,0.000043081607,0.00004583547,0.0003087847,0.000091836184,0.8999022,0.025118936,0.050790396,0.022374298,0.000098278295],"about_ca_topic_score_codex":0.003195612,"about_ca_topic_score_gemma":0.0020592306,"teacher_disagreement_score":0.007939357,"about_ca_system_score_codex":0.0015182868,"about_ca_system_score_gemma":0.0037220726,"threshold_uncertainty_score":0.041987836},"labels":[],"label_agreement":null},{"id":"W298519903","doi":"10.1006/jagm.2000.1147","title":"Fault-Tolerant Broadcasting in Radio Networks","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Broadcasting (networking); Node (physics); Computer network; Upper and lower bounds; RADIUS; Situated; Range (aeronautics); Fault tolerance; Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Combinatorics; Physics","score_opus":0.014003932048168658,"score_gpt":0.24600307803705548,"score_spread":0.23199914598888682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298519903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088343084,0.0035195544,0.8934932,0.002257926,0.00039674193,0.00006942066,0.00007374387,0.00093226635,0.010914031],"genre_scores_gemma":[0.8899026,0.0023358597,0.09561289,0.00031537504,0.00042369685,0.00013319986,0.00016029018,0.00015570075,0.010960298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985436,0.00049322867,0.00009066229,0.00018598579,0.00045541412,0.00023106343],"domain_scores_gemma":[0.99156976,0.0061882623,0.0005847915,0.00068270793,0.0007189742,0.00025552986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016572602,0.00042159922,0.0012802382,0.0013498463,0.0014973248,0.0024488706,0.0019489652,0.0015642003,0.0030251674],"category_scores_gemma":[0.0125626,0.00052277267,0.00035324626,0.0018159039,0.0017707606,0.00377515,0.0015782665,0.0012988026,0.00049615296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009909318,0.0001831251,0.001816639,0.0004270079,0.00010660791,0.00027155972,0.0008192498,0.40760407,0.007862069,0.3828457,0.009384664,0.18768847],"study_design_scores_gemma":[0.00013523658,0.00010851311,0.00028007763,0.00002732022,0.00005698972,0.00022127027,0.00014762061,0.7331821,0.0035356327,0.25675294,0.005529062,0.000023396342],"about_ca_topic_score_codex":0.0020019114,"about_ca_topic_score_gemma":0.0015922951,"teacher_disagreement_score":0.0030251674,"about_ca_system_score_codex":0.001482695,"about_ca_system_score_gemma":0.00082275155,"threshold_uncertainty_score":0.010757744},"labels":[],"label_agreement":null},{"id":"W2985470207","doi":"10.1007/s00446-019-00364-0","title":"Recoverable mutual exclusion","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Semaphore; Mutual exclusion; Critical section; Liveness; Computer science; Lock (firearm); Process (computing); Copycat; Reboot; Distributed computing; Operating system; Engineering","score_opus":0.007466612976992102,"score_gpt":0.22188916391477162,"score_spread":0.2144225509377795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985470207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035634365,0.0015021296,0.8284402,0.0021337403,0.00090588705,0.00034485298,0.0006598368,0.006467965,0.123911135],"genre_scores_gemma":[0.7651868,0.0011331877,0.13475174,0.00082691316,0.0005079585,0.00038989398,0.0016706736,0.00085779506,0.09467502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981785,0.00034078056,0.00007670682,0.00031089646,0.0007680978,0.00032499278],"domain_scores_gemma":[0.9971469,0.0007111801,0.00022657661,0.0013114491,0.00045187384,0.00015207341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785119,0.0006368649,0.00073902623,0.0007813538,0.0018421182,0.0019103277,0.0017140182,0.0010960104,0.015392143],"category_scores_gemma":[0.0047356253,0.00030563495,0.000531978,0.0008178646,0.0013577247,0.0026517299,0.0033092506,0.0021912928,0.0033784537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005778627,0.00018470256,0.00044024456,0.0002575895,0.000049429927,0.0003421047,0.0003973017,0.031623226,0.013717998,0.7445378,0.030494705,0.17737707],"study_design_scores_gemma":[0.00011025015,0.00016082339,0.00038927558,0.00007295643,0.00005697751,0.00048133434,0.00014730943,0.17136888,0.023117889,0.6968248,0.107207246,0.00006232473],"about_ca_topic_score_codex":0.00089481345,"about_ca_topic_score_gemma":0.0012713489,"teacher_disagreement_score":0.015392143,"about_ca_system_score_codex":0.00082215795,"about_ca_system_score_gemma":0.0015247827,"threshold_uncertainty_score":0.051491857},"labels":[],"label_agreement":null},{"id":"W2986867269","doi":"10.48550/arxiv.1911.01075","title":"Adapting a Container Infrastructure for Autonomous Vehicle Development","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Container (type theory); Computer science; Scalability; Process (computing); Cloud computing; Distributed computing; Operating system; Engineering","score_opus":0.04582536940010904,"score_gpt":0.1822642049698085,"score_spread":0.13643883556969946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986867269","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36656216,0.00035916528,0.59716123,0.000838707,0.00027181712,0.0006848827,0.00020382059,0.020077165,0.013841122],"genre_scores_gemma":[0.65219235,0.00020188381,0.3426836,0.00011835495,0.000021123724,0.00025598423,0.0004126178,0.0016102337,0.0025036635],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998792,0.00023966556,0.00009258904,0.0002191709,0.00033994156,0.00031669452],"domain_scores_gemma":[0.9964079,0.0007315866,0.00034453277,0.0013904122,0.00072826864,0.0003972005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960505,0.0005205192,0.00028781782,0.0006575562,0.000558542,0.0013932833,0.0017811466,0.00066064356,0.0019674927],"category_scores_gemma":[0.0063086734,0.0006182813,0.00042746656,0.0004792794,0.00078169967,0.0026146614,0.0026865336,0.0013232286,0.0008803697],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001175497,0.00085292145,0.03731634,0.0006095479,0.00015526559,0.0025692827,0.0026815147,0.21811041,0.2631213,0.048914697,0.018974686,0.40551847],"study_design_scores_gemma":[0.00022711843,0.0013306498,0.012002248,0.00018398665,0.0001594218,0.0012683285,0.001354371,0.65973264,0.19366954,0.014186398,0.11565473,0.00023052943],"about_ca_topic_score_codex":0.0030764898,"about_ca_topic_score_gemma":0.0022541208,"teacher_disagreement_score":0.0030764898,"about_ca_system_score_codex":0.0012078373,"about_ca_system_score_gemma":0.0019493641,"threshold_uncertainty_score":0.010368228},"labels":[],"label_agreement":null},{"id":"W2989796728","doi":"10.4230/lipics.opodis.2019.16","title":"Byzantine-Tolerant Set-Constrained Delivery Broadcast","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Set (abstract data type); Object (grammar); Mathematics; Discrete mathematics; Combinatorics; Task (project management); Computer science; Artificial intelligence","score_opus":0.030149361340502206,"score_gpt":0.26389688453854215,"score_spread":0.23374752319803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989796728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251684,0.0008104509,0.86196154,0.0017605027,0.00040273546,0.00051923667,0.0013012293,0.0061184503,0.024608985],"genre_scores_gemma":[0.784676,0.00044117923,0.18481898,0.0009585847,0.00018173773,0.00053643837,0.0016902463,0.0006705236,0.026026282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675435,0.00066295697,0.00025112607,0.0007971303,0.00095131947,0.00058313104],"domain_scores_gemma":[0.9935441,0.0023813262,0.0005979974,0.002340875,0.0008537349,0.00028197764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021920677,0.00089228735,0.0015946021,0.0006989074,0.0017962313,0.0026233029,0.0027395359,0.0014299613,0.0075236517],"category_scores_gemma":[0.007831935,0.0005590735,0.0011673054,0.0010503052,0.0014349418,0.005385094,0.005122995,0.002598114,0.0017387543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027283977,0.00033489338,0.002318342,0.0015609757,0.0002609767,0.00093236606,0.0031283696,0.22530034,0.052331638,0.51117504,0.031861037,0.1680676],"study_design_scores_gemma":[0.0002648479,0.0003139061,0.0006107368,0.000111987094,0.00013926974,0.00041416564,0.00054644194,0.66751796,0.02619248,0.2624303,0.04135388,0.00010399178],"about_ca_topic_score_codex":0.0033059353,"about_ca_topic_score_gemma":0.0044365632,"teacher_disagreement_score":0.0075236517,"about_ca_system_score_codex":0.0028525274,"about_ca_system_score_gemma":0.0024813688,"threshold_uncertainty_score":0.025169134},"labels":[],"label_agreement":null},{"id":"W2992822542","doi":"10.1145/3359989.3365437","title":"Sift","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Backup; Remote direct memory access; Protocol (science); Replication (statistics); Software deployment; Distributed computing; Computer network; Operating system","score_opus":0.0034169515463901377,"score_gpt":0.1890983821717576,"score_spread":0.18568143062536746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992822542","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031604327,0.0010476749,0.8921886,0.0004248507,0.0006480733,0.00074801827,0.0016386712,0.026979143,0.044720653],"genre_scores_gemma":[0.62412494,0.001007714,0.31857494,0.0006163593,0.00029364575,0.0007249872,0.006145052,0.0010623462,0.047450036],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941516,0.00007390802,0.000058657733,0.000103964936,0.00026213942,0.00008630578],"domain_scores_gemma":[0.99939334,0.00010429017,0.00006619951,0.00022988814,0.00016357434,0.000042685486],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005040166,0.0003433548,0.0004309946,0.000710962,0.00053377426,0.00076654734,0.00090831186,0.00054700905,0.009344746],"category_scores_gemma":[0.0012013265,0.0002032804,0.00039593413,0.00047674828,0.00045113018,0.0011993181,0.0014181101,0.0005630766,0.0027828405],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011219211,0.00018878024,0.0021755907,0.0009301594,0.0001942163,0.00060155976,0.0003841257,0.043011133,0.0837185,0.11987821,0.13235344,0.61544234],"study_design_scores_gemma":[0.0005533389,0.001094905,0.0019751322,0.000118844284,0.00021836892,0.0015719878,0.00022966744,0.39371857,0.107351646,0.05572105,0.4372626,0.00018394136],"about_ca_topic_score_codex":0.0014280534,"about_ca_topic_score_gemma":0.002018109,"teacher_disagreement_score":0.99065524,"about_ca_system_score_codex":0.0006291032,"about_ca_system_score_gemma":0.001067681,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.00815648363780745,"score_gpt":0.2676606539177327,"score_spread":0.25950417027992523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996703997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027476832,0.004463881,0.89512974,0.007268141,0.0004586874,0.000081331185,0.00014336607,0.00082891574,0.064149074],"genre_scores_gemma":[0.7777974,0.002489914,0.19735605,0.0026056697,0.00069091,0.00021678253,0.00015272293,0.00035022062,0.01834029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753404,0.0008442309,0.000094074785,0.00045123673,0.0007073709,0.00036894626],"domain_scores_gemma":[0.99725324,0.0015037378,0.00024249627,0.0004655815,0.00036718935,0.00016768594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388313,0.00040531115,0.00043608947,0.0011669196,0.0022354438,0.0030977523,0.0012522956,0.0014670136,0.0027917323],"category_scores_gemma":[0.0044278186,0.00044134507,0.00080592575,0.0012109563,0.0086738495,0.010121532,0.0025888225,0.0058200727,0.00042093382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016796035,0.000005556776,0.00011140155,0.000016366777,0.0000036123404,0.000036270547,0.0003111892,0.00074550445,0.00018980083,0.992201,0.00051168114,0.0058507756],"study_design_scores_gemma":[0.00002050071,0.000024813125,0.00010204689,0.000033448734,0.000015230534,0.00006798832,0.00015076231,0.0068934984,0.001029904,0.9670475,0.024595665,0.000018660521],"about_ca_topic_score_codex":0.0039278353,"about_ca_topic_score_gemma":0.0026227816,"teacher_disagreement_score":0.0039278353,"about_ca_system_score_codex":0.0024201665,"about_ca_system_score_gemma":0.0019684713,"threshold_uncertainty_score":0.017919362},"labels":[],"label_agreement":null},{"id":"W2996890275","doi":"10.2514/6.2020-1126","title":"2020 Update on AFRL EXPEDITE Program Progress by Lockheed Martin","year":2020,"lang":"en","type":"article","venue":"AIAA Scitech 2020 Forum","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Systems engineering; Airframe; Key (lock); Multidisciplinary approach; Computer science; Engineering management; IBM; Work (physics); Engineering; Aerospace engineering","score_opus":0.007440686855302806,"score_gpt":0.2420549931207259,"score_spread":0.2346143062654231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996890275","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013353139,0.038274236,0.053185806,0.098220795,0.07375073,0.0019425382,0.03136365,0.021808576,0.66810054],"genre_scores_gemma":[0.055628777,0.03586957,0.11501299,0.0140501615,0.009770079,0.0017656538,0.057467356,0.006559186,0.70387626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9889648,0.0009930034,0.0003074078,0.0003714789,0.008608057,0.0007553683],"domain_scores_gemma":[0.9775342,0.0018432868,0.0008670235,0.0013012202,0.016407477,0.0020468975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02028106,0.0014147257,0.000634793,0.005429806,0.0015623865,0.005288955,0.0022832658,0.002800276,0.045582294],"category_scores_gemma":[0.021477075,0.00052530464,0.0006503239,0.0025877391,0.00070042367,0.0037381344,0.0030048843,0.0031260636,0.030191857],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014006808,0.00015760222,0.0006112586,0.0002715096,0.000008901302,0.000056374076,0.000112749825,0.0011493898,0.0011785115,0.005722418,0.8081225,0.18246876],"study_design_scores_gemma":[0.000010258233,0.000047238118,0.00038222308,0.00011614444,0.0000029824162,0.000016509806,0.0000322783,0.00017757928,0.00037485038,0.00029221637,0.99854076,0.00000704098],"about_ca_topic_score_codex":0.022091739,"about_ca_topic_score_gemma":0.025063872,"teacher_disagreement_score":0.045582294,"about_ca_system_score_codex":0.0051487065,"about_ca_system_score_gemma":0.0149324685,"threshold_uncertainty_score":0.152488},"labels":[],"label_agreement":null},{"id":"W2996936519","doi":"10.2514/6.2020-1389","title":"Application of ModelCenter to Real World Distributed and Parallel Execution Challenges","year":2020,"lang":"en","type":"article","venue":"AIAA Scitech 2020 Forum","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Workflow; Distributed computing; Context (archaeology); Node (physics); Automation; Load balancing (electrical power); Execution time; Parallel computing; Database; Grid","score_opus":0.01785750184209741,"score_gpt":0.24579057309139107,"score_spread":0.22793307124929366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996936519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18920647,0.00038682585,0.78029585,0.004236067,0.00041784171,0.00028121306,0.00030057802,0.006801565,0.018073637],"genre_scores_gemma":[0.73099947,0.0002586794,0.26410297,0.0003049103,0.00006355564,0.00011534855,0.00032577483,0.0006548532,0.003174461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849796,0.0005328555,0.000063864616,0.00025642087,0.0004893549,0.00015947095],"domain_scores_gemma":[0.9961832,0.0020200247,0.00019609806,0.00085740176,0.00052769994,0.00021557728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597363,0.0005761978,0.0005008371,0.0006163812,0.001154047,0.0025923501,0.0015051801,0.001224862,0.002283014],"category_scores_gemma":[0.0074252477,0.00041940334,0.0006180203,0.0007151932,0.0013066927,0.0017204137,0.0015875539,0.0017615083,0.00037392235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034671582,0.00038339314,0.0063124057,0.00024263297,0.00009492206,0.00066141994,0.00088208215,0.7309118,0.0153950015,0.1390565,0.0123540955,0.0933591],"study_design_scores_gemma":[0.00003591561,0.000049998132,0.00040209008,0.0000135566925,0.000009761652,0.00007521982,0.00011082873,0.9603658,0.0043461197,0.023462001,0.011112115,0.000016533264],"about_ca_topic_score_codex":0.009107197,"about_ca_topic_score_gemma":0.009616003,"teacher_disagreement_score":0.009107197,"about_ca_system_score_codex":0.0027595297,"about_ca_system_score_gemma":0.002651,"threshold_uncertainty_score":0.020021915},"labels":[],"label_agreement":null},{"id":"W2999611374","doi":"10.1145/3245048","title":"Session details: Shared memory I","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Session (web analytics); Computer science; Multimedia; World Wide Web","score_opus":0.022274511148889387,"score_gpt":0.25757426861065885,"score_spread":0.23529975746176945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999611374","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022223957,0.002428963,0.0040036463,0.008245548,0.021747772,0.0012850739,0.022908757,0.0063259983,0.93083185],"genre_scores_gemma":[0.009640283,0.0012967758,0.00076366443,0.0011113446,0.0024759748,0.0003374599,0.007769372,0.0008258056,0.97577924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993025,0.0000956065,0.000035684134,0.00020878993,0.0001733204,0.00018399379],"domain_scores_gemma":[0.99725974,0.00057853374,0.0000683505,0.00060281175,0.00040933324,0.0010812042],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011448216,0.0015043712,0.0027315267,0.0007010418,0.0023811632,0.0046151215,0.0023398218,0.0041744327,0.93573076],"category_scores_gemma":[0.00381598,0.00038422816,0.001527072,0.0011873211,0.0005628314,0.0019025202,0.0027460258,0.002409934,0.8704931],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008469396,0.00025793264,0.000184083,0.00035253094,0.000023268683,0.0000808699,0.00004047405,0.000112645896,0.0016746689,0.001653672,0.9275054,0.067267515],"study_design_scores_gemma":[0.00023968922,0.00023812921,0.0006701,0.00013378375,0.000022181239,0.000072992276,0.000042192103,0.00037253887,0.00087113096,0.001181652,0.9961404,0.000015277003],"about_ca_topic_score_codex":0.0013331897,"about_ca_topic_score_gemma":0.0016675695,"teacher_disagreement_score":0.064269245,"about_ca_system_score_codex":0.00091396377,"about_ca_system_score_gemma":0.0011636968,"threshold_uncertainty_score":0.0916723},"labels":[],"label_agreement":null},{"id":"W3004834866","doi":"10.1145/3527171","title":"Deterministic Leader Election in Anonymous Radio Networks","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Leader election; Computer science; Communication source; Computer network; Graph; Connectivity; Combinatorics; Discrete mathematics; Mathematics; Topology (electrical circuits); Theoretical computer science; Physics","score_opus":0.015879433619937346,"score_gpt":0.24396178351696318,"score_spread":0.22808234989702583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004834866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11883907,0.0004163489,0.86827224,0.0004607536,0.000104258645,0.00008734095,0.00013596154,0.00047904623,0.011204954],"genre_scores_gemma":[0.9434606,0.00028501533,0.05157304,0.0000888374,0.000060831135,0.00016737841,0.00011613973,0.000046268222,0.0042018164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998104,0.0008495735,0.0000685553,0.00031270343,0.00037623165,0.00028895692],"domain_scores_gemma":[0.99642086,0.0019146691,0.00066033436,0.00045139264,0.00034723716,0.00020554567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013916256,0.0002927001,0.0005714385,0.0005354431,0.00094769435,0.0012772091,0.0013215641,0.0007554319,0.00128324],"category_scores_gemma":[0.006626015,0.00038354177,0.00044511893,0.00076148944,0.0015820595,0.0015353229,0.0013865802,0.0005286003,0.00037215344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021366167,0.00003761446,0.0012673355,0.00011127464,0.000041746818,0.00047211463,0.00031547318,0.6575908,0.0027115813,0.31699184,0.0020416584,0.018204942],"study_design_scores_gemma":[0.000047268277,0.000071522256,0.00025878573,0.000011824014,0.000016362437,0.00012240527,0.000101643345,0.8227721,0.0010970433,0.17196351,0.0035146172,0.000022941831],"about_ca_topic_score_codex":0.0012293075,"about_ca_topic_score_gemma":0.0009476849,"teacher_disagreement_score":0.0013916256,"about_ca_system_score_codex":0.00068451994,"about_ca_system_score_gemma":0.000643959,"threshold_uncertainty_score":0.0073596835},"labels":[],"label_agreement":null},{"id":"W3005416371","doi":"10.1145/1218063.1217945","title":"Database replication policies for dynamic content applications","year":2006,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Replica; Replication (statistics); Benchmark (surveying); Database; Distributed computing; Server; Latency (audio); Operating system","score_opus":0.04818245925714655,"score_gpt":0.32391709640629074,"score_spread":0.2757346371491442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005416371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23388073,0.0034513327,0.74052364,0.0014086016,0.00035076714,0.0005634936,0.0002797741,0.0043323734,0.015209337],"genre_scores_gemma":[0.8813669,0.0007013047,0.113659054,0.0001820798,0.00015206779,0.0001945487,0.0002615042,0.00027674955,0.003205795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944404,0.0018312599,0.00058075064,0.0008273384,0.0018729777,0.0004471485],"domain_scores_gemma":[0.97998923,0.005760575,0.0017836514,0.007558317,0.004216903,0.0006913672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069807954,0.00041074108,0.00058823725,0.000862206,0.0013737326,0.0026131684,0.0023570175,0.0008937386,0.0013518996],"category_scores_gemma":[0.019894391,0.0005196101,0.0003295873,0.0010286004,0.00080546434,0.0028345413,0.0013789133,0.0010087528,0.0007258457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001799143,0.0006949882,0.013127762,0.0006808158,0.00018029037,0.0006493404,0.0015421164,0.2619684,0.11905882,0.18268897,0.021626193,0.39598316],"study_design_scores_gemma":[0.00028221478,0.000574723,0.003591817,0.00009681789,0.00013450168,0.0010991814,0.0006538176,0.85075295,0.046985857,0.050047725,0.045644008,0.0001364086],"about_ca_topic_score_codex":0.0020186326,"about_ca_topic_score_gemma":0.0015430695,"teacher_disagreement_score":0.0069807954,"about_ca_system_score_codex":0.0017316722,"about_ca_system_score_gemma":0.0025028558,"threshold_uncertainty_score":0.0369184},"labels":[],"label_agreement":null},{"id":"W3010956859","doi":"10.1109/ccwc47524.2020.9031129","title":"Adapting a Container Infrastructure for Autonomous Vehicle Development","year":2020,"lang":"en","type":"article","venue":"2020 10th Annual Computing and Communication Workshop and Conference (CCWC)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Container (type theory); Computer science; Scalability; Process (computing); Cloud computing; Distributed computing; Embedded system; Operating system; Engineering","score_opus":0.021166503821568754,"score_gpt":0.25413107108390415,"score_spread":0.2329645672623354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010956859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443354,0.00037385494,0.61438817,0.0008611354,0.00029159422,0.00075932196,0.00022125343,0.023547288,0.015221939],"genre_scores_gemma":[0.6264229,0.0002064312,0.3677191,0.00013144824,0.000021081338,0.00027271456,0.00046354756,0.0019308875,0.0028319038],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987288,0.00024109965,0.00009823975,0.0002303935,0.00036259677,0.0003388027],"domain_scores_gemma":[0.9962913,0.0007205125,0.00036830883,0.0014078196,0.00077020784,0.0004418644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027042,0.0005574211,0.0002935141,0.0006881235,0.0005689985,0.0014128166,0.0019708814,0.00065666065,0.002203871],"category_scores_gemma":[0.0063756364,0.00068260334,0.00045946444,0.00045790002,0.00077182404,0.0028698114,0.0028713073,0.0013149075,0.0010153634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012566452,0.00089442736,0.03725504,0.000646293,0.00016193221,0.0027880918,0.0027449895,0.19992991,0.26500273,0.048173632,0.021411818,0.41973457],"study_design_scores_gemma":[0.0002412683,0.0015348828,0.012393648,0.00020876725,0.00017507686,0.0014484009,0.0014239249,0.6477877,0.19049948,0.01256963,0.13144982,0.00026755445],"about_ca_topic_score_codex":0.0033821147,"about_ca_topic_score_gemma":0.0025560532,"teacher_disagreement_score":0.0033821147,"about_ca_system_score_codex":0.0012627303,"about_ca_system_score_gemma":0.0021653108,"threshold_uncertainty_score":0.010720134},"labels":[],"label_agreement":null},{"id":"W3013676662","doi":"10.1145/3372491","title":"Feel Free to Interrupt","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Interrupt; Task (project management); Context switch; Debugging; Field-programmable gate array; Context (archaeology); Embedded system; Overhead (engineering); Deadlock; Interface (matter); Distributed computing; Variety (cybernetics); Operating system; Microcontroller","score_opus":0.026038762574303813,"score_gpt":0.24090701513883914,"score_spread":0.21486825256453532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013676662","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10103747,0.0030400734,0.17330843,0.027486954,0.012505288,0.0009151694,0.0018797703,0.041599285,0.6382276],"genre_scores_gemma":[0.47708482,0.0017664033,0.027120281,0.0152496,0.0018185722,0.00060162705,0.0013757545,0.0047829286,0.47019997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992955,0.00013275478,0.000033426582,0.00008910202,0.0002466604,0.00020246029],"domain_scores_gemma":[0.99752766,0.00054836215,0.00021575997,0.00048282242,0.000600361,0.00062511186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060446275,0.0008749098,0.00038631042,0.0003800153,0.0011587335,0.002582632,0.0010031932,0.0014421613,0.093529075],"category_scores_gemma":[0.007227623,0.0003800633,0.0005307336,0.00012663628,0.0007669707,0.0025103001,0.0022368864,0.0026124923,0.040232327],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013261619,0.00035279573,0.009299271,0.0006407605,0.00008847476,0.0020357831,0.0078065936,0.0031649768,0.04103553,0.027175479,0.6238665,0.28320768],"study_design_scores_gemma":[0.000106839354,0.0002739781,0.003771682,0.0002370269,0.000046194316,0.001202094,0.0022962068,0.0050616423,0.0066280933,0.010182586,0.97006637,0.00012729068],"about_ca_topic_score_codex":0.001377545,"about_ca_topic_score_gemma":0.0015693876,"teacher_disagreement_score":0.093529075,"about_ca_system_score_codex":0.0004227438,"about_ca_system_score_gemma":0.00066196074,"threshold_uncertainty_score":0.31288594},"labels":[],"label_agreement":null},{"id":"W3015862912","doi":"10.1145/2480359.2429086","title":"Inductive data flow graphs","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control flow graph; Correctness; Data flow diagram; Theoretical computer science; Thread (computing); Graph; Control flow; Data-flow analysis; Program analysis; Algorithm; Programming language; Database","score_opus":0.046605439328889164,"score_gpt":0.26774140926281986,"score_spread":0.2211359699339307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015862912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228467,0.000051977273,0.9867931,0.00020355283,0.000035999587,0.0001942561,0.00061079685,0.0016409981,0.0042407494],"genre_scores_gemma":[0.27446136,0.00038670606,0.71151626,0.00064553594,0.000154827,0.0012644429,0.003445177,0.000977248,0.0071484167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600995,0.0010236938,0.00032651238,0.0008444037,0.0013272958,0.00046812193],"domain_scores_gemma":[0.9866644,0.008186458,0.00080848497,0.0017823882,0.0022918794,0.00026631652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031149224,0.0010944757,0.00064539514,0.0022033302,0.0014562731,0.0020561796,0.00248318,0.0011476825,0.005433366],"category_scores_gemma":[0.011332459,0.0007104262,0.0019693053,0.0014884602,0.00358395,0.0061629955,0.0023520947,0.0022926922,0.001152655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023781134,0.00015069573,0.0017028442,0.00041948524,0.000048157395,0.00045933115,0.00076518656,0.044774268,0.009631984,0.84191537,0.0046397042,0.09525515],"study_design_scores_gemma":[0.000046305195,0.0000718032,0.0002943339,0.00009766865,0.000057376037,0.00015536598,0.0001330342,0.10282788,0.018187819,0.8474837,0.030592494,0.00005221513],"about_ca_topic_score_codex":0.005078883,"about_ca_topic_score_gemma":0.0039469195,"teacher_disagreement_score":0.005433366,"about_ca_system_score_codex":0.0016624002,"about_ca_system_score_gemma":0.0023133634,"threshold_uncertainty_score":0.018176496},"labels":[],"label_agreement":null},{"id":"W3016074430","doi":"10.1023/b:mone.0000031585.26814.2d","title":"A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients–Providers–Servers Systems","year":2004,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Random access; Server; Access time; Algorithm; Computer network; Permutation (music); Hill climbing; Operating system","score_opus":0.019706728277536424,"score_gpt":0.2657152183151447,"score_spread":0.2460084900376083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016074430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029194195,0.00028771567,0.96363604,0.00029860975,0.00013585918,0.00024485198,0.000109874694,0.0010863165,0.005006572],"genre_scores_gemma":[0.341062,0.00022216472,0.6508299,0.00018168829,0.000081735634,0.00042077457,0.00024793873,0.00024484354,0.0067088767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00015734119,0.00003600348,0.00007169227,0.00021521276,0.000115124916],"domain_scores_gemma":[0.9990508,0.0004058882,0.00005712769,0.00013163795,0.0002526645,0.000101760736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803837,0.00083508226,0.0018670307,0.0008777719,0.0016424826,0.0010660519,0.0024900816,0.0016900871,0.0042773127],"category_scores_gemma":[0.0024176626,0.0009519178,0.0009968588,0.0013882575,0.00074355444,0.0011125813,0.0014179682,0.001143595,0.00080749625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008408855,0.00007694839,0.00026413007,0.000049360093,0.000044808578,0.000053344575,0.000044995493,0.950446,0.0009617109,0.003783155,0.002631951,0.041559484],"study_design_scores_gemma":[0.000016773005,0.000013209225,0.000034299977,0.0000016256355,0.0000042636298,0.000006712136,0.0000053892345,0.9984669,0.00013377203,0.001071017,0.00024246653,0.0000034559882],"about_ca_topic_score_codex":0.019332701,"about_ca_topic_score_gemma":0.01705681,"teacher_disagreement_score":0.019332701,"about_ca_system_score_codex":0.0010855079,"about_ca_system_score_gemma":0.0022212637,"threshold_uncertainty_score":0.038440347},"labels":[],"label_agreement":null},{"id":"W3016293736","doi":"10.1109/tdsc.2020.2986751","title":"Self-Stabilizing Secure Computation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Adversary; Cryptography; Protocol (science); Computation; Adversarial system; Compromise; Cryptographic primitive; Cryptographic protocol; Distributed computing; State (computer science); Computer security; Secure multi-party computation; Algorithm; Artificial intelligence","score_opus":0.017021996208250272,"score_gpt":0.23458530626721635,"score_spread":0.2175633100589661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016293736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026413381,0.0001513263,0.96105796,0.00036807536,0.00008842035,0.00015189075,0.000058284873,0.0010442879,0.010666329],"genre_scores_gemma":[0.83272666,0.00030009833,0.15500297,0.0002531037,0.00012547716,0.00038756247,0.00014063153,0.00020194682,0.0108614955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793065,0.00037667248,0.00016712763,0.00041988544,0.000862624,0.00024301928],"domain_scores_gemma":[0.9969896,0.00076308066,0.0003281994,0.0013388256,0.00046055324,0.000119739634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995232,0.0004759085,0.00055296835,0.00052902166,0.0008815797,0.0018513624,0.0010161985,0.00084854884,0.0026348825],"category_scores_gemma":[0.004163835,0.0003132041,0.0006762994,0.00046093794,0.0027323205,0.002519597,0.0025330829,0.0014660765,0.00087617576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022554386,0.000086505526,0.00078265613,0.00019382815,0.000053183772,0.00025572485,0.0004523247,0.07100612,0.031327248,0.8504842,0.0024947424,0.04263799],"study_design_scores_gemma":[0.00007764891,0.00022207494,0.00024376488,0.00006319859,0.000056740173,0.00030169415,0.00007711042,0.4999068,0.042193655,0.43397003,0.022843525,0.000043786316],"about_ca_topic_score_codex":0.00031886873,"about_ca_topic_score_gemma":0.00036334858,"teacher_disagreement_score":0.0026348825,"about_ca_system_score_codex":0.0008891332,"about_ca_system_score_gemma":0.0013690256,"threshold_uncertainty_score":0.008814573},"labels":[],"label_agreement":null},{"id":"W3016919589","doi":"10.1145/3200691.3178489","title":"Harnessing epoch-based reclamation for efficient range queries","year":2018,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Global Affairs Canada; Israel Science Foundation","keywords":"Computer science; Garbage collection; Concurrent data structure; Range (aeronautics); Data structure; Range query (database); Overhead (engineering); Garbage; Lock (firearm); Linearizability; Transactional memory; Set (abstract data type); Implementation; Property (philosophy); Epoch (astronomy); Database; Theoretical computer science; Distributed computing; Information retrieval; Programming language; Web search query; Search engine; Sargable; Correctness","score_opus":0.03015240244174859,"score_gpt":0.2811497632410723,"score_spread":0.2509973607993237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016919589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05458696,0.0005251539,0.92564094,0.00027186278,0.00008088201,0.00014196237,0.00017581311,0.015009475,0.003566977],"genre_scores_gemma":[0.37779677,0.00043888282,0.6165161,0.00015461947,0.000071118346,0.00019948486,0.0003746269,0.0011620523,0.003286394],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772257,0.0004435563,0.0003480058,0.00031011057,0.00088195974,0.00029378207],"domain_scores_gemma":[0.98795843,0.002714055,0.0011768636,0.006844588,0.0010625239,0.0002434953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019857953,0.00064619,0.0008196864,0.0011547002,0.0008998043,0.0021584209,0.0027570939,0.00074985006,0.0022513983],"category_scores_gemma":[0.00993291,0.0006142746,0.0006154988,0.0019895223,0.0012906123,0.0064191855,0.003932468,0.0013084006,0.0013298367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008811768,0.00037246398,0.010496186,0.0004469208,0.00013233512,0.00027806635,0.002328524,0.059020672,0.09125696,0.096753746,0.009189756,0.7288432],"study_design_scores_gemma":[0.00019672373,0.0006622908,0.0029909879,0.00012744927,0.00018627818,0.0008544169,0.0008691588,0.54414415,0.27812174,0.09472457,0.0769179,0.00020438033],"about_ca_topic_score_codex":0.0012885303,"about_ca_topic_score_gemma":0.0015486925,"teacher_disagreement_score":0.0027570939,"about_ca_system_score_codex":0.0007606351,"about_ca_system_score_gemma":0.0013232669,"threshold_uncertainty_score":0.010501981},"labels":[],"label_agreement":null},{"id":"W3017746918","doi":"10.1007/s00446-020-00372-5","title":"Life beyond set agreement","year":2020,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Hierarchy; Power set; Object (grammar); Combinatorics; Sequence (biology); Theory of computation; Mathematics; Power (physics); Discrete mathematics; Computer science; Algorithm; Physics; Programming language; Artificial intelligence; Chemistry","score_opus":0.02706743297341297,"score_gpt":0.24815861650227383,"score_spread":0.22109118352886087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017746918","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010496016,0.0041066865,0.23981446,0.043436963,0.004615726,0.00016226241,0.00042916115,0.0012973611,0.69564146],"genre_scores_gemma":[0.5494932,0.0038694758,0.06999907,0.016694149,0.0030926825,0.0007033739,0.0009340455,0.0013910364,0.353823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640226,0.0013759498,0.00014724997,0.0007061076,0.0010067893,0.00036166035],"domain_scores_gemma":[0.9933357,0.0017610987,0.00023907798,0.002699198,0.0011651013,0.00079976575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034566743,0.0006063848,0.0008281213,0.0010775729,0.004669387,0.0067885653,0.0017924733,0.0029166373,0.028877137],"category_scores_gemma":[0.010988445,0.00050739857,0.00069178373,0.0008400388,0.009728489,0.015933478,0.0066773677,0.008240313,0.010591226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068383056,0.0000059922645,0.000025024077,0.000013716403,0.0000021198914,0.000010269272,0.00019865013,0.00014912257,0.00007928599,0.9875493,0.0057471483,0.0062125907],"study_design_scores_gemma":[0.000004411652,0.000008196712,0.00001460765,0.000030379178,0.0000020728032,0.00002283769,0.00007989753,0.0005265767,0.00017523789,0.91975904,0.079370946,0.0000058667256],"about_ca_topic_score_codex":0.0012246029,"about_ca_topic_score_gemma":0.0007382252,"teacher_disagreement_score":0.028877137,"about_ca_system_score_codex":0.0025434494,"about_ca_system_score_gemma":0.0028051923,"threshold_uncertainty_score":0.09660363},"labels":[],"label_agreement":null},{"id":"W3018044541","doi":"10.1109/csci49370.2019.00159","title":"Experience Report on an Undergraduate Project in Distributed Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Consistency (knowledge bases); Computer science; Synchronization (alternating current); Class (philosophy); Creativity; Replication (statistics); Domain (mathematical analysis); Raising (metalworking); Fault tolerance; Mathematics education; Software engineering; Distributed computing; Artificial intelligence; Psychology; Engineering; Mathematics","score_opus":0.020184800952026682,"score_gpt":0.28671601557221305,"score_spread":0.26653121462018636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018044541","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852013,0.001582507,0.07337406,0.0071528945,0.00081490626,0.0007634383,0.00033941655,0.001530327,0.062429454],"genre_scores_gemma":[0.87741107,0.0013509027,0.03864824,0.0025604574,0.00035717184,0.00026918534,0.0010432234,0.00045288014,0.07790689],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950421,0.0016686604,0.00024283798,0.00066310255,0.0013749728,0.0010083119],"domain_scores_gemma":[0.9892113,0.0012116722,0.00031006045,0.00061178824,0.0022386564,0.0064165867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040566726,0.001022907,0.00061905495,0.00090672297,0.0028683476,0.0032500809,0.0011389522,0.0016875,0.01277705],"category_scores_gemma":[0.011986732,0.00046767498,0.0007464062,0.00074820156,0.001323797,0.003455546,0.0042457744,0.0024249363,0.0046586418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081662333,0.016373448,0.063290395,0.00093109085,0.00014013292,0.008242712,0.16771087,0.0026566687,0.030654585,0.01432082,0.06791502,0.62694764],"study_design_scores_gemma":[0.0002460427,0.01130737,0.035173032,0.00043186493,0.00016560387,0.01631897,0.10634768,0.010683923,0.020692432,0.008475237,0.7898249,0.00033300434],"about_ca_topic_score_codex":0.0009195782,"about_ca_topic_score_gemma":0.0016567775,"teacher_disagreement_score":0.01277705,"about_ca_system_score_codex":0.0007590374,"about_ca_system_score_gemma":0.0013064047,"threshold_uncertainty_score":0.042743504},"labels":[],"label_agreement":null},{"id":"W3021019922","doi":"10.1007/978-3-030-53291-8_20","title":"Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Grantová Agentura České Republiky; European Commission","keywords":"Liveness; Computer science; Theoretical computer science; Distributed computing; Population; Petri net; Computation; Scheduling (production processes); Graph; Algorithm; Mathematical optimization; Mathematics","score_opus":0.053061724645414886,"score_gpt":0.2981256269397016,"score_spread":0.24506390229428673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021019922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09348129,0.000026489924,0.90377957,0.00010131507,0.0000113711385,0.0000907083,0.00012767034,0.0016117565,0.0007698142],"genre_scores_gemma":[0.8617077,0.000042807053,0.13715608,0.000043196193,0.000015374251,0.00017504906,0.00022867633,0.0001562933,0.00047478423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964623,0.0010429292,0.00020227421,0.0005744304,0.001430838,0.00028732733],"domain_scores_gemma":[0.980624,0.01355014,0.0018865218,0.0025091607,0.0011858406,0.0002443291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034028694,0.00066857715,0.00064436847,0.0007017399,0.00050515286,0.0015663808,0.0019431332,0.00076510815,0.0013347435],"category_scores_gemma":[0.018034969,0.0006020261,0.0013212815,0.00052258087,0.002921249,0.0024195367,0.0016115146,0.0012365545,0.00017338601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036443578,0.00015697464,0.004875483,0.00026253756,0.00014340832,0.00047429418,0.0005079982,0.7657941,0.047871105,0.14205313,0.0004537878,0.037042867],"study_design_scores_gemma":[0.000040253522,0.00007465704,0.00026261515,0.000009887691,0.000023066523,0.000037845384,0.0000353701,0.9245999,0.022759879,0.05177007,0.00037154774,0.000015048543],"about_ca_topic_score_codex":0.0035733553,"about_ca_topic_score_gemma":0.0033427973,"teacher_disagreement_score":0.0035733553,"about_ca_system_score_codex":0.0015784008,"about_ca_system_score_gemma":0.0023437934,"threshold_uncertainty_score":0.017996311},"labels":[],"label_agreement":null},{"id":"W3031483518","doi":"10.1109/icde48307.2020.00123","title":"DynaMast: Adaptive Dynamic Mastering for Replicated Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Bottleneck; Distributed computing; Replica; Benchmark (surveying); Database transaction; Protocol (science); Metadata; Distributed database; Transaction processing; Database; Atomicity; Operating system; Embedded system","score_opus":0.034353635124530116,"score_gpt":0.24632809841792344,"score_spread":0.2119744632933933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031483518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023194462,0.0006961599,0.9473655,0.00035086917,0.00016412741,0.00026410262,0.00037967577,0.023078687,0.0045063775],"genre_scores_gemma":[0.6222831,0.00069714134,0.36486343,0.0003085281,0.00016793775,0.0006203812,0.001325798,0.0020858804,0.0076478054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.000293728,0.00012302752,0.00019641059,0.0005618464,0.00013932487],"domain_scores_gemma":[0.99743986,0.0006508967,0.00020500553,0.0010705978,0.00044482236,0.00018886731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017258346,0.00054406154,0.00068420655,0.0005935291,0.0008572461,0.0015285071,0.0027528887,0.0006154223,0.002883009],"category_scores_gemma":[0.0049922126,0.000593425,0.00044133875,0.00069309236,0.0007783051,0.0024173958,0.0029312368,0.0013389329,0.00105851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018463811,0.00037426266,0.0056490134,0.0009332484,0.00024710773,0.00076606893,0.0009424584,0.24551961,0.113648176,0.086058594,0.060728386,0.48328668],"study_design_scores_gemma":[0.0002645723,0.00022006374,0.00059876114,0.00003910828,0.00004775771,0.00039626434,0.000099438075,0.9003708,0.031904843,0.02893508,0.03704734,0.00007594588],"about_ca_topic_score_codex":0.0013992818,"about_ca_topic_score_gemma":0.0016406017,"teacher_disagreement_score":0.002883009,"about_ca_system_score_codex":0.0008528852,"about_ca_system_score_gemma":0.0012578988,"threshold_uncertainty_score":0.009644628},"labels":[],"label_agreement":null},{"id":"W3034829786","doi":"10.48550/arxiv.2006.06771","title":"Randomized Consensus with Regular Registers","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Asynchronous communication; Adversary; Computer science; Randomized algorithm; Adversary model; Theoretical computer science; Algorithm; Computer security","score_opus":0.07029143193254793,"score_gpt":0.18059500277348275,"score_spread":0.11030357084093483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034829786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05367154,0.00034698172,0.9325383,0.0014336501,0.00022158309,0.00020284549,0.00019881761,0.0017180642,0.0096682925],"genre_scores_gemma":[0.8168692,0.000325638,0.16880438,0.00072946853,0.00017210722,0.00054864277,0.0003496509,0.00022803676,0.011972831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943715,0.0017231752,0.00033727934,0.0018075943,0.0010786131,0.0006819503],"domain_scores_gemma":[0.9876079,0.0059986874,0.00089684274,0.0040682307,0.0010838482,0.00034449893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034226698,0.0007179224,0.0014678955,0.00067801727,0.0011103944,0.0019992562,0.0022983514,0.002151117,0.0041426383],"category_scores_gemma":[0.018687014,0.0006073722,0.001105056,0.0007742296,0.0028437306,0.0046198755,0.0032005857,0.0027444228,0.0012027193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012834027,0.00019199675,0.00096674974,0.00029880143,0.00013664961,0.0003133164,0.00043954194,0.3419853,0.015632953,0.58217835,0.005760952,0.05081193],"study_design_scores_gemma":[0.00037172093,0.00020830665,0.00012325095,0.00003879954,0.000051160663,0.00008241859,0.000051374376,0.77188754,0.010739303,0.21156605,0.0048333458,0.0000467234],"about_ca_topic_score_codex":0.0013020687,"about_ca_topic_score_gemma":0.000904022,"teacher_disagreement_score":0.0041426383,"about_ca_system_score_codex":0.0016462526,"about_ca_system_score_gemma":0.0022917597,"threshold_uncertainty_score":0.018100977},"labels":[],"label_agreement":null},{"id":"W3035389942","doi":"","title":"Online Bayesian Moment Matching based SAT Solver Heuristics","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Matching (statistics); Solver; Bayesian probability; Moment (physics); Algorithm; Artificial intelligence; Mathematics; Statistics; Programming language; Physics","score_opus":0.04184371776120862,"score_gpt":0.29043884637231565,"score_spread":0.24859512861110702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035389942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031261515,0.00044695722,0.93761796,0.0011387576,0.00025903026,0.00026721708,0.0008712048,0.0042693433,0.023868144],"genre_scores_gemma":[0.48886773,0.00021582225,0.49460572,0.0007458105,0.00017961978,0.00037603558,0.00195884,0.00082625094,0.012224309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782807,0.0008085073,0.00009773446,0.00042741944,0.00050192437,0.00033627122],"domain_scores_gemma":[0.994253,0.0041389703,0.00028167551,0.00057499955,0.00054511713,0.00020619185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449405,0.0011939023,0.001972318,0.0021419586,0.001110414,0.001976595,0.0034037833,0.0024745408,0.040967803],"category_scores_gemma":[0.0097906785,0.0013000155,0.0015113034,0.0027290129,0.0009001168,0.0038133818,0.002596759,0.0025002847,0.00368375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001307922,0.00062126346,0.0016625,0.0002663729,0.00016768939,0.0001859203,0.00015412041,0.54937094,0.0033575625,0.08844645,0.028785333,0.3256739],"study_design_scores_gemma":[0.000118908356,0.000049922426,0.0001546061,0.000013050532,0.000026545304,0.000028547585,0.000021740487,0.96622425,0.00075986475,0.031064287,0.0015261126,0.000012175948],"about_ca_topic_score_codex":0.0063119265,"about_ca_topic_score_gemma":0.013850734,"teacher_disagreement_score":0.040967803,"about_ca_system_score_codex":0.0018664055,"about_ca_system_score_gemma":0.0035590543,"threshold_uncertainty_score":0.13705093},"labels":[],"label_agreement":null},{"id":"W3036247954","doi":"10.1109/saci49304.2020.9118822","title":"A Control Loop-based Algorithm for Operational Transformation","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Convergence (economics); Scalability; Distributed computing; Architecture; Synchronization (alternating current); Finite-state machine; Loop (graph theory); Theoretical computer science; Algorithm","score_opus":0.016177096567081134,"score_gpt":0.2346152668889936,"score_spread":0.21843817032191246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036247954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001747972,0.000032737753,0.99578226,0.000040269086,0.000026302487,0.000051854924,0.000013373942,0.0006228558,0.0016823931],"genre_scores_gemma":[0.3610535,0.00012429421,0.6323808,0.00013411036,0.000047310255,0.0005334794,0.00017243317,0.00021318518,0.005340928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00018885384,0.0000652079,0.0002740074,0.00026737,0.00012224607],"domain_scores_gemma":[0.9991788,0.000417025,0.00006384846,0.00012492116,0.00017856591,0.00003676614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096699427,0.0010036894,0.0007277716,0.0007974952,0.0007921805,0.0015410653,0.0017117285,0.0012236142,0.0065969704],"category_scores_gemma":[0.0025829033,0.0003194389,0.0008204968,0.0005491588,0.001688179,0.0013899263,0.0017262636,0.0017015865,0.001152997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030766847,0.00016754659,0.00064098975,0.0002675914,0.00005114855,0.00021640804,0.00037985118,0.44085878,0.014320763,0.21917751,0.0036499111,0.3199618],"study_design_scores_gemma":[0.000051435338,0.00011650479,0.00003996634,0.000017891773,0.000015678397,0.0000633666,0.000025909776,0.95324075,0.0040814816,0.037791237,0.0045410665,0.000014735952],"about_ca_topic_score_codex":0.0025940705,"about_ca_topic_score_gemma":0.0016742942,"teacher_disagreement_score":0.0065969704,"about_ca_system_score_codex":0.0010752094,"about_ca_system_score_gemma":0.0014999484,"threshold_uncertainty_score":0.022069097},"labels":[],"label_agreement":null},{"id":"W3037862393","doi":"10.1109/edocw49879.2020.00017","title":"Adapting Workflow Management Systems to BFT Blockchains – The YAWL Example","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Workflow; Computer science; Scalability; Workflow management system; Blockchain; Byzantine fault tolerance; Workflow engine; Consistency (knowledge bases); Database; Atomicity; Proof of concept; Workflow technology; Distributed computing; Fault tolerance; Database transaction; Computer security","score_opus":0.04871058092347561,"score_gpt":0.25533298860107406,"score_spread":0.20662240767759846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037862393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14549625,0.000821377,0.7917253,0.0044082575,0.00028185378,0.00046163192,0.00041871076,0.0044668163,0.05191994],"genre_scores_gemma":[0.6010144,0.0014994438,0.37468484,0.0003414134,0.00009934294,0.00032503353,0.00038884635,0.0004613987,0.02118523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987306,0.00042575388,0.00007666929,0.00014064384,0.00041553192,0.0002107715],"domain_scores_gemma":[0.99886286,0.00032747383,0.00007171726,0.000438719,0.00016105235,0.00013812716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017852716,0.0002934671,0.00037275403,0.000402009,0.0011138582,0.0022736671,0.00092690624,0.0016528639,0.0030005646],"category_scores_gemma":[0.003191028,0.0003445333,0.0005177396,0.00086234475,0.001686603,0.0030494756,0.0032962207,0.0017263308,0.001141383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004937249,0.00031933776,0.00218579,0.00038541682,0.00004752579,0.0023539274,0.0018181589,0.26221246,0.025552467,0.5469336,0.00834359,0.14935407],"study_design_scores_gemma":[0.0002607993,0.00013179937,0.00064875226,0.00008867776,0.000024245834,0.0005157684,0.00037699842,0.57686514,0.017005645,0.2904342,0.11357416,0.00007372139],"about_ca_topic_score_codex":0.0047955904,"about_ca_topic_score_gemma":0.0035836725,"teacher_disagreement_score":0.0047955904,"about_ca_system_score_codex":0.0012213116,"about_ca_system_score_gemma":0.0013897709,"threshold_uncertainty_score":0.010037839},"labels":[],"label_agreement":null},{"id":"W3038067601","doi":"10.14778/3397230.3397239","title":"Scalable, near-zero loss disaster recovery for distributed data stores","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backup; Computer science; Failover; Data loss; Scalability; Distributed computing; Replication (statistics); Fault tolerance; Backup software; Eventual consistency; Computer network; Disaster recovery; Data integrity; Data recovery; Asynchronous communication; Data consistency; Database; Consistency model; Operating system","score_opus":0.036865755455791,"score_gpt":0.2497641672253746,"score_spread":0.21289841176958357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038067601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3585028,0.0019403718,0.54779613,0.0012040278,0.00035131891,0.0008788985,0.0010506185,0.07921042,0.009065353],"genre_scores_gemma":[0.86950433,0.00032352863,0.12318856,0.00030555655,0.00006755142,0.00021421332,0.0010617407,0.000608224,0.004726274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860173,0.00016439882,0.00012283337,0.00026439436,0.000634439,0.00021217205],"domain_scores_gemma":[0.9963737,0.00058458536,0.0003908512,0.0017230073,0.0006384996,0.0002892036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013274482,0.000752242,0.0006980517,0.000957335,0.0011440776,0.001496109,0.0036765,0.0006481403,0.0025427043],"category_scores_gemma":[0.0037793377,0.0006191665,0.00038434519,0.0010570388,0.000958694,0.004152371,0.003993035,0.0014421914,0.0010802535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066575767,0.00171581,0.017223975,0.0014812769,0.00034157824,0.0016735293,0.0020211255,0.14793673,0.21788512,0.017911045,0.056322716,0.52882946],"study_design_scores_gemma":[0.0009788765,0.0023515855,0.005404462,0.00012387613,0.00019375925,0.0014200992,0.0012887327,0.77941066,0.14912583,0.014467758,0.04497017,0.00026421616],"about_ca_topic_score_codex":0.0023570354,"about_ca_topic_score_gemma":0.0032032323,"teacher_disagreement_score":0.0036765,"about_ca_system_score_codex":0.0008243459,"about_ca_system_score_gemma":0.0017086066,"threshold_uncertainty_score":0.008506179},"labels":[],"label_agreement":null},{"id":"W3040569666","doi":"10.1109/tdsc.2021.3114310","title":"The Hermes BFT for Blockchains","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Computer science; Computer network; Node (physics); Bandwidth (computing); Byzantine architecture; Byzantine fault tolerance; Distributed computing; Telecommunications; Fault tolerance; Geography; Engineering","score_opus":0.016019723293701164,"score_gpt":0.25388719399261844,"score_spread":0.23786747069891728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040569666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04782367,0.00056223274,0.91507643,0.0012263217,0.00030005455,0.0004919493,0.0016328073,0.010152505,0.02273399],"genre_scores_gemma":[0.587184,0.00049111445,0.38751584,0.0002703886,0.00012690746,0.00079462456,0.0022037043,0.000790788,0.020622691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998298,0.0005083088,0.00012140567,0.0002297902,0.00064311794,0.00019941683],"domain_scores_gemma":[0.997974,0.0005860623,0.0001303949,0.0008179534,0.0003629383,0.00012861483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022194542,0.0005529863,0.0006369401,0.0006155939,0.0011912992,0.0013253689,0.0011540239,0.0013575623,0.009889216],"category_scores_gemma":[0.006367693,0.00043336683,0.00052521576,0.00088619953,0.0009556317,0.0023476803,0.0018211493,0.0016005633,0.0024368684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008642129,0.00021666562,0.0011148727,0.00044542138,0.000062472194,0.00037741236,0.0003265215,0.45996338,0.022917181,0.2775335,0.025563035,0.21061534],"study_design_scores_gemma":[0.00017442294,0.00013461211,0.00024483225,0.000048648402,0.000014155629,0.000112929316,0.00004266285,0.8119757,0.009397087,0.14526221,0.03255678,0.000035941313],"about_ca_topic_score_codex":0.006687388,"about_ca_topic_score_gemma":0.006071439,"teacher_disagreement_score":0.009889216,"about_ca_system_score_codex":0.0013951906,"about_ca_system_score_gemma":0.0027090826,"threshold_uncertainty_score":0.033082724},"labels":[],"label_agreement":null},{"id":"W3041616069","doi":"10.1145/3350755.3400269","title":"Benchmarking Recoverable Mutex Locks","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semaphore; Mutual exclusion; Computer science; Parallel computing; Queue; Benchmarking; Lock (firearm); Multiprocessing; Dram; Operating system; Distributed computing; Embedded system; Computer network; Computer hardware; Engineering","score_opus":0.0183159324998887,"score_gpt":0.19802662283128228,"score_spread":0.17971069033139359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041616069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91968876,0.0010658837,0.060819723,0.0003624808,0.00033597622,0.00021318262,0.00057933957,0.006378497,0.01055623],"genre_scores_gemma":[0.97831386,0.00012562408,0.018984541,0.00006352375,0.000017626287,0.000084959756,0.00046642768,0.0001836915,0.001759875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947136,0.0011376197,0.0003133106,0.0006881471,0.0022067619,0.00094060216],"domain_scores_gemma":[0.9905199,0.004515081,0.00048376824,0.0027291416,0.0013849629,0.00036712424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251887,0.00046615012,0.000523886,0.0010009401,0.0006651886,0.0011392356,0.0026779557,0.0011508124,0.0047301757],"category_scores_gemma":[0.014225254,0.00029199742,0.00031157766,0.001072576,0.001355319,0.0027384341,0.001958558,0.0012131158,0.000693061],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008260363,0.002628723,0.02252026,0.0013142982,0.00042606678,0.00071044767,0.0010896781,0.4409733,0.103578605,0.07933972,0.01682296,0.32233554],"study_design_scores_gemma":[0.0007953478,0.0029914433,0.0034482533,0.000058508485,0.00008325937,0.00020652477,0.00047706033,0.82073545,0.14287774,0.012765725,0.015473915,0.000086862696],"about_ca_topic_score_codex":0.001920917,"about_ca_topic_score_gemma":0.0019500026,"teacher_disagreement_score":0.0047301757,"about_ca_system_score_codex":0.0011250532,"about_ca_system_score_gemma":0.0012776192,"threshold_uncertainty_score":0.017197788},"labels":[],"label_agreement":null},{"id":"W3043795353","doi":"10.1145/3401025.3401744","title":"RocketBufs","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remote direct memory access; Computer science; Middleware (distributed applications); Synchronizing; Message queue; Operating system; Distributed computing; Message oriented middleware; Buffer (optical fiber); Computer network; Embedded system; Software; Telecommunications","score_opus":0.020553403661024983,"score_gpt":0.20561768174370915,"score_spread":0.18506427808268416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043795353","genre_codex":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027886206,0.0013116365,0.39560178,0.00097536045,0.00088225584,0.0006219341,0.007065316,0.4553712,0.110284284],"genre_scores_gemma":[0.40000194,0.001701742,0.27965063,0.0013164686,0.00040355764,0.0018131005,0.03722124,0.08114331,0.196748],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990355,0.00011018121,0.000044828834,0.00015656145,0.00042624222,0.0002268088],"domain_scores_gemma":[0.99886274,0.00021268603,0.00008356465,0.00033852694,0.00032412907,0.00017836818],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013228535,0.0011901322,0.00083609147,0.0009672426,0.001102972,0.0024773688,0.0041081635,0.001240991,0.054063328],"category_scores_gemma":[0.00396896,0.0007757465,0.0007603144,0.0006676812,0.0007022527,0.0037977812,0.0031325226,0.002035398,0.020755565],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036668596,0.00032596325,0.0052962117,0.0008394074,0.00018134923,0.00087458774,0.0013730262,0.023961067,0.033143412,0.10411939,0.48218817,0.34403062],"study_design_scores_gemma":[0.00035931103,0.00025725423,0.001211557,0.000118339936,0.000050856128,0.0004506946,0.00018565888,0.079789735,0.030687872,0.019150164,0.8676269,0.00011167418],"about_ca_topic_score_codex":0.0076756566,"about_ca_topic_score_gemma":0.0045839967,"teacher_disagreement_score":0.9459367,"about_ca_system_score_codex":0.0010924429,"about_ca_system_score_gemma":0.0017275648,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3046463707","doi":"10.1145/3382734.3405736","title":"Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Computer science; Process (computing); Crash; Constant (computer programming); Protocol (science); Shared memory; Theoretical computer science; Distributed computing; Parallel computing; Programming language","score_opus":0.03569281660777281,"score_gpt":0.23414459852025069,"score_spread":0.19845178191247786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046463707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052165058,0.0011048176,0.9019923,0.0033201177,0.00021767977,0.00031106413,0.0006919096,0.003981097,0.036215875],"genre_scores_gemma":[0.70439196,0.0008260534,0.27691653,0.00076259003,0.0005955905,0.0009856764,0.0010545135,0.00090174575,0.013565465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951381,0.00084115803,0.00025612043,0.0008058331,0.0019731137,0.0009856855],"domain_scores_gemma":[0.9866918,0.007178646,0.0007815939,0.004215356,0.00063570956,0.00049683877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002707998,0.0016246623,0.0021004456,0.0014333554,0.0015382019,0.004014003,0.0041938736,0.0023939505,0.013065085],"category_scores_gemma":[0.014046983,0.0006017094,0.0022617155,0.0016619865,0.0031057382,0.0115200775,0.008404227,0.006460095,0.0031334292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006948655,0.00022105713,0.00037466345,0.00041140037,0.00007584432,0.00025033436,0.0002494519,0.0854019,0.008374446,0.84647596,0.009643204,0.047826856],"study_design_scores_gemma":[0.00011266343,0.00007366808,0.0001284651,0.000032173935,0.000034255572,0.00015129468,0.000022973138,0.24843286,0.0027870084,0.7445549,0.003630283,0.00003940105],"about_ca_topic_score_codex":0.0009428899,"about_ca_topic_score_gemma":0.0011661723,"teacher_disagreement_score":0.013065085,"about_ca_system_score_codex":0.0031266254,"about_ca_system_score_gemma":0.003146184,"threshold_uncertainty_score":0.043707013},"labels":[],"label_agreement":null},{"id":"W305950784","doi":"10.1007/978-3-319-14472-6_27","title":"Space- and Time-Efficient Long-Lived Test-And-Set Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Reset (finance); Asynchronous communication; Set (abstract data type); Time complexity; Implementation; Constant (computer programming); Theoretical computer science; Binary logarithm; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.011294405239056941,"score_gpt":0.2271747626164213,"score_spread":0.21588035737736436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W305950784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055857416,0.0009861065,0.9277818,0.00023398061,0.00021509182,0.00013904851,0.0003813868,0.0051090876,0.009296106],"genre_scores_gemma":[0.5475487,0.00046865613,0.43024063,0.00014351925,0.00014810823,0.00031466965,0.0013342217,0.0009723458,0.01882919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831367,0.00022888025,0.00013862748,0.00028863584,0.00065281894,0.00037744068],"domain_scores_gemma":[0.993089,0.0020315477,0.0004879291,0.0030285825,0.0010427904,0.000320083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771645,0.001061031,0.0016260613,0.0012323885,0.0014837811,0.0026383784,0.0041713794,0.0009948873,0.0071995454],"category_scores_gemma":[0.0058615613,0.0006114338,0.0009911781,0.0021775248,0.0015405575,0.0047448305,0.0049271304,0.0016862017,0.0020714644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017185892,0.00034804735,0.001844361,0.00060353015,0.00013804954,0.000296368,0.00058986375,0.11263288,0.038478542,0.28756922,0.015372747,0.5404078],"study_design_scores_gemma":[0.000274642,0.00084348454,0.00085315056,0.00011414167,0.00020308657,0.000591504,0.00030646534,0.48022854,0.06410801,0.42596027,0.026391184,0.00012547888],"about_ca_topic_score_codex":0.0012415148,"about_ca_topic_score_gemma":0.001709102,"teacher_disagreement_score":0.0071995454,"about_ca_system_score_codex":0.0014750761,"about_ca_system_score_gemma":0.0021499055,"threshold_uncertainty_score":0.024084926},"labels":[],"label_agreement":null},{"id":"W3078249381","doi":"10.1109/icbc48266.2020.9169425","title":"Performance and Fault Tolerance Trade-offs in Sharded Permissioned Blockchains","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalability; Interleaving; Computer science; Latency (audio); Fault tolerance; Distributed computing; Overhead (engineering); Database transaction; Coupling (piping); Computer network; Operating system; Engineering; Database; Telecommunications","score_opus":0.0185390616067629,"score_gpt":0.22683827714263458,"score_spread":0.20829921553587166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3078249381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949001,0.0002988963,0.046839017,0.00022418282,0.000038519243,0.000050994677,0.000051239687,0.0007294831,0.002766719],"genre_scores_gemma":[0.99630797,0.000035472716,0.0032321743,0.000007674895,0.000006313244,0.000010785355,0.000021141706,0.000013426254,0.00036513628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971175,0.00071863964,0.00018560544,0.00033928218,0.0010292634,0.00060980616],"domain_scores_gemma":[0.9863686,0.007310008,0.0013485221,0.0026268763,0.0013836026,0.00096241396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003801636,0.0005112762,0.0007511227,0.0007366457,0.0010207132,0.001561718,0.0012805022,0.00081297103,0.002115943],"category_scores_gemma":[0.010434633,0.00038754207,0.00027009263,0.00089904026,0.0012654641,0.00326369,0.0014619429,0.0007792072,0.00023961467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034239714,0.0006295185,0.011475082,0.00020845715,0.00012529115,0.00072375435,0.0005794246,0.82122755,0.065208405,0.016029958,0.0010280265,0.07934052],"study_design_scores_gemma":[0.00013841823,0.00085639715,0.0017760596,0.000013612853,0.00003427039,0.0001802099,0.0001366313,0.9641943,0.02318647,0.0090058185,0.00045264777,0.00002524315],"about_ca_topic_score_codex":0.0015485487,"about_ca_topic_score_gemma":0.0015699032,"teacher_disagreement_score":0.003801636,"about_ca_system_score_codex":0.0010545528,"about_ca_system_score_gemma":0.0009593661,"threshold_uncertainty_score":0.020105183},"labels":[],"label_agreement":null},{"id":"W3080923803","doi":"10.24963/kr.2020/1","title":"Inputs, Outputs, and Composition in the Logic of Information Flows","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; National Natural Science Foundation of China","keywords":"Composition (language); Bounded function; Computer science; Expressive power; Variable (mathematics); Theoretical computer science; Artificial intelligence; Mathematics; Linguistics","score_opus":0.016199331581412645,"score_gpt":0.21949000026850646,"score_spread":0.2032906686870938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080923803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028085707,0.0010659446,0.95236033,0.0023553108,0.00013420162,0.000069021604,0.00017831396,0.000508824,0.01524229],"genre_scores_gemma":[0.5752627,0.0015368788,0.41252646,0.0010837776,0.0003957357,0.00035469962,0.00033064542,0.00027209983,0.008236973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411076,0.002430944,0.0005566458,0.0009652186,0.0013942746,0.00054215733],"domain_scores_gemma":[0.99487877,0.0036107518,0.00040980353,0.00048558073,0.00045584928,0.00015917716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00599833,0.0008918976,0.000624345,0.0017411395,0.0016267465,0.0053190356,0.0013958593,0.0017715471,0.0023635817],"category_scores_gemma":[0.008372988,0.00080989825,0.001781924,0.0016116864,0.009358135,0.011705348,0.0027777913,0.004063756,0.00034289522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004362139,0.0000149339285,0.00014576949,0.000052821662,0.000010225015,0.0000767654,0.00038278702,0.006458737,0.00073974155,0.9844061,0.0003037822,0.0073647294],"study_design_scores_gemma":[0.00001736634,0.0000181896,0.00006117407,0.00003054295,0.00002349623,0.00006193905,0.00007883995,0.02530444,0.0015509954,0.9682806,0.0045554843,0.000016821472],"about_ca_topic_score_codex":0.0031105708,"about_ca_topic_score_gemma":0.0017932388,"teacher_disagreement_score":0.00599833,"about_ca_system_score_codex":0.002698765,"about_ca_system_score_gemma":0.0019342529,"threshold_uncertainty_score":0.031722546},"labels":[],"label_agreement":null},{"id":"W3086779066","doi":"10.1145/2872887.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":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Transactional memory; Computer science; IBM; Software transactional memory; Scalability; Operating system; Overhead (engineering); Software; Multi-core processor; Computer architecture; Parallel computing; Embedded system; Programming language; Database transaction","score_opus":0.061106654920366515,"score_gpt":0.3273915985601816,"score_spread":0.26628494363981503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086779066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95966387,0.006441793,0.009489863,0.00043654328,0.00022500893,0.00013939793,0.0036966854,0.0058802594,0.01402654],"genre_scores_gemma":[0.97904974,0.0006088598,0.011335332,0.00011202956,0.000061292834,0.00015183366,0.0057858285,0.00039036936,0.002504804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99401504,0.00082648074,0.00044336944,0.00082234753,0.003206702,0.00068604294],"domain_scores_gemma":[0.97317636,0.011884432,0.0016711121,0.0031140998,0.009203388,0.0009504798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002880058,0.0011236516,0.00071121816,0.002919047,0.00055182975,0.0012424901,0.0022393474,0.00069931615,0.0031232652],"category_scores_gemma":[0.014890184,0.00039062437,0.00034199678,0.0058296714,0.00084165647,0.003555265,0.0007365773,0.0007817492,0.0007431623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009828033,0.001677927,0.07293416,0.003891905,0.0006370114,0.00074950844,0.0007423209,0.14836027,0.1563411,0.014236784,0.06822194,0.52237904],"study_design_scores_gemma":[0.00063127297,0.007598874,0.114447825,0.00023262133,0.0006065394,0.0009065791,0.0011655551,0.54054457,0.29020187,0.0047648866,0.03865327,0.0002460838],"about_ca_topic_score_codex":0.0040182015,"about_ca_topic_score_gemma":0.005929976,"teacher_disagreement_score":0.0040182015,"about_ca_system_score_codex":0.0017567337,"about_ca_system_score_gemma":0.0011993188,"threshold_uncertainty_score":0.015231371},"labels":[],"label_agreement":null},{"id":"W3093634451","doi":"10.1109/brains49436.2020.9223291","title":"Towards Scaling Byzantine Consensus Using Random Network Topology And Multi-Signatures","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Scalability; Adaptability; Computer science; Network topology; Distributed computing; Byzantine fault tolerance; Scale (ratio); Throughput; Topology (electrical circuits); Adaptation (eye); Convergence (economics); Computer network; Engineering; Fault tolerance; Telecommunications; Wireless","score_opus":0.03984233711131498,"score_gpt":0.27858856197358023,"score_spread":0.23874622486226527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093634451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29103246,0.00034503982,0.7017071,0.0006438375,0.00007845805,0.000274862,0.000071420516,0.0017701894,0.0040766653],"genre_scores_gemma":[0.87077403,0.00019304689,0.12740377,0.00007543613,0.000020646528,0.00016886526,0.00009287878,0.00010841793,0.001162803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593794,0.0021952346,0.00014090749,0.0005252594,0.0009953614,0.0002052694],"domain_scores_gemma":[0.9882359,0.0054202573,0.0008875785,0.0039306004,0.0012314009,0.00029423437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00443326,0.0006944448,0.0010209996,0.0009598708,0.0008329613,0.0014315459,0.001358817,0.0009750164,0.0012141007],"category_scores_gemma":[0.014069434,0.0003879276,0.0005526869,0.0008335166,0.0012703496,0.0049221087,0.0021124883,0.0012527055,0.0003929701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041264563,0.00034894925,0.0025825093,0.00034307668,0.00012161135,0.0003172496,0.00078520144,0.7954656,0.05189674,0.041955657,0.0017158613,0.104054905],"study_design_scores_gemma":[0.00004363318,0.00028368414,0.00038640306,0.00001560471,0.000020543643,0.00013480465,0.00013543891,0.96496326,0.014812089,0.017122602,0.0020617046,0.000020331623],"about_ca_topic_score_codex":0.0009807779,"about_ca_topic_score_gemma":0.0007970177,"teacher_disagreement_score":0.00443326,"about_ca_system_score_codex":0.00084456993,"about_ca_system_score_gemma":0.00082382717,"threshold_uncertainty_score":0.023445606},"labels":[],"label_agreement":null},{"id":"W3093763547","doi":"10.48550/arxiv.2010.11454","title":"Fast-HotStuff: A Fast and Resilient HotStuff Protocol","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Byzantine fault tolerance; Computer science; Protocol (science); Latency (audio); Distributed computing; Fault tolerance; Byzantine architecture; Theoretical computer science; Computer network; Telecommunications; Geography","score_opus":0.059696607989892,"score_gpt":0.2041136110463761,"score_spread":0.14441700305648408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093763547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05217886,0.0005860073,0.9335379,0.00071215,0.0003648122,0.00044303137,0.00030834947,0.004752654,0.007116147],"genre_scores_gemma":[0.7184885,0.0005488655,0.26699585,0.00081492105,0.00021226458,0.0007332426,0.0007926051,0.00066845893,0.010745265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891865,0.00030335944,0.00008111103,0.00016636967,0.00034088106,0.00018956032],"domain_scores_gemma":[0.99715304,0.0007105618,0.0002469698,0.0012068502,0.0004316548,0.00025090732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017342303,0.00046509088,0.0006501987,0.0006264338,0.0010864327,0.0010267382,0.0017946544,0.001239764,0.0033559883],"category_scores_gemma":[0.003790143,0.00040267923,0.00046746992,0.0005574817,0.0012303981,0.0028539682,0.004298384,0.001790582,0.0008350859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021180115,0.00032561767,0.002225299,0.000983299,0.00018371064,0.0009401639,0.0021047178,0.08710105,0.15860128,0.28466067,0.030144202,0.43061197],"study_design_scores_gemma":[0.000723774,0.0015778381,0.0013881222,0.00016751057,0.00018190368,0.001630239,0.00071792345,0.52957195,0.12831588,0.21804287,0.117252216,0.0004298107],"about_ca_topic_score_codex":0.00082962995,"about_ca_topic_score_gemma":0.00097389123,"teacher_disagreement_score":0.0033559883,"about_ca_system_score_codex":0.00045175073,"about_ca_system_score_gemma":0.0010971726,"threshold_uncertainty_score":0.0112268925},"labels":[],"label_agreement":null},{"id":"W3094958164","doi":"10.14778/3424573.3424575","title":"An analysis of concurrency control protocols for in-memory databases with CCBench","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nautilus Environmental","funders":"","keywords":"Computer science; Workload; Garbage collection; Parallel computing; Thread (computing); Scalability; Cache; Concurrency control; Concurrency; Distributed computing; Cache coherence; Transaction processing; Database transaction; Operating system; CPU cache; Database; Programming language; Garbage; Cache algorithms","score_opus":0.029335185320784087,"score_gpt":0.29091004507903095,"score_spread":0.26157485975824685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094958164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3539605,0.0010410574,0.6290871,0.00036292922,0.0000841532,0.000512628,0.00051543844,0.00681316,0.0076230643],"genre_scores_gemma":[0.8345405,0.00033605748,0.16083603,0.00012309688,0.000046791778,0.00036350673,0.0009950148,0.0006108356,0.002148316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950983,0.0013010543,0.00033491632,0.0005321576,0.002145702,0.0005879195],"domain_scores_gemma":[0.9891768,0.0053388467,0.0006914116,0.0027802016,0.0017264788,0.0002862949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043551764,0.0014120525,0.00078306487,0.0018896501,0.0009902522,0.0024107804,0.0021103625,0.00073693116,0.0019793408],"category_scores_gemma":[0.010534721,0.00075505406,0.0008790956,0.0016711417,0.0012397285,0.0046647927,0.0013173065,0.0016186428,0.00023765882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003406753,0.0016869782,0.043912753,0.000986339,0.00038120325,0.0008081991,0.0018178265,0.29897195,0.13635384,0.19416122,0.0064000054,0.3111129],"study_design_scores_gemma":[0.00009139623,0.0004569258,0.0025041352,0.00004107382,0.00011593178,0.0001903107,0.0001923659,0.9082106,0.06871248,0.012926746,0.006504915,0.00005306995],"about_ca_topic_score_codex":0.0058921915,"about_ca_topic_score_gemma":0.0035779218,"teacher_disagreement_score":0.0058921915,"about_ca_system_score_codex":0.0022472036,"about_ca_system_score_gemma":0.003186169,"threshold_uncertainty_score":0.023032665},"labels":[],"label_agreement":null},{"id":"W3096891463","doi":"10.14778/3430915.3430932","title":"CoroBase","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Pointer (user interface); Database transaction; Asynchronous communication; Database; Transaction processing system; Software; Operating system; Transaction processing; Online transaction processing; Distributed computing; Computer network; Computer hardware","score_opus":0.014720176867610645,"score_gpt":0.19351069959949013,"score_spread":0.17879052273187948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096891463","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027918983,0.0040511447,0.13497849,0.0018650804,0.0020181516,0.0010741531,0.018218137,0.5451409,0.264735],"genre_scores_gemma":[0.24261737,0.004071204,0.18072727,0.0033881564,0.00066489395,0.0014615243,0.095742434,0.12926611,0.34206104],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978896,0.00016151316,0.00016084466,0.0005788409,0.000893207,0.00031604228],"domain_scores_gemma":[0.99585235,0.00058827666,0.00019308947,0.0016806569,0.0012386993,0.00044705035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018233766,0.0021429248,0.0012421345,0.0013404519,0.0010698457,0.0037304636,0.0054985834,0.0015454207,0.12369068],"category_scores_gemma":[0.0077555627,0.0011257537,0.0010230663,0.0014566109,0.0009903281,0.0066326056,0.0055755773,0.002863758,0.075562336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051343227,0.0005515378,0.003264785,0.0022309478,0.00020726719,0.00070149294,0.00070708344,0.0033075134,0.047762297,0.047898926,0.61248976,0.2757442],"study_design_scores_gemma":[0.00057098904,0.00033975867,0.0010935575,0.0001856536,0.000059412232,0.0006308969,0.00011338813,0.01284989,0.024632823,0.013542721,0.945857,0.00012382986],"about_ca_topic_score_codex":0.0036130268,"about_ca_topic_score_gemma":0.0030448574,"teacher_disagreement_score":0.12369068,"about_ca_system_score_codex":0.0011359699,"about_ca_system_score_gemma":0.0023644755,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3101241038","doi":"","title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.","year":2018,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge sort; Exploit; Computer science; Sorting; Overhead (engineering); Implementation; Sorting algorithm; Parallel computing; Sorting network; Algorithm; Operating system","score_opus":0.06278732108924912,"score_gpt":0.35710141577082766,"score_spread":0.29431409468157854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101241038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046901338,0.001344218,0.92421097,0.00034863022,0.00021998466,0.00026623832,0.0005576785,0.016786093,0.009364857],"genre_scores_gemma":[0.22537218,0.00063411077,0.76335853,0.00023973898,0.00008695971,0.00036182767,0.0014966477,0.0023476605,0.0061023235],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840975,0.00034743984,0.00013034066,0.0003213091,0.0005824446,0.00020868839],"domain_scores_gemma":[0.99616313,0.0013431686,0.00036494638,0.0015532773,0.00038651004,0.0001889329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039383,0.0016013844,0.00090991386,0.0012829658,0.0009368307,0.0015805771,0.003270176,0.0016070128,0.007201441],"category_scores_gemma":[0.010679214,0.0010121014,0.00087007094,0.00220011,0.0011278329,0.004188862,0.002504853,0.0015267287,0.004499943],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013805241,0.0003821287,0.0032173235,0.00071517855,0.00025338784,0.00025571953,0.0006126348,0.19387738,0.036181565,0.050208755,0.029024184,0.68389124],"study_design_scores_gemma":[0.00038878544,0.0004551609,0.00068695657,0.00009677616,0.00012430051,0.00056394393,0.00026424235,0.82213205,0.03424698,0.10730148,0.033638682,0.000100639256],"about_ca_topic_score_codex":0.0014166732,"about_ca_topic_score_gemma":0.003362155,"teacher_disagreement_score":0.007201441,"about_ca_system_score_codex":0.00077379885,"about_ca_system_score_gemma":0.002690922,"threshold_uncertainty_score":0.024091184},"labels":[],"label_agreement":null},{"id":"W3108374041","doi":"10.1145/3386367.3431291","title":"Domino","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Domino; Computer science; Timestamp; Replica; Commit; Latency (audio); Domino effect; Computer network; Protocol (science); Replication (statistics); Distributed computing; Database; Telecommunications","score_opus":0.019932537763349866,"score_gpt":0.20536670643748328,"score_spread":0.18543416867413343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108374041","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009224819,0.003963807,0.13866228,0.006952705,0.0042044115,0.0007061187,0.004937137,0.025777701,0.80557096],"genre_scores_gemma":[0.10885987,0.0056963963,0.1078253,0.007246691,0.0017442054,0.0011254431,0.013216695,0.009653987,0.74463135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851304,0.00021891962,0.00007142409,0.00028374456,0.0006599367,0.0002529549],"domain_scores_gemma":[0.99820006,0.00030991947,0.000089871355,0.0005218291,0.00055925304,0.00031910028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011474628,0.00077051524,0.000539455,0.0015871268,0.0016684064,0.0033686499,0.0022137708,0.0011801505,0.08615752],"category_scores_gemma":[0.0035703243,0.00041944173,0.0005345647,0.0011058779,0.00084711646,0.004151843,0.004606132,0.0016843235,0.032648593],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000453274,0.00014820174,0.0016693159,0.00067283725,0.00003160264,0.00045017464,0.0005467197,0.0016539543,0.009570975,0.19317402,0.36228153,0.42934737],"study_design_scores_gemma":[0.000022604843,0.000022831902,0.00018936157,0.000055707038,0.0000063727794,0.00017202017,0.00004303278,0.0011239001,0.0011045473,0.008550242,0.9886923,0.000017145177],"about_ca_topic_score_codex":0.0023822384,"about_ca_topic_score_gemma":0.0037260994,"teacher_disagreement_score":0.08615752,"about_ca_system_score_codex":0.0012388014,"about_ca_system_score_gemma":0.0019246845,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3108573523","doi":"10.1109/tvt.2020.3040817","title":"Formal Verification and Performance Analysis of a New Data Exchange Protocol for Connected Vehicles","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MQTT; Computer science; Message queue; Correctness; Protocol (science); Promela; Workload; Computer network; Context (archaeology); Distributed computing; Protocol data unit; Real-time computing; Model checking; Database; Embedded system; Operating system; Programming language; Network packet","score_opus":0.059836279401445695,"score_gpt":0.2963799131618651,"score_spread":0.23654363376041943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108573523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030679004,0.00017585701,0.9637605,0.00031010204,0.00009103109,0.00023969414,0.00014502926,0.0013297988,0.0032689632],"genre_scores_gemma":[0.8060341,0.00034669798,0.18883628,0.00013903237,0.00008855101,0.0004996893,0.00038805365,0.00021764658,0.003449869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373806,0.001530451,0.00042942414,0.00075525255,0.00302496,0.0005218228],"domain_scores_gemma":[0.9923815,0.004373857,0.00066133554,0.0010582716,0.001390459,0.00013458775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540196,0.00068184984,0.00060586777,0.0011416837,0.0007704312,0.0024723245,0.0015621441,0.0011636845,0.0025457612],"category_scores_gemma":[0.013926051,0.0005185144,0.0014318322,0.0005939999,0.0024125343,0.0023166067,0.0020807388,0.0017399896,0.00034979722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003662754,0.00029740727,0.0028023692,0.00070560916,0.0001544468,0.0010627691,0.0006044709,0.5280278,0.029041436,0.3947007,0.0018012578,0.04043548],"study_design_scores_gemma":[0.00008696368,0.0001521817,0.0003020318,0.000050948533,0.00006174734,0.00015288386,0.00004356147,0.95055956,0.011766747,0.031903103,0.004893191,0.000027173895],"about_ca_topic_score_codex":0.0045947228,"about_ca_topic_score_gemma":0.0024215886,"teacher_disagreement_score":0.0045947228,"about_ca_system_score_codex":0.0018969381,"about_ca_system_score_gemma":0.0032201644,"threshold_uncertainty_score":0.024011135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027750533701888305,"score_gpt":0.246189855091322,"score_spread":0.21843932138943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109383821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982088,0.0038744872,0.044282787,0.017355002,0.00020700795,0.00010531139,0.0008608329,0.0026190889,0.03248673],"genre_scores_gemma":[0.9635151,0.002269609,0.019579098,0.0034653011,0.00009602016,0.00013602701,0.0009056725,0.002179051,0.007854161],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9833333,0.0053529623,0.0008417261,0.0025970717,0.006870961,0.0010038303],"domain_scores_gemma":[0.8764629,0.060453337,0.025814507,0.015709369,0.019696368,0.0018635163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010642822,0.00044467064,0.00040550964,0.0038014825,0.0017751694,0.0040950044,0.0014912816,0.0015101251,0.002046274],"category_scores_gemma":[0.107233025,0.0009990128,0.00040268,0.0042106886,0.0056593157,0.010437243,0.003476636,0.0022965763,0.0015545512],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001421769,0.000124158,0.22549278,0.0012862331,0.0000984301,0.0014339263,0.29428235,0.0010121306,0.010353592,0.032576196,0.028142868,0.40505508],"study_design_scores_gemma":[0.000058920115,0.00036370268,0.27497548,0.0023677659,0.00014462817,0.008272327,0.16173266,0.006653406,0.018399052,0.04660614,0.480016,0.00040992265],"about_ca_topic_score_codex":0.004593227,"about_ca_topic_score_gemma":0.0056083878,"teacher_disagreement_score":0.010642822,"about_ca_system_score_codex":0.001578135,"about_ca_system_score_gemma":0.0026634613,"threshold_uncertainty_score":0.05628532},"labels":[],"label_agreement":null},{"id":"W3112299185","doi":"10.1109/smc42975.2020.9283302","title":"Trust in Multi-Vehicle Systems Using MDP Control Strategies","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Markov decision process; Protocol (science); Channel (broadcasting); Encryption; Control (management); Markov process; Markov chain; Computer network; Computer security; Artificial intelligence","score_opus":0.05378556291756914,"score_gpt":0.27372729009137087,"score_spread":0.21994172717380173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112299185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030364415,0.00025824248,0.9654412,0.0004269637,0.00004607441,0.00012070764,0.00002486922,0.00015579993,0.0031617426],"genre_scores_gemma":[0.91962284,0.0002781746,0.077908605,0.000078315774,0.00003451671,0.00024244457,0.000035338086,0.000029178997,0.0017706363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976548,0.0009869193,0.00017618394,0.00031602758,0.00063006766,0.0002359941],"domain_scores_gemma":[0.9943586,0.00383739,0.0006429143,0.0004290136,0.0004492394,0.0002828056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863788,0.00092529017,0.0011119547,0.00067454367,0.0010505164,0.0019381663,0.0015630719,0.0014103344,0.0011375042],"category_scores_gemma":[0.008293939,0.000526319,0.000748347,0.0004944783,0.0025476252,0.0021398938,0.0030711025,0.0015704602,0.00015726718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072642135,0.00003490404,0.0005580124,0.000068369176,0.000047694837,0.00022229341,0.000186038,0.9165042,0.0012869615,0.06956795,0.00021786334,0.011233056],"study_design_scores_gemma":[0.00002346688,0.00003358486,0.00004415156,0.00000827232,0.000009085705,0.000020297139,0.000021620828,0.97606987,0.00050721155,0.022639755,0.0006138047,0.000008921501],"about_ca_topic_score_codex":0.0058630286,"about_ca_topic_score_gemma":0.002628742,"teacher_disagreement_score":0.0058630286,"about_ca_system_score_codex":0.0017814009,"about_ca_system_score_gemma":0.0019164691,"threshold_uncertainty_score":0.015145361},"labels":[],"label_agreement":null},{"id":"W3112375100","doi":"10.1109/tc.2020.3044234","title":"Speculative Barriers With Transactional Memory","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Transactional memory; Computer science; Thread (computing); Parallel computing; Transaction processing; Operating system; Database transaction; Speculative multithreading; Speculative execution; Concurrency control; Speculation; Transactional leadership; Leverage (statistics); Commit; Programming language; Multithreading; Database; Artificial intelligence","score_opus":0.014166590642790959,"score_gpt":0.20932990562909903,"score_spread":0.19516331498630807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112375100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05243218,0.0019359661,0.91693324,0.00082401687,0.00029103635,0.00029811088,0.00013601784,0.012393375,0.014756047],"genre_scores_gemma":[0.5806624,0.0009337719,0.4042249,0.0005465112,0.00013888086,0.00041317538,0.00027857997,0.0015072004,0.011294593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972451,0.00063890085,0.00027879185,0.00031769965,0.0012272622,0.0002923715],"domain_scores_gemma":[0.99357635,0.0015711725,0.00060458155,0.0032322055,0.0007869217,0.00022881462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020509202,0.0007554369,0.0004644308,0.00077303714,0.0007705788,0.0030354937,0.0035215456,0.0011215963,0.0044622202],"category_scores_gemma":[0.0081542665,0.0009425935,0.0006773985,0.001048712,0.0018216097,0.0058606747,0.0037546128,0.0023633768,0.0012241517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014361417,0.0003139337,0.0095705055,0.0013102308,0.00019981738,0.0013043537,0.0037303863,0.067849,0.068025984,0.49909952,0.01655383,0.33060637],"study_design_scores_gemma":[0.00030123166,0.0006860926,0.0013653061,0.00038244663,0.00025279695,0.0013092378,0.00054191356,0.48219004,0.13372919,0.19000247,0.18901502,0.00022427134],"about_ca_topic_score_codex":0.0019564526,"about_ca_topic_score_gemma":0.0017083432,"teacher_disagreement_score":0.0044622202,"about_ca_system_score_codex":0.0009237692,"about_ca_system_score_gemma":0.0019627747,"threshold_uncertainty_score":0.014927566},"labels":[],"label_agreement":null},{"id":"W3114184623","doi":"10.1109/jiot.2021.3100295","title":"A Fast Edge-Based Synchronizer for Tasks in Real-Time Artificial Intelligence Applications","year":2021,"lang":"en","type":"preprint","venue":"IEEE Internet of Things Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Petroleum Technology Development Fund; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Synchronization (alternating current); Synchronizer; Enhanced Data Rates for GSM Evolution; Task (project management); Process (computing); Real-time computing; Distributed computing; Solver; Time point; Artificial intelligence; Channel (broadcasting); Operating system; Computer network","score_opus":0.030158398927245804,"score_gpt":0.2949350467641774,"score_spread":0.2647766478369316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114184623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05319211,0.00017040367,0.9373763,0.00019706241,0.00015280553,0.00015177726,0.00008240096,0.004316176,0.004361017],"genre_scores_gemma":[0.7228306,0.00009562769,0.27141532,0.00022101257,0.00005262516,0.00018262488,0.00023073444,0.00024664355,0.004724894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.00018234267,0.000057336412,0.00018912149,0.00027525937,0.00014891675],"domain_scores_gemma":[0.99850535,0.0003621126,0.00014153855,0.0005023222,0.00032817686,0.00016053997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011155045,0.00057917077,0.00054378004,0.00060925964,0.00084263954,0.00084106886,0.0019574882,0.0008358263,0.0035577118],"category_scores_gemma":[0.002790051,0.00030156365,0.00031161928,0.00055982993,0.00071718247,0.001515735,0.0016757756,0.0012476626,0.0009766291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029755859,0.0008567857,0.0056073642,0.0002838451,0.00010189501,0.0004566918,0.0008017263,0.41186583,0.08233326,0.059764363,0.019460712,0.4154919],"study_design_scores_gemma":[0.00014723318,0.0003622995,0.00075986004,0.000014561677,0.00002344493,0.000088663204,0.00006867311,0.95112145,0.031884298,0.006717077,0.008779341,0.000033075838],"about_ca_topic_score_codex":0.0024785106,"about_ca_topic_score_gemma":0.0035141292,"teacher_disagreement_score":0.0035577118,"about_ca_system_score_codex":0.0007323142,"about_ca_system_score_gemma":0.0018032084,"threshold_uncertainty_score":0.011901736},"labels":[],"label_agreement":null},{"id":"W3117698339","doi":"10.48550/arxiv.2012.14542","title":"NBR: Neutralization Based Reclamation","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Handshaking; Parallel computing; Blocking (statistics); Algorithm; Computer hardware; Computer network","score_opus":0.09417759751787926,"score_gpt":0.18580604220689168,"score_spread":0.09162844468901242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117698339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05903939,0.0024112212,0.871352,0.00064258557,0.00051810034,0.0003718929,0.000640349,0.052661646,0.012362831],"genre_scores_gemma":[0.33921188,0.00077711657,0.6244264,0.0011026652,0.00013254881,0.00054945034,0.0025338263,0.0055993074,0.0256667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792385,0.00028362474,0.00023490904,0.0004228129,0.0007758637,0.00035881612],"domain_scores_gemma":[0.9964438,0.0005878465,0.00045919226,0.0014399254,0.00091553904,0.00015358954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505953,0.0011695453,0.0010847611,0.0012070518,0.0011329212,0.001467393,0.004697612,0.00088961073,0.007988898],"category_scores_gemma":[0.0037933781,0.0005683646,0.0009869325,0.00089343585,0.0012405377,0.003218734,0.0031205988,0.0014224829,0.005449363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021372072,0.0003534693,0.0060980353,0.00090408185,0.00014657961,0.0002775876,0.000999577,0.030289201,0.09838836,0.028408818,0.048817467,0.7831796],"study_design_scores_gemma":[0.00060329825,0.0012488005,0.0026918675,0.00026710375,0.00029845128,0.001087101,0.000621497,0.4593604,0.25589538,0.045045212,0.23252742,0.00035352175],"about_ca_topic_score_codex":0.005009486,"about_ca_topic_score_gemma":0.0056077866,"teacher_disagreement_score":0.007988898,"about_ca_system_score_codex":0.0011993713,"about_ca_system_score_gemma":0.00273654,"threshold_uncertainty_score":0.02672553},"labels":[],"label_agreement":null},{"id":"W3122550826","doi":"10.1016/j.jaccpubpol.2004.12.004","title":"Minimizing cost of continuous audit: Counting and time dependent strategies","year":2005,"lang":"en","type":"article","venue":"Journal of Accounting and Public Policy","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Audit; Computer science; Database; Schema (genetic algorithms); Information security audit; Focus (optics); Accounting; Information retrieval; Business; Computer security","score_opus":0.011525114628740604,"score_gpt":0.2563418612396307,"score_spread":0.2448167466108901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122550826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20830916,0.0012466066,0.7744537,0.0023249034,0.00015340543,0.0003123549,0.00023408762,0.0007370852,0.012228757],"genre_scores_gemma":[0.9222071,0.0002912648,0.07405186,0.00012760387,0.00009578558,0.0001106796,0.00007065501,0.000083810286,0.0029613397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917548,0.0041447673,0.00040543522,0.000766374,0.0017214958,0.0012071546],"domain_scores_gemma":[0.9311474,0.053752046,0.004129439,0.0049810996,0.0041601006,0.0018299174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009834336,0.0015387293,0.002750727,0.0022508993,0.0009054638,0.0047283648,0.0033040189,0.0027971286,0.0036437078],"category_scores_gemma":[0.057336383,0.0008764977,0.00088875415,0.0022581858,0.001481369,0.0066529443,0.0020086572,0.002276164,0.00036765618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019830712,0.000590783,0.00548517,0.00028632363,0.00021205838,0.00014075813,0.00027941808,0.57979524,0.0037647355,0.13933921,0.004454394,0.2636689],"study_design_scores_gemma":[0.000081886275,0.00018377382,0.0009810907,0.00003864251,0.00008255686,0.000110281384,0.0000835179,0.9224019,0.0017403322,0.07358853,0.00067126285,0.00003620713],"about_ca_topic_score_codex":0.0035126663,"about_ca_topic_score_gemma":0.0027126586,"teacher_disagreement_score":0.009834336,"about_ca_system_score_codex":0.0029225743,"about_ca_system_score_gemma":0.0052370653,"threshold_uncertainty_score":0.052009523},"labels":[],"label_agreement":null},{"id":"W3123628531","doi":"10.1109/globecom42002.2020.9322641","title":"Multiple entry point PBFT for IoT systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Byzantine fault tolerance; Computer science; Consensus algorithm; Internet of Things; Distributed computing; Reservation; Node (physics); Bandwidth (computing); Computer network; Software deployment; Quantum Byzantine agreement; Fault tolerance; Algorithm; Computer security; Engineering","score_opus":0.02482386617896222,"score_gpt":0.22977110784877686,"score_spread":0.20494724166981465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123628531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01627603,0.0002439369,0.97997653,0.0001856376,0.00006794574,0.0000643025,0.000015347941,0.00028871998,0.0028815402],"genre_scores_gemma":[0.8701396,0.00045519057,0.1205173,0.00009434344,0.00007763604,0.00022703112,0.000069654976,0.000062458865,0.008356817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.00015988757,0.00001970596,0.00009351097,0.00017425223,0.00006588717],"domain_scores_gemma":[0.99952257,0.00020841969,0.00006388188,0.00006799938,0.00010781348,0.000029368673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068841287,0.0005318568,0.00063900475,0.00034320395,0.00069393637,0.00076837017,0.0008832003,0.00076524017,0.0029533445],"category_scores_gemma":[0.0020004981,0.00019477766,0.00038429556,0.00037383626,0.00063301926,0.0013078232,0.001080517,0.0012809609,0.0005040704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013518558,0.000062113206,0.00055829587,0.00017751957,0.00003149209,0.00032795835,0.0002925056,0.78083265,0.010200869,0.11774817,0.002860636,0.086772494],"study_design_scores_gemma":[0.000017150294,0.000067660876,0.000059452952,0.000009590361,0.000004655396,0.000045096545,0.0000259724,0.97155374,0.0010830223,0.025436668,0.0016894264,0.0000075244243],"about_ca_topic_score_codex":0.001834073,"about_ca_topic_score_gemma":0.0016403783,"teacher_disagreement_score":0.0029533445,"about_ca_system_score_codex":0.00067311287,"about_ca_system_score_gemma":0.00084437965,"threshold_uncertainty_score":0.009879947},"labels":[],"label_agreement":null},{"id":"W3127457110","doi":"10.1145/3197406.3197420","title":"Proving PACELC","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Liveness; Computer science; Scalability; Consistency (knowledge bases); Partition (number theory); Cache coherence; Latency (audio); Model checking; Theoretical computer science; Distributed computing; Computer network; Mathematics; Artificial intelligence; Operating system; Combinatorics; Telecommunications","score_opus":0.019268048982181377,"score_gpt":0.2635805219920797,"score_spread":0.24431247300989833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127457110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013427892,0.00071443006,0.8992668,0.008405701,0.00089127774,0.0003410527,0.0017310987,0.005275622,0.06994613],"genre_scores_gemma":[0.5160457,0.002408867,0.42844167,0.0141695095,0.0031157453,0.0021638626,0.006330343,0.003400212,0.023924004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98522156,0.0025521733,0.00097103306,0.0028922851,0.005967677,0.0023953328],"domain_scores_gemma":[0.9375768,0.03967018,0.002656097,0.006962692,0.011619205,0.0015151299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01093919,0.0017861105,0.0013994257,0.002364075,0.003176633,0.007067823,0.004343834,0.0033045686,0.020976773],"category_scores_gemma":[0.05751134,0.0018410112,0.0049341954,0.0022107342,0.0072652637,0.018269785,0.013692968,0.010270284,0.005868962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010620579,0.00013072796,0.0013036398,0.00053040945,0.0000752966,0.0005111224,0.00060452265,0.011454218,0.0028124673,0.9307562,0.023100607,0.028614463],"study_design_scores_gemma":[0.000087217646,0.00006506616,0.00020762239,0.00012839361,0.000052744817,0.00029301213,0.0002458718,0.03248467,0.0044753193,0.92491347,0.037004914,0.000041722556],"about_ca_topic_score_codex":0.003644255,"about_ca_topic_score_gemma":0.0030359956,"teacher_disagreement_score":0.020976773,"about_ca_system_score_codex":0.0040515317,"about_ca_system_score_gemma":0.0056619025,"threshold_uncertainty_score":0.07017434},"labels":[],"label_agreement":null},{"id":"W3128777472","doi":"10.1145/3394885.3431556","title":"High-Level Synthesis of Transactional Memory","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transactional memory; Synchronization (alternating current); Lock (firearm); Semaphore; Software transactional memory; Parallel computing; Embedded system; Mutual exclusion; Electronic circuit; Computer architecture; Database transaction; Distributed computing; Operating system; Computer network; Channel (broadcasting)","score_opus":0.01935861922073072,"score_gpt":0.22069700044610444,"score_spread":0.20133838122537373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128777472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104102805,0.0013708139,0.86789626,0.00026238477,0.00018093166,0.00016570241,0.0006013068,0.004776161,0.020643575],"genre_scores_gemma":[0.6724511,0.0005538211,0.32172835,0.00011390856,0.000045955934,0.00027488836,0.00063339586,0.00045778454,0.0037407854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996383,0.000055731223,0.000030350924,0.000059779075,0.00015628316,0.00005958874],"domain_scores_gemma":[0.9996107,0.00013447022,0.000044775577,0.00008701463,0.00010528621,0.00001762833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592897,0.00034997737,0.00029483737,0.00035452843,0.0002307675,0.00070921506,0.00093852554,0.00036620098,0.003785389],"category_scores_gemma":[0.0009762187,0.00020816931,0.00035248027,0.000440889,0.00028195878,0.000554268,0.00031393685,0.00044267546,0.0006172662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031898188,0.00018869912,0.001556738,0.0011514548,0.00008883432,0.00048792848,0.00022067096,0.39780432,0.24386065,0.09827357,0.0072689806,0.24877912],"study_design_scores_gemma":[0.00010473353,0.00043222634,0.00041396022,0.000060582868,0.00005344278,0.00015092564,0.000041988667,0.75477624,0.20095919,0.01950603,0.023474708,0.00002594758],"about_ca_topic_score_codex":0.0008626423,"about_ca_topic_score_gemma":0.0011938842,"teacher_disagreement_score":0.003785389,"about_ca_system_score_codex":0.0005918167,"about_ca_system_score_gemma":0.0008650627,"threshold_uncertainty_score":0.012663424},"labels":[],"label_agreement":null},{"id":"W3129064767","doi":"10.1093/milmed/usab048","title":"On MoCAs and Bunker Pants","year":2021,"lang":"en","type":"article","venue":"Military Medicine","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bunker; Medicine; Medical emergency; Geography; Archaeology; Coal","score_opus":0.013831491243650483,"score_gpt":0.24697659059124613,"score_spread":0.23314509934759564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129064767","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03559284,0.055716615,0.11857867,0.07831014,0.018318495,0.0024024455,0.01630591,0.012509454,0.6622655],"genre_scores_gemma":[0.13611653,0.065086156,0.12815773,0.022640757,0.0053613544,0.000930343,0.011760368,0.0020390297,0.6279077],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992268,0.00017673,0.00005855402,0.00008661947,0.00040230216,0.000048918533],"domain_scores_gemma":[0.9984658,0.00031408062,0.00004482182,0.00012633973,0.0009551256,0.000093882176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009487375,0.0010850267,0.0005040964,0.003763257,0.00066412316,0.0013427198,0.0012610693,0.0010792259,0.05945712],"category_scores_gemma":[0.00707252,0.0003147742,0.0005109819,0.0017686305,0.0007528455,0.0020249516,0.0010094696,0.0011470354,0.036493488],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024406503,0.00011962193,0.0042282026,0.00017397554,0.000028453669,0.0007131568,0.0001635342,0.00036080877,0.0010133189,0.00703881,0.35200968,0.63390636],"study_design_scores_gemma":[0.00009849018,0.00017917425,0.013419904,0.0008155056,0.00007002807,0.0042748377,0.00042728544,0.0016095017,0.0021421139,0.01634419,0.9605447,0.00007424056],"about_ca_topic_score_codex":0.022307906,"about_ca_topic_score_gemma":0.04295474,"teacher_disagreement_score":0.05945712,"about_ca_system_score_codex":0.00085707224,"about_ca_system_score_gemma":0.0014860654,"threshold_uncertainty_score":0.19890392},"labels":[],"label_agreement":null},{"id":"W3129069889","doi":"","title":"The Hartlib Papers. Database","year":2020,"lang":"en","type":"article","venue":"Renaissance and Reformation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Database; Computer science; History","score_opus":0.01594440524513191,"score_gpt":0.2242018995742053,"score_spread":0.2082574943290734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129069889","genre_codex":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009231359,0.015539863,0.0051505994,0.030559355,0.026430706,0.00020149369,0.11093148,0.010296509,0.799967],"genre_scores_gemma":[0.0053265397,0.0091048945,0.0020942776,0.0048291814,0.0046781353,0.0000995917,0.04914479,0.0040906924,0.920632],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795556,0.00024714618,0.00021415946,0.00031402792,0.0010953494,0.00017374483],"domain_scores_gemma":[0.99284077,0.0012210244,0.000509642,0.0020809164,0.0022554577,0.0010921148],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018606661,0.0013990779,0.0022957951,0.00901313,0.0020142328,0.014770537,0.0028417367,0.0023069945,0.66185635],"category_scores_gemma":[0.010675885,0.0009910115,0.0007010237,0.01625461,0.0012079553,0.007629181,0.0030161007,0.0027524396,0.6738452],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034089673,0.000016318432,0.000089956106,0.00012504196,0.000004452838,0.000010193833,0.000009601331,0.000044228505,0.0000596722,0.0036237915,0.9488737,0.04710905],"study_design_scores_gemma":[0.00001680822,0.000004934026,0.00016772265,0.00008317131,0.0000041819944,0.000017809114,0.00001810087,0.000067882764,0.00014544853,0.002811891,0.9966539,0.000008122276],"about_ca_topic_score_codex":0.008351647,"about_ca_topic_score_gemma":0.009543236,"teacher_disagreement_score":0.66185635,"about_ca_system_score_codex":0.0027889048,"about_ca_system_score_gemma":0.0033256079,"threshold_uncertainty_score":0.48232085},"labels":[],"label_agreement":null},{"id":"W3131743673","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Population; Medicine; Environmental health","score_opus":0.02080968731075352,"score_gpt":0.28884518879494614,"score_spread":0.26803550148419264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131743673","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018180057,0.005960343,0.82857317,0.03844736,0.013155864,0.0005632064,0.005467041,0.014103807,0.07554922],"genre_scores_gemma":[0.5341469,0.012506549,0.27378812,0.014759389,0.01297073,0.002555979,0.01741125,0.005064827,0.12679635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980021,0.0008192939,0.00007055248,0.00032775194,0.0005599391,0.00022026771],"domain_scores_gemma":[0.9946708,0.0031527579,0.00022911036,0.0009097672,0.0005711796,0.00046637238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021511212,0.0010006479,0.0008920663,0.0007903346,0.0011579595,0.0022452008,0.0023634331,0.0025774243,0.036226448],"category_scores_gemma":[0.01816338,0.0007333786,0.0009118115,0.0016260303,0.0010794973,0.005603061,0.0021686638,0.004565691,0.00928976],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006275358,0.00012660027,0.0010098253,0.0005767683,0.00012730878,0.00028952857,0.00022580755,0.04999017,0.004954684,0.36597317,0.45929047,0.11680826],"study_design_scores_gemma":[0.00038184668,0.00020917655,0.00060958555,0.00014791782,0.0000737537,0.0003678663,0.000073082934,0.2661577,0.0039682398,0.394733,0.33316684,0.000111005626],"about_ca_topic_score_codex":0.001709438,"about_ca_topic_score_gemma":0.0022973402,"teacher_disagreement_score":0.036226448,"about_ca_system_score_codex":0.0020142847,"about_ca_system_score_gemma":0.0014213482,"threshold_uncertainty_score":0.121189535},"labels":[],"label_agreement":null},{"id":"W3133445000","doi":"10.1145/3437801.3441625","title":"NBR","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pointer (user interface); Parallel computing; Compiler; Bounding overwatch; Hazard; Algorithm; Programming language; Computer hardware; Artificial intelligence","score_opus":0.008263675562000961,"score_gpt":0.21618034115053883,"score_spread":0.20791666558853786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133445000","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100825885,0.0031326327,0.13675596,0.0023522412,0.0035446754,0.00042497987,0.012332363,0.024286099,0.8070885],"genre_scores_gemma":[0.09232214,0.002678226,0.111590765,0.0026194805,0.0006274773,0.0006004983,0.03493232,0.007149814,0.7474792],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985764,0.00012829335,0.00009517618,0.00034245214,0.0006784324,0.00017923242],"domain_scores_gemma":[0.9976271,0.00016237526,0.00009359226,0.00072567654,0.0012121554,0.00017925237],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010138366,0.0007793341,0.00080826145,0.0014707246,0.0014627491,0.0025990088,0.0019850763,0.0011452341,0.15970922],"category_scores_gemma":[0.0033924668,0.00038701523,0.00049756386,0.0011994456,0.00049535744,0.0024267684,0.0022717307,0.0012608777,0.16967563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052342494,0.00011591307,0.0019792658,0.0005796328,0.00003256819,0.0001985907,0.00021588757,0.0030522998,0.01727792,0.053939365,0.40187615,0.520209],"study_design_scores_gemma":[0.000028548346,0.00003846571,0.0005920358,0.00010395859,0.000016075684,0.00018229491,0.000070483125,0.0043112314,0.008636424,0.007634272,0.97836363,0.0000226509],"about_ca_topic_score_codex":0.0070757386,"about_ca_topic_score_gemma":0.008428135,"teacher_disagreement_score":0.8402908,"about_ca_system_score_codex":0.0014539189,"about_ca_system_score_gemma":0.002014441,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3135491762","doi":"10.48550/arxiv.2102.13242","title":"On Register Linearizability and Termination","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linearizability; Correctness; Impossibility; Computer science; Algorithm","score_opus":0.05467048063850892,"score_gpt":0.18574305727792662,"score_spread":0.13107257663941768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135491762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039435994,0.0019121448,0.9126036,0.0062519386,0.00048351934,0.0003024678,0.00014640174,0.0030189948,0.0358448],"genre_scores_gemma":[0.77021325,0.002464334,0.18593173,0.004781163,0.0020750733,0.0017289063,0.0005266092,0.0019655076,0.030313393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97710687,0.006270413,0.001835206,0.005384165,0.0057705953,0.003632745],"domain_scores_gemma":[0.92112964,0.053549357,0.004363204,0.014740405,0.0052596517,0.0009577861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009913071,0.0014397983,0.002005681,0.0019257831,0.0030264866,0.0042126407,0.002848426,0.0030115873,0.008609571],"category_scores_gemma":[0.051498648,0.0013280514,0.0028683217,0.0020475716,0.016443294,0.01734459,0.0087529775,0.011684477,0.0018889848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003382166,0.00012772228,0.0015605321,0.00027813748,0.0000585828,0.00025061288,0.0008455992,0.025182147,0.0036388217,0.9229476,0.0033620074,0.041409954],"study_design_scores_gemma":[0.00017509426,0.00019664198,0.00033154944,0.00014442763,0.000072910625,0.00018821865,0.00011013387,0.06995065,0.007463713,0.9114847,0.0098142065,0.00006775252],"about_ca_topic_score_codex":0.002710402,"about_ca_topic_score_gemma":0.0012700931,"teacher_disagreement_score":0.009913071,"about_ca_system_score_codex":0.0039462987,"about_ca_system_score_gemma":0.0034153229,"threshold_uncertainty_score":0.05242598},"labels":[],"label_agreement":null},{"id":"W3136409268","doi":"10.1145/2576966.2582994","title":"Eventually Consistent: Not What You Were Expecting?","year":2014,"lang":"en","type":"article","venue":"Queue","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NoSQL; Scalability; Computer science; Key (lock); The Internet; World Wide Web; Simple (philosophy); Database; Value (mathematics); Foundation (evidence); Data science; Computer security","score_opus":0.012322795548579691,"score_gpt":0.2317083311408225,"score_spread":0.21938553559224283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136409268","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05453815,0.004357413,0.13904385,0.64777523,0.011373411,0.00025749666,0.0017398471,0.0027990262,0.13811551],"genre_scores_gemma":[0.66467595,0.004431075,0.08261352,0.12709653,0.002752443,0.00030314535,0.0015428029,0.0028007352,0.113783814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945216,0.0019448615,0.00032016283,0.00093452126,0.001619851,0.0006588991],"domain_scores_gemma":[0.9766217,0.004895161,0.0014082427,0.0044240477,0.01021971,0.0024311887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009992996,0.00057109655,0.0005081151,0.0005482383,0.0035348127,0.006437868,0.0018399977,0.0032655287,0.015114307],"category_scores_gemma":[0.04840637,0.0005523465,0.0006738703,0.0006255568,0.006338588,0.01758928,0.0025060305,0.008234174,0.006524446],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000409713,0.0002449947,0.023098655,0.0006259895,0.00014505105,0.0028672644,0.01987304,0.0013340593,0.005022789,0.41141608,0.35308027,0.18188207],"study_design_scores_gemma":[0.00005532851,0.00019817436,0.0032984363,0.0005951491,0.000080533224,0.0022708597,0.012783186,0.0026447058,0.003221429,0.31276456,0.6619116,0.0001761087],"about_ca_topic_score_codex":0.005096178,"about_ca_topic_score_gemma":0.0054753316,"teacher_disagreement_score":0.015114307,"about_ca_system_score_codex":0.0021525288,"about_ca_system_score_gemma":0.0034841546,"threshold_uncertainty_score":0.052848697},"labels":[],"label_agreement":null},{"id":"W3136436623","doi":"10.1145/3255826","title":"Session details: Demonstrations","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.011741178796608449,"score_gpt":0.23847643823023804,"score_spread":0.2267352594336296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136436623","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006980848,0.0012380717,0.02863853,0.012558374,0.01113039,0.0032911727,0.022648538,0.02655251,0.8869615],"genre_scores_gemma":[0.04571071,0.00097597315,0.010522944,0.001977,0.0010068406,0.0016755003,0.0143150175,0.0035500766,0.920266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993476,0.00010999565,0.000022990273,0.00010690007,0.00025321022,0.00015927806],"domain_scores_gemma":[0.9972785,0.0003504315,0.00005347085,0.00049678277,0.00046279197,0.00135797],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015125487,0.0009768881,0.0008305031,0.00047159177,0.0016871281,0.002399262,0.0016553048,0.0022214763,0.7584984],"category_scores_gemma":[0.0039476748,0.0003691039,0.0008176947,0.00051229674,0.00034794767,0.0020228378,0.0029242283,0.0026732858,0.5317305],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063413975,0.0005236615,0.00015702138,0.00016694287,0.00001027738,0.00008022391,0.000049326198,0.0003978531,0.0017241915,0.0022152213,0.9465734,0.047467727],"study_design_scores_gemma":[0.0004591728,0.00050524663,0.0011824211,0.00009859167,0.000014883243,0.00013581461,0.00013256678,0.0018566232,0.0025777067,0.005693229,0.9873001,0.000043779215],"about_ca_topic_score_codex":0.0028505696,"about_ca_topic_score_gemma":0.004104747,"teacher_disagreement_score":0.24150163,"about_ca_system_score_codex":0.00072187505,"about_ca_system_score_gemma":0.0012248497,"threshold_uncertainty_score":0.34447277},"labels":[],"label_agreement":null},{"id":"W3136943238","doi":"10.1145/3259399","title":"Session details: Database issues for event-based middleware","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Middleware (distributed applications); Event (particle physics); Database; World Wide Web","score_opus":0.030411022695601905,"score_gpt":0.29840644820014345,"score_spread":0.26799542550454153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136943238","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009767178,0.013062572,0.2167609,0.04679819,0.05204823,0.00227366,0.009151148,0.0144265145,0.63571167],"genre_scores_gemma":[0.08526674,0.009786364,0.025881125,0.0026702483,0.015089457,0.0007914461,0.009025696,0.0027861653,0.8487028],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985197,0.00044488013,0.00011324057,0.00014964443,0.0005514062,0.0002211888],"domain_scores_gemma":[0.9943305,0.0025172937,0.00014440375,0.0011431762,0.0009956176,0.0008690765],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0045614084,0.0008612674,0.0015078923,0.00062088517,0.0025686948,0.006448499,0.002461871,0.0056795185,0.52722883],"category_scores_gemma":[0.008580049,0.0006894161,0.001161582,0.0018321142,0.0006915053,0.005976337,0.0026933264,0.0031504643,0.21910323],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009139365,0.00027674437,0.0005556898,0.0006512052,0.000049529644,0.00046245076,0.00038168387,0.0011266146,0.010272138,0.03669447,0.83246356,0.11615198],"study_design_scores_gemma":[0.00025182602,0.00016333476,0.001041281,0.00014589912,0.00004629204,0.00054016843,0.0001756938,0.004818576,0.0050458116,0.015681654,0.9720239,0.00006562281],"about_ca_topic_score_codex":0.0020043554,"about_ca_topic_score_gemma":0.0020267265,"teacher_disagreement_score":0.47277117,"about_ca_system_score_codex":0.0010160175,"about_ca_system_score_gemma":0.0009851158,"threshold_uncertainty_score":0.6743507},"labels":[],"label_agreement":null},{"id":"W3137028441","doi":"","title":"Classifications of Asynchronous Shared Memory Objects","year":2019,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Asynchronous communication; Computer science; Cognitive science; Psychology; Computer network","score_opus":0.018870382041995305,"score_gpt":0.304574919939986,"score_spread":0.28570453789799066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137028441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24380565,0.0009861512,0.7079275,0.0012627086,0.00044020102,0.00047746813,0.0007035024,0.0018435161,0.04255331],"genre_scores_gemma":[0.8280513,0.0003822802,0.14483935,0.0004103952,0.00029423978,0.0009597956,0.0013679566,0.00028767355,0.02340697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939236,0.0012099831,0.0009809064,0.0011347557,0.0018355872,0.0009151131],"domain_scores_gemma":[0.9850096,0.004027501,0.0018696642,0.0048017018,0.0032433383,0.0010480717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031426118,0.00068971474,0.0008990583,0.0021185544,0.0025981958,0.006139261,0.0026423843,0.0017643421,0.004547137],"category_scores_gemma":[0.015171048,0.00062437984,0.00094991416,0.0015946834,0.0031122556,0.0086382385,0.004725924,0.001964654,0.0014175139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022054056,0.000041426763,0.0036619063,0.00010432362,0.000015440552,0.00019961664,0.0020983473,0.008522238,0.0038981868,0.9513099,0.0022797796,0.02764833],"study_design_scores_gemma":[0.00009589061,0.00014209308,0.001831218,0.00014317447,0.000054474855,0.00032783218,0.0012139645,0.118276685,0.0109902965,0.81022924,0.056618538,0.00007661707],"about_ca_topic_score_codex":0.0015369005,"about_ca_topic_score_gemma":0.0008133232,"teacher_disagreement_score":0.006139261,"about_ca_system_score_codex":0.0027140407,"about_ca_system_score_gemma":0.0015773681,"threshold_uncertainty_score":0.019691825},"labels":[],"label_agreement":null},{"id":"W3137323593","doi":"10.1145/3256141","title":"Session details: Applications","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.03155217866061511,"score_gpt":0.24647439461713894,"score_spread":0.21492221595652383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137323593","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013798532,0.0027621351,0.0041398476,0.007771543,0.018953646,0.0013765133,0.022891596,0.008318192,0.93240666],"genre_scores_gemma":[0.0041249096,0.0011238961,0.00076172914,0.0010527723,0.0017445218,0.0002471506,0.005426862,0.0009308784,0.9845873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939907,0.000087833105,0.000032119668,0.00016211915,0.00020713852,0.00011162718],"domain_scores_gemma":[0.9971107,0.00038788404,0.000056582707,0.0005701145,0.00069033355,0.0011842647],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011794262,0.0014041569,0.0015482759,0.0009589983,0.0020047447,0.005091234,0.0015301112,0.00353573,0.9149036],"category_scores_gemma":[0.0033338033,0.00043100514,0.001169063,0.0013874215,0.00038800968,0.001930247,0.002339664,0.0023571588,0.8902725],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017969025,0.00008430447,0.00009621603,0.00015275499,0.000006839738,0.00004614057,0.0000171911,0.000059122227,0.0007652623,0.00062424236,0.95373017,0.04423813],"study_design_scores_gemma":[0.000060214672,0.00005220985,0.00036296473,0.00005600781,0.0000073516444,0.00005365716,0.000020531235,0.00017410489,0.00037858853,0.00051733473,0.9983084,0.000008567004],"about_ca_topic_score_codex":0.0014731606,"about_ca_topic_score_gemma":0.0029752464,"teacher_disagreement_score":0.08509642,"about_ca_system_score_codex":0.00079558394,"about_ca_system_score_gemma":0.0012077953,"threshold_uncertainty_score":0.12137973},"labels":[],"label_agreement":null},{"id":"W3137729930","doi":"10.1145/2927299.2940294","title":"Debugging Distributed Systems","year":2016,"lang":"en","type":"article","venue":"Queue","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Universities Space Research Association; National Science Foundation","keywords":"Debugging; Computer science; Key (lock); Process (computing); Software engineering; Distributed computing; Software; Programming language; Operating system","score_opus":0.010269769397285222,"score_gpt":0.21726800610362468,"score_spread":0.20699823670633946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137729930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018760933,0.0011190783,0.9510638,0.0017526769,0.0005273566,0.00030004233,0.0005778626,0.013209376,0.01268882],"genre_scores_gemma":[0.4432067,0.0013699924,0.54449034,0.00045181238,0.00019740536,0.00022977409,0.0012995448,0.0016875799,0.0070669344],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99557745,0.0021255384,0.00033078098,0.00051812426,0.0012293387,0.00021886257],"domain_scores_gemma":[0.97917056,0.010912212,0.00095806323,0.0057027335,0.0027937244,0.00046271482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007245965,0.00096181245,0.0007628109,0.0013914488,0.0010142651,0.002688291,0.0017554173,0.0011575939,0.008684032],"category_scores_gemma":[0.037659943,0.0005348626,0.00041665928,0.0011963419,0.0009048691,0.004846711,0.0023118737,0.0016908933,0.0019398669],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044628882,0.00028723644,0.012804238,0.0012296772,0.00016100393,0.0006745256,0.0023611975,0.043625195,0.011825347,0.231674,0.04876654,0.64614475],"study_design_scores_gemma":[0.00039756479,0.00057684776,0.0038957468,0.00070827774,0.00017001122,0.0014803512,0.0014212794,0.38533857,0.03994067,0.3429505,0.2229849,0.00013534862],"about_ca_topic_score_codex":0.0014908655,"about_ca_topic_score_gemma":0.0015062935,"teacher_disagreement_score":0.008684032,"about_ca_system_score_codex":0.0006877522,"about_ca_system_score_gemma":0.0017012772,"threshold_uncertainty_score":0.03832072},"labels":[],"label_agreement":null},{"id":"W3137899974","doi":"10.1145/3245308","title":"Session details: Distributed algorithms and their complexity","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Session (web analytics); Computer science; Algorithm; Theoretical computer science; World Wide Web","score_opus":0.027646046753081462,"score_gpt":0.2455090829122892,"score_spread":0.21786303615920774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137899974","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010766841,0.03174255,0.16946599,0.052553345,0.025072526,0.0011574528,0.012353759,0.0029095446,0.6939779],"genre_scores_gemma":[0.14648351,0.0423542,0.05835318,0.0038495793,0.022582905,0.0017760077,0.011923253,0.0024740575,0.7102034],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863786,0.00037592454,0.0000670854,0.0003047133,0.00044235677,0.00017195543],"domain_scores_gemma":[0.9926698,0.0043110126,0.00016871457,0.0013289894,0.00077763095,0.0007438649],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020519053,0.0014290913,0.0020970341,0.0008958461,0.0018819979,0.0061013745,0.0016001534,0.0027978069,0.3723003],"category_scores_gemma":[0.010478683,0.00060396176,0.0009846602,0.0028900318,0.0010231682,0.0048487633,0.0027557074,0.0041118152,0.10785952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044552004,0.00021015256,0.00067385304,0.0007861707,0.000071172486,0.000092877424,0.00015917186,0.0032772801,0.0025592276,0.12827583,0.66773206,0.19571662],"study_design_scores_gemma":[0.00027405113,0.00015593525,0.0012360394,0.00034871642,0.00008916492,0.000334137,0.00011598628,0.017810812,0.0024818976,0.26189646,0.7151838,0.00007309284],"about_ca_topic_score_codex":0.00079751346,"about_ca_topic_score_gemma":0.0011354857,"teacher_disagreement_score":0.3723003,"about_ca_system_score_codex":0.0018576547,"about_ca_system_score_gemma":0.00178634,"threshold_uncertainty_score":0.89533746},"labels":[],"label_agreement":null},{"id":"W3138551836","doi":"10.1145/3249593","title":"Session details: T3-C: services &amp; applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.00900639409069866,"score_gpt":0.2425708722933997,"score_spread":0.23356447820270101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138551836","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028298064,0.0012181209,0.010035774,0.0041037994,0.008451703,0.0009224708,0.012167945,0.009425651,0.9508448],"genre_scores_gemma":[0.01340134,0.0013515454,0.0022627402,0.0006645931,0.0015117172,0.00025441375,0.006429395,0.0014780136,0.9726461],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996574,0.00004973297,0.000014622024,0.00007776716,0.00009885726,0.00010155738],"domain_scores_gemma":[0.99815136,0.00040074167,0.00002895128,0.00027311273,0.00038306895,0.0007628036],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00093707215,0.0013771193,0.0018386617,0.00073791324,0.002712304,0.004359937,0.0014098671,0.004368693,0.89776176],"category_scores_gemma":[0.0018516972,0.0003939365,0.0012758431,0.00165192,0.0005096935,0.001872748,0.0019043185,0.0022147093,0.82923776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004617146,0.00018070557,0.00023315803,0.00021328413,0.000011202317,0.00010631291,0.00007290561,0.00018360342,0.0033062648,0.0024652516,0.9372434,0.05552211],"study_design_scores_gemma":[0.00011310703,0.00010799678,0.00062618684,0.000058263227,0.000014289283,0.00013509643,0.00007349487,0.0012448551,0.0015325397,0.0014816491,0.99459344,0.000019085684],"about_ca_topic_score_codex":0.0031683303,"about_ca_topic_score_gemma":0.0036921757,"teacher_disagreement_score":0.10223824,"about_ca_system_score_codex":0.000764004,"about_ca_system_score_gemma":0.00091230246,"threshold_uncertainty_score":0.14583045},"labels":[],"label_agreement":null},{"id":"W3138641360","doi":"10.1145/3245312","title":"Session details: Renaming and mutual exclusion","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Session (web analytics); Computer science; Mutual exclusion; Programming language; World Wide Web","score_opus":0.010092196521911049,"score_gpt":0.2247255486306427,"score_spread":0.21463335210873166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138641360","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044668517,0.006880037,0.03985007,0.012855654,0.02022665,0.0012893581,0.008490839,0.0052806763,0.90065986],"genre_scores_gemma":[0.05423317,0.005577735,0.0078109684,0.0012642033,0.005149078,0.00054508634,0.0055600554,0.0011904894,0.91866916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987206,0.00041140465,0.00006191126,0.00027642853,0.0003037404,0.00022591431],"domain_scores_gemma":[0.9959706,0.0017046214,0.00013550675,0.0009784896,0.00048249098,0.00072830246],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018190927,0.0014455327,0.002307066,0.0005923931,0.0027584026,0.004680625,0.0018628354,0.0038737769,0.7552621],"category_scores_gemma":[0.0070797293,0.00039760408,0.0013499213,0.0014457178,0.00086743245,0.0033239853,0.0031761078,0.0020548855,0.41985345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011017239,0.00023766674,0.0003475134,0.0006075988,0.000048641497,0.00015913534,0.00017250353,0.0005680017,0.0038531728,0.026043171,0.8077226,0.15913823],"study_design_scores_gemma":[0.0002379512,0.00017945371,0.0007803761,0.0001357983,0.000040088074,0.00028008,0.00010088564,0.0022307427,0.0023315053,0.015738599,0.97790694,0.00003760062],"about_ca_topic_score_codex":0.0012146547,"about_ca_topic_score_gemma":0.0017243146,"teacher_disagreement_score":0.7552621,"about_ca_system_score_codex":0.0008074351,"about_ca_system_score_gemma":0.0011616953,"threshold_uncertainty_score":0.3490889},"labels":[],"label_agreement":null},{"id":"W3144200734","doi":"10.1109/pact.2007.4336226","title":"JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... Conference on Parallel Architectures and Compilation Techniques/Proceedings of the Conference on Parallel Architectures and Compilation Techniques","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01639795465021082,"score_gpt":0.25059835051288665,"score_spread":0.23420039586267583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144200734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078818165,0.00035371986,0.98070794,0.00014139118,0.000076079676,0.0000823031,0.00006980506,0.006359825,0.004327069],"genre_scores_gemma":[0.17460938,0.0004224718,0.8124536,0.00031218512,0.000087644825,0.00021079369,0.00040488888,0.0016891605,0.009809952],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885404,0.0002568445,0.000097920456,0.00015416161,0.00052734755,0.00010973214],"domain_scores_gemma":[0.99889,0.00029645872,0.00009704275,0.00046248845,0.00021026883,0.000043786753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083506916,0.00051029754,0.00058766146,0.0005636192,0.0005591921,0.0012152606,0.0030159587,0.0007295058,0.0027755084],"category_scores_gemma":[0.0023957163,0.00043197747,0.0007778973,0.0006246825,0.0009672471,0.0013729634,0.0013600852,0.0014050672,0.0009910398],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003297253,0.00023841514,0.0014803829,0.00056838186,0.00010639395,0.0008084123,0.00081010023,0.0770576,0.12783511,0.22304747,0.01549323,0.55222476],"study_design_scores_gemma":[0.000113146,0.0003605511,0.00055891887,0.00009100906,0.00013202323,0.0011440988,0.000127091,0.663342,0.15102413,0.07849326,0.104500175,0.000113541406],"about_ca_topic_score_codex":0.001629938,"about_ca_topic_score_gemma":0.0024051217,"teacher_disagreement_score":0.0030159587,"about_ca_system_score_codex":0.00070072484,"about_ca_system_score_gemma":0.0009598004,"threshold_uncertainty_score":0.009285033},"labels":[],"label_agreement":null},{"id":"W3147804948","doi":"10.1007/978-3-642-35476-2","title":"Principles of Distributed Systems","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.020069998974450217,"score_gpt":0.24285091999175845,"score_spread":0.22278092101730823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147804948","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013834295,0.042926118,0.4570825,0.0070862267,0.0040071807,0.0002556107,0.0004780075,0.002276218,0.48450476],"genre_scores_gemma":[0.13292544,0.05550117,0.34029588,0.004598308,0.005159466,0.0012378768,0.0010903897,0.0012684994,0.45792305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887055,0.00020607794,0.00006774957,0.00017109701,0.0005956509,0.0000888873],"domain_scores_gemma":[0.9992847,0.00022966768,0.000035805126,0.00021761138,0.00017631162,0.000055921933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004039,0.001336152,0.001162335,0.0011596616,0.0013606702,0.0047350386,0.0017153666,0.0016904122,0.013744389],"category_scores_gemma":[0.0023310448,0.0008308399,0.0007414783,0.0015948517,0.0041941027,0.004093982,0.0018500094,0.004516481,0.009435256],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088566285,0.000014742427,0.00006018092,0.00013855538,0.000012912646,0.00003835158,0.00021975362,0.0012560192,0.00031894888,0.9309474,0.031801417,0.035182778],"study_design_scores_gemma":[0.000016995013,0.000012871227,0.000095254545,0.00009339398,0.000010043662,0.00013343336,0.000037260117,0.0021460294,0.00029570173,0.5517308,0.44541806,0.000010090822],"about_ca_topic_score_codex":0.0014716107,"about_ca_topic_score_gemma":0.0012982696,"teacher_disagreement_score":0.013744389,"about_ca_system_score_codex":0.0016649092,"about_ca_system_score_gemma":0.0020351685,"threshold_uncertainty_score":0.04597956},"labels":[],"label_agreement":null},{"id":"W3155827701","doi":"10.1007/s10703-021-00367-3","title":"Towards efficient verification of population protocols","year":2021,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Correctness; Computer science; Decidability; Reachability; Protocol (science); Theoretical computer science; Petri net; Population; Reachability problem; Formal verification; Model checking; Computational complexity theory; Distributed computing; Algorithm","score_opus":0.07312539246779999,"score_gpt":0.3896241254999382,"score_spread":0.3164987330321382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155827701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025317013,0.000100544195,0.9684304,0.00069228775,0.00005806878,0.00018104809,0.00014377055,0.0024832785,0.0025936551],"genre_scores_gemma":[0.5303394,0.0003183572,0.4629364,0.00054788636,0.000104790306,0.0006905398,0.00077967066,0.000610068,0.00367276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9847342,0.006823542,0.0010220204,0.0017910453,0.004289154,0.0013399861],"domain_scores_gemma":[0.9642609,0.023699801,0.001706766,0.0062300772,0.0035503039,0.0005521311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008989824,0.00097504485,0.0012533398,0.0014752005,0.0015040324,0.0039675958,0.0031811118,0.002379691,0.0046899174],"category_scores_gemma":[0.034066815,0.0011776995,0.0025213799,0.001158835,0.005005767,0.0075088753,0.007984583,0.00545465,0.0012265752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036211673,0.00021794345,0.0019630583,0.0004550168,0.00011718212,0.0005729622,0.0011612354,0.14670806,0.02277534,0.7686957,0.004285937,0.052685466],"study_design_scores_gemma":[0.00009198662,0.00005960688,0.00014723383,0.00006407032,0.00003849423,0.00008524817,0.000121243,0.49868342,0.017258406,0.4773624,0.006055557,0.000032381806],"about_ca_topic_score_codex":0.001990274,"about_ca_topic_score_gemma":0.0013800333,"teacher_disagreement_score":0.008989824,"about_ca_system_score_codex":0.002481035,"about_ca_system_score_gemma":0.0037003942,"threshold_uncertainty_score":0.047543287},"labels":[],"label_agreement":null},{"id":"W3162516743","doi":"10.1145/3257474","title":"Session details: Industrial session 5: transactions, security, and cashing","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Session (web analytics); Computer science; Computer security; World Wide Web","score_opus":0.02322351032337355,"score_gpt":0.2609644060384057,"score_spread":0.23774089571503215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162516743","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053727645,0.004476627,0.010913149,0.009265292,0.020041684,0.0015861527,0.011785353,0.005210311,0.93134874],"genre_scores_gemma":[0.029556071,0.0027475192,0.0017851028,0.0008676624,0.004871801,0.00039695625,0.006921459,0.0008339539,0.95201945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936396,0.000085861175,0.00003189824,0.00015610296,0.00017977948,0.00018242505],"domain_scores_gemma":[0.9974694,0.00053154514,0.00007410752,0.00041321837,0.0005668296,0.00094489433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016669601,0.0014784109,0.0017807863,0.0006841724,0.0027236561,0.0053169816,0.0014568313,0.0046166377,0.8390076],"category_scores_gemma":[0.0024318194,0.0004223508,0.0014860866,0.0013888757,0.0005121834,0.0017268568,0.0018673838,0.0023915807,0.6131744],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076795823,0.0003370267,0.00038662602,0.00030827807,0.00002325695,0.000072986186,0.00005723984,0.00018527852,0.0024430589,0.0034763871,0.9357637,0.05617821],"study_design_scores_gemma":[0.00021607612,0.00037593243,0.0022864996,0.000114120565,0.000035848414,0.00012898742,0.000095787516,0.0008849794,0.0021593648,0.003107413,0.99056596,0.000029045665],"about_ca_topic_score_codex":0.0016997602,"about_ca_topic_score_gemma":0.0025975236,"teacher_disagreement_score":0.8390076,"about_ca_system_score_codex":0.0011509149,"about_ca_system_score_gemma":0.001494828,"threshold_uncertainty_score":0.22963601},"labels":[],"label_agreement":null},{"id":"W3163159606","doi":"10.1023/a:1026118914566","title":"Rendezvous Point Relocation in Protocol Independent Multicast-Sparse Mode","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Multicast; Rendezvous; Protocol Independent Multicast; Computer network; Distance Vector Multicast Routing Protocol; Distributed computing; Pragmatic General Multicast; Source-specific multicast; Xcast; Implementation; Relocation; IP multicast; Operating system","score_opus":0.0292030369908016,"score_gpt":0.30707659546490035,"score_spread":0.2778735584740987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163159606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4655317,0.00014575211,0.5275572,0.00017628657,0.00003623759,0.00009475799,0.00007138404,0.0007728728,0.00561376],"genre_scores_gemma":[0.9550586,0.00004513218,0.04296514,0.000031321055,0.000019134313,0.00006144366,0.00007363689,0.000039047027,0.0017066398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995146,0.0001539072,0.000018103743,0.00006159451,0.00015343209,0.000098396384],"domain_scores_gemma":[0.9983728,0.00073020527,0.00020079191,0.000397164,0.00020211446,0.00009692047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079950056,0.00024133125,0.00059138046,0.00055459724,0.00076453784,0.000533206,0.0010970252,0.00045686323,0.001409671],"category_scores_gemma":[0.0027331442,0.00028514417,0.0002266882,0.0005438591,0.00063881447,0.0011748156,0.0015911403,0.000596331,0.00025245064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003659735,0.0005245469,0.010288344,0.0003383925,0.00011294992,0.00073008245,0.002047471,0.44244662,0.10472485,0.15770037,0.0044744387,0.27295223],"study_design_scores_gemma":[0.000091533126,0.00023414251,0.000757598,0.000007896705,0.000024833931,0.00017929333,0.00022749994,0.96251136,0.006910625,0.028204793,0.0008312762,0.000019200206],"about_ca_topic_score_codex":0.0016248889,"about_ca_topic_score_gemma":0.0026184919,"teacher_disagreement_score":0.0016248889,"about_ca_system_score_codex":0.000367981,"about_ca_system_score_gemma":0.00053206773,"threshold_uncertainty_score":0.00471586},"labels":[],"label_agreement":null},{"id":"W3164441574","doi":"10.1016/j.ic.2023.105010","title":"Deterministic size discovery and topology recognition in radio networks with short labels","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Topology (electrical circuits); Computer science; Network topology; Node (physics); Graph; Theoretical computer science; Binary number; Algorithm; Mathematics; Computer network; Combinatorics","score_opus":0.01295393487565469,"score_gpt":0.24168620107471656,"score_spread":0.22873226619906187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164441574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12005972,0.0004075293,0.8740035,0.000960759,0.00014528548,0.00008376928,0.00026344508,0.0008007806,0.0032751225],"genre_scores_gemma":[0.84065247,0.0003197563,0.15370198,0.0002238793,0.00021775832,0.00016741533,0.0004103587,0.00023147711,0.0040749125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970458,0.00092359283,0.0001977495,0.0007434105,0.00074841705,0.0003409156],"domain_scores_gemma":[0.9487937,0.036816508,0.0048109693,0.006444475,0.0018661983,0.0012681806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033067758,0.00053208193,0.0012983333,0.001981535,0.0013257065,0.0027327428,0.0030912256,0.0020386814,0.0017930306],"category_scores_gemma":[0.034151528,0.0009521968,0.00083255407,0.0017849037,0.0031232925,0.0067890575,0.0029519266,0.0020858888,0.00042037238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010696218,0.00020680661,0.0058974656,0.00029375716,0.00006756665,0.00028213573,0.0005898582,0.46774578,0.012557945,0.39836973,0.0054449146,0.10747443],"study_design_scores_gemma":[0.000026666288,0.000050190964,0.000509348,0.000017456437,0.000012139428,0.00008939864,0.000066249864,0.7706147,0.0036705825,0.22409135,0.0008231007,0.000028705444],"about_ca_topic_score_codex":0.0016594968,"about_ca_topic_score_gemma":0.0020431888,"teacher_disagreement_score":0.0033067758,"about_ca_system_score_codex":0.0020264788,"about_ca_system_score_gemma":0.0011238455,"threshold_uncertainty_score":0.017488122},"labels":[],"label_agreement":null},{"id":"W3171474712","doi":"10.1145/3406325.3451133","title":"Efficient randomized DCAS","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Agence Nationale de la Recherche","keywords":"Swap (finance); Computer science; Randomized algorithm; Random number generation; Bipartite graph; Theoretical computer science; Synchronization (alternating current); Algorithm; Mathematics; Combinatorics; Topology (electrical circuits)","score_opus":0.013010587742278739,"score_gpt":0.24767393261374737,"score_spread":0.23466334487146864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171474712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06658837,0.0004851843,0.90150106,0.0009687603,0.00032862922,0.00044885182,0.00082283624,0.014061839,0.014794458],"genre_scores_gemma":[0.65334797,0.00015660464,0.3337202,0.0005873019,0.00012670842,0.0006762705,0.0010115906,0.0008207116,0.009552636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931284,0.001805734,0.00038137066,0.0015632104,0.0019222599,0.0011990678],"domain_scores_gemma":[0.99040633,0.0022733365,0.0006706931,0.005154601,0.0010060949,0.00048894715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020450514,0.0007991281,0.0015406961,0.0006712993,0.0018170583,0.0024630972,0.0042600203,0.0016001741,0.011544407],"category_scores_gemma":[0.008945924,0.00066039775,0.00078737404,0.0016093296,0.0017750942,0.0034640855,0.005058563,0.0022520176,0.0035212864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034691356,0.0012160809,0.0030385223,0.0007721952,0.0002735163,0.00029944244,0.0004348373,0.1931298,0.0690108,0.31819522,0.045026183,0.36513427],"study_design_scores_gemma":[0.00067533,0.00033606254,0.00055224483,0.00003683344,0.00010214498,0.00025589037,0.000120422796,0.80832946,0.044949796,0.12279655,0.021748034,0.000097222146],"about_ca_topic_score_codex":0.002364371,"about_ca_topic_score_gemma":0.0032569463,"teacher_disagreement_score":0.011544407,"about_ca_system_score_codex":0.0020446535,"about_ca_system_score_gemma":0.0058891447,"threshold_uncertainty_score":0.038619876},"labels":[],"label_agreement":null},{"id":"W3175644491","doi":"10.1145/3453483.3454060","title":"Concurrent deferred reference counting with constant-time overhead","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Constant (computer programming); Hazard; Overhead (engineering); Generalization; SAFER; Parallel computing; Real-time computing; Programming language; Mathematics; Computer security","score_opus":0.01816860967889951,"score_gpt":0.23533189613095826,"score_spread":0.21716328645205873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175644491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01877324,0.00018445561,0.9757354,0.00008284954,0.000045335713,0.00006492351,0.00001880498,0.0036239827,0.0014709625],"genre_scores_gemma":[0.5315088,0.00020853161,0.46343106,0.00019199267,0.000099882905,0.00020192272,0.000073521114,0.00053937366,0.0037449345],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563414,0.00077970396,0.00023399285,0.0005519614,0.002297062,0.0005031481],"domain_scores_gemma":[0.98465586,0.0047348626,0.0012921601,0.0062052235,0.0026949171,0.0004169716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031236247,0.0008794969,0.0008123848,0.001347927,0.0011090313,0.0021326067,0.0046688663,0.00075738784,0.0019520723],"category_scores_gemma":[0.0126678245,0.00068529835,0.0006052929,0.0012305891,0.0021288402,0.0031816424,0.0035548273,0.0023210414,0.0005160826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008905949,0.000415867,0.0035749963,0.0004841928,0.00010956024,0.0007085259,0.0018152911,0.0897964,0.07174944,0.29067406,0.0038951277,0.535886],"study_design_scores_gemma":[0.00022559115,0.0005377347,0.0005748659,0.00009356609,0.00019683618,0.0005520339,0.00012430272,0.71361595,0.12928224,0.13510449,0.019537864,0.00015453002],"about_ca_topic_score_codex":0.002421575,"about_ca_topic_score_gemma":0.0024233414,"teacher_disagreement_score":0.0046688663,"about_ca_system_score_codex":0.0012372755,"about_ca_system_score_gemma":0.0028577987,"threshold_uncertainty_score":0.016519487},"labels":[],"label_agreement":null},{"id":"W3176673269","doi":"10.1109/educon46332.2021.9453906","title":"Basic Distributed Algorithms Visual Simulations for Distributed Systems Students","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Visualization; Suite; Mathematical proof; Distributed algorithm; Synchronization (alternating current); Leader election; Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Computer network","score_opus":0.021358241325868013,"score_gpt":0.31383460414812187,"score_spread":0.29247636282225387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176673269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007971564,0.00047635668,0.8104056,0.0020576892,0.00042482602,0.00033077138,0.0028329461,0.027081827,0.14841844],"genre_scores_gemma":[0.1496594,0.0024171853,0.65774065,0.0011846801,0.00034251914,0.0014756987,0.0061482554,0.010964188,0.17006746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996811,0.00007055515,0.000018490471,0.00004180529,0.00013708696,0.00005099549],"domain_scores_gemma":[0.9990243,0.00038101483,0.000038416467,0.00016571283,0.0002566495,0.00013388731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004918599,0.0011042099,0.0005829828,0.00073644787,0.0004761431,0.0020946537,0.0013683672,0.0010440561,0.13648917],"category_scores_gemma":[0.0033042184,0.00043193402,0.00082697556,0.00058718835,0.00052372826,0.0017751338,0.0014647035,0.0022342347,0.02838829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042389572,0.0003296738,0.0016229674,0.0008599022,0.000054188866,0.00041981132,0.0010961584,0.092465766,0.033597592,0.34956652,0.2402832,0.27928033],"study_design_scores_gemma":[0.00017257103,0.00012236254,0.0006310358,0.00022151059,0.000014577042,0.0002552258,0.00015056593,0.17516603,0.015147068,0.12916006,0.678909,0.000049967643],"about_ca_topic_score_codex":0.001141701,"about_ca_topic_score_gemma":0.0013781072,"teacher_disagreement_score":0.13648917,"about_ca_system_score_codex":0.00065528404,"about_ca_system_score_gemma":0.00083143,"threshold_uncertainty_score":0.45660174},"labels":[],"label_agreement":null},{"id":"W3180751300","doi":"10.1145/1543136.1542471","title":"Tracing interrupts in embedded software","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Debugging; Computer science; Tracing; Interrupt; Control flow; Software; Algorithmic program debugging; Embedded software; Background debug mode interface; Embedded system; Heuristic; Programming language; Distributed computing; Operating system","score_opus":0.02052073300440651,"score_gpt":0.2749397261982433,"score_spread":0.2544189931938368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180751300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16515289,0.0008616003,0.82211506,0.00021312082,0.000028418031,0.00011718076,0.00008615739,0.009686526,0.0017390967],"genre_scores_gemma":[0.67665267,0.00044121055,0.32027614,0.00006478102,0.000014689148,0.000064884654,0.0001248344,0.0004930878,0.0018677026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967895,0.0009485062,0.00019986928,0.0005011366,0.0013635459,0.00019735996],"domain_scores_gemma":[0.9902822,0.0043778066,0.0013159905,0.00310257,0.00069352885,0.0002278173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673765,0.000698232,0.0006095643,0.0017489467,0.0009025077,0.0015390554,0.002340922,0.0010591485,0.0009841697],"category_scores_gemma":[0.012995195,0.0010167365,0.0005870736,0.0014572615,0.0018553521,0.0023088227,0.0015518826,0.0013287404,0.0003248766],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011590864,0.00045716448,0.017260449,0.0008238977,0.00016185423,0.0008002274,0.002497506,0.32572886,0.10208,0.10361515,0.0030283674,0.44238743],"study_design_scores_gemma":[0.00011015066,0.00042581453,0.0025455698,0.00011981306,0.000114316594,0.00063304236,0.00025288918,0.7881429,0.1394299,0.057915397,0.010231675,0.00007851315],"about_ca_topic_score_codex":0.0032554392,"about_ca_topic_score_gemma":0.002491156,"teacher_disagreement_score":0.0032554392,"about_ca_system_score_codex":0.0016425718,"about_ca_system_score_gemma":0.0016981848,"threshold_uncertainty_score":0.0141403675},"labels":[],"label_agreement":null},{"id":"W3183545278","doi":"10.1145/3465084.3467906","title":"Reductions and Extension-Based Proofs","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Mathematical proof; Extension (predicate logic); Computer science; Task (project management); Reduction (mathematics); Theoretical computer science; Set (abstract data type); Protocol (science); Discrete mathematics; Calculus (dental); Mathematics; Programming language","score_opus":0.01252312754568794,"score_gpt":0.23101318972145984,"score_spread":0.2184900621757719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183545278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012630999,0.0036703674,0.9126798,0.005256122,0.00085321383,0.00031049782,0.00048207227,0.0010571948,0.06305964],"genre_scores_gemma":[0.5309773,0.005463698,0.43087617,0.0046400903,0.0025700722,0.0014484704,0.0014614873,0.0009555876,0.021607205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9813478,0.0075414013,0.0014619925,0.0027835437,0.0053516333,0.0015136875],"domain_scores_gemma":[0.95333195,0.034876205,0.0012330425,0.006430153,0.0033378443,0.0007906983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016252603,0.0016215298,0.0016757526,0.0034775,0.0037439815,0.0050791767,0.0038581186,0.0026024873,0.0072905784],"category_scores_gemma":[0.031057505,0.0016874702,0.0044447468,0.0027594406,0.017419577,0.021596419,0.013099364,0.012704262,0.0021268022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029398409,0.000023658582,0.000083322535,0.00013992358,0.000021443533,0.00010180084,0.0003623718,0.0011672642,0.00030164665,0.9904919,0.0015281956,0.0057491376],"study_design_scores_gemma":[0.00002664274,0.00001842494,0.00003407236,0.00005198205,0.000017138671,0.00012757916,0.00005420397,0.0020676933,0.00069039187,0.9865449,0.010347058,0.00001976091],"about_ca_topic_score_codex":0.0010978339,"about_ca_topic_score_gemma":0.00069140183,"teacher_disagreement_score":0.016252603,"about_ca_system_score_codex":0.0030184214,"about_ca_system_score_gemma":0.0023654262,"threshold_uncertainty_score":0.08595306},"labels":[],"label_agreement":null},{"id":"W3183901574","doi":"10.1145/3465084.3467938","title":"Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Canada Research Chairs","keywords":"Mutual exclusion; Swap (finance); Upper and lower bounds; Fetch; Computer science; Synchronization (alternating current); Log-log plot; Algorithm; Binary logarithm; Parallel computing; Combinatorics; Mathematics; Theoretical computer science; Topology (electrical circuits)","score_opus":0.04479827334313959,"score_gpt":0.27089854671959573,"score_spread":0.22610027337645613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183901574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06955293,0.00584056,0.87490606,0.008052613,0.00040059452,0.0005019014,0.0014825498,0.0053994767,0.03386331],"genre_scores_gemma":[0.72932804,0.002690953,0.24855837,0.0019643689,0.00095045083,0.0011478518,0.002323065,0.0015595442,0.011477277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98640406,0.0031979792,0.0006241081,0.0021784417,0.0046554157,0.0029398731],"domain_scores_gemma":[0.94475085,0.04118326,0.0020636383,0.008582743,0.0022858651,0.0011336593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055616167,0.0025874833,0.0035391422,0.0020851744,0.0020144247,0.004769635,0.005571552,0.003346043,0.013602525],"category_scores_gemma":[0.04337371,0.0010320201,0.0025650836,0.002313368,0.0033688117,0.013792433,0.006767475,0.00831169,0.0036726051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021030882,0.0010408253,0.0024470487,0.0016531054,0.00026037323,0.0005600832,0.0007144119,0.5178699,0.03575514,0.23887189,0.030940255,0.16778393],"study_design_scores_gemma":[0.0001377584,0.00022411054,0.0007086013,0.00008679526,0.00008011809,0.00038080738,0.000112379705,0.8528747,0.008761285,0.13013044,0.006422694,0.000080216174],"about_ca_topic_score_codex":0.0021819377,"about_ca_topic_score_gemma":0.002160626,"teacher_disagreement_score":0.013602525,"about_ca_system_score_codex":0.0053086057,"about_ca_system_score_gemma":0.0036420673,"threshold_uncertainty_score":0.045504987},"labels":[],"label_agreement":null},{"id":"W3184161392","doi":"10.1145/3465084.3467916","title":"The Space Complexity of Scannable Binary Objects","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Snapshot (computer storage); Object (grammar); Binary number; Artificial intelligence; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.026654478332180716,"score_gpt":0.24807853223071233,"score_spread":0.22142405389853162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184161392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73401207,0.0025030246,0.21368194,0.0069546564,0.00016496646,0.00020043523,0.0027938494,0.0022857557,0.037403274],"genre_scores_gemma":[0.9007379,0.0010162846,0.08373538,0.00042844325,0.0001721796,0.00031218817,0.0019605623,0.000486483,0.011150517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668,0.0006357668,0.00026037477,0.000491751,0.0012692674,0.00066292624],"domain_scores_gemma":[0.9859185,0.009124074,0.0010556045,0.0026045998,0.00080867193,0.0004884149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016145431,0.00048117543,0.0011236473,0.0010087615,0.001298319,0.005047751,0.0023648457,0.0014539368,0.010042067],"category_scores_gemma":[0.013724031,0.0006214997,0.0007645324,0.0024753956,0.001832143,0.0130117,0.003036465,0.0013470735,0.0020285028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002579019,0.00032459252,0.009236503,0.00083444413,0.00010222039,0.00070426683,0.0018504737,0.19572929,0.022064291,0.5229863,0.026871102,0.2167175],"study_design_scores_gemma":[0.0002631942,0.00021900976,0.0018920619,0.000096647156,0.000071085306,0.00062797003,0.00055468973,0.35145825,0.009787318,0.62314594,0.011811533,0.00007228108],"about_ca_topic_score_codex":0.0022954699,"about_ca_topic_score_gemma":0.0018194009,"teacher_disagreement_score":0.010042067,"about_ca_system_score_codex":0.0018372427,"about_ca_system_score_gemma":0.0019127877,"threshold_uncertainty_score":0.033594072},"labels":[],"label_agreement":null},{"id":"W3185868054","doi":"10.1145/998300.997195","title":"Optimizing for space and time usage with speculative partial redundancy elimination","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Redundancy (engineering); Function (biology); Execution time; Space (punctuation); Distributed computing; Spacetime; Mathematical optimization; Parallel computing; Theoretical computer science; Operating system","score_opus":0.014952722086716188,"score_gpt":0.2465223292662858,"score_spread":0.23156960717956962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185868054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28919527,0.000305719,0.70293397,0.0005185188,0.000022338623,0.00005511111,0.00006853014,0.001655315,0.0052451943],"genre_scores_gemma":[0.82961804,0.00010573235,0.16837665,0.000056148026,0.000014942246,0.000049922997,0.0000808241,0.00021361373,0.0014840832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991399,0.00027255202,0.000042440803,0.00008192359,0.00026399674,0.00019923129],"domain_scores_gemma":[0.99832064,0.00078766467,0.00018745537,0.0004571841,0.00019850716,0.000048584978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010288522,0.00072346214,0.00050895975,0.0005051924,0.00043250073,0.00080617424,0.0011917714,0.00042451415,0.0014246473],"category_scores_gemma":[0.0037979414,0.00034904337,0.00032472395,0.0007875121,0.00056388276,0.00189347,0.00066498894,0.00055133057,0.00033840936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047379517,0.00018486634,0.0021386743,0.000099038676,0.000043870463,0.00018730036,0.00015126733,0.7189932,0.05904791,0.028429508,0.0021886444,0.18806194],"study_design_scores_gemma":[0.00002474258,0.00012919038,0.00027463873,0.0000048917545,0.000022386637,0.00005959639,0.000034440433,0.9668655,0.020525599,0.01104812,0.0010020965,0.000008860206],"about_ca_topic_score_codex":0.000894937,"about_ca_topic_score_gemma":0.0019781112,"teacher_disagreement_score":0.0014246473,"about_ca_system_score_codex":0.00060940254,"about_ca_system_score_gemma":0.0012397252,"threshold_uncertainty_score":0.005441129},"labels":[],"label_agreement":null},{"id":"W3186685762","doi":"10.1145/3465084.3467925","title":"On Register Linearizability and Termination","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linearizability; Property (philosophy); Computer science; Atomicity; Algorithm; Theoretical computer science; Programming language; Epistemology","score_opus":0.008669910984347697,"score_gpt":0.23319102229079863,"score_spread":0.22452111130645094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186685762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094653994,0.00682112,0.7953455,0.011025871,0.0006942072,0.00015295282,0.00016153097,0.0013252881,0.0898195],"genre_scores_gemma":[0.9008655,0.0049944464,0.059114404,0.0022016438,0.0020953647,0.00055237394,0.00025574648,0.0006206339,0.029299999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992935,0.0021505908,0.0004148564,0.0014027199,0.0018265679,0.00127021],"domain_scores_gemma":[0.96056014,0.030428175,0.00214985,0.00415697,0.0020578576,0.00064709614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055859108,0.0008975035,0.0013772027,0.0015310497,0.0022775452,0.0025684421,0.0017292966,0.0020176482,0.0058117933],"category_scores_gemma":[0.02685399,0.00057880185,0.001258354,0.001966992,0.00979774,0.010129527,0.004547655,0.0065649087,0.0010169215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016880874,0.0000644585,0.0009007689,0.00009524206,0.000020857018,0.00018773931,0.0004040238,0.01870337,0.0010591245,0.9517452,0.002493679,0.024156777],"study_design_scores_gemma":[0.00006220336,0.00006889409,0.00025052327,0.000043421136,0.000019783378,0.000108275904,0.000049928018,0.043721307,0.001191264,0.9502628,0.0042020543,0.00001967581],"about_ca_topic_score_codex":0.0024109788,"about_ca_topic_score_gemma":0.0012975166,"teacher_disagreement_score":0.0058117933,"about_ca_system_score_codex":0.0025256684,"about_ca_system_score_gemma":0.001783213,"threshold_uncertainty_score":0.029541492},"labels":[],"label_agreement":null},{"id":"W3187035908","doi":"10.1145/3465084.3467943","title":"Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Queue; Parallel computing; State (computer science); Lock (firearm); Multiprocessing; Interface (matter); Hierarchy; Operating system; Programming language","score_opus":0.057169406483602137,"score_gpt":0.262188617730983,"score_spread":0.20501921124738087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187035908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029707104,0.0025153623,0.9196297,0.013153841,0.0070102713,0.00041517155,0.0007467973,0.008625339,0.018196478],"genre_scores_gemma":[0.3799954,0.004254666,0.54881316,0.0041028145,0.0044632065,0.0005927542,0.0030941814,0.0018808782,0.052802827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963607,0.000857494,0.0003228236,0.00033795324,0.0018065837,0.0003143746],"domain_scores_gemma":[0.99062765,0.004675664,0.00047390806,0.001187754,0.002540793,0.0004943386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053379214,0.0006053541,0.00037448597,0.00056314614,0.0006631583,0.002263707,0.00141369,0.0014972342,0.012127125],"category_scores_gemma":[0.012380146,0.0006864353,0.0006176158,0.0006841844,0.001570413,0.0041220007,0.001064094,0.0035427308,0.002190516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090248877,0.0002822266,0.0022732313,0.0010050946,0.000050099665,0.0007621117,0.0006316727,0.009851383,0.030757012,0.5360414,0.14176083,0.27568248],"study_design_scores_gemma":[0.0004713817,0.00166308,0.0011822084,0.00022058006,0.00009736982,0.0009783626,0.0004147979,0.11650286,0.06032784,0.10712265,0.71083254,0.00018636344],"about_ca_topic_score_codex":0.0022501936,"about_ca_topic_score_gemma":0.0020440668,"teacher_disagreement_score":0.012127125,"about_ca_system_score_codex":0.0014954652,"about_ca_system_score_gemma":0.0026560137,"threshold_uncertainty_score":0.040569305},"labels":[],"label_agreement":null},{"id":"W3189431800","doi":"10.4230/lipics.disc.2021.4","title":"Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Randomized algorithm; Upper and lower bounds; Shared memory; Parallel computing; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Computer network","score_opus":0.026453677728506226,"score_gpt":0.2748358487098276,"score_spread":0.24838217098132134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189431800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100575276,0.0052335267,0.8384084,0.007272605,0.0006424962,0.00039108697,0.0010594396,0.004862575,0.04155455],"genre_scores_gemma":[0.8830969,0.0018120945,0.09404735,0.0014885704,0.00074284425,0.00072763546,0.0011948441,0.0018608479,0.015028988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98959607,0.0021658435,0.00042644938,0.0015562917,0.0030298864,0.0032254616],"domain_scores_gemma":[0.93563753,0.0486992,0.002637901,0.008565904,0.002494135,0.0019651866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059637167,0.0025670803,0.0025715076,0.0022902044,0.0030168449,0.0075676055,0.0054955175,0.0024373701,0.014179615],"category_scores_gemma":[0.03652096,0.001094326,0.0021224297,0.0021948207,0.0044179675,0.0148261795,0.00702953,0.007808622,0.0031593451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044669183,0.0011402378,0.006754723,0.001874785,0.00035840427,0.00069663394,0.0015017961,0.435481,0.03886373,0.3697743,0.026802633,0.1122847],"study_design_scores_gemma":[0.00015782066,0.0002242421,0.0006906372,0.00010645533,0.00012506044,0.00019174808,0.00016814253,0.73069113,0.014472637,0.24876851,0.004329876,0.00007368363],"about_ca_topic_score_codex":0.0012170381,"about_ca_topic_score_gemma":0.0019698078,"teacher_disagreement_score":0.014179615,"about_ca_system_score_codex":0.0051121893,"about_ca_system_score_gemma":0.0034688571,"threshold_uncertainty_score":0.047435522},"labels":[],"label_agreement":null},{"id":"W3191976396","doi":"10.4230/lipics.disc.2021.12","title":"Space and Time Bounded Multiversion Garbage Collection","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Garbage collection; Amortized analysis; Computer science; Garbage; Bounded function; Pointer (user interface); Concurrency; Constant (computer programming); Reachability; Concurrency control; Set (abstract data type); Data structure; Algorithm; Theoretical computer science; Programming language; Mathematics; Artificial intelligence","score_opus":0.01013403197380855,"score_gpt":0.23305664676178328,"score_spread":0.22292261478797473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191976396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077796183,0.0004234445,0.9854724,0.00015067554,0.000054831642,0.0000712619,0.00013845673,0.004038386,0.001870804],"genre_scores_gemma":[0.18417682,0.00046168847,0.8081536,0.00016321505,0.0000836574,0.00030713037,0.0006384612,0.0014466681,0.004568705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945755,0.00075025845,0.0005033523,0.0009198086,0.0026311246,0.00061997556],"domain_scores_gemma":[0.986702,0.0028557442,0.0009949675,0.0075345826,0.0015675968,0.00034506342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003178825,0.0014346773,0.0012253678,0.0025165647,0.0018672656,0.0035623547,0.004609848,0.00088213896,0.0053043095],"category_scores_gemma":[0.010350782,0.00086490484,0.0016937959,0.0035482158,0.0030329071,0.006633379,0.0060761133,0.0021698393,0.0017924537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009309372,0.00020523164,0.0031488347,0.00097053027,0.00017575079,0.00023986527,0.0011505333,0.13282304,0.06525686,0.28806084,0.012566028,0.49447155],"study_design_scores_gemma":[0.00017791489,0.0003563827,0.00073462864,0.00018419346,0.00020241494,0.00054844224,0.0002259753,0.50657827,0.19704174,0.23293193,0.060803067,0.00021503767],"about_ca_topic_score_codex":0.0019917095,"about_ca_topic_score_gemma":0.0030269467,"teacher_disagreement_score":0.0053043095,"about_ca_system_score_codex":0.0021749216,"about_ca_system_score_gemma":0.003102604,"threshold_uncertainty_score":0.01774466},"labels":[],"label_agreement":null},{"id":"W3192049267","doi":"10.1016/j.ipl.2021.106173","title":"Randomized consensus with regular registers","year":2021,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Adversary; Randomized algorithm; Adversary model; Algorithm; Theoretical computer science; Computer security","score_opus":0.008307946532752642,"score_gpt":0.2101698602278566,"score_spread":0.20186191369510398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192049267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08598901,0.000408131,0.8894543,0.0018486785,0.0005623529,0.00024075617,0.00030522692,0.001951568,0.019239947],"genre_scores_gemma":[0.89718115,0.0001743329,0.08765717,0.0004916285,0.0002059644,0.0004156124,0.00025958885,0.00021541677,0.013399094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532473,0.0018358098,0.0003018434,0.0010679429,0.0008195003,0.00065006915],"domain_scores_gemma":[0.9883459,0.0057295137,0.0006482771,0.0037688615,0.0011252349,0.0003822206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035065063,0.0007949652,0.0020959824,0.0010692654,0.0015057836,0.0023519672,0.0022791147,0.002020449,0.0062981835],"category_scores_gemma":[0.018487634,0.00073746196,0.00092295243,0.0011812004,0.0023433967,0.0034960501,0.0036081518,0.0019395994,0.0012709602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002277155,0.00017706295,0.00046204543,0.00019952614,0.00010724242,0.00018876402,0.00024936133,0.24765092,0.0059494553,0.67677224,0.0073574046,0.058608834],"study_design_scores_gemma":[0.00031470222,0.00018272406,0.00007411353,0.000020879517,0.00003587018,0.000040697632,0.000036251462,0.64309776,0.003238349,0.3510893,0.0018327198,0.000036709545],"about_ca_topic_score_codex":0.0012494201,"about_ca_topic_score_gemma":0.0013052947,"teacher_disagreement_score":0.0062981835,"about_ca_system_score_codex":0.0013126213,"about_ca_system_score_gemma":0.0028725418,"threshold_uncertainty_score":0.021069527},"labels":[],"label_agreement":null},{"id":"W3194512096","doi":"10.1007/978-3-030-92790-5_8","title":"On the Communication Requirements of Decentralized Connectivity Control - A Field Experiment","year":2021,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure; University of Toronto","funders":"","keywords":"Computer science; Field (mathematics); Control (management); Distributed computing; Artificial intelligence; Mathematics","score_opus":0.01683634353937828,"score_gpt":0.2591942389287307,"score_spread":0.24235789538935246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194512096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9600575,0.00017534394,0.019145448,0.0009519989,0.000038058934,0.00013849529,0.00017960915,0.00021103754,0.019102482],"genre_scores_gemma":[0.9966394,0.000027043641,0.0024054744,0.00003784425,0.0000102439535,0.00003875855,0.00005124953,0.00002144183,0.0007685938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.998103,0.00087160786,0.00004526163,0.0001830568,0.000502954,0.0002940898],"domain_scores_gemma":[0.94748527,0.04646489,0.0016284739,0.001766288,0.0018916046,0.000763543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024064286,0.00039678093,0.00052907737,0.0004890162,0.0011137277,0.00096905185,0.00092728646,0.001005082,0.0053897337],"category_scores_gemma":[0.021875793,0.00025033805,0.00016607456,0.0004135104,0.0012298913,0.0016540879,0.00065530994,0.0010498221,0.00022581666],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008432506,0.0036240218,0.007873648,0.0004456917,0.000059908343,0.00045337374,0.00076084735,0.75290835,0.09455512,0.060046233,0.00608158,0.06475876],"study_design_scores_gemma":[0.00091953087,0.002535677,0.007374141,0.000024926881,0.00003613217,0.00009815356,0.00044289487,0.9467195,0.019740645,0.020441934,0.0016207306,0.000045707413],"about_ca_topic_score_codex":0.010049171,"about_ca_topic_score_gemma":0.0064081885,"teacher_disagreement_score":0.010049171,"about_ca_system_score_codex":0.0017491956,"about_ca_system_score_gemma":0.0017485347,"threshold_uncertainty_score":0.019981325},"labels":[],"label_agreement":null},{"id":"W3196496659","doi":"10.1109/icccn52240.2021.9522225","title":"Timetable-based Routing in Fixed Schedule Dynamic Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Schedule; Node (physics); Routing (electronic design automation); Set (abstract data type); Path (computing); Mathematical optimization; Distributed computing; Algorithm; Computer network; Mathematics","score_opus":0.0075849145926254824,"score_gpt":0.22917469808987656,"score_spread":0.22158978349725109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196496659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055087466,0.0009439053,0.9330115,0.00045876188,0.00015820916,0.00022166847,0.00051733287,0.0019635677,0.0076377303],"genre_scores_gemma":[0.5882911,0.0011746906,0.4014356,0.00014360204,0.00012211582,0.00024554378,0.0013552841,0.000276554,0.006955482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903,0.00024752316,0.000055286066,0.00020025452,0.0002829363,0.00018398782],"domain_scores_gemma":[0.9982299,0.0007869631,0.00023167807,0.00038570998,0.00022710947,0.0001385104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012108479,0.00068983703,0.000672815,0.0010812011,0.0011870187,0.0017372692,0.002582385,0.0008107117,0.0033304002],"category_scores_gemma":[0.0035182007,0.0005581367,0.0005188207,0.0022859864,0.00090630836,0.0034458258,0.0009844092,0.0008910381,0.0004818685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044368,0.00011140183,0.00076623325,0.00023958056,0.00006137063,0.00016352863,0.00024374528,0.7684408,0.0059888153,0.08367524,0.0110338265,0.12883167],"study_design_scores_gemma":[0.00008461985,0.0001719679,0.00033122575,0.000024486768,0.000034268513,0.00017384009,0.00012673963,0.9160748,0.004511419,0.06599766,0.012435206,0.000033766642],"about_ca_topic_score_codex":0.012768693,"about_ca_topic_score_gemma":0.0121201575,"teacher_disagreement_score":0.012768693,"about_ca_system_score_codex":0.0024257656,"about_ca_system_score_gemma":0.0019080725,"threshold_uncertainty_score":0.025388718},"labels":[],"label_agreement":null},{"id":"W3200773861","doi":"10.1007/978-3-031-44274-2_3","title":"The Fence Complexity of Persistent Sets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linearizability; Computer science; Fence (mathematics); Crash; Property (philosophy); Lock (firearm); Set (abstract data type); Shared memory; Distributed computing; Theoretical computer science; Extension (predicate logic); Algorithm; Parallel computing; Programming language; Mathematics; Correctness","score_opus":0.04555124974121188,"score_gpt":0.2630009112628464,"score_spread":0.21744966152163453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200773861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28673786,0.0066299746,0.21239004,0.014116115,0.0008618371,0.00009343575,0.0013362169,0.0004984079,0.47733614],"genre_scores_gemma":[0.9058575,0.003744651,0.018941687,0.00068350387,0.00065254077,0.00015603568,0.000636431,0.00022687778,0.06910081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.0001549466,0.000055543118,0.00019466228,0.0004775664,0.00021676336],"domain_scores_gemma":[0.995165,0.0034609872,0.00019966043,0.00064746203,0.00031539946,0.0002114578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009553683,0.00047544058,0.001041023,0.0015342137,0.0028150305,0.0055685095,0.0018675331,0.0017713298,0.013445993],"category_scores_gemma":[0.008160786,0.000767684,0.00085199776,0.0029577212,0.004511566,0.018107053,0.0028481418,0.005091809,0.0011194742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026251733,0.0000072664798,0.00009891308,0.00002862905,0.000003287335,0.000028071594,0.000117076466,0.0019792798,0.00014899166,0.9894093,0.0021145272,0.0060382932],"study_design_scores_gemma":[0.000004990834,0.0000033058384,0.00006391985,0.000010534286,0.0000028184447,0.000036484293,0.0000434151,0.0022371334,0.00014464746,0.9941362,0.003311441,0.000005106431],"about_ca_topic_score_codex":0.0025454103,"about_ca_topic_score_gemma":0.0014528836,"teacher_disagreement_score":0.013445993,"about_ca_system_score_codex":0.002839477,"about_ca_system_score_gemma":0.0013285404,"threshold_uncertainty_score":0.04498136},"labels":[],"label_agreement":null},{"id":"W3201295163","doi":"10.1145/3485490","title":"Verifying concurrent multicopy search structures","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi; National Science Foundation","keywords":"Computer science; Data structure; Merge (version control); Concurrent data structure; Parallel computing; Theoretical computer science; Reuse; Key (lock); Algorithm; Programming language; Operating system","score_opus":0.029565912091222172,"score_gpt":0.30954144997429056,"score_spread":0.2799755378830684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201295163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093195476,0.0000707874,0.8966444,0.00034434223,0.000042977663,0.00019558398,0.00025300577,0.006090515,0.0031628287],"genre_scores_gemma":[0.6974213,0.00007648972,0.29846874,0.00021823958,0.000037504295,0.00019508338,0.00037736658,0.00058611087,0.0026192146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924299,0.0015515287,0.00071445806,0.0015364611,0.002844486,0.00092319597],"domain_scores_gemma":[0.9766283,0.010802888,0.0020070886,0.007315458,0.0028736207,0.00037257545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004529309,0.0007066025,0.0007072755,0.00077960454,0.0010028592,0.0031495509,0.0034640837,0.0015933834,0.0028904001],"category_scores_gemma":[0.026148824,0.0009952015,0.0016687537,0.0007781561,0.003228738,0.006268744,0.0040554893,0.002261594,0.00065596047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010102318,0.00039188034,0.009945782,0.0008586655,0.00021430044,0.0008841248,0.002015511,0.13034701,0.080301814,0.5751089,0.00371253,0.1952092],"study_design_scores_gemma":[0.00019678398,0.000359012,0.0006441462,0.00008262955,0.00015514332,0.00054247305,0.00033443864,0.4590308,0.25756934,0.2727689,0.008229988,0.00008622789],"about_ca_topic_score_codex":0.0034857972,"about_ca_topic_score_gemma":0.0031874308,"teacher_disagreement_score":0.004529309,"about_ca_system_score_codex":0.0023149953,"about_ca_system_score_gemma":0.004732655,"threshold_uncertainty_score":0.023953557},"labels":[],"label_agreement":null},{"id":"W3202523998","doi":"10.1109/icdcs51616.2021.00116","title":"Demo: A FSM Approach to Web Collaboration","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Finite-state machine; Automaton; Cloud computing; State (computer science); Transformation (genetics); Theoretical computer science; Model transformation; Architecture; Series (stratigraphy); Programming language; Distributed computing; Software engineering; Operating system; Artificial intelligence","score_opus":0.0118148863080921,"score_gpt":0.2392037170719042,"score_spread":0.22738883076381208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202523998","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005073824,0.00007886898,0.9854639,0.0002919462,0.000047460067,0.000071041504,0.00009345928,0.0013090686,0.007570379],"genre_scores_gemma":[0.4128168,0.00024948528,0.5740094,0.00023643688,0.00007101344,0.00032007124,0.00032214008,0.0003405391,0.011634094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990834,0.00035840494,0.00004995099,0.00017472226,0.00024645805,0.00008719587],"domain_scores_gemma":[0.99869555,0.0006234383,0.00007227639,0.00038746322,0.00013503445,0.000086288965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011342933,0.00048332266,0.00041464466,0.0007955487,0.00096091337,0.0016423794,0.0017636662,0.0010330997,0.007861306],"category_scores_gemma":[0.0029714294,0.0003026045,0.0007727079,0.0005404939,0.0021439092,0.002683321,0.0025395136,0.0016474397,0.0007458484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013698087,0.00009257123,0.00090578245,0.00014229176,0.000039245002,0.0004092804,0.00088108634,0.21016757,0.005135708,0.69710976,0.0039950917,0.08098468],"study_design_scores_gemma":[0.000021968224,0.00003457392,0.00010389883,0.000029672054,0.000013290175,0.00012008087,0.00013365324,0.74052465,0.003975264,0.23362018,0.021407107,0.000015632495],"about_ca_topic_score_codex":0.003677375,"about_ca_topic_score_gemma":0.003827546,"teacher_disagreement_score":0.007861306,"about_ca_system_score_codex":0.0011536325,"about_ca_system_score_gemma":0.00088550197,"threshold_uncertainty_score":0.026298702},"labels":[],"label_agreement":null},{"id":"W3204280976","doi":"10.1145/3464298.3484503","title":"Prosecutor","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Byzantine fault tolerance; Server; Computer science; Byzantine architecture; Replication (statistics); Hash function; Protocol (science); Quantum Byzantine agreement; Computer security; Computer network; Authentication (law); Distributed computing; Fault tolerance","score_opus":0.007378430975002193,"score_gpt":0.2138847147969379,"score_spread":0.20650628382193573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204280976","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04268341,0.002804095,0.21979624,0.0110690035,0.0047890106,0.0011752613,0.0045860056,0.044632573,0.6684644],"genre_scores_gemma":[0.34436864,0.0014932754,0.07973562,0.0033083556,0.00091015536,0.00068400556,0.00828853,0.0055200295,0.55569136],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977119,0.00060054316,0.00013338386,0.000530075,0.0007365113,0.0002877302],"domain_scores_gemma":[0.99169016,0.0012715622,0.0007048087,0.0026276542,0.0026539594,0.0010517787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002151633,0.0006249451,0.0005220439,0.0013703809,0.0017323995,0.0026273434,0.001811109,0.0013976224,0.13656719],"category_scores_gemma":[0.007545659,0.00036277733,0.00029173752,0.0008722117,0.0007332154,0.002735992,0.0038556345,0.0015657904,0.069293074],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011109412,0.00019529501,0.0053242524,0.0007217356,0.000037039354,0.0010989642,0.0014291571,0.0027562021,0.013762603,0.08554347,0.4505702,0.43745005],"study_design_scores_gemma":[0.00007247471,0.00013249912,0.0007136011,0.00007573253,0.000013527817,0.0008120565,0.00025049946,0.006690691,0.0070038745,0.0074133324,0.9767899,0.00003195023],"about_ca_topic_score_codex":0.0009879675,"about_ca_topic_score_gemma":0.0012545837,"teacher_disagreement_score":0.8634328,"about_ca_system_score_codex":0.000853891,"about_ca_system_score_gemma":0.0020203297,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3206302033","doi":"10.1145/3477132.3483591","title":"Caracal","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency control; Programmer; Serialization; Distributed computing; Concurrency; Serializability; Parallel computing; Optimistic concurrency control; Database transaction; Operating system; Distributed transaction; Transaction processing; Programming language; Distributed concurrency control","score_opus":0.008136856265550949,"score_gpt":0.21936926122926742,"score_spread":0.21123240496371648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206302033","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007624348,0.004915134,0.10607407,0.0051343655,0.0028269836,0.00095814187,0.017593436,0.23154397,0.6233296],"genre_scores_gemma":[0.07306414,0.003568728,0.086843446,0.0057572126,0.00087905844,0.0014626454,0.04770947,0.034462735,0.74625266],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862635,0.00015084486,0.00007179223,0.0004023573,0.00057923596,0.00016940416],"domain_scores_gemma":[0.9979838,0.00037210624,0.00010033823,0.0005518671,0.0006714131,0.00032045093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135134,0.0011963237,0.0007902846,0.0019173349,0.00152676,0.0043363106,0.0034452854,0.0019398596,0.3138902],"category_scores_gemma":[0.004234564,0.00078179064,0.0009617108,0.0011021243,0.00075204455,0.003176733,0.0032226203,0.002108036,0.18678638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009189716,0.00020260089,0.00085721473,0.0009430234,0.00005554007,0.00041321397,0.00023048543,0.0012501577,0.008578207,0.034471042,0.63379425,0.3182852],"study_design_scores_gemma":[0.00010905196,0.000055073804,0.00021688998,0.000071270595,0.000017295499,0.00024890332,0.000032287233,0.0020088316,0.002772416,0.0036692068,0.99077386,0.00002500681],"about_ca_topic_score_codex":0.00347929,"about_ca_topic_score_gemma":0.0044063693,"teacher_disagreement_score":0.3138902,"about_ca_system_score_codex":0.0012218015,"about_ca_system_score_gemma":0.0022584125,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3206946486","doi":"10.4230/lipics.disc.2021.29","title":"Detectable Sequential Specifications for Recoverable Shared Objects","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Linearizability; Cache; Thread (computing); Shared memory; State (computer science); Parallel computing; Cache coherence; Sequential consistency; Atomicity; Distributed computing; Programming language; CPU cache; Consistency model; Cache algorithms","score_opus":0.04403339357712774,"score_gpt":0.26483447846352914,"score_spread":0.2208010848864014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206946486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016520135,0.00013056031,0.97525716,0.000402691,0.00006893535,0.00013540128,0.0001899924,0.0014861657,0.00580899],"genre_scores_gemma":[0.46019074,0.00045367944,0.528677,0.0007811203,0.00019621779,0.0007076513,0.001050541,0.0006217596,0.007321286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99358046,0.0014881768,0.000999718,0.000756186,0.0026306177,0.0005449295],"domain_scores_gemma":[0.9882867,0.0056603495,0.0010585778,0.0021745777,0.0025072298,0.00031269036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045016436,0.0007753943,0.00040418294,0.0008890477,0.0006437672,0.0020413636,0.001408808,0.0010308768,0.0029731153],"category_scores_gemma":[0.011718358,0.0006945295,0.0015006707,0.0006502567,0.003178881,0.004075356,0.002581776,0.002471325,0.0008014957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076537886,0.00005340465,0.0009373902,0.00017807033,0.000019188965,0.00039813903,0.0012060787,0.013922371,0.0077849426,0.9501072,0.0014421339,0.023874523],"study_design_scores_gemma":[0.000110444584,0.00020534925,0.00036531882,0.000118881704,0.0000697766,0.0004360102,0.0004806598,0.13990031,0.021297345,0.78542835,0.0515095,0.00007799249],"about_ca_topic_score_codex":0.00320245,"about_ca_topic_score_gemma":0.0033431323,"teacher_disagreement_score":0.0045016436,"about_ca_system_score_codex":0.001512754,"about_ca_system_score_gemma":0.0030448732,"threshold_uncertainty_score":0.023807228},"labels":[],"label_agreement":null},{"id":"W3208121459","doi":"10.1007/s00446-021-00405-7","title":"On atomic registers and randomized consensus in M&amp;M systems","year":2021,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Remote direct memory access; Theory of computation; Randomized algorithm; Atomicity; Message passing; Process (computing); Theoretical computer science; Distributed computing; Algorithm; Operating system; Programming language","score_opus":0.01617471040368907,"score_gpt":0.25233766084053905,"score_spread":0.23616295043684998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208121459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032305565,0.0006502941,0.96070105,0.00079265045,0.000079821155,0.00008747581,0.000043570108,0.0004090085,0.0049305344],"genre_scores_gemma":[0.6761798,0.0009031331,0.31519544,0.00047628954,0.00022679368,0.0005010248,0.00015028537,0.00019772016,0.0061693997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944997,0.0022877872,0.0003062646,0.0011031252,0.0010460747,0.00075704954],"domain_scores_gemma":[0.98492646,0.010592445,0.0011416136,0.0021589573,0.00090457924,0.00027592186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004429774,0.00095481495,0.001547167,0.0010935711,0.0015309411,0.0020999587,0.0024515186,0.0023661882,0.003485514],"category_scores_gemma":[0.019138604,0.0007772745,0.0011654317,0.0014094375,0.003936548,0.005052507,0.0028618101,0.002957976,0.00063205406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004268541,0.000112485686,0.00074590824,0.00019645055,0.000046818757,0.00015019857,0.0002862851,0.50115854,0.005390222,0.4616519,0.0016696131,0.028164757],"study_design_scores_gemma":[0.00012146057,0.00016790869,0.00010524807,0.000035734927,0.000024276296,0.000046943165,0.000060657152,0.8321642,0.0036771763,0.16117914,0.0023830775,0.000034189354],"about_ca_topic_score_codex":0.0024920674,"about_ca_topic_score_gemma":0.0019909542,"teacher_disagreement_score":0.004429774,"about_ca_system_score_codex":0.0021235095,"about_ca_system_score_gemma":0.0021741416,"threshold_uncertainty_score":0.023427129},"labels":[],"label_agreement":null},{"id":"W3209321351","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise comparison; Population; Clique; Graph; Leader election; Discrete mathematics; Computer science; Line graph; Quadratic equation; Node (physics); Mathematics; Combinatorics; Theoretical computer science; Statistics","score_opus":0.015868861208871623,"score_gpt":0.2771996097140464,"score_spread":0.2613307485051748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209321351","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018143872,0.008398665,0.8330165,0.041854035,0.0138898315,0.0004547297,0.004093257,0.011886218,0.06826283],"genre_scores_gemma":[0.47288322,0.01721843,0.272489,0.01534648,0.015733058,0.0019487707,0.0161388,0.0049840873,0.1832581],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00054903957,0.000059556573,0.00025624703,0.00044411005,0.00017338194],"domain_scores_gemma":[0.9965233,0.0019993284,0.00016162738,0.00059849466,0.0004053889,0.0003116537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017264434,0.0008188316,0.0006655199,0.00077261555,0.00092464016,0.0019654143,0.0017766849,0.0019695002,0.03064284],"category_scores_gemma":[0.011992154,0.00058117777,0.000589774,0.0014533355,0.0009351564,0.0050410526,0.00216186,0.0036702275,0.009544404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006066499,0.000107725056,0.0007566516,0.00049843494,0.000108427674,0.00030991723,0.00026292342,0.02842205,0.007793032,0.34129256,0.43538523,0.18445644],"study_design_scores_gemma":[0.00032053882,0.00024488757,0.00063135085,0.00015547709,0.00006864142,0.00041811605,0.00008799783,0.14680375,0.0063744965,0.33645543,0.50833607,0.000103201026],"about_ca_topic_score_codex":0.0015522528,"about_ca_topic_score_gemma":0.001699155,"teacher_disagreement_score":0.03064284,"about_ca_system_score_codex":0.0017078586,"about_ca_system_score_gemma":0.00095381605,"threshold_uncertainty_score":0.10251051},"labels":[],"label_agreement":null},{"id":"W3209914086","doi":"10.1109/ccece53047.2021.9569177","title":"Multiple Leader PBFT Based Blockchain Architecture for IoT Domains: Invited Paper","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Byzantine fault tolerance; Computer science; Distributed computing; Consensus algorithm; Markov chain; Block (permutation group theory); Database transaction; Internet of Things; Computer network; Distributed ledger; Fault tolerance; Computer security; Algorithm; Mathematics","score_opus":0.015032295737025983,"score_gpt":0.23393216682110507,"score_spread":0.2188998710840791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209914086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13257399,0.0021692384,0.84737515,0.0012553865,0.00029989268,0.00016368431,0.000069459435,0.0008370696,0.015256141],"genre_scores_gemma":[0.9256401,0.001518362,0.060711756,0.00010559784,0.000084830586,0.00006756553,0.00008530403,0.00004197953,0.011744412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996799,0.00009727327,0.000012704449,0.000048382495,0.00010957388,0.000052118445],"domain_scores_gemma":[0.99962485,0.00009605305,0.000025612082,0.00007140664,0.00013120685,0.000050889288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056679954,0.00019893772,0.00032615362,0.00024382958,0.0005654179,0.00072783325,0.0007918593,0.00061095384,0.0027396192],"category_scores_gemma":[0.00077843457,0.00014293157,0.00020239693,0.00035362112,0.0005406667,0.001562246,0.0005918037,0.0005263122,0.00054926553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054397114,0.00020772396,0.004058268,0.0004292673,0.000087142806,0.0007522973,0.00066487107,0.47380224,0.04358238,0.17951745,0.0075195166,0.2888348],"study_design_scores_gemma":[0.000042156884,0.00019654821,0.00034552705,0.000033480963,0.000021780388,0.00020022684,0.00010216274,0.9337132,0.010488111,0.032173105,0.022662148,0.000021632315],"about_ca_topic_score_codex":0.0024141667,"about_ca_topic_score_gemma":0.0023749436,"teacher_disagreement_score":0.0027396192,"about_ca_system_score_codex":0.00055369246,"about_ca_system_score_gemma":0.0007568875,"threshold_uncertainty_score":0.009164929},"labels":[],"label_agreement":null},{"id":"W3210337868","doi":"10.4230/lipics.disc.2025.3","title":"An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Upper and lower bounds; Parallel computing; Shared memory; Randomized algorithm; Theoretical computer science; Distributed computing; Algorithm; Computer network; Mathematics","score_opus":0.05092475706012354,"score_gpt":0.20933417918491024,"score_spread":0.1584094221247867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210337868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15245704,0.002926657,0.78651506,0.01051819,0.0005721939,0.00038188588,0.0010335626,0.0033984606,0.042196907],"genre_scores_gemma":[0.83016604,0.0010215145,0.14856407,0.0016723943,0.0005457947,0.0006557434,0.0011217429,0.0012717452,0.014980871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934836,0.0015818836,0.00022552085,0.0012503923,0.0016548444,0.0018037969],"domain_scores_gemma":[0.957129,0.03327625,0.0017108037,0.00500965,0.00135822,0.0015160595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038930175,0.0015835667,0.0017005581,0.0011510947,0.0018189533,0.0047938586,0.0043358267,0.0019086666,0.010954513],"category_scores_gemma":[0.02774596,0.00062602735,0.0021697443,0.0014364942,0.0031649063,0.0122904265,0.0044036782,0.0060747173,0.0024009862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003686325,0.001184281,0.00904352,0.0013773687,0.00041588568,0.0006672119,0.0012839884,0.38608456,0.044169568,0.3775959,0.036158014,0.13833342],"study_design_scores_gemma":[0.00015740961,0.00025276732,0.0008871158,0.00006508894,0.000097525,0.00018643629,0.00012393942,0.7219451,0.010605929,0.26118007,0.004445855,0.000052763084],"about_ca_topic_score_codex":0.0016135112,"about_ca_topic_score_gemma":0.0019900317,"teacher_disagreement_score":0.010954513,"about_ca_system_score_codex":0.0034598557,"about_ca_system_score_gemma":0.0032940814,"threshold_uncertainty_score":0.036646426},"labels":[],"label_agreement":null},{"id":"W3211705538","doi":"10.1145/3477082","title":"TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020; Engineering and Physical Sciences Research Council; European Commission; UK Research and Innovation","keywords":"Liveness; Computer science; Blocking (statistics); Correctness; Separation logic; Abstraction; Programming language; Implementation; Mutual exclusion; Concurrency; Theoretical computer science; Model checking; Distributed computing","score_opus":0.01933573393885135,"score_gpt":0.2976680095504109,"score_spread":0.27833227561155954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211705538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005186878,0.000066650384,0.9917527,0.00020040065,0.000042646443,0.00007054072,0.00005310413,0.0017092833,0.0009178599],"genre_scores_gemma":[0.2443049,0.00023147516,0.7503478,0.00039749607,0.000092670314,0.00031053077,0.00032160812,0.000701149,0.0032924036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528426,0.0013664467,0.00043059443,0.00052409014,0.0018600642,0.00053462107],"domain_scores_gemma":[0.99139434,0.0047970186,0.00066574896,0.0014001213,0.0013164819,0.0004263248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007984689,0.0010483409,0.000919234,0.0016513814,0.0016058161,0.003891241,0.002821416,0.0017671107,0.003889705],"category_scores_gemma":[0.016340435,0.0012568317,0.0032011108,0.00063443254,0.0042732996,0.007793564,0.005637745,0.0050804997,0.00090583396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034486936,0.00020168905,0.0012284411,0.0005249723,0.00013178163,0.0007404193,0.0020045328,0.08519285,0.019785201,0.8083124,0.0033627702,0.07817013],"study_design_scores_gemma":[0.0001590787,0.00013243253,0.00014612493,0.00013198769,0.00013947795,0.0002657011,0.00028965494,0.44300056,0.027906174,0.50946355,0.01827956,0.00008557225],"about_ca_topic_score_codex":0.0046669296,"about_ca_topic_score_gemma":0.0054747136,"teacher_disagreement_score":0.007984689,"about_ca_system_score_codex":0.0021319876,"about_ca_system_score_gemma":0.003950869,"threshold_uncertainty_score":0.042227566},"labels":[],"label_agreement":null},{"id":"W325001613","doi":"10.1109/apcc.2005.1554236","title":"NEST: NEtwork Server Tool","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Server; Compiler; Application server; Operating system; Server farm; Programming language; Process (computing); Client–server model","score_opus":0.008668091785838659,"score_gpt":0.2164293971392343,"score_spread":0.20776130535339563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W325001613","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004392185,0.00024622516,0.48960048,0.00027201406,0.00014718923,0.00033539004,0.0077539063,0.47634766,0.020905001],"genre_scores_gemma":[0.15651025,0.00095165963,0.5575156,0.0012229461,0.0001478558,0.0021384445,0.071925424,0.14268994,0.06689794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894685,0.00016361449,0.00010497083,0.00012862914,0.000527784,0.00012827854],"domain_scores_gemma":[0.9982697,0.00071137684,0.00013749304,0.0003184282,0.0004588988,0.00010422508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012825484,0.0012317542,0.000700408,0.0014033514,0.00043067205,0.0014409032,0.002725697,0.0010449671,0.050919063],"category_scores_gemma":[0.005209801,0.0010961932,0.0007391009,0.0007640841,0.0006014036,0.003423877,0.0018960347,0.0020009857,0.02928127],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009784021,0.00020843506,0.0036253242,0.001205693,0.00009307526,0.00092619564,0.0004725629,0.020961992,0.023971844,0.045895703,0.6665049,0.23515594],"study_design_scores_gemma":[0.00039748807,0.00015606494,0.0014023694,0.00022802906,0.000057953173,0.001198841,0.0001281485,0.21083896,0.05875097,0.032980513,0.6937041,0.00015652031],"about_ca_topic_score_codex":0.0017011864,"about_ca_topic_score_gemma":0.0017813246,"teacher_disagreement_score":0.050919063,"about_ca_system_score_codex":0.0007906296,"about_ca_system_score_gemma":0.0013325175,"threshold_uncertainty_score":0.1703412},"labels":[],"label_agreement":null},{"id":"W39924371","doi":"10.1007/978-3-540-75142-7_38","title":"Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Fault tolerance; Implementation; Set (abstract data type); Models of communication; Distributed computing; Theoretical computer science; State (computer science); Message passing; Fault model; Model checking; Parallel computing; Programming language","score_opus":0.02415324342239464,"score_gpt":0.2774749835312237,"score_spread":0.253321740108829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39924371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08269786,0.00023390693,0.89837444,0.0008828738,0.0002295948,0.00009593269,0.00009728408,0.0011860332,0.016202226],"genre_scores_gemma":[0.7753179,0.00031391194,0.21053977,0.0002946873,0.00017982755,0.00025653813,0.0002032279,0.00030256534,0.012591516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986374,0.00035277294,0.00012509838,0.00013138234,0.00056980265,0.00018354354],"domain_scores_gemma":[0.99473274,0.0019591593,0.00032393512,0.002059766,0.00069762906,0.00022677078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022711763,0.00042894078,0.0006825269,0.00061107584,0.0012256352,0.0024749846,0.0034180423,0.0012864745,0.0068646655],"category_scores_gemma":[0.007499876,0.0005350663,0.00053767575,0.00082197663,0.0017112015,0.0063287746,0.0021433572,0.0029543554,0.00080952863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033764442,0.000121463054,0.00028372338,0.00012499475,0.000022886266,0.00007067884,0.0005039591,0.029747944,0.0087650325,0.9313359,0.0021425441,0.026543232],"study_design_scores_gemma":[0.00011244226,0.00010352356,0.00012202583,0.000026222127,0.00004922481,0.00007454916,0.000114123155,0.43007183,0.009611746,0.5505106,0.009174038,0.00002974251],"about_ca_topic_score_codex":0.0011471191,"about_ca_topic_score_gemma":0.001858657,"teacher_disagreement_score":0.0068646655,"about_ca_system_score_codex":0.001172408,"about_ca_system_score_gemma":0.0010033533,"threshold_uncertainty_score":0.022964597},"labels":[],"label_agreement":null},{"id":"W41280816","doi":"10.1007/978-0-387-74483-4_2","title":"An Overview of a Distributed System","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.0510215087169218,"score_gpt":0.2702512629977728,"score_spread":0.219229754280851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41280816","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015198952,0.21554849,0.2081116,0.0049258745,0.004022088,0.00024652798,0.00048614547,0.0030062227,0.5621332],"genre_scores_gemma":[0.025998162,0.22164617,0.172476,0.003510542,0.0039226604,0.0004991442,0.0010599624,0.001365859,0.5695215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963856,0.000044199907,0.000024459465,0.00005948746,0.0001998921,0.00003350637],"domain_scores_gemma":[0.9997485,0.000084576255,0.000008596759,0.000036100977,0.00009070844,0.00003148804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003785946,0.0008944712,0.0006993102,0.0017142212,0.0010388211,0.0032169688,0.0011836839,0.0016756863,0.032060623],"category_scores_gemma":[0.00068317214,0.0007254487,0.00046643772,0.0030827746,0.00083376205,0.0044123665,0.001566761,0.0021709423,0.018532977],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047283105,0.000087661814,0.00013567427,0.0010669947,0.00001708238,0.00016191027,0.00041810228,0.00307228,0.0032462974,0.27337193,0.19381562,0.52455914],"study_design_scores_gemma":[0.0000063850166,0.000015950909,0.000070937735,0.00016553066,0.00000635165,0.0001673141,0.00003158337,0.00095136295,0.00020729749,0.032763798,0.9656047,0.0000087723765],"about_ca_topic_score_codex":0.0016815453,"about_ca_topic_score_gemma":0.0021031997,"teacher_disagreement_score":0.032060623,"about_ca_system_score_codex":0.0011472818,"about_ca_system_score_gemma":0.0016362789,"threshold_uncertainty_score":0.10725349},"labels":[],"label_agreement":null},{"id":"W4200013042","doi":"10.32920/17131631.v1","title":"Deployment Of Robot Arms With A Leader-Follower Approach For Bomb Disposal","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Software deployment; Robot; Computer security; Rescue robot; Terrorism; Hazardous waste; Computer science; Robotic arm; Operator (biology); Risk analysis (engineering); Engineering; Business; Artificial intelligence; Mobile robot; Political science; Law","score_opus":0.025297142735185144,"score_gpt":0.2500058542879933,"score_spread":0.2247087115528082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200013042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42529577,0.0004179374,0.54481286,0.00068633136,0.00018799957,0.0002524022,0.00006037755,0.0016622705,0.026624143],"genre_scores_gemma":[0.84303457,0.0001584286,0.14834347,0.0000840949,0.000017336513,0.000087822365,0.000052004354,0.000041102518,0.008181142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981934,0.000048262133,0.0000063060593,0.0000377666,0.000048745605,0.000039617426],"domain_scores_gemma":[0.9998136,0.00004005836,0.000031616568,0.00004572741,0.00003176314,0.00003729145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281614,0.0003107586,0.00021156599,0.00023094493,0.00038464635,0.0003605421,0.000599811,0.00066836627,0.0030258435],"category_scores_gemma":[0.00049403455,0.00013407055,0.00021306647,0.00009489869,0.00034851403,0.0004431629,0.000841644,0.00039489756,0.0008550476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063979893,0.00049074367,0.0062096515,0.00028354675,0.000060032315,0.0016124899,0.0014026748,0.20543656,0.34387633,0.013972646,0.00600045,0.42001507],"study_design_scores_gemma":[0.00015448256,0.0027278839,0.0039059499,0.000064471235,0.000048782065,0.0009277166,0.00093190646,0.862844,0.08655645,0.006947197,0.03483421,0.00005701015],"about_ca_topic_score_codex":0.0007027444,"about_ca_topic_score_gemma":0.0012392652,"teacher_disagreement_score":0.0030258435,"about_ca_system_score_codex":0.00020783157,"about_ca_system_score_gemma":0.00029379997,"threshold_uncertainty_score":0.010122418},"labels":[],"label_agreement":null},{"id":"W4200418707","doi":"10.32920/17131631","title":"Deployment Of Robot Arms With A Leader-Follower Approach For Bomb Disposal","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Software deployment; Robot; Computer security; Rescue robot; Terrorism; Computer science; Hazardous waste; Operator (biology); Robotic arm; Risk analysis (engineering); Engineering; Human–computer interaction; Business; Artificial intelligence; Mobile robot; Political science; Law","score_opus":0.025297142735185144,"score_gpt":0.2500058542879933,"score_spread":0.2247087115528082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200418707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42529577,0.0004179374,0.54481286,0.00068633136,0.00018799957,0.0002524022,0.00006037755,0.0016622705,0.026624143],"genre_scores_gemma":[0.84303457,0.0001584286,0.14834347,0.0000840949,0.000017336513,0.000087822365,0.000052004354,0.000041102518,0.008181142],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981934,0.000048262133,0.0000063060593,0.0000377666,0.000048745605,0.000039617426],"domain_scores_gemma":[0.9998136,0.00004005836,0.000031616568,0.00004572741,0.00003176314,0.00003729145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281614,0.0003107586,0.00021156599,0.00023094493,0.00038464635,0.0003605421,0.000599811,0.00066836627,0.0030258435],"category_scores_gemma":[0.00049403455,0.00013407055,0.00021306647,0.00009489869,0.00034851403,0.0004431629,0.000841644,0.00039489756,0.0008550476],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063979893,0.00049074367,0.0062096515,0.00028354675,0.000060032315,0.0016124899,0.0014026748,0.20543656,0.34387633,0.013972646,0.00600045,0.42001507],"study_design_scores_gemma":[0.00015448256,0.0027278839,0.0039059499,0.000064471235,0.000048782065,0.0009277166,0.00093190646,0.862844,0.08655645,0.006947197,0.03483421,0.00005701015],"about_ca_topic_score_codex":0.0007027444,"about_ca_topic_score_gemma":0.0012392652,"teacher_disagreement_score":0.0030258435,"about_ca_system_score_codex":0.00020783157,"about_ca_system_score_gemma":0.00029379997,"threshold_uncertainty_score":0.010122418},"labels":[],"label_agreement":null},{"id":"W4205177387","doi":"10.1109/tnet.2021.3126203","title":"Accelerating Reads With In-Network Consistency-Aware Load Balancing","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Load balancing (electrical power); Pipeline (software); Latency (audio); Distributed computing; Consistency (knowledge bases); Network packet; Associative array; Computer network; Real-time computing; Operating system; Grid; Artificial intelligence","score_opus":0.02511280640174448,"score_gpt":0.24210917407825333,"score_spread":0.21699636767650884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205177387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11113868,0.00039922903,0.8638853,0.00040253755,0.0002561011,0.0002245032,0.00019351851,0.014081975,0.009418163],"genre_scores_gemma":[0.75961655,0.00016711379,0.23053744,0.00023943995,0.00012867355,0.00016015177,0.00042344246,0.0005382084,0.008189033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00015622961,0.00006325456,0.00018297328,0.0004219777,0.00016370037],"domain_scores_gemma":[0.99787664,0.0004948327,0.00019008506,0.0007868925,0.00053998426,0.00011157752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010848809,0.0007053582,0.0005029627,0.00075873075,0.00087770744,0.0013430038,0.0030340957,0.000591756,0.0037957123],"category_scores_gemma":[0.0030804381,0.00034588343,0.00026170383,0.0007155719,0.0005661883,0.0027317384,0.001805804,0.001166233,0.0009238295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013692467,0.0008695361,0.005581936,0.00039040446,0.00017617445,0.0004036082,0.00085900415,0.28274626,0.16653886,0.025236849,0.020385426,0.49544278],"study_design_scores_gemma":[0.00011568173,0.00033197275,0.0006681231,0.000015481335,0.000046126963,0.00015962175,0.00017049401,0.8692998,0.10672082,0.009864369,0.012561571,0.0000458832],"about_ca_topic_score_codex":0.0028505153,"about_ca_topic_score_gemma":0.004717993,"teacher_disagreement_score":0.0037957123,"about_ca_system_score_codex":0.0008549466,"about_ca_system_score_gemma":0.0012846831,"threshold_uncertainty_score":0.012697935},"labels":[],"label_agreement":null},{"id":"W4205726859","doi":"10.5539/nct.v6n2p10","title":"Management of Celestial Systems under Spatial Grasp Model","year":2021,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Constellation; Computer science; GRASP; Architecture; Plan (archaeology); Satellite; Telecommunications; Distributed computing; Systems engineering; Computer security; Engineering; Aerospace engineering; Software engineering; Geography","score_opus":0.01611885245329609,"score_gpt":0.23320175437957388,"score_spread":0.2170829019262778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205726859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11262693,0.001601218,0.8184649,0.0021556588,0.00020751292,0.00013790764,0.00035424758,0.0011236254,0.06332793],"genre_scores_gemma":[0.9623263,0.0011136058,0.023124805,0.00014926476,0.000107237145,0.00011622734,0.00024880105,0.00004055717,0.012773224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.00009680409,0.00003277635,0.00009791325,0.00017925163,0.00011153597],"domain_scores_gemma":[0.9996505,0.000081284794,0.000065612956,0.000066738365,0.00008086202,0.000054899163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034637048,0.00038245684,0.00046176207,0.00048548522,0.0007232216,0.0023771971,0.00091333437,0.0007349135,0.0036222448],"category_scores_gemma":[0.0010661255,0.00016668964,0.00042713358,0.0007639101,0.0009153212,0.002454725,0.0016993539,0.0007566322,0.00052001217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009296232,0.000035485842,0.0019986294,0.00014068399,0.000038083206,0.00065710547,0.00042034118,0.54182893,0.003810748,0.40288025,0.0041634883,0.04393321],"study_design_scores_gemma":[0.000024580679,0.00008145536,0.00046032615,0.00001669083,0.000018606832,0.00017072936,0.00027051734,0.88288534,0.00083070435,0.10404377,0.011181116,0.000016162257],"about_ca_topic_score_codex":0.006083943,"about_ca_topic_score_gemma":0.003278631,"teacher_disagreement_score":0.006083943,"about_ca_system_score_codex":0.0011844379,"about_ca_system_score_gemma":0.0012865566,"threshold_uncertainty_score":0.012117565},"labels":[],"label_agreement":null},{"id":"W4206140561","doi":"10.1007/978-3-030-92790-5_8","title":"On the Communication Requirements of Decentralized Connectivity Control","year":2022,"lang":"en","type":"book-chapter","venue":"Springer proceedings in advanced robotics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Exploit; Computer science; Distributed computing; Redundancy (engineering); Implementation; Robot; Decentralised system; Graph; Algebraic connectivity; Software; Control (management); Theoretical computer science; Software engineering; Artificial intelligence; Computer security; Programming language; Operating system","score_opus":0.022293563480664313,"score_gpt":0.25130834784353184,"score_spread":0.22901478436286754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206140561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06907913,0.0072336625,0.6695905,0.00796782,0.0008639922,0.00010850452,0.00035418323,0.00041533704,0.24438699],"genre_scores_gemma":[0.94399416,0.0038015035,0.033206034,0.0005689604,0.00083822355,0.0002460843,0.00024361636,0.00021887815,0.01688254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991215,0.00023565146,0.00003282148,0.00010570904,0.00040336727,0.00010088501],"domain_scores_gemma":[0.9945873,0.0045605144,0.0001753781,0.00027254116,0.00030971886,0.00009454571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685589,0.00053231855,0.0008805429,0.00056347495,0.0007650965,0.0015763275,0.0010913366,0.0012463862,0.008486925],"category_scores_gemma":[0.008014715,0.0004722499,0.00033072763,0.0009821198,0.0014552223,0.0036212432,0.0013530505,0.0018557108,0.00068129186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018799231,0.000038948954,0.00019529865,0.00022602877,0.000015364549,0.00015396664,0.00014767186,0.15598357,0.0039933817,0.78427804,0.00874471,0.046034895],"study_design_scores_gemma":[0.000043546792,0.000066785346,0.00039342212,0.000065008906,0.000015727235,0.0001618662,0.00007712507,0.31522208,0.0012522319,0.6717655,0.010916034,0.000020701962],"about_ca_topic_score_codex":0.0012240001,"about_ca_topic_score_gemma":0.0008534843,"teacher_disagreement_score":0.008486925,"about_ca_system_score_codex":0.0009415043,"about_ca_system_score_gemma":0.0005075354,"threshold_uncertainty_score":0.0283916},"labels":[],"label_agreement":null},{"id":"W4206506156","doi":"10.1007/10720107_21","title":"Performance of Protocols","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Block cipher; CONTEST; Encryption; NIST; Computer security; Advanced Encryption Standard; Cryptography; Political science; Law","score_opus":0.016436553190073613,"score_gpt":0.2531006181311678,"score_spread":0.23666406494109418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206506156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11605482,0.007798158,0.43532634,0.0074367207,0.0020788596,0.00057364017,0.002475323,0.012682649,0.41557354],"genre_scores_gemma":[0.8533796,0.0023926736,0.061524,0.00061166636,0.0007629932,0.000498784,0.002636502,0.0018774214,0.07631642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914767,0.0019786668,0.00033740595,0.0011148485,0.004155772,0.0009365002],"domain_scores_gemma":[0.9841061,0.0062324926,0.00058237603,0.006328536,0.002128175,0.00062233006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004860449,0.0014294153,0.0012184132,0.0019129725,0.0016171887,0.006998876,0.0020356847,0.0019032421,0.03510304],"category_scores_gemma":[0.023035547,0.00084752653,0.0006198133,0.0022402168,0.0019096668,0.008926177,0.0031611505,0.002754523,0.008057565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084002374,0.00033855136,0.0019495342,0.000324107,0.00007925801,0.0001135663,0.00041091995,0.036424153,0.011685687,0.7105674,0.038901523,0.1983652],"study_design_scores_gemma":[0.0001277719,0.00038537142,0.0016072217,0.00012780151,0.00010474197,0.00038842595,0.00034717662,0.29350722,0.038825504,0.5849211,0.07959441,0.00006313771],"about_ca_topic_score_codex":0.0008876671,"about_ca_topic_score_gemma":0.0005382849,"teacher_disagreement_score":0.03510304,"about_ca_system_score_codex":0.002315992,"about_ca_system_score_gemma":0.0025770562,"threshold_uncertainty_score":0.1174314},"labels":[],"label_agreement":null},{"id":"W4206676904","doi":"10.1145/1218063.1217937","title":"Fireflies","year":2006,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PlanetLab; Computer science; Scalability; Computer network; Protocol (science); Set (abstract data type); Distributed computing; Intrusion; Operating system","score_opus":0.016156130884878103,"score_gpt":0.2634790050626419,"score_spread":0.24732287417776377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206676904","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026825467,0.009432223,0.2632368,0.0049023437,0.0036236627,0.0017801526,0.008433006,0.33363342,0.34813288],"genre_scores_gemma":[0.13088322,0.010466795,0.34177002,0.004535116,0.0009861571,0.0017767155,0.039153546,0.04067368,0.42975473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922943,0.00008481918,0.000033785327,0.00011674755,0.00041211466,0.00012306025],"domain_scores_gemma":[0.9989434,0.00022155549,0.00006692901,0.00023847359,0.00031995523,0.00020966413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013716468,0.0011128056,0.0006616842,0.0013308034,0.00088923017,0.0016572366,0.0025762855,0.0012178035,0.030561177],"category_scores_gemma":[0.0029561033,0.0006282919,0.00091072486,0.000799893,0.0005339389,0.0026438774,0.0019898724,0.0020419124,0.02337438],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012069687,0.00040332266,0.0021959161,0.000962093,0.00010602009,0.0003721455,0.00043912855,0.008289068,0.019447923,0.038652327,0.5674096,0.36051553],"study_design_scores_gemma":[0.00020130152,0.00023813537,0.0009750319,0.0001283433,0.00004612236,0.00039108092,0.00005209782,0.0183346,0.00802444,0.0075062304,0.9640159,0.0000867934],"about_ca_topic_score_codex":0.0049795546,"about_ca_topic_score_gemma":0.0056245285,"teacher_disagreement_score":0.030561177,"about_ca_system_score_codex":0.0010203078,"about_ca_system_score_gemma":0.0011872606,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4207079208","doi":"10.1145/3491003.3491012","title":"Antipaxos: Taking Interactive Consistency to the Next Level","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Liveness; Computer science; Scalability; Distributed computing; Latency (audio); Consistency (knowledge bases); Cloud computing; Crash; Protocol (science); Path (computing); Eventual consistency; Quantum Byzantine agreement; Byzantine fault tolerance; Theoretical computer science; Computer network; Fault tolerance; Data consistency; Consistency model; Operating system","score_opus":0.0792254035314665,"score_gpt":0.2897041528384329,"score_spread":0.21047874930696642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207079208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023345573,0.00013144748,0.970691,0.00046463503,0.00014358158,0.00012995313,0.000039099803,0.0016271414,0.0034275122],"genre_scores_gemma":[0.5784145,0.0002296397,0.41415113,0.00048239483,0.00015973487,0.00038702117,0.0001759136,0.00038058264,0.0056191594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751437,0.0007202941,0.00013860845,0.0005019642,0.0008751248,0.000249658],"domain_scores_gemma":[0.99422836,0.0020614043,0.00061010534,0.0019636904,0.0008092308,0.00032715657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033203238,0.00055017095,0.00062984833,0.00062109827,0.0011673761,0.0016595402,0.003517838,0.0010656406,0.0033682818],"category_scores_gemma":[0.0074148388,0.00044676618,0.000695826,0.00044721802,0.0020922539,0.004723634,0.0044563035,0.0029803074,0.00060746795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010404252,0.00034770402,0.0049798586,0.0006040862,0.00022282152,0.0005654493,0.001863231,0.10177639,0.05994314,0.49467024,0.0087804925,0.32520625],"study_design_scores_gemma":[0.00034407404,0.0007788913,0.000715785,0.00009396545,0.00011469851,0.0005132368,0.00044814943,0.63607204,0.07146329,0.2351074,0.054234877,0.00011361116],"about_ca_topic_score_codex":0.0009748877,"about_ca_topic_score_gemma":0.0008326668,"teacher_disagreement_score":0.003517838,"about_ca_system_score_codex":0.0005971057,"about_ca_system_score_gemma":0.0018089216,"threshold_uncertainty_score":0.017559767},"labels":[],"label_agreement":null},{"id":"W4210459942","doi":"10.1016/j.tcs.2008.02.008","title":"On fractional dynamic faults with thresholds","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hypercube; Broadcasting (networking); Chordal graph; Simple (philosophy); Time complexity; Constant (computer programming); Set (abstract data type); Enhanced Data Rates for GSM Evolution; Focus (optics); Theoretical computer science; Leader election; Distributed computing; Topology (electrical circuits); Computer network; Algorithm; Mathematics; Graph; Combinatorics; Parallel computing; Telecommunications","score_opus":0.007390070477403671,"score_gpt":0.23384963839680353,"score_spread":0.22645956791939986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210459942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3768953,0.0035717,0.529526,0.0049927835,0.0013734496,0.00007013306,0.0001956033,0.00062570104,0.0827494],"genre_scores_gemma":[0.9816383,0.0006719112,0.009500572,0.00033541827,0.00026330547,0.00002699981,0.000058108573,0.0000798127,0.0074255224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00014599194,0.00003200882,0.00008986758,0.00022395095,0.00018339753],"domain_scores_gemma":[0.99524707,0.0031782922,0.00033090054,0.0005318003,0.00042718195,0.00028477027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937633,0.0007268244,0.00088076486,0.0019063406,0.0011086124,0.0019872133,0.0010223162,0.0014027,0.005180706],"category_scores_gemma":[0.009348252,0.00031670672,0.00043023808,0.001437756,0.0029393225,0.004344052,0.0025486457,0.0019564377,0.0002982947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022278965,0.000030602147,0.00038227174,0.00007270917,0.000011130838,0.00021875175,0.00020846065,0.039464954,0.002657948,0.93885714,0.0016561984,0.016216952],"study_design_scores_gemma":[0.000021532682,0.000029686009,0.00017328474,0.000024610988,0.000010990174,0.00013085722,0.000079243815,0.11415291,0.0011552543,0.88272136,0.0014857997,0.000014389318],"about_ca_topic_score_codex":0.0010860943,"about_ca_topic_score_gemma":0.0005149988,"teacher_disagreement_score":0.005180706,"about_ca_system_score_codex":0.0016250313,"about_ca_system_score_gemma":0.00053838495,"threshold_uncertainty_score":0.017331243},"labels":[],"label_agreement":null},{"id":"W4211221909","doi":"10.1007/978-3-662-04558-9_9","title":"Deadlock-freeness","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Deadlock; Correctness; Property (philosophy); Deadlock prevention algorithms; Computer science; Set (abstract data type); Theoretical computer science; Programming language; Philosophy; Epistemology","score_opus":0.018319305813084018,"score_gpt":0.21970344373700348,"score_spread":0.20138413792391946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211221909","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004213476,0.0053190663,0.1500679,0.0024641412,0.000991713,0.00010391135,0.00017176503,0.00063789485,0.8360302],"genre_scores_gemma":[0.2564098,0.009889206,0.07743656,0.0026680953,0.0012617627,0.0005723668,0.0006696121,0.00086756784,0.650225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928135,0.00011585785,0.000036571484,0.00019602888,0.00027769938,0.000092524664],"domain_scores_gemma":[0.99920624,0.00031925598,0.000030127649,0.00022274315,0.00017852637,0.000043043896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817234,0.00087035826,0.0006297868,0.00093539024,0.0013686032,0.002466903,0.0009772899,0.0010090581,0.023428665],"category_scores_gemma":[0.0022641455,0.00055398466,0.0004932353,0.0009105205,0.003007754,0.005167986,0.0019560505,0.0027857427,0.0066239564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010997446,0.000018445626,0.000035674977,0.000075434014,0.000004533385,0.000027855598,0.0002545272,0.00053598423,0.0008407568,0.9186649,0.021214595,0.058316454],"study_design_scores_gemma":[0.000007839686,0.000013250817,0.000059976315,0.00005288663,0.0000072620055,0.0001222536,0.000046675093,0.0008643288,0.0012609098,0.84956336,0.14799283,0.000008437662],"about_ca_topic_score_codex":0.00047019357,"about_ca_topic_score_gemma":0.0005186591,"teacher_disagreement_score":0.023428665,"about_ca_system_score_codex":0.0010010784,"about_ca_system_score_gemma":0.001080711,"threshold_uncertainty_score":0.07837671},"labels":[],"label_agreement":null},{"id":"W4214713403","doi":"10.1145/571842.571846","title":"A highly concurrent group mutual <i>l</i>-exclusion algorithm<sup>0</sup>","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Computer science; Group (periodic table); Programming language; Chemistry","score_opus":0.01590357891669144,"score_gpt":0.22294270622739287,"score_spread":0.20703912731070143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214713403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049181923,0.00016361494,0.93943983,0.0002460906,0.00008366896,0.00011447178,0.00007751164,0.0025627753,0.008130052],"genre_scores_gemma":[0.38649282,0.00007811523,0.60442215,0.00014049187,0.000050488878,0.00011528783,0.00021489854,0.00021294491,0.008272835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00008407603,0.000022774007,0.000077368175,0.00014622038,0.00006701675],"domain_scores_gemma":[0.9990909,0.00025528934,0.00006542931,0.00023772242,0.00023904395,0.00011168091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624903,0.0003006261,0.00041577112,0.00037226346,0.000993494,0.00074933254,0.0016502182,0.0005949019,0.004303777],"category_scores_gemma":[0.0015783176,0.00015269217,0.00021793097,0.00051801826,0.0004845303,0.0008973774,0.0012763877,0.0004928192,0.0010343002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016029209,0.00051808544,0.0031843993,0.0002316237,0.00008094263,0.00032121537,0.00053421117,0.07293341,0.08576742,0.07130768,0.014113799,0.74940425],"study_design_scores_gemma":[0.00043375065,0.00056896004,0.0011129619,0.000032394433,0.00007400309,0.0005173247,0.00010992474,0.8527361,0.047786053,0.059014104,0.037553765,0.000060586364],"about_ca_topic_score_codex":0.0019741256,"about_ca_topic_score_gemma":0.003136183,"teacher_disagreement_score":0.004303777,"about_ca_system_score_codex":0.00047015146,"about_ca_system_score_gemma":0.00095952925,"threshold_uncertainty_score":0.014397562},"labels":[],"label_agreement":null},{"id":"W4214899899","doi":"10.1109/icws.2004.1314742","title":"Comparison of UDDI registry replication strategies","year":2004,"lang":"en","type":"article","venue":"Proceedings. IEEE International Conference on Web Services, 2004.","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Computer science; Middleware (distributed applications); Throughput; Web service; WS-I Basic Profile; Distributed computing; Computer network; World Wide Web; Operating system; Wireless; Biology; Web application security","score_opus":0.055537478822737484,"score_gpt":0.3467400503969997,"score_spread":0.2912025715742622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214899899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41259298,0.029300772,0.421655,0.0034545527,0.0017782877,0.0039442917,0.003539031,0.025107635,0.098627426],"genre_scores_gemma":[0.6621663,0.008891762,0.3068175,0.00068556285,0.00014797917,0.0011124751,0.0062704952,0.0012072681,0.0127005875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.985149,0.004622316,0.0024902169,0.0011114144,0.005452583,0.0011745498],"domain_scores_gemma":[0.9778683,0.007382991,0.0010799263,0.005652385,0.006981228,0.0010352399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014093801,0.0013916615,0.001402879,0.0040083453,0.0013717911,0.0043833833,0.004958576,0.0017741632,0.0020280636],"category_scores_gemma":[0.025747245,0.0009528112,0.0010488069,0.005217165,0.00068387535,0.0045995014,0.0021495454,0.001185797,0.0018766981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047283387,0.0016299876,0.017162662,0.0028776384,0.0006590225,0.00056168373,0.0015809987,0.096378095,0.054289736,0.06503965,0.04045116,0.71464115],"study_design_scores_gemma":[0.0015761993,0.0038538063,0.020721866,0.0006413428,0.001081841,0.0028717853,0.0053234412,0.585062,0.13919732,0.018119125,0.22077544,0.00077583914],"about_ca_topic_score_codex":0.003899743,"about_ca_topic_score_gemma":0.0034711328,"teacher_disagreement_score":0.014093801,"about_ca_system_score_codex":0.0026135263,"about_ca_system_score_gemma":0.0026089386,"threshold_uncertainty_score":0.074536026},"labels":[],"label_agreement":null},{"id":"W4220661618","doi":"10.1145/3503221.3508441","title":"Elimination (a,b)-trees with fast, durable updates","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Implementation; Key (lock); Tree (set theory); Feature (linguistics); Operating system; Distributed computing; Data structure; Programming language; Mathematics","score_opus":0.006005211542764363,"score_gpt":0.1970560160162706,"score_spread":0.19105080447350622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220661618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2723204,0.0022249792,0.68309855,0.00066621735,0.00030669433,0.0005018007,0.0012485216,0.022716915,0.016915936],"genre_scores_gemma":[0.42773667,0.0006060565,0.5552036,0.0003919153,0.00012885928,0.00034610063,0.002770946,0.0013272873,0.011488581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932146,0.0000661844,0.00007764262,0.000114516595,0.0002808675,0.00013929115],"domain_scores_gemma":[0.99579227,0.00079641753,0.0004767951,0.0015184067,0.0011522295,0.00026390003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066325883,0.00060634926,0.00044608527,0.0009928902,0.0008582723,0.0012208575,0.0022223147,0.00054071925,0.0037357202],"category_scores_gemma":[0.0030858344,0.0004902539,0.0004332549,0.0021457705,0.00057463255,0.0025940323,0.0015855371,0.00097116845,0.0017548224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001320822,0.00084864674,0.010359316,0.00086190866,0.00013765946,0.00035976106,0.00043638394,0.043716732,0.16599415,0.03073828,0.032239687,0.71298665],"study_design_scores_gemma":[0.0008258814,0.002010613,0.0056262696,0.00015873411,0.00026115435,0.0015816061,0.00061932043,0.55549026,0.25242904,0.058813542,0.12199254,0.00019104456],"about_ca_topic_score_codex":0.003415029,"about_ca_topic_score_gemma":0.008495483,"teacher_disagreement_score":0.0037357202,"about_ca_system_score_codex":0.00067476387,"about_ca_system_score_gemma":0.0016040609,"threshold_uncertainty_score":0.012497246},"labels":[],"label_agreement":null},{"id":"W4224219583","doi":"10.1016/j.robot.2022.104361","title":"Message flow analysis with complex causal links for distributed ROS 2 systems","year":2023,"lang":"en","type":"preprint","venue":"Robotics and Autonomous Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Executor; Bottleneck; Distributed computing; Tracing; Leverage (statistics); Scheduling (production processes); Source code; Modular design; Executable; Embedded system; Programming language; Artificial intelligence","score_opus":0.03783990464222472,"score_gpt":0.2639117578557301,"score_spread":0.2260718532135054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224219583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022164127,0.000095626194,0.9756389,0.00016757217,0.000028282067,0.000028106031,0.000051122617,0.00027454528,0.0015516534],"genre_scores_gemma":[0.90324897,0.00019572921,0.09068208,0.0000740361,0.00008670129,0.00010006752,0.0001448332,0.00017542561,0.005292121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995633,0.00012788046,0.000016205111,0.00006477996,0.00016042923,0.00006749187],"domain_scores_gemma":[0.99847215,0.0009972363,0.00016000913,0.00012284554,0.00020336141,0.000044381184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552526,0.0005944686,0.00053745974,0.0009878498,0.0005261425,0.0010570165,0.00076270185,0.0007657953,0.0031601305],"category_scores_gemma":[0.004410976,0.0003253406,0.00042711932,0.00049134047,0.00071128155,0.0016479588,0.0010471012,0.0010239556,0.00019785379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101268655,0.000051917334,0.00067883864,0.00006200137,0.000023917837,0.00006708614,0.00010004695,0.87474984,0.0028593205,0.094776765,0.0009571443,0.02557184],"study_design_scores_gemma":[0.0000039303777,0.0000047252597,0.000042413485,0.000002038178,0.0000019723416,0.000002195328,0.000006017485,0.9835904,0.00032124334,0.015843285,0.00017985249,0.0000019431673],"about_ca_topic_score_codex":0.004379171,"about_ca_topic_score_gemma":0.0025692803,"teacher_disagreement_score":0.004379171,"about_ca_system_score_codex":0.0007974914,"about_ca_system_score_gemma":0.00096828624,"threshold_uncertainty_score":0.010571659},"labels":[],"label_agreement":null},{"id":"W4224862013","doi":"10.48550/arxiv.2204.10792","title":"Equivalence of Decentralized Observation, Diagnosis, and Control Problems in Discrete-event Systems","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Undecidable problem; Equivalence (formal languages); Turing; Mathematics; Computer science; Turing machine; Event (particle physics); Theoretical computer science; Discrete mathematics; Algorithm; Decidability; Programming language","score_opus":0.06720155860207279,"score_gpt":0.20778056703378156,"score_spread":0.14057900843170879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224862013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06879584,0.00036342844,0.91639096,0.0028615945,0.000117445146,0.0002791319,0.00016680737,0.00035953845,0.010665301],"genre_scores_gemma":[0.890187,0.00033004882,0.10408887,0.0003769211,0.00021637803,0.00038791966,0.0003731058,0.00006483756,0.003974895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99210984,0.0027552086,0.00055873086,0.001417491,0.002410369,0.00074841565],"domain_scores_gemma":[0.97633886,0.019086273,0.00082044385,0.0020956183,0.001172953,0.00048580492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409682,0.00056641124,0.0010075168,0.0005941933,0.0012424428,0.003162219,0.0015251937,0.0018656523,0.0030210917],"category_scores_gemma":[0.018743513,0.0003845178,0.0012644299,0.00062733726,0.0048790094,0.0069952244,0.0031294075,0.0046411124,0.00017079053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015257209,0.00026497166,0.00096015853,0.00016815419,0.00004914289,0.00020541532,0.0006474649,0.09272269,0.001994352,0.8650301,0.0012944797,0.036510434],"study_design_scores_gemma":[0.000087186825,0.000055733297,0.00037725948,0.000021260903,0.000021199292,0.00006295902,0.00016660102,0.21218714,0.0028475774,0.7817182,0.0024354556,0.000019404019],"about_ca_topic_score_codex":0.0037820388,"about_ca_topic_score_gemma":0.0019254219,"teacher_disagreement_score":0.004409682,"about_ca_system_score_codex":0.0026303802,"about_ca_system_score_gemma":0.002852826,"threshold_uncertainty_score":0.023320913},"labels":[],"label_agreement":null},{"id":"W4225381858","doi":"10.1145/3533318","title":"Using Barrier Elision to Improve Transactional Code Generation","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Transactional memory; Computer science; Software transactional memory; Compiler; Leverage (statistics); Transactional leadership; Implementation; Operating system; Just-in-time compilation; Parallel computing; Programming language; Database transaction; Artificial intelligence","score_opus":0.02374602894507752,"score_gpt":0.2600450248490669,"score_spread":0.23629899590398937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225381858","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09810831,0.0004956281,0.87475973,0.000302598,0.00021479194,0.00021359778,0.0002724308,0.02046452,0.0051683863],"genre_scores_gemma":[0.4243487,0.00020460924,0.5653629,0.00024275472,0.000039209554,0.00026712954,0.0007989006,0.004684569,0.0040513175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980823,0.00034930054,0.0001835738,0.0002851129,0.0008836393,0.0002160655],"domain_scores_gemma":[0.99312276,0.0024160387,0.000442022,0.0023049298,0.0015679973,0.00014623329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779642,0.0007334946,0.0003832165,0.0010597333,0.00045596677,0.0012012338,0.0018873338,0.000646017,0.0034892058],"category_scores_gemma":[0.010564805,0.0005058525,0.00062391016,0.0009309199,0.0008385449,0.002126791,0.0018029743,0.0017160805,0.0013690563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010067228,0.0004537359,0.012431641,0.0008302874,0.00012446872,0.0009043275,0.0014900565,0.12422673,0.19435865,0.0620153,0.01249728,0.5896608],"study_design_scores_gemma":[0.00014067505,0.00046524557,0.0011586993,0.00011081757,0.00006410284,0.0003377997,0.00020102497,0.7355459,0.21149287,0.021121556,0.029278485,0.00008287079],"about_ca_topic_score_codex":0.0017925757,"about_ca_topic_score_gemma":0.0026503368,"teacher_disagreement_score":0.0034892058,"about_ca_system_score_codex":0.0006105141,"about_ca_system_score_gemma":0.001485136,"threshold_uncertainty_score":0.011672497},"labels":[],"label_agreement":null},{"id":"W4226538183","doi":"10.1109/ojcoms.2022.3169969","title":"MAGIKS: Fair Multi-Resource Allocation Game Induced by Kalai-Smorodinsky Bargaining Solution","year":2022,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Server; Resource allocation; Resource (disambiguation); Game theory; Nash equilibrium; Mathematical economics; Mathematics; Computer network","score_opus":0.06918617170948217,"score_gpt":0.3121714640367719,"score_spread":0.24298529232728971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226538183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028809953,0.00021342609,0.9471594,0.00092218624,0.000104906976,0.00020511719,0.00020736728,0.00022738727,0.022150291],"genre_scores_gemma":[0.75798845,0.00046643894,0.22026525,0.00044321964,0.000093760056,0.0007211307,0.0002294248,0.000088569395,0.019703753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985014,0.0006517917,0.00007224739,0.0002900653,0.00026278943,0.00022168546],"domain_scores_gemma":[0.99915075,0.00043964636,0.00011118292,0.00008442426,0.00009488146,0.00011916724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018032737,0.00085510383,0.0011307859,0.00053941924,0.00094259577,0.0017375918,0.0017244533,0.0014881231,0.006324743],"category_scores_gemma":[0.0031274834,0.0004326053,0.00097256195,0.0008504235,0.0016865276,0.0026527303,0.0018458738,0.0021430994,0.0009570381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015504302,0.00007670583,0.00021934281,0.00013144445,0.000041950116,0.00016156785,0.00017541739,0.16611075,0.0034488174,0.8121308,0.0035549775,0.013793193],"study_design_scores_gemma":[0.000068416586,0.00005585336,0.00010351959,0.000021101474,0.000012109436,0.0000624386,0.00005111817,0.61990124,0.00087621436,0.3742542,0.0045688595,0.000024945293],"about_ca_topic_score_codex":0.0013561563,"about_ca_topic_score_gemma":0.0011775644,"teacher_disagreement_score":0.006324743,"about_ca_system_score_codex":0.0018448451,"about_ca_system_score_gemma":0.0019388507,"threshold_uncertainty_score":0.021158338},"labels":[],"label_agreement":null},{"id":"W4229616670","doi":"10.1002/cpe.1364","title":"Trading off logging overhead and coordinating overhead to achieve efficient rollback recovery","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Overhead (engineering); Rollback; Logging; Fault tolerance; Partition (number theory); Heuristics; Distributed computing; Embedded system; Operating system; Database transaction; Database","score_opus":0.025876742472895526,"score_gpt":0.30326741972070514,"score_spread":0.27739067724780964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229616670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23841324,0.0005934432,0.75266427,0.0004843702,0.0000768665,0.00021443143,0.000042347292,0.0042582727,0.0032527372],"genre_scores_gemma":[0.9171075,0.00011499638,0.081737995,0.000054952365,0.000025251571,0.000057592988,0.000044324268,0.000076963646,0.0007804666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00054136984,0.00016908548,0.0002490079,0.00043330985,0.0002953939],"domain_scores_gemma":[0.9946912,0.0013267949,0.00081042363,0.0021368403,0.0006559886,0.00037867276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017800541,0.00059547205,0.000774317,0.00078603026,0.0009274265,0.001395206,0.0012603614,0.0004603513,0.0012069162],"category_scores_gemma":[0.0054987087,0.00031315722,0.00018916072,0.00094683835,0.00085691334,0.002131449,0.0015635511,0.0007614212,0.00039169737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018955265,0.0008026822,0.008396292,0.0003118551,0.00010972646,0.00049086683,0.0006661479,0.4096607,0.17959489,0.030469313,0.006428599,0.36117348],"study_design_scores_gemma":[0.00021103067,0.0005183365,0.0025140212,0.000030025913,0.000084971216,0.0003475974,0.00032701014,0.88175714,0.09726795,0.012013047,0.004862898,0.00006608818],"about_ca_topic_score_codex":0.0012886807,"about_ca_topic_score_gemma":0.0014600682,"teacher_disagreement_score":0.0017800541,"about_ca_system_score_codex":0.0005738652,"about_ca_system_score_gemma":0.0012510838,"threshold_uncertainty_score":0.009413898},"labels":[],"label_agreement":null},{"id":"W4230073812","doi":"10.1109/pdcat.2007.4420171","title":"Detecting Atomicity Errors in Message Passing Programs","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Atomicity; Computer science; Correctness; Serialization; Programming language; Message passing; Statement (logic); Theoretical computer science; Distributed computing","score_opus":0.019159352696692982,"score_gpt":0.26331301919132094,"score_spread":0.24415366649462797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230073812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16297607,0.0002147567,0.83274245,0.00030565844,0.000041686122,0.00011858658,0.000024655661,0.0027513853,0.0008247712],"genre_scores_gemma":[0.68032295,0.00021666479,0.31768852,0.000100359335,0.000049465092,0.00012398162,0.00009017559,0.00025145878,0.001156385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926763,0.0025680522,0.0005040117,0.0008231328,0.0027607663,0.00066779746],"domain_scores_gemma":[0.96597564,0.021823717,0.0038639775,0.005038005,0.0029377514,0.0003608501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004853724,0.00077899185,0.0010482351,0.0013105782,0.0011109589,0.0018749037,0.001728798,0.001256171,0.00060021365],"category_scores_gemma":[0.031010598,0.0009453555,0.00064495765,0.0010559597,0.0024956034,0.0033632945,0.0027873684,0.0021108645,0.00019579135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021552593,0.00059906463,0.038134277,0.000595796,0.00020946421,0.0013511837,0.0025341124,0.3014842,0.111985154,0.1411465,0.0026427282,0.39716232],"study_design_scores_gemma":[0.00013262387,0.00033912619,0.0018975685,0.000045830828,0.00009309078,0.00038128905,0.00022291698,0.81623334,0.10401063,0.07314315,0.0034446302,0.00005570751],"about_ca_topic_score_codex":0.001999967,"about_ca_topic_score_gemma":0.0013540031,"teacher_disagreement_score":0.004853724,"about_ca_system_score_codex":0.0010470927,"about_ca_system_score_gemma":0.0017019947,"threshold_uncertainty_score":0.025669277},"labels":[],"label_agreement":null},{"id":"W4231232253","doi":"10.1007/11925071_10","title":"DBFarm: A Scalable Cluster for Multiple Databases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Software deployment; Database; Server; Exploit; Flexibility (engineering); Common Object Request Broker Architecture; Distributed computing; Distributed database; Database server; Operating system","score_opus":0.02354540944593317,"score_gpt":0.25614445517132045,"score_spread":0.23259904572538728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231232253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060540114,0.0034430928,0.7207992,0.001494118,0.0018077658,0.0008803031,0.0048074154,0.18011604,0.026111986],"genre_scores_gemma":[0.28876525,0.0019645046,0.6194605,0.001059499,0.00048637865,0.0009683598,0.018337587,0.0100525925,0.05890528],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916196,0.00011415248,0.00006173588,0.00018575483,0.0003641995,0.00011221211],"domain_scores_gemma":[0.9983272,0.00021987013,0.000057722944,0.0007132493,0.0003325596,0.0003495047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589891,0.0010027866,0.0012372631,0.0012564391,0.0013001146,0.0021052624,0.0042739166,0.0009041284,0.016908038],"category_scores_gemma":[0.0021830488,0.0011867218,0.00050290156,0.0021510464,0.000554421,0.0032594458,0.003109577,0.0017513436,0.0046880282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021588358,0.0005769124,0.002621789,0.0008702087,0.0002719824,0.00033218667,0.00043419472,0.034130912,0.046066023,0.023655793,0.40288308,0.4859981],"study_design_scores_gemma":[0.00156909,0.00089008216,0.0033225145,0.00013244797,0.0002846371,0.0009396802,0.0004918555,0.52749133,0.06093013,0.047916908,0.3557297,0.0003016502],"about_ca_topic_score_codex":0.003784794,"about_ca_topic_score_gemma":0.0046152314,"teacher_disagreement_score":0.016908038,"about_ca_system_score_codex":0.0008828596,"about_ca_system_score_gemma":0.0014819666,"threshold_uncertainty_score":0.05656308},"labels":[],"label_agreement":null},{"id":"W4231380359","doi":"10.4018/9781605666976.ch002","title":"Event Models in Distributed Event Based Systems","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Event (particle physics); Computer science; Key (lock); Implementation; Distributed computing; Invocation; Programming language; Computer security","score_opus":0.025721516861923477,"score_gpt":0.2378668254912076,"score_spread":0.21214530862928413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231380359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030524605,0.03766874,0.76271695,0.0036262472,0.0015300121,0.00022977644,0.0005212571,0.0016933356,0.18896118],"genre_scores_gemma":[0.19272861,0.100214906,0.4625874,0.0025798895,0.002478714,0.0011108523,0.0026012573,0.0013177855,0.23438063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990563,0.0002554027,0.00007491038,0.00011990846,0.0004436979,0.00004980209],"domain_scores_gemma":[0.9989485,0.00067781657,0.000041570423,0.0001665615,0.00012432599,0.00004122541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013112562,0.001132481,0.00065784674,0.0009093232,0.00070598465,0.004104057,0.0015113263,0.0016729899,0.010299086],"category_scores_gemma":[0.0030190556,0.0006555192,0.00068279693,0.0021263843,0.0013543868,0.0054637888,0.0014327195,0.003419199,0.003971883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001335272,0.00003280688,0.00008187415,0.00031051232,0.000012506296,0.00012552606,0.0004599296,0.013157942,0.00045518987,0.8891053,0.02362779,0.07261731],"study_design_scores_gemma":[0.000015452988,0.00002219563,0.000084317006,0.00025946068,0.00001219699,0.00018115899,0.00012277346,0.021381212,0.00044670422,0.57275486,0.4046999,0.00001978089],"about_ca_topic_score_codex":0.0012595538,"about_ca_topic_score_gemma":0.000918495,"teacher_disagreement_score":0.010299086,"about_ca_system_score_codex":0.001575026,"about_ca_system_score_gemma":0.0009894794,"threshold_uncertainty_score":0.03445387},"labels":[],"label_agreement":null},{"id":"W4231499744","doi":"10.2139/ssrn.1361197","title":"Efficient Recapitalization","year":2009,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Harvard University; Oesterreichische Nationalbank; Princeton University","keywords":"Recapitalization; Business; Financial system","score_opus":0.004657712907992581,"score_gpt":0.21980260375315117,"score_spread":0.2151448908451586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231499744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030416993,0.00039329278,0.92343825,0.00094657583,0.00038710228,0.00024181654,0.0010493869,0.005849423,0.037277207],"genre_scores_gemma":[0.48792928,0.0006714234,0.4191158,0.0006110967,0.00027509866,0.00047020742,0.004768944,0.0027233874,0.083434775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985448,0.00022436722,0.00007618045,0.0004324682,0.0003635964,0.000358533],"domain_scores_gemma":[0.99812955,0.00035965722,0.000072158036,0.0009824871,0.00037870865,0.00007746073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074649014,0.0014709515,0.0014057973,0.0015613752,0.0018101507,0.0025498802,0.0028458973,0.0017204825,0.0352803],"category_scores_gemma":[0.0044477293,0.000635273,0.0014975423,0.0016218007,0.0012006973,0.003600461,0.007461321,0.002315796,0.010067475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005359837,0.00024818332,0.001007402,0.00040083588,0.00010583324,0.00042977073,0.00035720904,0.07829849,0.021771066,0.32813013,0.05309412,0.51562095],"study_design_scores_gemma":[0.0000808817,0.00017050568,0.00065426267,0.00007761896,0.00011364367,0.00059866504,0.00050516246,0.52012014,0.025248624,0.40227154,0.050090335,0.00006858242],"about_ca_topic_score_codex":0.0014738559,"about_ca_topic_score_gemma":0.00229616,"teacher_disagreement_score":0.0352803,"about_ca_system_score_codex":0.0010324769,"about_ca_system_score_gemma":0.001724437,"threshold_uncertainty_score":0.11802429},"labels":[],"label_agreement":null},{"id":"W4232254920","doi":"10.1145/3155284.3019035","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Computer science; Thread (computing); Lock (firearm); Reuse; Implementation; Parallel computing; Transformation (genetics); Overhead (engineering); Distributed computing; Theoretical computer science; Computer engineering; Programming language","score_opus":0.03146308960852579,"score_gpt":0.28513779538983663,"score_spread":0.25367470578131085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232254920","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041844044,0.005125334,0.027104054,0.014407073,0.06103088,0.0007470482,0.0071402797,0.005919958,0.87434095],"genre_scores_gemma":[0.016394671,0.0020381606,0.008935773,0.002821358,0.0060552894,0.00023100154,0.0071104886,0.0013509623,0.9550624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872667,0.0001711014,0.00008474764,0.0004079571,0.000444167,0.00016532317],"domain_scores_gemma":[0.99738723,0.00028147904,0.000080373065,0.0004924161,0.0010500528,0.00070841267],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013669664,0.0010348965,0.0007775579,0.0013989573,0.002321978,0.0049791243,0.0018751106,0.0022017518,0.61200416],"category_scores_gemma":[0.00331794,0.00047346848,0.0010036277,0.0010132302,0.0005995741,0.003553495,0.0031701184,0.0025155882,0.39293373],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023020084,0.0001229548,0.00036479186,0.00022145631,0.000018213432,0.00016078165,0.000092861796,0.00024201482,0.0015933772,0.01109447,0.87365234,0.11220648],"study_design_scores_gemma":[0.000028697877,0.000037339676,0.0002976361,0.00006501184,0.000010203018,0.00016859507,0.000079131205,0.0003305575,0.0007124078,0.004631946,0.99362844,0.000009984722],"about_ca_topic_score_codex":0.0010795564,"about_ca_topic_score_gemma":0.0021568255,"teacher_disagreement_score":0.38799584,"about_ca_system_score_codex":0.0013575908,"about_ca_system_score_gemma":0.0014697725,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4232299669","doi":"10.1109/pads.1995.404315","title":"SGTNE: semi-global time of the next event algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"California Institute of Technology","keywords":"Computer science; Parallel computing; Multiprocessing; Algorithm; Deadlock; Parallel algorithm; Queueing theory; Distributed computing; Computer network","score_opus":0.014635535959814863,"score_gpt":0.22235032394838936,"score_spread":0.20771478798857448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232299669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037539045,0.00012025841,0.98998904,0.00015513576,0.00010908796,0.00008129754,0.000094132294,0.0027675729,0.0029294756],"genre_scores_gemma":[0.18204552,0.00021108802,0.80959815,0.00029125897,0.00007817515,0.000343831,0.00094067707,0.0010135754,0.0054777376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912995,0.00030557395,0.00007344518,0.00013105586,0.00026114474,0.00009876384],"domain_scores_gemma":[0.99842334,0.0007881642,0.00010164379,0.00033123215,0.0002564083,0.00009922068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014839895,0.0007699013,0.0008865868,0.0007146407,0.0006719992,0.0015029107,0.0018396457,0.00079552445,0.0089953365],"category_scores_gemma":[0.004519893,0.0003985281,0.00069357606,0.0007154564,0.0009137779,0.0020679957,0.0019884033,0.0014467632,0.002308302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000910866,0.00019369715,0.0016729952,0.00035951126,0.00010428301,0.0003340876,0.0003020722,0.46842322,0.0058004446,0.1259775,0.025015146,0.37090617],"study_design_scores_gemma":[0.00015751328,0.00007487266,0.00009045528,0.000017014176,0.000015150555,0.00008243387,0.000026467802,0.94692343,0.001978992,0.038363647,0.012254963,0.000015004064],"about_ca_topic_score_codex":0.0021348505,"about_ca_topic_score_gemma":0.0031322767,"teacher_disagreement_score":0.0089953365,"about_ca_system_score_codex":0.00052724115,"about_ca_system_score_gemma":0.0019597318,"threshold_uncertainty_score":0.030092359},"labels":[],"label_agreement":null},{"id":"W4233224619","doi":"10.1145/1103845.1094848","title":"Incrementalization across object abstraction","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Abstraction; Modular design; Implementation; Component (thermodynamics); Object (grammar); Programming language; Object-oriented programming; Distributed computing; Theoretical computer science; Artificial intelligence","score_opus":0.020050703969705014,"score_gpt":0.2933006812825095,"score_spread":0.27324997731280454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233224619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027631873,0.00019445659,0.9594498,0.00024763783,0.000057562447,0.00022506218,0.0001139705,0.0069183353,0.0051613366],"genre_scores_gemma":[0.33328068,0.0003523143,0.65318954,0.00038976522,0.000124445,0.00035952564,0.0006717966,0.0020307824,0.009601139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955646,0.00079503126,0.00033417792,0.0007097043,0.0020864531,0.00051008875],"domain_scores_gemma":[0.98771906,0.0031163709,0.0006385152,0.0066314368,0.0016769017,0.000217694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035120542,0.0008149271,0.0008003131,0.0011599897,0.0007868632,0.0022780935,0.0031740374,0.0007131104,0.0023490642],"category_scores_gemma":[0.014054494,0.0009014381,0.0016036456,0.0013942483,0.0017814059,0.005643889,0.0050544823,0.0021773125,0.0006564698],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047618645,0.00041772856,0.012493153,0.00044440475,0.00018619369,0.00068666256,0.0031953508,0.037202213,0.048654255,0.24480705,0.010457646,0.6409792],"study_design_scores_gemma":[0.00020372607,0.0005531773,0.00722509,0.00016212744,0.00067010114,0.0011026305,0.0007964986,0.4537744,0.13252889,0.2731582,0.12958108,0.00024415954],"about_ca_topic_score_codex":0.0044168388,"about_ca_topic_score_gemma":0.004840214,"teacher_disagreement_score":0.0044168388,"about_ca_system_score_codex":0.0010180993,"about_ca_system_score_gemma":0.0020531972,"threshold_uncertainty_score":0.018573761},"labels":[],"label_agreement":null},{"id":"W4233821074","doi":"10.1109/sc.2012.113","title":"What scientific applications can benefit from hardware transactional memory?","year":2012,"lang":"en","type":"article","venue":"2012 International Conference for High Performance Computing, Networking, Storage and Analysis","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Programmer; Parallel computing; Thread (computing); Transactional memory; Speedup; Instruction set; POSIX Threads; Benchmark (surveying); Synchronization (alternating current); Multithreading; Embedded system; Operating system; Programming language","score_opus":0.021704876318480403,"score_gpt":0.25578904377253897,"score_spread":0.23408416745405858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233821074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64892316,0.070434004,0.11617915,0.08058266,0.0016271481,0.00011645477,0.00096324604,0.0064012054,0.07477299],"genre_scores_gemma":[0.9537089,0.010691197,0.02891567,0.0018059306,0.00090753695,0.000052469513,0.00030445133,0.0004311997,0.0031826755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.00023556928,0.000030881056,0.00010751669,0.0003229131,0.00013947597],"domain_scores_gemma":[0.9959241,0.0020532717,0.00034599428,0.0007025316,0.00059950765,0.00037455652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013177363,0.00048954156,0.00056598004,0.00067824026,0.00062084314,0.0034151864,0.0014468128,0.0016118643,0.004412712],"category_scores_gemma":[0.008931131,0.00050825847,0.0005881153,0.0013576406,0.0013197007,0.006037338,0.0009497124,0.0011259934,0.0019235637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013332217,0.0005275657,0.057878364,0.0037022703,0.0003179983,0.00088253873,0.001016735,0.033136886,0.05609672,0.06692057,0.041861024,0.736326],"study_design_scores_gemma":[0.000378096,0.0013402117,0.06873043,0.0011358896,0.00073096185,0.002890628,0.0043425243,0.20402841,0.095086314,0.498405,0.12266062,0.000270865],"about_ca_topic_score_codex":0.00057221815,"about_ca_topic_score_gemma":0.00095609936,"teacher_disagreement_score":0.004412712,"about_ca_system_score_codex":0.0004283791,"about_ca_system_score_gemma":0.0007811569,"threshold_uncertainty_score":0.014761984},"labels":[],"label_agreement":null},{"id":"W4234235765","doi":"10.1109/pimrcw.2019.8880811","title":"List of papers with PDF files","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Dependability; Computer science; Provisioning; Exploit; Information exchange; Distributed computing; Testbed; Dynamism; Information system; Computer network; Computer security; Software engineering; Telecommunications; Engineering","score_opus":0.003350442529648194,"score_gpt":0.18025909957939637,"score_spread":0.17690865704974817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234235765","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012774882,0.10495856,0.005860132,0.03188883,0.20616448,0.0020834028,0.1606207,0.0043610684,0.4827853],"genre_scores_gemma":[0.005856713,0.101034224,0.0055057253,0.011626838,0.05831858,0.0011795965,0.09344082,0.0018691832,0.7211683],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860066,0.00014824628,0.00025204418,0.0002647657,0.0006081176,0.00012624529],"domain_scores_gemma":[0.98789024,0.0023958741,0.001050848,0.0008311252,0.00570396,0.0021279189],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018769285,0.0011945082,0.0024519616,0.007947617,0.0011441965,0.00748544,0.0020740633,0.001939424,0.67721915],"category_scores_gemma":[0.018400842,0.00045058673,0.0013388795,0.00938929,0.00037996424,0.003339804,0.0018806575,0.0016116451,0.5535889],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050738665,0.00002687383,0.00010072187,0.0018068936,0.000013408747,0.00006173426,0.000010283755,0.00006928932,0.00015261579,0.00092374353,0.9340756,0.062708065],"study_design_scores_gemma":[0.000019122735,0.00001979619,0.00029694362,0.0009190602,0.000014538919,0.00012292704,0.000017679973,0.000029638893,0.000109642955,0.0008541641,0.9975873,0.000009123116],"about_ca_topic_score_codex":0.0014218133,"about_ca_topic_score_gemma":0.0015929481,"teacher_disagreement_score":0.32278085,"about_ca_system_score_codex":0.0015049994,"about_ca_system_score_gemma":0.0032725872,"threshold_uncertainty_score":0.46040767},"labels":[],"label_agreement":null},{"id":"W4234844152","doi":"10.1007/978-3-319-04603-7_2","title":"System Model","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.016607170764525742,"score_gpt":0.22446015337483344,"score_spread":0.20785298261030768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234844152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010165419,0.0012943331,0.66110826,0.0029331194,0.0009414647,0.0012367067,0.01493677,0.004526046,0.30285785],"genre_scores_gemma":[0.37308422,0.003985606,0.17231993,0.002004294,0.0008280615,0.0032850578,0.024134539,0.0011257426,0.4192326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991103,0.00019507506,0.00004928391,0.00023222408,0.0003028562,0.000110201334],"domain_scores_gemma":[0.9992705,0.00019933241,0.000054120566,0.00019160053,0.00024348206,0.000040951658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441395,0.0013120458,0.0008838894,0.0011538387,0.0007858737,0.0032011531,0.0023483313,0.0015864099,0.071931966],"category_scores_gemma":[0.0021632358,0.00034408376,0.0009477911,0.0010884316,0.0008393124,0.0032037287,0.0021864949,0.0015658282,0.02917066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016261278,0.00015532653,0.00066951074,0.0005471988,0.000057342007,0.00060607784,0.00021486063,0.11259772,0.0035135918,0.77540916,0.054425053,0.051641583],"study_design_scores_gemma":[0.00018587748,0.00017694687,0.0002967764,0.00010129344,0.00007911463,0.0004403445,0.00014422287,0.29426828,0.002474525,0.40093392,0.30084458,0.00005416999],"about_ca_topic_score_codex":0.0028451385,"about_ca_topic_score_gemma":0.0018122308,"teacher_disagreement_score":0.071931966,"about_ca_system_score_codex":0.0009977334,"about_ca_system_score_gemma":0.0016792549,"threshold_uncertainty_score":0.24063635},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Collusion; Protocol (science); Cryptocurrency; Computer security; Business; Internet privacy; Computer science; Medicine; Industrial organization","score_opus":0.007346097033290928,"score_gpt":0.2272644407451494,"score_spread":0.21991834371185848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235325009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39362112,0.004710866,0.44752976,0.01926292,0.0007790856,0.00033660445,0.00044617604,0.0009144257,0.13239908],"genre_scores_gemma":[0.97424513,0.00072205596,0.010775757,0.00035343162,0.00020619493,0.00010683795,0.00008109283,0.000094174706,0.0134155005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593335,0.0019533357,0.00017279289,0.00033538553,0.0011014297,0.00050379365],"domain_scores_gemma":[0.9763184,0.016609319,0.0017261291,0.0035076973,0.0011233444,0.0007151144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004362086,0.00057626475,0.0013372558,0.0014320893,0.0022148727,0.0037873301,0.0013045203,0.0035621824,0.007844955],"category_scores_gemma":[0.025496371,0.0005609454,0.00047060722,0.0023110644,0.0043590283,0.011403192,0.0057795993,0.0036904658,0.0010738274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094526407,0.00008548106,0.0008998697,0.000072984985,0.000028186269,0.00043037868,0.0005310168,0.019326342,0.0014786333,0.9569884,0.0034598259,0.015753666],"study_design_scores_gemma":[0.00010471117,0.00003908881,0.00020973844,0.00003040456,0.00001667199,0.00027656,0.000115611605,0.09790045,0.0010540828,0.8958277,0.0043948437,0.000030161964],"about_ca_topic_score_codex":0.0010727078,"about_ca_topic_score_gemma":0.00075361633,"teacher_disagreement_score":0.007844955,"about_ca_system_score_codex":0.0014535665,"about_ca_system_score_gemma":0.0013858012,"threshold_uncertainty_score":0.026243985},"labels":[],"label_agreement":null},{"id":"W4235436461","doi":"10.1007/978-3-540-68706-1_1617","title":"Delay-Independent Deficit","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.013138853597654133,"score_gpt":0.21504699942480343,"score_spread":0.2019081458271493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235436461","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019152822,0.0042188945,0.14063157,0.0026618412,0.0016358647,0.0001080686,0.00036610704,0.00082332373,0.8304016],"genre_scores_gemma":[0.3908322,0.005658575,0.020089213,0.0010568333,0.0009075854,0.00015596455,0.0005278145,0.00059669296,0.58017516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997631,0.00001749925,0.000009504084,0.00006498128,0.00008763003,0.00005734955],"domain_scores_gemma":[0.99957186,0.00010930509,0.000032885324,0.00011202884,0.00012732249,0.000046585315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003153052,0.0006994172,0.00056076184,0.0008074305,0.0008766126,0.001673518,0.0015214774,0.0008641128,0.025680685],"category_scores_gemma":[0.0016103035,0.00029917902,0.00034189102,0.00084350386,0.0014391643,0.003952791,0.0017285016,0.0026913723,0.006101583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006593325,0.000038487437,0.00010019889,0.00011660514,0.00000706077,0.00009976059,0.0000898549,0.00176952,0.004317315,0.9214222,0.018435253,0.053537905],"study_design_scores_gemma":[0.000032801083,0.000055873417,0.00023794587,0.00006583359,0.000021326166,0.0006578997,0.00009741978,0.00908433,0.008846611,0.80543256,0.17544566,0.0000217261],"about_ca_topic_score_codex":0.00062417216,"about_ca_topic_score_gemma":0.00059283595,"teacher_disagreement_score":0.025680685,"about_ca_system_score_codex":0.0014606793,"about_ca_system_score_gemma":0.0011309432,"threshold_uncertainty_score":0.0859105},"labels":[],"label_agreement":null},{"id":"W4235527144","doi":"10.1145/3155284.3019027","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Scalability; Software; Benchmark (surveying); Parallel computing; Database transaction; Operating system; Programming language","score_opus":0.03146308960852579,"score_gpt":0.28513779538983663,"score_spread":0.25367470578131085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235527144","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013467266,0.0049186544,0.06124442,0.009451624,0.030504804,0.0009849137,0.007464617,0.009879349,0.8620843],"genre_scores_gemma":[0.061582386,0.0030558358,0.03494866,0.0048681353,0.0034725363,0.00049040077,0.012938194,0.0022347562,0.87640905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859387,0.00021377798,0.00008101091,0.00037339443,0.00056660845,0.00017122735],"domain_scores_gemma":[0.99825245,0.0002539968,0.000073668016,0.0004062769,0.00061508425,0.00039853546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012967545,0.00066608307,0.0005173491,0.0010306112,0.0018852483,0.0047722817,0.0017352857,0.0016906849,0.37432846],"category_scores_gemma":[0.003194148,0.00030475532,0.0006291524,0.00090312096,0.00052159675,0.0034236736,0.0032307566,0.0016857137,0.18821216],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048004807,0.0002524873,0.0014054208,0.0005947035,0.000031835323,0.00044306886,0.00033895366,0.0011038542,0.006341668,0.036126662,0.66191703,0.29096428],"study_design_scores_gemma":[0.00003103142,0.00008413852,0.00046168015,0.000077438,0.000010614789,0.00027471257,0.00017630868,0.0007521711,0.0022699598,0.004290399,0.9915559,0.000015569465],"about_ca_topic_score_codex":0.0009453389,"about_ca_topic_score_gemma":0.0016109172,"teacher_disagreement_score":0.6256715,"about_ca_system_score_codex":0.00082258816,"about_ca_system_score_gemma":0.0010993341,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4238536305","doi":"10.1007/978-3-319-25703-7_1","title":"Introduction","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Control flow; Computer science; Concurrency control; Presentation (obstetrics); Control (management); Flow control (data); Concurrent computing; Programming language; Artificial intelligence","score_opus":0.010069950529402774,"score_gpt":0.20362907464657626,"score_spread":0.1935591241171735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238536305","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030251552,0.00408493,0.006315162,0.0019500909,0.0042645903,0.00011301678,0.0012818557,0.0007467375,0.9809411],"genre_scores_gemma":[0.00088700163,0.0021493773,0.0012752144,0.00067601685,0.0006479832,0.00005459775,0.0009002862,0.00022433054,0.9931851],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994935,0.00004446524,0.000017215454,0.000105053114,0.00028466966,0.000055214896],"domain_scores_gemma":[0.99942267,0.0000832236,0.000020845262,0.00008914261,0.00027383666,0.000110380126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005054705,0.000992806,0.00059869845,0.0018380546,0.0011897705,0.0036511193,0.0014942994,0.0015200343,0.49626398],"category_scores_gemma":[0.0018062589,0.00035201886,0.0005003127,0.0017277243,0.00065113266,0.0033663167,0.0023472703,0.0018629939,0.4399815],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020687528,0.000037282323,0.0000752695,0.00018976677,0.000002291291,0.000039764076,0.00012301249,0.00020144739,0.00053651666,0.04180167,0.72022134,0.23675084],"study_design_scores_gemma":[0.0000012263362,0.0000044413364,0.00004037018,0.000052889885,7.074978e-7,0.000025563417,0.000019458957,0.000024122259,0.00007227694,0.0039298204,0.99582714,0.0000020299778],"about_ca_topic_score_codex":0.0019743002,"about_ca_topic_score_gemma":0.0033798122,"teacher_disagreement_score":0.49626398,"about_ca_system_score_codex":0.0011414628,"about_ca_system_score_gemma":0.0016817302,"threshold_uncertainty_score":0.71851826},"labels":[],"label_agreement":null},{"id":"W4238551972","doi":"10.32920/ryerson.14658105","title":"Concurrent Transaction Logic with Priority and Timing Constraints","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Database transaction; Programming language; Schedule; Distributed transaction; Online transaction processing; Rollback; Transaction processing; Prolog; Distributed computing; Operating system","score_opus":0.032114198136939553,"score_gpt":0.2692776840341279,"score_spread":0.23716348589718833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238551972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120797595,0.00046536876,0.9692106,0.00046972797,0.000107337895,0.00012312725,0.0002988614,0.0010071367,0.016238041],"genre_scores_gemma":[0.4730623,0.0007845973,0.51125944,0.0007175495,0.00026527667,0.00033323673,0.00055096135,0.00023434775,0.012792243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985459,0.00033415004,0.00012313119,0.00020619061,0.00062580936,0.00016490309],"domain_scores_gemma":[0.998565,0.0006597099,0.00012783158,0.00015226063,0.0004196916,0.00007544755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012616869,0.00050987554,0.00034463382,0.0005214332,0.0006015859,0.002186264,0.0010653442,0.0004975164,0.0023362336],"category_scores_gemma":[0.0027785643,0.00047320072,0.0005733141,0.0009360897,0.0012417176,0.0024486387,0.0010098788,0.0015453707,0.0005135625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001787583,0.000055106688,0.00042558849,0.00017707986,0.000025013962,0.00037507724,0.0003350868,0.036680136,0.0060326676,0.90520364,0.003550439,0.04696144],"study_design_scores_gemma":[0.00023537321,0.00010496968,0.00017805575,0.0000537996,0.00007227607,0.00036310905,0.00009751479,0.45688337,0.011451271,0.48035172,0.050171524,0.000036982765],"about_ca_topic_score_codex":0.0051003145,"about_ca_topic_score_gemma":0.0035277072,"teacher_disagreement_score":0.0051003145,"about_ca_system_score_codex":0.0014670311,"about_ca_system_score_gemma":0.0024049147,"threshold_uncertainty_score":0.010644138},"labels":[],"label_agreement":null},{"id":"W4239225007","doi":"10.22215/etd/2005-07471","title":"Load sharing in call server clusters","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Strong","keywords":"Computer science; Operating system","score_opus":0.01203577193665315,"score_gpt":0.2592440122247436,"score_spread":0.24720824028809044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239225007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8887259,0.0005516222,0.08009421,0.00072576787,0.000130305,0.00015511925,0.00027052348,0.004305063,0.025041563],"genre_scores_gemma":[0.98111224,0.00008542702,0.008395779,0.000031343483,0.000043647913,0.000060646646,0.00016795937,0.00020312119,0.0098997755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987979,0.0002048331,0.000040748375,0.00016457327,0.0004562912,0.00033565742],"domain_scores_gemma":[0.9983032,0.00043221368,0.00010131095,0.00048165812,0.00034519433,0.0003364338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009335931,0.00035969034,0.00067468284,0.0007673713,0.0021899566,0.002166739,0.0016172556,0.00066555105,0.0068648667],"category_scores_gemma":[0.0032803395,0.00037143237,0.00024086048,0.0012773047,0.00069400214,0.0018904669,0.0018018084,0.00057852524,0.0014789785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055262144,0.0013436187,0.013906466,0.00030942247,0.00016826754,0.00080902403,0.003364825,0.4449035,0.094620936,0.11979499,0.039842073,0.27541074],"study_design_scores_gemma":[0.00020758042,0.00034061843,0.008573361,0.000019875211,0.000070482296,0.00018500778,0.0012954206,0.9035499,0.029091777,0.043305635,0.013293081,0.00006727597],"about_ca_topic_score_codex":0.007219231,"about_ca_topic_score_gemma":0.0068123564,"teacher_disagreement_score":0.007219231,"about_ca_system_score_codex":0.0017442752,"about_ca_system_score_gemma":0.0014893408,"threshold_uncertainty_score":0.022965312},"labels":[],"label_agreement":null},{"id":"W4239405777","doi":"10.1007/978-3-540-76778-7_17","title":"Consistent and Scalable Cache Replication for Multi-tier J2EE Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Replication (statistics); Cache; Quality of service; Protocol (science); Benchmark (surveying); Distributed computing; Computer network; High availability; Database","score_opus":0.04869352010582008,"score_gpt":0.2996462552106217,"score_spread":0.25095273510480165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239405777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11311376,0.0037669486,0.85882586,0.00092310796,0.00049108773,0.00021857322,0.0004143292,0.0077099516,0.014536432],"genre_scores_gemma":[0.75525934,0.00095061236,0.22799292,0.00015517705,0.00018788569,0.00013801892,0.0007955338,0.0006357352,0.013884727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.0001406883,0.00006315632,0.000103418584,0.00036068002,0.00012578917],"domain_scores_gemma":[0.99816126,0.00030897843,0.000083593775,0.00084959384,0.0005079087,0.00008871294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512753,0.0004924881,0.0006490561,0.0004707526,0.0012925399,0.0017865467,0.0023050022,0.0008875664,0.0023454542],"category_scores_gemma":[0.0029060373,0.00055138493,0.0003483702,0.0012569214,0.00044083607,0.0022892156,0.0014818318,0.0011147169,0.00073019747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012482543,0.0004711882,0.003961082,0.00047857637,0.00019755853,0.00079178973,0.0006721895,0.15169282,0.1602867,0.05640439,0.052449998,0.5713454],"study_design_scores_gemma":[0.00012380209,0.00020641818,0.0014764393,0.000031562562,0.000088197754,0.000539394,0.00023440422,0.88139075,0.05703439,0.035172272,0.023626195,0.000076288765],"about_ca_topic_score_codex":0.0032926772,"about_ca_topic_score_gemma":0.007825913,"teacher_disagreement_score":0.0032926772,"about_ca_system_score_codex":0.00058900274,"about_ca_system_score_gemma":0.001154941,"threshold_uncertainty_score":0.007846296},"labels":[],"label_agreement":null},{"id":"W4240018184","doi":"10.1109/blackseacom52164.2021.9527787","title":"Program","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dumlupinar Üniversitesi; University of Jordan; Bilkent Üniversitesi; University of Ottawa","keywords":"Computer science","score_opus":0.010493047405523091,"score_gpt":0.25913228387248216,"score_spread":0.24863923646695907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240018184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005019121,0.001146448,0.07278391,0.0085842395,0.003308353,0.0007971226,0.008076718,0.0082195755,0.8920645],"genre_scores_gemma":[0.048079614,0.0014606196,0.045622505,0.0042215604,0.0008439039,0.0009944026,0.012959756,0.0025192706,0.8832984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986865,0.0002688252,0.00006633147,0.00038117505,0.00039690177,0.00020026625],"domain_scores_gemma":[0.99785346,0.00036291752,0.000102772356,0.00047772142,0.0008560586,0.00034705093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001355922,0.00065661967,0.00048529226,0.0010540717,0.0021950994,0.0033455596,0.0022328917,0.0014882676,0.44312772],"category_scores_gemma":[0.004147559,0.00028573986,0.0007585446,0.001192275,0.0007461766,0.0030268447,0.003458968,0.0013872201,0.18708445],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028867266,0.00017488397,0.0018587103,0.00044968008,0.000020014553,0.0002684055,0.00072942197,0.0012607609,0.0016443438,0.20470627,0.46306318,0.32553563],"study_design_scores_gemma":[0.000017152915,0.000035456895,0.00042756923,0.00006721174,0.000005844245,0.00012144201,0.00015284772,0.0006244673,0.00058777095,0.012254418,0.9856948,0.000010932325],"about_ca_topic_score_codex":0.0032309624,"about_ca_topic_score_gemma":0.0034716704,"teacher_disagreement_score":0.55687225,"about_ca_system_score_codex":0.0017665515,"about_ca_system_score_gemma":0.0029967458,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4240133548","doi":"10.1145/3186728.3164137","title":"Query fresh","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backup; Overhead (engineering); Operating system; Database; Computer network; Replication (statistics)","score_opus":0.013816238538806296,"score_gpt":0.2359611939109308,"score_spread":0.2221449553721245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240133548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029990593,0.0046180044,0.37629375,0.005284704,0.0035462484,0.0031504387,0.045952007,0.28589496,0.24526936],"genre_scores_gemma":[0.26827714,0.0035229637,0.22263494,0.012403552,0.0021000197,0.0018018668,0.12678656,0.05914813,0.30332482],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616635,0.00037277458,0.00032886106,0.0009922829,0.0015617874,0.0005779799],"domain_scores_gemma":[0.99365246,0.0009090312,0.00020861809,0.0032309692,0.0017386143,0.00026022882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024993762,0.001935225,0.0015981551,0.001762956,0.0018027647,0.005875465,0.0036995134,0.0017761016,0.12161238],"category_scores_gemma":[0.008294077,0.0010331909,0.0013061471,0.0017368227,0.0010274339,0.011169813,0.006834961,0.0023094916,0.059560664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018769426,0.00030132246,0.0041951505,0.0015682875,0.00021285182,0.00070097035,0.0011292741,0.002534809,0.029243201,0.0726414,0.60121024,0.28438565],"study_design_scores_gemma":[0.00021342366,0.00020187613,0.0017546018,0.000119144184,0.00009694282,0.00074416556,0.00057607546,0.01561983,0.024361758,0.029708443,0.92646176,0.000141921],"about_ca_topic_score_codex":0.0049508205,"about_ca_topic_score_gemma":0.0045411573,"teacher_disagreement_score":0.12161238,"about_ca_system_score_codex":0.0018791755,"about_ca_system_score_gemma":0.0022107332,"threshold_uncertainty_score":0.4068339},"labels":[],"label_agreement":null},{"id":"W4240389484","doi":"10.32920/ryerson.14665167.v1","title":"Effects of software aging and rejuvenation on performability of layered distributed systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Rejuvenation; Dependability; Reliability engineering; Software; Component (thermodynamics); Queueing theory; Software system; Distributed computing; Embedded system; Operating system; Computer network; Engineering; Software engineering","score_opus":0.009267619172573936,"score_gpt":0.23089912241256375,"score_spread":0.2216315032399898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240389484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9431904,0.00016823647,0.05494595,0.000066000954,0.00001660026,0.000028228109,0.000064193875,0.00025391058,0.0012664215],"genre_scores_gemma":[0.9964786,0.000052282117,0.0032576772,0.000006782375,0.0000023188777,0.000010430497,0.000020752503,0.000016103892,0.00015485288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866056,0.00038046317,0.00008153705,0.0001221933,0.0005147892,0.00024040496],"domain_scores_gemma":[0.9922874,0.004389768,0.0014219091,0.00084046833,0.0007408263,0.0003195286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982581,0.00073861965,0.0003886266,0.0006818518,0.00038838532,0.00094174116,0.0006844117,0.00050176965,0.0007618694],"category_scores_gemma":[0.007820808,0.00023295321,0.000539255,0.00036076835,0.0008591552,0.0010704278,0.0008277123,0.00060370594,0.0000783697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033889397,0.00016246886,0.008344956,0.00009032773,0.000048803584,0.00018963474,0.00018906248,0.9367034,0.03339423,0.0043592667,0.00012326395,0.01605569],"study_design_scores_gemma":[0.000013162858,0.0003118966,0.0025418682,0.000009332208,0.000032177897,0.00005452316,0.00005268634,0.9778137,0.017560104,0.0014441876,0.00015181373,0.000014600138],"about_ca_topic_score_codex":0.004448076,"about_ca_topic_score_gemma":0.0020826487,"teacher_disagreement_score":0.004448076,"about_ca_system_score_codex":0.0012160138,"about_ca_system_score_gemma":0.00077997823,"threshold_uncertainty_score":0.010485053},"labels":[],"label_agreement":null},{"id":"W4240804686","doi":"10.1007/978-1-4899-7993-3_1369-2","title":"Partial Replication","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Computer science; Biology; Virology","score_opus":0.018001693169796693,"score_gpt":0.24483443205007888,"score_spread":0.2268327388802822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240804686","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043892916,0.015857426,0.29462156,0.0019307275,0.002944342,0.0004173405,0.0020252846,0.007499149,0.6703149],"genre_scores_gemma":[0.086142845,0.015446966,0.14585632,0.0010875361,0.0014123659,0.0004192689,0.005174292,0.002187221,0.7422732],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946994,0.00006603358,0.00003362946,0.00012885788,0.0002640396,0.000037520385],"domain_scores_gemma":[0.99922216,0.00010623848,0.000030327003,0.00039212598,0.00020889743,0.000040102455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045516185,0.00071445754,0.0006333146,0.0009703564,0.00095169654,0.0025363693,0.0012608729,0.0006703518,0.0621409],"category_scores_gemma":[0.0016135451,0.00045423253,0.0005536215,0.0016588254,0.00067260116,0.0031462037,0.0016054912,0.0011066119,0.03466524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008757444,0.00004779127,0.00017712657,0.0006824497,0.000027391243,0.00011622703,0.00029085382,0.00219042,0.0075890007,0.2184708,0.1918075,0.57851285],"study_design_scores_gemma":[0.000018673509,0.00004215113,0.0001755458,0.00012739675,0.000019720223,0.0005186861,0.000059214435,0.003069274,0.004030181,0.08571624,0.9062035,0.000019509407],"about_ca_topic_score_codex":0.0007934943,"about_ca_topic_score_gemma":0.0011084877,"teacher_disagreement_score":0.0621409,"about_ca_system_score_codex":0.00062795816,"about_ca_system_score_gemma":0.0010578084,"threshold_uncertainty_score":0.20788199},"labels":[],"label_agreement":null},{"id":"W4240851185","doi":"10.1007/978-3-642-27848-8_607-1","title":"Transactional Memory","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Transactional memory; Computer science; Database; Database transaction","score_opus":0.022103017583593707,"score_gpt":0.2418736888112772,"score_spread":0.21977067122768348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240851185","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024989743,0.10221547,0.18252726,0.0023286873,0.0056948694,0.00023138165,0.00251691,0.006787305,0.69519913],"genre_scores_gemma":[0.021823658,0.041237567,0.055849064,0.0014155384,0.0018537753,0.00021611065,0.0043040407,0.0017205355,0.87157965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961615,0.000034697485,0.000032350217,0.000083804756,0.00020005183,0.00003294623],"domain_scores_gemma":[0.9995388,0.00010326235,0.000023810575,0.00014732027,0.00015063334,0.000036223988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036430813,0.0012387583,0.00087335566,0.0014726593,0.0007227048,0.0038602543,0.001753469,0.00088814547,0.10364629],"category_scores_gemma":[0.0011771292,0.0005850075,0.00042151744,0.003773409,0.00068063283,0.0043557887,0.0014185923,0.001748991,0.07059478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050899336,0.000045611254,0.00009813135,0.0006530505,0.000022076618,0.00006714191,0.00017015722,0.00095693086,0.004055686,0.105288714,0.26566115,0.62293047],"study_design_scores_gemma":[0.000008013308,0.00002275999,0.00011457444,0.00020405944,0.000013745175,0.00026648628,0.000032269894,0.0012353453,0.0015761012,0.038512528,0.9579995,0.00001458751],"about_ca_topic_score_codex":0.0006300488,"about_ca_topic_score_gemma":0.001127921,"teacher_disagreement_score":0.10364629,"about_ca_system_score_codex":0.00058220705,"about_ca_system_score_gemma":0.0009622992,"threshold_uncertainty_score":0.34673136},"labels":[],"label_agreement":null},{"id":"W4242553329","doi":"10.1002/spe.771","title":"Reliable user‐level rollback recovery implementation for multithreaded processes on windows","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Thread (computing); Computer science; Rollback; Parallel computing; Operating system; Multithreading; Distributed computing; Programming language","score_opus":0.026561367234756005,"score_gpt":0.31544919085542117,"score_spread":0.2888878236206652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242553329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4746748,0.0005649138,0.48203155,0.0003194569,0.0002073323,0.0002726361,0.000087882574,0.03761344,0.004228],"genre_scores_gemma":[0.9374042,0.0001102444,0.05798731,0.000043183198,0.000030026105,0.00006117619,0.00007110273,0.00045130186,0.0038413925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994469,0.00008866421,0.00006699877,0.00007425189,0.00021429837,0.000108892964],"domain_scores_gemma":[0.9981237,0.00032010057,0.00019702344,0.0007312885,0.00041167947,0.00021612889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579147,0.00034088842,0.00048812205,0.00047517847,0.00049391,0.0013191315,0.0018673119,0.0005175664,0.00277584],"category_scores_gemma":[0.0028680558,0.00027501967,0.00022990532,0.00026534742,0.0005591987,0.0013448566,0.0012504315,0.00096043426,0.00056294247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065613436,0.00074017915,0.01150925,0.00045199625,0.0001414861,0.0020484223,0.0030461953,0.042584423,0.34361446,0.049053963,0.012015453,0.52823293],"study_design_scores_gemma":[0.0005767204,0.0008435502,0.0033956484,0.00007357765,0.00012737398,0.00045970356,0.00027789583,0.64810556,0.31483766,0.009227724,0.021963893,0.00011066464],"about_ca_topic_score_codex":0.002007666,"about_ca_topic_score_gemma":0.001344927,"teacher_disagreement_score":0.00277584,"about_ca_system_score_codex":0.00053384725,"about_ca_system_score_gemma":0.00064662314,"threshold_uncertainty_score":0.009286165},"labels":[],"label_agreement":null},{"id":"W4242644826","doi":"10.1109/case.1995.465314","title":"Evolution is essential for software tool development","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Process (computing); Software development; Software engineering; Software; Software development process; Iterative and incremental development; Embodied cognition; Human–computer interaction; Artificial intelligence; Programming language","score_opus":0.017083479484371052,"score_gpt":0.22553582589357837,"score_spread":0.20845234640920732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242644826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09183186,0.007620796,0.7239888,0.037738424,0.0010882955,0.00026879978,0.00007973907,0.0027459653,0.13463728],"genre_scores_gemma":[0.47217605,0.0043377928,0.4901396,0.004068386,0.0005559788,0.00027860177,0.00034030507,0.0020170438,0.026086355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98397696,0.007117152,0.0013701776,0.0015776468,0.0049507692,0.0010073275],"domain_scores_gemma":[0.93133265,0.033412788,0.0044078473,0.017087074,0.011660819,0.0020989012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015165749,0.0004769949,0.00049883605,0.0017371427,0.0034313484,0.006887981,0.0016365194,0.0028698496,0.0027420514],"category_scores_gemma":[0.06658981,0.00092091446,0.00064262794,0.0015093301,0.006126415,0.017066365,0.0052482784,0.004649257,0.0016614983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007149054,0.0001761834,0.010517443,0.00038473186,0.00006321636,0.0010777074,0.019641742,0.0045792973,0.005751142,0.38334325,0.014516435,0.5598775],"study_design_scores_gemma":[0.00003543137,0.00025690938,0.005351488,0.0009522002,0.00010648775,0.0037839317,0.0047585117,0.016034247,0.0067529767,0.49991703,0.46191114,0.00013961874],"about_ca_topic_score_codex":0.0022254507,"about_ca_topic_score_gemma":0.0020670039,"teacher_disagreement_score":0.015165749,"about_ca_system_score_codex":0.002024207,"about_ca_system_score_gemma":0.0031911586,"threshold_uncertainty_score":0.08020508},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01662160194682793,"score_gpt":0.2513658921889296,"score_spread":0.23474429024210164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242946001","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037112315,0.00086602685,0.035748858,0.003246396,0.0036549557,0.00032862023,0.0034638168,0.008431038,0.940549],"genre_scores_gemma":[0.009431582,0.0007565318,0.010614544,0.0010337118,0.00046361954,0.00016047325,0.004361719,0.0015736771,0.97160405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933463,0.00011116891,0.00004398743,0.00013955132,0.00028589624,0.00008478879],"domain_scores_gemma":[0.9991184,0.00016138218,0.00006331213,0.0001579922,0.00037309565,0.00012573565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567425,0.00077917415,0.00032006748,0.0007861108,0.0011487406,0.0032520876,0.0012062162,0.0011778151,0.49461108],"category_scores_gemma":[0.0020806943,0.0003307122,0.00043827365,0.0008925254,0.0006989281,0.0030739168,0.0019893583,0.0011640259,0.2551121],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014814366,0.0000662132,0.0008993577,0.00030507467,0.000007933632,0.00026000323,0.0004709049,0.00044945674,0.003136713,0.11321358,0.66381085,0.21723187],"study_design_scores_gemma":[0.0000057943084,0.00002359383,0.0001994341,0.000032189237,0.000001455787,0.00010698083,0.000058237125,0.00022946142,0.0004199606,0.0025412152,0.9963755,0.000006123834],"about_ca_topic_score_codex":0.0027666958,"about_ca_topic_score_gemma":0.0025849654,"teacher_disagreement_score":0.49461108,"about_ca_system_score_codex":0.00096508075,"about_ca_system_score_gemma":0.0012944882,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4243021313","doi":"10.1109/icpp.2004.1327906","title":"Clustering strategies for cluster timestamps","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Cluster analysis; Scalability; Locality; Cluster (spacecraft); Timestamp-based concurrency control; Hierarchical clustering; Data mining; Distributed computing; Parallel computing; Real-time computing; Database; Artificial intelligence; Computer network","score_opus":0.015829832459714383,"score_gpt":0.2560956738828982,"score_spread":0.24026584142318383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243021313","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13340765,0.0009220382,0.85209614,0.0003426995,0.000103608385,0.00047667584,0.00038167502,0.0032781844,0.008991412],"genre_scores_gemma":[0.4503446,0.0002733775,0.54523176,0.00008076466,0.000031171778,0.00034924937,0.0005525203,0.0003164079,0.0028201456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997865,0.0005636372,0.00022166167,0.00038686403,0.0007265928,0.00023628752],"domain_scores_gemma":[0.9941605,0.0019164723,0.00060000096,0.0011339303,0.0018777213,0.00031136695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024560753,0.00079684186,0.0005965829,0.002212179,0.0016110613,0.0015451491,0.0019567832,0.0010546317,0.0027756987],"category_scores_gemma":[0.009886947,0.0003832443,0.0005067325,0.0033518379,0.0007445634,0.0022465396,0.0013447553,0.00071065617,0.0007014246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093700725,0.00044482105,0.006595333,0.00047775017,0.00021473697,0.00021512787,0.001234245,0.3237747,0.047259074,0.1017199,0.010843841,0.5062835],"study_design_scores_gemma":[0.00022006295,0.00058501406,0.0020951328,0.00005388865,0.00014793643,0.0005780198,0.00092905853,0.8486046,0.07696959,0.042074934,0.027612243,0.00012946893],"about_ca_topic_score_codex":0.0034558186,"about_ca_topic_score_gemma":0.0058235168,"teacher_disagreement_score":0.0034558186,"about_ca_system_score_codex":0.0017187904,"about_ca_system_score_gemma":0.0017430112,"threshold_uncertainty_score":0.012989104},"labels":[],"label_agreement":null},{"id":"W4243026273","doi":"10.1007/978-94-017-0103-7_6","title":"Concurrency Control","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency control; Concurrency; Multiversion concurrency control; Component (thermodynamics); Distributed concurrency control; Isolation (microbiology); Control (management); Distributed computing; Programming language; Artificial intelligence; Database transaction","score_opus":0.012710634633287848,"score_gpt":0.21301319017298345,"score_spread":0.20030255553969561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243026273","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016264307,0.007985603,0.30273977,0.0014413076,0.0018244908,0.0002355427,0.00047231597,0.0037673824,0.67990714],"genre_scores_gemma":[0.055506334,0.0066837333,0.08187703,0.0009791033,0.00082506496,0.00035963077,0.0012056185,0.0009438492,0.85161966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918,0.0000776854,0.000035499128,0.00018703257,0.00045790765,0.00006191447],"domain_scores_gemma":[0.9994025,0.000104840794,0.000026426476,0.000248459,0.00017080083,0.000046942245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058845675,0.000999537,0.0006096921,0.0011773002,0.0011549213,0.0030135678,0.001504021,0.0007900255,0.06304886],"category_scores_gemma":[0.0015702755,0.00056882337,0.00043166117,0.0013935129,0.0016383912,0.0025862027,0.0015784468,0.0017955106,0.025401598],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044627155,0.00005031083,0.00009086037,0.00019186418,0.000010918129,0.000040986408,0.00027898094,0.0021540395,0.0035196156,0.5313742,0.11722646,0.3450171],"study_design_scores_gemma":[0.00001887317,0.00002496174,0.00010338463,0.0000977397,0.0000134907195,0.00013758331,0.000047700396,0.0056337356,0.003385703,0.18398336,0.80653536,0.000018180119],"about_ca_topic_score_codex":0.0025352307,"about_ca_topic_score_gemma":0.003264984,"teacher_disagreement_score":0.06304886,"about_ca_system_score_codex":0.001220676,"about_ca_system_score_gemma":0.0013956897,"threshold_uncertainty_score":0.2109195},"labels":[],"label_agreement":null},{"id":"W4243050516","doi":"10.1109/fccm.2014.60","title":"Speeding Up FPGA Placement: Parallel Algorithms and Methods","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Government of Ontario; Compute Canada","keywords":"Speedup; Computer science; Parallel computing; Field-programmable gate array; Scalability; Lock (firearm); Simulated annealing; Parallel algorithm; Threading (protein sequence); Multithreading; Thread (computing); Algorithm; Computer hardware; Operating system","score_opus":0.025713381126901955,"score_gpt":0.31763067141842555,"score_spread":0.2919172902915236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243050516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00448614,0.0002728135,0.99062777,0.00017898473,0.00006054609,0.00008457624,0.00003102627,0.0012998892,0.0029583124],"genre_scores_gemma":[0.06670318,0.00032083748,0.9294909,0.000070964656,0.000057879523,0.00016929067,0.00008093967,0.00023021447,0.0028757975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00011883321,0.00003520507,0.00009965779,0.00021693342,0.00006548176],"domain_scores_gemma":[0.998808,0.000535842,0.00014392479,0.00021185858,0.00025429987,0.00004596236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009863474,0.0011051891,0.0007338452,0.0011374381,0.000756501,0.0013157969,0.0017432376,0.0011354527,0.009389765],"category_scores_gemma":[0.0028428491,0.00076814427,0.00081883307,0.0012987723,0.0007498865,0.0012817602,0.0009047191,0.00094979245,0.0020959019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013559732,0.00009341749,0.0013298237,0.0002586963,0.000057738776,0.0001192401,0.000097680415,0.5866046,0.005988826,0.03226695,0.005311689,0.3677357],"study_design_scores_gemma":[0.00004674099,0.00003089429,0.00013910407,0.000017331515,0.0000091107095,0.000073228985,0.00002405469,0.98206216,0.0022880186,0.011694027,0.0036053902,0.000009915788],"about_ca_topic_score_codex":0.005364647,"about_ca_topic_score_gemma":0.0074656205,"teacher_disagreement_score":0.009389765,"about_ca_system_score_codex":0.0011539864,"about_ca_system_score_gemma":0.0016528779,"threshold_uncertainty_score":0.031411886},"labels":[],"label_agreement":null},{"id":"W4243536737","doi":"10.1145/1272998.1273009","title":"Melange","year":2007,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nutrasource","funders":"","keywords":"Computer science; Network packet; Computer network; Code (set theory); Operating system; Programming language; Set (abstract data type)","score_opus":0.026370915017322593,"score_gpt":0.30087342539780554,"score_spread":0.27450251038048296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243536737","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010837834,0.0051368093,0.051276565,0.005643422,0.0021994303,0.00029619227,0.010069159,0.05513432,0.8594063],"genre_scores_gemma":[0.050914314,0.0036970924,0.032347247,0.0017521615,0.00035473303,0.00041129312,0.012430452,0.011199474,0.8868933],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991466,0.0001258749,0.00005067582,0.0002271202,0.00032764653,0.00012215709],"domain_scores_gemma":[0.9986979,0.00025441495,0.00008542134,0.00042339962,0.0003208022,0.00021800565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008255359,0.0008107917,0.0004598099,0.0020727275,0.0011149527,0.0028490126,0.0013901216,0.0012958971,0.2898126],"category_scores_gemma":[0.0038050616,0.000551123,0.0004720872,0.0011390109,0.0006283548,0.003415849,0.0039288257,0.0013068676,0.16846545],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044359468,0.0000889316,0.0014879766,0.0005980064,0.00002584266,0.00039605467,0.0006356179,0.0008125801,0.007354321,0.06859079,0.45089078,0.46867555],"study_design_scores_gemma":[0.000009608829,0.000017429898,0.00032540568,0.0000653811,0.0000045014717,0.0001969295,0.000046650566,0.00028796538,0.001347191,0.00292789,0.9947606,0.000010489777],"about_ca_topic_score_codex":0.002225998,"about_ca_topic_score_gemma":0.002970784,"teacher_disagreement_score":0.2898126,"about_ca_system_score_codex":0.0009638913,"about_ca_system_score_gemma":0.0011157396,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4245919610","doi":"10.1007/978-1-4899-7993-3_299-2","title":"Quorum Systems","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quorum sensing; Computer science; Biology; Biofilm","score_opus":0.013589668829225148,"score_gpt":0.2231703625111105,"score_spread":0.20958069368188534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245919610","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074302,0.04533244,0.27974176,0.003943071,0.0051036715,0.0003243919,0.0010582624,0.0022672028,0.6581548],"genre_scores_gemma":[0.13831238,0.035863936,0.14950281,0.0025582965,0.0034791303,0.000622304,0.0025294141,0.0006457578,0.66648597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993356,0.00011655481,0.000044326127,0.00013255884,0.00031557766,0.00005537311],"domain_scores_gemma":[0.99947304,0.0001687567,0.000025848081,0.00013780352,0.00015332508,0.000041234704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000732414,0.0006552675,0.0007751767,0.0010709133,0.0011959962,0.002979028,0.0011488938,0.0011122513,0.047805414],"category_scores_gemma":[0.0020026127,0.0004371106,0.0003686476,0.0018632546,0.001163638,0.0036327282,0.0016984305,0.0013615977,0.015868317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035176072,0.000037829723,0.000121672136,0.00040642635,0.000017134947,0.00007563005,0.00028014535,0.0015184763,0.0028189877,0.6548821,0.08691491,0.25289145],"study_design_scores_gemma":[0.000015833193,0.00003949571,0.00015798585,0.00013443935,0.000009966479,0.00025988038,0.00005230865,0.0045259306,0.001147032,0.31473282,0.6789065,0.000017841781],"about_ca_topic_score_codex":0.00069245195,"about_ca_topic_score_gemma":0.0008878586,"teacher_disagreement_score":0.047805414,"about_ca_system_score_codex":0.0009190689,"about_ca_system_score_gemma":0.0009030066,"threshold_uncertainty_score":0.15992498},"labels":[],"label_agreement":null},{"id":"W4245991412","doi":"10.36227/techrxiv.13719619","title":"Hybrid Automatic Repeat Request (HARQ) in Wireless Communications Systems and Standards: A Contemporary Survey","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; Social Science Research Council","keywords":"Hybrid automatic repeat request; Computer science; Retransmission; Automatic repeat request; Wireless; Selective Repeat ARQ; Forward error correction; Throughput; Computer network; Error detection and correction; Transmitter; Real-time computing; Telecommunications; Telecommunications link; Channel (broadcasting); Decoding methods; Network packet; Algorithm","score_opus":0.052136566450590074,"score_gpt":0.3042584457650832,"score_spread":0.25212187931449315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245991412","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054175216,0.8977836,0.07700411,0.0015647731,0.0013134625,0.00012283021,0.0001556386,0.0002163624,0.016421655],"genre_scores_gemma":[0.038535163,0.91827273,0.03379563,0.00093992014,0.0027983172,0.00014785235,0.00037295616,0.00006802411,0.0050693043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987638,0.00019288759,0.00015545524,0.00020557914,0.000582317,0.0000999423],"domain_scores_gemma":[0.99729127,0.0015906723,0.0001935249,0.0001517027,0.00071078603,0.00006190455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018763266,0.00094176765,0.0011433843,0.0031145005,0.0006913079,0.0022304931,0.0012766649,0.0016862763,0.0028603042],"category_scores_gemma":[0.0026453414,0.0006824996,0.0004755224,0.008149798,0.0010400906,0.0041489694,0.0011907904,0.0018393989,0.0016592845],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009661331,0.00013562369,0.0015418157,0.0052542025,0.000054371838,0.00018915588,0.0003489059,0.004690119,0.0026982322,0.04312866,0.017306399,0.92455596],"study_design_scores_gemma":[0.000028038932,0.000644861,0.0034269334,0.0031759823,0.00018378538,0.0025399816,0.0010462098,0.022184473,0.004861668,0.05374624,0.90794367,0.00021804248],"about_ca_topic_score_codex":0.0015614139,"about_ca_topic_score_gemma":0.0008999334,"teacher_disagreement_score":0.0031145005,"about_ca_system_score_codex":0.0006904947,"about_ca_system_score_gemma":0.001314307,"threshold_uncertainty_score":0.009923041},"labels":[],"label_agreement":null},{"id":"W4246273094","doi":"10.1007/978-1-4614-8265-9_1181","title":"Publish/Subscribe","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Business; Advertising","score_opus":0.016899315709534967,"score_gpt":0.22752463486156485,"score_spread":0.2106253191520299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246273094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005284868,0.0036717383,0.03340119,0.0019375761,0.007894086,0.00068247673,0.009775711,0.019621385,0.9224872],"genre_scores_gemma":[0.0025916372,0.004328833,0.008851053,0.0018351724,0.0024683147,0.00026687485,0.008662634,0.005013739,0.9659818],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988689,0.00009468993,0.0000926346,0.0003244787,0.00048604127,0.00013323044],"domain_scores_gemma":[0.99791676,0.00036759384,0.00008404999,0.00081975566,0.0004160179,0.00039576463],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010950149,0.0018787339,0.0023425438,0.003291573,0.0015999501,0.010430946,0.0021273172,0.0019688818,0.6548143],"category_scores_gemma":[0.0033776509,0.0015347316,0.0011643531,0.0052289655,0.001232935,0.009581855,0.004321784,0.0037160164,0.7635572],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003362804,0.00007258878,0.000093272705,0.000480804,0.000024664136,0.00005085654,0.00004983219,0.00018487626,0.0030240335,0.01630619,0.73702306,0.24265623],"study_design_scores_gemma":[0.0000120584955,0.0000083088125,0.00008549282,0.000042391777,0.0000064214405,0.000053992353,0.000011227776,0.00016176936,0.0003188964,0.004297851,0.9949884,0.000013149666],"about_ca_topic_score_codex":0.0008940068,"about_ca_topic_score_gemma":0.0018572942,"teacher_disagreement_score":0.6548143,"about_ca_system_score_codex":0.00089660607,"about_ca_system_score_gemma":0.0017749285,"threshold_uncertainty_score":0.49236548},"labels":[],"label_agreement":null},{"id":"W4246969106","doi":"10.1109/perser.2004.1356801","title":"Hybrid cache invalidation schemes in mobile environments","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Cache invalidation; Stateless protocol; Stateful firewall; Computer network; Cache algorithms; Broadcasting (networking); Smart Cache; Page cache; CPU cache; Network packet","score_opus":0.011144417792604786,"score_gpt":0.23019297524049384,"score_spread":0.21904855744788906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246969106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48416668,0.0032674214,0.50292164,0.0004376316,0.00011535166,0.00022046798,0.00021445924,0.0042391885,0.0044171168],"genre_scores_gemma":[0.952822,0.00025919062,0.045500297,0.00007258544,0.000046816345,0.00007724211,0.00013343823,0.000049231472,0.0010391689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976903,0.00075756025,0.00020539833,0.00017257653,0.0007856067,0.00038856783],"domain_scores_gemma":[0.99047977,0.0028925359,0.0012988301,0.0032422342,0.0017256496,0.00036100054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020291526,0.00061025895,0.0009560976,0.0011424844,0.0012477017,0.0013520059,0.0023654734,0.0012286193,0.000717312],"category_scores_gemma":[0.006104082,0.0004851824,0.0003653677,0.001992761,0.0011158095,0.0026032743,0.0018574719,0.0007885165,0.00031396467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003306691,0.00059175305,0.016342968,0.0005858671,0.0003750665,0.0016476744,0.0017628826,0.5203196,0.08580818,0.051899843,0.0074766832,0.3098828],"study_design_scores_gemma":[0.00032411853,0.0007835232,0.0019907367,0.0000380622,0.00013727472,0.0010237594,0.00024064795,0.93597806,0.02920626,0.02137117,0.008787098,0.00011926919],"about_ca_topic_score_codex":0.0029486332,"about_ca_topic_score_gemma":0.0025972705,"teacher_disagreement_score":0.0029486332,"about_ca_system_score_codex":0.0011065903,"about_ca_system_score_gemma":0.0007791192,"threshold_uncertainty_score":0.01073128},"labels":[],"label_agreement":null},{"id":"W4247693801","doi":"10.1109/isdasc.2007.4351391","title":"Using Atoms to Simplify Distributed Programs Checking","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Distributed computing","score_opus":0.050821598888656665,"score_gpt":0.3173149895915659,"score_spread":0.2664933907029092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247693801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021944616,0.000092696835,0.9753015,0.00020016845,0.000025037634,0.000062301886,0.00006495216,0.0013081634,0.0010006228],"genre_scores_gemma":[0.42578942,0.00026707668,0.5708544,0.0002287336,0.000068393376,0.00024961264,0.0002321301,0.0005586905,0.0017514756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99098843,0.0030164693,0.0005798905,0.0014965724,0.003104592,0.00081402657],"domain_scores_gemma":[0.96699005,0.019984635,0.0016085481,0.00914109,0.0020251821,0.0002505269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052866098,0.00082236476,0.0015370102,0.0012538778,0.0012065822,0.0023081352,0.0035868424,0.0015616154,0.0029389593],"category_scores_gemma":[0.029853094,0.0012799456,0.0022226518,0.0011375324,0.0058555873,0.007851423,0.005525173,0.0042317845,0.000499898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072995527,0.00015101551,0.0030271518,0.00041727393,0.00017069011,0.0008262441,0.0011553762,0.2178203,0.0244193,0.63802564,0.0019192733,0.111337766],"study_design_scores_gemma":[0.00013003498,0.00013992716,0.00036505456,0.00008999069,0.00012137968,0.00016676643,0.000082226936,0.4893074,0.037198164,0.46595448,0.006377278,0.00006733438],"about_ca_topic_score_codex":0.0037405787,"about_ca_topic_score_gemma":0.0036478043,"teacher_disagreement_score":0.0052866098,"about_ca_system_score_codex":0.0015949954,"about_ca_system_score_gemma":0.002300222,"threshold_uncertainty_score":0.027958572},"labels":[],"label_agreement":null},{"id":"W4248104124","doi":"10.1002/cjce.5450790601","title":"Masthead","year":2001,"lang":"en","type":"paratext","venue":"The Canadian Journal of Chemical Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; World Wide Web","score_opus":0.009566958008347169,"score_gpt":0.1990068842506916,"score_spread":0.18943992624234443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248104124","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042270156,0.002037647,0.0019001064,0.0140054645,0.034516767,0.00035796672,0.005962011,0.0031639705,0.93763334],"genre_scores_gemma":[0.0010631251,0.00074624707,0.00027281672,0.0015401633,0.0020809025,0.00003501875,0.0014937898,0.00045209585,0.9923159],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998792,0.00008755736,0.0000815075,0.00017284091,0.0007245788,0.0001414561],"domain_scores_gemma":[0.99333006,0.0007050118,0.000234214,0.0005916517,0.0038058022,0.0013332055],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012124047,0.00089539,0.0011803275,0.0021926675,0.002697977,0.0060348664,0.0018837928,0.0031819239,0.8849388],"category_scores_gemma":[0.007418363,0.000595396,0.00068995636,0.0022655753,0.0006504172,0.0036763947,0.0021701409,0.0021406207,0.77383757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000159265,0.0000058880414,0.00002738378,0.00004616892,6.330344e-7,0.000027134114,0.000013283163,0.00001225924,0.00009372011,0.0007983827,0.975906,0.023053294],"study_design_scores_gemma":[0.000004216565,0.0000054730785,0.00009962018,0.000032441498,7.692312e-7,0.000031368145,0.00002061657,0.00002283494,0.000052691008,0.00035269518,0.99937457,0.000002728855],"about_ca_topic_score_codex":0.0077071,"about_ca_topic_score_gemma":0.012874598,"teacher_disagreement_score":0.11506122,"about_ca_system_score_codex":0.0015586732,"about_ca_system_score_gemma":0.0029707884,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4248107954","doi":"10.1109/dasc.2007.24","title":"Using Atoms to Simplify Distributed Programs Checking","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Debugging; Computer science; Model checking; State (computer science); Programming language; Code (set theory); State space; Space (punctuation); Program analysis; Theoretical computer science; Operating system; Mathematics","score_opus":0.050821598888656665,"score_gpt":0.3173149895915659,"score_spread":0.2664933907029092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248107954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021944616,0.000092696835,0.9753015,0.00020016845,0.000025037634,0.000062301886,0.00006495216,0.0013081634,0.0010006228],"genre_scores_gemma":[0.42578942,0.00026707668,0.5708544,0.0002287336,0.000068393376,0.00024961264,0.0002321301,0.0005586905,0.0017514756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99098843,0.0030164693,0.0005798905,0.0014965724,0.003104592,0.00081402657],"domain_scores_gemma":[0.96699005,0.019984635,0.0016085481,0.00914109,0.0020251821,0.0002505269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052866098,0.00082236476,0.0015370102,0.0012538778,0.0012065822,0.0023081352,0.0035868424,0.0015616154,0.0029389593],"category_scores_gemma":[0.029853094,0.0012799456,0.0022226518,0.0011375324,0.0058555873,0.007851423,0.005525173,0.0042317845,0.000499898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072995527,0.00015101551,0.0030271518,0.00041727393,0.00017069011,0.0008262441,0.0011553762,0.2178203,0.0244193,0.63802564,0.0019192733,0.111337766],"study_design_scores_gemma":[0.00013003498,0.00013992716,0.00036505456,0.00008999069,0.00012137968,0.00016676643,0.000082226936,0.4893074,0.037198164,0.46595448,0.006377278,0.00006733438],"about_ca_topic_score_codex":0.0037405787,"about_ca_topic_score_gemma":0.0036478043,"teacher_disagreement_score":0.0052866098,"about_ca_system_score_codex":0.0015949954,"about_ca_system_score_gemma":0.002300222,"threshold_uncertainty_score":0.027958572},"labels":[],"label_agreement":null},{"id":"W4248583358","doi":"10.1007/978-0-387-39940-9_299","title":"Quorum Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quorum sensing; Computer science; Biology; Genetics","score_opus":0.01360943569008407,"score_gpt":0.22551858726181293,"score_spread":0.21190915157172885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248583358","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004413793,0.03445347,0.32766744,0.0038103904,0.0043702237,0.00038573967,0.001283798,0.0029343136,0.62068087],"genre_scores_gemma":[0.14545456,0.027142217,0.18278438,0.0024316285,0.0026768865,0.00069660915,0.003013198,0.0006668847,0.6351337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993388,0.000114601506,0.000043974273,0.00013355831,0.00031176468,0.000057297228],"domain_scores_gemma":[0.99944085,0.00016773882,0.000025724195,0.00015979243,0.00016302518,0.000042844207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326067,0.0006486399,0.0008451874,0.001052379,0.0012723531,0.0029639911,0.0012559999,0.001167475,0.050079934],"category_scores_gemma":[0.0020406498,0.0004683551,0.000382583,0.0018462428,0.0011196854,0.0035676043,0.0016482146,0.00133092,0.016892299],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041517626,0.000045020563,0.00014554245,0.00038434475,0.00001873848,0.000091167734,0.00027769597,0.0016695542,0.0030635393,0.6435911,0.094118156,0.2565536],"study_design_scores_gemma":[0.000021075972,0.000045302393,0.00018728052,0.00012363077,0.000012593742,0.00032441394,0.00005534592,0.006178507,0.0014583069,0.3103907,0.6811822,0.000020611282],"about_ca_topic_score_codex":0.00076877594,"about_ca_topic_score_gemma":0.0010224539,"teacher_disagreement_score":0.050079934,"about_ca_system_score_codex":0.0008890807,"about_ca_system_score_gemma":0.0008768014,"threshold_uncertainty_score":0.16753411},"labels":[],"label_agreement":null},{"id":"W4249332824","doi":"10.4018/9781591409359.ch012","title":"Toward Autonomic DBMSs","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Key (lock); Database; Control reconfiguration; Database administrator; Database transaction; Set (abstract data type); Class (philosophy); Distributed computing; Greedy algorithm; Autonomic computing; Cloud computing; Algorithm; Operating system; Artificial intelligence; Programming language","score_opus":0.03164441374271879,"score_gpt":0.23334051837105385,"score_spread":0.20169610462833507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249332824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072114402,0.020251798,0.8912877,0.006428507,0.0012943131,0.00022372715,0.00018084659,0.0047058794,0.0684158],"genre_scores_gemma":[0.05071314,0.016868973,0.8961084,0.002024951,0.00082067424,0.0002922336,0.00062741415,0.00071179733,0.031832386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985709,0.00028063759,0.00009412211,0.00022361006,0.00071606075,0.000114638344],"domain_scores_gemma":[0.99920386,0.00019903401,0.000047731457,0.00024341265,0.00020236336,0.00010355984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022628575,0.0006924133,0.00064522884,0.00096591417,0.00119802,0.0055004247,0.0025574323,0.0018937358,0.006284105],"category_scores_gemma":[0.0032665457,0.0010494136,0.0007985306,0.001676612,0.0010644757,0.0065256143,0.003129592,0.0051662456,0.0039616455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033935703,0.000090631154,0.000772933,0.000420117,0.000041488503,0.00016666822,0.000631503,0.013246253,0.004931795,0.61991745,0.037155714,0.3225915],"study_design_scores_gemma":[0.000027987813,0.000058203026,0.00036102688,0.00038779248,0.00002574346,0.0004816224,0.0002475547,0.06240449,0.0032774366,0.33201438,0.6006807,0.000033023873],"about_ca_topic_score_codex":0.0010200299,"about_ca_topic_score_gemma":0.0016260635,"teacher_disagreement_score":0.006284105,"about_ca_system_score_codex":0.0012622211,"about_ca_system_score_gemma":0.0010982272,"threshold_uncertainty_score":0.021022439},"labels":[],"label_agreement":null},{"id":"W4249552604","doi":"10.1145/1273440.1250676","title":"An integrated hardware-software approach to flexible transactional memory","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Transactional memory; Computer science; Software transactional memory; Thread (computing); Copying; Speedup; Asynchronous communication; Software; Operating system; Commit; Parallel computing; Embedded system; Distributed computing; Database transaction; Programming language; Computer network; Database","score_opus":0.016164649540846,"score_gpt":0.26127528379755494,"score_spread":0.24511063425670893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249552604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048874903,0.0021459637,0.92471176,0.0011263731,0.00029624876,0.00022335284,0.00012021859,0.007447665,0.015053389],"genre_scores_gemma":[0.46264392,0.0007953666,0.5244852,0.00060149806,0.00016772625,0.0002829073,0.00024350299,0.0005205298,0.010259351],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982297,0.00025942898,0.00012583881,0.00031599446,0.00083910016,0.00023011175],"domain_scores_gemma":[0.9974947,0.00041952112,0.0001782947,0.0013982671,0.00039158209,0.00011776021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011934441,0.00077122933,0.00052785635,0.0007082107,0.0005240326,0.0026585145,0.004260874,0.0010297289,0.00479203],"category_scores_gemma":[0.0031178899,0.00070457085,0.00067993137,0.0009928704,0.0013293447,0.003346709,0.0021323499,0.0027445627,0.0011483146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060421135,0.00048524217,0.004513976,0.0008377052,0.000191544,0.00045420925,0.0004945861,0.09135606,0.12645844,0.21414846,0.010458745,0.5499968],"study_design_scores_gemma":[0.00021105571,0.0013254406,0.0019522639,0.00014401757,0.00019142342,0.00084283034,0.000220443,0.7073994,0.12061339,0.083078414,0.08387115,0.00015009042],"about_ca_topic_score_codex":0.0013691488,"about_ca_topic_score_gemma":0.0020246548,"teacher_disagreement_score":0.00479203,"about_ca_system_score_codex":0.0011134859,"about_ca_system_score_gemma":0.001908472,"threshold_uncertainty_score":0.016030967},"labels":[],"label_agreement":null},{"id":"W4249963106","doi":"10.1007/978-0-387-39940-9_34","title":"Autonomous Replication","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Replication (statistics); Computer science; Biology; Virology","score_opus":0.01592784198609253,"score_gpt":0.2408392107438823,"score_spread":0.22491136875778975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249963106","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033116448,0.0137799615,0.2741955,0.0017244621,0.0023355992,0.00024261563,0.00090971356,0.006531743,0.6969688],"genre_scores_gemma":[0.078517124,0.013396772,0.12743971,0.00095492735,0.0011879595,0.00030631365,0.0025328952,0.0013503989,0.7743139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996208,0.00004256023,0.000019871366,0.00009384139,0.00019605078,0.000026883416],"domain_scores_gemma":[0.99951625,0.000081976956,0.000020583302,0.00022076038,0.00012860406,0.000031867334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378842,0.0005772675,0.00046205378,0.00082826463,0.0008044584,0.0023226277,0.0013083902,0.000793017,0.042666193],"category_scores_gemma":[0.0010476395,0.00046247704,0.00040428893,0.0011309781,0.0006868336,0.002576538,0.0013204726,0.0010663292,0.029703591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256338,0.000058540983,0.00019444853,0.0004126211,0.000020443404,0.00012095769,0.0002853366,0.0023711056,0.00782334,0.2997298,0.18910062,0.49982023],"study_design_scores_gemma":[0.000014028179,0.000025161995,0.00018042875,0.000094463954,0.000012890228,0.00041987584,0.000044400793,0.004940482,0.0035136903,0.1006857,0.8900513,0.000017603064],"about_ca_topic_score_codex":0.0006963043,"about_ca_topic_score_gemma":0.0010166212,"teacher_disagreement_score":0.042666193,"about_ca_system_score_codex":0.0005782838,"about_ca_system_score_gemma":0.0007691273,"threshold_uncertainty_score":0.14273262},"labels":[],"label_agreement":null},{"id":"W4250245788","doi":"10.7873/date.2013.167","title":"Verifying Safety and Liveness for the FlexTM Hybrid Transactional Memory","year":2013,"lang":"en","type":"article","venue":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2013","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transactional memory; Software transactional memory; Computer science; Liveness; Cache coherence; Serializability; Distributed computing; Shared memory; Parallel computing; Cache; Theoretical computer science; Database transaction; Transaction processing; Programming language; CPU cache; Cache algorithms; Distributed transaction","score_opus":0.05367815994319934,"score_gpt":0.2639988018149418,"score_spread":0.21032064187174243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250245788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22211166,0.0002658531,0.77283317,0.00014700492,0.000023818478,0.00008549237,0.00015931673,0.002787904,0.001585774],"genre_scores_gemma":[0.8508502,0.00007411019,0.14796652,0.000054728713,0.000014779128,0.000081760314,0.00015406728,0.00012247638,0.00068127876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978955,0.000476165,0.00015956118,0.00038871777,0.00085616123,0.00022400243],"domain_scores_gemma":[0.995214,0.002410012,0.0005342006,0.0012495009,0.00049625343,0.0000960383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465257,0.0005561421,0.0003709997,0.00062523317,0.0005344447,0.0011072778,0.0017546011,0.0007906928,0.0014123988],"category_scores_gemma":[0.0062756687,0.00037040265,0.00085061113,0.0003506473,0.0017608998,0.0023081528,0.0015871291,0.0008611246,0.00016345644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015771893,0.00024030109,0.019060485,0.00077189656,0.00031267523,0.0017164713,0.0010112395,0.38741255,0.17866193,0.21004124,0.0016857159,0.19750828],"study_design_scores_gemma":[0.00009871644,0.0006008786,0.001297842,0.000053294578,0.00009609332,0.0005178769,0.00016079855,0.83104926,0.10564577,0.05650191,0.0039275847,0.000049913353],"about_ca_topic_score_codex":0.0018772975,"about_ca_topic_score_gemma":0.0017100167,"teacher_disagreement_score":0.0024465257,"about_ca_system_score_codex":0.0006857671,"about_ca_system_score_gemma":0.0008613565,"threshold_uncertainty_score":0.012938678},"labels":[],"label_agreement":null},{"id":"W4251206053","doi":"10.1145/1352431.1352450","title":"Online recovery in cluster databases","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Replica; Scalability; Downtime; Heuristics; Distributed computing; Replication (statistics); High availability; Database; Database transaction; Transfer (computing); Distributed database; Set (abstract data type); Computer network; Operating system","score_opus":0.04047001056615874,"score_gpt":0.26642836919882545,"score_spread":0.22595835863266672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251206053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11049603,0.0018777715,0.8736961,0.0011408665,0.00013651447,0.00025869752,0.00018753618,0.005181886,0.007024557],"genre_scores_gemma":[0.81842244,0.0006363909,0.17331116,0.0001513107,0.00005056301,0.00018624566,0.00028059888,0.00022992105,0.0067313756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978537,0.0007086136,0.00011451013,0.00029279583,0.00076753384,0.00026284147],"domain_scores_gemma":[0.9965341,0.001418657,0.00027897648,0.0011366853,0.00047822954,0.00015338593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024211626,0.0004181652,0.00081889366,0.00082109164,0.0012258984,0.0014506798,0.0023494074,0.0011341982,0.0025574116],"category_scores_gemma":[0.007700237,0.00046442484,0.00038297274,0.0013037956,0.00092607684,0.0022551396,0.0022704739,0.0011219879,0.0006114746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073065265,0.00023859907,0.0020700837,0.00023628463,0.000061567094,0.0003165253,0.00047047087,0.6943273,0.010512582,0.058067508,0.00959869,0.22336984],"study_design_scores_gemma":[0.00008572536,0.00008859144,0.0004420109,0.00002200172,0.000025885423,0.0001434056,0.00022287758,0.9496223,0.0076209335,0.03544852,0.0062544686,0.000023371753],"about_ca_topic_score_codex":0.0070449007,"about_ca_topic_score_gemma":0.0033907772,"teacher_disagreement_score":0.0070449007,"about_ca_system_score_codex":0.0011733377,"about_ca_system_score_gemma":0.0013388474,"threshold_uncertainty_score":0.014007807},"labels":[],"label_agreement":null},{"id":"W4251318870","doi":"10.1145/544915.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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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); Multi-agent system; Reliability engineering; Computer network; Computer security; Engineering; Artificial intelligence","score_opus":0.01836708407344712,"score_gpt":0.2308340455114102,"score_spread":0.2124669614379631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251318870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106105156,0.0012694171,0.88375574,0.00051744323,0.00016364563,0.00014197509,0.000023448232,0.002838549,0.0051845587],"genre_scores_gemma":[0.65028363,0.0009381132,0.3440086,0.0001450567,0.00009759854,0.00009724372,0.00006916392,0.00019869661,0.004161862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985127,0.00050068664,0.00013572298,0.00018986243,0.00050134753,0.00015974758],"domain_scores_gemma":[0.9956899,0.0012173774,0.00058846094,0.0017381316,0.0006183501,0.0001476164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914499,0.00059835933,0.0005627496,0.00058577023,0.00053844985,0.0013264826,0.0014489416,0.0008980994,0.0016392003],"category_scores_gemma":[0.0058341087,0.00032104237,0.00043649165,0.0005385656,0.00069471286,0.002019575,0.0013960825,0.00096125685,0.00074745365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003752089,0.00028710655,0.00461173,0.00038725242,0.000111894165,0.0005313214,0.00088387565,0.33114022,0.16322076,0.04115138,0.0040310454,0.45326808],"study_design_scores_gemma":[0.0001231284,0.00056989567,0.0014372251,0.00006965391,0.00013989607,0.0008157292,0.00023226273,0.8122923,0.10638086,0.035178423,0.04268274,0.000077929704],"about_ca_topic_score_codex":0.0009346125,"about_ca_topic_score_gemma":0.0007238293,"teacher_disagreement_score":0.0016392003,"about_ca_system_score_codex":0.00038882784,"about_ca_system_score_gemma":0.00055008073,"threshold_uncertainty_score":0.007887661},"labels":[],"label_agreement":null},{"id":"W4252943164","doi":"10.1109/dasc.2007.19","title":"A Coarse-Grained Pessimistic Message Logging Scheme for Improving Rollback Recovery Efficiency","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalability; Computer science; Rollback; Fault tolerance; Overhead (engineering); Distributed computing; Partition (number theory); Parallel computing; Database transaction; Operating system; Database","score_opus":0.013588510546994385,"score_gpt":0.2551691042966368,"score_spread":0.2415805937496424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252943164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18501769,0.00057986093,0.8098852,0.00031535813,0.00010601918,0.0001708085,0.000061735496,0.0021409206,0.0017224129],"genre_scores_gemma":[0.90688235,0.0001417744,0.091904856,0.00005066977,0.000030083665,0.000071269205,0.000050293194,0.00003531145,0.0008333777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.00011188823,0.000058395926,0.00007911946,0.00016519647,0.00006787684],"domain_scores_gemma":[0.99841225,0.00044312698,0.00021464606,0.00056757877,0.00025533547,0.000107092936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009486407,0.00041963052,0.0005149259,0.0006736353,0.00061557395,0.00066403777,0.0009714021,0.00037852043,0.0011311705],"category_scores_gemma":[0.0030069805,0.00019879609,0.00018387852,0.00057932426,0.0005329809,0.0010656025,0.00080309843,0.0005782805,0.00021367271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013714561,0.00042583467,0.0036071616,0.00036755728,0.000066793866,0.0004337898,0.000736444,0.32942608,0.28740206,0.036875635,0.004099348,0.33518782],"study_design_scores_gemma":[0.00012532577,0.0004238887,0.00085346197,0.000025361216,0.00005407782,0.00021799847,0.00010945513,0.9169966,0.07294227,0.005263043,0.0029361283,0.000052367704],"about_ca_topic_score_codex":0.0008115488,"about_ca_topic_score_gemma":0.0009006539,"teacher_disagreement_score":0.0011311705,"about_ca_system_score_codex":0.00045495643,"about_ca_system_score_gemma":0.0009736676,"threshold_uncertainty_score":0.005016923},"labels":[],"label_agreement":null},{"id":"W4253548028","doi":"10.36227/techrxiv.13719619.v1","title":"Hybrid Automatic Repeat Request (HARQ) in Wireless Communications Systems and Standards: A Contemporary Survey","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; Social Science Research Council","keywords":"Hybrid automatic repeat request; Computer science; Retransmission; Automatic repeat request; Wireless; Selective Repeat ARQ; Forward error correction; Throughput; Computer network; Error detection and correction; Transmitter; Real-time computing; Telecommunications; Telecommunications link; Network packet; Channel (broadcasting); Decoding methods; Algorithm","score_opus":0.052136566450590074,"score_gpt":0.3042584457650832,"score_spread":0.25212187931449315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253548028","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007298198,0.8564763,0.11498905,0.0015262449,0.0013863882,0.00015829781,0.00017887286,0.00026235377,0.017724391],"genre_scores_gemma":[0.053465676,0.89096916,0.04544115,0.0009402192,0.0029083388,0.00019903663,0.0004365965,0.00007668037,0.005563214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987741,0.0001997545,0.00014374555,0.00020782217,0.0005737514,0.00010080329],"domain_scores_gemma":[0.9975,0.0014603742,0.00017508805,0.00014259694,0.0006674972,0.000054526343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018488967,0.0009128563,0.0011654233,0.0028863489,0.0007005833,0.0021449795,0.001290804,0.0015479199,0.0025991846],"category_scores_gemma":[0.0025732657,0.00062192784,0.0004536925,0.007483562,0.0009798459,0.0037661148,0.0011238031,0.0017460047,0.001552096],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010997594,0.0001415598,0.0016496951,0.0052466416,0.00006324247,0.00019569969,0.00036677864,0.0057677953,0.0034787357,0.045584112,0.0145549625,0.9228408],"study_design_scores_gemma":[0.000036110978,0.00080092973,0.0038488396,0.0031861262,0.00023866544,0.0030246167,0.0011675362,0.030393055,0.0066404226,0.06435298,0.8860546,0.00025616886],"about_ca_topic_score_codex":0.0013605859,"about_ca_topic_score_gemma":0.000760684,"teacher_disagreement_score":0.0028863489,"about_ca_system_score_codex":0.00068436994,"about_ca_system_score_gemma":0.001290426,"threshold_uncertainty_score":0.009777963},"labels":[],"label_agreement":null},{"id":"W4253656132","doi":"10.1007/978-0-387-39940-9_1369","title":"Partial Replication","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Computer science; Medicine; Virology","score_opus":0.017946792720938826,"score_gpt":0.24693776637297765,"score_spread":0.22899097365203883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253656132","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045274068,0.012138113,0.3179903,0.0016741481,0.0022907292,0.00044248096,0.0022244346,0.008565745,0.6501467],"genre_scores_gemma":[0.08308621,0.011571615,0.15906784,0.00091327855,0.001042282,0.00040887215,0.005427253,0.0020734402,0.7364092],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950945,0.00006001355,0.000030489648,0.000118849835,0.00024598913,0.00003516131],"domain_scores_gemma":[0.99926096,0.000096018084,0.000026339756,0.0003857061,0.00019494974,0.000035989684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042413073,0.00070347113,0.0006538355,0.0009313289,0.00093961216,0.0023920871,0.0012582577,0.00066683633,0.06466249],"category_scores_gemma":[0.001457991,0.0004588287,0.00055255374,0.0016064002,0.00061609014,0.002902207,0.001456307,0.0009959267,0.036699597],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090923815,0.00005375029,0.00018953512,0.00062776334,0.000028213633,0.00012149918,0.00026432532,0.0022152066,0.008177017,0.20397246,0.19228603,0.59197325],"study_design_scores_gemma":[0.000022835295,0.000048490492,0.00020858852,0.000115523675,0.000023706169,0.0006060728,0.000059348764,0.0039517535,0.0051034796,0.08508838,0.9047502,0.000021552993],"about_ca_topic_score_codex":0.0008105885,"about_ca_topic_score_gemma":0.0011755163,"teacher_disagreement_score":0.06466249,"about_ca_system_score_codex":0.0005749352,"about_ca_system_score_gemma":0.0009753471,"threshold_uncertainty_score":0.2163176},"labels":[],"label_agreement":null},{"id":"W4254006602","doi":"10.24124/2017/58893","title":"A distribute deadlock detection and resolution algorithm using agents","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Deadlock prevention algorithms; Deadlock; Bottleneck; Computer science; Distributed computing; Overhead (engineering); Algorithm; Resolution (logic); Concurrency control; Embedded system; Artificial intelligence; Database transaction; Database; Operating system","score_opus":0.0245746611866255,"score_gpt":0.2919262095723174,"score_spread":0.2673515483856919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254006602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014884524,0.00018501208,0.9802296,0.00011200679,0.000060180337,0.00013752589,0.000031787597,0.0031840452,0.001175297],"genre_scores_gemma":[0.16519867,0.00010840734,0.8320367,0.00008727904,0.00002984715,0.00015756967,0.00012799528,0.00017828745,0.0020753003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988998,0.0002135101,0.0001117339,0.00027639483,0.00038902386,0.00010955063],"domain_scores_gemma":[0.9973857,0.0007794352,0.00022385492,0.0007140086,0.0006748194,0.00022209952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018250159,0.000797957,0.0009141807,0.00094409316,0.0011715156,0.0014063489,0.0019895448,0.0008732724,0.0019354728],"category_scores_gemma":[0.00403086,0.00046721756,0.00050886755,0.0007427591,0.00075439055,0.0017907795,0.0018912669,0.0013898476,0.000611132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000864146,0.00060740975,0.0042006387,0.00027236564,0.00017967314,0.0001738624,0.00036691857,0.17804615,0.05447414,0.043874722,0.009396015,0.70754397],"study_design_scores_gemma":[0.00023116801,0.00021020963,0.00046340583,0.000018462908,0.00006128147,0.00016727998,0.00005837088,0.94424105,0.03328379,0.011538747,0.00968526,0.00004105393],"about_ca_topic_score_codex":0.0027736272,"about_ca_topic_score_gemma":0.002594854,"teacher_disagreement_score":0.0027736272,"about_ca_system_score_codex":0.00080864393,"about_ca_system_score_gemma":0.0021805032,"threshold_uncertainty_score":0.0096517205},"labels":[],"label_agreement":null},{"id":"W4254051564","doi":"10.1145/777466.777467","title":"Toward a decidable notion of sequential consistency","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decidability; Undecidable problem; Correctness; Computer science; Upper and lower bounds; Prefix; Sequential consistency; Consistency (knowledge bases); Protocol (science); Theoretical computer science; Discrete mathematics; Reachability problem; Conjecture; Counterexample; Mathematics; Algorithm; Consistency model","score_opus":0.0325474592930355,"score_gpt":0.2504543122260805,"score_spread":0.21790685293304501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254051564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038201306,0.0005100054,0.9423328,0.0041325474,0.00013569977,0.00016481172,0.00036713583,0.0012229821,0.012932724],"genre_scores_gemma":[0.5709255,0.00068937085,0.41698465,0.0015298504,0.0005400366,0.00069905486,0.0010682369,0.00054320804,0.007020055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871171,0.0039776643,0.0011262692,0.002977768,0.0035875565,0.0012136438],"domain_scores_gemma":[0.96533084,0.022697499,0.0017890864,0.0071613663,0.0021322214,0.0008889613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012941671,0.0010756816,0.0011966565,0.0021828783,0.0027885577,0.008184805,0.005957018,0.0033494763,0.0032327885],"category_scores_gemma":[0.02658788,0.0023147804,0.003467931,0.0023463324,0.011653747,0.021624248,0.007989095,0.013914975,0.0006475192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769563,0.00007251559,0.00033373813,0.000079387544,0.000022777866,0.000098711906,0.00053662696,0.01014992,0.0016034433,0.980056,0.0008725842,0.0061065713],"study_design_scores_gemma":[0.00006112284,0.000037610465,0.000080481266,0.00003792627,0.000029663252,0.000074020805,0.00014613553,0.06280972,0.0038494659,0.9264965,0.006354467,0.000022913373],"about_ca_topic_score_codex":0.0031197814,"about_ca_topic_score_gemma":0.00250909,"teacher_disagreement_score":0.012941671,"about_ca_system_score_codex":0.0057067596,"about_ca_system_score_gemma":0.004778965,"threshold_uncertainty_score":0.06844294},"labels":[],"label_agreement":null},{"id":"W4254406499","doi":"10.1007/978-3-030-44368-9_4","title":"Resource Acquisition","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rhizobia; Nitrogen fixation; Bacteria; Siderophore; Biology; Plant growth; Cyanobacteria; Nitrogen; Phosphorus; Botany; Chemistry","score_opus":0.01558013840586504,"score_gpt":0.20825499646070095,"score_spread":0.19267485805483592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254406499","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026200095,0.0012755458,0.0756366,0.0008218662,0.00048612314,0.00027261316,0.00073902094,0.0036470802,0.9145012],"genre_scores_gemma":[0.03867891,0.0020704698,0.036681492,0.0006723087,0.00023778994,0.00027000305,0.0012596464,0.00070038275,0.919429],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996964,0.000027077329,0.000009980772,0.00007029564,0.00014727902,0.000049026126],"domain_scores_gemma":[0.99967945,0.000046290497,0.000013194866,0.00012966405,0.000095111005,0.00003633424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038331628,0.000715259,0.00045909165,0.0010167316,0.00090332504,0.0021125467,0.0014029078,0.0006072171,0.15104851],"category_scores_gemma":[0.000815528,0.0003534204,0.00031966955,0.0011777421,0.000502387,0.0024851663,0.001698956,0.0012188549,0.074197],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001149469,0.000110434186,0.00019802149,0.0002739136,0.000009179389,0.00013393899,0.00019303407,0.0019341608,0.016695144,0.18949907,0.18918428,0.60165393],"study_design_scores_gemma":[0.000012030654,0.00003927627,0.00029284385,0.00007764778,0.000008045694,0.00021984905,0.00007716486,0.00389314,0.009967802,0.023761895,0.96163374,0.00001657593],"about_ca_topic_score_codex":0.0022805745,"about_ca_topic_score_gemma":0.0026082278,"teacher_disagreement_score":0.15104851,"about_ca_system_score_codex":0.0008058213,"about_ca_system_score_gemma":0.0013999616,"threshold_uncertainty_score":0.5053076},"labels":[],"label_agreement":null},{"id":"W4254407238","doi":"10.1007/978-1-4614-8265-9_80723","title":"Replication for Availability and Fault Tolerance","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Fault tolerance; Computer science; Reliability engineering; Biology; Distributed computing; Engineering; Virology","score_opus":0.020530188198388182,"score_gpt":0.25655943631381406,"score_spread":0.2360292481154259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254407238","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019012234,0.28143921,0.14612354,0.006337702,0.0108031845,0.00015575919,0.0007057481,0.0024785965,0.55005497],"genre_scores_gemma":[0.03142323,0.15936644,0.071330264,0.0021161383,0.008279689,0.00022987631,0.0014801301,0.0011546056,0.72461957],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953175,0.00006462866,0.000028119186,0.00009830035,0.0002422284,0.000034952867],"domain_scores_gemma":[0.99956006,0.00014374977,0.000024737772,0.00012345247,0.000115235525,0.000032689008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376399,0.0009580677,0.0008983886,0.0013634539,0.0007413353,0.0032254492,0.0014766431,0.0012807187,0.045431014],"category_scores_gemma":[0.0011520304,0.00043965137,0.0004444566,0.0030596952,0.0009980877,0.0043912088,0.001467994,0.002242489,0.021557476],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029389008,0.00004700845,0.00006589663,0.0008049687,0.00001841376,0.00009330914,0.00027887442,0.0013948848,0.0025463535,0.2913072,0.26105294,0.44236064],"study_design_scores_gemma":[0.000005787067,0.000017703242,0.00008417416,0.00019600292,0.0000071057684,0.00025620344,0.000043519973,0.001005224,0.00043086786,0.07418282,0.92375946,0.000011152736],"about_ca_topic_score_codex":0.0007680144,"about_ca_topic_score_gemma":0.0010278701,"teacher_disagreement_score":0.045431014,"about_ca_system_score_codex":0.00090799603,"about_ca_system_score_gemma":0.0010473077,"threshold_uncertainty_score":0.15198189},"labels":[],"label_agreement":null},{"id":"W4255025547","doi":"10.1145/1837853.1693465","title":"Scheduling support for transactional memory contention management","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Transactional memory; Scheduling (production processes); Implementation; Database transaction; Transactional leadership; Distributed computing; Operating system; Transaction processing; Software transactional memory; Linux kernel; Parallel computing; Database; Programming language","score_opus":0.020213033304827877,"score_gpt":0.2651542776782818,"score_spread":0.24494124437345394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255025547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35150594,0.0023472612,0.6025269,0.00045192873,0.00053612696,0.0005200611,0.0003305943,0.030290088,0.011491058],"genre_scores_gemma":[0.91021395,0.00025205617,0.086356826,0.00015460711,0.000153933,0.00013903796,0.00030915378,0.0004549728,0.0019655002],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987369,0.00021058577,0.00020636186,0.00021169445,0.0004018914,0.0002324942],"domain_scores_gemma":[0.99224514,0.0016310648,0.0009374344,0.002878362,0.001798286,0.0005097814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011998038,0.0006845868,0.0005655586,0.00074083736,0.0006665416,0.0014154884,0.0033520798,0.00048662935,0.0036551198],"category_scores_gemma":[0.00726121,0.00042067666,0.0003455863,0.0007412113,0.0005065905,0.0014641058,0.0011561646,0.0011647297,0.00082138943],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029939488,0.00143503,0.020362932,0.0010009726,0.00027993086,0.0009833467,0.0012634589,0.045415267,0.3874819,0.029132837,0.018155057,0.4914953],"study_design_scores_gemma":[0.00041544426,0.00074941746,0.005535547,0.00007552184,0.00023852474,0.0006726876,0.00015471858,0.75248307,0.19409415,0.008568783,0.036878835,0.00013337258],"about_ca_topic_score_codex":0.0014706902,"about_ca_topic_score_gemma":0.0014866387,"teacher_disagreement_score":0.0036551198,"about_ca_system_score_codex":0.00092317787,"about_ca_system_score_gemma":0.0015779554,"threshold_uncertainty_score":0.012227535},"labels":[],"label_agreement":null},{"id":"W4255845198","doi":"10.1007/978-1-4899-7993-3_1181-2","title":"Publish/Subscribe","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canada Research Chairs","funders":"","keywords":"Computer science; Publication; Business; Advertising","score_opus":0.01487611985669136,"score_gpt":0.2208040977661282,"score_spread":0.20592797790943684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255845198","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006063028,0.0040522353,0.044126533,0.0018418372,0.0077192956,0.0008097035,0.011006093,0.021744674,0.9080933],"genre_scores_gemma":[0.0032337878,0.005133455,0.011730459,0.0018729636,0.0024952292,0.0003228589,0.010508714,0.005355867,0.9593467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988212,0.000100320656,0.000105221516,0.00033236961,0.00050423737,0.00013662319],"domain_scores_gemma":[0.9979663,0.00035161068,0.00008689866,0.00082023116,0.00040790762,0.00036710405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011830718,0.001954942,0.0023952366,0.003268532,0.0015804266,0.0103811305,0.0021876218,0.0019380455,0.6057322],"category_scores_gemma":[0.0034092695,0.0015972172,0.001205011,0.005325197,0.0013224423,0.009615795,0.0043527973,0.003631607,0.72369075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041305342,0.00008090973,0.00010447667,0.00056753185,0.000030709958,0.00006346682,0.00005929862,0.0002220419,0.0036196897,0.02033184,0.71112365,0.26375514],"study_design_scores_gemma":[0.000014845838,0.000009844715,0.00009377921,0.000050410737,0.000008177411,0.00006729176,0.000012387316,0.00020429144,0.00041127353,0.0055274465,0.9935846,0.000015588217],"about_ca_topic_score_codex":0.0009678847,"about_ca_topic_score_gemma":0.0019115446,"teacher_disagreement_score":0.6057322,"about_ca_system_score_codex":0.0009147923,"about_ca_system_score_gemma":0.0018574081,"threshold_uncertainty_score":0.5623752},"labels":[],"label_agreement":null},{"id":"W4281621365","doi":"10.1145/3519270.3538418","title":"When is Recoverable Consensus Harder Than Consensus?","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Hellenic Foundation for Research and Innovation; Agence Nationale de la Recherche","keywords":"Consensus; Computer science; Uniform consensus; Object (grammar); Class (philosophy); Focus (optics); Consensus algorithm; Consensus conference; Crash; Distributed computing; Multi-agent system; Artificial intelligence; Algorithm","score_opus":0.030788588759919754,"score_gpt":0.2649005089795085,"score_spread":0.23411192021958876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281621365","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62256444,0.0026862752,0.32753864,0.0277712,0.00059673254,0.00025918765,0.0005460588,0.001102617,0.016934838],"genre_scores_gemma":[0.95876205,0.0008678141,0.03478227,0.00092898344,0.0006868377,0.00021714439,0.0003704639,0.00028480607,0.003099606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906737,0.0028661212,0.0005478346,0.002182167,0.0017236944,0.0020063482],"domain_scores_gemma":[0.88560313,0.09326133,0.006972091,0.008094488,0.0032434678,0.0028254655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006968961,0.00078333466,0.002616944,0.0011689618,0.0020878073,0.0042779404,0.0028888818,0.0067951083,0.00835261],"category_scores_gemma":[0.08037375,0.0011059075,0.0015879279,0.0019251445,0.005028304,0.01829898,0.0041144034,0.0055548614,0.000868842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029968538,0.000996186,0.017080095,0.0022310563,0.0008622238,0.0021565622,0.0037400702,0.4316326,0.0143931825,0.35752138,0.02644578,0.13994402],"study_design_scores_gemma":[0.0003101458,0.00024716725,0.0019890661,0.00008600746,0.00008460236,0.00082299515,0.0017283951,0.31105158,0.004852843,0.67479336,0.0039409697,0.00009277797],"about_ca_topic_score_codex":0.0014831362,"about_ca_topic_score_gemma":0.00077840564,"teacher_disagreement_score":0.00835261,"about_ca_system_score_codex":0.0012183592,"about_ca_system_score_gemma":0.0010291561,"threshold_uncertainty_score":0.036855817},"labels":[],"label_agreement":null},{"id":"W4281747838","doi":"10.1145/3514221.3526161","title":"Natto: Providing Distributed Transaction Prioritization for High-Contention Workloads","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 International Conference on Management of Data","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Database transaction; Timestamp; Distributed transaction; Transaction processing; Latency (audio); Prioritization; Online transaction processing; Distributed database; Database; Distributed computing; Computer network; Business; Telecommunications","score_opus":0.062399477194828606,"score_gpt":0.29384535846480053,"score_spread":0.23144588126997193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281747838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11013305,0.0017556287,0.81768155,0.00090390176,0.0011101844,0.00045713683,0.0008162817,0.052205604,0.014936705],"genre_scores_gemma":[0.7237583,0.0007712639,0.2581912,0.00072613923,0.0004972507,0.0002932988,0.0019064132,0.0022517128,0.011604508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983619,0.00024411494,0.00016176258,0.00022245158,0.0008041797,0.00020558717],"domain_scores_gemma":[0.9948468,0.00092981884,0.00037885844,0.0020889167,0.001174628,0.00058088993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020087413,0.0007736311,0.0007286203,0.0009511807,0.0010539291,0.001979583,0.0032824432,0.00061221694,0.0046252725],"category_scores_gemma":[0.006673001,0.0005892897,0.00031740227,0.0008831376,0.00051097485,0.0029673001,0.002698326,0.0011663607,0.0018769858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004136104,0.0006699095,0.022182867,0.0007224374,0.0002968524,0.0011420954,0.0011585364,0.048639536,0.17491905,0.038142968,0.08911568,0.61887395],"study_design_scores_gemma":[0.00072242616,0.0007325889,0.0056098714,0.00008803771,0.00016997331,0.001385004,0.00046984694,0.7159179,0.08917107,0.027716577,0.15777147,0.00024535492],"about_ca_topic_score_codex":0.0029295231,"about_ca_topic_score_gemma":0.0053750584,"teacher_disagreement_score":0.0046252725,"about_ca_system_score_codex":0.0007963777,"about_ca_system_score_gemma":0.0019423631,"threshold_uncertainty_score":0.015473068},"labels":[],"label_agreement":null},{"id":"W4281990278","doi":"10.1145/3519270.3538435","title":"Near-Optimal Leader Election in Population Protocols on Graphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Research Council; European Commission","keywords":"Leader election; Binary logarithm; Computer science; Node (physics); Graph; Population; Enhanced Data Rates for GSM Evolution; Protocol (science); State (computer science); Combinatorics; Discrete mathematics; Theoretical computer science; Computer network; Mathematics; Algorithm; Physics","score_opus":0.03197834224755796,"score_gpt":0.3125812532256111,"score_spread":0.2806029109780531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281990278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22004092,0.00043902826,0.7716133,0.0012262696,0.00006246848,0.00014537564,0.00015888498,0.0005804122,0.0057333387],"genre_scores_gemma":[0.9170315,0.00036716112,0.07783616,0.00025656898,0.00006263769,0.00027160044,0.00023152762,0.00012893743,0.0038138614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789244,0.0009725981,0.000076056655,0.00042075804,0.00034124803,0.00029694068],"domain_scores_gemma":[0.9923435,0.0055381358,0.0007452483,0.0005570907,0.0003796124,0.0004364208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025803947,0.0005853369,0.0014623496,0.00092147227,0.001350356,0.0014738075,0.0016721166,0.0013772177,0.0015990508],"category_scores_gemma":[0.012473807,0.0006446369,0.0005786585,0.001034385,0.0021234157,0.00285067,0.0022498586,0.0014237453,0.00032877855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020763894,0.00008380184,0.0007318447,0.00008934562,0.00005585025,0.0001290555,0.0003299588,0.844195,0.0028335566,0.13767153,0.0017707422,0.011901724],"study_design_scores_gemma":[0.000050953393,0.000045344823,0.000110165594,0.0000065989693,0.000008438158,0.000022262244,0.00006133744,0.8557464,0.0004917281,0.14287113,0.0005751532,0.000010467971],"about_ca_topic_score_codex":0.0024383361,"about_ca_topic_score_gemma":0.002243092,"teacher_disagreement_score":0.0025803947,"about_ca_system_score_codex":0.0016967552,"about_ca_system_score_gemma":0.0016690515,"threshold_uncertainty_score":0.013646543},"labels":[],"label_agreement":null},{"id":"W4283826070","doi":"10.4230/lipics.disc.2022.36","title":"On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Impossibility; Computer science; Byzantine fault tolerance; Context (archaeology); Asynchronous communication; Process (computing); Implementation; Crash; Matching (statistics); Theoretical computer science; Fault tolerance; Distributed computing; Programming language; Mathematics; Computer network","score_opus":0.05199247388996938,"score_gpt":0.18853847106648028,"score_spread":0.1365459971765109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283826070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09857323,0.00042764185,0.89239013,0.0007809956,0.00006712078,0.00016370323,0.00005777246,0.0028054628,0.0047339387],"genre_scores_gemma":[0.7443096,0.0007618349,0.24533711,0.00034880376,0.00014287382,0.0006513785,0.00017581575,0.0007260064,0.007546555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98753345,0.0044444045,0.0012199241,0.0019232795,0.0030528936,0.0018259516],"domain_scores_gemma":[0.97516745,0.011011212,0.0023712798,0.010113552,0.0010873493,0.00024911435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007615615,0.0015050905,0.0017344385,0.0012737827,0.0017912228,0.0052775927,0.003412664,0.002866582,0.004610338],"category_scores_gemma":[0.02126757,0.001321142,0.0018570008,0.0012252657,0.008279155,0.015722368,0.007346811,0.0052474043,0.0014409566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001023304,0.00016748703,0.0021848811,0.00088155776,0.00008339869,0.00071176514,0.0030427757,0.09548201,0.02587746,0.7936837,0.0014506486,0.075411044],"study_design_scores_gemma":[0.00042236113,0.0009730592,0.0006169829,0.0003550544,0.00022490293,0.00066969544,0.00066935824,0.30079758,0.1159928,0.553617,0.025436863,0.00022436009],"about_ca_topic_score_codex":0.0012650129,"about_ca_topic_score_gemma":0.0009542629,"teacher_disagreement_score":0.007615615,"about_ca_system_score_codex":0.0015869002,"about_ca_system_score_gemma":0.001936517,"threshold_uncertainty_score":0.040275693},"labels":[],"label_agreement":null},{"id":"W4285006235","doi":"10.1145/3490148.3538594","title":"A NUMA-Aware Recoverable Mutex Lock","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Computer science; Mutual exclusion; Lock (firearm); Transformation (genetics); Parallel computing; Overhead (engineering); Distributed computing; Operating system","score_opus":0.0069843465575176455,"score_gpt":0.19377969419391167,"score_spread":0.18679534763639402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285006235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29556555,0.00030820316,0.6822334,0.00032285834,0.00014221715,0.00027932457,0.00015642366,0.0105157085,0.010476384],"genre_scores_gemma":[0.8615137,0.00006746328,0.1316619,0.00014909884,0.000020895683,0.00010006845,0.00016996732,0.0002127621,0.0061041103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992324,0.000111020236,0.000035735575,0.0001328267,0.00033768886,0.00015028633],"domain_scores_gemma":[0.9989396,0.00027015124,0.000111549045,0.0004436393,0.0001507699,0.00008427876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006509434,0.00025875482,0.00037568386,0.00038765548,0.0005163894,0.0008118191,0.0010624764,0.00052547717,0.0032052821],"category_scores_gemma":[0.0020002297,0.0001615703,0.0002915582,0.00031367745,0.0005727578,0.0013043222,0.0011089963,0.0006944438,0.00062307675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022156346,0.0008086037,0.0076350574,0.00031151657,0.00010927128,0.00088649086,0.0009741469,0.12269906,0.30003557,0.094496496,0.0073582795,0.46246988],"study_design_scores_gemma":[0.0003131217,0.0010448585,0.0018745594,0.00002586396,0.0000678601,0.0007484813,0.000198939,0.7309156,0.22277644,0.013491027,0.028462397,0.00008083732],"about_ca_topic_score_codex":0.0009304579,"about_ca_topic_score_gemma":0.00090504286,"teacher_disagreement_score":0.0032052821,"about_ca_system_score_codex":0.00038930777,"about_ca_system_score_gemma":0.0009839592,"threshold_uncertainty_score":0.010722697},"labels":[],"label_agreement":null},{"id":"W4286503795","doi":"10.1145/3519270.3538457","title":"Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dram; Computer science; CAS latency; Software; Latency (audio); Implementation; Fetch; Parallel computing; Embedded system; Computer architecture; Computer hardware; Operating system; Software engineering; Semiconductor memory; Memory controller; Telecommunications","score_opus":0.06413582881915507,"score_gpt":0.2721195011691379,"score_spread":0.20798367234998283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286503795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131884245,0.052605264,0.7189633,0.08497536,0.04192139,0.00013548095,0.000941115,0.0022078345,0.08506179],"genre_scores_gemma":[0.37947872,0.09213322,0.25712836,0.020702617,0.08881199,0.0007230238,0.001968717,0.0016899642,0.15736338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.0002466661,0.000079429694,0.00023100228,0.0003437846,0.00011778207],"domain_scores_gemma":[0.99730957,0.0015231558,0.00012462195,0.00033973012,0.0005497404,0.00015321454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021311226,0.00067993655,0.00070526276,0.0012411044,0.0017596412,0.0035663487,0.0020671682,0.003351102,0.011547705],"category_scores_gemma":[0.005429203,0.0007287373,0.0011266608,0.0015733361,0.003782623,0.009521559,0.0014839952,0.0069521484,0.0033594351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047212696,0.000030262323,0.00023881698,0.0002838484,0.000014371127,0.00013164472,0.00017543584,0.00298673,0.0009197171,0.89821196,0.060050488,0.036909457],"study_design_scores_gemma":[0.000024896326,0.00009531667,0.00023772639,0.0001447934,0.000023003367,0.00029847896,0.000078175464,0.01813842,0.0010468893,0.76679957,0.21306689,0.000045789955],"about_ca_topic_score_codex":0.0012702002,"about_ca_topic_score_gemma":0.0008637629,"teacher_disagreement_score":0.011547705,"about_ca_system_score_codex":0.001900351,"about_ca_system_score_gemma":0.001294635,"threshold_uncertainty_score":0.038630962},"labels":[],"label_agreement":null},{"id":"W4286504588","doi":"10.1145/3519270.3538420","title":"The Space Complexity of Consensus from Swap","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swap (finance); Upper and lower bounds; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics","score_opus":0.03383615275591361,"score_gpt":0.2434777389214238,"score_spread":0.20964158616551018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286504588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50122154,0.0019527163,0.44332775,0.00500705,0.0003162764,0.00028581204,0.0015573638,0.0038285288,0.042502947],"genre_scores_gemma":[0.9411651,0.00052510283,0.048132367,0.00032771906,0.00017222772,0.000346754,0.0012773533,0.00034812695,0.0077053104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964478,0.00095412927,0.00021193987,0.00059538265,0.0011832584,0.0006074727],"domain_scores_gemma":[0.9921983,0.005008765,0.00034622464,0.0016313053,0.0005570179,0.00025845255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016522863,0.00062804046,0.0010983978,0.00069055625,0.001225156,0.0026755636,0.0014879055,0.0013715527,0.009432261],"category_scores_gemma":[0.011725401,0.00045733227,0.0009546694,0.0013344683,0.0020891977,0.006895422,0.0034345833,0.002004449,0.0015075159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021553366,0.00019580367,0.001953688,0.00072818366,0.00012249534,0.00032195513,0.0010491025,0.45530373,0.018163817,0.34999943,0.01800991,0.15199646],"study_design_scores_gemma":[0.00019935981,0.0001361466,0.0005496958,0.000032797285,0.000040817344,0.000108673754,0.00013567855,0.5590047,0.006225226,0.4288857,0.004647953,0.000033195818],"about_ca_topic_score_codex":0.0022073593,"about_ca_topic_score_gemma":0.0015429057,"teacher_disagreement_score":0.009432261,"about_ca_system_score_codex":0.001695247,"about_ca_system_score_gemma":0.002508201,"threshold_uncertainty_score":0.031554043},"labels":[],"label_agreement":null},{"id":"W4287068133","doi":"10.48550/arxiv.2108.02000","title":"Do What You Know: Coupling Knowledge with Action in Discrete-Event Systems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Novelty; Formalism (music); Computer science; Action (physics); Event (particle physics); Theoretical computer science; Psychology","score_opus":0.06154041182909723,"score_gpt":0.2184396099055304,"score_spread":0.15689919807643318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287068133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009592452,0.0002345101,0.9769668,0.001961507,0.000083507024,0.00005837262,0.000074355456,0.00022901347,0.010799653],"genre_scores_gemma":[0.7511877,0.000557739,0.23726512,0.00054389954,0.00017301377,0.0003561044,0.00017507024,0.00009193206,0.009649506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974632,0.0012271832,0.00016375615,0.00039851098,0.0005471193,0.00020022519],"domain_scores_gemma":[0.9921367,0.005773931,0.0004724136,0.0008170535,0.0003451433,0.00045485547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00310198,0.0006284665,0.00057082064,0.00075704977,0.00096132193,0.003809858,0.0018514752,0.002060042,0.0034266799],"category_scores_gemma":[0.009851749,0.00051244884,0.0008882318,0.0007276446,0.0045863474,0.006944391,0.0032401232,0.0032037988,0.0005610021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076888784,0.00006587241,0.00042861563,0.00008495713,0.000021488433,0.00027789982,0.00073369575,0.10590446,0.000697658,0.8758111,0.0010075836,0.014889752],"study_design_scores_gemma":[0.000032969525,0.000033720327,0.00009044222,0.00004473604,0.000017819273,0.000071847906,0.00012424402,0.30855197,0.0007979037,0.6831211,0.00709011,0.00002319563],"about_ca_topic_score_codex":0.002562747,"about_ca_topic_score_gemma":0.0020811409,"teacher_disagreement_score":0.003809858,"about_ca_system_score_codex":0.0013869163,"about_ca_system_score_gemma":0.0014932945,"threshold_uncertainty_score":0.016404986},"labels":[],"label_agreement":null},{"id":"W4289599795","doi":"10.4230/lipics.disc.2023.26","title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Equivocation; Asynchrony (computer programming); Computer science; Byzantine fault tolerance; Latency (audio); Byzantine architecture; Block (permutation group theory); Atomic broadcast; Computer network; Distributed computing; Broadcasting (networking); Fault tolerance; Mathematics; History; Telecommunications; Combinatorics; Asynchronous communication; Philosophy","score_opus":0.06788937075502022,"score_gpt":0.20452727145097838,"score_spread":0.13663790069595816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289599795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062497664,0.0006422994,0.9057094,0.00077698374,0.00033288548,0.00044210296,0.00060537184,0.01434482,0.014648371],"genre_scores_gemma":[0.64486074,0.0004480525,0.3313841,0.0002705115,0.0001433811,0.00037037182,0.0012363371,0.00087774213,0.020408818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989436,0.0002448045,0.00008402702,0.00023492226,0.00036294223,0.00012960852],"domain_scores_gemma":[0.9975616,0.00058855646,0.00020274702,0.0011005187,0.00034379173,0.00020276771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019935595,0.0005677398,0.0008318024,0.00069337216,0.0010078192,0.0011429443,0.0017383735,0.0009195125,0.0068872604],"category_scores_gemma":[0.0059050308,0.0004397698,0.00039717185,0.0007683577,0.0009693077,0.003045273,0.0030782614,0.0014531112,0.0020449688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020897158,0.00028347125,0.0018903501,0.0007625653,0.00010103104,0.00052267814,0.0007475328,0.13076617,0.051922914,0.22679077,0.038998097,0.54512465],"study_design_scores_gemma":[0.00038752987,0.0003320075,0.0002641021,0.00006996487,0.000036477086,0.00032315878,0.00010560392,0.76038426,0.041472394,0.15594941,0.04061749,0.000057567617],"about_ca_topic_score_codex":0.001116346,"about_ca_topic_score_gemma":0.0021617326,"teacher_disagreement_score":0.0068872604,"about_ca_system_score_codex":0.00070046505,"about_ca_system_score_gemma":0.001451717,"threshold_uncertainty_score":0.023040175},"labels":[],"label_agreement":null},{"id":"W4289827658","doi":"10.1109/ipdpsw55747.2022.00098","title":"A Customizable Lightweight STM for Irregular Algorithms on GPU","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Implementation; Data structure; Programmer; Distributed computing; Graph; Software transactional memory; Concurrent data structure; Parallel computing; Algorithm; Theoretical computer science; Transactional memory; Programming language","score_opus":0.015756074996795127,"score_gpt":0.2627092232664928,"score_spread":0.2469531482696977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289827658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15926218,0.001040233,0.79943484,0.0003495839,0.00038267067,0.00033006526,0.00043823643,0.023898598,0.014863685],"genre_scores_gemma":[0.57003766,0.00030456312,0.4197807,0.00021662169,0.000048782687,0.00022536716,0.0007264472,0.0008544136,0.007805427],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954635,0.00006727186,0.000045701498,0.0000641584,0.00020014701,0.0000763136],"domain_scores_gemma":[0.9992867,0.000112677284,0.00006161553,0.00030950087,0.00016128412,0.00006822097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003670475,0.00046503285,0.00044148054,0.00048396853,0.00034168278,0.0009821282,0.0024279612,0.0006022608,0.0046346867],"category_scores_gemma":[0.0015457172,0.00028651487,0.00047842402,0.00062042585,0.00037690188,0.0011159021,0.0010179078,0.0009156338,0.0012349278],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020003647,0.0005268115,0.009612502,0.0010551752,0.00021110558,0.001059697,0.0005682041,0.09397486,0.2623396,0.040607885,0.026501285,0.5615424],"study_design_scores_gemma":[0.00022357369,0.0010984269,0.0024818082,0.000071297865,0.00008531057,0.00082095247,0.00016419642,0.84403497,0.09245681,0.0074064457,0.051079568,0.000076656856],"about_ca_topic_score_codex":0.0013441958,"about_ca_topic_score_gemma":0.0016848264,"teacher_disagreement_score":0.0046346867,"about_ca_system_score_codex":0.00045648863,"about_ca_system_score_gemma":0.00079528266,"threshold_uncertainty_score":0.015504539},"labels":[],"label_agreement":null},{"id":"W4290993992","doi":"10.1109/icc45855.2022.9838616","title":"Efficient multi-tier, multiple entry PBFT consensus algorithm for IoT","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Node (physics); Distributed computing; Computer network; Upper and lower bounds; Blockchain; Byzantine fault tolerance; Markov chain; Overlay network; Layer (electronics); The Internet; Fault tolerance; Operating system","score_opus":0.10566786162500623,"score_gpt":0.34726878356480156,"score_spread":0.24160092193979532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290993992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030969955,0.00016754432,0.96586245,0.00013797074,0.000027671651,0.00008240338,0.000038941827,0.00039874035,0.0023144057],"genre_scores_gemma":[0.80707914,0.00017232058,0.18891457,0.00005271151,0.000016828373,0.00016921773,0.0001426498,0.000038460847,0.0034140127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999571,0.000113589755,0.0000244154,0.000074769785,0.00013589145,0.000080284306],"domain_scores_gemma":[0.99942756,0.0002463817,0.00007671079,0.00007010756,0.00013451048,0.000044749275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070535217,0.0003678276,0.0007211005,0.00034930304,0.0008421326,0.00060503336,0.0011084207,0.0007294752,0.0015383345],"category_scores_gemma":[0.001395121,0.0002211326,0.00028371316,0.00053923804,0.00046816384,0.0009967444,0.0009884279,0.00067443756,0.00024801338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018961316,0.000058566966,0.00055898505,0.00007812679,0.000026900047,0.00009387723,0.00011427642,0.9081158,0.0052810074,0.016866442,0.0011759687,0.067440405],"study_design_scores_gemma":[0.000011350453,0.000031083357,0.000044014385,0.000002713447,0.0000027659516,0.000014970587,0.00000980041,0.9953194,0.00064104813,0.0035835558,0.00033576376,0.0000034946438],"about_ca_topic_score_codex":0.004356124,"about_ca_topic_score_gemma":0.0055839564,"teacher_disagreement_score":0.004356124,"about_ca_system_score_codex":0.0008456442,"about_ca_system_score_gemma":0.0018005961,"threshold_uncertainty_score":0.008661509},"labels":[],"label_agreement":null},{"id":"W4290996995","doi":"10.1109/icc45855.2022.9839161","title":"Arbitration Mechanisms for Multiple Entry Capability in PBFT for IoT Systems","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Byzantine fault tolerance; Computer science; Arbitration; Distributed computing; Independence (probability theory); Computer network; Fault tolerance; Computer security","score_opus":0.10387813781107368,"score_gpt":0.34258337542045025,"score_spread":0.23870523760937656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290996995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05158233,0.00063836086,0.94289577,0.0002507042,0.00010807588,0.00018619173,0.00002509385,0.0009731191,0.00334039],"genre_scores_gemma":[0.89774466,0.0003023817,0.097733416,0.00012238233,0.00011312927,0.00027451784,0.000040413222,0.00009363919,0.0035754296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804866,0.00060142,0.00023282462,0.00024630144,0.0005371146,0.00033370758],"domain_scores_gemma":[0.99638736,0.0017050215,0.000521964,0.0007681137,0.00046577168,0.00015192553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031358222,0.0005348603,0.0009941207,0.0007146145,0.0014364381,0.0018479871,0.0017266596,0.0009960092,0.003621589],"category_scores_gemma":[0.0059049246,0.00029888225,0.00047541884,0.0005436458,0.0014227349,0.0030860605,0.0026495429,0.0015191691,0.00042847855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012854207,0.00027248217,0.0025223254,0.0009254415,0.00013293729,0.0015547777,0.003084292,0.1554223,0.13154249,0.47200608,0.0047257333,0.22652572],"study_design_scores_gemma":[0.00022619865,0.0006443087,0.0007032805,0.00012485433,0.00010756118,0.00094512536,0.00030448634,0.8016737,0.041117556,0.1274498,0.026565442,0.00013763059],"about_ca_topic_score_codex":0.00066519977,"about_ca_topic_score_gemma":0.00054836425,"teacher_disagreement_score":0.003621589,"about_ca_system_score_codex":0.00062760216,"about_ca_system_score_gemma":0.000882648,"threshold_uncertainty_score":0.01658398},"labels":[],"label_agreement":null},{"id":"W4293875467","doi":"","title":"On the Power of Oracle Omega? for Self-Stabilizing Leader Election in Population Protocols","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Oracle; Omega; Power (physics); Leader election; Population; Computer science; Political science; Physics; Computer network; Sociology; Demography","score_opus":0.021691405970641297,"score_gpt":0.266684649882018,"score_spread":0.24499324391137672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293875467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13256225,0.0037675144,0.8146486,0.013229268,0.00075263134,0.0001304071,0.00017355962,0.0020058753,0.032729886],"genre_scores_gemma":[0.9544971,0.00084398454,0.036682993,0.0009075429,0.00052019843,0.000108059285,0.00010216602,0.00034132108,0.0059965476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927327,0.004214014,0.00034678564,0.000762513,0.0012665181,0.000677536],"domain_scores_gemma":[0.91118073,0.07719339,0.0019176761,0.005868533,0.002138703,0.0017008731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011905892,0.00082377775,0.0023685396,0.0014413876,0.0017754837,0.004145037,0.0028954563,0.0029836628,0.007372746],"category_scores_gemma":[0.07421439,0.0006692966,0.0008935257,0.0012288316,0.006590949,0.012127217,0.005724927,0.0053440672,0.0010078873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002392097,0.00022090695,0.0023877788,0.00036796994,0.00008334719,0.00023192239,0.0006600248,0.11135194,0.0023177017,0.7636759,0.008961163,0.10734914],"study_design_scores_gemma":[0.00014047051,0.00012987855,0.00016581062,0.00004783518,0.000033509983,0.00006822047,0.00010242727,0.4341971,0.0012708898,0.56216484,0.001653862,0.000025098201],"about_ca_topic_score_codex":0.0013136931,"about_ca_topic_score_gemma":0.0010711056,"teacher_disagreement_score":0.011905892,"about_ca_system_score_codex":0.0015793127,"about_ca_system_score_gemma":0.0016588365,"threshold_uncertainty_score":0.062965155},"labels":[],"label_agreement":null},{"id":"W4296345334","doi":"10.4204/eptcs.370.14","title":"Characterizing the Decidability of Finite State Automata Team Games with Communication","year":2022,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Decidability; Perfect information; Computer science; Imperfect; Automaton; State (computer science); Bounded function; Finite-state machine; Theoretical computer science; Discrete mathematics; Mathematical economics; Mathematics; Algorithm","score_opus":0.004493288395293986,"score_gpt":0.217890313072296,"score_spread":0.21339702467700203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296345334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443583,0.0005069728,0.6376022,0.0027480246,0.00008868553,0.00030522412,0.0007768535,0.0014584692,0.012155247],"genre_scores_gemma":[0.9516869,0.0001721508,0.043891277,0.0003528706,0.00012566292,0.00037631794,0.00056958623,0.00021546739,0.002609659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880642,0.0032550425,0.00096049946,0.0028516501,0.0027605896,0.0021079744],"domain_scores_gemma":[0.9001621,0.086234905,0.004802691,0.004992084,0.002041048,0.0017671499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006780452,0.0013712216,0.0019114583,0.001645347,0.0022767272,0.008237005,0.006031884,0.004306616,0.003377521],"category_scores_gemma":[0.046165742,0.0018354259,0.0034842568,0.001422097,0.006644914,0.016263692,0.0047591235,0.007428123,0.00028477385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047162437,0.0004727729,0.005157161,0.00034827457,0.00027162506,0.00086170423,0.0021342656,0.25267303,0.0059989076,0.7184244,0.0018363276,0.011349954],"study_design_scores_gemma":[0.00011414772,0.00008178857,0.0002774999,0.000040167528,0.00007778789,0.0001567636,0.00020759297,0.5833545,0.0036312086,0.41090205,0.0011154343,0.000041040545],"about_ca_topic_score_codex":0.0068364698,"about_ca_topic_score_gemma":0.0044996208,"teacher_disagreement_score":0.008237005,"about_ca_system_score_codex":0.0066189095,"about_ca_system_score_gemma":0.0052688434,"threshold_uncertainty_score":0.0480237},"labels":[],"label_agreement":null},{"id":"W4298212960","doi":"10.1007/978-3-031-01839-8_8","title":"Lazy Replication","year":2010,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on data management","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Commit; Computer science; Protocol (science); Replication (statistics); Distributed computing; Database; Mathematics","score_opus":0.039418800825405415,"score_gpt":0.2657403954992836,"score_spread":0.22632159467387816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298212960","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052669006,0.011896284,0.44242162,0.0034121103,0.003424397,0.00015835262,0.0006759893,0.0072480002,0.5254963],"genre_scores_gemma":[0.11753099,0.00831719,0.13009866,0.0013514264,0.0019229049,0.0002292923,0.0015259972,0.0024390623,0.7365845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936813,0.000092261565,0.00003080277,0.0001744986,0.00028349616,0.00005070799],"domain_scores_gemma":[0.99928063,0.00012905641,0.000026704653,0.00037673733,0.00014719082,0.000039704377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005889859,0.00074976287,0.00060768053,0.00076831965,0.0010917063,0.0023881872,0.0011920768,0.0007205197,0.038657933],"category_scores_gemma":[0.0018177493,0.000557504,0.0004713242,0.0013687628,0.0010933164,0.0046057277,0.0016921439,0.0020065964,0.021003561],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007264926,0.000047663907,0.00012388677,0.00021683292,0.000021653874,0.000051387426,0.00027048367,0.0027329242,0.0038016513,0.523608,0.13235657,0.33669633],"study_design_scores_gemma":[0.00002164122,0.000031570573,0.00015886273,0.0000898191,0.000020316655,0.0002110434,0.000057329835,0.007273402,0.0036109337,0.4311052,0.55739653,0.000023386467],"about_ca_topic_score_codex":0.0008008659,"about_ca_topic_score_gemma":0.0011500589,"teacher_disagreement_score":0.038657933,"about_ca_system_score_codex":0.00095452747,"about_ca_system_score_gemma":0.0009389861,"threshold_uncertainty_score":0.12932366},"labels":[],"label_agreement":null},{"id":"W4298412919","doi":"10.1007/978-3-031-01839-8_4","title":"Replication Architecture","year":2010,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on data management","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Maintainability; Replication (statistics); Computer science; Scalability; Architecture; Task (project management); Distributed computing; Interface (matter); Software engineering; Computer architecture; Embedded system; Engineering; Systems engineering; Operating system","score_opus":0.03188859320682832,"score_gpt":0.2583578644803138,"score_spread":0.22646927127348546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298412919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056321467,0.002919528,0.51928794,0.002112468,0.001438756,0.00038829763,0.0009890067,0.011279813,0.45595214],"genre_scores_gemma":[0.13243574,0.004433622,0.32380888,0.00094997196,0.0007850349,0.0006528838,0.0036466627,0.0023204081,0.53096676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995276,0.00007520648,0.0000294057,0.00013215636,0.00019208713,0.000043536882],"domain_scores_gemma":[0.9994349,0.00006365723,0.000017108,0.00028930412,0.00015744861,0.000037508693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053337525,0.00070310524,0.00043373235,0.00069772755,0.0010435804,0.002793339,0.0016208283,0.00096620456,0.04231833],"category_scores_gemma":[0.0012088795,0.0005797968,0.00051487144,0.0009854396,0.0006357354,0.0031205437,0.0012901581,0.0013636657,0.023901151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764223,0.000060371007,0.00020601222,0.00024517626,0.000023061484,0.00008707564,0.00024750968,0.0038353864,0.01175291,0.60414106,0.0942498,0.28507522],"study_design_scores_gemma":[0.000032475375,0.000057329904,0.00025303056,0.0000845365,0.000028163882,0.0003835685,0.00008758089,0.018338736,0.010207016,0.23066226,0.7398355,0.00002976918],"about_ca_topic_score_codex":0.0012528773,"about_ca_topic_score_gemma":0.0014535749,"teacher_disagreement_score":0.04231833,"about_ca_system_score_codex":0.0009517645,"about_ca_system_score_gemma":0.0011916811,"threshold_uncertainty_score":0.14156884},"labels":[],"label_agreement":null},{"id":"W4300426065","doi":"10.1007/978-3-031-01873-2","title":"On Transactional Concurrency Control","year":2019,"lang":"en","type":"book","venue":"Synthesis lectures on data management","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency control; Concurrency; Computer science; Multiversion concurrency control; Transactional leadership; Transactional analysis; Transactional memory; Optimistic concurrency control; Programming language; Volume (thermodynamics); Control (management); Database; Distributed concurrency control; Database transaction; Artificial intelligence; Psychology; Social psychology","score_opus":0.020988508987970084,"score_gpt":0.2444799830385521,"score_spread":0.223491474050582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300426065","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021111309,0.07668664,0.2880813,0.0042246,0.010286441,0.000102096514,0.00045618106,0.0017240829,0.6163275],"genre_scores_gemma":[0.056096803,0.041551854,0.05679811,0.0016569906,0.005816914,0.00023681785,0.0009421604,0.0010416796,0.83585864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999326,0.000073035444,0.0000303349,0.000100777565,0.0004172026,0.000052690157],"domain_scores_gemma":[0.9995173,0.0001938596,0.000018464625,0.00012048811,0.00011553298,0.00003423751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940673,0.0012550306,0.00075650634,0.0013011959,0.00069109054,0.0024253607,0.0010083743,0.0007214459,0.034127127],"category_scores_gemma":[0.0013030997,0.0005622923,0.00043416736,0.0025470268,0.0017436933,0.0031298567,0.0012597074,0.0026849231,0.013215613],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045550703,0.000037889116,0.000058914957,0.00029111875,0.000018556013,0.000045035737,0.00019544516,0.0037945765,0.002207248,0.47830975,0.18656132,0.3284346],"study_design_scores_gemma":[0.000016612577,0.000033162905,0.00018337635,0.00018826107,0.000015972184,0.00011853779,0.000035417423,0.008287237,0.0015159638,0.34057912,0.6490079,0.000018363386],"about_ca_topic_score_codex":0.0011939309,"about_ca_topic_score_gemma":0.0014355185,"teacher_disagreement_score":0.034127127,"about_ca_system_score_codex":0.0012635702,"about_ca_system_score_gemma":0.0008212274,"threshold_uncertainty_score":0.11416656},"labels":[],"label_agreement":null},{"id":"W4306316807","doi":"10.2514/6.2022-4389","title":"Collaborative Space and Ground Interactions with Varying Space Vehicle Autonomy","year":2022,"lang":"en","type":"article","venue":"ASCEND 2022","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Ground segment; Space vehicle; Satellite; Architecture; Constraint (computer-aided design); Computer science; Systems engineering; Set (abstract data type); Space (punctuation); Space exploration; State space; Software; Remotely operated underwater vehicle; Autonomous system (mathematics); Real-time computing; Control engineering; Distributed computing; Engineering; Aerospace engineering; Mobile robot; Artificial intelligence; Operating system; Robot","score_opus":0.006949247129316207,"score_gpt":0.230122728047327,"score_spread":0.22317348091801079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306316807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.564669,0.0003059633,0.29943925,0.00090136,0.00021015177,0.00044236003,0.0006311679,0.0065229516,0.12687784],"genre_scores_gemma":[0.93799,0.00008300513,0.038836446,0.000085328254,0.000025115833,0.0001667485,0.00044668064,0.0002657198,0.02210085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946135,0.00016237667,0.00001630185,0.000107517335,0.00013125408,0.000121083554],"domain_scores_gemma":[0.9988864,0.00042836086,0.00006126928,0.000217512,0.00012756384,0.0002788973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006160388,0.00047093257,0.00032875972,0.0003609961,0.00097398256,0.0014492838,0.0007891347,0.00083689654,0.033750158],"category_scores_gemma":[0.0021900565,0.00024180501,0.00033384992,0.00033363927,0.0005123448,0.0015742914,0.0031638502,0.0006408234,0.0033745673],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030954622,0.0022226328,0.014346994,0.0004795274,0.00021567603,0.0023319637,0.008576857,0.28085822,0.13342488,0.04532237,0.056499865,0.4526256],"study_design_scores_gemma":[0.00039793583,0.0014614481,0.014563348,0.00009570172,0.000110941524,0.00040615787,0.007467758,0.7940455,0.037324976,0.03216232,0.111810364,0.00015349608],"about_ca_topic_score_codex":0.0043570898,"about_ca_topic_score_gemma":0.007950189,"teacher_disagreement_score":0.033750158,"about_ca_system_score_codex":0.00049610995,"about_ca_system_score_gemma":0.00067745475,"threshold_uncertainty_score":0.1129055},"labels":[],"label_agreement":null},{"id":"W4307714896","doi":"10.5281/zenodo.7190626","title":"When Is Recoverable Consensus Harder Than Consensus?","year":2022,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Hellenic Foundation for Research and Innovation; Agence Nationale de la Recherche","keywords":"Consensus algorithm; Computer science; Uniform consensus; Consensus; Artificial intelligence; Data science; Multi-agent system","score_opus":0.037770835015196944,"score_gpt":0.25117697265618905,"score_spread":0.2134061376409921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307714896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5861539,0.002594129,0.36044767,0.028243024,0.0006065422,0.0002527792,0.0005593879,0.0013319174,0.019810643],"genre_scores_gemma":[0.95920014,0.0008619193,0.033808853,0.0009381528,0.00063202955,0.00020740682,0.00040179247,0.00031522903,0.003634638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918926,0.0025009525,0.00042415026,0.0018377078,0.001550129,0.001794427],"domain_scores_gemma":[0.9098148,0.07380297,0.0055800043,0.0061154636,0.002450415,0.00223644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006081392,0.000751831,0.0023647547,0.0011160754,0.0020170202,0.0042385273,0.0026227254,0.0065091704,0.008837985],"category_scores_gemma":[0.067596264,0.0010553282,0.0014543114,0.0018158745,0.0048404755,0.01611195,0.0038480214,0.0053459024,0.0009110008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028305317,0.0009186553,0.014933764,0.0021322486,0.0007716673,0.002195908,0.0033407237,0.4510754,0.015634656,0.3430889,0.029608892,0.13346864],"study_design_scores_gemma":[0.00027979654,0.0002586156,0.0018434911,0.00008208402,0.00007956191,0.0008337027,0.0015904387,0.3560452,0.004899188,0.63007367,0.0039303266,0.00008395458],"about_ca_topic_score_codex":0.0014889728,"about_ca_topic_score_gemma":0.0008351651,"teacher_disagreement_score":0.008837985,"about_ca_system_score_codex":0.0011754553,"about_ca_system_score_gemma":0.0010197603,"threshold_uncertainty_score":0.03216183},"labels":[],"label_agreement":null},{"id":"W4307928661","doi":"10.48550/arxiv.2210.16511","title":"A Uniform Approach to Compare Architectures in Decentralized Discrete-Event Systems","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Architecture; Computer science; Morphism; Event (particle physics); Distributed computing; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.05536886797854125,"score_gpt":0.2072121438684822,"score_spread":0.15184327588994095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307928661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011086283,0.00017995044,0.9837001,0.00016062755,0.00007213572,0.00014607213,0.00013394952,0.0003832022,0.0041376567],"genre_scores_gemma":[0.25502828,0.00023730731,0.741454,0.00013136913,0.00007906446,0.00052183593,0.000404478,0.00017621128,0.0019674557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98543257,0.006465139,0.0017022605,0.0021719185,0.0036750596,0.0005530846],"domain_scores_gemma":[0.97923,0.007792039,0.0015266105,0.007452817,0.0033473913,0.00065111247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013902666,0.0009736124,0.0012113808,0.004108741,0.0012957514,0.0042621065,0.0025437858,0.002090567,0.0036620728],"category_scores_gemma":[0.043390356,0.00062535383,0.0014392554,0.0030448285,0.0044743805,0.006953347,0.0053732563,0.0033817287,0.0008076517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030442022,0.00013905192,0.003414481,0.0003646857,0.00015375447,0.00013437126,0.0005306374,0.058455817,0.0077724457,0.78469926,0.0012971234,0.14273405],"study_design_scores_gemma":[0.00007531436,0.0005856707,0.0020053359,0.00024897,0.00014937921,0.0002941645,0.0004924904,0.19456306,0.021922877,0.7600206,0.019548165,0.000094025585],"about_ca_topic_score_codex":0.0005420723,"about_ca_topic_score_gemma":0.0004704101,"teacher_disagreement_score":0.013902666,"about_ca_system_score_codex":0.0016340378,"about_ca_system_score_gemma":0.001388547,"threshold_uncertainty_score":0.07352519},"labels":[],"label_agreement":null},{"id":"W4309676745","doi":"10.1109/smc53654.2022.9945394","title":"Fault-Resilience Role Engine for an Autonomous Cooperative Multi-Robot System using E-CARGO","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Robustness (evolution); Computer science; Redundancy (engineering); Fault tolerance; Distributed computing; Mobile robot; Resilience (materials science); Process (computing); Robot; Motion planning; Reliability engineering; Engineering; Artificial intelligence","score_opus":0.06881004630316598,"score_gpt":0.31016865509495783,"score_spread":0.24135860879179186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309676745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07048078,0.00010033554,0.92443764,0.00019636222,0.000051591254,0.00011479963,0.00003235359,0.0008485644,0.0037375668],"genre_scores_gemma":[0.9415261,0.00008366729,0.054835763,0.00005261082,0.0000124021235,0.00011838597,0.000036352405,0.000022725077,0.0033120418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996929,0.00005394244,0.000025522046,0.00008366043,0.00009355728,0.000050503353],"domain_scores_gemma":[0.9996979,0.00007852332,0.000049069982,0.000049795308,0.000081244165,0.000043401353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005068965,0.00050626084,0.00045505422,0.0003149363,0.0005869628,0.00071517215,0.0012696015,0.00061386696,0.0016314138],"category_scores_gemma":[0.0008298493,0.0001737188,0.00046765892,0.0001913917,0.00068829936,0.0010484698,0.00094250555,0.0005284653,0.00030166053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029418708,0.00019317628,0.0016907534,0.00013684225,0.00005000088,0.0007771326,0.0005272176,0.85321504,0.031984318,0.058869638,0.001174599,0.05108711],"study_design_scores_gemma":[0.000014786171,0.00006894289,0.00009982803,0.0000043270247,0.000010324164,0.000040419425,0.000021075317,0.9943118,0.0022382191,0.0022899031,0.0008915345,0.000008804371],"about_ca_topic_score_codex":0.005406336,"about_ca_topic_score_gemma":0.0027073591,"teacher_disagreement_score":0.005406336,"about_ca_system_score_codex":0.0006388543,"about_ca_system_score_gemma":0.0009010591,"threshold_uncertainty_score":0.010749757},"labels":[],"label_agreement":null},{"id":"W4309763245","doi":"10.1016/j.jpdc.2022.11.009","title":"On the impact of mode transition on phased transactional memory performance","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Athabasca University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Transactional memory; Computer science; Implementation; Software transactional memory; Commit; Software; Mode (computer interface); Throughput; Parallel computing; Operating system; Database transaction; Programming language","score_opus":0.01522277391314685,"score_gpt":0.2626178534057679,"score_spread":0.24739507949262102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309763245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883151,0.000668319,0.0047995686,0.00043269937,0.00010095314,0.000012609502,0.00017840178,0.00034985313,0.0051424983],"genre_scores_gemma":[0.99931943,0.000039986287,0.00036455854,0.000020923908,0.000011766882,0.0000031230766,0.000029829793,0.000019124669,0.00019119919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924976,0.00023419199,0.000027455786,0.00009696963,0.00020407741,0.00018754735],"domain_scores_gemma":[0.9791014,0.017754529,0.0005472006,0.0010687253,0.0011343738,0.00039377937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520528,0.00026559088,0.00031172892,0.00041591108,0.00040197317,0.0010208071,0.0007816561,0.00057710276,0.004716636],"category_scores_gemma":[0.01652761,0.00018246453,0.00015398394,0.0004964967,0.00066416775,0.0019896235,0.0004823775,0.00087364943,0.000479493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021860309,0.0024469325,0.0634272,0.0006179818,0.00022723418,0.0009107321,0.000947764,0.4471935,0.1775769,0.036296893,0.010178929,0.23831554],"study_design_scores_gemma":[0.00024429837,0.0023515366,0.024826627,0.00006474436,0.00019209796,0.00031057917,0.0007473578,0.8749611,0.076068275,0.018455487,0.0016747437,0.00010320872],"about_ca_topic_score_codex":0.00091624295,"about_ca_topic_score_gemma":0.0010492146,"teacher_disagreement_score":0.004716636,"about_ca_system_score_codex":0.00049586076,"about_ca_system_score_gemma":0.00050079083,"threshold_uncertainty_score":0.01577872},"labels":[],"label_agreement":null},{"id":"W4312038601","doi":"10.1145/3528535.3565252","title":"Reversible conflict-free replicated data types","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Replication (statistics); Eventual consistency; Distributed computing; Consistency (knowledge bases); Data consistency; Data type; Distributed database; Consistency model; Programming language","score_opus":0.05411335539217126,"score_gpt":0.27299182708610187,"score_spread":0.2188784716939306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312038601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028739415,0.0006418133,0.95854676,0.000323251,0.00032898595,0.00044074724,0.00048033556,0.0041800947,0.0063186176],"genre_scores_gemma":[0.46674597,0.0006928899,0.5191504,0.0005583787,0.00017055658,0.00086430705,0.00096140726,0.0008665436,0.009989612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418736,0.0012849056,0.0008751605,0.0006412799,0.0024872392,0.0005241839],"domain_scores_gemma":[0.9789256,0.003984664,0.0014332988,0.0118110115,0.0034556785,0.0003899041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068660313,0.00052948453,0.00088371633,0.0010071117,0.0010884621,0.0044203126,0.0052116024,0.0012008585,0.003925299],"category_scores_gemma":[0.015457042,0.00082946866,0.0012907726,0.0013597329,0.002743066,0.0083677545,0.004411271,0.0021920998,0.0011124638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001048276,0.00018397342,0.0031510273,0.0006844862,0.00015853361,0.0006464563,0.0012559616,0.057992257,0.031775303,0.75006783,0.00902617,0.14400963],"study_design_scores_gemma":[0.0006297304,0.0007645757,0.00061822415,0.00025042373,0.00030792016,0.0015402763,0.00046021823,0.3560912,0.14115183,0.32262945,0.17520097,0.0003551478],"about_ca_topic_score_codex":0.0014036461,"about_ca_topic_score_gemma":0.0015560685,"teacher_disagreement_score":0.0068660313,"about_ca_system_score_codex":0.0012749637,"about_ca_system_score_gemma":0.0027636453,"threshold_uncertainty_score":0.036311507},"labels":[],"label_agreement":null},{"id":"W4312471121","doi":"10.1109/bcca55292.2022.9922238","title":"Performance Modeling and Analysis of Hotstuff for Blockchain Consensus","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Blockchain; Byzantine fault tolerance; Distributed computing; Cryptocurrency; Bounded function; Network packet; Robustness (evolution); Protocol (science); Consensus; Consensus algorithm; Latency (audio); Computer network; Database transaction; Throughput; Fault tolerance; Computer security; Algorithm; Wireless; Multi-agent system; Artificial intelligence; Mathematics","score_opus":0.020530928844869602,"score_gpt":0.2410899200856032,"score_spread":0.2205589912407336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312471121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70139706,0.00087419094,0.28312188,0.00078616245,0.0000377615,0.0001409412,0.00027285478,0.000831066,0.01253804],"genre_scores_gemma":[0.9965869,0.000095726624,0.002583833,0.000013713951,0.0000046036766,0.000037201564,0.0000504929,0.000016845428,0.00061063154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915814,0.00021791588,0.00002993009,0.0001280883,0.00029474852,0.0001711528],"domain_scores_gemma":[0.9963574,0.0021125383,0.0005535104,0.0002726432,0.00053638703,0.00016751229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014513107,0.0005004961,0.00065105414,0.00078770047,0.0006104675,0.000970196,0.0011601135,0.001244755,0.0016646223],"category_scores_gemma":[0.005782826,0.00027558478,0.00048654818,0.0005599423,0.00089964055,0.0012312633,0.000727936,0.00063714414,0.00023223578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050564442,0.000019187359,0.0011677488,0.00003275907,0.000009196901,0.00006960108,0.000065741995,0.98818153,0.0020177343,0.005857043,0.00015861033,0.0023702355],"study_design_scores_gemma":[0.0000017110625,0.000015853708,0.00013021671,0.0000018798941,0.00000174891,0.000007981169,0.000005873686,0.9986626,0.00024838117,0.0008810505,0.0000402877,0.0000024286562],"about_ca_topic_score_codex":0.0061144186,"about_ca_topic_score_gemma":0.0026297735,"teacher_disagreement_score":0.0061144186,"about_ca_system_score_codex":0.0016460983,"about_ca_system_score_gemma":0.0011826691,"threshold_uncertainty_score":0.012157679},"labels":[],"label_agreement":null},{"id":"W4312710991","doi":"10.1109/icdcs54860.2022.00066","title":"ESCAPE to Precaution against Leader Failures","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Candidacy; Computer science; Leader election; Voting; Competition (biology); Protocol (science); Computer security; Computer network; Distributed computing; Political science","score_opus":0.034705942517482075,"score_gpt":0.2763322061272542,"score_spread":0.2416262636097721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312710991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45058817,0.0024411061,0.52330893,0.0010265973,0.00025586842,0.00042315014,0.00008316958,0.0096928645,0.012180142],"genre_scores_gemma":[0.9472098,0.00020148791,0.04951238,0.00018491388,0.00004214287,0.00009426057,0.00007613649,0.00018075509,0.0024981343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688905,0.0010277482,0.00015663862,0.0004525025,0.0009873275,0.00048674244],"domain_scores_gemma":[0.9914386,0.0028663212,0.0012396132,0.0030691402,0.00095506513,0.00043127604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032985308,0.0009288506,0.0009806929,0.00086720305,0.0009197583,0.0009214867,0.0017691988,0.0008533542,0.001711151],"category_scores_gemma":[0.010136553,0.0003255873,0.0005126399,0.00039336795,0.0014188929,0.0023938639,0.0038137292,0.0013862256,0.0005535096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027894469,0.0007405589,0.012289195,0.0011718216,0.0003613096,0.0013661785,0.002348235,0.20018731,0.084751464,0.048040424,0.008821058,0.63713306],"study_design_scores_gemma":[0.00043151173,0.004954944,0.00451315,0.00021705905,0.00029637603,0.0024989266,0.0012627161,0.8124578,0.089973286,0.050504893,0.032757472,0.00013188999],"about_ca_topic_score_codex":0.00053282315,"about_ca_topic_score_gemma":0.0006288218,"teacher_disagreement_score":0.0032985308,"about_ca_system_score_codex":0.00038781518,"about_ca_system_score_gemma":0.0011825614,"threshold_uncertainty_score":0.017444551},"labels":[],"label_agreement":null},{"id":"W4312987091","doi":"10.14778/3565816.3565818","title":"Online schema evolution is (almost) free for snapshot databases","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Schema evolution; Schema migration; Database schema; Schema (genetic algorithms); Snapshot (computer storage); Database; Information retrieval; Semi-structured model; Database design","score_opus":0.02804371284440938,"score_gpt":0.25714350070823433,"score_spread":0.22909978786382496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312987091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052099213,0.0011739982,0.9027015,0.0016941582,0.0004048297,0.00027525966,0.00019817174,0.027310781,0.014142047],"genre_scores_gemma":[0.68614566,0.00076439325,0.2990362,0.0016107216,0.00033484644,0.0002783783,0.0006182994,0.00285807,0.008353362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99315274,0.0016634944,0.0006840112,0.0012082447,0.002709825,0.0005817625],"domain_scores_gemma":[0.95689046,0.0044767912,0.0015423042,0.034243844,0.001583253,0.0012632849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004900127,0.0008152549,0.0009752129,0.00072654913,0.0015596056,0.0042120204,0.00343618,0.0015105896,0.0035671943],"category_scores_gemma":[0.017986024,0.0010991765,0.00066745694,0.00090165075,0.0023116462,0.009747918,0.007871645,0.0046505253,0.0018608273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019835788,0.0008616253,0.010552475,0.00071487436,0.00032068035,0.0010746749,0.0017938386,0.022791566,0.15400454,0.20640907,0.028767098,0.570726],"study_design_scores_gemma":[0.00048805046,0.0014530884,0.0062098294,0.00032322895,0.0003847282,0.0041300473,0.0010208783,0.337835,0.19340695,0.19328257,0.26108092,0.0003847414],"about_ca_topic_score_codex":0.00067919143,"about_ca_topic_score_gemma":0.0009852768,"teacher_disagreement_score":0.004900127,"about_ca_system_score_codex":0.00071341486,"about_ca_system_score_gemma":0.0018507545,"threshold_uncertainty_score":0.025914669},"labels":[],"label_agreement":null},{"id":"W4313408232","doi":"10.1145/3576192","title":"Partial Network Partitioning","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Research Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Partition (number theory); Distributed computing; Network packet; Fault tolerance; Network partition; Computer network; Overlay network; Operating system; The Internet","score_opus":0.019288820322839018,"score_gpt":0.22818163900081745,"score_spread":0.20889281867797843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313408232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37236375,0.008171006,0.55466276,0.0012341321,0.00034845038,0.00057340396,0.0008859466,0.0018181001,0.059942376],"genre_scores_gemma":[0.90241337,0.0031263009,0.08501928,0.00029308203,0.00008601965,0.00021375391,0.0009347123,0.00026638334,0.0076470077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984003,0.00042296798,0.00007030091,0.00027999538,0.00054477045,0.0002817104],"domain_scores_gemma":[0.9951905,0.0017903444,0.00041356357,0.0016424056,0.00080335554,0.00015976382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013337225,0.0004786763,0.000375909,0.0008642565,0.0012117213,0.0015690447,0.0012454066,0.00054113043,0.0027937866],"category_scores_gemma":[0.004830242,0.0002997686,0.0004933383,0.0014159199,0.00083945954,0.003636358,0.0014273572,0.0007488596,0.0003878958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053468783,0.00025220597,0.019503262,0.0014216828,0.00021865877,0.0011404499,0.0026396937,0.26968607,0.027121386,0.16989301,0.018447101,0.48914188],"study_design_scores_gemma":[0.000074647316,0.0008077286,0.013567691,0.0005231427,0.00029399822,0.0038797138,0.0027319193,0.4757846,0.052480668,0.0961562,0.35357967,0.00011995399],"about_ca_topic_score_codex":0.003009157,"about_ca_topic_score_gemma":0.0034639717,"teacher_disagreement_score":0.003009157,"about_ca_system_score_codex":0.0013283278,"about_ca_system_score_gemma":0.0011420153,"threshold_uncertainty_score":0.009637773},"labels":[],"label_agreement":null},{"id":"W4317933801","doi":"10.1016/j.tcs.2023.113733","title":"Wait-free approximate agreement on graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; H2020 European Research Council; H2020 Marie Skłodowska-Curie Actions; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Combinatorics; Mathematics; Longest path problem; Pathwidth; Maximal independent set; Discrete mathematics; Lemma (botany); Impossibility; Computer science; Graph; 1-planar graph; Line graph","score_opus":0.01361083066908813,"score_gpt":0.2486185129397474,"score_spread":0.23500768227065927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317933801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09163111,0.00008080825,0.90292513,0.00037499852,0.000030355997,0.00012524877,0.00018942163,0.0008206397,0.0038223132],"genre_scores_gemma":[0.7801536,0.00017282662,0.21242948,0.0001466699,0.000042322827,0.00024084149,0.0004752755,0.00021300573,0.006126088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976833,0.00059833814,0.00018828659,0.00060825906,0.00057012733,0.00035166406],"domain_scores_gemma":[0.98972064,0.0065065124,0.00071801955,0.0020474466,0.0006664505,0.0003408292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015519653,0.0005926755,0.0010188605,0.00053651334,0.001096483,0.0019064386,0.0018372516,0.0010886192,0.0032294577],"category_scores_gemma":[0.01030171,0.00045234693,0.001061934,0.0009732915,0.0019145792,0.0050897878,0.0028832038,0.0019671184,0.0005434277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005485495,0.00010463361,0.0016466887,0.00032184547,0.0000721553,0.0004785693,0.001706018,0.36870557,0.01642724,0.54390794,0.002352213,0.0637286],"study_design_scores_gemma":[0.000059207854,0.00007614614,0.00021251834,0.000020128557,0.000021944501,0.0001310508,0.00026918305,0.48543847,0.009694763,0.50007355,0.003977399,0.00002562958],"about_ca_topic_score_codex":0.0023490386,"about_ca_topic_score_gemma":0.0017476336,"teacher_disagreement_score":0.0032294577,"about_ca_system_score_codex":0.0012659006,"about_ca_system_score_gemma":0.0012189338,"threshold_uncertainty_score":0.01080364},"labels":[],"label_agreement":null},{"id":"W4318147681","doi":"10.1109/bigdata55660.2022.10020382","title":"A Framework for the Design, Development, Testing and Deployment of Reliable Big Data Platforms","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Software deployment; Computer science; Scalability; Big data; Distributed computing; Reliability (semiconductor); Fault tolerance; Process (computing); Pipeline (software); Data science; Systems engineering; Software engineering; Database; Engineering; Data mining","score_opus":0.5304000793599303,"score_gpt":0.36865175447630044,"score_spread":0.16174832488362983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318147681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016123644,0.00025045883,0.9930333,0.00087429635,0.00006939592,0.00041247153,0.000059915063,0.00072437833,0.0029633997],"genre_scores_gemma":[0.05570433,0.00060885894,0.9397196,0.00025494088,0.00007829457,0.0010061642,0.00019722749,0.00024304436,0.0021875214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932532,0.0022594563,0.0006739167,0.00074746966,0.0025087327,0.000557156],"domain_scores_gemma":[0.99286026,0.0021383825,0.0007730268,0.0017285766,0.0016484444,0.00085128646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011489146,0.0016311746,0.0010150955,0.0017807591,0.0019706283,0.0067358688,0.005956908,0.0035606122,0.0025290584],"category_scores_gemma":[0.012633559,0.001466992,0.0019468664,0.0010093584,0.005299695,0.0055988543,0.005599977,0.0044317367,0.0012243085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042586173,0.00014403158,0.0009847308,0.0005475085,0.000069675436,0.0005291897,0.0009571418,0.16115154,0.0056670234,0.7894374,0.004581101,0.035888165],"study_design_scores_gemma":[0.00009846102,0.00035997585,0.00043036492,0.0008004114,0.000095666604,0.00045014126,0.0006494134,0.5183591,0.0076939003,0.35036898,0.12056621,0.00012739433],"about_ca_topic_score_codex":0.005929203,"about_ca_topic_score_gemma":0.0057316483,"teacher_disagreement_score":0.011489146,"about_ca_system_score_codex":0.002779607,"about_ca_system_score_gemma":0.008199648,"threshold_uncertainty_score":0.060761154},"labels":[],"label_agreement":null},{"id":"W4318541571","doi":"10.1145/3575693.3575695","title":"Compiling Distributed System Models with PGo","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Amazon Web Services","keywords":"Computer science; Key (lock); Bridge (graph theory); Domain (mathematical analysis); Distributed computing; Software engineering; Formal verification; Systems design; Systems engineering; Theoretical computer science; Computer security; Engineering","score_opus":0.02091634199224421,"score_gpt":0.2177230296435546,"score_spread":0.1968066876513104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318541571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033826043,0.00008985123,0.97704655,0.00021877611,0.00011856495,0.00013161168,0.00035676197,0.011812142,0.006843101],"genre_scores_gemma":[0.14477392,0.000533171,0.8364398,0.0003067596,0.0001084927,0.00060452963,0.0022027174,0.0067813993,0.008249205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989039,0.00030491222,0.00011379066,0.00022512618,0.00034642933,0.00010580542],"domain_scores_gemma":[0.9977005,0.0008141537,0.00015058146,0.0011054014,0.00018184356,0.00004753817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386081,0.0009723336,0.0006899645,0.0006829847,0.0006320423,0.002261935,0.0011932367,0.000808807,0.0075483588],"category_scores_gemma":[0.007234099,0.0011690441,0.0013485408,0.0006701503,0.0011089187,0.0031193781,0.0031732859,0.0019815501,0.0037111542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002123809,0.00015031511,0.0034827008,0.0009892706,0.00013873747,0.0009662459,0.0012675088,0.3798872,0.0063855145,0.29946324,0.025612047,0.2814448],"study_design_scores_gemma":[0.00007843099,0.00006108933,0.00027558306,0.00022065829,0.00007177361,0.0003094412,0.0001539948,0.56910646,0.010298003,0.2899251,0.12945846,0.000041097464],"about_ca_topic_score_codex":0.001771985,"about_ca_topic_score_gemma":0.0025431968,"teacher_disagreement_score":0.0075483588,"about_ca_system_score_codex":0.0006893316,"about_ca_system_score_gemma":0.001438886,"threshold_uncertainty_score":0.025251806},"labels":[],"label_agreement":null},{"id":"W4319165565","doi":"10.4230/lipics.disc.2023.17","title":"Constant RMR Recoverable Mutex under System-wide Crashes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Semaphore; Crash; Computer science; Lock (firearm); Constant (computer programming); Process (computing); Algorithm; Theoretical computer science; Operating system; Engineering","score_opus":0.08695536826197578,"score_gpt":0.18751738420276487,"score_spread":0.10056201594078909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319165565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33618325,0.0006134933,0.65060025,0.0012433748,0.0000745687,0.00015041743,0.00015314108,0.0040792725,0.0069022113],"genre_scores_gemma":[0.92277664,0.00015365542,0.073375806,0.00018053463,0.00005448126,0.00013219083,0.0001433487,0.00023993688,0.0029434306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974801,0.000489361,0.00014462869,0.00058220257,0.00062481506,0.000678951],"domain_scores_gemma":[0.9842561,0.009809462,0.0015115056,0.0029984892,0.0009813667,0.0004431541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003410386,0.00088842894,0.0014866769,0.00074374897,0.0010302328,0.0017827216,0.0027262748,0.001735203,0.0024064435],"category_scores_gemma":[0.022599364,0.0004407197,0.00062019116,0.00063989544,0.0022302023,0.004999945,0.0038231285,0.0024594995,0.0005692922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019666667,0.00031412323,0.0059968363,0.00042962996,0.00009532126,0.0007865856,0.000740615,0.6536501,0.05041329,0.15639694,0.004111141,0.1250987],"study_design_scores_gemma":[0.000069726026,0.00016784793,0.0005270063,0.000018830546,0.000035435554,0.00023330262,0.0001313389,0.89123154,0.019905543,0.08665157,0.0010043512,0.00002358584],"about_ca_topic_score_codex":0.00082427275,"about_ca_topic_score_gemma":0.0010039451,"teacher_disagreement_score":0.003410386,"about_ca_system_score_codex":0.0014434933,"about_ca_system_score_gemma":0.0016792789,"threshold_uncertainty_score":0.018036067},"labels":[],"label_agreement":null},{"id":"W4320525906","doi":"10.5753/wtf.2015.22934","title":"Suportando Execuções Paralelas no Bft-SmaRt","year":2015,"lang":"pt","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quebec Rehabilitation Research Network","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computer science; Humanities; Philosophy","score_opus":0.045684803545165534,"score_gpt":0.2688072332573231,"score_spread":0.22312242971215757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320525906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24732237,0.0012348562,0.6997816,0.0005154969,0.000673187,0.0012678349,0.0009520491,0.034946032,0.013306532],"genre_scores_gemma":[0.64867663,0.0004777531,0.3270523,0.0003580527,0.000077105295,0.0006544719,0.0012847085,0.0020577705,0.019361125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969901,0.00047867108,0.00035961546,0.0006201164,0.0012424359,0.00030900052],"domain_scores_gemma":[0.99240416,0.0015983813,0.00045851327,0.0036230506,0.0014563521,0.0004594638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030072052,0.001046439,0.00096773665,0.00087768404,0.0012777998,0.0023387903,0.002308279,0.0014891664,0.007847616],"category_scores_gemma":[0.008453873,0.0010022384,0.0007699508,0.0009411236,0.0012838844,0.0036953485,0.0019670161,0.0018834682,0.0028555985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073875454,0.00086590555,0.022781992,0.0018492242,0.0003867566,0.001402367,0.0039492953,0.0899082,0.31785733,0.038978603,0.022087455,0.49254537],"study_design_scores_gemma":[0.00084085035,0.0018978703,0.009482608,0.00023853486,0.00040845163,0.0014094202,0.0009386421,0.5914139,0.25625676,0.023568027,0.11322315,0.00032182116],"about_ca_topic_score_codex":0.005720296,"about_ca_topic_score_gemma":0.006314026,"teacher_disagreement_score":0.007847616,"about_ca_system_score_codex":0.0012758675,"about_ca_system_score_gemma":0.0025611997,"threshold_uncertainty_score":0.026252866},"labels":[],"label_agreement":null},{"id":"W4321372296","doi":"10.1145/3584696","title":"MCSH, a Lock with the Standard Interface","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Lock (firearm); Mutual exclusion; Thread (computing); Critical section; Interface (matter); Pointer (user interface); Skew; Distributed computing; Embedded system; Parallel computing; Algorithm; Operating system; Computer hardware","score_opus":0.01950741890194746,"score_gpt":0.26958978643931664,"score_spread":0.2500823675373692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321372296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004425821,0.0013997834,0.95729125,0.00082573044,0.0011954065,0.00040165725,0.00055487273,0.01975848,0.01414713],"genre_scores_gemma":[0.17363942,0.0015508623,0.77130216,0.0020331938,0.0013084783,0.0008050192,0.0014923625,0.0057944832,0.04207405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963599,0.00050105294,0.00030047886,0.0004259598,0.0020157313,0.00039687558],"domain_scores_gemma":[0.9956189,0.0012691474,0.0003536873,0.001574973,0.0008955263,0.00028773927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026945919,0.0007683427,0.000766268,0.0014708857,0.0013796168,0.0025190734,0.002775881,0.0012831973,0.016665976],"category_scores_gemma":[0.012026248,0.0009067899,0.00087875896,0.0014325578,0.0027568345,0.006102153,0.0043017482,0.0030449415,0.003234364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007621953,0.00014946454,0.001384014,0.0005287585,0.000085534215,0.00014391998,0.00061733765,0.004198128,0.010219787,0.48103192,0.107149474,0.3937295],"study_design_scores_gemma":[0.00042393018,0.00033188416,0.0006709003,0.00014991038,0.00014000236,0.00046256615,0.00013391774,0.045907017,0.023299422,0.1199073,0.8084423,0.000130903],"about_ca_topic_score_codex":0.00423838,"about_ca_topic_score_gemma":0.00544446,"teacher_disagreement_score":0.016665976,"about_ca_system_score_codex":0.0012694442,"about_ca_system_score_gemma":0.0031945596,"threshold_uncertainty_score":0.05575323},"labels":[],"label_agreement":null},{"id":"W4360605193","doi":"10.1109/icnc57223.2023.10074528","title":"Prioritizing transaction delivery in Ethereum network","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Database transaction; Computer science; Computer network; Exponential distribution; Queueing theory; Protocol (science); Transaction processing; Scheme (mathematics); Database; Statistics; Mathematics","score_opus":0.017713039323997468,"score_gpt":0.24055147953277017,"score_spread":0.2228384402087727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360605193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105852455,0.00060911657,0.88937575,0.00034126724,0.00005138644,0.00007795628,0.00007028833,0.000386175,0.0032355366],"genre_scores_gemma":[0.9443692,0.0004572632,0.05197978,0.00010320527,0.00003514468,0.00007714554,0.00006496034,0.000052848147,0.0028604856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850595,0.00046502877,0.000066237815,0.00024514296,0.0005243499,0.00019334159],"domain_scores_gemma":[0.9977556,0.0012662917,0.0002887594,0.00020398767,0.00039017422,0.000095202486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025302675,0.00039939408,0.0006128577,0.0007780074,0.0005539781,0.0010454844,0.0015504254,0.0006144207,0.0013298203],"category_scores_gemma":[0.0067188637,0.0002848928,0.00026229184,0.00070225546,0.00067285215,0.0029007446,0.00081947393,0.0007421828,0.00030255978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050004665,0.00011907033,0.003244254,0.00015820235,0.00004345593,0.0005182669,0.00047061444,0.6502019,0.020553162,0.24536313,0.002416393,0.07641145],"study_design_scores_gemma":[0.000012413057,0.00004013397,0.00019180695,0.0000064895685,0.000007418957,0.000102425896,0.000040624996,0.97657883,0.0025113355,0.018647864,0.0018506994,0.000009893456],"about_ca_topic_score_codex":0.0019537208,"about_ca_topic_score_gemma":0.0012865174,"teacher_disagreement_score":0.0025302675,"about_ca_system_score_codex":0.0017286611,"about_ca_system_score_gemma":0.0010675706,"threshold_uncertainty_score":0.013381481},"labels":[],"label_agreement":null},{"id":"W4364362023","doi":"10.1007/s00778-023-00794-0","title":"ByShard: sharding in a Byzantine environment","year":2023,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Atomicity; Commit; Flexibility (engineering); Latency (audio); Isolation (microbiology); Byzantine fault tolerance; Protocol (science); Software deployment; Throughput; Database transaction; Computer network; Fault tolerance; Database; Operating system; Wireless","score_opus":0.016390848947298697,"score_gpt":0.22849349027064442,"score_spread":0.21210264132334572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364362023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0816086,0.0013537816,0.7442208,0.0009373897,0.0010246409,0.0002720196,0.0012816906,0.1522357,0.017065296],"genre_scores_gemma":[0.5976306,0.0012221427,0.34794542,0.0006624365,0.00031776848,0.0003116488,0.004291348,0.014285517,0.03333308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988574,0.00028876108,0.00009258645,0.00017833014,0.00039655683,0.00018636476],"domain_scores_gemma":[0.99758303,0.00048243246,0.00013027781,0.0013792459,0.00021457479,0.0002105488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020734742,0.0009285569,0.0010197097,0.0008857762,0.00146124,0.0025014835,0.0023964697,0.0011060201,0.009207987],"category_scores_gemma":[0.0034571195,0.000866059,0.00062491116,0.0013120583,0.0015456253,0.0053312723,0.0040754103,0.0017588105,0.0020731033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065766275,0.0006631613,0.005906114,0.0012661683,0.00033925922,0.0012538708,0.0024262106,0.047010966,0.046921987,0.15478599,0.15669467,0.576155],"study_design_scores_gemma":[0.0014151471,0.0012395325,0.0020309351,0.00029847302,0.0002909037,0.0010604953,0.0007023344,0.44882905,0.10853247,0.15526429,0.28005645,0.00027994032],"about_ca_topic_score_codex":0.0015902793,"about_ca_topic_score_gemma":0.0017284087,"teacher_disagreement_score":0.009207987,"about_ca_system_score_codex":0.0005625294,"about_ca_system_score_gemma":0.0012287871,"threshold_uncertainty_score":0.0308038},"labels":[],"label_agreement":null},{"id":"W4366158500","doi":"10.1007/978-3-031-20002-1","title":"Recoverable Mutual Exclusion","year":2023,"lang":"en","type":"book","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Mutual exclusion; Computer science; Programming language","score_opus":0.013591751389051077,"score_gpt":0.23507455608325883,"score_spread":0.22148280469420775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158500","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042449,0.009819052,0.22721168,0.0021494264,0.0028817237,0.00011228006,0.00046656103,0.003238727,0.74987566],"genre_scores_gemma":[0.079977445,0.0064767017,0.039636,0.0007189252,0.0011278818,0.00017144617,0.0010452651,0.0010050251,0.8698412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996532,0.000037426154,0.000008783001,0.00005491193,0.00020880227,0.000036804788],"domain_scores_gemma":[0.9997397,0.00008120332,0.000013922517,0.00008582475,0.00006199123,0.000017311724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025399166,0.0007880669,0.0005370813,0.0005591809,0.0008158548,0.0012521978,0.00082815014,0.0005700611,0.03558053],"category_scores_gemma":[0.0008568917,0.0003865263,0.00034261387,0.00080574537,0.0008530424,0.001910515,0.0013546397,0.0019243043,0.012898822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010882935,0.00005686168,0.00005589919,0.0001954791,0.000014182812,0.00008546979,0.00018773152,0.0069141714,0.0051305396,0.4353588,0.19926806,0.35262403],"study_design_scores_gemma":[0.000018537417,0.000037976217,0.00014461657,0.00009493253,0.000012576631,0.00015088108,0.000039417682,0.012230965,0.0051395767,0.3113416,0.67076945,0.000019496518],"about_ca_topic_score_codex":0.0007773212,"about_ca_topic_score_gemma":0.0012941924,"teacher_disagreement_score":0.03558053,"about_ca_system_score_codex":0.00081528403,"about_ca_system_score_gemma":0.00063488685,"threshold_uncertainty_score":0.11902881},"labels":[],"label_agreement":null},{"id":"W4366158737","doi":"10.1007/978-3-031-20002-1_12","title":"Discussion and Open Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queue; Theoretical computer science; Distributed computing; Computer network","score_opus":0.024125019732167373,"score_gpt":0.2499984181994353,"score_spread":0.22587339846726792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158737","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020371052,0.030106243,0.0088540735,0.32643968,0.031884726,0.000058521066,0.00046983865,0.00022763116,0.59992224],"genre_scores_gemma":[0.056929957,0.025776329,0.009544449,0.102391884,0.045623053,0.0004155372,0.0012435179,0.0005328479,0.75754243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99538344,0.0015675498,0.00013346109,0.000731243,0.0015403989,0.0006438471],"domain_scores_gemma":[0.99370885,0.0023394686,0.00021642026,0.00084213645,0.0021426936,0.0007503765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006712931,0.00084801327,0.0010179974,0.002399471,0.0056096055,0.0097840605,0.0035727576,0.0069754785,0.15357593],"category_scores_gemma":[0.01715408,0.0003270189,0.0012272601,0.0028627384,0.0047916574,0.015343924,0.005206942,0.0074943407,0.04277133],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049142476,0.00009137002,0.00011187374,0.00015710693,0.000008619753,0.00006595963,0.0005877856,0.00019809198,0.00017330963,0.58231175,0.3682591,0.047985937],"study_design_scores_gemma":[0.000011819163,0.0000076236856,0.00011012371,0.00019033186,0.000004688139,0.00005425674,0.000754429,0.00016229706,0.00012187816,0.36900952,0.6295652,0.00000789984],"about_ca_topic_score_codex":0.002465336,"about_ca_topic_score_gemma":0.0017587444,"teacher_disagreement_score":0.15357593,"about_ca_system_score_codex":0.0046253167,"about_ca_system_score_gemma":0.003617742,"threshold_uncertainty_score":0.51376265},"labels":[],"label_agreement":null},{"id":"W4366158757","doi":"10.1007/978-3-031-20002-1_11","title":"System Wide Failures","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reliability engineering; Distributed computing; Engineering","score_opus":0.013186385155070292,"score_gpt":0.21730077841067602,"score_spread":0.20411439325560574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158757","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045858654,0.0064613763,0.12414816,0.0035523206,0.0036291056,0.00018040756,0.0007580137,0.004595545,0.8520892],"genre_scores_gemma":[0.06772789,0.0058317687,0.011283168,0.001194771,0.0009879915,0.00014649624,0.00090126815,0.000749568,0.9111771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.000051337134,0.0000137736815,0.00009121389,0.000207917,0.00006657319],"domain_scores_gemma":[0.99940264,0.00011204428,0.000033902805,0.0002235495,0.00016279118,0.00006504253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048171743,0.0011624465,0.00055970665,0.0007450975,0.0009762829,0.0026125582,0.0009783789,0.0010278274,0.08619826],"category_scores_gemma":[0.0014655497,0.0004714812,0.0003806547,0.0008618302,0.0009185274,0.0030120711,0.0024621743,0.0022777086,0.035998203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008579148,0.00005784395,0.00021450764,0.00037950333,0.000019550776,0.00022691401,0.00038997128,0.0038991033,0.007239019,0.30054328,0.32215637,0.3647881],"study_design_scores_gemma":[0.000011044593,0.000054599328,0.00022855798,0.0000763194,0.000012492839,0.00028598998,0.00008944248,0.0025875475,0.0023493643,0.06945995,0.924832,0.000012755091],"about_ca_topic_score_codex":0.000584719,"about_ca_topic_score_gemma":0.00074257574,"teacher_disagreement_score":0.08619826,"about_ca_system_score_codex":0.00067043613,"about_ca_system_score_gemma":0.00086292304,"threshold_uncertainty_score":0.28836197},"labels":[],"label_agreement":null},{"id":"W4366158775","doi":"10.1007/978-3-031-20002-1_9","title":"Abortable Recoverable Mutual Exclusion","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutual exclusion; Critical section; Lock (firearm); Computer science; Abort; Logarithm; Process (computing); Task (project management); Distributed computing; Parallel computing; Operating system; Mathematics; Engineering","score_opus":0.016061836719582327,"score_gpt":0.230215265144554,"score_spread":0.21415342842497168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015906226,0.0035319366,0.69765097,0.0017935149,0.0016944461,0.00016412669,0.00031197202,0.0049201585,0.27402675],"genre_scores_gemma":[0.46778986,0.003290283,0.14843345,0.0009754469,0.0009816387,0.0003651079,0.0010935728,0.0016324719,0.3754382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908316,0.00013901245,0.000025383062,0.00009744911,0.00052755635,0.00012740742],"domain_scores_gemma":[0.99886453,0.0004734792,0.00005946317,0.00039744793,0.00016115695,0.00004406009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555523,0.0006006277,0.0005356164,0.0003717244,0.000869121,0.0013747992,0.0017531952,0.0006714115,0.013572412],"category_scores_gemma":[0.0020770954,0.00035857933,0.0002967301,0.0005278546,0.0011868343,0.0022836828,0.0018367437,0.0029804332,0.0035152915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033820732,0.00009550699,0.00012069923,0.000255047,0.00001764272,0.00021782468,0.00050438393,0.015977047,0.010660751,0.63194346,0.04715611,0.29271325],"study_design_scores_gemma":[0.00008275771,0.00014267975,0.0002752252,0.0001470903,0.000030407806,0.00032290674,0.00011155623,0.073364526,0.020744145,0.6097216,0.2950098,0.000047230566],"about_ca_topic_score_codex":0.0005831045,"about_ca_topic_score_gemma":0.0010340499,"teacher_disagreement_score":0.013572412,"about_ca_system_score_codex":0.0007684397,"about_ca_system_score_gemma":0.0007340816,"threshold_uncertainty_score":0.045404255},"labels":[],"label_agreement":null},{"id":"W4366158777","doi":"10.1007/978-3-031-20002-1_3","title":"Prior Work","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutual exclusion; Scope (computer science); Computer science; Critical section; Variety (cybernetics); Dijkstra's algorithm; Theoretical computer science; Bounded function; Implementation; Work (physics); Operations research; Data science; Distributed computing; Software engineering; Mathematics; Artificial intelligence; Engineering; Programming language","score_opus":0.017197964460847235,"score_gpt":0.22916353295874636,"score_spread":0.21196556849789913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158777","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012815591,0.005038738,0.005236291,0.00511969,0.0049810754,0.00016422427,0.0071144826,0.0014361326,0.9696278],"genre_scores_gemma":[0.007212125,0.0045574275,0.0032625226,0.0018836663,0.0008933959,0.00011159007,0.009875534,0.0005168802,0.9716868],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988985,0.000121341145,0.000044476208,0.00029103897,0.00048266567,0.0001618767],"domain_scores_gemma":[0.9973928,0.0004915998,0.000082383,0.00072013895,0.0008652858,0.00044769316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008722433,0.00091447996,0.00075408764,0.0034310648,0.0017594745,0.004129779,0.0017092127,0.0014345024,0.6545165],"category_scores_gemma":[0.004333368,0.000347038,0.00072902377,0.003322406,0.0009828049,0.001679338,0.002173373,0.001429823,0.56553984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077964876,0.00012046393,0.00040526508,0.00036358403,0.000016031081,0.00009761068,0.000080052894,0.00029349132,0.00058374816,0.012493126,0.74846864,0.2370001],"study_design_scores_gemma":[0.0000071409513,0.000008971499,0.0001800589,0.00013985846,0.000008056922,0.00006344989,0.00005067164,0.000087648805,0.00030455625,0.0027476489,0.9963961,0.000005746338],"about_ca_topic_score_codex":0.004081426,"about_ca_topic_score_gemma":0.0092304265,"teacher_disagreement_score":0.6545165,"about_ca_system_score_codex":0.0014959465,"about_ca_system_score_gemma":0.0027150204,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4366158782","doi":"10.1007/978-3-031-20002-1_10","title":"Tight Lower Bound","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fetch; Computer science; Upper and lower bounds; Parallel computing; Algorithm; Mathematics; Geology","score_opus":0.015503645749227248,"score_gpt":0.230194060985531,"score_spread":0.21469041523630375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158782","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078048026,0.015968326,0.34585556,0.018065948,0.0050827516,0.00022824542,0.0033160222,0.0033546628,0.6003236],"genre_scores_gemma":[0.30678457,0.023166513,0.16394818,0.02027723,0.011419243,0.0017459972,0.010459308,0.007845835,0.45435312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99295795,0.0011752418,0.00021573743,0.0015286197,0.0026836526,0.0014387536],"domain_scores_gemma":[0.988345,0.0060474994,0.00030354972,0.003094479,0.0014971123,0.0007123783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033306947,0.004611754,0.0048959623,0.004379799,0.005200322,0.009474622,0.006378237,0.0041651977,0.09789473],"category_scores_gemma":[0.023038063,0.0019947952,0.0025010125,0.007596618,0.004422485,0.016806263,0.010150501,0.016596632,0.03636598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027664157,0.00017687409,0.00021628184,0.0005361063,0.00006060896,0.00007681591,0.0001491018,0.007929215,0.0010354741,0.69997346,0.20335008,0.08621929],"study_design_scores_gemma":[0.00002504043,0.000022733502,0.00010132656,0.000107129694,0.000042245676,0.000077263285,0.000041682724,0.0127695305,0.0005193949,0.93804216,0.048229694,0.000021779357],"about_ca_topic_score_codex":0.0035376593,"about_ca_topic_score_gemma":0.0037857795,"teacher_disagreement_score":0.09789473,"about_ca_system_score_codex":0.0062064924,"about_ca_system_score_gemma":0.003614979,"threshold_uncertainty_score":0.3274905},"labels":[],"label_agreement":null},{"id":"W4366159806","doi":"10.1007/978-3-031-20002-1_5","title":"Load and Store Based Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Algorithm; Theoretical computer science","score_opus":0.01668194475266698,"score_gpt":0.23022624277783674,"score_spread":0.21354429802516975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366159806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006349383,0.0034074849,0.8236786,0.0015741806,0.0012194006,0.00018196127,0.0005511583,0.008768614,0.15426926],"genre_scores_gemma":[0.107054226,0.0030279937,0.5085695,0.0008634568,0.0009291134,0.0002684532,0.0016152201,0.0033743985,0.37429762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924785,0.000074788244,0.000034107194,0.00016160826,0.00040062718,0.00008110341],"domain_scores_gemma":[0.999119,0.00020319664,0.000024817718,0.00044043688,0.00016666715,0.00004596426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055781787,0.0015069239,0.0010628195,0.00094744074,0.0012175164,0.003071653,0.0022911134,0.0011360343,0.06109575],"category_scores_gemma":[0.0019408052,0.000841537,0.00064596283,0.0020270273,0.0010918872,0.004499738,0.0017169276,0.0023493068,0.024213823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026731417,0.0001856908,0.000187767,0.00020109236,0.000044430373,0.000029210743,0.0001058553,0.020059975,0.006138047,0.26855302,0.08521177,0.6190158],"study_design_scores_gemma":[0.000104966435,0.00008994161,0.00026040213,0.0000729202,0.00006175515,0.00016952303,0.000062625266,0.18589655,0.015234545,0.5342268,0.26377904,0.00004093879],"about_ca_topic_score_codex":0.0012551144,"about_ca_topic_score_gemma":0.0022293134,"teacher_disagreement_score":0.06109575,"about_ca_system_score_codex":0.0011160738,"about_ca_system_score_gemma":0.0010722394,"threshold_uncertainty_score":0.20438564},"labels":[],"label_agreement":null},{"id":"W4366160575","doi":"10.1007/978-3-031-20002-1_4","title":"Problem Formulation","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Computer science; Scalability; Mutual exclusion; Theoretical computer science; Semantics (computer science); Programming language; Distributed computing; Formal description; Measure (data warehouse); Data mining; Database","score_opus":0.01693060431566782,"score_gpt":0.2322325904871304,"score_spread":0.2153019861714626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008355463,0.0017486912,0.7118503,0.016069284,0.0015996455,0.0010146152,0.0052444935,0.00051256537,0.25360504],"genre_scores_gemma":[0.3157932,0.0032199195,0.33624876,0.0054677124,0.002539923,0.003280538,0.008199474,0.00056565885,0.32468486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988476,0.0003819726,0.000035603964,0.0003901534,0.00019523424,0.00014935875],"domain_scores_gemma":[0.9986773,0.00087342534,0.00006706105,0.00009201017,0.00021689275,0.00007324799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226774,0.00095427927,0.001143978,0.00076861656,0.0007484273,0.0034657137,0.002442362,0.0037292622,0.09407325],"category_scores_gemma":[0.005699948,0.00044984513,0.0007568215,0.0008417106,0.0010560342,0.002661772,0.002296961,0.0025696566,0.009640984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018420124,0.00022441342,0.0007317805,0.0009408569,0.00004348445,0.00046959848,0.0001898638,0.15062323,0.0006144373,0.5673866,0.15952039,0.119071074],"study_design_scores_gemma":[0.00011996559,0.00012136408,0.00023296426,0.00024703506,0.00003220423,0.00023866734,0.00040347216,0.37340802,0.0007054267,0.4865347,0.13792719,0.000028923896],"about_ca_topic_score_codex":0.0026916426,"about_ca_topic_score_gemma":0.001996747,"teacher_disagreement_score":0.09407325,"about_ca_system_score_codex":0.0010530108,"about_ca_system_score_gemma":0.0018854324,"threshold_uncertainty_score":0.3147064},"labels":[],"label_agreement":null},{"id":"W4366160711","doi":"10.1007/978-3-031-20002-1_6","title":"Sublogarithmic Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constant (computer programming); Time complexity; Block (permutation group theory); Lock (firearm); Algorithm; Tree (set theory); Parallel computing; Mathematics; Combinatorics; Engineering; Programming language","score_opus":0.018866715742933277,"score_gpt":0.23622359271247856,"score_spread":0.21735687696954528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160711","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048624314,0.016039291,0.30873945,0.004913688,0.0045371437,0.00006533536,0.0006054526,0.0027531597,0.6574841],"genre_scores_gemma":[0.16264899,0.0137994755,0.15550381,0.0033844793,0.0048016794,0.00030426486,0.0017484131,0.0029199163,0.65488887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.00014684431,0.000035209243,0.0001928019,0.00046347556,0.00008899604],"domain_scores_gemma":[0.99910444,0.00035528583,0.000027694898,0.00028226717,0.0001692249,0.000060932412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493165,0.0014180318,0.001126708,0.0016075164,0.001311751,0.0034859115,0.0014568439,0.00092203525,0.05423448],"category_scores_gemma":[0.003200735,0.0006234887,0.00066379,0.0032096365,0.0017239362,0.0056198924,0.0021378277,0.0053409203,0.024412405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007147263,0.000047063168,0.000086467044,0.00015931988,0.000013661384,0.000021152831,0.00009405864,0.0017002786,0.0010585488,0.754251,0.08166975,0.16082728],"study_design_scores_gemma":[0.000020522855,0.000016507507,0.00012676719,0.000053145443,0.00001332359,0.00007581109,0.00002155035,0.0051721656,0.0011017082,0.78995967,0.20342864,0.000010188133],"about_ca_topic_score_codex":0.0005728061,"about_ca_topic_score_gemma":0.0007163597,"teacher_disagreement_score":0.05423448,"about_ca_system_score_codex":0.0025800131,"about_ca_system_score_gemma":0.0010261363,"threshold_uncertainty_score":0.18143237},"labels":[],"label_agreement":null},{"id":"W4366160739","doi":"10.1007/978-3-031-20002-1_7","title":"Adaptive Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Crash; Algorithm; Distributed computing; Programming language","score_opus":0.023297562472138187,"score_gpt":0.23718426517283908,"score_spread":0.2138867027007009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026846542,0.0069405134,0.7360985,0.0012197307,0.0024551558,0.000075117445,0.00033075074,0.0023228861,0.24787271],"genre_scores_gemma":[0.12197344,0.009770482,0.20845698,0.0014635157,0.0025582737,0.00030602663,0.0016694159,0.001273253,0.6525285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967647,0.00003981359,0.000011966926,0.00009191917,0.00015871474,0.000021156357],"domain_scores_gemma":[0.99967575,0.00009157787,0.000013100966,0.00011812061,0.00008162009,0.000019786243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028942068,0.0010132713,0.0006772594,0.0006027047,0.00037901168,0.0014445124,0.00082133105,0.00097544666,0.044035528],"category_scores_gemma":[0.0014129006,0.00033196626,0.00037188074,0.0008888024,0.00058916106,0.0011624531,0.001101981,0.0015365097,0.027794674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006936853,0.00006144281,0.00023329591,0.00020026386,0.000042690026,0.000046748577,0.000046345158,0.026321964,0.006242802,0.20522892,0.10185928,0.65964687],"study_design_scores_gemma":[0.000046968005,0.00007953356,0.00058630697,0.000117728305,0.00004368707,0.00029663695,0.000037005662,0.17367245,0.007546913,0.30945572,0.5080788,0.000038252656],"about_ca_topic_score_codex":0.00041298824,"about_ca_topic_score_gemma":0.0004102378,"teacher_disagreement_score":0.044035528,"about_ca_system_score_codex":0.00037392127,"about_ca_system_score_gemma":0.00035676293,"threshold_uncertainty_score":0.14731348},"labels":[],"label_agreement":null},{"id":"W4366160740","doi":"10.1007/978-3-031-20002-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Critical section; Crash; State (computer science); Latency (audio); Class (philosophy); Synchronization (alternating current); Distributed computing; Operating system; Computer network; Telecommunications; Programming language; Artificial intelligence; Channel (broadcasting)","score_opus":0.012913357424054079,"score_gpt":0.22218331991053955,"score_spread":0.20926996248648547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160740","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003610381,0.0021716263,0.004863045,0.0029086687,0.0055781044,0.0001463536,0.0028010234,0.001182136,0.979988],"genre_scores_gemma":[0.0010030455,0.0010476457,0.0011111143,0.00085879216,0.00066473003,0.00007261146,0.001714417,0.00025674448,0.99327093],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937755,0.00005488035,0.00001859675,0.00012782498,0.0003487877,0.00007235148],"domain_scores_gemma":[0.9991322,0.00010528951,0.000027480846,0.000117478434,0.0004126413,0.00020489638],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005872379,0.0009449476,0.00060467166,0.0015902732,0.0013314208,0.003929464,0.0015211217,0.001648162,0.658623],"category_scores_gemma":[0.0021816916,0.00031456508,0.0004885219,0.0014295323,0.00048200405,0.0026661556,0.0023765562,0.0016327889,0.58213395],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023906596,0.000031920343,0.00008205594,0.00011993858,0.0000018263732,0.000034532823,0.00007235261,0.00010800429,0.0003840158,0.020579383,0.8324274,0.14613469],"study_design_scores_gemma":[0.0000019025002,0.0000055844316,0.000055454853,0.00003992942,7.5254343e-7,0.000019349694,0.000023162062,0.000021802987,0.00006690268,0.0025850043,0.9971781,0.000002011596],"about_ca_topic_score_codex":0.0021648812,"about_ca_topic_score_gemma":0.0034529855,"teacher_disagreement_score":0.658623,"about_ca_system_score_codex":0.0012557147,"about_ca_system_score_gemma":0.0018773315,"threshold_uncertainty_score":0.48693287},"labels":[],"label_agreement":null},{"id":"W4366998199","doi":"10.1093/comjnl/bxad048","title":"Chronos: An Efficient Asynchronous Byzantine Ordered Consensus","year":2023,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China","keywords":"Computer science; Asynchronous communication; Liveness; Correctness; Computer network; Protocol (science); Distributed computing; Theoretical computer science; Algorithm","score_opus":0.018030229045466306,"score_gpt":0.2547564318641966,"score_spread":0.2367262028187303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366998199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114049666,0.00026785664,0.8649699,0.00024330779,0.0001865872,0.0004035903,0.0004191689,0.013633657,0.0058262288],"genre_scores_gemma":[0.746738,0.00014293221,0.24749878,0.00010083544,0.00003591132,0.00028642482,0.000659361,0.0003513863,0.0041863318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992379,0.0002042169,0.000058014946,0.00015265906,0.0002559683,0.00009122107],"domain_scores_gemma":[0.9990594,0.00023160824,0.00011761918,0.00029000023,0.00020276233,0.000098697456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009082738,0.00045499418,0.0005706498,0.00053192116,0.00070878025,0.0007599356,0.0012581343,0.0004974749,0.002619716],"category_scores_gemma":[0.0018038548,0.00024014345,0.00031307666,0.0006508215,0.00066621514,0.0010534663,0.0011720608,0.0006189791,0.00039564344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033516274,0.00043789652,0.0036148157,0.0007373,0.00014983588,0.0008070569,0.0008571226,0.40010902,0.15131886,0.095912285,0.02686631,0.3158379],"study_design_scores_gemma":[0.00048663316,0.00046372748,0.0004437774,0.000022408018,0.000034134795,0.00015175137,0.00011223944,0.9259725,0.037530523,0.014170086,0.020572636,0.000039597886],"about_ca_topic_score_codex":0.003415117,"about_ca_topic_score_gemma":0.0027665037,"teacher_disagreement_score":0.003415117,"about_ca_system_score_codex":0.0005306018,"about_ca_system_score_gemma":0.001168177,"threshold_uncertainty_score":0.00876379},"labels":[],"label_agreement":null},{"id":"W4372260680","doi":"10.1145/3552326.3567494","title":"Integrating Non-Volatile Main Memory in a Deterministic Database","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Concurrency control; Two-phase locking; Database transaction; Latency (audio); Database; Atomicity; Distributed computing; Transaction processing; Parallel computing; Online transaction processing; Distributed transaction","score_opus":0.016822768940433823,"score_gpt":0.26747493099425756,"score_spread":0.25065216205382373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372260680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1540062,0.0047990703,0.8186042,0.0007349695,0.00055077183,0.00031608884,0.0005691154,0.009537622,0.010882001],"genre_scores_gemma":[0.7663075,0.0010874387,0.22492239,0.0003642491,0.00016128687,0.00018017988,0.00057613483,0.00022459021,0.0061762426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998582,0.00021040537,0.00017261649,0.00035000456,0.00049787114,0.00018715464],"domain_scores_gemma":[0.99685514,0.00052556547,0.00019438562,0.0016893301,0.0005665834,0.00016898183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015203216,0.00040022764,0.00063794287,0.0006456326,0.00078369974,0.0028026549,0.0036232308,0.0005965613,0.0027110402],"category_scores_gemma":[0.003317379,0.0005853399,0.00045348713,0.0012973975,0.00061719975,0.0030104823,0.0026210358,0.000810319,0.0010255411],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027891141,0.0008466753,0.02715774,0.0012336588,0.0004627648,0.0016561486,0.0011468929,0.09631853,0.110386804,0.10492245,0.021280685,0.63179845],"study_design_scores_gemma":[0.0004615314,0.0013876371,0.006038518,0.00018674746,0.0007930688,0.0022239375,0.0007383696,0.6081874,0.15758258,0.074068256,0.14809561,0.00023639532],"about_ca_topic_score_codex":0.00176767,"about_ca_topic_score_gemma":0.002396505,"teacher_disagreement_score":0.0036232308,"about_ca_system_score_codex":0.0006342466,"about_ca_system_score_gemma":0.001364603,"threshold_uncertainty_score":0.009069264},"labels":[],"label_agreement":null},{"id":"W4375869918","doi":"10.48550/arxiv.2305.03567","title":"Flash: An Asynchronous Payment System with Good-Case Linear Communication Complexity","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Payment; Computer science; Asynchronous communication; Matching (statistics); Computer network; Computer security; Mathematics","score_opus":0.1238650216538323,"score_gpt":0.21637280761531302,"score_spread":0.09250778596148072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375869918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1230152,0.0003369645,0.8453561,0.0013426518,0.0002504377,0.0003964827,0.0008651551,0.008358575,0.02007844],"genre_scores_gemma":[0.79238975,0.00028975215,0.18738073,0.00024916494,0.0001480997,0.0005049511,0.00073357235,0.0002848169,0.018019123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989599,0.00025311127,0.00010515417,0.00020219068,0.00029387532,0.00018571461],"domain_scores_gemma":[0.9978249,0.00079845806,0.00016838075,0.00063811586,0.0003232841,0.0002467912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278598,0.0005681658,0.00067860814,0.0005101431,0.0010544333,0.0018492461,0.0012240718,0.001091388,0.008688125],"category_scores_gemma":[0.0038430293,0.0003820695,0.00032400127,0.0007578925,0.0010916382,0.0032884362,0.002614179,0.0010622188,0.00157079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028168722,0.0003775214,0.0021929948,0.00049737585,0.00007213562,0.00090182043,0.0005485777,0.26621276,0.047022358,0.38393167,0.036059972,0.25936595],"study_design_scores_gemma":[0.00055434863,0.00032167474,0.0004154717,0.000029263032,0.00004117766,0.0003499048,0.000090986665,0.78147894,0.01579701,0.17220329,0.02865568,0.00006234629],"about_ca_topic_score_codex":0.001121396,"about_ca_topic_score_gemma":0.0010969318,"teacher_disagreement_score":0.008688125,"about_ca_system_score_codex":0.0010238489,"about_ca_system_score_gemma":0.0018005806,"threshold_uncertainty_score":0.029064655},"labels":[],"label_agreement":null},{"id":"W4376311994","doi":"10.4230/lipics.disc.2023.46","title":"Brief Announcement: The Space Complexity of Set Agreement Using Swap","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Omega; Swap (finance); Combinatorics; Upper and lower bounds; Mathematics; Algorithm; Discrete mathematics; Physics","score_opus":0.2549907127209214,"score_gpt":0.2359605668783943,"score_spread":0.019030145842527074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376311994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09464254,0.012148226,0.75939643,0.044387657,0.014038921,0.0005524012,0.0025505235,0.008921614,0.06336165],"genre_scores_gemma":[0.6558057,0.009602988,0.2440885,0.006982579,0.015075152,0.0012127372,0.0071329293,0.0032352814,0.056864087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99243706,0.0019387342,0.00049647316,0.0016287623,0.0025129903,0.0009860034],"domain_scores_gemma":[0.97935265,0.013676605,0.0005752972,0.0035411932,0.0019486578,0.00090553745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052858773,0.001564076,0.0018230833,0.0010354606,0.0027322555,0.0058356794,0.0027389158,0.0023200137,0.025521131],"category_scores_gemma":[0.025036016,0.0013414193,0.00291909,0.0027999629,0.0036966742,0.01807198,0.004394312,0.010665269,0.0066963322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021386358,0.0002976001,0.0017804859,0.0017269327,0.00021631944,0.00032811152,0.0009320418,0.06585598,0.016253764,0.51569676,0.17297313,0.22180024],"study_design_scores_gemma":[0.0003848434,0.0005055715,0.0011038075,0.00025927692,0.0001969658,0.00029873243,0.0002512956,0.2587126,0.017686775,0.5886146,0.13176468,0.00022090576],"about_ca_topic_score_codex":0.0030382324,"about_ca_topic_score_gemma":0.001781022,"teacher_disagreement_score":0.025521131,"about_ca_system_score_codex":0.004431219,"about_ca_system_score_gemma":0.0034437173,"threshold_uncertainty_score":0.08537668},"labels":[],"label_agreement":null},{"id":"W4378801269","doi":"10.1145/3558481.3591317","title":"Brief Announcement: On Solving Recoverable Mutual Exclusion Under System-Wide Failures","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Computer science; Variety (cybernetics); Constant (computer programming); Process (computing); Self-stabilization; Fault tolerance; Theoretical computer science; Distributed computing; Artificial intelligence; Programming language","score_opus":0.018044708942906666,"score_gpt":0.23954894385653494,"score_spread":0.22150423491362828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378801269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014382409,0.14462386,0.26360047,0.23797907,0.18775278,0.00077091076,0.0032292348,0.0035137858,0.14414749],"genre_scores_gemma":[0.15922375,0.15895052,0.11332987,0.05803731,0.26101378,0.0010317157,0.006109553,0.0017401596,0.24056342],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811673,0.00056683214,0.000104837,0.00032560647,0.0006027314,0.00028330134],"domain_scores_gemma":[0.9934227,0.004481455,0.00017722274,0.00028366712,0.0010758328,0.0005593219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039057694,0.0013862052,0.0012792934,0.0013035695,0.0014451412,0.0026727074,0.001977091,0.0036229212,0.025376594],"category_scores_gemma":[0.01224684,0.00062503474,0.0007922035,0.0024538976,0.0017372543,0.0071042376,0.0018661834,0.0060543846,0.0097179115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005589467,0.00027762284,0.00058054616,0.0012449101,0.000058983576,0.00033751834,0.00014528491,0.0073353136,0.0016719535,0.08276579,0.72164756,0.18337563],"study_design_scores_gemma":[0.00018820738,0.00055906817,0.0010905511,0.0004298894,0.00008816065,0.0003678289,0.00025072848,0.030517299,0.0024436126,0.13427813,0.8296711,0.000115418],"about_ca_topic_score_codex":0.0023120786,"about_ca_topic_score_gemma":0.002050356,"teacher_disagreement_score":0.025376594,"about_ca_system_score_codex":0.0016264251,"about_ca_system_score_gemma":0.001616069,"threshold_uncertainty_score":0.08489317},"labels":[],"label_agreement":null},{"id":"W4379800102","doi":"10.1145/3604437.3604444","title":"Efficiently Making Cross-Engine Transactions Consistent","year":2023,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Limiting; Isolation (microbiology); Correctness; Database; Operating system; Programming language","score_opus":0.032594072378710856,"score_gpt":0.3036519960292631,"score_spread":0.27105792365055226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379800102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.131368,0.00070984644,0.850181,0.0010490136,0.00030458544,0.0007091996,0.00045809022,0.0094503695,0.0057699215],"genre_scores_gemma":[0.5190859,0.0005305575,0.46761855,0.0006136614,0.00021280405,0.000499474,0.0021022945,0.0026391323,0.0066976044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9679672,0.009050073,0.0043172254,0.004023287,0.011628584,0.0030136271],"domain_scores_gemma":[0.8914718,0.032990605,0.005672946,0.04858431,0.019705359,0.0015749469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024833618,0.001588095,0.0022636177,0.0021353401,0.0014845739,0.0063611497,0.006797702,0.0020633051,0.0044004535],"category_scores_gemma":[0.08720197,0.002644193,0.001299412,0.004507081,0.0025184888,0.011829067,0.01082798,0.003796693,0.0028480415],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026445955,0.0011495615,0.019459285,0.00077342737,0.0005615664,0.0011464872,0.0031879263,0.13033369,0.057238586,0.0802378,0.022610925,0.68065614],"study_design_scores_gemma":[0.0009879722,0.0010949888,0.0031058085,0.00023999084,0.00061080174,0.00078011584,0.0023161045,0.6859716,0.09037988,0.16989775,0.044439565,0.00017548697],"about_ca_topic_score_codex":0.0028943,"about_ca_topic_score_gemma":0.0035732652,"teacher_disagreement_score":0.024833618,"about_ca_system_score_codex":0.0010108497,"about_ca_system_score_gemma":0.0065078815,"threshold_uncertainty_score":0.1313343},"labels":[],"label_agreement":null},{"id":"W4380359838","doi":"10.5070/sr33161345","title":"[Solution] Byzantine Cluster-Sending in Expected Constant Cost and Constant Time","year":2023,"lang":"en","type":"article","venue":"Journal of Systems Research","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Probabilistic logic; Cluster (spacecraft); Robustness (evolution); Constant (computer programming); Fault tolerance; Byzantine fault tolerance; Time complexity; Computer network; Algorithm","score_opus":0.06997194778730426,"score_gpt":0.3594026688756885,"score_spread":0.28943072108838425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380359838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071870536,0.00031730247,0.97387755,0.0022514141,0.00044775376,0.00028939222,0.00013034404,0.00222907,0.013270113],"genre_scores_gemma":[0.22556022,0.00076551776,0.73617274,0.0014243776,0.0005571289,0.00059997936,0.0005268692,0.0011850517,0.033208065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970278,0.0007611776,0.00014522142,0.0006425049,0.0011390665,0.00028421747],"domain_scores_gemma":[0.99485695,0.0012741868,0.00038871844,0.0022960398,0.0009907056,0.00019327045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026615162,0.0008379546,0.00084697764,0.0011371131,0.0019819206,0.0019392706,0.0026424783,0.0019286907,0.010124689],"category_scores_gemma":[0.010804859,0.00060041476,0.0009012814,0.0015662959,0.002068043,0.005173002,0.0037063828,0.0027602832,0.0030384476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059786014,0.00010266528,0.0006884679,0.0005603563,0.00010211952,0.00020936308,0.0008728414,0.07060192,0.012180612,0.65064466,0.04566968,0.21776947],"study_design_scores_gemma":[0.00019720032,0.00024414252,0.00046426148,0.00011529236,0.00012503307,0.0008163447,0.00022997147,0.42499417,0.020251188,0.40647304,0.14597942,0.00011007057],"about_ca_topic_score_codex":0.0023959351,"about_ca_topic_score_gemma":0.0015982182,"teacher_disagreement_score":0.010124689,"about_ca_system_score_codex":0.0016947936,"about_ca_system_score_gemma":0.0029263382,"threshold_uncertainty_score":0.03387046},"labels":[],"label_agreement":null},{"id":"W4380873901","doi":"10.1145/3583668.3594565","title":"A Wait-free Queue with Polylogarithmic Step Complexity","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Amortized analysis; Computer science; Bounded function; Priority queue; Combinatorics; Mathematics; Lock (firearm); Binary logarithm; Discrete mathematics; Parallel computing; Data structure; Operating system; Computer network","score_opus":0.028017281148545656,"score_gpt":0.24381061391097922,"score_spread":0.21579333276243357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380873901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030545458,0.0003676996,0.9495239,0.00044039873,0.00026291478,0.00020076799,0.00024244002,0.013608112,0.004808262],"genre_scores_gemma":[0.37400144,0.00022946016,0.6108138,0.0004766688,0.00014330384,0.00040569063,0.000512081,0.0005897902,0.012827791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852115,0.00014207471,0.00014798222,0.00026468583,0.0006219776,0.000302168],"domain_scores_gemma":[0.9972361,0.0005901712,0.00020958543,0.00080584985,0.0008969972,0.00026138758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010193804,0.00066740636,0.0007384792,0.00080001913,0.0011629454,0.002518659,0.0045248717,0.0008183409,0.009216644],"category_scores_gemma":[0.0033973015,0.00058181904,0.0006086717,0.0012540742,0.0011761049,0.0037012906,0.0016016603,0.0021249207,0.0022638536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034678315,0.0012216812,0.0030544973,0.00080486794,0.00017646038,0.00050212914,0.00071573193,0.06545399,0.14350545,0.26793462,0.03907081,0.47409186],"study_design_scores_gemma":[0.0012121634,0.0013824804,0.0007141956,0.00008743721,0.00028148465,0.00029488085,0.00013181074,0.7851738,0.09970625,0.0710586,0.039697282,0.0002596063],"about_ca_topic_score_codex":0.009329067,"about_ca_topic_score_gemma":0.009999093,"teacher_disagreement_score":0.009329067,"about_ca_system_score_codex":0.0023629745,"about_ca_system_score_gemma":0.0046518785,"threshold_uncertainty_score":0.030832708},"labels":[],"label_agreement":null},{"id":"W4380874321","doi":"10.1145/3583668.3594597","title":"Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Mutual exclusion; Upper and lower bounds; Word (group theory); Synchronization (alternating current); Computer science; Log-log plot; Mutual information; Binary logarithm; Algorithm; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Topology (electrical circuits); Artificial intelligence","score_opus":0.024258437665934163,"score_gpt":0.2637082096538873,"score_spread":0.23944977198795314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380874321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22485846,0.0055719,0.72952867,0.0061584916,0.00026965837,0.00029510676,0.00051310606,0.005760906,0.027043724],"genre_scores_gemma":[0.8705916,0.0012069952,0.12260593,0.0004906716,0.00019460965,0.00033379992,0.00033315842,0.00062777224,0.0036154385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99166155,0.0025992754,0.00052508456,0.0010969539,0.0025942186,0.001522862],"domain_scores_gemma":[0.951525,0.034867175,0.0022800993,0.009247155,0.0015093045,0.0005712929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047528874,0.0013009798,0.0015620542,0.0014070503,0.0011746387,0.0030985507,0.0039959885,0.0024346078,0.009113374],"category_scores_gemma":[0.03518046,0.00076206436,0.0009043929,0.0015876445,0.0024292588,0.015303695,0.0036586104,0.0034104963,0.0017848153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035241155,0.0007524959,0.0025314933,0.0010782594,0.00014102976,0.0004290505,0.0005300232,0.3376827,0.08481502,0.31925982,0.012052951,0.23720305],"study_design_scores_gemma":[0.00015855988,0.0003982228,0.00050419284,0.0000749441,0.000071474395,0.00039493278,0.00015748478,0.8279009,0.042442307,0.124770954,0.0030266056,0.00009933605],"about_ca_topic_score_codex":0.0006927978,"about_ca_topic_score_gemma":0.00096989237,"teacher_disagreement_score":0.009113374,"about_ca_system_score_codex":0.0033051923,"about_ca_system_score_gemma":0.0015994124,"threshold_uncertainty_score":0.03048724},"labels":[],"label_agreement":null},{"id":"W4380874976","doi":"10.1145/3583668.3594601","title":"Efficient Bounded Timestamping from Standard Synchronization Primitives","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Timestamp; Timestamp-based concurrency control; Computer science; Synchronization (alternating current); Block (permutation group theory); Bounded function; Process (computing); Algorithm; Parallel computing; Theoretical computer science; Real-time computing; Mathematics; Programming language; Concurrency control; Computer network; Combinatorics","score_opus":0.01148182625431453,"score_gpt":0.24271451592221108,"score_spread":0.23123268966789653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380874976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006626935,0.00083933846,0.9775999,0.00030306165,0.00027681823,0.00019734503,0.00044083796,0.0066432413,0.007072395],"genre_scores_gemma":[0.2897003,0.0012186887,0.69605917,0.0003772043,0.00042691518,0.0007457614,0.0020910348,0.0010200263,0.008360869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598193,0.00063574483,0.0003591165,0.00047992266,0.0019881024,0.0005551306],"domain_scores_gemma":[0.99498874,0.0012790809,0.00037723084,0.002691561,0.00050224137,0.00016123973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020899295,0.0014087704,0.0015809317,0.0015822048,0.0011086045,0.0024325368,0.0032365695,0.0010829825,0.013481702],"category_scores_gemma":[0.009311121,0.0008444034,0.00088747806,0.0033280982,0.001198751,0.006085881,0.006877776,0.0029374575,0.0049027833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001787181,0.00019687535,0.00056014303,0.00083098747,0.000083525,0.00029828787,0.0004465575,0.051178593,0.038951457,0.4164732,0.03734534,0.45184797],"study_design_scores_gemma":[0.0004782406,0.00032155387,0.0002987398,0.00019620967,0.00010275138,0.0004029852,0.00014276952,0.35645378,0.048703033,0.5158718,0.076926544,0.00010160098],"about_ca_topic_score_codex":0.00094025326,"about_ca_topic_score_gemma":0.0014097905,"teacher_disagreement_score":0.013481702,"about_ca_system_score_codex":0.0011641468,"about_ca_system_score_gemma":0.002241623,"threshold_uncertainty_score":0.04510081},"labels":[],"label_agreement":null},{"id":"W4382564139","doi":"10.1007/978-3-031-33083-4_3","title":"Security Versus Speed","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Byzantine fault tolerance; Computer science; Trustworthiness; Block (permutation group theory); Fault tolerance; Robustness (evolution); Blockchain; Distributed computing; Computer security; Computer network; Mathematics; Biology","score_opus":0.039552978199651166,"score_gpt":0.2550119530183094,"score_spread":0.21545897481865825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382564139","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011478268,0.009872038,0.013659643,0.0036980796,0.0010534356,0.000021545677,0.00007482415,0.00027464083,0.97019804],"genre_scores_gemma":[0.040502165,0.010459098,0.0046236166,0.0019687742,0.0011159191,0.0000681317,0.0000966815,0.0005344346,0.94063115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00006510573,0.000009199921,0.000070794704,0.00017123492,0.000042340063],"domain_scores_gemma":[0.9994254,0.0002408678,0.000027635086,0.00015354472,0.00011439883,0.000038129794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031199236,0.0008690689,0.00049331714,0.0009214213,0.0012220948,0.0037151217,0.000659225,0.0013466008,0.07714733],"category_scores_gemma":[0.0018832773,0.0003991012,0.00024547148,0.0010917167,0.0027452777,0.008766118,0.001563554,0.0034976236,0.030449647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002124915,0.00001170732,0.000035745357,0.00006356009,0.0000029326554,0.000016591759,0.00018463477,0.0004670981,0.00055569236,0.85937214,0.075777106,0.06349156],"study_design_scores_gemma":[0.000006554794,0.000019783725,0.000086070926,0.00010508826,0.000005841358,0.00010411138,0.00012380545,0.00087818975,0.0005173479,0.34230158,0.6558438,0.000007827678],"about_ca_topic_score_codex":0.0014178272,"about_ca_topic_score_gemma":0.0013167321,"teacher_disagreement_score":0.07714733,"about_ca_system_score_codex":0.0016346821,"about_ca_system_score_gemma":0.0008223919,"threshold_uncertainty_score":0.25808352},"labels":[],"label_agreement":null},{"id":"W4383335034","doi":"10.1007/978-3-031-37765-5_5","title":"Comparing Causal Convergence Consistency Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Causal consistency; Computer science; Consistency (knowledge bases); Consistency model; Sequential consistency; Formalism (music); Sequence (biology); Data consistency; Partition (number theory); Theoretical computer science; Strong consistency; Weak consistency; Convergence (economics); Data mining; Distributed computing; Artificial intelligence; Mathematics; Statistics","score_opus":0.04546782967617297,"score_gpt":0.25517286107405673,"score_spread":0.20970503139788377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383335034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076789066,0.0011501455,0.8753215,0.0017927991,0.00030899027,0.00013683981,0.00040058832,0.0007733909,0.043326583],"genre_scores_gemma":[0.90511084,0.0009153896,0.08204811,0.00041301866,0.00027063108,0.00029817582,0.0010067993,0.000551058,0.009385996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902658,0.0063011236,0.0003168641,0.0009460943,0.0016264945,0.000543678],"domain_scores_gemma":[0.8613203,0.11406928,0.003818551,0.013075345,0.006688275,0.0010281471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01658207,0.0009613278,0.0014706854,0.002794147,0.0011226364,0.0038989072,0.0033932647,0.0023949698,0.016019404],"category_scores_gemma":[0.102250636,0.0009341145,0.0019402363,0.0029892568,0.0033277962,0.0076663024,0.0031552447,0.0031296322,0.0011125734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049354695,0.000116012976,0.0016026915,0.00014973557,0.0001247825,0.000050309296,0.00023177217,0.12704204,0.00027134924,0.8270952,0.002954058,0.039868418],"study_design_scores_gemma":[0.00004711992,0.000075317526,0.00042412902,0.000049571172,0.00005657297,0.00002665868,0.00012739802,0.21280695,0.0004218738,0.78439766,0.0015438818,0.00002292153],"about_ca_topic_score_codex":0.0023450481,"about_ca_topic_score_gemma":0.0014335102,"teacher_disagreement_score":0.01658207,"about_ca_system_score_codex":0.0024763707,"about_ca_system_score_gemma":0.0021319564,"threshold_uncertainty_score":0.08769542},"labels":[],"label_agreement":null},{"id":"W4383561026","doi":"10.54254/2755-2721/6/20230789","title":"Overweight and overload implementation in Apollo systems","year":2023,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Apollo; Computer science; Architecture; Software engineering; Software deployment; Sequence diagram; Component (thermodynamics); Process (computing); Concurrency; Data flow diagram; Systems engineering; Distributed computing; Programming language; Engineering; Software; Unified Modeling Language; Database","score_opus":0.005029931727855745,"score_gpt":0.21712529831149233,"score_spread":0.2120953665836366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383561026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25617027,0.00030127406,0.65623105,0.0014358828,0.00020801186,0.00039554056,0.0003733972,0.033724703,0.051159915],"genre_scores_gemma":[0.7536334,0.00020743255,0.22337426,0.00031316004,0.00006960502,0.00029042087,0.000627919,0.0024754107,0.019008337],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979075,0.00045981328,0.00012315555,0.00033877196,0.0009103396,0.0002605088],"domain_scores_gemma":[0.9952348,0.0019878696,0.00041541536,0.0012440487,0.0009315938,0.00018635075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020957014,0.00055754016,0.00036706883,0.0013462526,0.0014322842,0.0024749117,0.0017453134,0.0010255601,0.006732702],"category_scores_gemma":[0.009007093,0.0005458505,0.0005757405,0.0008809071,0.0016707773,0.0032619208,0.0023770074,0.0011421602,0.0011488638],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012282698,0.00069876923,0.036631986,0.0012119749,0.00014172535,0.0041750297,0.01754638,0.12414813,0.07002617,0.24923915,0.034120396,0.46083212],"study_design_scores_gemma":[0.0002252238,0.00045990237,0.013755788,0.00039867603,0.00016734195,0.0015089617,0.002623159,0.636157,0.057001222,0.0919236,0.19560388,0.00017527991],"about_ca_topic_score_codex":0.0056791687,"about_ca_topic_score_gemma":0.007370635,"teacher_disagreement_score":0.006732702,"about_ca_system_score_codex":0.0019877686,"about_ca_system_score_gemma":0.0021745595,"threshold_uncertainty_score":0.022523105},"labels":[],"label_agreement":null},{"id":"W4383898410","doi":"10.1109/icse-seip58684.2023.00006","title":"Understanding Inconsistency in Azure Cosmos DB with TLA+","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Correctness; Computer science; Cosmos (plant); Consistency (knowledge bases); Semantics (computer science); Programming language; Observable; Documentation; Service (business); Key (lock); Software engineering; Operating system; Artificial intelligence; Physics","score_opus":0.10996009178940598,"score_gpt":0.2506230765227527,"score_spread":0.1406629847333467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383898410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11150598,0.00051130576,0.83384687,0.004495716,0.00025569275,0.00023631165,0.0011184774,0.036703065,0.011326572],"genre_scores_gemma":[0.48922282,0.0004148977,0.48679042,0.0014867953,0.00013757776,0.00033106902,0.0018459719,0.011098041,0.0086724665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98107886,0.0058296504,0.0027606117,0.0021703253,0.0073292325,0.0008313227],"domain_scores_gemma":[0.94480795,0.025234347,0.006150873,0.014818621,0.008344614,0.00064357306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020560084,0.0009734482,0.0009575772,0.0017245158,0.002004924,0.007184187,0.003928992,0.0022438446,0.0047150296],"category_scores_gemma":[0.043951135,0.0023407335,0.0013404206,0.0012007774,0.004323253,0.010168256,0.005071,0.005214666,0.0011220109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013598109,0.0005102458,0.034075376,0.0017821076,0.00027040785,0.003781311,0.029917901,0.082476944,0.037649266,0.6012335,0.04390381,0.16303934],"study_design_scores_gemma":[0.000508804,0.00048599148,0.006607455,0.0011560667,0.00037873103,0.0034964017,0.0037527392,0.40836737,0.10571004,0.17143317,0.29766113,0.00044207677],"about_ca_topic_score_codex":0.015407797,"about_ca_topic_score_gemma":0.014954072,"teacher_disagreement_score":0.020560084,"about_ca_system_score_codex":0.0039897,"about_ca_system_score_gemma":0.0054623927,"threshold_uncertainty_score":0.108733416},"labels":[],"label_agreement":null},{"id":"W4385312509","doi":"10.1109/iwqos57198.2023.10188780","title":"CATS: A Computation-Aware Transaction Processing System with Proactive Unlocking","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Atomicity; Transaction processing system; Transaction processing; Distributed transaction; Online transaction processing; Distributed computing; Computation; Database transaction; Commit; Concurrency control; Rollback; Concurrency; Database; Programming language","score_opus":0.01623699741235944,"score_gpt":0.2439161759514897,"score_spread":0.22767917853913028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385312509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1692312,0.0038155376,0.74761665,0.00086241023,0.0007041012,0.0010799431,0.0022218414,0.05643407,0.018034277],"genre_scores_gemma":[0.74483776,0.00081854826,0.23717767,0.00060947414,0.0002020067,0.00046590524,0.0033398613,0.00067232,0.01187645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990706,0.00014047559,0.00009997223,0.00019899664,0.00038271426,0.000107342035],"domain_scores_gemma":[0.998348,0.0003225061,0.00016326927,0.0005391024,0.00040187323,0.00022517217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733075,0.0006361194,0.00072428136,0.0007829231,0.0006613491,0.0012912719,0.0031226687,0.00073416904,0.005408752],"category_scores_gemma":[0.0020682309,0.0004410536,0.00038869976,0.0013739276,0.0008040579,0.0020331435,0.0017473823,0.0009424624,0.0015692322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061590867,0.0007863694,0.011491827,0.0015062094,0.00044196678,0.0016755582,0.0006516708,0.13370799,0.15395261,0.041015726,0.10004667,0.5485644],"study_design_scores_gemma":[0.0007421686,0.0013741924,0.0030425196,0.000092237395,0.00029914975,0.0014933035,0.00017840267,0.8278121,0.06053494,0.017547265,0.08670494,0.00017882852],"about_ca_topic_score_codex":0.0026763284,"about_ca_topic_score_gemma":0.0028354605,"teacher_disagreement_score":0.005408752,"about_ca_system_score_codex":0.0005479259,"about_ca_system_score_gemma":0.0020473124,"threshold_uncertainty_score":0.018094122},"labels":[],"label_agreement":null},{"id":"W4385322990","doi":"10.1109/lsp.2023.3299531","title":"Deadline-Aware Coded Computation Across Homogeneous Workers","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Scheduling (production processes); Distributed computing; Matrix multiplication; Computation; Task (project management); Homogeneous; Task analysis; Greedy algorithm; Parallel computing; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.024702789652454128,"score_gpt":0.2870562913998942,"score_spread":0.26235350174744004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385322990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18488815,0.00033282282,0.8071231,0.00035358328,0.00012131288,0.000084393985,0.000086547894,0.00088141393,0.0061286027],"genre_scores_gemma":[0.8887626,0.00009357473,0.10677061,0.00008379486,0.000028675147,0.00006498841,0.000063146625,0.000052236286,0.004080324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946815,0.000108815446,0.00002280702,0.00012291742,0.00011974882,0.00015768348],"domain_scores_gemma":[0.99840456,0.00061492075,0.00017678743,0.00037234157,0.00026161427,0.00016986475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076142343,0.00039321798,0.0006377207,0.0003287657,0.00062215875,0.00088521384,0.0012335947,0.00047864844,0.0018070448],"category_scores_gemma":[0.0026720567,0.00019527005,0.0002425321,0.00069940183,0.000700993,0.0008149861,0.0010254194,0.00059756625,0.00034695628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010382939,0.0001415768,0.0011694322,0.00009028156,0.000029433997,0.00019750548,0.00019113791,0.8909066,0.017297717,0.020613048,0.003120065,0.06520501],"study_design_scores_gemma":[0.00002865174,0.000054855773,0.00012357024,0.0000028555407,0.0000044769563,0.000020633866,0.000024866087,0.9911033,0.0034275656,0.0044930023,0.0007102711,0.0000059750473],"about_ca_topic_score_codex":0.00473179,"about_ca_topic_score_gemma":0.005401679,"teacher_disagreement_score":0.00473179,"about_ca_system_score_codex":0.0010221987,"about_ca_system_score_gemma":0.0023508854,"threshold_uncertainty_score":0.009408534},"labels":[],"label_agreement":null},{"id":"W4385403839","doi":"10.15607/rss.2023.xix.013","title":"PATO: Policy Assisted TeleOperation for Scalable Robot Data Collection","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Teleoperation; Computer science; Scalability; Robot; Telerobotics; Data collection; Human–computer interaction; Mobile robot; Artificial intelligence; Operating system","score_opus":0.08226045660615232,"score_gpt":0.33659405793496167,"score_spread":0.25433360132880933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385403839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023298347,0.00010444228,0.9300717,0.00023931598,0.00010041904,0.00021662006,0.00037728046,0.042996444,0.0025953795],"genre_scores_gemma":[0.5410663,0.00019032057,0.45040292,0.00033079728,0.000093377006,0.00059815764,0.0011301081,0.0016116931,0.004576362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992986,0.00011742047,0.000054850585,0.00017377602,0.00027341364,0.000082070954],"domain_scores_gemma":[0.99824524,0.0005814746,0.00018670013,0.00059842743,0.00023533207,0.00015282568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082403875,0.0006252984,0.0005288329,0.00044405705,0.00043874138,0.00075437763,0.0014183876,0.00052286085,0.0038055424],"category_scores_gemma":[0.0025899815,0.00032180175,0.0002933527,0.00047192257,0.0006625582,0.001442749,0.0015247224,0.0010792994,0.0013026473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018767169,0.0007969097,0.0055348533,0.0003658684,0.00014090567,0.0007030326,0.00079318497,0.097895555,0.16980445,0.012023543,0.05448005,0.6555849],"study_design_scores_gemma":[0.0001960825,0.00031437067,0.0022132096,0.00002331796,0.0000226877,0.0003122674,0.00015856093,0.9077151,0.056091122,0.009882,0.023003323,0.00006804885],"about_ca_topic_score_codex":0.0019777233,"about_ca_topic_score_gemma":0.0020016446,"teacher_disagreement_score":0.0038055424,"about_ca_system_score_codex":0.00040133047,"about_ca_system_score_gemma":0.0010885788,"threshold_uncertainty_score":0.012730837},"labels":[],"label_agreement":null},{"id":"W4385404176","doi":"10.1137/20m1375851","title":"Why Extension-Based Proofs Fail","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation; U.S. Department of Energy; Oracle; European Research Council; National Science Foundation","keywords":"Mathematical proof; Impossibility; Computer science; Extension (predicate logic); Iterated function; Theoretical computer science; Mathematics; Gas meter prover; Discrete mathematics; Asynchronous communication; Programming language","score_opus":0.02448646008733901,"score_gpt":0.27120114138653145,"score_spread":0.24671468129919244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385404176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03774154,0.006124096,0.8882785,0.028458308,0.0014159684,0.0002135385,0.00022307136,0.0021261119,0.03541883],"genre_scores_gemma":[0.75553274,0.004357979,0.22346152,0.0055763144,0.0013547762,0.00054957386,0.00033414373,0.0010582217,0.0077746892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9622871,0.019337071,0.0022836428,0.003924287,0.009802197,0.0023657386],"domain_scores_gemma":[0.76067024,0.18875091,0.007008441,0.02824485,0.013117587,0.0022079856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03777941,0.0011185181,0.0013370787,0.0018462156,0.0027595821,0.0064361785,0.004049806,0.004891151,0.0071234247],"category_scores_gemma":[0.15142049,0.0017089344,0.002182655,0.0012649803,0.013709523,0.030818477,0.00942908,0.00892132,0.0030581206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008750879,0.000034682645,0.00056013133,0.0003156047,0.00004652267,0.00035871367,0.00083823386,0.0048226905,0.00061329943,0.96575093,0.004524637,0.022047099],"study_design_scores_gemma":[0.000045173107,0.00002622322,0.000053095922,0.00009210622,0.000013647141,0.00028143247,0.0000811911,0.0067241397,0.0010391861,0.97950876,0.012106494,0.00002848777],"about_ca_topic_score_codex":0.00049860054,"about_ca_topic_score_gemma":0.00026476086,"teacher_disagreement_score":0.03777941,"about_ca_system_score_codex":0.0018022816,"about_ca_system_score_gemma":0.002423685,"threshold_uncertainty_score":0.199799},"labels":[],"label_agreement":null},{"id":"W4385815545","doi":"10.1109/vtc2023-spring57618.2023.10200532","title":"Intrusion Resilience Systems for Modern Vehicles","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Resilience (materials science); Computer science; Intrusion detection system; Network packet; Modular design; Computer network; Ethernet; Latency (audio); Distributed computing; Computer security; Operating system; Telecommunications","score_opus":0.021890617210273102,"score_gpt":0.2632354054060438,"score_spread":0.24134478819577068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385815545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050160002,0.012314598,0.85141164,0.0059526823,0.00093882985,0.0002808799,0.0003053043,0.0059717586,0.07266429],"genre_scores_gemma":[0.7963879,0.0069940574,0.16023874,0.0006012588,0.0003882304,0.00023928561,0.00047588945,0.00019619435,0.03447843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964523,0.00007696891,0.00001940963,0.00005102815,0.00015719695,0.000050181774],"domain_scores_gemma":[0.99975926,0.000050882347,0.000036341233,0.00005335527,0.000079308295,0.000020860696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173923,0.000433354,0.00024095994,0.000541656,0.0005586804,0.0011792673,0.00057239376,0.00078371126,0.0046446314],"category_scores_gemma":[0.0008907222,0.00015978832,0.0002630321,0.0003884753,0.0005768764,0.0014402927,0.0013966458,0.0008066707,0.0013222786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008436267,0.00006480894,0.0014468714,0.00035479048,0.00004796857,0.0003940393,0.0005202197,0.21608819,0.025336996,0.3954026,0.02279238,0.33746675],"study_design_scores_gemma":[0.00002712707,0.00017485055,0.0012626261,0.00015457858,0.000035357938,0.00057652796,0.00044666388,0.46839076,0.008347172,0.20380853,0.3167146,0.00006116358],"about_ca_topic_score_codex":0.0020648,"about_ca_topic_score_gemma":0.0017195975,"teacher_disagreement_score":0.0046446314,"about_ca_system_score_codex":0.00093945506,"about_ca_system_score_gemma":0.0007984716,"threshold_uncertainty_score":0.015537858},"labels":[],"label_agreement":null},{"id":"W4386174973","doi":"10.1109/tdsc.2023.3308848","title":"Fast-HotStuff: A Fast and Robust BFT Protocol for Blockchains","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Byzantine fault tolerance; Computer network; Distributed computing; Protocol (science); Throughput; Robustness (evolution); Fault tolerance; Parallel computing; Telecommunications; Wireless","score_opus":0.03179252942926588,"score_gpt":0.2848214308757208,"score_spread":0.25302890144645496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386174973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031003153,0.00050852465,0.9587707,0.00051951664,0.00017861494,0.00045596287,0.0003867731,0.0027095512,0.005467155],"genre_scores_gemma":[0.7605146,0.0005846482,0.22628456,0.0003416882,0.00012844059,0.0007414292,0.0010079634,0.0003315717,0.01006502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987344,0.00034572472,0.0000982388,0.00017387015,0.0004652807,0.00018255021],"domain_scores_gemma":[0.9978587,0.0005674362,0.00024838484,0.0007457663,0.0003950994,0.00018470052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016390153,0.0005427734,0.0006754491,0.0007573593,0.0011571876,0.00096834725,0.0016264074,0.0014356552,0.0047393683],"category_scores_gemma":[0.003996121,0.0003587455,0.00041588908,0.0008561939,0.0011478476,0.002585815,0.0029225743,0.0015021111,0.0010724247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013764136,0.00021999338,0.0013535606,0.0008447061,0.00014016542,0.0009932219,0.0011261388,0.20464388,0.10284775,0.25277707,0.02085799,0.41281924],"study_design_scores_gemma":[0.00044624507,0.00057564204,0.0004952846,0.0001166398,0.0000543404,0.0006774078,0.00017259677,0.74732465,0.045489866,0.15339506,0.051053025,0.00019923331],"about_ca_topic_score_codex":0.0019316402,"about_ca_topic_score_gemma":0.0018876627,"teacher_disagreement_score":0.0047393683,"about_ca_system_score_codex":0.00070250104,"about_ca_system_score_gemma":0.0015454451,"threshold_uncertainty_score":0.015854776},"labels":[],"label_agreement":null},{"id":"W4387544175","doi":"10.1109/icdcs57875.2023.00005","title":"Welcome Message","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pleasure; Computer science; Library science; World Wide Web; Psychology; Neuroscience","score_opus":0.0189175610931824,"score_gpt":0.2538926843372042,"score_spread":0.23497512324402178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387544175","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007225117,0.001981157,0.0011203384,0.4354887,0.4642083,0.00028915534,0.0015266157,0.0014007344,0.093262434],"genre_scores_gemma":[0.005733185,0.0014766759,0.0010592802,0.3955965,0.10893313,0.00037506944,0.001030416,0.0007841015,0.48501164],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966653,0.00062559353,0.00014844036,0.0004949715,0.0015494113,0.0005162946],"domain_scores_gemma":[0.9773226,0.0040630708,0.0006354172,0.0008548899,0.008956192,0.008167887],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0037062631,0.0011929872,0.00090330304,0.00093649194,0.0032380093,0.0066931746,0.0018413102,0.0125124855,0.31348112],"category_scores_gemma":[0.03521956,0.00037361038,0.0009806443,0.0004730706,0.0011791033,0.0037425747,0.0038055372,0.012084065,0.20227858],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002726828,0.000012802123,0.000052089268,0.000030547588,0.0000013321302,0.00006690525,0.00003808607,0.000007217358,0.000053862983,0.00056958915,0.99161935,0.0075208615],"study_design_scores_gemma":[0.000018677607,0.000026144668,0.0001571654,0.00007107094,0.0000027812055,0.00012754093,0.00015602802,0.000023390356,0.000078445264,0.00078502897,0.9985442,0.0000096149215],"about_ca_topic_score_codex":0.001363489,"about_ca_topic_score_gemma":0.0026585802,"teacher_disagreement_score":0.6865189,"about_ca_system_score_codex":0.0022036918,"about_ca_system_score_gemma":0.004906132,"threshold_uncertainty_score":0.9792359},"labels":[],"label_agreement":null},{"id":"W4387870145","doi":"10.1109/icc45041.2023.10279672","title":"Fast Cycle Multiple Entry PBFT Consensus","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Byzantine fault tolerance; Computer science; Probabilistic logic; Distributed computing; Blockchain; Consensus algorithm; The Internet; Scheme (mathematics); Fault tolerance; Computer security; Algorithm; Mathematics; Artificial intelligence","score_opus":0.014181903232572842,"score_gpt":0.23870696481585904,"score_spread":0.2245250615832862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04373658,0.0002164323,0.95160645,0.0001907007,0.00008457419,0.00019459883,0.000056225574,0.00067628035,0.003238079],"genre_scores_gemma":[0.84670615,0.00025958594,0.14677437,0.00011637823,0.000060623057,0.00026791522,0.00013388705,0.00006716802,0.0056137657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838996,0.00052623765,0.00006974618,0.00028291502,0.0005035508,0.00022765444],"domain_scores_gemma":[0.9967134,0.0012255738,0.00029806572,0.0011114078,0.00052654743,0.00012489929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015860858,0.00058114703,0.0012852595,0.0005750925,0.00094987935,0.00093053415,0.001729802,0.0012374122,0.0027202815],"category_scores_gemma":[0.004804444,0.00028858884,0.00046510133,0.00082970626,0.0014019548,0.0021059145,0.0018337832,0.0013350078,0.00042338218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007506236,0.00014438682,0.0011760455,0.00031302992,0.00009777978,0.00056254,0.000513986,0.59776384,0.029540114,0.16596872,0.0036429795,0.19952591],"study_design_scores_gemma":[0.00007829722,0.0002506794,0.00015909525,0.000017143233,0.0000142794615,0.0001758265,0.000024206725,0.94544786,0.006637721,0.043164298,0.004001564,0.000029039566],"about_ca_topic_score_codex":0.0016254591,"about_ca_topic_score_gemma":0.0015385235,"teacher_disagreement_score":0.0027202815,"about_ca_system_score_codex":0.00072462857,"about_ca_system_score_gemma":0.0014278166,"threshold_uncertainty_score":0.009100199},"labels":[],"label_agreement":null},{"id":"W4388205301","doi":"10.1145/3616388.3617540","title":"Djenne: Dependable and Decentralized Computation for Networked Embedded Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dependability; Distributed computing; Throughput; Resilience (materials science); Reliability (semiconductor); Computation; Key (lock); The Internet; Embedded system; Wireless; Power (physics); Computer security","score_opus":0.02139114531200473,"score_gpt":0.2768599868644796,"score_spread":0.25546884155247485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388205301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015062315,0.0009053983,0.96503276,0.0009862633,0.0002589086,0.00018191809,0.00011672074,0.0072019855,0.0102537],"genre_scores_gemma":[0.4578682,0.00096440536,0.52461153,0.0007803582,0.00014096241,0.00040094173,0.0005654139,0.00087576103,0.01379241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897695,0.00023750654,0.00006911743,0.00012995358,0.00048524162,0.000101219535],"domain_scores_gemma":[0.9988599,0.00039588206,0.00007412199,0.00033416424,0.00021729205,0.000118696844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012299564,0.0005124254,0.00039812995,0.00039758644,0.000625665,0.0014414061,0.0015465977,0.0008534689,0.0027960155],"category_scores_gemma":[0.0039026444,0.00035641924,0.00034166113,0.00034016639,0.001183428,0.0016522338,0.0019353284,0.0017159717,0.0008137736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080606394,0.0004622455,0.0038930597,0.0011314192,0.00013066625,0.00054257363,0.0007544795,0.2926709,0.072436966,0.23415563,0.05047697,0.34253898],"study_design_scores_gemma":[0.00018145073,0.0002407174,0.0008661616,0.000094196635,0.000037761514,0.00027157844,0.00008294515,0.8147199,0.026648728,0.055990763,0.100804254,0.00006153611],"about_ca_topic_score_codex":0.001042527,"about_ca_topic_score_gemma":0.0023460803,"teacher_disagreement_score":0.0027960155,"about_ca_system_score_codex":0.00069006125,"about_ca_system_score_gemma":0.0010321509,"threshold_uncertainty_score":0.009353638},"labels":[],"label_agreement":null},{"id":"W4388210282","doi":"10.1145/3631390","title":"The Space Complexity of Consensus from Swap","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swap (finance); Computer science; Consensus algorithm; Algorithm; Business","score_opus":0.05574133848827686,"score_gpt":0.28104195653586306,"score_spread":0.2253006180475862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388210282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.444351,0.0010485894,0.5048481,0.0035651799,0.00021842624,0.00043393532,0.0015411936,0.007297043,0.036696475],"genre_scores_gemma":[0.89402235,0.0003348805,0.09358407,0.00037441077,0.00011716986,0.0004859027,0.0023632413,0.00058128464,0.00813675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942061,0.0014699557,0.00047039724,0.0011448403,0.0017890886,0.00091962295],"domain_scores_gemma":[0.98695695,0.0076791993,0.0007376581,0.0031545756,0.0010144454,0.00045712906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023065798,0.0007971043,0.0012818255,0.00088522315,0.0016962917,0.0034593956,0.0021844597,0.001741147,0.009269659],"category_scores_gemma":[0.013633148,0.0006438724,0.0016166383,0.0018101705,0.0025326996,0.00918666,0.0047242665,0.0024079985,0.0018487769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025752096,0.00030891743,0.0030745817,0.0009718341,0.0001707337,0.00039261245,0.0016877261,0.5111321,0.02878493,0.24294874,0.015664894,0.19228764],"study_design_scores_gemma":[0.00024524704,0.00017425267,0.00076644344,0.00003678202,0.00006690463,0.00011273668,0.0002372346,0.715455,0.012971794,0.26509336,0.0047937017,0.000046577734],"about_ca_topic_score_codex":0.0032349883,"about_ca_topic_score_gemma":0.0023807848,"teacher_disagreement_score":0.009269659,"about_ca_system_score_codex":0.0024507362,"about_ca_system_score_gemma":0.0036456145,"threshold_uncertainty_score":0.031010091},"labels":[],"label_agreement":null},{"id":"W4388482249","doi":"10.4230/lipics.opodis.2023.28","title":"On Asynchrony, Memory, and Communication: Separations and Landscapes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Robot; Asynchrony (computer programming); Distributed computing; Theoretical computer science; Adversarial system; Atomicity; Bounded function; Synchronization (alternating current); Concurrency; Scheduling (production processes); Artificial intelligence; Mathematics; Mathematical optimization; Programming language","score_opus":0.06575715247354359,"score_gpt":0.2040727126996801,"score_spread":0.1383155602261365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388482249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20764333,0.016618721,0.61619514,0.031022117,0.0006975086,0.00018112964,0.0005611341,0.0005976153,0.12648326],"genre_scores_gemma":[0.95044386,0.004230867,0.03598029,0.0010306295,0.0007692073,0.00025131094,0.00014076632,0.00017693405,0.006976065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986565,0.0005649045,0.000058624613,0.00030541897,0.00020277628,0.0002118125],"domain_scores_gemma":[0.99093163,0.0065291114,0.00072722626,0.0008222639,0.0003113954,0.0006784486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002193115,0.0007102066,0.001126209,0.0013011525,0.002169059,0.005028631,0.0016818551,0.002272752,0.006341797],"category_scores_gemma":[0.012020617,0.00056088046,0.0011507,0.00080225023,0.0077608004,0.010280885,0.0044018263,0.003192398,0.00044316245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038456707,0.000016312846,0.0003803121,0.000060839022,0.000019526118,0.00007901859,0.00019554807,0.029815327,0.00030023625,0.96311885,0.0010547584,0.004920973],"study_design_scores_gemma":[0.000017093435,0.000016647,0.00022035812,0.000027881482,0.000009319526,0.000045841614,0.00008992273,0.045281965,0.000096218864,0.95158595,0.0025958207,0.000012976621],"about_ca_topic_score_codex":0.0017715008,"about_ca_topic_score_gemma":0.001186123,"teacher_disagreement_score":0.006341797,"about_ca_system_score_codex":0.0022624116,"about_ca_system_score_gemma":0.0013037532,"threshold_uncertainty_score":0.02121538},"labels":[],"label_agreement":null},{"id":"W4388620459","doi":"10.1145/3617336","title":"OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Lock (firearm); Robustness (evolution); Multi-core processor; Parallel computing; Byte; Distributed computing; Mutual exclusion; Operating system; Computer network","score_opus":0.10227693419833125,"score_gpt":0.3075132284456033,"score_spread":0.20523629424727205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388620459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044992406,0.001222134,0.92449296,0.00027322443,0.00023533839,0.0002714456,0.00038688414,0.022686362,0.0054391893],"genre_scores_gemma":[0.6840305,0.0004903018,0.30489567,0.00043186435,0.00013507502,0.0003091201,0.0007108535,0.0015596211,0.0074370275],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790156,0.00023738509,0.00018714326,0.00019839338,0.0011408881,0.00033464504],"domain_scores_gemma":[0.9968676,0.0008091504,0.00042835684,0.0011519708,0.0004989945,0.00024393399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018673856,0.00050589663,0.0006107509,0.0007382544,0.0008424926,0.0019249923,0.0037163515,0.00050406874,0.0038301537],"category_scores_gemma":[0.0056267986,0.00055224466,0.0003916731,0.00085894275,0.0010675564,0.0026250416,0.002798971,0.0011948051,0.00105289],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032566378,0.0004863706,0.009904305,0.000789372,0.0002146327,0.0005273384,0.0007909556,0.14185327,0.16374774,0.083321184,0.031746782,0.5633614],"study_design_scores_gemma":[0.00053416507,0.0006915484,0.001310721,0.000058719306,0.00009649257,0.0005164099,0.00016453104,0.7604949,0.15644598,0.029659003,0.04984042,0.00018706037],"about_ca_topic_score_codex":0.002725313,"about_ca_topic_score_gemma":0.0039171004,"teacher_disagreement_score":0.0038301537,"about_ca_system_score_codex":0.0010558426,"about_ca_system_score_gemma":0.0023602871,"threshold_uncertainty_score":0.012813151},"labels":[],"label_agreement":null},{"id":"W4388919408","doi":"10.1109/tpds.2023.3335671","title":"Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Garbage collection; Garbage; Concurrent data structure; Bounded function; Overhead (engineering); Parallel computing; POSIX Threads; Concurrency; Data consistency; Consistency (knowledge bases); Distributed computing; Synchronization (alternating current); Data structure; Key (lock); Operating system; Programming language; Computer network; Thread (computing)","score_opus":0.019059756359146897,"score_gpt":0.24742579670462958,"score_spread":0.2283660403454827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388919408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08579485,0.0013545142,0.8938921,0.0003582879,0.00020799908,0.00023468833,0.00011123518,0.012727911,0.005318415],"genre_scores_gemma":[0.6148772,0.000559903,0.37629062,0.0004921494,0.000065258675,0.00028673443,0.00028489684,0.0013081854,0.005835013],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983689,0.0002359631,0.00015873012,0.00034127053,0.0006622819,0.00023277677],"domain_scores_gemma":[0.9954803,0.0009662857,0.0006651129,0.0019070039,0.00083167426,0.00014959027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407121,0.0007849412,0.0007105295,0.0006657417,0.0010452957,0.0014076098,0.0026934966,0.00061669055,0.0017062399],"category_scores_gemma":[0.0042687473,0.00050812063,0.0007334841,0.0006241641,0.0016162421,0.0027662169,0.0027972204,0.0014195578,0.001044689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016974839,0.00029212216,0.008214882,0.0009209598,0.000119037475,0.00056382496,0.002763757,0.024883736,0.30159706,0.052128155,0.008786963,0.59803206],"study_design_scores_gemma":[0.0003033115,0.0012137669,0.0020832682,0.00021615923,0.00019210918,0.0014791256,0.00077763357,0.23129165,0.63747865,0.0416165,0.08308648,0.00026133825],"about_ca_topic_score_codex":0.0015739257,"about_ca_topic_score_gemma":0.0023016657,"teacher_disagreement_score":0.0026934966,"about_ca_system_score_codex":0.00086301804,"about_ca_system_score_gemma":0.0022116231,"threshold_uncertainty_score":0.006561637},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14995173507624227,"score_gpt":0.38829711771795394,"score_spread":0.23834538264171168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389509728","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000581628,0.9729214,0.01980213,0.0006904758,0.00041320076,0.00003494572,0.000046970286,0.000090423346,0.005418839],"genre_scores_gemma":[0.007924539,0.974538,0.014533179,0.0004913834,0.00060163543,0.000059157206,0.00014109958,0.000048920145,0.0016620205],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898094,0.00022656769,0.00012014711,0.00022112054,0.00037322973,0.00007800634],"domain_scores_gemma":[0.9975563,0.0016435254,0.00014886197,0.00011807675,0.00047201183,0.00006116705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515509,0.0011572333,0.0015117446,0.0030901034,0.00062852073,0.00189859,0.0015663017,0.0016428009,0.0033218327],"category_scores_gemma":[0.0051980107,0.00069264066,0.00085552846,0.0053466707,0.0009520031,0.0035797788,0.0009923796,0.0019807685,0.0025532758],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006730144,0.00008453285,0.00039420393,0.012853435,0.00008484752,0.000080142236,0.00016199495,0.008000204,0.00088445266,0.05684063,0.01915811,0.90139025],"study_design_scores_gemma":[0.000029349612,0.0002560838,0.00067981373,0.007221612,0.00017878656,0.00069680804,0.00017863318,0.008709291,0.0012878907,0.049637523,0.9310546,0.00006963798],"about_ca_topic_score_codex":0.0018143447,"about_ca_topic_score_gemma":0.0016509049,"teacher_disagreement_score":0.0033218327,"about_ca_system_score_codex":0.0010853078,"about_ca_system_score_gemma":0.0024706773,"threshold_uncertainty_score":0.01111263},"labels":[],"label_agreement":null},{"id":"W4390605256","doi":"10.1145/3632873","title":"Coarser Equivalences for Causal Concurrency","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India","keywords":"Concurrency; Commutative property; Equivalence (formal languages); TRACE (psycholinguistics); Equivalence relation; Logical equivalence; Computer science; Mathematics; Thread (computing); Discrete mathematics; Theoretical computer science; Programming language","score_opus":0.022697104571304194,"score_gpt":0.3079195908962046,"score_spread":0.2852224863249004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038025733,0.00051793444,0.94602513,0.00066719827,0.00009464608,0.00018620228,0.00017322674,0.00078099704,0.013528926],"genre_scores_gemma":[0.6981272,0.00058245816,0.28944162,0.0007689137,0.0003635371,0.000499489,0.0006696803,0.00041416837,0.009132919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994693,0.0008640578,0.0003340588,0.0015796699,0.0019769173,0.0005523521],"domain_scores_gemma":[0.9916061,0.00454358,0.00052093674,0.0022500174,0.0007308949,0.00034845722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003021478,0.00077049725,0.0009897089,0.0021199954,0.0013896358,0.0026077244,0.0018472845,0.00091327785,0.009756427],"category_scores_gemma":[0.013415746,0.0006354786,0.0020925147,0.0015760341,0.005692297,0.008670574,0.0047754236,0.006330553,0.00080527936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006437091,0.000050057777,0.0003937832,0.00007131859,0.00001510508,0.000063841595,0.00040959957,0.014866523,0.0019107718,0.9627567,0.0006336281,0.018764345],"study_design_scores_gemma":[0.000027417538,0.0000337713,0.00020788252,0.000015490923,0.000016756298,0.000030622752,0.00008211009,0.051741503,0.0017160501,0.941582,0.0045330715,0.000013296078],"about_ca_topic_score_codex":0.0038807697,"about_ca_topic_score_gemma":0.0030227266,"teacher_disagreement_score":0.009756427,"about_ca_system_score_codex":0.0026997493,"about_ca_system_score_gemma":0.0013637579,"threshold_uncertainty_score":0.03263849},"labels":[],"label_agreement":null},{"id":"W4390897584","doi":"10.4230/lipics.itcs.2024.53","title":"New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Communication complexity; Alice and Bob; Upper and lower bounds; Computer science; Alice (programming language); Function (biology); Merlin (protein); Discrete mathematics; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.03856684793016905,"score_gpt":0.1916367760298901,"score_spread":0.15306992809972106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390897584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05400632,0.0023042143,0.87555313,0.00867646,0.00041324977,0.00030710085,0.000880435,0.0018332803,0.056025807],"genre_scores_gemma":[0.7861781,0.0017092766,0.18630022,0.0026527082,0.001253283,0.0010097859,0.0015287965,0.0015137676,0.017854089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866916,0.0038512673,0.00064599357,0.002520387,0.004244126,0.0020465623],"domain_scores_gemma":[0.908503,0.07250209,0.0028733045,0.010488814,0.0037094674,0.0019233895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008229713,0.00238221,0.0019801294,0.0027686649,0.0033237007,0.0065923696,0.005653032,0.00356824,0.01404654],"category_scores_gemma":[0.05074919,0.0011589471,0.003764239,0.0026800842,0.0069617284,0.02734944,0.009610764,0.013765127,0.0021274285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022488885,0.0001513569,0.001100184,0.00036987843,0.00006224579,0.0001677981,0.0005231778,0.03037022,0.0024315077,0.93642735,0.004805152,0.023366272],"study_design_scores_gemma":[0.000027181386,0.00005077338,0.00020086355,0.00006880128,0.000037470483,0.00007636997,0.00006149394,0.11353306,0.0020341587,0.88029754,0.0035791737,0.00003307689],"about_ca_topic_score_codex":0.0021128303,"about_ca_topic_score_gemma":0.002336205,"teacher_disagreement_score":0.01404654,"about_ca_system_score_codex":0.006662418,"about_ca_system_score_gemma":0.0035687147,"threshold_uncertainty_score":0.048339427},"labels":[],"label_agreement":null},{"id":"W4391021788","doi":"10.1109/cdc49753.2023.10384294","title":"Leader-Follower Formations Subject to False Data Injections: A Resilient Distributed Model Predictive Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Task (project management); Model predictive control; State (computer science); Core (optical fiber); Queueing theory; Anomaly detection; Resilience (materials science); Containment (computer programming); Simple (philosophy); Distributed computing; Data mining; Artificial intelligence; Control (management); Algorithm; Computer network; Engineering","score_opus":0.06518814883726834,"score_gpt":0.2971139519770027,"score_spread":0.23192580313973435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391021788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025157303,0.000100618796,0.97254497,0.00031622316,0.00003219087,0.00002830596,0.000015441681,0.00022509541,0.0015798648],"genre_scores_gemma":[0.9696978,0.00010483921,0.028441792,0.000074446216,0.00004039056,0.00004421481,0.00002527408,0.000027915201,0.0015434355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923813,0.00022865064,0.000027448008,0.00019822741,0.00019101615,0.00011655945],"domain_scores_gemma":[0.99756503,0.0013031559,0.00043770002,0.00032098033,0.00022844985,0.00014469992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017880882,0.00082457176,0.00094176584,0.0005585278,0.0006409673,0.0012369638,0.0017366004,0.0010709306,0.0009366915],"category_scores_gemma":[0.0045241625,0.00047732258,0.000592475,0.00037357013,0.0017051088,0.0015669604,0.0021441295,0.0016521756,0.00014738664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006002512,0.00001903285,0.00028618882,0.00001950889,0.000022692779,0.00009797341,0.000083526545,0.9689473,0.00094980875,0.021054883,0.00021798816,0.008241129],"study_design_scores_gemma":[0.0000037737113,0.000015408912,0.00002238422,0.0000012971589,0.0000037787604,0.000006730275,0.000008258737,0.9933636,0.00022579337,0.006261929,0.000084153435,0.0000028280995],"about_ca_topic_score_codex":0.0032706857,"about_ca_topic_score_gemma":0.001688056,"teacher_disagreement_score":0.0032706857,"about_ca_system_score_codex":0.00094872253,"about_ca_system_score_gemma":0.0009234876,"threshold_uncertainty_score":0.009456456},"labels":[],"label_agreement":null},{"id":"W4391054882","doi":"10.14778/3632093.3632109","title":"Caerus: Low-Latency Distributed Transactions for Geo-Replicated Systems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Distributed transaction; Database transaction; Transaction processing; Workload; Online transaction processing; Distributed computing; Protocol (science); Distributed database; Database; Compensating transaction; Computer network; Operating system","score_opus":0.014421848795280147,"score_gpt":0.23148567763324981,"score_spread":0.21706382883796968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391054882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07564382,0.0032954072,0.8151418,0.00090835727,0.0004744689,0.0011296746,0.001404785,0.086374514,0.01562705],"genre_scores_gemma":[0.63734776,0.0009839163,0.34596255,0.00033719288,0.00016952456,0.0006724569,0.0025920272,0.0019111532,0.010023436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609166,0.0008501893,0.00034656673,0.00041580948,0.0019409353,0.0003547596],"domain_scores_gemma":[0.9942572,0.001311474,0.0004612371,0.0025965665,0.0009819415,0.0003915986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026329109,0.00095255015,0.0008535782,0.001072289,0.0011927487,0.0025126417,0.0041627563,0.0010908279,0.004661451],"category_scores_gemma":[0.010616519,0.00064537395,0.00038451247,0.0013927408,0.0010591238,0.003305456,0.0021963448,0.0014853687,0.001522304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003661236,0.0005732158,0.007282654,0.001357412,0.00031650037,0.0010335793,0.00077551877,0.14034066,0.11998829,0.10110574,0.09426791,0.5292972],"study_design_scores_gemma":[0.000584564,0.00069435843,0.0021244856,0.0000794836,0.000089359164,0.00061246654,0.00020601384,0.8169493,0.0665776,0.024042588,0.0878953,0.00014455401],"about_ca_topic_score_codex":0.006364225,"about_ca_topic_score_gemma":0.0060472125,"teacher_disagreement_score":0.006364225,"about_ca_system_score_codex":0.0012277594,"about_ca_system_score_gemma":0.0028112598,"threshold_uncertainty_score":0.015594065},"labels":[],"label_agreement":null},{"id":"W4391093845","doi":"10.1109/bigdata59044.2023.10386576","title":"RNBFT: Leveraging Randomness to Achieve Scalable Byzantine Consensus","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"University of Windsor","keywords":"Scalability; Computer science; Gossip; Byzantine fault tolerance; Distributed computing; Fault tolerance; Randomness; Overhead (engineering); Computer network; Protocol (science); Throughput; Broadcasting (networking); Telecommunications; Wireless","score_opus":0.021719829477841873,"score_gpt":0.25803102640678666,"score_spread":0.23631119692894478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391093845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034524404,0.00023816634,0.9619168,0.00028633024,0.00008537662,0.00011223092,0.00004551197,0.000975713,0.0018154017],"genre_scores_gemma":[0.7744371,0.0003255052,0.22156355,0.00020698816,0.00007963212,0.00032445023,0.00018231869,0.0001700793,0.0027102483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.0006013087,0.000099971265,0.00030251304,0.0005792847,0.00015317931],"domain_scores_gemma":[0.9975077,0.00093094906,0.000428002,0.0006509011,0.0003258764,0.0001566832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020455595,0.0005006023,0.00093022303,0.00059492484,0.0010280737,0.00079655345,0.0015549005,0.0009229422,0.0012662502],"category_scores_gemma":[0.0051059625,0.00022070756,0.0005114758,0.0005996667,0.0013180538,0.0021526334,0.002082625,0.0010252002,0.00046779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005118098,0.00010573897,0.0012271006,0.00035607454,0.00012638411,0.0005931613,0.00052888243,0.66417915,0.08395246,0.112553194,0.0037450537,0.13212101],"study_design_scores_gemma":[0.00006964837,0.0002486955,0.00016066483,0.000016089705,0.000020323723,0.0002011151,0.00004899127,0.93884414,0.019134412,0.034280453,0.006933626,0.000041851534],"about_ca_topic_score_codex":0.0008362569,"about_ca_topic_score_gemma":0.0008046888,"teacher_disagreement_score":0.0020455595,"about_ca_system_score_codex":0.0005932958,"about_ca_system_score_gemma":0.0009809751,"threshold_uncertainty_score":0.010818064},"labels":[],"label_agreement":null},{"id":"W4391157720","doi":"10.1145/3627535.3638491","title":"Are Your Epochs Too Epic? Batch Free Can Be Harmful","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"EPIC; Computer science; Art; Literature","score_opus":0.044939368305066056,"score_gpt":0.28263853382698706,"score_spread":0.237699165521921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391157720","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09297714,0.031699598,0.212197,0.23937999,0.033344932,0.0003967986,0.0028584911,0.018734317,0.36841175],"genre_scores_gemma":[0.6184272,0.015199224,0.053672202,0.051302765,0.007549257,0.00026572522,0.0015206154,0.008151188,0.24391177],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636203,0.00084926886,0.0002314974,0.0005825364,0.001460811,0.00051387434],"domain_scores_gemma":[0.9806877,0.0059822355,0.002278844,0.007012144,0.0023883218,0.0016507836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055163875,0.00062659685,0.0006155613,0.0006283937,0.0027249062,0.004535268,0.0018908333,0.0023494868,0.033217344],"category_scores_gemma":[0.032499574,0.0005527083,0.00058595,0.000924582,0.0028459611,0.008267738,0.0026285432,0.0040525054,0.017459769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002114853,0.00019655135,0.011090195,0.00075798476,0.00019460468,0.001388168,0.00287996,0.0032743146,0.009025794,0.18258226,0.42896107,0.35753435],"study_design_scores_gemma":[0.00012720446,0.00017293669,0.0042270776,0.00049140194,0.00010769942,0.0015577072,0.0013092203,0.0028971322,0.00694633,0.21124604,0.7707995,0.000117843534],"about_ca_topic_score_codex":0.0034671435,"about_ca_topic_score_gemma":0.0033257091,"teacher_disagreement_score":0.033217344,"about_ca_system_score_codex":0.0012464479,"about_ca_system_score_gemma":0.0015123665,"threshold_uncertainty_score":0.111123085},"labels":[],"label_agreement":null},{"id":"W4391363662","doi":"10.1007/978-3-031-38684-8_9","title":"Transactional Memory","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transactional memory; Psychology; Computer science; Programming language; Database transaction","score_opus":0.009131510963291605,"score_gpt":0.2061956870252761,"score_spread":0.1970641760619845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363662","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030841078,0.034993287,0.14366043,0.0025453318,0.00468308,0.00011769467,0.0009134794,0.0038596466,0.8061429],"genre_scores_gemma":[0.025008883,0.008520934,0.019977806,0.00071227935,0.00081883185,0.0000823027,0.0009247185,0.00073583936,0.9432184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997329,0.000026112062,0.000014596683,0.000057698806,0.00014361292,0.00002507994],"domain_scores_gemma":[0.999716,0.00005699159,0.000010606614,0.000108283035,0.00008586651,0.000022192984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029349118,0.0010339328,0.00058958324,0.00082624814,0.00081688364,0.0026990166,0.0012018289,0.00071238866,0.09479813],"category_scores_gemma":[0.0007525374,0.00054681674,0.0003195812,0.0018849263,0.00071342196,0.0034166004,0.0009829098,0.0016853663,0.04173488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078760226,0.00004545469,0.00008916553,0.00030100773,0.000017386077,0.00006492916,0.00021578297,0.0012813818,0.0060407207,0.24209285,0.27690744,0.4728651],"study_design_scores_gemma":[0.000010605341,0.000035596273,0.000114061666,0.000091434275,0.000014645326,0.00018708638,0.000046460354,0.002545911,0.0037494039,0.07217753,0.92101514,0.000012093214],"about_ca_topic_score_codex":0.0007030161,"about_ca_topic_score_gemma":0.001264849,"teacher_disagreement_score":0.09479813,"about_ca_system_score_codex":0.0006260763,"about_ca_system_score_gemma":0.00067107764,"threshold_uncertainty_score":0.31713134},"labels":[],"label_agreement":null},{"id":"W4391363688","doi":"10.1007/978-3-031-38684-8_6","title":"Read-Mostly Atomicity","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Atomicity; Computer science; Programming language; Database transaction","score_opus":0.010132795924285821,"score_gpt":0.2153723471756789,"score_spread":0.2052395512513931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363688","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054426154,0.0028426237,0.008430347,0.0033044347,0.003896029,0.000029485827,0.0002856035,0.0013884885,0.9792787],"genre_scores_gemma":[0.0053696274,0.0012114035,0.0015991365,0.0010306783,0.00093026116,0.000019845871,0.00021771342,0.00063879107,0.9889825],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997665,0.00002525121,0.000005622069,0.000051787618,0.000119127704,0.00003166722],"domain_scores_gemma":[0.99967945,0.000062865554,0.000011124635,0.000085893436,0.000104622806,0.000056063236],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029084025,0.0008468146,0.0005999334,0.00092568604,0.0012871092,0.002820151,0.00093487,0.0011568575,0.41855714],"category_scores_gemma":[0.0009038558,0.00057392614,0.00052380766,0.0008305728,0.0007034323,0.003980124,0.0019324751,0.0024661159,0.20945166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043707303,0.000038564096,0.00007657729,0.00018686842,0.0000074409736,0.000048602844,0.00015794112,0.00027526057,0.0021360072,0.1117626,0.7305246,0.15474188],"study_design_scores_gemma":[0.0000044563476,0.000010025692,0.00007737651,0.00004071037,0.0000029564976,0.000040954805,0.000035360274,0.00013526865,0.00051822286,0.018973777,0.9801564,0.0000043982004],"about_ca_topic_score_codex":0.0008560976,"about_ca_topic_score_gemma":0.002482462,"teacher_disagreement_score":0.41855714,"about_ca_system_score_codex":0.0011363854,"about_ca_system_score_gemma":0.0006808858,"threshold_uncertainty_score":0.8293577},"labels":[],"label_agreement":null},{"id":"W4391363696","doi":"10.1007/978-3-031-38684-8_8","title":"Nonblocking Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","score_opus":0.011278346854944107,"score_gpt":0.21974771990792966,"score_spread":0.20846937305298555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363696","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040304945,0.009090862,0.41670403,0.0011767962,0.0021435702,0.00009223249,0.00034767005,0.0018986859,0.5645157],"genre_scores_gemma":[0.08483302,0.009756522,0.16954808,0.0009623792,0.0012631104,0.00024390724,0.00120325,0.001432298,0.7307574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963224,0.00004337376,0.000014999322,0.00008095777,0.00019013422,0.000038173894],"domain_scores_gemma":[0.99965084,0.000114822855,0.00001381077,0.00009684078,0.00010076774,0.000022834172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003291621,0.0011495722,0.00052498904,0.00072408875,0.0008338769,0.0019058,0.000988176,0.00054724555,0.047601875],"category_scores_gemma":[0.0009865392,0.00050284236,0.00039679752,0.0012568047,0.00068085076,0.0023316836,0.0008339353,0.0020798102,0.016405355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007139648,0.00006461573,0.00008587594,0.00020020637,0.000016886204,0.000024753625,0.000108618966,0.0041029975,0.0047535165,0.56313187,0.09883422,0.328605],"study_design_scores_gemma":[0.000027906714,0.000043043336,0.00018806187,0.00009213358,0.000023630513,0.00012973008,0.00003573529,0.01999128,0.0055009886,0.48657483,0.48737484,0.000017769487],"about_ca_topic_score_codex":0.0006718413,"about_ca_topic_score_gemma":0.0011471704,"teacher_disagreement_score":0.047601875,"about_ca_system_score_codex":0.0010595229,"about_ca_system_score_gemma":0.0007415052,"threshold_uncertainty_score":0.15924412},"labels":[],"label_agreement":null},{"id":"W4391584754","doi":"10.1109/dessert61349.2023.10416491","title":"Protocol and Logical Models for Robustness and Survivability in Autonomous UAV Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Solana Networks (Canada)","funders":"","keywords":"Survivability; Robustness (evolution); Computer science; Distributed computing; Computer network","score_opus":0.060659205523167316,"score_gpt":0.30341430123714486,"score_spread":0.24275509571397755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391584754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112053435,0.0007039304,0.97021633,0.0014180965,0.00019205865,0.00012359506,0.00022496842,0.0002221798,0.015693424],"genre_scores_gemma":[0.7458702,0.0029385313,0.23014317,0.0006998887,0.00084084284,0.0014633044,0.00072118157,0.00015811421,0.017164793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795496,0.0007385218,0.0001803719,0.0002788092,0.000690509,0.0001568242],"domain_scores_gemma":[0.9956749,0.002634753,0.00053049374,0.0005662478,0.00047182955,0.00012179825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458862,0.00087548065,0.00048597253,0.0013488542,0.00083221274,0.0033630673,0.0016219914,0.0016105222,0.0033389789],"category_scores_gemma":[0.0076287114,0.00037777747,0.00088962173,0.0011305048,0.003359609,0.0056478474,0.0017597743,0.002316725,0.0007170216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020305162,0.000025017924,0.00012778814,0.000049693335,0.000010234624,0.00018437924,0.00017939633,0.04179166,0.0008883728,0.95212024,0.00058737455,0.0040156557],"study_design_scores_gemma":[0.000033854176,0.00006065591,0.000102007936,0.00004924368,0.00002341897,0.00015497777,0.00009952004,0.31340456,0.001140453,0.6745884,0.010317904,0.000025027724],"about_ca_topic_score_codex":0.0019554975,"about_ca_topic_score_gemma":0.0011973577,"teacher_disagreement_score":0.0033630673,"about_ca_system_score_codex":0.0015992472,"about_ca_system_score_gemma":0.0014046262,"threshold_uncertainty_score":0.013003826},"labels":[],"label_agreement":null},{"id":"W4391751948","doi":"10.26522/ssj.v18i1.3948","title":"Moving Together Towards Collective Access (Dispatch)","year":2024,"lang":"en","type":"article","venue":"Studies in Social Justice","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"RealNetworks (Canada); Carleton University; University of Toronto","funders":"","keywords":"Business; Economic system; Economics; Law and economics","score_opus":0.0716128314449852,"score_gpt":0.3957593359339415,"score_spread":0.3241465044889563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391751948","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021424696,0.0017931225,0.015009608,0.040274832,0.0043304437,0.00024278004,0.00024041378,0.00060453254,0.9160795],"genre_scores_gemma":[0.38402146,0.0018582181,0.014667501,0.0143004805,0.00126271,0.0006430953,0.00048403398,0.0007291241,0.58203334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99494153,0.0021522709,0.0001652534,0.00069188,0.00097650965,0.0010725607],"domain_scores_gemma":[0.9956571,0.00046393377,0.0002781847,0.00043750284,0.0005488421,0.0026144765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375248,0.00059235387,0.00029789368,0.0010729005,0.008956423,0.011010886,0.0013455112,0.0029326796,0.107465],"category_scores_gemma":[0.008134183,0.0003106558,0.00091049366,0.00075142557,0.005487468,0.010405098,0.024320157,0.0041915243,0.021006396],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005036744,0.00012548135,0.0023847756,0.00032553842,0.000030002808,0.00063903455,0.10425862,0.0001824669,0.0009966302,0.31745553,0.39071828,0.18283331],"study_design_scores_gemma":[0.0000053556887,0.000032193977,0.0008186592,0.00014001373,0.0000045688907,0.0001991333,0.018438857,0.00006330015,0.00009748989,0.020095224,0.9600941,0.000011053854],"about_ca_topic_score_codex":0.003754898,"about_ca_topic_score_gemma":0.006901965,"teacher_disagreement_score":0.107465,"about_ca_system_score_codex":0.003393429,"about_ca_system_score_gemma":0.0037455256,"threshold_uncertainty_score":0.35950625},"labels":[],"label_agreement":null},{"id":"W4391952977","doi":"10.1145/3627535.3638468","title":"OsirisBFT: Say No to Task Replication for Scalable Byzantine Fault Tolerant Analytics","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Fault tolerance; Distributed computing; Task (project management); Byzantine fault tolerance; Replication (statistics); Throughput; Semantics (computer science); Computation; Analytics; Parallel computing; Programming language; Operating system; Database","score_opus":0.017196865295115205,"score_gpt":0.2832228909545464,"score_spread":0.2660260256594312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066088125,0.0007958392,0.85980284,0.0006191984,0.00039703184,0.00030850735,0.0005299448,0.06506731,0.0063912],"genre_scores_gemma":[0.73343223,0.00026056875,0.2560193,0.00046931725,0.00014571426,0.00023592332,0.0014206906,0.0024955056,0.0055206143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984005,0.00036575733,0.000117979616,0.00038453363,0.0005349273,0.00019635244],"domain_scores_gemma":[0.9959091,0.00074351643,0.00040964055,0.0022525545,0.00046857834,0.0002166115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017864421,0.0010190367,0.0008434858,0.00054507167,0.00085194863,0.0015582779,0.0023297465,0.0008345696,0.004389272],"category_scores_gemma":[0.0059046173,0.0004222973,0.0005985692,0.00035006212,0.0012867992,0.0031057838,0.002414664,0.0016981628,0.0015101942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004662217,0.0005918487,0.007106321,0.0011241485,0.00031538453,0.0011403604,0.0011935201,0.15384482,0.19659671,0.07437725,0.061322145,0.49772528],"study_design_scores_gemma":[0.00040665452,0.00077828515,0.0011546413,0.00008215552,0.00009127203,0.0005102196,0.0001317001,0.794672,0.11114871,0.04703663,0.043873157,0.00011462869],"about_ca_topic_score_codex":0.0017592299,"about_ca_topic_score_gemma":0.0021204625,"teacher_disagreement_score":0.004389272,"about_ca_system_score_codex":0.000754144,"about_ca_system_score_gemma":0.0018639367,"threshold_uncertainty_score":0.014683604},"labels":[],"label_agreement":null},{"id":"W4392017467","doi":"10.1007/978-3-031-50733-5_5","title":"Sharding Distributed Replication Systems to Improve Scalability and Throughput","year":2023,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Replication (statistics); Scalability; Throughput; Computer science; Distributed computing; Parallel computing; Computer network; Biology; Operating system; Virology","score_opus":0.023069864093487352,"score_gpt":0.26317292312714513,"score_spread":0.24010305903365778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392017467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048521895,0.00692401,0.88347214,0.0011094868,0.0013863283,0.00016832896,0.00027116714,0.009743634,0.04840293],"genre_scores_gemma":[0.4731403,0.0045941886,0.42456356,0.0004802486,0.00091455487,0.00028726278,0.001014052,0.0017851349,0.09322074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970347,0.000049216575,0.000015095651,0.00004003592,0.00015317538,0.00003899386],"domain_scores_gemma":[0.9991903,0.000313228,0.000028428614,0.0002746514,0.0001652213,0.000028139057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006577765,0.0004584573,0.00050288456,0.00047758088,0.00042006595,0.0011065402,0.0012346908,0.00048642943,0.008921341],"category_scores_gemma":[0.0015254645,0.00039386944,0.00031881948,0.0012596552,0.00032025462,0.0018995942,0.000846694,0.0011891078,0.0018941675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021563486,0.00020398306,0.00061645417,0.0003525799,0.000056706263,0.000134503,0.00029351158,0.059013136,0.0577952,0.0893645,0.055424903,0.7365288],"study_design_scores_gemma":[0.00016563997,0.00032484403,0.0011777191,0.00012236867,0.00011823099,0.00044188352,0.00014420725,0.6638379,0.07725601,0.10943147,0.14692134,0.00005826716],"about_ca_topic_score_codex":0.00059760385,"about_ca_topic_score_gemma":0.000903976,"teacher_disagreement_score":0.008921341,"about_ca_system_score_codex":0.0004934843,"about_ca_system_score_gemma":0.00047934157,"threshold_uncertainty_score":0.02984488},"labels":[],"label_agreement":null},{"id":"W4392943755","doi":"10.1109/cac59555.2023.10451590","title":"Resilient Consensus of Multi-Agent Systems on Time-Varying Directed Graphs Under Byzantine Attacks and Actuation Attacks","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Byzantine architecture; Byzantine fault tolerance; Computer security; Distributed computing; Multi-agent system; Computer network; Artificial intelligence; Fault tolerance; History","score_opus":0.033728074685377356,"score_gpt":0.28401787289221453,"score_spread":0.25028979820683717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392943755","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10555175,0.00018577956,0.8916829,0.00024110173,0.000040377116,0.000048312133,0.00004726338,0.00022993916,0.0019724777],"genre_scores_gemma":[0.98090476,0.00024715572,0.017449258,0.000040602477,0.00002063015,0.00005760372,0.00004964975,0.000020584084,0.001209836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916327,0.00027545897,0.00004974258,0.00022869586,0.0001872284,0.00009555727],"domain_scores_gemma":[0.9982169,0.0009551854,0.00041536253,0.00014796112,0.0001943666,0.00007011514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893549,0.00081847043,0.00066698604,0.00065178546,0.00045559896,0.0008927453,0.00080758904,0.00075493247,0.0006020373],"category_scores_gemma":[0.0047481596,0.0002103505,0.0005506444,0.0005026524,0.0010911018,0.0011918339,0.0009991255,0.0007571266,0.00011973779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091915455,0.000015804655,0.0003919795,0.00008198397,0.000048343794,0.0002540904,0.00014487027,0.9410542,0.009160297,0.035589974,0.0002538153,0.012912645],"study_design_scores_gemma":[0.000009520177,0.000041373845,0.00012498182,0.000004024382,0.000011852957,0.00003208213,0.000027669927,0.9836692,0.0015842506,0.014218274,0.00026995866,0.0000067179853],"about_ca_topic_score_codex":0.0020743387,"about_ca_topic_score_gemma":0.00097333745,"teacher_disagreement_score":0.0020743387,"about_ca_system_score_codex":0.0008188991,"about_ca_system_score_gemma":0.00059631513,"threshold_uncertainty_score":0.00594151},"labels":[],"label_agreement":null},{"id":"W4393062746","doi":"10.1109/gcwkshps58843.2023.10464953","title":"Efficient and Resilient Data Synchronization with Timestamp Compression in IoT Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Timestamp; Computer science; Synchronization (alternating current); Internet of Things; Data compression; Data synchronization; Real-time computing; Embedded system; Computer network; Wireless sensor network; Artificial intelligence","score_opus":0.020958354444295703,"score_gpt":0.255436329725591,"score_spread":0.2344779752812953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393062746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07940993,0.0010285968,0.9170495,0.00015858434,0.00014184897,0.00009395865,0.0000724062,0.0008584917,0.0011867144],"genre_scores_gemma":[0.9094974,0.00044281478,0.089116864,0.000053790885,0.000100505626,0.00007701127,0.000108273605,0.000027082317,0.0005764009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909294,0.00015839883,0.00011409409,0.00017013837,0.00039080266,0.00007363308],"domain_scores_gemma":[0.9984865,0.00044371877,0.00038050063,0.00036464748,0.0002656487,0.00005890592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796222,0.00047151826,0.0005496748,0.00083401514,0.00066459365,0.00060634554,0.00078258856,0.0004298677,0.00041837632],"category_scores_gemma":[0.003978822,0.00018269746,0.00022512466,0.0013658721,0.00049419585,0.0016118905,0.0010566717,0.00053596107,0.00011568634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010364627,0.00014701743,0.0050498857,0.0003668039,0.00008201629,0.0005808135,0.0007863478,0.4355396,0.0920144,0.041468512,0.0024578408,0.42047033],"study_design_scores_gemma":[0.000053048716,0.00027204506,0.0009741012,0.00003756974,0.000046335044,0.00026896616,0.00010520348,0.945446,0.040303364,0.008552338,0.0039022863,0.00003875187],"about_ca_topic_score_codex":0.0011085559,"about_ca_topic_score_gemma":0.000866101,"teacher_disagreement_score":0.0011085559,"about_ca_system_score_codex":0.0004472564,"about_ca_system_score_gemma":0.0007378718,"threshold_uncertainty_score":0.005180776},"labels":[],"label_agreement":null},{"id":"W4395480543","doi":"10.18280/isi.290219","title":"Self-Stabilizing Algorithms for Computing Maximal Distance-2 Independent Sets and Minimal Dominating Sets in Networks","year":2024,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.013727077632317303,"score_gpt":0.2547370607647136,"score_spread":0.24100998313239627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395480543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010451253,0.00008134722,0.98814744,0.00005802374,0.000014210571,0.000027959506,0.0000095734285,0.00013254725,0.0010776103],"genre_scores_gemma":[0.5465457,0.0002597716,0.44984382,0.00011306612,0.00005632563,0.0002454339,0.00010292234,0.00011368675,0.0027193176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920195,0.00028693222,0.000041962605,0.00014541128,0.00025157377,0.00007225521],"domain_scores_gemma":[0.9982408,0.0010766686,0.00017788996,0.00016824415,0.0002817828,0.00005453479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556087,0.00085636525,0.00063903484,0.00090651907,0.00051801774,0.0009258245,0.0014453572,0.0006870542,0.0008747389],"category_scores_gemma":[0.005176959,0.0003520447,0.00050524244,0.0007736444,0.0010457649,0.001308572,0.0013802798,0.0010036415,0.00031777588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005219671,0.00004349552,0.0003638988,0.00005768042,0.000026281221,0.00003433138,0.00014683462,0.8712036,0.004657694,0.07197938,0.0007126563,0.050722025],"study_design_scores_gemma":[0.000009043404,0.000023891727,0.00003417971,0.000004541623,0.0000036615468,0.0000136130575,0.000010898008,0.9754322,0.0014413882,0.022586094,0.0004355258,0.00000499772],"about_ca_topic_score_codex":0.0009347653,"about_ca_topic_score_gemma":0.0010795951,"teacher_disagreement_score":0.001556087,"about_ca_system_score_codex":0.0012374041,"about_ca_system_score_gemma":0.000978626,"threshold_uncertainty_score":0.008978069},"labels":[],"label_agreement":null},{"id":"W4396574656","doi":"10.3390/blockchains2020007","title":"Performance of PBFT Consensus under Voting by Groups","year":2024,"lang":"en","type":"article","venue":"Blockchains","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Voting; Computer science; Political science; Law","score_opus":0.010842686335215854,"score_gpt":0.23006629636959577,"score_spread":0.21922361003437993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396574656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9375764,0.00045448897,0.0533803,0.0003666374,0.00009336858,0.000110090645,0.00015494946,0.001267413,0.006596415],"genre_scores_gemma":[0.9941684,0.000046802903,0.004800204,0.000017004175,0.000009780175,0.000032574913,0.00010299984,0.00003363264,0.0007886272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944787,0.0016426848,0.00028395082,0.00067033514,0.0015542826,0.0013699972],"domain_scores_gemma":[0.97024655,0.018890528,0.0019358089,0.0039490727,0.0034120898,0.0015659445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058914847,0.0006510479,0.0018365084,0.00074449426,0.0012908606,0.0014823568,0.0013668174,0.0015881473,0.003856543],"category_scores_gemma":[0.024014361,0.0002769373,0.0002912301,0.0009656533,0.001420443,0.0021979567,0.0021985874,0.0010791287,0.0006073279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007548545,0.00040804653,0.005739274,0.00027647897,0.00010879383,0.00020261883,0.0004699763,0.88072526,0.024650723,0.010428915,0.0024935263,0.06694788],"study_design_scores_gemma":[0.00017755314,0.000707416,0.0008621482,0.00001116586,0.000017183283,0.00004966731,0.0001189453,0.98205966,0.010687227,0.0048804027,0.0004090943,0.000019543988],"about_ca_topic_score_codex":0.005206603,"about_ca_topic_score_gemma":0.0018214588,"teacher_disagreement_score":0.0058914847,"about_ca_system_score_codex":0.0014085773,"about_ca_system_score_gemma":0.0026212228,"threshold_uncertainty_score":0.031157553},"labels":[],"label_agreement":null},{"id":"W4399345889","doi":"10.1145/3626183.3660272","title":"Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Lock (firearm); Parallel computing; Operating system; Engineering","score_opus":0.010309858137346663,"score_gpt":0.23375337624675768,"score_spread":0.22344351810941102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399345889","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084338605,0.008462543,0.80717325,0.0064271754,0.00540473,0.0010256937,0.003157266,0.060144458,0.023866251],"genre_scores_gemma":[0.39206105,0.0027116248,0.5030938,0.0028388735,0.0017345388,0.00047377686,0.015290101,0.0027940243,0.07900229],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894863,0.0001251437,0.000055470624,0.00018534911,0.0005350963,0.0001503345],"domain_scores_gemma":[0.99719244,0.0005508526,0.00019637741,0.00050208374,0.0010861165,0.00047206672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621608,0.00059714384,0.00042449633,0.0008454343,0.0006218244,0.0018681457,0.0021993795,0.0007942705,0.014211999],"category_scores_gemma":[0.0037730378,0.00035064144,0.00039234478,0.0009722211,0.0005921368,0.0028925957,0.0014659704,0.0011651004,0.0044010174],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019225478,0.00036704296,0.003321146,0.0010056312,0.00010059932,0.00072056265,0.00034432227,0.011227836,0.073531464,0.02179908,0.18411636,0.7015435],"study_design_scores_gemma":[0.0011480582,0.0031270287,0.0028735236,0.00017018702,0.000218807,0.0011172328,0.00038552276,0.24199009,0.13534805,0.018693548,0.59462637,0.0003016201],"about_ca_topic_score_codex":0.0016198085,"about_ca_topic_score_gemma":0.0018556418,"teacher_disagreement_score":0.014211999,"about_ca_system_score_codex":0.00073549926,"about_ca_system_score_gemma":0.0016192278,"threshold_uncertainty_score":0.047543943},"labels":[],"label_agreement":null},{"id":"W4399376711","doi":"10.1145/3662158.3662828","title":"Faster Randomized Repeated Choice and DCAS","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche; University of Calgary","keywords":"Computer science","score_opus":0.009306835057583944,"score_gpt":0.2476387252065518,"score_spread":0.23833189014896786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399376711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057898246,0.0018130607,0.90175194,0.0014150623,0.0007031321,0.00083724456,0.00067450834,0.014742422,0.020164274],"genre_scores_gemma":[0.5186961,0.0003166818,0.45857355,0.0008511507,0.00024933,0.00087931135,0.00091611495,0.0010551581,0.018462569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99163836,0.0020160978,0.0004180911,0.002096807,0.0025384738,0.0012920843],"domain_scores_gemma":[0.9885599,0.003835459,0.00076804776,0.004994426,0.0013731149,0.00046911958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004113432,0.0012954441,0.0025232646,0.0012610075,0.0017519488,0.002983592,0.004776489,0.0018067136,0.015469862],"category_scores_gemma":[0.012529737,0.0009158066,0.0015441205,0.0025591627,0.0024646418,0.0064082495,0.0048578046,0.0032566013,0.00399485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005666138,0.00097143766,0.0020815574,0.000721003,0.0003225772,0.0002846567,0.00047399587,0.15248117,0.02782569,0.43984494,0.03418573,0.3351411],"study_design_scores_gemma":[0.0011730656,0.0006943181,0.00045269032,0.000075263764,0.00015125806,0.00028641144,0.00008206161,0.752401,0.027378615,0.18225232,0.0349151,0.00013793694],"about_ca_topic_score_codex":0.004879104,"about_ca_topic_score_gemma":0.0047914023,"teacher_disagreement_score":0.015469862,"about_ca_system_score_codex":0.0039629177,"about_ca_system_score_gemma":0.005611795,"threshold_uncertainty_score":0.051751792},"labels":[],"label_agreement":null},{"id":"W4399377352","doi":"10.1145/3662158.3662775","title":"Determining Recoverable Consensus Numbers","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Environmental science","score_opus":0.011835710610757602,"score_gpt":0.2484293955871906,"score_spread":0.236593684976433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399377352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2743997,0.0004154352,0.701977,0.00066809607,0.00009554326,0.0003309401,0.0009321912,0.0018723357,0.019308694],"genre_scores_gemma":[0.8211885,0.0002623133,0.17155497,0.00021237877,0.0000915803,0.00045874383,0.0012263766,0.0004011235,0.0046039047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99351937,0.0008794738,0.0005241116,0.0016724477,0.0024572758,0.00094733434],"domain_scores_gemma":[0.94519377,0.03196732,0.0053258156,0.007988237,0.007588328,0.0019363996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048308056,0.00080033444,0.0010303461,0.0030583325,0.0012858539,0.002373386,0.0030792286,0.0018015149,0.006303211],"category_scores_gemma":[0.05597129,0.00076194963,0.0012555514,0.0011652664,0.0032103336,0.0063379603,0.0032795772,0.0026858477,0.0012871375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071444665,0.00018948833,0.010488759,0.0006980962,0.00016188061,0.0006816878,0.0016215093,0.35723954,0.053692497,0.4639197,0.006444229,0.104148224],"study_design_scores_gemma":[0.000071796865,0.00023426439,0.0018539097,0.00009424946,0.000056962203,0.0003052023,0.00034433487,0.60908705,0.033881355,0.34822717,0.005721575,0.00012220003],"about_ca_topic_score_codex":0.0009501907,"about_ca_topic_score_gemma":0.0008706466,"teacher_disagreement_score":0.006303211,"about_ca_system_score_codex":0.0023465,"about_ca_system_score_gemma":0.001658474,"threshold_uncertainty_score":0.02554804},"labels":[],"label_agreement":null},{"id":"W4399379978","doi":"10.1117/12.3013314","title":"Networked control systems and their applications to smart satellites: a survey","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Control (management); Artificial intelligence","score_opus":0.020005184742170747,"score_gpt":0.2514781745446112,"score_spread":0.23147298980244044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399379978","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018001116,0.9522482,0.025233874,0.001031946,0.00065426796,0.00004389614,0.000077559765,0.00007349243,0.018836612],"genre_scores_gemma":[0.013409805,0.97058266,0.009281987,0.0004895534,0.0013381813,0.00005344385,0.00013707549,0.000019404799,0.0046878587],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995964,0.00007403735,0.000050537692,0.00008266153,0.00017355401,0.000022928156],"domain_scores_gemma":[0.9994253,0.00035221557,0.000039072038,0.00002993484,0.00013253167,0.00002100983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004508413,0.0008455173,0.0008414665,0.002035307,0.00039340978,0.001304211,0.00074949145,0.001381912,0.004359732],"category_scores_gemma":[0.00091211253,0.0004826468,0.0005270216,0.0030808672,0.0006452995,0.0017633615,0.0007505929,0.0015669812,0.0014874033],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106087,0.00014850935,0.0012992962,0.008272069,0.00009229434,0.00031095056,0.0003232226,0.011740722,0.0019171541,0.07437956,0.023891676,0.87755346],"study_design_scores_gemma":[0.000014608301,0.00024667292,0.0022517515,0.0036141432,0.00007298232,0.0010599329,0.000304941,0.016312469,0.0008793351,0.04877265,0.9263937,0.00007684577],"about_ca_topic_score_codex":0.0019651114,"about_ca_topic_score_gemma":0.0016876969,"teacher_disagreement_score":0.004359732,"about_ca_system_score_codex":0.00045967364,"about_ca_system_score_gemma":0.000711552,"threshold_uncertainty_score":0.01458472},"labels":[],"label_agreement":null},{"id":"W4399383464","doi":"10.1007/s00446-024-00465-5","title":"On implementing SWMR registers from SWSR registers in systems with Byzantine failures","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Byzantine architecture; Computer science; Byzantine fault tolerance; Operating system; History; Archaeology; Fault tolerance","score_opus":0.01023162103595374,"score_gpt":0.24413851145048826,"score_spread":0.23390689041453452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399383464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24994107,0.0014210568,0.72065717,0.00095969567,0.0002713551,0.00027301817,0.00010381548,0.0077339807,0.01863889],"genre_scores_gemma":[0.75745654,0.0005918786,0.23014261,0.00030324532,0.00007909103,0.00014534309,0.00016159902,0.0005250567,0.010594567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987876,0.00045850463,0.000082110615,0.00010290201,0.00031976562,0.00024907955],"domain_scores_gemma":[0.9975017,0.0010555724,0.00019617342,0.0008430321,0.00036074006,0.00004270549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014150686,0.00066023757,0.0006378544,0.00066520384,0.0009926212,0.0017402207,0.0017357575,0.0008239214,0.0061673573],"category_scores_gemma":[0.004823611,0.00046266578,0.000522677,0.0007059877,0.0010614131,0.0045980606,0.0015839739,0.0011053565,0.0009592847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027663882,0.00025894213,0.0037672534,0.0011289119,0.00014680153,0.00052170444,0.0018349519,0.10240627,0.07734555,0.2170973,0.00944026,0.5832856],"study_design_scores_gemma":[0.00047562446,0.0019811082,0.0017219243,0.00042123286,0.00037681838,0.0006683384,0.0009944357,0.57909065,0.24700767,0.11285645,0.054239143,0.00016650432],"about_ca_topic_score_codex":0.0026566503,"about_ca_topic_score_gemma":0.0060171583,"teacher_disagreement_score":0.0061673573,"about_ca_system_score_codex":0.0007046124,"about_ca_system_score_gemma":0.0010764119,"threshold_uncertainty_score":0.02063185},"labels":[],"label_agreement":null},{"id":"W4399449107","doi":"10.1145/3662158.3664932","title":"Keynote: Time is not a Healer: Before and After","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.0051895983670460525,"score_gpt":0.22350664977418272,"score_spread":0.21831705140713667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399449107","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062746654,0.013975749,0.0033314533,0.48266268,0.40184638,0.000036542475,0.0005005505,0.00025529318,0.09676385],"genre_scores_gemma":[0.045079723,0.017911108,0.0024873985,0.3017208,0.24407221,0.0001305669,0.00064833445,0.00084505585,0.38710484],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986879,0.0003061004,0.00010347469,0.00045039438,0.00032215906,0.00012994945],"domain_scores_gemma":[0.9951131,0.0021688128,0.0002314223,0.00033955358,0.0015250992,0.0006221129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177294,0.0010734679,0.00094631704,0.0007793995,0.0033946729,0.0039051624,0.0011122756,0.0049442803,0.09712733],"category_scores_gemma":[0.009254687,0.00030337807,0.0006293527,0.0010619345,0.0023456216,0.007281515,0.0018093677,0.010730595,0.045940153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074882926,0.00001187852,0.00007942941,0.00009753971,0.0000064143883,0.00007472455,0.000116668634,0.0000406537,0.0001619748,0.028789466,0.9572816,0.013264761],"study_design_scores_gemma":[0.000015027903,0.000024086243,0.00024774877,0.00012820019,0.000008651198,0.00015077525,0.0001253735,0.00010518713,0.00014298956,0.017184213,0.9818538,0.000013941245],"about_ca_topic_score_codex":0.0029798255,"about_ca_topic_score_gemma":0.0024920544,"teacher_disagreement_score":0.09712733,"about_ca_system_score_codex":0.0022424157,"about_ca_system_score_gemma":0.0011723171,"threshold_uncertainty_score":0.32492328},"labels":[],"label_agreement":null},{"id":"W4399449859","doi":"10.1145/3662158.3662800","title":"Strongly Linearizable LL/SC from CAS","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Programming language; Political science","score_opus":0.01128452803611121,"score_gpt":0.2445386356533647,"score_spread":0.2332541076172535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399449859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036585767,0.00016979806,0.91788703,0.00026104905,0.00006432932,0.00015858271,0.0002935138,0.034161136,0.010418852],"genre_scores_gemma":[0.4973001,0.000117272175,0.48452213,0.00040674332,0.00008183201,0.00035592983,0.0013227261,0.0021781838,0.013715038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855894,0.00016852375,0.00009045175,0.00030636578,0.00051341165,0.00036224583],"domain_scores_gemma":[0.99746263,0.0007446258,0.00023283131,0.00097155455,0.00045543877,0.00013288324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006859821,0.001034081,0.00059081655,0.0007265637,0.00071063347,0.0016351779,0.0028381892,0.00072031445,0.012858239],"category_scores_gemma":[0.0024309335,0.00056288106,0.00063337316,0.0013407021,0.001619854,0.003033895,0.0027989165,0.0020231775,0.0035223474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024674041,0.0006928062,0.002386925,0.0008013755,0.00007394,0.00029657513,0.00075158523,0.088943765,0.1231674,0.14787082,0.03345844,0.5990889],"study_design_scores_gemma":[0.00042915862,0.00044834614,0.00056856533,0.000072492425,0.000081833175,0.00019780232,0.00013712358,0.6695024,0.18260801,0.11986493,0.025991807,0.00009747705],"about_ca_topic_score_codex":0.006324485,"about_ca_topic_score_gemma":0.0056007365,"teacher_disagreement_score":0.012858239,"about_ca_system_score_codex":0.0018554069,"about_ca_system_score_gemma":0.002750944,"threshold_uncertainty_score":0.043015122},"labels":[],"label_agreement":null},{"id":"W4399853700","doi":"10.1145/3663338.3665830","title":"The Illusive Failure-Atomic Double-Width Compare-And-Swap","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Atomicity; Computer science; Byte; Swap (finance); Parallel computing; Operating system; Programming language; Database transaction","score_opus":0.010170085604519118,"score_gpt":0.24358380284052944,"score_spread":0.23341371723601032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399853700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042616747,0.0019402484,0.9297841,0.0026992497,0.00062313117,0.00014253416,0.000112202775,0.0031457483,0.018936126],"genre_scores_gemma":[0.7330669,0.0014040923,0.25532392,0.0016132077,0.00039636172,0.00026035242,0.00013573201,0.00061896915,0.007180445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932596,0.0014487428,0.00036594443,0.000835123,0.00345923,0.0006312996],"domain_scores_gemma":[0.9804638,0.0074148276,0.0014611011,0.008659297,0.0017111155,0.00028978704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060555753,0.00059063244,0.00079738995,0.001008003,0.001989647,0.002894267,0.0043797703,0.0015238589,0.0033091216],"category_scores_gemma":[0.021168722,0.0008024467,0.00057495304,0.0009542756,0.007273226,0.008605599,0.0037137065,0.0037867704,0.0011745145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000495738,0.00006873304,0.0031733906,0.00039958087,0.000056342924,0.00026106823,0.0010432904,0.014554421,0.009616156,0.8177687,0.008578932,0.14398374],"study_design_scores_gemma":[0.00015272664,0.00052540813,0.0007188391,0.00027998484,0.00012727646,0.0012394992,0.0004309634,0.16389117,0.065672815,0.6578454,0.108965576,0.0001503478],"about_ca_topic_score_codex":0.0012476613,"about_ca_topic_score_gemma":0.0012382286,"teacher_disagreement_score":0.0060555753,"about_ca_system_score_codex":0.0012599396,"about_ca_system_score_gemma":0.0026346857,"threshold_uncertainty_score":0.032025337},"labels":[],"label_agreement":null},{"id":"W4399854476","doi":"10.1145/3663338.3665832","title":"Snapshotting Mechanisms for Persistent Memory-Mapped Files","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reliability (semiconductor); Vulnerability (computing); Relation (database); Reliability engineering; Computer security; Embedded system; Database; Engineering","score_opus":0.018380577498246203,"score_gpt":0.24938686995261525,"score_spread":0.23100629245436904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399854476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19600844,0.0022261224,0.7808835,0.00055831304,0.000280735,0.00021042109,0.00025909426,0.013464709,0.0061086738],"genre_scores_gemma":[0.8521752,0.00088631484,0.13940209,0.00013424993,0.00020542892,0.0001712948,0.00023551416,0.00045008038,0.0063398154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00014665099,0.00007276829,0.00009778867,0.00029113426,0.0001346762],"domain_scores_gemma":[0.9914743,0.0030151706,0.0006448031,0.0037642592,0.00084161165,0.0002597988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017508051,0.00040270074,0.00056504755,0.0011684435,0.0011213917,0.002079656,0.0022034927,0.00066502544,0.0033261816],"category_scores_gemma":[0.007831939,0.00040620466,0.00032775267,0.0010263842,0.00094220875,0.004787811,0.0021888067,0.0011121518,0.0004227792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002278664,0.00047115382,0.010934114,0.0009020894,0.00017997871,0.0012105478,0.0033690655,0.04121554,0.118610635,0.26606798,0.013563606,0.5411967],"study_design_scores_gemma":[0.00048547558,0.0012612548,0.0063905003,0.00028770254,0.00037924328,0.001778366,0.0010076762,0.51700085,0.28879714,0.11723038,0.06509638,0.000285008],"about_ca_topic_score_codex":0.0009588636,"about_ca_topic_score_gemma":0.0014575043,"teacher_disagreement_score":0.0033261816,"about_ca_system_score_codex":0.0005849439,"about_ca_system_score_gemma":0.00059835246,"threshold_uncertainty_score":0.011127174},"labels":[],"label_agreement":null},{"id":"W4400277818","doi":"10.1109/wcnc57260.2024.10571170","title":"An Approach to Asynchronous Unsourced Random Access (URA)","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Ciena (Canada)","funders":"","keywords":"Asynchronous communication; Computer science; Random access; Computer network","score_opus":0.018889949405117314,"score_gpt":0.2905467522620763,"score_spread":0.27165680285695903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400277818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003022783,0.00010095482,0.99489826,0.00005492929,0.00005649836,0.000046320612,0.000014189976,0.00032508065,0.0014809624],"genre_scores_gemma":[0.31495166,0.00033249878,0.67680854,0.0003595176,0.0003388935,0.00035544502,0.00010233936,0.00013553794,0.0066155586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726284,0.0010799976,0.00015577326,0.00051830837,0.0007963244,0.00018689368],"domain_scores_gemma":[0.9970919,0.00087812,0.00031276373,0.0009863793,0.00060915225,0.00012172733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015645385,0.0006295917,0.0006118209,0.00071809476,0.0007021493,0.0013893084,0.0021027485,0.0008255702,0.0025954884],"category_scores_gemma":[0.0038086658,0.00034983727,0.0006578298,0.00050474686,0.0009574768,0.001855557,0.0018083792,0.0014355272,0.0014823998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006135282,0.00029857497,0.0014115712,0.00043310274,0.00014333286,0.0005755529,0.00062132,0.08817647,0.09039328,0.5351726,0.005252074,0.27690867],"study_design_scores_gemma":[0.00011016137,0.0005590061,0.00037906022,0.000054991062,0.00008436447,0.0011834623,0.000075900185,0.8476312,0.032132816,0.079458654,0.03824543,0.00008500628],"about_ca_topic_score_codex":0.0003417204,"about_ca_topic_score_gemma":0.0003559086,"teacher_disagreement_score":0.0025954884,"about_ca_system_score_codex":0.00045200402,"about_ca_system_score_gemma":0.0007063615,"threshold_uncertainty_score":0.008682787},"labels":[],"label_agreement":null},{"id":"W4400422050","doi":"10.1145/3669989","title":"First-Come-First-Served as a Separate Principle","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","score_opus":0.02337878390958066,"score_gpt":0.29122242396082465,"score_spread":0.267843640051244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400422050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074875816,0.00029157812,0.9712828,0.00059836847,0.00032479252,0.00029502754,0.00012532464,0.003601486,0.015993139],"genre_scores_gemma":[0.24972124,0.00047995837,0.70953393,0.0009966474,0.00032692135,0.0006502333,0.0003548965,0.0020519376,0.035884287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945904,0.0008055785,0.00034570514,0.0011769123,0.0025495172,0.0005318933],"domain_scores_gemma":[0.99302214,0.001956225,0.00040098323,0.0028677525,0.0014836898,0.0002692295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036840898,0.0009438152,0.00079605076,0.00097631925,0.001593579,0.0041936645,0.0029271506,0.0015131594,0.009267497],"category_scores_gemma":[0.010184953,0.00077778724,0.001309277,0.0007746499,0.004033491,0.0052540596,0.0029664102,0.004436599,0.0039561964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044666423,0.00018324824,0.0008598511,0.00037748733,0.000058535756,0.00038287064,0.0009462431,0.01515073,0.019417135,0.83157474,0.009577423,0.12102511],"study_design_scores_gemma":[0.0003021715,0.000440203,0.0003885565,0.0002073434,0.00015415729,0.0012023681,0.00023736879,0.16526437,0.085795894,0.46799886,0.27785885,0.00014988105],"about_ca_topic_score_codex":0.002354263,"about_ca_topic_score_gemma":0.001856367,"teacher_disagreement_score":0.009267497,"about_ca_system_score_codex":0.0016257084,"about_ca_system_score_gemma":0.004258813,"threshold_uncertainty_score":0.03100288},"labels":[],"label_agreement":null},{"id":"W4400591932","doi":"10.1007/s00224-024-10184-w","title":"Lower Bounds on the Amortized Time Complexity of Shared Objects","year":2024,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Amortized analysis; Computer science; Mathematics; Combinatorics; Data structure; Programming language","score_opus":0.03001749341853861,"score_gpt":0.25481502861153876,"score_spread":0.22479753519300016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400591932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22334899,0.017796624,0.6107262,0.02447578,0.0024358402,0.000423039,0.004505029,0.004936563,0.11135194],"genre_scores_gemma":[0.8123615,0.005793619,0.13891128,0.003209099,0.0040205503,0.0010902027,0.003410448,0.003748371,0.02745489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98759705,0.0025849054,0.0005972164,0.0016664475,0.0040687397,0.00348551],"domain_scores_gemma":[0.8841413,0.09188444,0.0029015555,0.012681634,0.004369714,0.0040212944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008401525,0.004280659,0.0034986576,0.0050250962,0.003585592,0.011226429,0.009267488,0.0046945116,0.02135277],"category_scores_gemma":[0.05842335,0.001734668,0.0033587054,0.0065746526,0.005534931,0.023216965,0.008297666,0.011017108,0.0030094904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004240251,0.0010057313,0.005305075,0.0015667393,0.0005740141,0.00045547515,0.0011092001,0.28447026,0.018951809,0.5336893,0.044027843,0.1046044],"study_design_scores_gemma":[0.00018350317,0.00019021191,0.0016497168,0.00018057744,0.0002046427,0.00025410912,0.00019118797,0.5481767,0.0041952613,0.43799734,0.006689549,0.00008720103],"about_ca_topic_score_codex":0.0043655955,"about_ca_topic_score_gemma":0.005058138,"teacher_disagreement_score":0.02135277,"about_ca_system_score_codex":0.010392026,"about_ca_system_score_gemma":0.0061659203,"threshold_uncertainty_score":0.07539976},"labels":[],"label_agreement":null},{"id":"W4400909546","doi":"10.1109/icde60146.2024.00199","title":"Positive Communities on Signed Graphs That Are Not Echo Chambers: A Clique-Based Approach","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Clique; Echo (communications protocol); Computer science; Computer network; Mathematics; Combinatorics","score_opus":0.03518798706925596,"score_gpt":0.2529989110942543,"score_spread":0.21781092402499835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022850845,0.0005473833,0.96653193,0.00091869425,0.000072962095,0.0003007869,0.000333097,0.00029013475,0.008154174],"genre_scores_gemma":[0.36274967,0.0008695791,0.61938846,0.00052670354,0.0005122318,0.0005995654,0.0016784577,0.00040755316,0.013267904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943018,0.002904376,0.00020682708,0.0012654267,0.0009456324,0.0003759336],"domain_scores_gemma":[0.97843057,0.014014392,0.0015940756,0.0025428932,0.0020151616,0.0014028767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004846596,0.0012055398,0.0018678922,0.004486623,0.0032049518,0.005061924,0.0041578407,0.003561795,0.0066061867],"category_scores_gemma":[0.020994376,0.0013337123,0.00286863,0.003438558,0.0041399184,0.009253593,0.0050755492,0.002935753,0.0013888195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001867637,0.00020671655,0.0032920262,0.00051535346,0.00021270543,0.0007769608,0.0017318046,0.090971425,0.0028376158,0.83199483,0.008015149,0.059258636],"study_design_scores_gemma":[0.000056399153,0.00006553782,0.00082359934,0.0001097149,0.000100173595,0.00038718033,0.0006677934,0.5051776,0.000849913,0.47958764,0.012110613,0.0000637622],"about_ca_topic_score_codex":0.0052240887,"about_ca_topic_score_gemma":0.007842628,"teacher_disagreement_score":0.0066061867,"about_ca_system_score_codex":0.002292363,"about_ca_system_score_gemma":0.001638225,"threshold_uncertainty_score":0.025631607},"labels":[],"label_agreement":null},{"id":"W4401243921","doi":"10.1117/12.3025768","title":"QEYSSat: Canada’s first quantum communication satellite","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum information science; Quantum channel; Quantum network; Communications satellite; Satellite; Quantum technology; Quantum key distribution; Quantum computer; Quantum sensor; Quantum; Quantum metrology; Quantum information; Telecommunications; Quantum entanglement; Physics; Open quantum system; Engineering; Aerospace engineering; Quantum mechanics","score_opus":0.008361696942784028,"score_gpt":0.2114960583730773,"score_spread":0.2031343614302933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401243921","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104497425,0.027359493,0.03803066,0.037749466,0.0045889807,0.0011777012,0.02118026,0.0049569597,0.76045907],"genre_scores_gemma":[0.434122,0.012465189,0.03310278,0.005466284,0.0006169541,0.00025936658,0.01598676,0.0011078006,0.4968729],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993024,0.000021915022,0.0000047066706,0.000048950238,0.00041409495,0.00020791564],"domain_scores_gemma":[0.9994355,0.000030895168,0.000015868593,0.00002826887,0.00030718083,0.00018234139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054369273,0.0005750846,0.00027962998,0.0008672779,0.0029616796,0.0018581403,0.00072744704,0.0007642213,0.015289868],"category_scores_gemma":[0.00075051846,0.00019051376,0.00025949796,0.0011793958,0.0011663006,0.0010546874,0.001565753,0.001504973,0.002519033],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007968985,0.00009797379,0.008630957,0.00047610226,0.000057619112,0.00058899255,0.0010923514,0.004552695,0.022160023,0.103028774,0.62699765,0.23151983],"study_design_scores_gemma":[0.00003315286,0.000057489935,0.0032633306,0.000056332996,0.0000071330282,0.000063907224,0.00017490043,0.0010351036,0.0032447358,0.0021244732,0.98991007,0.000029284125],"about_ca_topic_score_codex":0.73983175,"about_ca_topic_score_gemma":0.8334642,"teacher_disagreement_score":0.26016825,"about_ca_system_score_codex":0.014786185,"about_ca_system_score_gemma":0.027952522,"threshold_uncertainty_score":0.52340084},"labels":[],"label_agreement":null},{"id":"W4401247868","doi":"10.1109/cscloud62866.2024.00027","title":"Securing AWS Lambda: Advanced Strategies and Best Practices","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Lambda; Computer science; Physics","score_opus":0.029658897341573547,"score_gpt":0.3134047585440057,"score_spread":0.2837458612024321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401247868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035501428,0.06911996,0.7533567,0.06228292,0.0009981386,0.00075840653,0.00011151687,0.0050781686,0.0727927],"genre_scores_gemma":[0.5243184,0.09878657,0.34306085,0.0079478165,0.00076151174,0.0005012319,0.000350959,0.000984792,0.023287874],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98875976,0.0027505716,0.0008570832,0.0012260547,0.005282873,0.0011236627],"domain_scores_gemma":[0.9847461,0.003546463,0.0012728916,0.004367251,0.005059195,0.0010081048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015571166,0.0020129585,0.00076349016,0.0040501156,0.002443331,0.010708857,0.0055892994,0.0060114004,0.0037682287],"category_scores_gemma":[0.016229345,0.0010624622,0.0010001446,0.0019841196,0.007883115,0.023043163,0.006687512,0.0064270305,0.0033945276],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014966835,0.0004298845,0.004082816,0.0021951317,0.00010300573,0.00089947757,0.004200372,0.013055201,0.013517459,0.32478955,0.016762856,0.61981446],"study_design_scores_gemma":[0.0000683789,0.0008567574,0.002059991,0.0073576774,0.00014493302,0.0029108033,0.007954017,0.045360517,0.037804797,0.32952803,0.5656045,0.00034962097],"about_ca_topic_score_codex":0.003130141,"about_ca_topic_score_gemma":0.0022103123,"teacher_disagreement_score":0.015571166,"about_ca_system_score_codex":0.0036981022,"about_ca_system_score_gemma":0.0050515984,"threshold_uncertainty_score":0.08234918},"labels":[],"label_agreement":null},{"id":"W4401249586","doi":"10.1137/20m1322923","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Toronto","funders":"","keywords":"Space (punctuation); Computer science; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Discrete mathematics","score_opus":0.023221807404975082,"score_gpt":0.2927665417462249,"score_spread":0.2695447343412498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401249586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059482674,0.0002527077,0.9839797,0.0010585497,0.0001491348,0.00007032734,0.000118807,0.0004668672,0.007955677],"genre_scores_gemma":[0.5428224,0.0014214522,0.43100166,0.0020960043,0.0017546015,0.0007967729,0.0007466665,0.0013405954,0.018019872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857013,0.0057362053,0.00073707453,0.0017102932,0.005014528,0.0011005948],"domain_scores_gemma":[0.91554224,0.062414203,0.0025388822,0.012697153,0.004979995,0.0018275984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008654919,0.0028092726,0.002958194,0.0038732118,0.00254775,0.006287402,0.007585611,0.0038797064,0.011362282],"category_scores_gemma":[0.058985725,0.002365247,0.006055225,0.0034320315,0.007998903,0.019804044,0.013707839,0.013466058,0.0017240207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065844,0.00008952884,0.0006881256,0.00019598247,0.00014326739,0.00016290059,0.0003571534,0.056025505,0.0018315774,0.9136015,0.0040439223,0.022653962],"study_design_scores_gemma":[0.000029149644,0.000037047725,0.00007531933,0.00003221679,0.000051201678,0.000052543117,0.000036497324,0.1859357,0.0012734968,0.80934733,0.0030995696,0.000029888814],"about_ca_topic_score_codex":0.0020607137,"about_ca_topic_score_gemma":0.0026865618,"teacher_disagreement_score":0.011362282,"about_ca_system_score_codex":0.0031455127,"about_ca_system_score_gemma":0.0026671332,"threshold_uncertainty_score":0.045772135},"labels":[],"label_agreement":null},{"id":"W4401669598","doi":"10.1007/s00446-024-00471-7","title":"A wait-free queue with polylogarithmic step complexity","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Amortized analysis; Mathematics; Bounded function; Combinatorics; Computer science; Lock (firearm); Priority queue; Discrete mathematics; Binary logarithm; Parallel computing; Data structure; Operating system; Computer network","score_opus":0.017274164517485865,"score_gpt":0.2459224800769418,"score_spread":0.22864831555945594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401669598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741894,0.0008012579,0.91445434,0.0028764675,0.00052932044,0.00027888175,0.0007201222,0.003178092,0.0097425515],"genre_scores_gemma":[0.6651208,0.00052598666,0.30689585,0.0010918074,0.00043776914,0.00043300685,0.00070994056,0.00069621106,0.02408865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963329,0.0006294573,0.0002796406,0.00067481335,0.0012221517,0.00086111634],"domain_scores_gemma":[0.9841925,0.008703567,0.00060408795,0.002553587,0.0022684333,0.0016777789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041908855,0.001269596,0.002125745,0.0015425546,0.0038666534,0.007192497,0.0050628725,0.0029284914,0.011156927],"category_scores_gemma":[0.018686187,0.0012331548,0.0011415548,0.0023315616,0.0022068974,0.007685734,0.0040216777,0.0044350578,0.002120649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031184705,0.00085974054,0.0020802477,0.00041125165,0.00013455967,0.00042049718,0.00054457027,0.124895364,0.017600508,0.74692893,0.027005257,0.07600053],"study_design_scores_gemma":[0.00056316686,0.00024393603,0.0002424799,0.000031607568,0.00008548118,0.00015712308,0.000063341344,0.6814876,0.0044495775,0.3090179,0.0035675005,0.00009030834],"about_ca_topic_score_codex":0.006381738,"about_ca_topic_score_gemma":0.007493223,"teacher_disagreement_score":0.011156927,"about_ca_system_score_codex":0.0052715605,"about_ca_system_score_gemma":0.009894508,"threshold_uncertainty_score":0.038248003},"labels":[],"label_agreement":null},{"id":"W4401753378","doi":"10.1109/icdcs60910.2024.00024","title":"A Lock-free Binary Trie","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lock (firearm); Computer science; Trie; Binary number; Programming language; Data structure; Mathematics; Arithmetic; Engineering","score_opus":0.010084815984661325,"score_gpt":0.23638729205001632,"score_spread":0.226302476065355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401753378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02086761,0.0010219833,0.90254647,0.0009700057,0.0008316807,0.00061044213,0.0034623304,0.037519462,0.032170095],"genre_scores_gemma":[0.1925234,0.0007028573,0.73037213,0.0016463717,0.00030495925,0.0011782735,0.0061818976,0.005206708,0.06188333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957652,0.00058307307,0.000746309,0.0006726951,0.0015825406,0.0006501048],"domain_scores_gemma":[0.9920682,0.001032077,0.0004771409,0.0044241734,0.0015291589,0.00046925052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026035702,0.00075497845,0.0011982465,0.0015398631,0.0018858192,0.0041674473,0.004536924,0.0013993991,0.031233825],"category_scores_gemma":[0.008072019,0.0014171096,0.0012497433,0.002377567,0.0016809618,0.009260337,0.005513547,0.0027198237,0.014823715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032348318,0.00057939405,0.00191243,0.0015227124,0.00015639696,0.0005266194,0.0009265506,0.021285186,0.053671807,0.43429044,0.13350965,0.348384],"study_design_scores_gemma":[0.0007538672,0.0009561723,0.0006817329,0.00034121692,0.00021273668,0.00095521216,0.00031459433,0.16079432,0.101538464,0.20060176,0.53242594,0.000424039],"about_ca_topic_score_codex":0.0024490196,"about_ca_topic_score_gemma":0.002938304,"teacher_disagreement_score":0.031233825,"about_ca_system_score_codex":0.0011304945,"about_ca_system_score_gemma":0.0027537462,"threshold_uncertainty_score":0.10448754},"labels":[],"label_agreement":null},{"id":"W4402156505","doi":"10.1109/icc51166.2024.10622571","title":"Performance of Ethereum 2.0-Like Consensus Under Single-Slot Finality","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network","score_opus":0.035593178216400845,"score_gpt":0.2579720103583119,"score_spread":0.22237883214191106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402156505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9558397,0.00014815941,0.03842037,0.000301265,0.000058964888,0.000065093256,0.00013091443,0.001057515,0.003978041],"genre_scores_gemma":[0.9967553,0.00001634452,0.002660924,0.00003105869,0.0000028123927,0.00001572428,0.0000616657,0.000016961447,0.00043911464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778867,0.0007114445,0.00012126437,0.00034840842,0.0004462318,0.0005839221],"domain_scores_gemma":[0.98740023,0.0076239845,0.000983724,0.0018628179,0.0013245442,0.000804684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046724062,0.00041581612,0.0009341705,0.00048781064,0.0006761341,0.00083257,0.001101588,0.0012535797,0.0026505587],"category_scores_gemma":[0.015450919,0.00025107354,0.00034486747,0.0004040246,0.0010620909,0.001925642,0.0015983916,0.00094807823,0.00032671663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029945287,0.0004091287,0.0058885408,0.00016197587,0.00011242255,0.0002855046,0.0002720988,0.92953223,0.016440587,0.019409008,0.0020566448,0.022437418],"study_design_scores_gemma":[0.00010146072,0.00032348253,0.00063217495,0.0000071537725,0.000009504924,0.000041626412,0.000052427164,0.98829985,0.0061531467,0.0041214144,0.00023669851,0.00002117134],"about_ca_topic_score_codex":0.0026475086,"about_ca_topic_score_gemma":0.0015227812,"teacher_disagreement_score":0.0046724062,"about_ca_system_score_codex":0.0011942817,"about_ca_system_score_gemma":0.0015808805,"threshold_uncertainty_score":0.024710357},"labels":[],"label_agreement":null},{"id":"W4402893717","doi":"10.1109/tsmc.2024.3460386","title":"Finite-Frequency Fault Estimation and Adaptive Event-Triggered Fault-Tolerant Consensus for LPV Multiagent Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Multi-agent system; Fault tolerance; Computer science; Consensus; Fault (geology); Control theory (sociology); Distributed computing; Artificial intelligence; Biology","score_opus":0.022702265823419204,"score_gpt":0.2557494618481577,"score_spread":0.23304719602473853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402893717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014840634,0.000097433636,0.9840042,0.00006410625,0.000017412802,0.000013393491,0.000008549211,0.00007305088,0.0008811958],"genre_scores_gemma":[0.9751695,0.0001303008,0.02366831,0.00003231008,0.00002411086,0.00006139925,0.00003157059,0.000011734277,0.0008708473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00017368743,0.00003821189,0.00020875035,0.00018833717,0.000062632455],"domain_scores_gemma":[0.9990269,0.00046206114,0.00025752425,0.0000689171,0.00015464229,0.000030127929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077524694,0.0006409706,0.00058438943,0.00040630208,0.00043258717,0.00076660427,0.0010628009,0.0009514681,0.00061216945],"category_scores_gemma":[0.002587514,0.00024625493,0.0004240042,0.0003529517,0.00079886394,0.000922211,0.00081612304,0.00078012364,0.000084687235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039554645,0.000015507618,0.00034206582,0.0000737985,0.000023238588,0.00015018028,0.00010835064,0.96408415,0.003516458,0.011320515,0.00018987262,0.020136235],"study_design_scores_gemma":[0.0000031767036,0.000021630218,0.00007398348,0.000002252115,0.0000032508183,0.000015971877,0.0000104979545,0.99646866,0.0004842195,0.002764569,0.00014749942,0.0000043003547],"about_ca_topic_score_codex":0.0033975954,"about_ca_topic_score_gemma":0.0012239511,"teacher_disagreement_score":0.0033975954,"about_ca_system_score_codex":0.00070413755,"about_ca_system_score_gemma":0.0005253832,"threshold_uncertainty_score":0.0067555904},"labels":[],"label_agreement":null},{"id":"W4403358062","doi":"10.1007/978-3-031-64948-6_13","title":"Byzantine Protocols with Asymptotically Optimal Communication Complexity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Byzantine architecture; Computer science; Asymptotically optimal algorithm; History; Algorithm; Ancient history","score_opus":0.029068207772065736,"score_gpt":0.2605725258500938,"score_spread":0.23150431807802804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403358062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06823509,0.0020772482,0.8309259,0.005340541,0.00041653006,0.00049950014,0.0006819047,0.002485474,0.08933781],"genre_scores_gemma":[0.55256236,0.0024214338,0.36816493,0.0011547571,0.0006650573,0.001889988,0.00079655705,0.0015018932,0.0708431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945635,0.0015032683,0.00023725689,0.0007766004,0.002160468,0.00075897295],"domain_scores_gemma":[0.9833838,0.010965391,0.00077809003,0.0037152702,0.0007854744,0.000372078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031267414,0.0016580446,0.0027271837,0.0019365455,0.0029586551,0.006838594,0.0031113871,0.004187331,0.009096343],"category_scores_gemma":[0.016211858,0.001284896,0.0012542462,0.002808303,0.003691988,0.013401106,0.005783854,0.00671083,0.0022312722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026542746,0.00006307546,0.00010022894,0.0001804904,0.000024678782,0.000049176182,0.00019190139,0.0150751155,0.0036033213,0.9501024,0.00592612,0.024418022],"study_design_scores_gemma":[0.000074934906,0.00004591189,0.00005301123,0.000030251127,0.00002716161,0.000094491115,0.00003556868,0.059826765,0.0033528486,0.929743,0.0066946493,0.000021405569],"about_ca_topic_score_codex":0.0006320652,"about_ca_topic_score_gemma":0.0012066984,"teacher_disagreement_score":0.009096343,"about_ca_system_score_codex":0.0036112473,"about_ca_system_score_gemma":0.0035298883,"threshold_uncertainty_score":0.030430317},"labels":[],"label_agreement":null},{"id":"W4403646761","doi":"10.1145/3691621.3694942","title":"A First Look at Self-Admitted Miscommunications in GitHub Issues","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Computer science","score_opus":0.013836654818552827,"score_gpt":0.2674816712890635,"score_spread":0.2536450164705107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403646761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97178227,0.00192966,0.01640865,0.0020788359,0.000114209666,0.00026913927,0.0009253132,0.0006467784,0.005845168],"genre_scores_gemma":[0.9600102,0.0014106005,0.029536149,0.00083117955,0.00016896505,0.00039926555,0.0027272438,0.00069657597,0.004219923],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.981974,0.006396139,0.0022560575,0.0020980092,0.005939642,0.0013361078],"domain_scores_gemma":[0.7759024,0.13780761,0.048314,0.012407317,0.022254294,0.0033143777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010770811,0.0005917805,0.0005578096,0.015176258,0.003603641,0.0048566293,0.001400681,0.0016498523,0.001826694],"category_scores_gemma":[0.109946035,0.00060801045,0.0006928206,0.009500855,0.0029509037,0.007930135,0.0063431,0.0024866788,0.00059977703],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020664245,0.00016841445,0.47066724,0.0019698,0.000093777664,0.0040996587,0.352285,0.00051793165,0.009451472,0.0067285295,0.008231295,0.14558022],"study_design_scores_gemma":[0.000024281462,0.0002757338,0.64869124,0.0024754636,0.00014082702,0.0071837544,0.21947697,0.005964078,0.007190958,0.0090368735,0.099276714,0.0002630215],"about_ca_topic_score_codex":0.0052983356,"about_ca_topic_score_gemma":0.012120757,"teacher_disagreement_score":0.015176258,"about_ca_system_score_codex":0.0024791993,"about_ca_system_score_gemma":0.0030847038,"threshold_uncertainty_score":0.056962192},"labels":[],"label_agreement":null},{"id":"W4403705645","doi":"10.1145/3689031.3696102","title":"Ladon: High-Performance Multi-BFT Consensus via Dynamic Global Ordering","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Bottleneck; Replica; Distributed computing; Latency (audio); Block (permutation group theory); Overhead (engineering); Protocol (science); Scrambling; Robustness (evolution); Algorithm; Mathematics","score_opus":0.012777368672231148,"score_gpt":0.26489333458704206,"score_spread":0.2521159659148109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403705645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013000029,0.00026102614,0.97162455,0.00036879122,0.00017885365,0.000106991065,0.00024346585,0.005662427,0.008553876],"genre_scores_gemma":[0.5205316,0.00022629043,0.462849,0.00033177505,0.00010393215,0.00038349206,0.0011306776,0.0009860724,0.013457198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.00026811668,0.000049366077,0.00017870695,0.0003160051,0.00013003351],"domain_scores_gemma":[0.9986223,0.00042975746,0.000085959604,0.0003875643,0.0003367654,0.00013768779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012536288,0.00084857794,0.0008506082,0.000656548,0.0010191916,0.0013597893,0.0017056697,0.0010946655,0.0075822556],"category_scores_gemma":[0.0037663819,0.0004423519,0.0003724841,0.0009114945,0.000750388,0.0019169261,0.0022555506,0.0016729095,0.0023813273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001097483,0.00018905428,0.00074566336,0.0003314186,0.0000860633,0.00025119502,0.000344642,0.5998455,0.025219398,0.07564202,0.04030074,0.25594682],"study_design_scores_gemma":[0.00012213648,0.000069197966,0.00007198346,0.000012244384,0.000006499676,0.000035038367,0.000024791178,0.9614218,0.0048215874,0.027264632,0.006131603,0.000018458186],"about_ca_topic_score_codex":0.0041119144,"about_ca_topic_score_gemma":0.0065674684,"teacher_disagreement_score":0.0075822556,"about_ca_system_score_codex":0.0011281257,"about_ca_system_score_gemma":0.0014954446,"threshold_uncertainty_score":0.025365114},"labels":[],"label_agreement":null},{"id":"W4404018023","doi":"10.1080/13698230.2024.2423141","title":"As-if trust","year":2024,"lang":"en","type":"article","venue":"Critical Review of International Social and Political Philosophy","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University","funders":"","keywords":"Political science; Sociology; Law; Epistemology; Law and economics; Philosophy","score_opus":0.03516105501692327,"score_gpt":0.3590114013841566,"score_spread":0.3238503463672333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404018023","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017095538,0.015914908,0.1260257,0.10641566,0.0031792587,0.0002183657,0.00031251356,0.00041379136,0.7304243],"genre_scores_gemma":[0.8829329,0.012798654,0.018333383,0.019331764,0.0018645033,0.00030764993,0.00029921744,0.00023718156,0.0638948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9766873,0.010073119,0.0014932699,0.0032851766,0.0058643916,0.0025968587],"domain_scores_gemma":[0.9734191,0.008594694,0.0041473107,0.0062774643,0.0058091804,0.0017523203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015476263,0.0008083724,0.0010005364,0.0020047764,0.005331035,0.01499519,0.0018880249,0.007400148,0.012143303],"category_scores_gemma":[0.032991882,0.0005248227,0.0008146375,0.0021170115,0.02761217,0.022871695,0.0063779624,0.006253533,0.004012791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005597963,0.000005091839,0.0003056612,0.00007773185,0.000009869593,0.000060315877,0.0014312068,0.00014164427,0.000055957884,0.9831328,0.0065152985,0.008258836],"study_design_scores_gemma":[0.000009408969,0.000025012152,0.00048744105,0.00047242132,0.000017794722,0.00033042894,0.0015934249,0.00052687875,0.00017835524,0.7238646,0.27246666,0.000027539381],"about_ca_topic_score_codex":0.005376721,"about_ca_topic_score_gemma":0.0028703136,"teacher_disagreement_score":0.015476263,"about_ca_system_score_codex":0.009523412,"about_ca_system_score_gemma":0.0066531403,"threshold_uncertainty_score":0.08184725},"labels":[],"label_agreement":null},{"id":"W4404860863","doi":"10.5489/cuaj.9061","title":"Communication breakdown or clashing models?","year":2024,"lang":"en","type":"editorial","venue":"Canadian Urological Association Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.01401664344058626,"score_gpt":0.2373001164534428,"score_spread":0.22328347301285653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404860863","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009114091,0.0065269102,0.0005557808,0.08407059,0.9055231,0.000010030641,0.000046703717,0.0000892213,0.0030864757],"genre_scores_gemma":[0.0032260825,0.0068382164,0.00031218058,0.03398568,0.9438954,0.00003010438,0.000041806758,0.000085801454,0.011584716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99529773,0.0010294288,0.00050456956,0.00059896434,0.0021555983,0.00041368068],"domain_scores_gemma":[0.9684599,0.0184659,0.0016169667,0.0013289825,0.007324875,0.00280326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009848628,0.0026691367,0.0023621607,0.0035016062,0.0030537464,0.006834761,0.004427459,0.025130853,0.012103179],"category_scores_gemma":[0.052210104,0.0010732516,0.0019457698,0.0015535414,0.0051083853,0.0069121243,0.0016879555,0.021072168,0.005393503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033882272,0.000007679878,0.000020378871,0.00009230759,0.000014814227,0.00011899974,0.000015195272,0.000065718334,0.000020248552,0.0028359324,0.99091315,0.005861572],"study_design_scores_gemma":[0.00010413805,0.000029351646,0.00017449325,0.0005024666,0.000089613175,0.0003489331,0.00007684519,0.00087662763,0.00011017984,0.015901359,0.9817485,0.000037428792],"about_ca_topic_score_codex":0.005608231,"about_ca_topic_score_gemma":0.011197138,"teacher_disagreement_score":0.025130853,"about_ca_system_score_codex":0.004518621,"about_ca_system_score_gemma":0.0040922207,"threshold_uncertainty_score":0.0520851},"labels":[],"label_agreement":null},{"id":"W4405030254","doi":"10.4230/lipics.disc.2025.29","title":"Strong Linearizability Without Compare&Swap: The Case of Bags","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business; Chemistry; Environmental science","score_opus":0.0719208758939862,"score_gpt":0.2147994231365597,"score_spread":0.14287854724257348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405030254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13917045,0.0004622072,0.84521735,0.00093096646,0.00010408431,0.00010965997,0.0001231826,0.0035043017,0.010377731],"genre_scores_gemma":[0.7988151,0.0003303642,0.18792072,0.0007770166,0.00019809965,0.0005126156,0.00017953463,0.0013528337,0.009913729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315286,0.0018027794,0.0006071232,0.0010094108,0.0019950704,0.0014327343],"domain_scores_gemma":[0.97582006,0.008316606,0.002602751,0.010581223,0.0020021102,0.0006773274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004898007,0.0007585681,0.0009767988,0.0006575794,0.0016947308,0.005064278,0.002739661,0.0018098492,0.004065301],"category_scores_gemma":[0.017056827,0.001220897,0.0013235866,0.0012992808,0.005772212,0.014207726,0.0065585733,0.0042667007,0.001414657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011878442,0.00023720367,0.00420689,0.00044624985,0.0000926348,0.0007041634,0.002394425,0.034591075,0.028791253,0.85489076,0.003577106,0.06888028],"study_design_scores_gemma":[0.00020547032,0.000371207,0.0008081189,0.0001399826,0.00015886678,0.0005586871,0.00054366566,0.16374116,0.06444548,0.7485374,0.020363703,0.00012629441],"about_ca_topic_score_codex":0.0018018202,"about_ca_topic_score_gemma":0.0010792449,"teacher_disagreement_score":0.005064278,"about_ca_system_score_codex":0.0012430459,"about_ca_system_score_gemma":0.0016686996,"threshold_uncertainty_score":0.025903463},"labels":[],"label_agreement":null},{"id":"W4405432368","doi":"10.1145/3704894","title":"Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Research Council; European Commission; National Science Foundation","keywords":"Unary operation; Probabilistic logic; Probabilistic argumentation; Deductive reasoning; Computer science; Statistical relational learning; Independence (probability theory); Artificial intelligence; Non-monotonic logic; Psychology of reasoning; Reasoning system; Model-based reasoning; Mathematics; Relational database; Knowledge representation and reasoning; Information retrieval","score_opus":0.015666870287668798,"score_gpt":0.28435941125319864,"score_spread":0.26869254096552986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405432368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088978163,0.00015647669,0.99094826,0.00079803565,0.0000904386,0.000065120665,0.00008231042,0.003708976,0.003260505],"genre_scores_gemma":[0.10698896,0.0010840781,0.87509763,0.00213972,0.00065801776,0.0005598477,0.0005605224,0.0034208237,0.0094904825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881153,0.0042504426,0.00060298404,0.0017550106,0.0042231428,0.0010531198],"domain_scores_gemma":[0.98431915,0.0083188,0.0009449034,0.004029902,0.0014599327,0.0009272726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013264092,0.0014341451,0.00139649,0.0027891768,0.002314363,0.0062360265,0.005929459,0.002206978,0.0147015955],"category_scores_gemma":[0.024101682,0.002438704,0.004080546,0.002005363,0.008081175,0.0148574915,0.013509411,0.010470657,0.0040625157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014526535,0.00008568801,0.0004308456,0.0002686374,0.000077533165,0.00023179624,0.0006986708,0.01002104,0.0024827584,0.9277569,0.009854783,0.047946084],"study_design_scores_gemma":[0.000095075295,0.000063480555,0.00016229633,0.00016264402,0.00009021675,0.00024196407,0.00007214766,0.06594011,0.0049989456,0.84901845,0.079069145,0.00008549789],"about_ca_topic_score_codex":0.0046545556,"about_ca_topic_score_gemma":0.004997277,"teacher_disagreement_score":0.0147015955,"about_ca_system_score_codex":0.002933883,"about_ca_system_score_gemma":0.0046453704,"threshold_uncertainty_score":0.07014805},"labels":[],"label_agreement":null},{"id":"W4405908863","doi":"10.1109/wf-iot62078.2024.10811197","title":"Asynchronous Telegate and Teledata Protocols for Distributed Quantum Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Distributed computing; Quantum computer; Quantum; Computer network; Physics","score_opus":0.022984478440894286,"score_gpt":0.3063283943563314,"score_spread":0.2833439159154371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405908863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009775333,0.00036850086,0.9723212,0.0009966557,0.00038510928,0.00018878187,0.000043611348,0.00021210725,0.015708786],"genre_scores_gemma":[0.49666056,0.0012023093,0.47761214,0.000938429,0.0005919546,0.0009972221,0.00010716873,0.00025133704,0.021638867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983839,0.0005822796,0.00008829007,0.00020016721,0.0006305978,0.00011483],"domain_scores_gemma":[0.997554,0.0009899787,0.00022328776,0.00077669416,0.0003291229,0.00012686738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017893933,0.0004358291,0.00040089112,0.0004795582,0.0014363261,0.0018453697,0.0015972385,0.0014624734,0.0066089914],"category_scores_gemma":[0.0033706054,0.00030457613,0.00049552677,0.00061444327,0.0023063372,0.0046567586,0.001838771,0.0029195314,0.00076299737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009448568,0.000054905006,0.00008489528,0.00007327942,0.0000077944815,0.000068447385,0.00013101984,0.0054437225,0.006284288,0.963195,0.0018390523,0.022723125],"study_design_scores_gemma":[0.00018331342,0.0002864122,0.00020374112,0.00008425781,0.00004555453,0.0003585052,0.00015902155,0.18945858,0.025395608,0.68631446,0.09742977,0.00008076724],"about_ca_topic_score_codex":0.00045280898,"about_ca_topic_score_gemma":0.0006816429,"teacher_disagreement_score":0.0066089914,"about_ca_system_score_codex":0.0010946827,"about_ca_system_score_gemma":0.0010567945,"threshold_uncertainty_score":0.02210927},"labels":[],"label_agreement":null},{"id":"W4406141970","doi":"10.1137/1.9781611978322.113","title":"Streaming and Communication Complexity of Load-Balancing via Matching Contractors","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","funders":"","keywords":"Matching (statistics); Computer science; Distributed computing; Business; Mathematics","score_opus":0.0483770812460153,"score_gpt":0.24947740478928968,"score_spread":0.20110032354327437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406141970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46367145,0.0020341752,0.46787107,0.0069533233,0.00025883052,0.0003870755,0.001361272,0.0007270735,0.056735788],"genre_scores_gemma":[0.86524343,0.0014257194,0.105698794,0.0003789278,0.000369831,0.0003854861,0.0010937393,0.00029279653,0.02511115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786264,0.0007434089,0.00008737375,0.00034513517,0.0006159721,0.00034547862],"domain_scores_gemma":[0.9856574,0.011429802,0.000714902,0.0010301439,0.00057056505,0.00059718004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027669787,0.0007233505,0.0012859158,0.0006247852,0.0013926559,0.0027457427,0.0026232817,0.0018095296,0.010787996],"category_scores_gemma":[0.01423439,0.0004876021,0.00062012934,0.0021054125,0.001772357,0.008766545,0.0021823489,0.0025309692,0.00079378055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007548516,0.00034753734,0.0011188213,0.00029836243,0.00004668202,0.000192879,0.00038177957,0.41359207,0.0035761485,0.48333067,0.013480757,0.08287942],"study_design_scores_gemma":[0.000046909197,0.000040099807,0.00021611986,0.000017259283,0.000008506289,0.00005941352,0.00007439571,0.7016707,0.0006610033,0.29544663,0.0017471244,0.000011836253],"about_ca_topic_score_codex":0.0026424243,"about_ca_topic_score_gemma":0.0015604158,"teacher_disagreement_score":0.010787996,"about_ca_system_score_codex":0.0033330526,"about_ca_system_score_gemma":0.0021482734,"threshold_uncertainty_score":0.03608942},"labels":[],"label_agreement":null},{"id":"W4406555161","doi":"10.18192/jpp.v34i1.7350","title":"A PAWSitive Connection","year":2025,"lang":"en","type":"article","venue":"Journal of Prisoners on Prisons","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Political science; Computer science; Mathematics; Geometry","score_opus":0.009547335741814454,"score_gpt":0.27053749657640463,"score_spread":0.2609901608345902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406555161","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05149951,0.0009413769,0.12898003,0.012264389,0.003671141,0.00011346123,0.0007542383,0.00083097105,0.80094504],"genre_scores_gemma":[0.71925646,0.00082159624,0.018926505,0.003086926,0.0014835066,0.00013510387,0.0006684135,0.0006107519,0.25501084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881727,0.00028804268,0.00007230057,0.00041679936,0.00020006645,0.00020554682],"domain_scores_gemma":[0.9979856,0.0004971554,0.00011221101,0.00068807096,0.00049757474,0.00021944994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080602715,0.0004554965,0.0006125616,0.0013278067,0.004052925,0.0041308245,0.0011238395,0.0023328776,0.075081274],"category_scores_gemma":[0.003966593,0.00057234603,0.00068211596,0.0014809889,0.0031666683,0.011350937,0.003495613,0.0041776374,0.010045125],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023602592,0.000013105388,0.00010746504,0.000014854316,0.0000043944547,0.00008294717,0.00021437951,0.000039877094,0.00030935518,0.9881931,0.0064369636,0.004560064],"study_design_scores_gemma":[0.000014655463,0.000010325085,0.00016508655,0.000011560018,0.000008178275,0.00024731216,0.00015377239,0.00048155582,0.00033968245,0.95685846,0.041699,0.000010413739],"about_ca_topic_score_codex":0.00087884726,"about_ca_topic_score_gemma":0.00078703946,"teacher_disagreement_score":0.075081274,"about_ca_system_score_codex":0.0008676138,"about_ca_system_score_gemma":0.00064246135,"threshold_uncertainty_score":0.2511719},"labels":[],"label_agreement":null},{"id":"W4407193070","doi":"10.3390/cryptography9010012","title":"DGMT: A Fully Dynamic Group Signature from Symmetric-Key Primitives","year":2025,"lang":"en","type":"article","venue":"Cryptography","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signature (topology); Key (lock); Group (periodic table); Group signature; Computer science; Mathematics; Computer security; Physics; Public-key cryptography; Encryption; Geometry; Quantum mechanics","score_opus":0.0039005043801908753,"score_gpt":0.22227230002337087,"score_spread":0.21837179564318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407193070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011526908,0.000617819,0.9736902,0.000522587,0.00030140465,0.0004338062,0.0005733578,0.0032788382,0.009055045],"genre_scores_gemma":[0.43988967,0.0009838006,0.54016346,0.0010813796,0.0003581555,0.00093506655,0.0019232274,0.0004417451,0.014223485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968341,0.0006819498,0.0002297495,0.0004002136,0.0015393402,0.0003146896],"domain_scores_gemma":[0.9981232,0.00034805585,0.00026382142,0.0009346657,0.00019745278,0.00013282902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013404455,0.00053204666,0.00067377655,0.0011261232,0.000835794,0.0017947346,0.0021473567,0.0014372612,0.00344224],"category_scores_gemma":[0.0036962847,0.00038086053,0.0008376178,0.001608723,0.0018876537,0.0046080034,0.0047703865,0.0023717147,0.0017254297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063744,0.0001418198,0.00043937183,0.00051054906,0.000057587717,0.00043194368,0.00052378513,0.019028299,0.0443842,0.66072714,0.01635457,0.25676325],"study_design_scores_gemma":[0.0004268383,0.0006801473,0.0005162902,0.00017190792,0.000080912316,0.0015213824,0.00011722314,0.18561411,0.06845867,0.4280064,0.3142031,0.00020301277],"about_ca_topic_score_codex":0.0005725804,"about_ca_topic_score_gemma":0.00039150324,"teacher_disagreement_score":0.00344224,"about_ca_system_score_codex":0.0012640143,"about_ca_system_score_gemma":0.0022905574,"threshold_uncertainty_score":0.011515379},"labels":[],"label_agreement":null},{"id":"W4407262244","doi":"10.1007/s00446-025-00476-w","title":"When is recoverable consensus harder than consensus?","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Hellenic Foundation for Research and Innovation","keywords":"Scientific consensus; Consensus conference; Washington Consensus; Consensus algorithm; Uniform consensus; Computer science; Consensus; Geology; Political science; Data science; Artificial intelligence; Climate change; Library science; Law; Multi-agent system","score_opus":0.014030030635338654,"score_gpt":0.25512901596238197,"score_spread":0.24109898532704332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407262244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39882606,0.01569718,0.21734904,0.26126903,0.0066555203,0.00019920999,0.0012717721,0.0016460062,0.097086236],"genre_scores_gemma":[0.97681594,0.0022302342,0.008717256,0.0031793904,0.0026094082,0.00009910351,0.0004139326,0.0002993452,0.005635349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99186045,0.0024396502,0.00039403274,0.0018491119,0.0019496033,0.0015070611],"domain_scores_gemma":[0.89384055,0.08614713,0.0046851467,0.0061789644,0.0056284983,0.0035196133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072059114,0.00055265747,0.0021691807,0.0017514452,0.0025976992,0.006393826,0.0023526575,0.0071030506,0.02000268],"category_scores_gemma":[0.10194932,0.0008913909,0.0010086304,0.0020634288,0.006635899,0.027275858,0.0037306887,0.0069412375,0.0026303977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018955914,0.00045809403,0.009904522,0.0015018949,0.00034275022,0.00084320205,0.0018776356,0.031270187,0.0026689598,0.6756695,0.07027681,0.20329084],"study_design_scores_gemma":[0.000061438506,0.0000372809,0.0011999498,0.000079446545,0.00002704773,0.00023186384,0.0014151179,0.019761825,0.00060323655,0.9716912,0.0048479023,0.000043765893],"about_ca_topic_score_codex":0.0016497029,"about_ca_topic_score_gemma":0.00076570513,"teacher_disagreement_score":0.02000268,"about_ca_system_score_codex":0.0014810172,"about_ca_system_score_gemma":0.0016241936,"threshold_uncertainty_score":0.06691569},"labels":[],"label_agreement":null},{"id":"W4407371961","doi":"10.1109/tdsc.2025.3540980","title":"Chained HotStuff Under Performance Attack","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security; Computer network","score_opus":0.013662090218344788,"score_gpt":0.2510199759040015,"score_spread":0.2373578856856567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407371961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7895305,0.0015125163,0.19544798,0.00046116253,0.00016464142,0.00034840548,0.00048567553,0.0044172388,0.007631857],"genre_scores_gemma":[0.9825219,0.00017871775,0.015845235,0.00007470832,0.0000146896455,0.000083547915,0.00024583258,0.00012469824,0.00091070886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996225,0.0007013058,0.0002337025,0.0005213407,0.001675812,0.00064287346],"domain_scores_gemma":[0.9871852,0.004412843,0.0015750577,0.0042622243,0.0020564666,0.00050819345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029063937,0.00093954854,0.00082478975,0.0011375861,0.00082716625,0.0012724531,0.0015208053,0.0011316221,0.0019628624],"category_scores_gemma":[0.014767698,0.00024292346,0.00043737717,0.00092647923,0.0015381705,0.0036373602,0.0018645321,0.0012829425,0.0003454659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021667406,0.00045712487,0.017251665,0.00081588957,0.00025966455,0.0007582437,0.0006095911,0.66386265,0.12198549,0.03339146,0.005476044,0.15296553],"study_design_scores_gemma":[0.000070134825,0.0010186647,0.0025611904,0.000041880816,0.00006615347,0.0003203951,0.00016032525,0.9162473,0.06672867,0.009959175,0.0027660683,0.000059996648],"about_ca_topic_score_codex":0.002036681,"about_ca_topic_score_gemma":0.001558691,"teacher_disagreement_score":0.0029063937,"about_ca_system_score_codex":0.0012732841,"about_ca_system_score_gemma":0.0015422828,"threshold_uncertainty_score":0.015370667},"labels":[],"label_agreement":null},{"id":"W4407694628","doi":"10.14778/3704965.3704979","title":"Eventual Durability","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Durability; Materials science; Composite material","score_opus":0.006778615071000851,"score_gpt":0.2150393170096381,"score_spread":0.20826070193863724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407694628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028829275,0.0055379528,0.67213345,0.003910351,0.0025238495,0.00088705274,0.0043098493,0.019504836,0.26236334],"genre_scores_gemma":[0.47825027,0.0065786405,0.2273194,0.0037453144,0.001745601,0.0012151061,0.009982706,0.0053782295,0.26578477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482036,0.0006935298,0.0006658228,0.0009052729,0.0021962894,0.0007187517],"domain_scores_gemma":[0.9865827,0.0018150694,0.00082894927,0.0065116966,0.0035893028,0.0006723001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037694334,0.0009838364,0.0009972198,0.0012571687,0.0024898993,0.0059283404,0.0044557345,0.0021988812,0.037769437],"category_scores_gemma":[0.013647975,0.00094443286,0.0015123484,0.0013845995,0.0021824143,0.012975083,0.0071521997,0.0030386078,0.017005114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047799604,0.00016378907,0.004089482,0.0011765448,0.000115265175,0.0010104297,0.0013523778,0.009171531,0.009406742,0.64713746,0.0801681,0.24573027],"study_design_scores_gemma":[0.000072276554,0.00024314671,0.00067276024,0.00030958749,0.00009831287,0.00168837,0.00040844607,0.01583264,0.009978369,0.22326304,0.74734473,0.00008835094],"about_ca_topic_score_codex":0.0017192258,"about_ca_topic_score_gemma":0.0018647921,"teacher_disagreement_score":0.037769437,"about_ca_system_score_codex":0.0014897394,"about_ca_system_score_gemma":0.0027290105,"threshold_uncertainty_score":0.12635136},"labels":[],"label_agreement":null},{"id":"W4407985680","doi":"10.1002/sat.1557","title":"Minimum Round‐Trip Time Prediction for Low Earth Orbit Satellite Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Satellite Communications and Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Low earth orbit; Satellite; Remote sensing; Orbit (dynamics); Communications satellite; Real-time computing; Telecommunications; Geodesy; Aerospace engineering; Geology; Astronomy; Physics","score_opus":0.013360888179249691,"score_gpt":0.2726584553888787,"score_spread":0.259297567209629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407985680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5802742,0.0016169002,0.41240758,0.0007848747,0.00019951558,0.00003383989,0.00059327256,0.0015283258,0.0025613736],"genre_scores_gemma":[0.9892631,0.00012273839,0.009726033,0.00003700831,0.000024372865,0.000011593035,0.00022498723,0.000017166942,0.00057299505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.000023115734,0.000008873822,0.000050106624,0.000027026654,0.000029735302],"domain_scores_gemma":[0.9994456,0.00028482414,0.00008887759,0.00003110592,0.000119087534,0.000030402454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040783858,0.00058104703,0.0003550297,0.0005120043,0.00021771727,0.00034683043,0.000684486,0.0003951231,0.0006459327],"category_scores_gemma":[0.0016803377,0.00019783435,0.00025792082,0.00045594564,0.00019236408,0.0005754763,0.00035921403,0.00073405326,0.00014684838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012824219,0.000056821005,0.0048744623,0.00004186467,0.000026348353,0.00006948013,0.000033111835,0.92252225,0.002935434,0.00086227525,0.0012295733,0.06722022],"study_design_scores_gemma":[4.9416064e-7,0.0000042105607,0.00026513464,8.7746116e-7,0.0000016151283,0.00000199942,0.000001538451,0.9993067,0.00023117561,0.00015705623,0.000028296432,9.581985e-7],"about_ca_topic_score_codex":0.020105293,"about_ca_topic_score_gemma":0.017151749,"teacher_disagreement_score":0.020105293,"about_ca_system_score_codex":0.0008320981,"about_ca_system_score_gemma":0.0005355847,"threshold_uncertainty_score":0.039976537},"labels":[],"label_agreement":null},{"id":"W4408029618","doi":"10.1145/3710848.3710873","title":"Aggregating Funnels for Faster Fetch&amp;Add and Queues","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Universitas Brawijaya","keywords":"Fetch; Computer science; Queue; Computer network","score_opus":0.018047698788605546,"score_gpt":0.28571525994081226,"score_spread":0.2676675611522067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408029618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059745654,0.00054725964,0.9284231,0.00019101994,0.00019372355,0.00021972216,0.00012483267,0.008225701,0.0023290175],"genre_scores_gemma":[0.3557377,0.00027505483,0.63591254,0.00019754027,0.00016417196,0.00024726774,0.00027849793,0.00059656607,0.0065906346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985299,0.00014585746,0.00019117571,0.00028806363,0.0005833277,0.00026155554],"domain_scores_gemma":[0.9933923,0.0017735419,0.00079024595,0.0019204763,0.0016063865,0.0005170021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019589858,0.0010283848,0.0013383338,0.0018363913,0.0018229316,0.0021880516,0.0030271986,0.00066671503,0.0053120796],"category_scores_gemma":[0.006107222,0.00087540894,0.0008854154,0.002406145,0.0009180637,0.00379026,0.0030315637,0.0013701551,0.0012820195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001806049,0.0007215709,0.009381506,0.0003422095,0.0001988117,0.00038051268,0.0007871731,0.11963257,0.099582866,0.066913165,0.011002375,0.68925124],"study_design_scores_gemma":[0.00023110885,0.0005409328,0.0011046288,0.000041683048,0.00014480847,0.00022055865,0.00013141238,0.87415653,0.075809106,0.030253883,0.01724548,0.000119879754],"about_ca_topic_score_codex":0.007307892,"about_ca_topic_score_gemma":0.010120075,"teacher_disagreement_score":0.007307892,"about_ca_system_score_codex":0.0015931103,"about_ca_system_score_gemma":0.002829369,"threshold_uncertainty_score":0.017770708},"labels":[],"label_agreement":null},{"id":"W4408049605","doi":"10.1145/3710848.3710890","title":"Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya","keywords":"Publication; Computer science; Ping (video games); Computer security; Business; Advertising","score_opus":0.07179660036600068,"score_gpt":0.33818162902609683,"score_spread":0.26638502866009617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408049605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021953465,0.001098789,0.8104851,0.002214416,0.0037028193,0.0007495214,0.0011098133,0.14766231,0.011023721],"genre_scores_gemma":[0.31791186,0.001751915,0.58709097,0.0026261988,0.0022191766,0.001412541,0.004059247,0.03696216,0.045966048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925282,0.0020937496,0.0013073237,0.0010400508,0.0023043395,0.00072634156],"domain_scores_gemma":[0.9631361,0.0065266155,0.0012978753,0.023161149,0.0034387289,0.002439617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011263004,0.0017261921,0.00271587,0.0021615534,0.0026674515,0.009832511,0.005103502,0.003516414,0.02375284],"category_scores_gemma":[0.02894398,0.002037811,0.0015838321,0.0025600342,0.0020963775,0.017422833,0.0101368595,0.005024987,0.0070738294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007311885,0.0017340382,0.009670143,0.0018277413,0.00073051004,0.0020057084,0.0042429683,0.021944476,0.054572936,0.16572346,0.13074552,0.5994906],"study_design_scores_gemma":[0.0025726834,0.0019893376,0.0016286545,0.0003737621,0.0005318798,0.0013579733,0.0015026743,0.19060592,0.08602806,0.12521428,0.5872085,0.0009863452],"about_ca_topic_score_codex":0.0025427118,"about_ca_topic_score_gemma":0.003500656,"teacher_disagreement_score":0.02375284,"about_ca_system_score_codex":0.0013399356,"about_ca_system_score_gemma":0.003285574,"threshold_uncertainty_score":0.07946116},"labels":[],"label_agreement":null},{"id":"W4408281781","doi":"10.1109/iecon55916.2024.10905899","title":"A Real-time Monitoring Architecture for Enhanced Cybersecurity in the EV Ecosystem","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; Concordia University","funders":"","keywords":"Architecture; Computer science; Ecosystem; Computer security; Embedded system; Real-time computing; Ecology","score_opus":0.010738923008267287,"score_gpt":0.2622143168021183,"score_spread":0.25147539379385103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408281781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09461215,0.00021984422,0.87316674,0.00059487915,0.00013047394,0.00038568318,0.00012007678,0.02349873,0.007271387],"genre_scores_gemma":[0.83580726,0.00012744183,0.15913408,0.00026437102,0.00005088617,0.00024222156,0.0002840385,0.00032856633,0.003761134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990441,0.00016353931,0.00008279917,0.00028342236,0.00028236504,0.00014379086],"domain_scores_gemma":[0.99844617,0.00021883796,0.00021486287,0.00040774545,0.00047726274,0.00023516091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015178265,0.0006530667,0.0005198796,0.00097224,0.00057427195,0.0017322749,0.002031191,0.0009266505,0.0019106251],"category_scores_gemma":[0.0021099648,0.0003900703,0.00040055934,0.00037380328,0.0008113544,0.0027432968,0.0024273042,0.0014118347,0.00074311736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017913987,0.0017634893,0.03036371,0.0005869545,0.00033705082,0.0016615366,0.0033381607,0.18693064,0.26864016,0.07260009,0.018859979,0.41312683],"study_design_scores_gemma":[0.00007366858,0.0004597104,0.0038856727,0.000058535647,0.00010922183,0.00036733682,0.00018548525,0.90833163,0.056308385,0.009814364,0.020318892,0.00008713672],"about_ca_topic_score_codex":0.0019524123,"about_ca_topic_score_gemma":0.0019090789,"teacher_disagreement_score":0.002031191,"about_ca_system_score_codex":0.00082836807,"about_ca_system_score_gemma":0.0010812511,"threshold_uncertainty_score":0.008027136},"labels":[],"label_agreement":null},{"id":"W4408325607","doi":"10.1109/globecom52923.2024.10901220","title":"Accelerating PBFT in IoT blockchain applications by overlapping consensus rounds","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Consensus algorithm; Computer science; Internet of Things; Computer security; Data science","score_opus":0.016287525425514274,"score_gpt":0.2616206740362393,"score_spread":0.24533314861072503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408325607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1663711,0.00033125456,0.82826453,0.00028041608,0.000053181484,0.00018484874,0.000033237935,0.0017425793,0.0027387533],"genre_scores_gemma":[0.92474973,0.00012111146,0.073818915,0.000036369875,0.000019421865,0.00007819723,0.000025665118,0.00004576288,0.0011049564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868006,0.00046561047,0.00006386993,0.00017709748,0.00041123808,0.00020222929],"domain_scores_gemma":[0.99710673,0.0013624147,0.0002787404,0.00074332056,0.000367379,0.0001413988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021493295,0.00046639857,0.00059252296,0.00050080725,0.001058633,0.0006332452,0.0012606485,0.000809467,0.0015572158],"category_scores_gemma":[0.0043927804,0.00027048175,0.0002894077,0.0006125091,0.0008141354,0.0019718064,0.0015879521,0.00084587873,0.00035616502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012034677,0.00024114526,0.0048198085,0.0002850487,0.00008579659,0.0008844696,0.0008201186,0.6952821,0.05948602,0.04353921,0.0025150545,0.19083764],"study_design_scores_gemma":[0.000058560687,0.00021252311,0.0003745388,0.000014474853,0.000015632551,0.00018046152,0.00007917754,0.9677917,0.017426545,0.011435847,0.0023914438,0.000019136402],"about_ca_topic_score_codex":0.0014604332,"about_ca_topic_score_gemma":0.0012750342,"teacher_disagreement_score":0.0021493295,"about_ca_system_score_codex":0.0005001184,"about_ca_system_score_gemma":0.0010291983,"threshold_uncertainty_score":0.011366844},"labels":[],"label_agreement":null},{"id":"W4408504935","doi":"10.1145/3708914","title":"Ad Hoc Transactions: What They Are and Why We Should Care","year":2025,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.04591664061142832,"score_gpt":0.3039494677584342,"score_spread":0.25803282714700587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408504935","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020741453,0.1204691,0.06222988,0.7368416,0.01321578,0.00026474686,0.00035339274,0.00077586644,0.045108184],"genre_scores_gemma":[0.51000375,0.11560567,0.08330005,0.2206131,0.022440653,0.00066405337,0.00071883603,0.0016821504,0.044971712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9762275,0.00921858,0.001726114,0.0027430106,0.007818373,0.0022664405],"domain_scores_gemma":[0.9030048,0.050104413,0.005139822,0.010801843,0.022135014,0.008814046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024152335,0.0008187231,0.0011152086,0.0018741942,0.0041517816,0.016364396,0.003909413,0.008124682,0.006599018],"category_scores_gemma":[0.07076856,0.001121919,0.000798049,0.002376286,0.024381723,0.04734308,0.004967713,0.014529938,0.00343357],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025931335,0.00023098584,0.010130646,0.0020268247,0.00012946819,0.00083602936,0.014919578,0.000991639,0.0010897313,0.4858527,0.26154235,0.2219907],"study_design_scores_gemma":[0.00007591551,0.00010226923,0.0022798046,0.0020464442,0.000059295166,0.0015583462,0.012945358,0.0015963272,0.0007642446,0.42858973,0.5498686,0.00011360122],"about_ca_topic_score_codex":0.00948928,"about_ca_topic_score_gemma":0.0048512695,"teacher_disagreement_score":0.024152335,"about_ca_system_score_codex":0.0048144795,"about_ca_system_score_gemma":0.008783666,"threshold_uncertainty_score":0.12773132},"labels":[],"label_agreement":null},{"id":"W4408867181","doi":"10.1145/3689031.3717457","title":"Achilles: Efficient TEE-Assisted BFT Consensus via Rollback Resilient Recovery","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rollback; Computer science; Database transaction; Database","score_opus":0.007966600894965264,"score_gpt":0.23967139946878904,"score_spread":0.23170479857382378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408867181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030363195,0.00024389007,0.96104926,0.0002894822,0.00015960677,0.00019199739,0.00012019885,0.003549739,0.0040325867],"genre_scores_gemma":[0.72405076,0.00018448435,0.26869997,0.00023610133,0.000080987804,0.00023527419,0.00043780092,0.00029191893,0.0057827127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983524,0.0003916879,0.00012885811,0.0002524243,0.00064537715,0.00022920388],"domain_scores_gemma":[0.9965708,0.0007581166,0.00033545814,0.0013328685,0.0008080051,0.00019469247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017949663,0.000571752,0.00085229333,0.000809992,0.0011485147,0.0009919297,0.0022427868,0.0011798475,0.0032889722],"category_scores_gemma":[0.0060717696,0.0003335442,0.00044808834,0.00077633257,0.00096479023,0.0021624053,0.0033130886,0.0016413446,0.0010610456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017208962,0.00031458883,0.0015740779,0.0004252648,0.00016634527,0.00074036507,0.00076518825,0.42330563,0.07992133,0.07156927,0.015276418,0.40422055],"study_design_scores_gemma":[0.0001832121,0.00031189216,0.00020910712,0.000029584531,0.000028789505,0.0002953862,0.0001490578,0.9443355,0.022068124,0.02379702,0.008526499,0.000065908636],"about_ca_topic_score_codex":0.0020835556,"about_ca_topic_score_gemma":0.0021919445,"teacher_disagreement_score":0.0032889722,"about_ca_system_score_codex":0.00054521766,"about_ca_system_score_gemma":0.0015277562,"threshold_uncertainty_score":0.011002719},"labels":[],"label_agreement":null},{"id":"W4408954947","doi":"10.1109/ds-rt62209.2024.00017","title":"Adding Flexibly in Distributed Simulation of Space Missions by Enhancing the SpaceFOM Standard","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Space (punctuation); Space technology; Distributed computing; Aerospace engineering; Systems engineering; Computational science; Operating system; Engineering","score_opus":0.011867061004894378,"score_gpt":0.280634821612123,"score_spread":0.2687677606072286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408954947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052992854,0.00035441274,0.9317906,0.00048283587,0.00026066773,0.00018281014,0.0003125812,0.006227578,0.007395689],"genre_scores_gemma":[0.603226,0.0005142081,0.3906357,0.00028841296,0.0001228477,0.00033295414,0.0009779396,0.00080094475,0.0031009447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847454,0.0003943277,0.00020708077,0.0002207544,0.00049010984,0.00021315212],"domain_scores_gemma":[0.9973546,0.0005235316,0.00017026029,0.0012564128,0.00051832845,0.00017681523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023805606,0.00066854525,0.0006086389,0.0007294633,0.0006124974,0.0018718239,0.0020278727,0.0010544072,0.0020903144],"category_scores_gemma":[0.0068299267,0.00039294385,0.00094560697,0.00044866788,0.0006509679,0.002386737,0.002902389,0.0018792874,0.0005778791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046023348,0.00023006707,0.008660341,0.00027484747,0.00010094102,0.0002872386,0.00046446442,0.78684217,0.022435231,0.05898335,0.0067432136,0.11451787],"study_design_scores_gemma":[0.00005167713,0.000048641214,0.0003955793,0.000035476613,0.000022992419,0.000057258618,0.000031547745,0.9621223,0.007618252,0.011393493,0.018202754,0.000019922225],"about_ca_topic_score_codex":0.004757624,"about_ca_topic_score_gemma":0.005989521,"teacher_disagreement_score":0.004757624,"about_ca_system_score_codex":0.0008329049,"about_ca_system_score_gemma":0.0019311548,"threshold_uncertainty_score":0.012589753},"labels":[],"label_agreement":null},{"id":"W4409231750","doi":"10.14778/3712221.3712227","title":"How Reliable are Streams? End-to-End Processing-Guarantee Validation and Performance Benchmarking of Stream Processing Systems","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmarking; Stream processing; STREAMS; Computer science; End-to-end principle; Real-time computing; Distributed computing; Computer network; Business","score_opus":0.012008114402951214,"score_gpt":0.220075315563754,"score_spread":0.2080672011608028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409231750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60751384,0.0009570543,0.36804658,0.0008865803,0.0001383136,0.00024178931,0.00089474727,0.01796612,0.0033549136],"genre_scores_gemma":[0.9570993,0.00015820943,0.04127083,0.00007609788,0.000022403672,0.00008180212,0.00064787845,0.0003751644,0.0002683703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884597,0.0044911015,0.0010711683,0.0009960883,0.0043222588,0.0006595989],"domain_scores_gemma":[0.9510816,0.026080018,0.00468151,0.008435803,0.008516825,0.0012042486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011372523,0.000976522,0.0007921665,0.0014601266,0.000619518,0.0024358402,0.0018856218,0.0009825006,0.0009136312],"category_scores_gemma":[0.072497666,0.00047308323,0.00036960797,0.001279207,0.0012511523,0.0039187637,0.0013914733,0.0013493232,0.00029956864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029628584,0.00078598654,0.12621269,0.0009874929,0.00042079817,0.0007647815,0.0018752818,0.5200634,0.04826692,0.020650737,0.0104570575,0.26655194],"study_design_scores_gemma":[0.00004796888,0.00034586937,0.008716609,0.000059874365,0.00004862916,0.00016057046,0.00026182292,0.9369318,0.041283928,0.00948051,0.002615806,0.000046549958],"about_ca_topic_score_codex":0.0029913667,"about_ca_topic_score_gemma":0.0018798761,"teacher_disagreement_score":0.011372523,"about_ca_system_score_codex":0.0011597312,"about_ca_system_score_gemma":0.0015770152,"threshold_uncertainty_score":0.060144365},"labels":[],"label_agreement":null},{"id":"W4409494698","doi":"10.1109/tvt.2025.3561360","title":"An Efficient and Scalable Byzantine Fault Tolerant Consensus for Vehicular Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scalability; Byzantine fault tolerance; Fault tolerance; Computer science; Distributed computing; Computer network","score_opus":0.006422442748762867,"score_gpt":0.24161047383190898,"score_spread":0.23518803108314612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409494698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016691528,0.00026322267,0.98000723,0.0002353068,0.00012659708,0.000101168676,0.00007078761,0.00068173197,0.0018223488],"genre_scores_gemma":[0.6788457,0.00061917055,0.31226295,0.00016582343,0.00012758457,0.00032198883,0.0005018913,0.00014382512,0.0070110816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914336,0.00016559023,0.00005403179,0.0001953494,0.0003115474,0.00013003251],"domain_scores_gemma":[0.99943346,0.00013437831,0.000058513207,0.00010998758,0.00021225707,0.000051336043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007159198,0.0007916534,0.0010403359,0.0006541063,0.0008811531,0.0009881161,0.0015471927,0.0008650372,0.0015694198],"category_scores_gemma":[0.0023407524,0.00030162287,0.00054525404,0.0008008723,0.00053386966,0.0017012731,0.0020656814,0.0009882504,0.0005614279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020816742,0.000066686705,0.00045308092,0.00023723324,0.00004723265,0.00032640377,0.00029295345,0.77491075,0.031246116,0.03541632,0.0085692415,0.14822583],"study_design_scores_gemma":[0.00002014336,0.00005810565,0.000057953905,0.0000074530935,0.000007630464,0.000050774066,0.000034678902,0.98698354,0.003593217,0.006267988,0.002907909,0.000010526857],"about_ca_topic_score_codex":0.004042151,"about_ca_topic_score_gemma":0.004196804,"teacher_disagreement_score":0.004042151,"about_ca_system_score_codex":0.00088780833,"about_ca_system_score_gemma":0.0016602862,"threshold_uncertainty_score":0.008037269},"labels":[],"label_agreement":null},{"id":"W4409872544","doi":"10.1007/s00446-025-00478-8","title":"Efficient bounded timestamping from standard synchronization primitives","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Bounded function; Distributed computing; Parallel computing; Theoretical computer science; Computer network; Mathematics","score_opus":0.0062293000241328495,"score_gpt":0.2439041454820549,"score_spread":0.23767484545792206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409872544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015537308,0.00040461178,0.9699948,0.00025865436,0.00028499452,0.000100480596,0.00022508013,0.008354471,0.0048395335],"genre_scores_gemma":[0.49933535,0.000462224,0.48878047,0.000287301,0.00030045808,0.00028985628,0.0013537949,0.0016350875,0.007555465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605715,0.0007305389,0.00030667256,0.00048402714,0.0019197185,0.00050175656],"domain_scores_gemma":[0.98973686,0.003308286,0.0005261871,0.0052750325,0.00086500536,0.0002886247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023728858,0.0013854105,0.0017229404,0.0016163936,0.0010979249,0.0028957976,0.0027777574,0.0010733621,0.008361707],"category_scores_gemma":[0.0120164845,0.0010371004,0.00079050224,0.0027555618,0.00137798,0.0058240113,0.006296328,0.0028682442,0.0026062415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023306927,0.0002556034,0.0010054277,0.00045940132,0.000094761956,0.0002573476,0.0004361732,0.050851624,0.064194545,0.35244668,0.02509954,0.5025682],"study_design_scores_gemma":[0.00037419487,0.00024088495,0.0003528331,0.00008168457,0.00012248654,0.00023802476,0.00012279065,0.49769056,0.092283025,0.38302618,0.025383413,0.00008398195],"about_ca_topic_score_codex":0.001134263,"about_ca_topic_score_gemma":0.0023034622,"teacher_disagreement_score":0.008361707,"about_ca_system_score_codex":0.0012882634,"about_ca_system_score_gemma":0.0026886526,"threshold_uncertainty_score":0.027972639},"labels":[],"label_agreement":null},{"id":"W4410118554","doi":"10.3390/computation13050110","title":"An Algorithm Based on Connectivity Properties for Finding Cycles and Paths on Kidney Exchange Compatibility Graphs","year":2025,"lang":"en","type":"article","venue":"Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Universidad Autónoma de Nuevo León; Consejo Nacional de Ciencia y Tecnología","keywords":"Compatibility (geochemistry); Computer science; Algorithm; Mathematics; Combinatorics; Theoretical computer science; Materials science; Composite material","score_opus":0.030618029111345944,"score_gpt":0.2923444354949386,"score_spread":0.2617264063835927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410118554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025904652,0.0002415559,0.96619385,0.0004424538,0.00006225455,0.0005997823,0.0004250703,0.0012833962,0.0048468336],"genre_scores_gemma":[0.13993168,0.00027414126,0.8547217,0.00017078144,0.000039121704,0.00056247186,0.0015379539,0.00026797343,0.0024942514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936587,0.00013912952,0.00003825026,0.00023566796,0.00012807804,0.000093011746],"domain_scores_gemma":[0.9986437,0.00078059256,0.0001663699,0.00014752436,0.00017964083,0.00008207773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006779643,0.0018750856,0.0011224493,0.0022402594,0.0011999524,0.0014652838,0.0020433578,0.001730223,0.006088391],"category_scores_gemma":[0.003556757,0.00084423483,0.0016601146,0.001935322,0.0007394479,0.0027894538,0.0020111573,0.0016141152,0.0006866378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002084946,0.00034721437,0.0018093875,0.00036857228,0.000100624195,0.00023830683,0.00026539987,0.63506186,0.0042232783,0.046140425,0.010234658,0.30100164],"study_design_scores_gemma":[0.000063678,0.00007514064,0.00016002526,0.000027507136,0.00002786931,0.0000884919,0.00006725948,0.9738522,0.0010011665,0.021938767,0.002679819,0.000018053386],"about_ca_topic_score_codex":0.010491289,"about_ca_topic_score_gemma":0.011670279,"teacher_disagreement_score":0.010491289,"about_ca_system_score_codex":0.0017777467,"about_ca_system_score_gemma":0.0044663036,"threshold_uncertainty_score":0.020860434},"labels":[],"label_agreement":null},{"id":"W4410150988","doi":"10.2139/ssrn.5244339","title":"Economic Security of Multiple Shared Security Protocols","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer security; Computer science; Cryptographic protocol; Business; Cryptography","score_opus":0.011260823581507358,"score_gpt":0.2771059583105258,"score_spread":0.26584513472901844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410150988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36938214,0.0016729466,0.5181846,0.012936354,0.0004479728,0.0001727201,0.00029992493,0.00025459906,0.09664872],"genre_scores_gemma":[0.9829722,0.00034441138,0.009581868,0.0001143481,0.0001315929,0.00008285589,0.00004455266,0.000032869215,0.006695333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956897,0.0019649793,0.00018662003,0.00039705765,0.0011541,0.0006076407],"domain_scores_gemma":[0.9787375,0.014331048,0.0019363305,0.0031279936,0.0011445081,0.00072266633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005100837,0.00049181,0.0010761839,0.0013186799,0.0014894302,0.0049121394,0.0016892216,0.0019157986,0.007518572],"category_scores_gemma":[0.022301173,0.00059956586,0.0007426972,0.0014750375,0.0037490893,0.0083953105,0.0033661933,0.003131391,0.00041781674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018697718,0.00002689239,0.0003209845,0.000029065632,0.000024008927,0.00005562877,0.000065725675,0.029711422,0.00047187647,0.9611233,0.0008719764,0.0071120267],"study_design_scores_gemma":[0.000050297353,0.000025417168,0.00019380791,0.000014326215,0.000014808662,0.00004223309,0.000050725062,0.1187885,0.0003584163,0.8784682,0.0019813657,0.000011894533],"about_ca_topic_score_codex":0.0011892698,"about_ca_topic_score_gemma":0.0010030073,"teacher_disagreement_score":0.007518572,"about_ca_system_score_codex":0.0034455964,"about_ca_system_score_gemma":0.0026911574,"threshold_uncertainty_score":0.026976109},"labels":[],"label_agreement":null},{"id":"W4410553869","doi":"10.1007/978-3-031-91736-3_6","title":"Explicit Token-Based Communication for Mobile Entities","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Security token; Programming language; Computer network","score_opus":0.014105255105528888,"score_gpt":0.25557916781329043,"score_spread":0.24147391270776153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022219,0.0011033993,0.94912523,0.00032912169,0.00056303316,0.00007968171,0.00010489478,0.0016334875,0.02484222],"genre_scores_gemma":[0.72660583,0.0012281308,0.18613622,0.00019550144,0.00025986056,0.00019168701,0.00035218397,0.00036831346,0.08466227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993525,0.00014404855,0.000044655113,0.00010345442,0.00020116517,0.00015409313],"domain_scores_gemma":[0.99864286,0.00043590393,0.00008363833,0.00058916013,0.0001778425,0.000070500355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085280434,0.00039339982,0.00049717556,0.0003268584,0.00091300945,0.0018413663,0.0016779151,0.0010505955,0.0077944556],"category_scores_gemma":[0.0027146628,0.0004199474,0.00029008367,0.00073988107,0.00089302135,0.0041894712,0.0023446109,0.0016671283,0.0024684363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007446581,0.000117199605,0.00046405182,0.00039824823,0.00003225169,0.00042729182,0.00056035205,0.04000537,0.034307968,0.6423584,0.0147153335,0.26586884],"study_design_scores_gemma":[0.00012499312,0.00039848895,0.00057294016,0.00014566148,0.00011941712,0.00088609493,0.00022980002,0.5152439,0.062054146,0.2794836,0.14063302,0.00010793573],"about_ca_topic_score_codex":0.0005732537,"about_ca_topic_score_gemma":0.0010313498,"teacher_disagreement_score":0.0077944556,"about_ca_system_score_codex":0.0006268307,"about_ca_system_score_gemma":0.0008089677,"threshold_uncertainty_score":0.026075125},"labels":[],"label_agreement":null},{"id":"W4411141774","doi":"10.1145/3725254","title":"Towards Update-Dependent Analysis of Query Maintenance","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya","keywords":"Computer science; Query optimization; Information retrieval","score_opus":0.029137233481638006,"score_gpt":0.2919665382818373,"score_spread":0.2628293048001993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411141774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122953,0.0020859074,0.8560124,0.003981926,0.00015786814,0.00021953801,0.0008090761,0.0014393831,0.012340914],"genre_scores_gemma":[0.84872425,0.0012788809,0.1407419,0.001129284,0.0008809345,0.00039045105,0.0011366117,0.0007428442,0.0049747936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911203,0.0019161791,0.00040775244,0.0015510949,0.0038489886,0.0011557492],"domain_scores_gemma":[0.9401087,0.045937303,0.0034013393,0.006764219,0.0028622025,0.00092630746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005349948,0.0014242465,0.0015455202,0.0022675043,0.0015355379,0.004319074,0.0053273137,0.0019236011,0.0047589336],"category_scores_gemma":[0.045319147,0.0012867048,0.0016630912,0.0024717248,0.0033117128,0.016197408,0.0045888275,0.0061288457,0.00066707894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015852092,0.00056471885,0.007568233,0.0008807058,0.00019266694,0.00041118215,0.0014617739,0.43509486,0.023360467,0.41159043,0.011687318,0.10560236],"study_design_scores_gemma":[0.000039274775,0.00008705042,0.0006790821,0.000022096001,0.000046906876,0.00011041144,0.00008859996,0.8484834,0.0030879972,0.14508142,0.0022519047,0.000021876012],"about_ca_topic_score_codex":0.0025036607,"about_ca_topic_score_gemma":0.0015463406,"teacher_disagreement_score":0.005349948,"about_ca_system_score_codex":0.0044779484,"about_ca_system_score_gemma":0.0022790115,"threshold_uncertainty_score":0.032489955},"labels":[],"label_agreement":null},{"id":"W4411171829","doi":"10.1109/tsmc.2025.3571020","title":"Event-Triggered Fault-Tolerant Consensus Control of Multiagent Systems With Hybrid Attacks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Multi-agent system; Consensus; Fault tolerance; Distributed computing; Event (particle physics); Artificial intelligence","score_opus":0.00876596362924627,"score_gpt":0.22705109124533313,"score_spread":0.21828512761608684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411171829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042230546,0.00013616843,0.95559907,0.00009308932,0.000042178905,0.00003171696,0.000013688066,0.00012653304,0.001727035],"genre_scores_gemma":[0.98908186,0.00005669438,0.010191008,0.000023005468,0.00001258999,0.000032826996,0.000011618624,0.000005142798,0.00058517605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932814,0.00019011137,0.000040967458,0.00018444036,0.00017266575,0.00008369963],"domain_scores_gemma":[0.99905854,0.00040687554,0.00022167021,0.000079764606,0.00018568464,0.000047509446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089352013,0.0006390403,0.00056681084,0.00025836533,0.00031282302,0.0007217519,0.00083453144,0.0006151807,0.00057599327],"category_scores_gemma":[0.0019993351,0.00014489538,0.00038026553,0.00027122186,0.00080058386,0.0007229852,0.00086943206,0.0006972526,0.000067907655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013417777,0.000029825942,0.0006170624,0.00009277335,0.00005426243,0.00017818862,0.00014199394,0.94642234,0.007874992,0.024595343,0.00023499149,0.019624023],"study_design_scores_gemma":[0.000005504294,0.000049788723,0.000083522486,0.00000197907,0.0000051302823,0.000011991795,0.000008917139,0.9966293,0.00071329327,0.0023365305,0.00015092903,0.0000030113852],"about_ca_topic_score_codex":0.0017701911,"about_ca_topic_score_gemma":0.0007863352,"teacher_disagreement_score":0.0017701911,"about_ca_system_score_codex":0.0004952892,"about_ca_system_score_gemma":0.0004432508,"threshold_uncertainty_score":0.0047254562},"labels":[],"label_agreement":null},{"id":"W4411277043","doi":"10.1145/3732772.3733518","title":"Byzantine Agreement with Predictions","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Ministry of Education - Singapore","keywords":"Byzantine architecture; Computer science; Ancient history; History","score_opus":0.005039987196480084,"score_gpt":0.22027428998271154,"score_spread":0.21523430278623146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411277043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11049974,0.000682165,0.8643518,0.0055095507,0.0004889144,0.0001950525,0.0002933882,0.00082690996,0.017152522],"genre_scores_gemma":[0.89862186,0.00064025813,0.083090104,0.00070345565,0.0007347081,0.00040883757,0.00039548613,0.00041481646,0.01499064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98566645,0.0057573267,0.00068244257,0.003035488,0.0029129903,0.0019453273],"domain_scores_gemma":[0.9268254,0.05255147,0.0061330665,0.008905672,0.003968107,0.0016162078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012300671,0.001411699,0.0025624293,0.0013499914,0.00470289,0.005568594,0.0031322811,0.0044616484,0.0072218627],"category_scores_gemma":[0.06688805,0.001084992,0.0016668291,0.0021928488,0.0069518094,0.016401263,0.00661986,0.0071908534,0.0016658169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032921496,0.0000742823,0.0008042314,0.00015302794,0.000055678076,0.0004459532,0.0010089828,0.062444568,0.0017871034,0.9175162,0.0029147074,0.012466156],"study_design_scores_gemma":[0.00009859912,0.0000646047,0.000090276226,0.000026155658,0.000026501551,0.00009618061,0.000117723874,0.21307021,0.001959873,0.7805378,0.0038757997,0.000036291134],"about_ca_topic_score_codex":0.0018899794,"about_ca_topic_score_gemma":0.0011708138,"teacher_disagreement_score":0.012300671,"about_ca_system_score_codex":0.0026891425,"about_ca_system_score_gemma":0.0020855444,"threshold_uncertainty_score":0.06505293},"labels":[],"label_agreement":null},{"id":"W4411277168","doi":"10.1145/3732772.3733564","title":"Brief Announcement: Self-Stabilizing Recoverable Mutual Exclusion","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Mutual exclusion; Computer science; Distributed computing","score_opus":0.006973474947594971,"score_gpt":0.23605641778179434,"score_spread":0.22908294283419936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411277168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020564182,0.026920006,0.48525774,0.18610191,0.2057955,0.0004163559,0.0010475623,0.0040008035,0.06989589],"genre_scores_gemma":[0.4309023,0.03046979,0.0893028,0.03666258,0.16234626,0.00045675205,0.0024848934,0.00088289304,0.24649175],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908674,0.00022926596,0.000039364917,0.00018461522,0.0003386742,0.000121197],"domain_scores_gemma":[0.9987024,0.0005590033,0.000087015695,0.000110989815,0.000372728,0.00016778457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015181083,0.00048046757,0.00044778598,0.0003358358,0.00071097957,0.0015703308,0.0014472743,0.0028592057,0.0071710064],"category_scores_gemma":[0.0040731076,0.00029660284,0.00036550584,0.0005849796,0.0012495148,0.0021417201,0.0006729195,0.002504435,0.0028241298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035580827,0.00010380511,0.0003806592,0.000785252,0.000048728398,0.0005069678,0.00014201472,0.009270747,0.0059223836,0.24707386,0.5624412,0.17296861],"study_design_scores_gemma":[0.00015072808,0.00035472267,0.00053271133,0.000109450986,0.00006043397,0.00066109386,0.00008390106,0.041382197,0.009184141,0.10525205,0.8421307,0.00009793399],"about_ca_topic_score_codex":0.00057295494,"about_ca_topic_score_gemma":0.0006771261,"teacher_disagreement_score":0.0071710064,"about_ca_system_score_codex":0.0008519308,"about_ca_system_score_gemma":0.0008071828,"threshold_uncertainty_score":0.02398938},"labels":[],"label_agreement":null},{"id":"W4411277737","doi":"10.1145/3732772.3733550","title":"You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Byzantine architecture; Signature (topology); Computer science; Byzantine fault tolerance; Mathematics; Distributed computing; History; Ancient history","score_opus":0.010694284755927898,"score_gpt":0.19989372245376733,"score_spread":0.18919943769783942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411277737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08472714,0.00024198258,0.903605,0.0006992169,0.00008822739,0.00030627468,0.0000892805,0.0025533764,0.0076895305],"genre_scores_gemma":[0.6820537,0.00031626853,0.30800897,0.00034177452,0.00011552029,0.00063373504,0.00013803295,0.00053269026,0.007859427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99475634,0.0015843746,0.0004832155,0.00075717486,0.0014344851,0.0009844378],"domain_scores_gemma":[0.9928497,0.0023318708,0.0009755575,0.0031324364,0.0005208802,0.00018946978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004101152,0.0010769193,0.0013081502,0.00088865805,0.0016132855,0.004872506,0.0020094784,0.0025005427,0.005777912],"category_scores_gemma":[0.010526612,0.00092494715,0.0015783717,0.000830159,0.0061290986,0.0098827295,0.0053969882,0.004263606,0.0013696776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006236884,0.00012014744,0.0010773363,0.00030737685,0.000045704488,0.0006649802,0.0017057807,0.035708796,0.020309078,0.9024704,0.001273393,0.035693314],"study_design_scores_gemma":[0.00043844923,0.00065444416,0.0004638233,0.00024424653,0.00022289978,0.0006992194,0.00046077505,0.2825943,0.11932713,0.5559949,0.038736433,0.00016333368],"about_ca_topic_score_codex":0.0016481724,"about_ca_topic_score_gemma":0.0009685059,"teacher_disagreement_score":0.005777912,"about_ca_system_score_codex":0.0013771798,"about_ca_system_score_gemma":0.0023959705,"threshold_uncertainty_score":0.021689236},"labels":[],"label_agreement":null},{"id":"W4411278257","doi":"10.1145/3732772.3733517","title":"Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent Memory","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Computer science; Algorithm; Parallel computing","score_opus":0.06507168199931902,"score_gpt":0.3193786148196355,"score_spread":0.25430693282031647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411278257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021956695,0.02720961,0.66396993,0.110328756,0.10262649,0.00037633567,0.00067240506,0.006089845,0.06677001],"genre_scores_gemma":[0.3706558,0.038561843,0.28019816,0.019968165,0.088419884,0.0005313958,0.0013775452,0.0021795745,0.19810762],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990472,0.00027949578,0.00007129763,0.00016469082,0.00033889923,0.00009830762],"domain_scores_gemma":[0.99703014,0.0015090157,0.00013878715,0.0003262097,0.0007486312,0.0002471455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022094692,0.0006164884,0.0002983951,0.0005408907,0.00064238725,0.0016990418,0.0011251887,0.0015953189,0.011259458],"category_scores_gemma":[0.006823195,0.0003674953,0.00043465392,0.0005791942,0.0013107618,0.0036641594,0.00060762867,0.0032649236,0.003659497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004227661,0.0002003393,0.0008725674,0.000883785,0.00004671717,0.0003446182,0.00026307235,0.0047124526,0.013060198,0.22847573,0.39710188,0.35361588],"study_design_scores_gemma":[0.0001199299,0.0005377446,0.0006299862,0.00010429105,0.000055485256,0.0004901951,0.000085085296,0.016289659,0.016808737,0.08616574,0.87863606,0.00007712164],"about_ca_topic_score_codex":0.0006416203,"about_ca_topic_score_gemma":0.0008313004,"teacher_disagreement_score":0.011259458,"about_ca_system_score_codex":0.0007878288,"about_ca_system_score_gemma":0.0008562078,"threshold_uncertainty_score":0.03766668},"labels":[],"label_agreement":null},{"id":"W4411403262","doi":"10.1145/3725319","title":"Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Universitas Brawijaya","keywords":"Computer science; Preemption; Context switch; Scheduling (production processes); Database transaction; Latency (audio); Operating system; Parallel computing; Embedded system; Distributed computing; Database","score_opus":0.051498392685557864,"score_gpt":0.28534842485965994,"score_spread":0.23385003217410208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411403262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40520212,0.0164054,0.5485639,0.0054100296,0.0012553709,0.00020463242,0.00021205071,0.010377885,0.012368538],"genre_scores_gemma":[0.92426133,0.0018115778,0.06920459,0.00090700295,0.00021600009,0.00004700834,0.000113173744,0.0004905087,0.0029489002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771667,0.0003672025,0.00014650608,0.00030715187,0.0011248313,0.00033763936],"domain_scores_gemma":[0.99441445,0.0017597744,0.00072672294,0.001672153,0.00089389,0.0005330122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031605733,0.0004478312,0.0004877634,0.00033998193,0.00072141184,0.0027826724,0.0022609313,0.00073440664,0.0011591199],"category_scores_gemma":[0.009897531,0.00044273853,0.00026720905,0.0005724852,0.0008800514,0.0033432757,0.0010741118,0.0018243723,0.0006112628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034512808,0.000825295,0.046577234,0.00086082844,0.00024258802,0.00089840346,0.0024568916,0.026641041,0.12288985,0.0583507,0.0246965,0.7121093],"study_design_scores_gemma":[0.00063767063,0.0024885137,0.019849613,0.00049054663,0.0005121358,0.0032477607,0.0022347316,0.4783119,0.25097984,0.07648045,0.16443327,0.00033358287],"about_ca_topic_score_codex":0.002805056,"about_ca_topic_score_gemma":0.004081802,"teacher_disagreement_score":0.0031605733,"about_ca_system_score_codex":0.00076318864,"about_ca_system_score_gemma":0.0015819812,"threshold_uncertainty_score":0.01671487},"labels":[],"label_agreement":null},{"id":"W4411687182","doi":"10.61091/um123-14","title":"Certified domination critical graphs upon vertex removal","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Certification; Combinatorics; Graph; Discrete mathematics; Political science","score_opus":0.01611058620925376,"score_gpt":0.290874895316638,"score_spread":0.27476430910738425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3268442,0.00085845886,0.53331864,0.002141443,0.00071722234,0.0011227969,0.0043167667,0.0053683133,0.12531213],"genre_scores_gemma":[0.77662015,0.00066362263,0.1439526,0.0011781292,0.00035990842,0.0007138288,0.007108102,0.0011135539,0.068290085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.00016399907,0.000061688865,0.000351427,0.00042808714,0.0002035444],"domain_scores_gemma":[0.9950631,0.0018547359,0.00045471836,0.0011095791,0.001072076,0.00044578788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096522743,0.0008605316,0.0006460934,0.0022015404,0.0010343244,0.0017190212,0.0012644943,0.00077464915,0.009495822],"category_scores_gemma":[0.0077503244,0.0005022156,0.00063624216,0.0016791624,0.0012585777,0.0024017068,0.0021714806,0.00155464,0.0021412026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013535733,0.000298862,0.005752706,0.00093214586,0.000121280886,0.0016293138,0.0012925756,0.08097097,0.046723,0.4949384,0.05806561,0.30792165],"study_design_scores_gemma":[0.0002665304,0.0002759854,0.0035932364,0.00016447733,0.00011983647,0.001423823,0.0006174936,0.18640347,0.036996905,0.6745298,0.09552125,0.00008725408],"about_ca_topic_score_codex":0.0031909843,"about_ca_topic_score_gemma":0.003745157,"teacher_disagreement_score":0.009495822,"about_ca_system_score_codex":0.0017756511,"about_ca_system_score_gemma":0.0019704734,"threshold_uncertainty_score":0.031766713},"labels":[],"label_agreement":null},{"id":"W4411791375","doi":"10.1145/3735546.3735858","title":"[Vision] Towards oblivious property graph databases","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Computer science; Graph database; Property (philosophy); Graph; Database; Information retrieval; Theoretical computer science","score_opus":0.019984672448965946,"score_gpt":0.2868022405866574,"score_spread":0.2668175681376914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411791375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007945266,0.0011148703,0.95841414,0.009588158,0.0007043235,0.0003205752,0.0012047354,0.007345865,0.013362034],"genre_scores_gemma":[0.21893728,0.0027348073,0.73111844,0.008394364,0.0010236865,0.00060446624,0.0052870316,0.00213561,0.029764332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950262,0.0009320312,0.0004440893,0.00085610093,0.0023014203,0.00044016403],"domain_scores_gemma":[0.9827787,0.0022320459,0.0006402168,0.010730943,0.0031201602,0.00049792184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00488567,0.00072103314,0.00096601265,0.0017549937,0.0016556027,0.0050895875,0.004160592,0.0022673307,0.008695677],"category_scores_gemma":[0.016532658,0.00087301695,0.0012704494,0.003004353,0.0025906134,0.014003153,0.006507783,0.004563505,0.005134501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045271727,0.00018773979,0.0015268779,0.00036846552,0.00012456281,0.00024587396,0.0005683304,0.018738728,0.007947849,0.63033694,0.12945028,0.21005169],"study_design_scores_gemma":[0.00011933147,0.00012306064,0.00043624523,0.00010527471,0.00006015845,0.00054748106,0.0002243464,0.14034711,0.012150876,0.59231555,0.25349265,0.000077827],"about_ca_topic_score_codex":0.003268367,"about_ca_topic_score_gemma":0.0024425536,"teacher_disagreement_score":0.008695677,"about_ca_system_score_codex":0.0018052944,"about_ca_system_score_gemma":0.0028394512,"threshold_uncertainty_score":0.029089987},"labels":[],"label_agreement":null},{"id":"W4412352782","doi":"10.1109/tro.2025.3588455","title":"Baseline Policy Adapting and Abstraction of Shared Autonomy for High-Level Robot Operations","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McGill University","funders":"","keywords":"Baseline (sea); Autonomy; Abstraction; Robot; Computer science; Robotics; Artificial intelligence; Human–computer interaction; Political science","score_opus":0.02941340596474761,"score_gpt":0.2828535396003014,"score_spread":0.2534401336355538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412352782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008934687,0.00004251044,0.9898465,0.000069233414,0.000012287678,0.00002510569,0.000015543112,0.00031047827,0.0007435808],"genre_scores_gemma":[0.7328189,0.000085677646,0.2646018,0.0001066844,0.000026412463,0.00019241618,0.00008682725,0.00012124361,0.0019600803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998804,0.000375076,0.00005060552,0.0003113899,0.00030626036,0.0001527002],"domain_scores_gemma":[0.9987791,0.0005247223,0.00016105638,0.00026819558,0.0001501514,0.00011671887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016515896,0.00067609054,0.0007508941,0.00028477766,0.0004643104,0.0007302782,0.001990184,0.0009067303,0.0020077503],"category_scores_gemma":[0.0036628244,0.00036373775,0.00068429817,0.00025224133,0.0012975797,0.0017106468,0.001829744,0.0018583164,0.0003123063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007173667,0.00008598013,0.0005518729,0.000044633394,0.000030116225,0.000058579863,0.00016028743,0.91473913,0.0032093597,0.03727552,0.00063552987,0.04313719],"study_design_scores_gemma":[0.000005565674,0.000025790501,0.00007825565,0.00000265708,0.0000030386102,0.000007682571,0.000006399518,0.9905179,0.0005555191,0.008409822,0.00038312853,0.000004140573],"about_ca_topic_score_codex":0.0048360582,"about_ca_topic_score_gemma":0.0035965594,"teacher_disagreement_score":0.0048360582,"about_ca_system_score_codex":0.0013665643,"about_ca_system_score_gemma":0.002298838,"threshold_uncertainty_score":0.009915233},"labels":[],"label_agreement":null},{"id":"W4412819554","doi":"10.1007/978-3-031-89033-8_5","title":"Primitive C++","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Biology","score_opus":0.018919721202328498,"score_gpt":0.24326756100768315,"score_spread":0.22434783980535467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819554","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002186439,0.002034614,0.3519085,0.00068469014,0.0012916186,0.00032028958,0.0097628,0.09503667,0.5367744],"genre_scores_gemma":[0.033339072,0.0022325192,0.3453963,0.001461642,0.00056266604,0.0007481148,0.018690657,0.029625177,0.5679438],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990502,0.00007789794,0.000052579202,0.00019779286,0.00049404305,0.00012754509],"domain_scores_gemma":[0.9992292,0.0001504582,0.000035478333,0.0002612056,0.00026124544,0.00006246173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049401284,0.0023045363,0.0012501004,0.0018376452,0.0012739495,0.0033605206,0.002850399,0.0010942629,0.22619735],"category_scores_gemma":[0.0024109157,0.0009897354,0.0011877154,0.0026294058,0.0009179552,0.0034956166,0.0021418342,0.0029729826,0.20767932],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020140874,0.000053474072,0.00012720996,0.00060549844,0.000020741634,0.00009156326,0.00009806194,0.0015117279,0.0056575513,0.16675022,0.43632373,0.38855892],"study_design_scores_gemma":[0.00004709414,0.000029470059,0.00013193942,0.000088722394,0.00001933835,0.00020109132,0.000013882103,0.0036850208,0.006254914,0.06375145,0.92573994,0.000037128302],"about_ca_topic_score_codex":0.002006586,"about_ca_topic_score_gemma":0.0023180037,"teacher_disagreement_score":0.22619735,"about_ca_system_score_codex":0.0011146341,"about_ca_system_score_gemma":0.0013631339,"threshold_uncertainty_score":0.7567055},"labels":[],"label_agreement":null},{"id":"W4412969040","doi":"10.1007/979-8-8688-1513-3_5","title":"ReplicaSets, Replication Controller, and Deployments","year":2025,"lang":"en","type":"book-chapter","venue":"Certification study companion series","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"Replication (statistics); Computer science; Medicine; Virology","score_opus":0.03497328652243084,"score_gpt":0.27584512476192763,"score_spread":0.2408718382394968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412969040","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004945323,0.10515952,0.29274413,0.004057907,0.0057451366,0.00028794236,0.0004750433,0.0041178847,0.5824671],"genre_scores_gemma":[0.07554596,0.100251295,0.13545804,0.0029521182,0.0035978623,0.0003879217,0.0010776749,0.0017654469,0.67896366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995191,0.000052366027,0.000029320941,0.00014090394,0.0002224148,0.000035845675],"domain_scores_gemma":[0.99975485,0.0000822753,0.0000141268,0.000068372094,0.000058008107,0.000022244212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004925186,0.00059431425,0.00045343547,0.00078763557,0.0008204127,0.0031765066,0.0007864895,0.0010068815,0.017790012],"category_scores_gemma":[0.00093701994,0.00055542594,0.0003140919,0.0015206235,0.0014483809,0.0046680397,0.0012196399,0.0022458513,0.006764425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003255052,0.000026201516,0.00009262352,0.0003956626,0.0000070610126,0.00011416163,0.00033322102,0.0035208482,0.0029702827,0.7126728,0.07189676,0.20793779],"study_design_scores_gemma":[0.000006512237,0.000026412947,0.00013506202,0.00016651647,0.0000050988892,0.00035476318,0.000080287464,0.0036641103,0.0013877775,0.08949675,0.90466136,0.00001548883],"about_ca_topic_score_codex":0.0016098759,"about_ca_topic_score_gemma":0.001363404,"teacher_disagreement_score":0.017790012,"about_ca_system_score_codex":0.0009994436,"about_ca_system_score_gemma":0.0008979407,"threshold_uncertainty_score":0.05951357},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4413156630","doi":"10.1109/cvpr52734.2025.01009","title":"Zero-Shot Head Swapping in Real-World Scenarios","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation","keywords":"Shot (pellet); Zero (linguistics); Computer science; Head (geology); Single shot; Computer graphics (images); Physics; Geology; Optics; Materials science","score_opus":0.031852665638197095,"score_gpt":0.31165391121286434,"score_spread":0.27980124557466723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413156630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32105094,0.0012004124,0.6573225,0.00042270898,0.0004205044,0.00024149379,0.0008766973,0.0120887235,0.0063760653],"genre_scores_gemma":[0.7698924,0.0004045956,0.22334158,0.00037152396,0.000083600025,0.000079290076,0.0013965865,0.00082482107,0.003605716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995328,0.000092946946,0.00001866859,0.00012253656,0.00015428122,0.0000787588],"domain_scores_gemma":[0.9993086,0.00024585854,0.00004944907,0.00019503343,0.00012706725,0.0000739404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059112185,0.00084587344,0.00054665905,0.0005685697,0.00038858346,0.0005586455,0.0009850613,0.0007325568,0.0024336572],"category_scores_gemma":[0.0021647925,0.00029581154,0.00033775475,0.00035178018,0.0005385528,0.0006940607,0.0013214357,0.00061594514,0.0010931247],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024854583,0.00035124613,0.004710123,0.0005892569,0.00017782098,0.0024698186,0.0008730189,0.12116305,0.26109508,0.002615535,0.022595031,0.58087456],"study_design_scores_gemma":[0.000126051,0.0005294649,0.007898127,0.00005759149,0.00007518205,0.0028796599,0.0007233411,0.7240242,0.2400721,0.0074455435,0.016062042,0.00010670828],"about_ca_topic_score_codex":0.0019174133,"about_ca_topic_score_gemma":0.0033614952,"teacher_disagreement_score":0.0024336572,"about_ca_system_score_codex":0.000241921,"about_ca_system_score_gemma":0.0004362978,"threshold_uncertainty_score":0.008141398},"labels":[],"label_agreement":null},{"id":"W4413349752","doi":"10.1109/icde65448.2025.00197","title":"Orthrus: Accelerating Multi-BFT Consensus Through Concurrent Partial Ordering of Transactions","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Consensus algorithm; Algorithm","score_opus":0.047184724289941284,"score_gpt":0.31108678258711403,"score_spread":0.2639020582971727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413349752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08365855,0.0003300861,0.9054626,0.00023400012,0.00019227447,0.00024229144,0.00008620625,0.00491199,0.004881921],"genre_scores_gemma":[0.6449803,0.00020934739,0.34974205,0.00009093822,0.00006139975,0.00015349111,0.0002119873,0.00025431343,0.004296142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882096,0.00033642404,0.00008980445,0.00014508424,0.00048332094,0.00012448902],"domain_scores_gemma":[0.997437,0.0006479226,0.00031038863,0.0008148443,0.0005962577,0.00019355613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018854933,0.0004680079,0.00054058374,0.0006395208,0.00076824095,0.0007804456,0.0012686756,0.00054157653,0.002073943],"category_scores_gemma":[0.003904686,0.00029075623,0.00031577208,0.0005675444,0.0006543074,0.0015387366,0.0014854388,0.0009170631,0.00045739615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001132223,0.00030444862,0.0032033748,0.00039034156,0.00012419565,0.000482596,0.00080724026,0.4356154,0.118251346,0.03750433,0.010322467,0.39186206],"study_design_scores_gemma":[0.00014665618,0.0003794924,0.00048250202,0.00001578681,0.000027004533,0.00021108786,0.00010585687,0.9500106,0.032213688,0.0074978196,0.008872793,0.0000366609],"about_ca_topic_score_codex":0.0028710533,"about_ca_topic_score_gemma":0.003507906,"teacher_disagreement_score":0.0028710533,"about_ca_system_score_codex":0.00045979957,"about_ca_system_score_gemma":0.001442813,"threshold_uncertainty_score":0.009971559},"labels":[],"label_agreement":null},{"id":"W4413472943","doi":"10.2316/j.2025.206-1217","title":"FIXED-TIME BIPARTITE CONSENSUS UNDER DYNAMIC EVENT-TRIGGERED MECHANISM FOR MULTI-AGENT SYSTEMS, 584-592.","year":2025,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mechanism (biology); Computer science; Multi-agent system; Distributed computing; Event (particle physics); Consensus; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.017352924249189557,"score_gpt":0.3019631493749063,"score_spread":0.28461022512571676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07618074,0.0009919945,0.90349495,0.00079780177,0.0003297744,0.000105257175,0.00024879767,0.0005448596,0.017305816],"genre_scores_gemma":[0.9621773,0.0005714703,0.028212857,0.00012417143,0.00011397785,0.00011309334,0.00026504966,0.00007200685,0.008349939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897194,0.0003264279,0.000065094406,0.00023938777,0.00023111912,0.00016599437],"domain_scores_gemma":[0.99782,0.0010965472,0.00021299717,0.0002013179,0.0005146062,0.00015450674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017151101,0.00055761664,0.0007826232,0.0006776103,0.0009076469,0.0014265786,0.0012924143,0.0009946077,0.0038949745],"category_scores_gemma":[0.0045138015,0.0003749752,0.0008860138,0.0007490431,0.0013003398,0.0023687717,0.0010789082,0.0011795087,0.0006017995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087443524,0.0001635207,0.0016047336,0.0003729815,0.00024188618,0.0004961788,0.00034417617,0.5586838,0.013793173,0.35201746,0.011240855,0.060166754],"study_design_scores_gemma":[0.000060626742,0.00011075451,0.0005666492,0.000016010603,0.000046532878,0.000092486625,0.000068394984,0.87831306,0.0016662611,0.11696638,0.0020656188,0.000027189202],"about_ca_topic_score_codex":0.0053629833,"about_ca_topic_score_gemma":0.0044878325,"teacher_disagreement_score":0.0053629833,"about_ca_system_score_codex":0.0016834812,"about_ca_system_score_gemma":0.0014470608,"threshold_uncertainty_score":0.013029993},"labels":[],"label_agreement":null},{"id":"W4413679619","doi":"10.1109/compsac65507.2025.00159","title":"On the Migration of Legacy Systems to an Event-Driven Architecture: A Survey","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Architecture; Legacy system; Event (particle physics); History; Programming language; Archaeology; Software","score_opus":0.01816102088618299,"score_gpt":0.27364260219826425,"score_spread":0.25548158131208126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413679619","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98109996,0.0061569978,0.0026041372,0.0027736605,0.000078140016,0.00022475765,0.001200163,0.00005718798,0.0058048526],"genre_scores_gemma":[0.9685384,0.018686222,0.0037172134,0.0029614498,0.00009496854,0.0004259695,0.0024269344,0.000063804786,0.0030849774],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942419,0.0020704225,0.000878308,0.00048595274,0.0015744591,0.00074903114],"domain_scores_gemma":[0.97554874,0.012885878,0.0042652534,0.0005003302,0.0050409054,0.0017589792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067179278,0.0003290457,0.0006364505,0.003461086,0.00068681064,0.0020031694,0.00058828155,0.0013829469,0.0020588082],"category_scores_gemma":[0.022937134,0.0005088627,0.00049941125,0.0044241734,0.0007106135,0.0045925905,0.0015588825,0.0013676859,0.0010480009],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021513965,0.0006742232,0.71588624,0.0034741322,0.00014330543,0.0013397371,0.06811557,0.00062443106,0.0030207396,0.001848198,0.018367827,0.18629052],"study_design_scores_gemma":[0.000023879798,0.0011446251,0.6881277,0.0031956348,0.00008747429,0.0037940019,0.16011532,0.0015692046,0.0010177783,0.00076375576,0.14003496,0.00012561929],"about_ca_topic_score_codex":0.0018703485,"about_ca_topic_score_gemma":0.001467374,"teacher_disagreement_score":0.0067179278,"about_ca_system_score_codex":0.0010893522,"about_ca_system_score_gemma":0.0013192634,"threshold_uncertainty_score":0.035528243},"labels":[],"label_agreement":null},{"id":"W4413755894","doi":"10.14778/3718057.3718071","title":"Cabinet: Dynamically Weighted Consensus Made Fast","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Cabinet (room); Consensus conference; Computer science; History; Library science; Archaeology","score_opus":0.004561944860713993,"score_gpt":0.21195633322434074,"score_spread":0.20739438836362675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03144537,0.0004970291,0.94618183,0.00041417396,0.00029234585,0.00028387143,0.00027555198,0.014596258,0.006013528],"genre_scores_gemma":[0.52953845,0.00028752073,0.45824626,0.00033163163,0.000095632764,0.00054377125,0.0011128881,0.00077947037,0.009064437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983,0.00040141074,0.00008588541,0.00035962142,0.0005954641,0.0002575996],"domain_scores_gemma":[0.99716115,0.0007723808,0.00024081052,0.0007943797,0.00079772377,0.00023356278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021153057,0.00084296643,0.0010253178,0.0010403348,0.0014250415,0.0012458283,0.0030602089,0.0011829191,0.004163448],"category_scores_gemma":[0.0050348523,0.00052211905,0.0004887401,0.0010834298,0.0009226926,0.002272297,0.0025451027,0.001673021,0.0013032152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016010138,0.00027097296,0.0016118274,0.0004788527,0.00018866659,0.00040005785,0.0005654362,0.4751628,0.043594755,0.048776038,0.04006705,0.3872825],"study_design_scores_gemma":[0.00020306311,0.00023494553,0.00022438657,0.000020067104,0.000025054736,0.00013556016,0.00008576727,0.9560271,0.012833698,0.016583396,0.013583568,0.00004340563],"about_ca_topic_score_codex":0.0042654285,"about_ca_topic_score_gemma":0.0046256306,"teacher_disagreement_score":0.0042654285,"about_ca_system_score_codex":0.0008459431,"about_ca_system_score_gemma":0.0021695732,"threshold_uncertainty_score":0.013928115},"labels":[],"label_agreement":null},{"id":"W4413755925","doi":"10.14778/3718057.3718077","title":"FLEET: High-Performance Durable Replicated State Machines Using Scattered and Coordinated Log Entries","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"State (computer science); Computer science; Environmental science; Algorithm","score_opus":0.007847050474531114,"score_gpt":0.2207120930686482,"score_spread":0.2128650425941171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1569668,0.0005704962,0.76969856,0.0003889366,0.00014035127,0.0006611323,0.0010783212,0.06338233,0.007113121],"genre_scores_gemma":[0.8154177,0.0001995316,0.17649391,0.00013573072,0.000038285594,0.00035505753,0.002199793,0.00067853194,0.004481468],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990939,0.00018763654,0.0000801448,0.00016107086,0.00037148813,0.0001057277],"domain_scores_gemma":[0.9980915,0.0004549113,0.00019832651,0.0009243314,0.00018829951,0.00014250253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942886,0.0005920398,0.0005068426,0.0006760973,0.0004699178,0.0012612742,0.0025268316,0.00053762575,0.0028653187],"category_scores_gemma":[0.0036212313,0.0004452216,0.0003364872,0.00076924526,0.000642402,0.0027880126,0.0022468423,0.00083810516,0.0007142499],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032258942,0.0012559111,0.00686027,0.0006412799,0.0003267023,0.001067479,0.00052780984,0.32390246,0.11652715,0.032897227,0.04871726,0.46405062],"study_design_scores_gemma":[0.00041039113,0.0006834933,0.0014688468,0.000023704719,0.00004037634,0.00034015547,0.00012184857,0.93634176,0.033017162,0.0096444655,0.017823536,0.000084187326],"about_ca_topic_score_codex":0.0024172694,"about_ca_topic_score_gemma":0.003042713,"teacher_disagreement_score":0.0028653187,"about_ca_system_score_codex":0.00054931943,"about_ca_system_score_gemma":0.0009815056,"threshold_uncertainty_score":0.00958544},"labels":[],"label_agreement":null},{"id":"W4413812283","doi":"10.14778/3725688.3725721","title":"Tabular: Efficiently Building Efficient Indexes","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.003819544727282654,"score_gpt":0.2172714366275403,"score_spread":0.21345189190025765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027522806,0.001261699,0.8673923,0.00020364024,0.000116197036,0.00024134219,0.0025507777,0.09371444,0.006996787],"genre_scores_gemma":[0.1636599,0.0012169206,0.80970025,0.00027798308,0.00008844715,0.00036252438,0.00807539,0.008585123,0.008033492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982262,0.00030527744,0.00025513212,0.0002321857,0.0007827686,0.00019843181],"domain_scores_gemma":[0.99451005,0.0015073742,0.0004283475,0.0020285014,0.0012315848,0.00029421397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022362373,0.0010263489,0.0010001984,0.001954665,0.0010217689,0.0045398516,0.0028578872,0.00082781725,0.0072703036],"category_scores_gemma":[0.009422118,0.0011444036,0.0010368036,0.0034642909,0.00087198574,0.007167565,0.0036006065,0.00097611174,0.0049474505],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014929365,0.00034269737,0.007792738,0.001908659,0.0002062755,0.00055218034,0.0009875657,0.053662516,0.043654848,0.055855814,0.07505081,0.75849295],"study_design_scores_gemma":[0.00036607136,0.0006867914,0.0023834908,0.00034925708,0.00022785555,0.0010266897,0.00053903606,0.53016907,0.16917793,0.07303827,0.22179194,0.00024360018],"about_ca_topic_score_codex":0.002326653,"about_ca_topic_score_gemma":0.0024478037,"teacher_disagreement_score":0.0072703036,"about_ca_system_score_codex":0.0008671998,"about_ca_system_score_gemma":0.0022142185,"threshold_uncertainty_score":0.024321616},"labels":[],"label_agreement":null},{"id":"W4413911617","doi":"10.32920/ifmj.v5i1-2.2427","title":"And Yet… The Paradox of Generative AI Griefbots","year":2025,"lang":"en","type":"article","venue":"Interactive Film and Media Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Philosophy; Epistemology; Psychology; Artificial intelligence; Computer science","score_opus":0.006634899431805219,"score_gpt":0.26359855647343167,"score_spread":0.25696365704162644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413911617","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08942775,0.007722577,0.17601177,0.19314897,0.0015669465,0.00020768004,0.00022736088,0.0013443622,0.5303426],"genre_scores_gemma":[0.9255964,0.0013317696,0.02725299,0.011387293,0.00049046037,0.0004143917,0.0000901098,0.00051391986,0.032922726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98243076,0.0119727645,0.00038491416,0.0018843464,0.0025404624,0.0007867056],"domain_scores_gemma":[0.97345024,0.018075576,0.0012955918,0.0041190805,0.0017301942,0.001329258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018848535,0.00063608115,0.00048137273,0.0015522992,0.008847187,0.011226243,0.0028423544,0.006385915,0.014270218],"category_scores_gemma":[0.0368481,0.0006022362,0.00057357753,0.000830049,0.044098772,0.024517056,0.010260837,0.007749848,0.0028044158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003300954,0.000025544115,0.00029825402,0.00008093299,0.0000050464146,0.00011574875,0.026420744,0.00025165282,0.0002371898,0.95087665,0.0057872417,0.015868153],"study_design_scores_gemma":[0.00005289302,0.000052691834,0.00043575573,0.00024485652,0.000009930128,0.0005195362,0.019975197,0.0019041053,0.0006609456,0.74472713,0.23136908,0.00004785719],"about_ca_topic_score_codex":0.0021023864,"about_ca_topic_score_gemma":0.0014586861,"teacher_disagreement_score":0.018848535,"about_ca_system_score_codex":0.0041249515,"about_ca_system_score_gemma":0.0021151167,"threshold_uncertainty_score":0.099681795},"labels":[],"label_agreement":null},{"id":"W4413943450","doi":"10.14778/3742728.3742738","title":"Asymmetric Linearizable Local Reads","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Programming language; Mathematics; Process management; Business","score_opus":0.005162037269071246,"score_gpt":0.21707470301876206,"score_spread":0.2119126657496908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413943450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0717325,0.0006012358,0.90712464,0.00039807986,0.00013981303,0.00021242145,0.00028812166,0.011525746,0.007977566],"genre_scores_gemma":[0.741711,0.00025027755,0.24163628,0.00035595943,0.00015256905,0.00028070257,0.00068791053,0.0005930544,0.014332164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753064,0.00041061794,0.00017013286,0.0006718776,0.0007534492,0.00046330737],"domain_scores_gemma":[0.9917385,0.0023068888,0.001005221,0.0033155852,0.0013036248,0.00033011945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763701,0.0010450961,0.0009993846,0.0006548383,0.0009905966,0.0018656417,0.0036738317,0.0010091763,0.0072881323],"category_scores_gemma":[0.004889504,0.0005224745,0.00047544896,0.0013463591,0.0010353087,0.003512857,0.0028633862,0.0015645064,0.0019946233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030939293,0.00096720323,0.004561057,0.00059218047,0.00010641798,0.00040246043,0.0008681981,0.26167348,0.08751024,0.03715958,0.02022116,0.582844],"study_design_scores_gemma":[0.00019811219,0.00061555556,0.00065770216,0.000031384097,0.0000649455,0.00031717587,0.00040209282,0.889522,0.07519285,0.02417095,0.008763982,0.0000633082],"about_ca_topic_score_codex":0.0020647743,"about_ca_topic_score_gemma":0.0040981052,"teacher_disagreement_score":0.0072881323,"about_ca_system_score_codex":0.0014195585,"about_ca_system_score_gemma":0.0017891498,"threshold_uncertainty_score":0.02438122},"labels":[],"label_agreement":null},{"id":"W4413953194","doi":"10.14778/3742728.3742730","title":"Oze: Decentralized Graph-Based Concurrency Control for Long-Running Update Transactions","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nautilus Environmental","funders":"","keywords":"Concurrency control; Computer science; Concurrency; Graph; Control (management); Distributed computing; Programming language; Theoretical computer science; Database transaction; Artificial intelligence","score_opus":0.007703296319875869,"score_gpt":0.24421487510674494,"score_spread":0.23651157878686907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413953194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023282355,0.00026469713,0.96918696,0.00021619283,0.00009239565,0.00023644646,0.00006910155,0.005016216,0.0016355503],"genre_scores_gemma":[0.6898145,0.00023275574,0.30525944,0.00028730757,0.0000920814,0.0003525758,0.00032598292,0.0005130182,0.0031223008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964218,0.0009010216,0.00027128024,0.00061931356,0.00144604,0.0003404666],"domain_scores_gemma":[0.9932539,0.0024504082,0.00072032347,0.0022956533,0.0008803681,0.00039938994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035672956,0.000895809,0.00088390533,0.0011828785,0.0010237572,0.0016858918,0.0030065433,0.00071365014,0.0020582685],"category_scores_gemma":[0.007062805,0.0005921907,0.00056234235,0.0008377359,0.0019083776,0.0036925776,0.0030465354,0.0022699353,0.0003444742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017958034,0.00075261306,0.0052462174,0.00047177338,0.00027130113,0.00040840032,0.00086520123,0.35163122,0.09793555,0.12615454,0.008171965,0.40629545],"study_design_scores_gemma":[0.00022184363,0.0002461787,0.0005591421,0.000018779734,0.000050186434,0.00013758172,0.00010166558,0.92262644,0.031681176,0.03571251,0.008568472,0.00007599224],"about_ca_topic_score_codex":0.0029867964,"about_ca_topic_score_gemma":0.0044730487,"teacher_disagreement_score":0.0035672956,"about_ca_system_score_codex":0.0010177196,"about_ca_system_score_gemma":0.002085221,"threshold_uncertainty_score":0.018865883},"labels":[],"label_agreement":null},{"id":"W4413979034","doi":"10.1109/spawc66079.2025.11143363","title":"Multi-Segment Unsourced Random Access (URA)","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Random access; Computer network","score_opus":0.02166640710677877,"score_gpt":0.30311258335721486,"score_spread":0.2814461762504361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413979034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27916038,0.0005844277,0.71257794,0.00041121137,0.00011493739,0.00020816443,0.00016347399,0.0010969978,0.0056825555],"genre_scores_gemma":[0.95893294,0.000102983104,0.03973658,0.00007026877,0.00003752972,0.000058436697,0.000037345668,0.000033666456,0.0009903302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.00053707126,0.000061108374,0.00023654326,0.00022748337,0.00025090034],"domain_scores_gemma":[0.9963367,0.0019580682,0.00052057113,0.00055471377,0.0004743542,0.00015550635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011846811,0.0006886852,0.00084811467,0.00047162507,0.00065419514,0.0012480172,0.0015345877,0.0010926557,0.0023195448],"category_scores_gemma":[0.0033508104,0.00023167669,0.0004350859,0.0008033503,0.0010216322,0.0017324522,0.00094913295,0.000636752,0.00044175584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023491376,0.00064942165,0.004090287,0.00040269492,0.00019023268,0.0014780416,0.0005237862,0.76349723,0.07250881,0.06391189,0.0025658906,0.08783265],"study_design_scores_gemma":[0.000040168732,0.00044581963,0.00045814697,0.000008894447,0.0000350744,0.00036642776,0.000074996286,0.9802924,0.01037296,0.0069573415,0.00091874576,0.000029086634],"about_ca_topic_score_codex":0.0010548542,"about_ca_topic_score_gemma":0.0011641645,"teacher_disagreement_score":0.0023195448,"about_ca_system_score_codex":0.0006048157,"about_ca_system_score_gemma":0.00049312884,"threshold_uncertainty_score":0.0077596307},"labels":[],"label_agreement":null},{"id":"W4414448603","doi":"10.48550/arxiv.2508.20424","title":"Attacks on Approximate Caches in Text-to-Image Diffusion Models","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Rendering (computer graphics); Communication source; Timing attack; Covert channel; Downgrade; Heuristics; Covert; Code (set theory)","score_opus":0.06588537185267357,"score_gpt":0.20607703764999838,"score_spread":0.1401916657973248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414448603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2393581,0.00060939026,0.7512315,0.0016818328,0.00006274462,0.00009039811,0.00024558228,0.0017415032,0.0049789664],"genre_scores_gemma":[0.9770354,0.00018950673,0.020737847,0.000148993,0.000030089162,0.00005443042,0.00006336951,0.00007326454,0.00166711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979588,0.00092213514,0.000104198785,0.00028066328,0.0005170574,0.00021717949],"domain_scores_gemma":[0.9873652,0.0074718106,0.0013872677,0.003074401,0.00050895795,0.00019240203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021813554,0.000654657,0.0011614121,0.0006755875,0.0009435482,0.0014479051,0.0010566702,0.0021317615,0.0016740423],"category_scores_gemma":[0.018879378,0.00048304058,0.0009218073,0.0008568542,0.0021704622,0.0040611015,0.0023962394,0.0021228236,0.00036181798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004847948,0.000063548134,0.0034086634,0.00009047658,0.0000919816,0.0005749511,0.00062802,0.65718,0.010639235,0.2945416,0.0029012207,0.029395454],"study_design_scores_gemma":[0.000023165105,0.000029972842,0.00017838954,0.000009767612,0.000011103878,0.00013056313,0.000030053987,0.9295747,0.0023632485,0.06678556,0.0008468075,0.000016605714],"about_ca_topic_score_codex":0.0034580673,"about_ca_topic_score_gemma":0.0021660742,"teacher_disagreement_score":0.0034580673,"about_ca_system_score_codex":0.0018385148,"about_ca_system_score_gemma":0.000761093,"threshold_uncertainty_score":0.01333946},"labels":[],"label_agreement":null},{"id":"W4415736371","doi":"10.1007/979-8-8688-2007-6_4","title":"Component Communication with Signals","year":2025,"lang":"en","type":"book-chapter","venue":"Apress pocket guides.","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"Component (thermodynamics); State (computer science); SIGNAL (programming language); Key (lock); Signal processing","score_opus":0.017785528302071283,"score_gpt":0.23863683317703188,"score_spread":0.2208513048749606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415736371","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009008772,0.0026913194,0.5668129,0.0014876783,0.0018738048,0.00016054617,0.00067721383,0.012967506,0.40432033],"genre_scores_gemma":[0.3396235,0.0059071174,0.14706655,0.001252189,0.00079164596,0.00042115193,0.0014254032,0.0031361678,0.5003763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929714,0.000113902344,0.00003403466,0.00013415219,0.00033624726,0.000084370375],"domain_scores_gemma":[0.99943155,0.00017881133,0.000028859125,0.00014341569,0.00017788673,0.000039511597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044297095,0.0009220321,0.0004237508,0.0009300015,0.0008552562,0.004379847,0.0014144637,0.0014335063,0.045803346],"category_scores_gemma":[0.0018565075,0.0003534337,0.00039186317,0.0013257413,0.0007687924,0.0027235965,0.0018188016,0.0011986626,0.023863647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003315135,0.000071826966,0.00036678647,0.000562363,0.00004194647,0.0004550757,0.0011782993,0.0076223346,0.029513562,0.5231348,0.08699253,0.34972897],"study_design_scores_gemma":[0.000047882655,0.000096091775,0.00019649662,0.00017886769,0.0000430004,0.0005300974,0.00017405798,0.021659296,0.035878535,0.08822612,0.8529238,0.000045653975],"about_ca_topic_score_codex":0.0011513688,"about_ca_topic_score_gemma":0.000992789,"teacher_disagreement_score":0.045803346,"about_ca_system_score_codex":0.0006993838,"about_ca_system_score_gemma":0.00067734363,"threshold_uncertainty_score":0.15322745},"labels":[],"label_agreement":null},{"id":"W4415884574","doi":"10.1109/mass66014.2025.00052","title":"Fast Consensus with Retries and Priority Upgrade","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Correctness; Priority inheritance; Flexibility (engineering); Protocol (science); Priority inversion; Prioritization; Latency (audio); Queueing theory; Replication (statistics)","score_opus":0.007386468391565283,"score_gpt":0.2347897747267863,"score_spread":0.22740330633522102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415884574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1641432,0.00075733487,0.8200881,0.00057523313,0.00033479647,0.00026242062,0.000135326,0.0066630314,0.0070405584],"genre_scores_gemma":[0.91542214,0.00015214525,0.08015684,0.00017213011,0.00012073375,0.00012867802,0.00010538954,0.00014256363,0.0035994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974987,0.00054424885,0.0001947565,0.00040054307,0.0009614047,0.0004003443],"domain_scores_gemma":[0.989282,0.003217602,0.0008981955,0.004208826,0.0018997563,0.00049358676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034275334,0.0005714409,0.0007808227,0.0010143245,0.0010356707,0.0011084826,0.0016901643,0.00087110256,0.0022141153],"category_scores_gemma":[0.011601867,0.00041856858,0.00045697036,0.0006754298,0.0010953831,0.0025013587,0.0023652362,0.0015754274,0.0005645994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025327806,0.0005483752,0.006525462,0.0006273862,0.00019987943,0.001167143,0.0015930277,0.3217491,0.1132574,0.159626,0.0099839745,0.38218948],"study_design_scores_gemma":[0.00031380914,0.0005841664,0.0010477199,0.000032189848,0.000096930075,0.00056437677,0.00018140624,0.89316803,0.03796293,0.054833896,0.011130192,0.00008441107],"about_ca_topic_score_codex":0.0016216665,"about_ca_topic_score_gemma":0.0014820844,"teacher_disagreement_score":0.0034275334,"about_ca_system_score_codex":0.0006366291,"about_ca_system_score_gemma":0.0016075929,"threshold_uncertainty_score":0.018126726},"labels":[],"label_agreement":null},{"id":"W4415991463","doi":"10.1145/3774322","title":"Proof-of-Execution: Low-Latency Consensus via Speculative Execution","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Protocol (science); Latency (audio); Key (lock); Distributed transaction; Transaction processing; Two-phase commit protocol; Database transaction","score_opus":0.01594775058131951,"score_gpt":0.2646067206446487,"score_spread":0.24865897006332918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023813194,0.000277902,0.97009695,0.00049421855,0.00012112779,0.00013952111,0.000038789087,0.001147195,0.0038710877],"genre_scores_gemma":[0.78869605,0.00045979774,0.20493527,0.00022856283,0.0001106347,0.00031966504,0.00015200322,0.00030531376,0.0047926577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631566,0.0013713972,0.00022820572,0.0005237276,0.0011222123,0.00043876696],"domain_scores_gemma":[0.9874315,0.0060184,0.00110172,0.003744762,0.0011536704,0.0005498887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043888576,0.0007286519,0.0008236761,0.0007298107,0.0011604875,0.0018221508,0.0026780344,0.0011625479,0.0030936836],"category_scores_gemma":[0.015666796,0.0006180533,0.0006072868,0.00075118145,0.002707676,0.0044044075,0.004804255,0.0026274272,0.0008341861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009623872,0.00024409496,0.0017871549,0.00045998322,0.00012020397,0.0011128123,0.0011892956,0.27717283,0.055332467,0.5345024,0.0056712986,0.12144503],"study_design_scores_gemma":[0.000109400935,0.0001489599,0.00011604051,0.00003529103,0.000026851894,0.00014136432,0.00008567076,0.81865597,0.019228578,0.15514548,0.0062664924,0.00003994763],"about_ca_topic_score_codex":0.0012206802,"about_ca_topic_score_gemma":0.0011177362,"teacher_disagreement_score":0.0043888576,"about_ca_system_score_codex":0.0008743202,"about_ca_system_score_gemma":0.0021717884,"threshold_uncertainty_score":0.023210764},"labels":[],"label_agreement":null},{"id":"W4416288595","doi":"10.1007/978-3-032-11127-2_6","title":"Block Transactional Memory: A Complexity Study","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Transactional memory; Block (permutation group theory); Database transaction; Software transactional memory; Transaction processing; Transactional leadership; Bottleneck; Set (abstract data type); Distributed transaction","score_opus":0.02535705820596806,"score_gpt":0.2626385736589403,"score_spread":0.2372815154529722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416288595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18581542,0.007854547,0.70991945,0.0035235644,0.00030529668,0.00025439874,0.00080414413,0.0005056974,0.09101751],"genre_scores_gemma":[0.8632535,0.0044384254,0.10258796,0.00045040122,0.00079834106,0.00034214658,0.0008748225,0.00036702174,0.026887346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.0002646332,0.000073778596,0.00015992812,0.0006793332,0.0001444465],"domain_scores_gemma":[0.9889665,0.008669174,0.0005937891,0.00095936895,0.00057851645,0.0002325336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009475644,0.0007361861,0.000860979,0.0011559383,0.0009543479,0.0039090337,0.0020808983,0.0012351313,0.009370858],"category_scores_gemma":[0.00935921,0.00072972616,0.0009798459,0.003297206,0.0015858655,0.009972378,0.0017195031,0.0027416744,0.0010242098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022647674,0.00010757299,0.0011606166,0.00032414508,0.00004067441,0.00032362062,0.00028719992,0.048557755,0.0038541984,0.89258933,0.0068432847,0.04568514],"study_design_scores_gemma":[0.000028446544,0.000064826054,0.00055935193,0.00003064994,0.000051084822,0.00047541579,0.00011605796,0.2997338,0.0019717026,0.69071645,0.006228149,0.000024134994],"about_ca_topic_score_codex":0.0011012607,"about_ca_topic_score_gemma":0.0011198444,"teacher_disagreement_score":0.009370858,"about_ca_system_score_codex":0.0015960451,"about_ca_system_score_gemma":0.0010312457,"threshold_uncertainty_score":0.031348646},"labels":[],"label_agreement":null},{"id":"W4416924220","doi":"10.1109/dasc66011.2025.11257391","title":"Tailored Interference Mixer(TIM): A Tool for Evaluating Single and Combined Interference Channel in a Multi-Core System","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interference (communication); Resource (disambiguation); Degradation (telecommunications); Channel (broadcasting); Co-channel interference; Airworthiness; Shared resource","score_opus":0.08541770293321731,"score_gpt":0.32536178398171484,"score_spread":0.23994408104849752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416924220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34865522,0.00030588394,0.62511206,0.00010072014,0.000094897245,0.00043912607,0.0008558209,0.0179178,0.0065185046],"genre_scores_gemma":[0.77405953,0.000102029786,0.22272235,0.00007110027,0.000014194363,0.0003239755,0.0004910135,0.0006403566,0.0015754513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00014307145,0.00004252508,0.00009073687,0.00037676198,0.00007719112],"domain_scores_gemma":[0.997644,0.0014098636,0.00042125807,0.00021201932,0.00023234657,0.00008044077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013118334,0.0010188979,0.00040343349,0.0014044798,0.00026250022,0.00066529226,0.00090822915,0.0006423665,0.0036689655],"category_scores_gemma":[0.0034573593,0.000257218,0.00040846813,0.00055285473,0.00044031467,0.000773459,0.00062700134,0.00074823573,0.0003830631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022706063,0.00094391394,0.025199467,0.0012522491,0.00029289795,0.00093979744,0.0008112083,0.36837995,0.3418302,0.010923155,0.0063797827,0.24077688],"study_design_scores_gemma":[0.00007564664,0.0012949792,0.005400154,0.00004189581,0.00008539803,0.00028503197,0.000097300755,0.8442487,0.14345151,0.0019370764,0.003015141,0.0000672202],"about_ca_topic_score_codex":0.00070477393,"about_ca_topic_score_gemma":0.00074964465,"teacher_disagreement_score":0.0036689655,"about_ca_system_score_codex":0.00034889084,"about_ca_system_score_gemma":0.00044077684,"threshold_uncertainty_score":0.012273908},"labels":[],"label_agreement":null},{"id":"W455120","doi":"10.1139/o79-054","title":"Coalition Command and Control in the Networked Era","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Biochemistry","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Command and control; Control (management); Computer science; Political science; Operations management; Aeronautics; Engineering; Telecommunications; Artificial intelligence","score_opus":0.0048656468522035754,"score_gpt":0.20010640487210496,"score_spread":0.19524075801990137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W455120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23576348,0.004817715,0.501362,0.013955153,0.0012126175,0.00012879705,0.00027870364,0.0015993398,0.24088226],"genre_scores_gemma":[0.9480439,0.00084710657,0.02160457,0.00021510465,0.00019085426,0.000081295664,0.0001189256,0.000053504173,0.02884464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947625,0.00013765422,0.000036112007,0.000102480284,0.00015218201,0.00009540479],"domain_scores_gemma":[0.9988292,0.00039869992,0.000112080736,0.00026842527,0.00020462103,0.00018702628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008691827,0.00029319414,0.00038110424,0.000408876,0.0008512411,0.0024170899,0.0005767151,0.00080622465,0.0064271004],"category_scores_gemma":[0.0032505705,0.00016097687,0.00024443222,0.0004841651,0.0015937937,0.0032459418,0.0024066898,0.0008422402,0.00082859694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018706871,0.0000641783,0.0015281584,0.000102975886,0.000042189826,0.00036880196,0.0009472057,0.08979457,0.0027776181,0.76446134,0.007937072,0.13178885],"study_design_scores_gemma":[0.00006481774,0.00008314346,0.0009566423,0.000063661726,0.00002798874,0.00016104827,0.0006639543,0.37411228,0.0017622709,0.5588546,0.06321333,0.000036312536],"about_ca_topic_score_codex":0.004951572,"about_ca_topic_score_gemma":0.004231091,"teacher_disagreement_score":0.0064271004,"about_ca_system_score_codex":0.001214354,"about_ca_system_score_gemma":0.0010706359,"threshold_uncertainty_score":0.021500826},"labels":[],"label_agreement":null},{"id":"W564853454","doi":"10.5821/dissertation-2117-94989","title":"Towards lightweight and high-performance hardware transactional memory","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Microsoft Research","keywords":"Transactional memory; Atomicity; Computer science; Scalability; Lock (firearm); Software transactional memory; Deadlock; Concurrency control; Synchronization (alternating current); Database transaction; Overhead (engineering); Transaction processing; Operating system; Distributed computing; Programming language; Computer network","score_opus":0.009249410517799367,"score_gpt":0.22500027265302946,"score_spread":0.2157508621352301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W564853454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047752958,0.012777254,0.8946317,0.0038989855,0.0009749388,0.00031272494,0.00042356944,0.011197782,0.028030077],"genre_scores_gemma":[0.25603154,0.005745713,0.7082112,0.0013612533,0.0006403467,0.0005509838,0.0015825763,0.0011358446,0.024740461],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973923,0.0002786916,0.00014911084,0.00026466764,0.0015735702,0.00034157897],"domain_scores_gemma":[0.997422,0.00045514363,0.00023570491,0.0007799332,0.0008940503,0.0002133016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020642714,0.00089844945,0.0007492622,0.0011092003,0.00059125933,0.0031802272,0.005752736,0.0015656032,0.0066954736],"category_scores_gemma":[0.0047945143,0.0009571102,0.0006266414,0.0018167278,0.0011766097,0.0066855764,0.003932158,0.0035534427,0.0044310465],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001358909,0.00045605563,0.003477886,0.0023662462,0.00015154557,0.00083109713,0.00061218534,0.03089224,0.12370833,0.3674666,0.06871611,0.39996287],"study_design_scores_gemma":[0.00026970627,0.0010403901,0.0015355286,0.0005008918,0.00020795633,0.00086455327,0.00035076987,0.39327347,0.08897287,0.18794023,0.3248355,0.00020810192],"about_ca_topic_score_codex":0.0014957963,"about_ca_topic_score_gemma":0.0019210944,"teacher_disagreement_score":0.0066954736,"about_ca_system_score_codex":0.0014080971,"about_ca_system_score_gemma":0.0018988096,"threshold_uncertainty_score":0.022398591},"labels":[],"label_agreement":null},{"id":"W6119002","doi":"10.4018/978-1-60566-697-6.ch002","title":"Event Models in Distributed Event Based Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in systems analysis, software engineering, and high performance computing book series","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Event (particle physics); Computer science; Implementation; Key (lock); Distributed computing; Invocation; Complex event processing; Programming language; Operating system","score_opus":0.005097244109486704,"score_gpt":0.2039589173858607,"score_spread":0.198861673276374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6119002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002359513,0.017233824,0.8724178,0.002065176,0.0011772321,0.0001787311,0.00040533036,0.0012430036,0.10291945],"genre_scores_gemma":[0.2025722,0.062418014,0.5562076,0.0020792342,0.0028479071,0.0011981535,0.0028463337,0.0011282918,0.16870229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989089,0.00028101838,0.00009848232,0.00015257912,0.0005081534,0.000050940987],"domain_scores_gemma":[0.9986721,0.0008344411,0.000059671995,0.00019788872,0.00019023949,0.000045694633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014480678,0.001215796,0.00069597526,0.0009152858,0.0006235104,0.0040731193,0.0015823925,0.0016112,0.008846669],"category_scores_gemma":[0.0038363722,0.000655721,0.0006669536,0.0019799033,0.0012763792,0.0052888817,0.0013709044,0.0032229084,0.003513301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144653395,0.000029384017,0.000079791964,0.00022518712,0.000011686148,0.000118156786,0.0003368928,0.017688582,0.00050848007,0.90473264,0.018375538,0.057879206],"study_design_scores_gemma":[0.00001867173,0.00002511334,0.000089840985,0.0002029326,0.000012662982,0.00016857525,0.00009430737,0.04221722,0.00056747143,0.6560502,0.30053085,0.000022225606],"about_ca_topic_score_codex":0.0013197392,"about_ca_topic_score_gemma":0.0008065861,"teacher_disagreement_score":0.008846669,"about_ca_system_score_codex":0.0014305845,"about_ca_system_score_gemma":0.0008896844,"threshold_uncertainty_score":0.029595077},"labels":[],"label_agreement":null},{"id":"W64367339","doi":"10.5220/0003332705870590","title":"SUSTAINABILITY OF HADOOP CLUSTERS","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Namespace; Distributed File System; Replication (statistics); Cloud computing; Distributed computing; Component (thermodynamics); File system; Operating system; Replicate; Single point of failure; Distributed data store; Core (optical fiber); Function (biology); Key (lock); Distributed database; Database","score_opus":0.020326044298858276,"score_gpt":0.23463533822753613,"score_spread":0.21430929392867784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64367339","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51220953,0.0077734077,0.10689042,0.028764445,0.0016794766,0.00048081635,0.0021493703,0.0025596519,0.33749285],"genre_scores_gemma":[0.9879568,0.00076770445,0.0038750828,0.00022446312,0.00007510131,0.00007432559,0.00040131362,0.00012078659,0.006504453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877506,0.00027879732,0.0000429548,0.00017543694,0.00045024644,0.00027742237],"domain_scores_gemma":[0.997698,0.00038206822,0.00014810353,0.0002979513,0.0010500797,0.0004237885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016755596,0.00042838135,0.0002912573,0.00089199364,0.0024346064,0.002642046,0.0012500392,0.0008422743,0.0066687986],"category_scores_gemma":[0.0045209983,0.0002196671,0.0002752891,0.001078264,0.0012287912,0.0031772116,0.004275792,0.00074781413,0.0009239884],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006908995,0.00021272141,0.03725525,0.0012915699,0.00026484922,0.002078311,0.0012696757,0.1967183,0.010737109,0.36849436,0.08291976,0.29806724],"study_design_scores_gemma":[0.00014177378,0.00034828632,0.014866177,0.0003753034,0.00010197062,0.0014191953,0.004117272,0.19174227,0.01760769,0.40974206,0.35942182,0.00011627477],"about_ca_topic_score_codex":0.0067180623,"about_ca_topic_score_gemma":0.0052830605,"teacher_disagreement_score":0.0067180623,"about_ca_system_score_codex":0.0027272187,"about_ca_system_score_gemma":0.003216842,"threshold_uncertainty_score":0.022309363},"labels":[],"label_agreement":null},{"id":"W6887615768","doi":"10.17605/osf.io/6td7j","title":"SOA/SMT and Recognition Memory","year":2017,"lang":"en","type":"other","venue":"Open Science Framework","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Recognition memory; Encoding (memory); Feature (linguistics); Pattern recognition (psychology); Noise (video)","score_opus":0.034042935391753654,"score_gpt":0.32282888814345795,"score_spread":0.28878595275170427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6887615768","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03636115,0.007434854,0.3420512,0.010592676,0.0025914293,0.00014301851,0.0009334724,0.012225067,0.58766717],"genre_scores_gemma":[0.57290846,0.0066639604,0.13240576,0.0014013578,0.0015082008,0.00018712133,0.002050896,0.0027048625,0.28016937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936694,0.000087887085,0.000033211556,0.000116139265,0.00023152029,0.0001643194],"domain_scores_gemma":[0.99855524,0.00030635498,0.0000973524,0.0005270782,0.00036119926,0.00015283554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009848145,0.00058214046,0.0004860642,0.00083618355,0.0009974426,0.004089629,0.001376121,0.0013181681,0.03020397],"category_scores_gemma":[0.0031933584,0.00019646775,0.0005685434,0.001366749,0.0014615337,0.0055258255,0.0019624617,0.0015218982,0.006719605],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111056586,0.0000835065,0.0003773412,0.00013363175,0.000012974528,0.00009742364,0.00010735452,0.0039805667,0.0021919962,0.76483727,0.03358958,0.19447726],"study_design_scores_gemma":[0.00003114603,0.000034600085,0.0004219264,0.000111090034,0.000027047861,0.00021107197,0.000108232416,0.037594203,0.006024852,0.711986,0.24342266,0.000027124606],"about_ca_topic_score_codex":0.008016555,"about_ca_topic_score_gemma":0.006771367,"teacher_disagreement_score":0.03020397,"about_ca_system_score_codex":0.0013573929,"about_ca_system_score_gemma":0.0024656455,"threshold_uncertainty_score":0.10104233},"labels":[],"label_agreement":null},{"id":"W6891491675","doi":"10.4230/lipics.disc.2022.30","title":"The Space Complexity of Scannable Objects with Bounded Components","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Object (grammar); Component (thermodynamics); Domain (mathematical analysis); Asynchronous communication; Construct (python library); Sequence (biology); Binary number","score_opus":0.022658546970267722,"score_gpt":0.23157766563717694,"score_spread":0.2089191186669092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891491675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6471391,0.00079016126,0.3339258,0.0014987757,0.000061033457,0.00023288348,0.0005406621,0.003427682,0.012383909],"genre_scores_gemma":[0.8679812,0.00044192307,0.12256068,0.00023337042,0.00005179043,0.00055825856,0.0008289085,0.00055200624,0.006791807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922956,0.001432955,0.0007109391,0.0010276994,0.0027484398,0.001784282],"domain_scores_gemma":[0.98536193,0.008419811,0.0011160198,0.0037062431,0.0009542329,0.0004416502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027597672,0.0010729628,0.001110442,0.0009248833,0.0013326685,0.005277225,0.003751334,0.0015288215,0.00592384],"category_scores_gemma":[0.01118103,0.0010195635,0.0020159485,0.0017769396,0.0029094422,0.0109821195,0.0050218673,0.0025052023,0.00091553223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038955042,0.00045540364,0.010558282,0.0011284723,0.00026757506,0.0006450656,0.0016727684,0.3997403,0.07496047,0.3753868,0.005640263,0.12564903],"study_design_scores_gemma":[0.00042634644,0.00040431359,0.0013538735,0.00009410184,0.00025572677,0.00022664564,0.0002769151,0.7374779,0.039923318,0.21305531,0.006399776,0.000105825544],"about_ca_topic_score_codex":0.0039667836,"about_ca_topic_score_gemma":0.003255467,"teacher_disagreement_score":0.00592384,"about_ca_system_score_codex":0.0033000894,"about_ca_system_score_gemma":0.004193856,"threshold_uncertainty_score":0.023943901},"labels":[],"label_agreement":null},{"id":"W6891584202","doi":"10.4230/lipics.disc.2024.7","title":"A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Snapshot (computer storage); Concurrency; Linearizability; Concurrent computing; Constant (computer programming)","score_opus":0.021010650707451794,"score_gpt":0.27211145065385633,"score_spread":0.25110079994640455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891584202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011182709,0.00038262716,0.93037313,0.00009766027,0.00010022489,0.00026858252,0.0005670356,0.053373024,0.0036549957],"genre_scores_gemma":[0.16074051,0.00028155124,0.815396,0.00025522502,0.000091518436,0.00067005854,0.0025621587,0.00431,0.015693024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907935,0.00009525137,0.000079727855,0.00023386216,0.00039193197,0.00011983554],"domain_scores_gemma":[0.99835,0.00020130424,0.00009894307,0.0009757334,0.00025456704,0.00011945686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331916,0.00092349155,0.00073597045,0.0008675105,0.0005949765,0.0017572632,0.0029880607,0.0009376598,0.0076115006],"category_scores_gemma":[0.0027488363,0.0008829479,0.00073573965,0.0009296457,0.00084814866,0.003733027,0.0032262942,0.0014837994,0.0033828877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024057191,0.00027039138,0.004091002,0.00055227865,0.0001283511,0.0004492506,0.00059580605,0.01202034,0.06753103,0.08840862,0.026647812,0.7968993],"study_design_scores_gemma":[0.00063128397,0.0010116107,0.0042223693,0.00024011104,0.00023555514,0.0015496208,0.00022252707,0.3003491,0.18398364,0.08799534,0.41910416,0.0004546285],"about_ca_topic_score_codex":0.0016509609,"about_ca_topic_score_gemma":0.0020123655,"teacher_disagreement_score":0.0076115006,"about_ca_system_score_codex":0.00085334684,"about_ca_system_score_gemma":0.0012156565,"threshold_uncertainty_score":0.025463045},"labels":[],"label_agreement":null},{"id":"W6891621332","doi":"10.4230/oasics.fab.2021.4","title":"TimeFabric: Trusted Time for Permissioned Blockchains","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Database transaction; Overhead (engineering); Popularity; Cache; Blockchain; Throughput","score_opus":0.01121591023393957,"score_gpt":0.24739395347187867,"score_spread":0.23617804323793912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891621332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0413954,0.00077129336,0.9163098,0.00074141385,0.0003207927,0.00042859497,0.00039930458,0.020639755,0.018993711],"genre_scores_gemma":[0.7897252,0.0006833422,0.1902591,0.00019164741,0.00017125558,0.00033940087,0.0006984592,0.0017311664,0.016200395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966583,0.00072703516,0.00018901528,0.00033684773,0.0016259743,0.00046281217],"domain_scores_gemma":[0.9943715,0.0014659063,0.00046434155,0.0024049103,0.0008457558,0.00044768158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021758997,0.0006149116,0.0005707845,0.0008098153,0.001403725,0.0024789104,0.001772778,0.0011531365,0.014885036],"category_scores_gemma":[0.009745211,0.0005362396,0.00040440419,0.00082017115,0.0017792416,0.005680755,0.0035775155,0.0019596461,0.003097087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002560657,0.00029058702,0.0036657755,0.00078799913,0.000080508704,0.0014511296,0.00168765,0.072029576,0.065529846,0.4230318,0.029957512,0.398927],"study_design_scores_gemma":[0.0003651052,0.0005552539,0.00071202446,0.00024124718,0.00005580843,0.00089978887,0.00028057143,0.5961891,0.10161826,0.15060538,0.14830942,0.00016814268],"about_ca_topic_score_codex":0.0026359565,"about_ca_topic_score_gemma":0.002137963,"teacher_disagreement_score":0.014885036,"about_ca_system_score_codex":0.0011013094,"about_ca_system_score_gemma":0.0023554235,"threshold_uncertainty_score":0.04979539},"labels":[],"label_agreement":null},{"id":"W6891850243","doi":"10.48550/arxiv.1810.09613","title":"Refining Santa: An Exercise in Efficient Synchronization","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Synchronization (alternating current); Simple (philosophy); Key (lock); Refining (metallurgy); Scheme (mathematics)","score_opus":0.0494497444047879,"score_gpt":0.19652974821018368,"score_spread":0.14708000380539576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891850243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026736436,0.00012965432,0.96181536,0.0005863027,0.00004565897,0.00009209039,0.000031027987,0.0016001706,0.008963236],"genre_scores_gemma":[0.41940936,0.00033399893,0.56793827,0.00021275494,0.0000624931,0.00016142771,0.000099287085,0.00094973383,0.010832645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975331,0.00079649384,0.0001560793,0.00037062506,0.0008524457,0.00029118327],"domain_scores_gemma":[0.99392927,0.0021932258,0.00023513078,0.0029589736,0.00053026614,0.00015326933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003697672,0.0006077879,0.000758322,0.0005862441,0.0016489971,0.0019285062,0.0021710766,0.0012325757,0.005874042],"category_scores_gemma":[0.012087618,0.000905459,0.0008894675,0.000842701,0.0029573278,0.0056944783,0.0036460806,0.0027950995,0.0017890809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021553726,0.00008092481,0.0009814252,0.00019450249,0.000028716955,0.00025541283,0.0014309302,0.040796448,0.022602905,0.795721,0.003118811,0.13457337],"study_design_scores_gemma":[0.00013420537,0.00019953564,0.00037016897,0.00013165115,0.00008440189,0.00035915355,0.00048697577,0.25580975,0.046917163,0.62099487,0.07443453,0.000077583856],"about_ca_topic_score_codex":0.002374694,"about_ca_topic_score_gemma":0.0032629643,"teacher_disagreement_score":0.005874042,"about_ca_system_score_codex":0.00084836327,"about_ca_system_score_gemma":0.0020581118,"threshold_uncertainty_score":0.019650638},"labels":[],"label_agreement":null},{"id":"W6893170043","doi":"10.5281/zenodo.14774566","title":"Practically and Theoretically Efficient Garbage Collection for Multiversioning","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Garbage collection; Data structure; Object (grammar); Hash function; Tree (set theory); Space (punctuation); Key (lock)","score_opus":0.024487701210035757,"score_gpt":0.2513426401419417,"score_spread":0.22685493893190592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893170043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079248086,0.0019823746,0.9068815,0.0004776746,0.0001247377,0.00016327896,0.00024331882,0.005147686,0.0057312814],"genre_scores_gemma":[0.5235804,0.0006459785,0.47000897,0.00013654637,0.00009375176,0.00020401034,0.00048844836,0.00087322615,0.003968708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756014,0.0005626563,0.00021571,0.00028349625,0.0010713239,0.0003066331],"domain_scores_gemma":[0.9925418,0.0032189938,0.0006542683,0.0025031767,0.000888388,0.00019330767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076712,0.00065078796,0.0007513332,0.0018057817,0.0016019875,0.0024412945,0.0020406097,0.0006412232,0.0026363202],"category_scores_gemma":[0.008118371,0.0005367226,0.0007606732,0.0026737181,0.0019075369,0.0044750283,0.0035661554,0.0008892654,0.0007233435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016611272,0.00026686015,0.0059673027,0.0011487161,0.00016534947,0.0002862541,0.0013418028,0.1562917,0.06598011,0.19642328,0.01212143,0.5583461],"study_design_scores_gemma":[0.00025976158,0.00048657894,0.0012438662,0.00023438224,0.00018624064,0.00090067735,0.00063659216,0.61146706,0.17221895,0.1823851,0.02981131,0.0001694746],"about_ca_topic_score_codex":0.0014555106,"about_ca_topic_score_gemma":0.0020470961,"teacher_disagreement_score":0.0026363202,"about_ca_system_score_codex":0.0017480655,"about_ca_system_score_gemma":0.002603266,"threshold_uncertainty_score":0.012683213},"labels":[],"label_agreement":null},{"id":"W6893227800","doi":"10.5281/zenodo.15772009","title":"Concurrent Binary Search Trees Supporting Split and Join","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Traverse; Optimal binary search tree; Binary search tree; Join (topology); Binary tree; Node (physics); Random binary tree; Tree (set theory); Weight-balanced tree","score_opus":0.02834605984928738,"score_gpt":0.2730796931195397,"score_spread":0.24473363327025235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893227800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17193611,0.0006525809,0.82261544,0.00047974833,0.000073464165,0.00014884463,0.00020933941,0.001063599,0.0028207912],"genre_scores_gemma":[0.7438361,0.00028127534,0.2529145,0.000085498556,0.000084398176,0.00013723,0.00031837082,0.0001807743,0.0021618032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842715,0.00024645688,0.0001333342,0.00036156247,0.00049468613,0.00033684573],"domain_scores_gemma":[0.9924272,0.003845372,0.0008050877,0.0013359208,0.0009999517,0.00058649987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021011282,0.0004421074,0.0010810668,0.0007310169,0.0013359077,0.0023525804,0.002067113,0.0010139418,0.0016707781],"category_scores_gemma":[0.010490002,0.00049226655,0.00050400913,0.0014138462,0.0011572824,0.0047780145,0.0022963972,0.0012150111,0.0004630907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028135413,0.00070067414,0.0079202065,0.00070792687,0.00016380686,0.0010207045,0.0019135135,0.3974105,0.098739944,0.19775257,0.0050288346,0.28582773],"study_design_scores_gemma":[0.00014154642,0.00028416683,0.0006595216,0.00003000328,0.000063706706,0.00034495466,0.00025549697,0.8549994,0.01924332,0.11900471,0.0049345745,0.000038600734],"about_ca_topic_score_codex":0.0026773622,"about_ca_topic_score_gemma":0.0023581176,"teacher_disagreement_score":0.0026773622,"about_ca_system_score_codex":0.00062201795,"about_ca_system_score_gemma":0.0011609752,"threshold_uncertainty_score":0.011111915},"labels":[],"label_agreement":null},{"id":"W6893311878","doi":"10.5281/zenodo.15772127","title":"Concurrent Double-Ended Priority Queues","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Ministry of National Education and Religious Affairs","keywords":"Priority inheritance; Priority queue; Priority ceiling protocol; Implementation; Scheduling (production processes); Concurrent data structure; Queue; Synchronization (alternating current); Deadline-monotonic scheduling","score_opus":0.03141734232207542,"score_gpt":0.27470724103520155,"score_spread":0.24328989871312612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893311878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030971268,0.00030415502,0.96171254,0.00012248888,0.0002015454,0.00019169651,0.00012376065,0.0012531203,0.0051193293],"genre_scores_gemma":[0.42514008,0.00033857772,0.5607971,0.00023570613,0.00013119885,0.0002753254,0.00046863605,0.0003057303,0.012307662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868995,0.00017175036,0.0001450803,0.00026203017,0.00047885932,0.00025226315],"domain_scores_gemma":[0.9970198,0.00058762875,0.00022577406,0.0006326226,0.0011773957,0.00035670373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014253157,0.00058235665,0.00052724016,0.00061808183,0.0009629334,0.0023297144,0.0024283172,0.00061303115,0.0037490022],"category_scores_gemma":[0.0037702678,0.0004925616,0.00046519266,0.0007055196,0.00069398695,0.0021386773,0.0025105523,0.0011343943,0.00082600454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026920212,0.0005841422,0.005017685,0.0006295156,0.00017409197,0.00067690376,0.0010215894,0.10319386,0.117081404,0.26177442,0.010038347,0.49711606],"study_design_scores_gemma":[0.0007384708,0.0008492229,0.00093959045,0.00009666816,0.00013769986,0.00070915144,0.0002477033,0.6869591,0.100823626,0.12066358,0.08770021,0.00013496773],"about_ca_topic_score_codex":0.0014522295,"about_ca_topic_score_gemma":0.0013674365,"teacher_disagreement_score":0.0037490022,"about_ca_system_score_codex":0.0008021447,"about_ca_system_score_gemma":0.0019556978,"threshold_uncertainty_score":0.012541711},"labels":[],"label_agreement":null},{"id":"W6894014466","doi":"10.5281/zenodo.7190625","title":"When Is Recoverable Consensus Harder Than Consensus?","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Object (grammar); Class (philosophy); Focus (optics); Uniform consensus; Consensus; Crash","score_opus":0.03406486403890663,"score_gpt":0.2346568189259619,"score_spread":0.20059195488705528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894014466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62143993,0.0022946747,0.3323052,0.02492744,0.00054137106,0.00025838442,0.00052284164,0.0012472451,0.01646287],"genre_scores_gemma":[0.96190464,0.00074928737,0.03225476,0.00080595823,0.000554548,0.00019526151,0.00035437552,0.00027835593,0.0029027767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916638,0.0025180683,0.00046771203,0.0019010385,0.0015359414,0.0019134432],"domain_scores_gemma":[0.8989441,0.08256243,0.006251496,0.006996898,0.0026738169,0.00257123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006545367,0.0007605648,0.0024774063,0.0010997175,0.002029761,0.00408766,0.0028599955,0.0065809004,0.0081843715],"category_scores_gemma":[0.072669476,0.0010766176,0.0015572425,0.0017036436,0.0047794865,0.01632591,0.0039837,0.0052037397,0.000842444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029266304,0.00096955785,0.01608739,0.002170186,0.00083789096,0.0021881948,0.0033462923,0.50496083,0.016471326,0.29472402,0.024058284,0.1312594],"study_design_scores_gemma":[0.00030132435,0.0002834611,0.0020255414,0.00008338289,0.00008513303,0.0008393327,0.0016529268,0.38915414,0.0052669663,0.5967957,0.0034188302,0.00009329414],"about_ca_topic_score_codex":0.0015179066,"about_ca_topic_score_gemma":0.0008318884,"teacher_disagreement_score":0.0081843715,"about_ca_system_score_codex":0.001145897,"about_ca_system_score_gemma":0.0010558919,"threshold_uncertainty_score":0.034615636},"labels":[],"label_agreement":null},{"id":"W6898766113","doi":"10.57745/iqce4q","title":"WD_Heritability.rds","year":2025,"lang":"en","type":"dataset","venue":"Recherche Data Gouv France","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Selection (genetic algorithm); Identification (biology); Term (time)","score_opus":0.17692392626388706,"score_gpt":0.39766868056615506,"score_spread":0.220744754302268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6898766113","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039836054,0.00006646682,0.00011726548,0.000022451159,0.000021644426,0.0000059899257,0.99865544,0.00037892355,0.0003334748],"genre_scores_gemma":[0.0015731467,0.00005454816,0.00042292423,0.000041928637,0.000012027922,0.00007560078,0.9968329,0.00019514357,0.0007918196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987224,0.00020325782,0.000105312596,0.0005909611,0.00020015221,0.00017782902],"domain_scores_gemma":[0.9970446,0.0013107752,0.00027753503,0.00072587497,0.00050276454,0.0001384803],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016144956,0.002747438,0.001892731,0.0036036663,0.0009999098,0.0023467243,0.0027001116,0.0018730413,0.08561744],"category_scores_gemma":[0.007241054,0.0009801511,0.002192752,0.004972608,0.0004581301,0.0009345948,0.0016424068,0.0016501003,0.07919938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024715217,0.000058664213,0.007494611,0.0016848713,0.00034440422,0.000076644166,0.000085154374,0.0008835855,0.0009918335,0.00090685487,0.98118156,0.006044635],"study_design_scores_gemma":[0.001036913,0.00008039445,0.04543076,0.00047700843,0.00034272068,0.00024592652,0.00015812309,0.0010912637,0.0014573103,0.0030118104,0.9465576,0.000110139015],"about_ca_topic_score_codex":0.017743586,"about_ca_topic_score_gemma":0.02634143,"teacher_disagreement_score":0.9143826,"about_ca_system_score_codex":0.00089208,"about_ca_system_score_gemma":0.0015015489,"threshold_uncertainty_score":0.28641886},"labels":[],"label_agreement":null},{"id":"W6910319334","doi":"10.4230/lipics.opodis.2021.28","title":"Strongly Linearizable Linked List and Queue","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Correctness; Implementation; Data structure; Queue; Scheme (mathematics)","score_opus":0.010836333627335612,"score_gpt":0.23072336248391856,"score_spread":0.21988702885658296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910319334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046843037,0.00018804082,0.9344829,0.0012368603,0.00013297696,0.0001798197,0.0003983722,0.005737042,0.010800961],"genre_scores_gemma":[0.54802257,0.00030770444,0.4217951,0.00080027926,0.00018598889,0.0005136768,0.0011793195,0.00094798085,0.026247382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683374,0.0006259882,0.00029961774,0.0007052381,0.0011111986,0.0004242486],"domain_scores_gemma":[0.9921657,0.002846496,0.0007162071,0.0025335555,0.0013833628,0.00035482136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001911018,0.00045459231,0.00040858088,0.0007455308,0.0010666893,0.002855684,0.0022887036,0.0010083489,0.0076299068],"category_scores_gemma":[0.01094467,0.00051301357,0.0007878547,0.0015237463,0.0030133042,0.006349346,0.0037616573,0.0026925015,0.0017569019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031154614,0.00014957887,0.001623644,0.00021275629,0.000026732523,0.000176362,0.0007042699,0.01300962,0.0109465355,0.9070239,0.0064647784,0.05935031],"study_design_scores_gemma":[0.00015521262,0.0002526351,0.0004843768,0.000055187124,0.00006959621,0.00026077294,0.00023448544,0.11051316,0.03795183,0.811802,0.038136303,0.00008435803],"about_ca_topic_score_codex":0.0030668818,"about_ca_topic_score_gemma":0.0024373054,"teacher_disagreement_score":0.0076299068,"about_ca_system_score_codex":0.001949662,"about_ca_system_score_gemma":0.0031269658,"threshold_uncertainty_score":0.025524557},"labels":[],"label_agreement":null},{"id":"W6910341342","doi":"10.4230/lipics.opodis.2023.17","title":"A Wait-Free Deque With Polylogarithmic Step Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Stack (abstract data type); Queue; Computational complexity theory; Data structure; Time complexity","score_opus":0.01784283380366237,"score_gpt":0.24830342300751643,"score_spread":0.23046058920385407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910341342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06550699,0.0005049565,0.91843826,0.00060173817,0.00024631474,0.00017865635,0.00027125078,0.004021818,0.010230169],"genre_scores_gemma":[0.4488452,0.00041441977,0.53064966,0.00037706338,0.00015463216,0.00042540376,0.0005330266,0.0008002615,0.017800316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963081,0.0003896175,0.0003581279,0.00063504995,0.0016580382,0.00065118686],"domain_scores_gemma":[0.9930582,0.0020368465,0.0004119186,0.0025390894,0.0015648323,0.0003890249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014438,0.001001385,0.00093824253,0.00094362465,0.0017781826,0.0056114756,0.0037661009,0.0014728479,0.0080933245],"category_scores_gemma":[0.0073021175,0.00078315363,0.0012143048,0.0013054729,0.0020484584,0.008459822,0.0035561891,0.003107172,0.0021352516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018874469,0.00063246215,0.0027217623,0.0006278321,0.00020214512,0.0003814584,0.00046817513,0.048553616,0.06985081,0.66566885,0.009712988,0.19929254],"study_design_scores_gemma":[0.00043208426,0.0008334168,0.0011665646,0.00011004045,0.00029327333,0.000672735,0.00021383981,0.38425976,0.10614843,0.46146896,0.044140905,0.0002599874],"about_ca_topic_score_codex":0.0023073656,"about_ca_topic_score_gemma":0.0025603909,"teacher_disagreement_score":0.0080933245,"about_ca_system_score_codex":0.0019135434,"about_ca_system_score_gemma":0.0043206923,"threshold_uncertainty_score":0.027074873},"labels":[],"label_agreement":null},{"id":"W6912406589","doi":"10.5281/zenodo.16145913","title":"File Handling in C Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Data file; Software; Scheme (mathematics); Set (abstract data type); Troubleshooting","score_opus":0.02630483888098652,"score_gpt":0.2319748940080608,"score_spread":0.20567005512707426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912406589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029439256,0.00070482056,0.7641405,0.00043444257,0.0003802439,0.00024268124,0.0025506313,0.10219219,0.12641059],"genre_scores_gemma":[0.060941588,0.0015084249,0.58576864,0.0013739698,0.00039522507,0.0007430653,0.010806965,0.06507522,0.27338696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988959,0.0001505455,0.00010272932,0.0002430818,0.00044368993,0.00016405348],"domain_scores_gemma":[0.9986487,0.00045712088,0.00005668998,0.0004688423,0.00029537693,0.000073377334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007793739,0.0015113509,0.000791633,0.001451216,0.0011350018,0.0031730072,0.002574813,0.0010539864,0.08887155],"category_scores_gemma":[0.0032690647,0.0010030799,0.0010034881,0.0022472846,0.00064528227,0.0028032905,0.0017342286,0.002434,0.05588851],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023180831,0.000085739885,0.00030775374,0.0005180081,0.00003695033,0.00021676072,0.00028535677,0.002883977,0.008527472,0.09239584,0.35092106,0.5435893],"study_design_scores_gemma":[0.00010172745,0.000056310644,0.00045877148,0.00024926828,0.00005962992,0.00086763635,0.00006555608,0.03127436,0.03242426,0.06434204,0.87000996,0.000090606576],"about_ca_topic_score_codex":0.00248015,"about_ca_topic_score_gemma":0.0020196,"teacher_disagreement_score":0.08887155,"about_ca_system_score_codex":0.0008438331,"about_ca_system_score_gemma":0.0009969439,"threshold_uncertainty_score":0.297305},"labels":[],"label_agreement":null},{"id":"W6912871462","doi":"10.5281/zenodo.7129235","title":"Capacity Building event One-Pager","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science and Technology Awareness Network","funders":"","keywords":"Event (particle physics); Capacity building; Unexpected events; Key (lock); Event data","score_opus":0.04416785930096069,"score_gpt":0.2416763594870826,"score_spread":0.19750850018612193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912871462","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031047856,0.0008948442,0.4321889,0.020462971,0.007493104,0.000744899,0.0011936184,0.02498418,0.48098955],"genre_scores_gemma":[0.56447846,0.0007612512,0.14891034,0.0035946514,0.0023076546,0.00064710877,0.0020377033,0.008141603,0.26912123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99362105,0.0019541034,0.00018657256,0.0005757624,0.0022235028,0.0014389993],"domain_scores_gemma":[0.9801311,0.0053611076,0.00047145138,0.0063001937,0.004463395,0.0032727022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063399156,0.0010282153,0.0010332665,0.0008916788,0.0029177635,0.005947378,0.0042118384,0.0035903086,0.10296668],"category_scores_gemma":[0.030065889,0.0007495411,0.0012079156,0.0007528716,0.0020509064,0.010986736,0.008178177,0.0067926208,0.022899676],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008272687,0.0005812979,0.00073893665,0.00021568507,0.000049880793,0.0009460951,0.0015898631,0.02812714,0.0036427123,0.4124067,0.38784853,0.16302599],"study_design_scores_gemma":[0.00026592863,0.00033945774,0.0006404096,0.00017557193,0.000037393896,0.000599929,0.00107796,0.044060446,0.009890729,0.27022612,0.6724352,0.00025077653],"about_ca_topic_score_codex":0.0034017023,"about_ca_topic_score_gemma":0.0028217381,"teacher_disagreement_score":0.10296668,"about_ca_system_score_codex":0.0019438843,"about_ca_system_score_gemma":0.0025929555,"threshold_uncertainty_score":0.34445786},"labels":[],"label_agreement":null},{"id":"W6913023002","doi":"10.5281/zenodo.7306362","title":"A SECURE ELECTRONIC PAYMENT PROTOCOL FOR WIRELESS MESH NETWORKS","year":2014,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless mesh network; Payment; Hash function; Protocol (science); Scheme (mathematics); Hash chain; Wireless","score_opus":0.019254561147131373,"score_gpt":0.25337092331997085,"score_spread":0.2341163621728395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6913023002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01534133,0.00069947756,0.97550935,0.0006807401,0.00068694155,0.00052652205,0.00014154185,0.0007007732,0.0057132724],"genre_scores_gemma":[0.5580101,0.0020929019,0.41195154,0.00059882324,0.00053779164,0.0012203475,0.0006801864,0.00018985668,0.02471841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.00021625625,0.00015644461,0.000091816386,0.00039597537,0.00009702757],"domain_scores_gemma":[0.9993205,0.00018459819,0.00009577075,0.00020353109,0.00014871848,0.00004690219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011808741,0.00035241744,0.00041277194,0.0005834937,0.0009298801,0.0011686032,0.00089043844,0.00092974224,0.0032538767],"category_scores_gemma":[0.002141179,0.00022565223,0.00044254021,0.00074009434,0.0007601399,0.0021795698,0.0023203294,0.0012252242,0.0009264483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005529807,0.00018687962,0.0007879498,0.00058698957,0.00011095623,0.00086183846,0.0004235629,0.028900297,0.06574134,0.51402694,0.017600367,0.37021995],"study_design_scores_gemma":[0.00038305344,0.0011274399,0.0014030907,0.00015744142,0.00021026318,0.0026995626,0.00024801583,0.43668073,0.07140889,0.22923754,0.25618026,0.00026372133],"about_ca_topic_score_codex":0.0002814898,"about_ca_topic_score_gemma":0.0003322981,"teacher_disagreement_score":0.0032538767,"about_ca_system_score_codex":0.0005157529,"about_ca_system_score_gemma":0.000817269,"threshold_uncertainty_score":0.010885298},"labels":[],"label_agreement":null},{"id":"W6924662594","doi":"10.15468/dl.qbupsr","title":"Occurrence Download","year":2022,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Data set; Set (abstract data type)","score_opus":0.013172620370883082,"score_gpt":0.21377024828948027,"score_spread":0.2005976279185972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924662594","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059512582,0.000032603144,0.00005332242,0.000042763553,0.000012941294,0.000006262484,0.99865973,0.00046649436,0.0006663434],"genre_scores_gemma":[0.00018069966,0.000032633678,0.0001924505,0.000039884748,0.000003254887,0.000036877584,0.9990012,0.00012002883,0.00039305285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897826,0.00013620753,0.00013740652,0.00034159265,0.000243661,0.00016289069],"domain_scores_gemma":[0.99777955,0.0006025687,0.00020151814,0.00059342437,0.000562673,0.00026024572],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009563244,0.0020301938,0.001483341,0.004816895,0.0010063521,0.002450749,0.0029502122,0.0020934131,0.1109544],"category_scores_gemma":[0.005549693,0.0008209243,0.0011324697,0.008808315,0.0004581301,0.002127553,0.0023636566,0.0020437858,0.17149775],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031554388,0.000013712007,0.00042886738,0.00049280934,0.000014198812,0.000018031917,0.00002202049,0.00015631293,0.00011595636,0.0003941522,0.996881,0.001431367],"study_design_scores_gemma":[0.000083787185,0.0000091070215,0.0019793739,0.00017890238,0.000013936765,0.000047127014,0.00007745162,0.0002330687,0.00022427575,0.0008240772,0.99631184,0.000017029057],"about_ca_topic_score_codex":0.02084127,"about_ca_topic_score_gemma":0.03484001,"teacher_disagreement_score":0.8890456,"about_ca_system_score_codex":0.0016110964,"about_ca_system_score_gemma":0.002302717,"threshold_uncertainty_score":0.37117946},"labels":[],"label_agreement":null},{"id":"W6929697590","doi":"10.5061/dryad.5q83s","title":"Data from: Invasive bryozoan alters interaction between a native grazer and its algal food","year":2013,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Kelp; Grazing; Kelp forest; Epiphyte; Algae; Bryozoa; Fragmentation (computing)","score_opus":0.05721994224751736,"score_gpt":0.28528209857922415,"score_spread":0.2280621563317068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929697590","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60003656,0.00022025268,0.0011523898,0.00026332305,0.00013813986,0.0005490136,0.37942487,0.0002930694,0.017922373],"genre_scores_gemma":[0.6479045,0.00024369571,0.0031395366,0.00039204198,0.00003513305,0.0012180371,0.3174321,0.000118640666,0.02951627],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994843,0.0000509575,0.000071755654,0.000107716754,0.00020906684,0.00007615924],"domain_scores_gemma":[0.9986669,0.0002873828,0.00027543821,0.00017801886,0.00046120773,0.00013107636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046753362,0.00026762285,0.00030850153,0.00047924352,0.0004966013,0.00045690307,0.00032341245,0.0002828667,0.021697935],"category_scores_gemma":[0.0014541306,0.00013646559,0.00024406755,0.00069986755,0.00019561144,0.00021851106,0.00045140486,0.00032099188,0.004757017],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058705825,0.0015275596,0.7821837,0.00119219,0.00043346305,0.0005176003,0.0010017612,0.0006039605,0.048606317,0.00031478438,0.0964191,0.06132906],"study_design_scores_gemma":[0.00011592334,0.0003128244,0.95636374,0.00004662006,0.0000641487,0.00009090298,0.0002872369,0.00018789408,0.0035364775,0.00004969362,0.03892678,0.00001775436],"about_ca_topic_score_codex":0.028209306,"about_ca_topic_score_gemma":0.06266452,"teacher_disagreement_score":0.028209306,"about_ca_system_score_codex":0.00043191962,"about_ca_system_score_gemma":0.00080715277,"threshold_uncertainty_score":0.072586834},"labels":[],"label_agreement":null},{"id":"W6948712845","doi":"10.5281/zenodo.11323222","title":"$*(&amp;- IN Fayzabad/Erlangen [[[[WhatsApp ((( (+27) 736616875))) *____**)) TOP QUALITY COUNTERFEIT MONEY FOR SALE Kärdla","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; Fusible alloy; Diafiltration; Hyporeflexia; Pretext; Articular cartilage damage","score_opus":0.04971279863617806,"score_gpt":0.2973082974336341,"score_spread":0.24759549879745602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948712845","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015830151,0.0013653524,0.00068648893,0.002776351,0.0014514148,0.00011167267,0.0036757286,0.002770503,0.9855795],"genre_scores_gemma":[0.0040526055,0.000555213,0.00042678963,0.00031731927,0.000072507435,0.000019952195,0.0007350679,0.0006152975,0.9932053],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944276,0.00003843102,0.000032066557,0.00013005013,0.00020268197,0.00015407194],"domain_scores_gemma":[0.99876773,0.00013125045,0.00009771004,0.00015706586,0.0004334001,0.00041287325],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052200636,0.0012853936,0.00077022525,0.0015620101,0.002456191,0.0059400443,0.00072262564,0.0018139473,0.91350144],"category_scores_gemma":[0.0021778636,0.00061553204,0.000453195,0.0013574756,0.0009239088,0.0033075179,0.0027130547,0.0013049529,0.871491],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011092178,0.00005920726,0.00048780942,0.0001920417,0.000004449986,0.00016137068,0.00010923709,0.00008986883,0.00094408257,0.0053718737,0.8659334,0.12653571],"study_design_scores_gemma":[0.000006486216,0.000012435774,0.00050883857,0.00005277888,0.0000015651681,0.00012214176,0.000080670434,0.000031304677,0.0002546704,0.0002310027,0.9986926,0.0000054852335],"about_ca_topic_score_codex":0.0039083525,"about_ca_topic_score_gemma":0.006553887,"teacher_disagreement_score":0.08649856,"about_ca_system_score_codex":0.001309408,"about_ca_system_score_gemma":0.0012717291,"threshold_uncertainty_score":0.12337971},"labels":[],"label_agreement":null},{"id":"W6949565926","doi":"10.5281/zenodo.15772126","title":"Concurrent Double-Ended Priority Queues","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Ministry of National Education and Religious Affairs","keywords":"Priority inheritance; Priority queue; Priority ceiling protocol; Implementation; Scheduling (production processes); Concurrent data structure; Queue; Synchronization (alternating current); Deadline-monotonic scheduling","score_opus":0.03141734232207542,"score_gpt":0.27470724103520155,"score_spread":0.24328989871312612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949565926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030971268,0.00030415502,0.96171254,0.00012248888,0.0002015454,0.00019169651,0.00012376065,0.0012531203,0.0051193293],"genre_scores_gemma":[0.42514008,0.00033857772,0.5607971,0.00023570613,0.00013119885,0.0002753254,0.00046863605,0.0003057303,0.012307662],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868995,0.00017175036,0.0001450803,0.00026203017,0.00047885932,0.00025226315],"domain_scores_gemma":[0.9970198,0.00058762875,0.00022577406,0.0006326226,0.0011773957,0.00035670373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014253157,0.00058235665,0.00052724016,0.00061808183,0.0009629334,0.0023297144,0.0024283172,0.00061303115,0.0037490022],"category_scores_gemma":[0.0037702678,0.0004925616,0.00046519266,0.0007055196,0.00069398695,0.0021386773,0.0025105523,0.0011343943,0.00082600454],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026920212,0.0005841422,0.005017685,0.0006295156,0.00017409197,0.00067690376,0.0010215894,0.10319386,0.117081404,0.26177442,0.010038347,0.49711606],"study_design_scores_gemma":[0.0007384708,0.0008492229,0.00093959045,0.00009666816,0.00013769986,0.00070915144,0.0002477033,0.6869591,0.100823626,0.12066358,0.08770021,0.00013496773],"about_ca_topic_score_codex":0.0014522295,"about_ca_topic_score_gemma":0.0013674365,"teacher_disagreement_score":0.0037490022,"about_ca_system_score_codex":0.0008021447,"about_ca_system_score_gemma":0.0019556978,"threshold_uncertainty_score":0.012541711},"labels":[],"label_agreement":null},{"id":"W6966861328","doi":"10.4230/lipics.opodis.2024.5","title":"RMR-Efficient Detectable Objects for Persistent Memory and Their Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Synchronization (alternating current); Process (computing); Multiprocessing; Reduction (mathematics); Blocking (statistics); Lock (firearm); Distributed shared memory; Shared memory","score_opus":0.008127687837484215,"score_gpt":0.2321173209926717,"score_spread":0.2239896331551875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966861328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021468323,0.000205344,0.9748377,0.0001451288,0.00002520109,0.00006889335,0.000028810015,0.0017812798,0.0014392463],"genre_scores_gemma":[0.38060874,0.00020687951,0.6142264,0.000106894164,0.000047647496,0.00027685546,0.00017728162,0.00051485316,0.0038344325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801993,0.00047654696,0.000121076126,0.0002740115,0.0008398224,0.00026856587],"domain_scores_gemma":[0.99644995,0.0012055789,0.00039846284,0.0014842621,0.00032712266,0.00013464002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020135918,0.0006187677,0.0007662975,0.00089653395,0.00094555784,0.0019528572,0.003002484,0.0011130908,0.0025302435],"category_scores_gemma":[0.005649795,0.0006383765,0.0007718013,0.0011820922,0.0022257948,0.0037635684,0.0042698337,0.0018527824,0.00076530466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000436294,0.00023461602,0.0015866386,0.00048740557,0.000040858275,0.00030205701,0.00059340906,0.08353957,0.045716934,0.635355,0.004022909,0.22768427],"study_design_scores_gemma":[0.00013171723,0.00041228443,0.00043157392,0.0000799962,0.000052336465,0.00036892705,0.00014403011,0.6791561,0.06273321,0.23288403,0.023528412,0.00007733131],"about_ca_topic_score_codex":0.00047974772,"about_ca_topic_score_gemma":0.0005297531,"teacher_disagreement_score":0.003002484,"about_ca_system_score_codex":0.0010392636,"about_ca_system_score_gemma":0.0013081272,"threshold_uncertainty_score":0.010649025},"labels":[],"label_agreement":null},{"id":"W6979751460","doi":"","title":"Addressing fault tolerance in software development : a comparative study","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software development; Software fault tolerance; Software system; Fault tolerance; Software; Software construction; Software maintenance","score_opus":0.05072197704679814,"score_gpt":0.30077715303444846,"score_spread":0.2500551759876503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979751460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88402575,0.041497122,0.003911638,0.0012222873,0.00010678008,0.00011917212,0.00012689544,0.000098691395,0.06889163],"genre_scores_gemma":[0.98393136,0.011070177,0.001502536,0.0000952301,0.000036740217,0.00003949401,0.00008756358,0.0000150726055,0.0032218709],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99656004,0.0017202769,0.0003093259,0.00017085011,0.000990434,0.0002490947],"domain_scores_gemma":[0.97635514,0.014642119,0.0020845488,0.00063630345,0.0054721306,0.0008097919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045975563,0.00018780172,0.00032146196,0.004667348,0.0007693776,0.0014735957,0.0004976838,0.0005737957,0.0033981185],"category_scores_gemma":[0.017921723,0.00009313439,0.00022032573,0.005897867,0.0005745372,0.0017046591,0.0009130364,0.00027849976,0.00044785897],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011912028,0.0009925582,0.14610505,0.0029722357,0.00019983803,0.0006861448,0.03149554,0.0016924827,0.002935467,0.0065714866,0.004012524,0.8011454],"study_design_scores_gemma":[0.0002854219,0.011770473,0.6554996,0.0056010014,0.00094606495,0.004258391,0.13705623,0.0048085414,0.00757731,0.0055218595,0.1665665,0.00010857068],"about_ca_topic_score_codex":0.003632739,"about_ca_topic_score_gemma":0.007711288,"teacher_disagreement_score":0.004667348,"about_ca_system_score_codex":0.0018584843,"about_ca_system_score_gemma":0.0011039532,"threshold_uncertainty_score":0.024314523},"labels":[],"label_agreement":null},{"id":"W6980523564","doi":"","title":"Chembio Diagnostics Reports Second Quarter 2018 Financial Results","year":2018,"lang":"en","type":"other","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Financial Audit; Payment; Financial management","score_opus":0.008232681173885422,"score_gpt":0.22053367052361178,"score_spread":0.21230098934972635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980523564","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028201435,0.0029057323,0.0031535171,0.042387947,0.015619211,0.0002969041,0.015930241,0.0025973432,0.9142889],"genre_scores_gemma":[0.011183856,0.0017174666,0.0013223217,0.0031991843,0.002155018,0.000108502725,0.008473116,0.00050543004,0.97133505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996075,0.0002453827,0.00010122925,0.0003202076,0.0027495492,0.0005085369],"domain_scores_gemma":[0.9938069,0.0007080197,0.00035005456,0.0005761476,0.0033721921,0.0011866997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003389086,0.0012834931,0.00059975364,0.0026524263,0.0017140605,0.0063648764,0.0014744862,0.0032202702,0.387304],"category_scores_gemma":[0.010584821,0.00033826017,0.0006272275,0.0012941875,0.0008273046,0.0022848218,0.0018459758,0.0027235965,0.27404955],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011886851,0.000075056996,0.00026105388,0.000044534987,0.0000053146205,0.000060960934,0.000008014956,0.00017888253,0.0002576402,0.0040051155,0.96323836,0.031746253],"study_design_scores_gemma":[0.0000690259,0.00006051988,0.0005944163,0.000057615078,0.000007459874,0.000081997874,0.000025595664,0.0009996677,0.0019316835,0.003278006,0.9928826,0.000011332419],"about_ca_topic_score_codex":0.0044076624,"about_ca_topic_score_gemma":0.005024989,"teacher_disagreement_score":0.387304,"about_ca_system_score_codex":0.0033366596,"about_ca_system_score_gemma":0.0041203527,"threshold_uncertainty_score":0.8739365},"labels":[],"label_agreement":null},{"id":"W7002366115","doi":"","title":"Native title and the transformation of archaeology in the postcolonial world","year":2000,"lang":"en","type":"book","venue":"Queensland's institutional digital repository (The University of Queensland)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Indigenous; Cultural heritage; Indigenous culture; Colonialism; Land rights; Cultural heritage management; Archaeology of the Americas; Traditional knowledge","score_opus":0.006924173274256208,"score_gpt":0.19041405911835016,"score_spread":0.18348988584409395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7002366115","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0215213,0.1124864,0.001509692,0.019976687,0.0034064227,0.000016507294,0.000061543076,0.00008530456,0.8409361],"genre_scores_gemma":[0.26679167,0.06308353,0.0018112103,0.0047626896,0.0018264152,0.00004810109,0.00007967508,0.00013642511,0.6614602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993309,0.00027259556,0.00002577578,0.00006536755,0.00021342203,0.000091998845],"domain_scores_gemma":[0.99873966,0.0007592616,0.00007093384,0.00017355366,0.000152201,0.00010440759],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012383597,0.00019203697,0.00025133052,0.0014626135,0.0043473076,0.008745574,0.0006677694,0.0012054116,0.0054204846],"category_scores_gemma":[0.0018938836,0.00021847317,0.00012806007,0.0024353352,0.012372161,0.004716663,0.0023681507,0.0017926175,0.0007419519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023409146,0.000019027744,0.0008268473,0.00033419186,0.000004745097,0.00063688424,0.13119315,0.00016384908,0.0002403153,0.6675105,0.0800498,0.11899722],"study_design_scores_gemma":[0.0000023062453,0.000006576012,0.0009873676,0.00023497031,0.0000021383398,0.00032441464,0.007135672,0.000037606977,0.000056085606,0.013807293,0.97740084,0.000004772949],"about_ca_topic_score_codex":0.01726672,"about_ca_topic_score_gemma":0.053773995,"teacher_disagreement_score":0.9956527,"about_ca_system_score_codex":0.0065063774,"about_ca_system_score_gemma":0.0021460392,"threshold_uncertainty_score":0.047207355},"labels":[],"label_agreement":null},{"id":"W7014867190","doi":"","title":"Reconfigurable Multiple Access Schemes for URLLC-mMTC Coexisting Networks","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Key (lock); Scheme (mathematics); Data transmission; Set (abstract data type); Focus (optics)","score_opus":0.04210202402073581,"score_gpt":0.2895722282256672,"score_spread":0.24747020420493138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014867190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20844789,0.0009419121,0.7795316,0.00029982807,0.00017172006,0.0002029572,0.000066788416,0.00087978295,0.009457538],"genre_scores_gemma":[0.94415706,0.00021338637,0.053798918,0.00007927952,0.00006277216,0.000099322024,0.000039670103,0.0000124685475,0.0015371675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950135,0.00012904873,0.000034664397,0.000096052354,0.0001303154,0.0001085474],"domain_scores_gemma":[0.9989987,0.00029541846,0.00018702126,0.00025290853,0.00020501422,0.00006089913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004824051,0.00041645637,0.00035653787,0.00054464943,0.00070542376,0.00068414724,0.0010770244,0.00051072723,0.0013244521],"category_scores_gemma":[0.001507338,0.00014528054,0.00028745586,0.00050023117,0.0005309155,0.00082617975,0.0010914989,0.00058398047,0.00035956898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008036895,0.00036429212,0.003807501,0.00031794526,0.0001288416,0.0013971911,0.0008242225,0.19404233,0.30762398,0.15873298,0.0038456027,0.32811135],"study_design_scores_gemma":[0.000057132813,0.00038072545,0.00075715216,0.000025037101,0.000050226456,0.000680046,0.000114022165,0.9540612,0.023759065,0.012172058,0.007902206,0.000041115833],"about_ca_topic_score_codex":0.00077319704,"about_ca_topic_score_gemma":0.0011386652,"teacher_disagreement_score":0.0013244521,"about_ca_system_score_codex":0.00044547272,"about_ca_system_score_gemma":0.00031685864,"threshold_uncertainty_score":0.0044307113},"labels":[],"label_agreement":null},{"id":"W7015723509","doi":"","title":"The 24th Congress of the Spanish Society for Microbiology (L'Hospitalet de Llobregat, Barcelona, 10-13 July 2013)","year":2013,"lang":"en","type":"article","venue":"Dipòsit Digital de la Universitat de Barcelona (Universitat de Barcelona)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Clinical microbiology; MEDLINE","score_opus":0.00313314641563969,"score_gpt":0.1819609411611809,"score_spread":0.1788277947455412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015723509","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008603623,0.28663537,0.0068559735,0.1225277,0.36200425,0.0006362008,0.003235299,0.0011961312,0.20830542],"genre_scores_gemma":[0.039822895,0.07392927,0.007195003,0.020379871,0.061803456,0.00050059805,0.003379591,0.000718046,0.7922713],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968869,0.0006672569,0.00018763781,0.00065279834,0.000788311,0.0008171738],"domain_scores_gemma":[0.99690634,0.0002054739,0.00030734818,0.00015496321,0.0010441635,0.0013817432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052613914,0.0023409452,0.0012891816,0.0024151902,0.001460911,0.006520238,0.0017726566,0.0049750297,0.09095189],"category_scores_gemma":[0.0024214296,0.00054664136,0.0011556762,0.0008939655,0.0016434126,0.001913497,0.004575708,0.003877746,0.054086186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036507775,0.00009527456,0.0011529966,0.00058292545,0.000030094423,0.00036211044,0.00015144446,0.00014388279,0.002584212,0.0030368548,0.88143575,0.11005945],"study_design_scores_gemma":[0.0000117458385,0.000042864096,0.0012114486,0.0001494772,0.000005002308,0.00020309907,0.000086963904,0.000031803873,0.00031607287,0.00029639874,0.9976369,0.000008258619],"about_ca_topic_score_codex":0.0031681408,"about_ca_topic_score_gemma":0.005329303,"teacher_disagreement_score":0.09095189,"about_ca_system_score_codex":0.0035738833,"about_ca_system_score_gemma":0.005060325,"threshold_uncertainty_score":0.30426437},"labels":[],"label_agreement":null},{"id":"W7020975202","doi":"","title":"Modular Verification of Distributed Systems with Grove","year":2022,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Correctness; Modular design; Server; Key (lock); Formal verification; Mathematical proof; Lock (firearm); Formal specification","score_opus":0.0077531021380127995,"score_gpt":0.23017038271107865,"score_spread":0.22241728057306584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020975202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045686737,0.00008594162,0.98804516,0.000090406735,0.00002873664,0.000080304504,0.00008111895,0.0046282443,0.0023914727],"genre_scores_gemma":[0.2656317,0.00028174897,0.7257317,0.00031930208,0.00006880911,0.0004166607,0.0005426536,0.0019960464,0.0050114295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945083,0.001823171,0.00035731122,0.0008167166,0.0018761252,0.0006183584],"domain_scores_gemma":[0.9927596,0.0038616878,0.00040561,0.002207099,0.0006616017,0.0001045001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004385261,0.0012381899,0.0010761269,0.0016195625,0.00081765425,0.00248224,0.0025177787,0.0011169864,0.0057911216],"category_scores_gemma":[0.011789548,0.0014413733,0.003154084,0.00072478055,0.0030925442,0.004584675,0.004652325,0.0029847978,0.0013607487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003614145,0.00017089752,0.0013209861,0.00082822976,0.00024442474,0.0007035731,0.0009932054,0.2791317,0.036037717,0.5485015,0.0050300043,0.12667629],"study_design_scores_gemma":[0.00022783205,0.00018998196,0.0003535956,0.00021326213,0.00013469078,0.00036410984,0.0000852052,0.6467098,0.051983338,0.26125717,0.038355295,0.00012581458],"about_ca_topic_score_codex":0.0025663967,"about_ca_topic_score_gemma":0.0031771604,"teacher_disagreement_score":0.0057911216,"about_ca_system_score_codex":0.0013913229,"about_ca_system_score_gemma":0.0016116127,"threshold_uncertainty_score":0.02319175},"labels":[],"label_agreement":null},{"id":"W7023942031","doi":"","title":"Population Protocols: Expressiveness, Succinctness and Automatic Verification.","year":2020,"lang":"en","type":"dissertation","venue":"mediaTUM  (Technical University of Munich)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Graduate School of Science and Engineering; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Succinctness; Population; CLARITY; Focus (optics); Computation; Space (punctuation); Correctness","score_opus":0.010290397564146288,"score_gpt":0.23146586694547414,"score_spread":0.22117546938132784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023942031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111241015,0.0021675085,0.9641392,0.0042173676,0.00019767083,0.00031438732,0.0005863583,0.0008239568,0.016429354],"genre_scores_gemma":[0.41239497,0.004505426,0.56355417,0.001715813,0.00058556575,0.0016326655,0.0020950458,0.00047151817,0.013044879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99181026,0.003100403,0.0006909983,0.0010439788,0.0030130628,0.00034137463],"domain_scores_gemma":[0.98085415,0.013552847,0.0010238366,0.003072603,0.0012183404,0.00027823224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00766881,0.0011075584,0.00082534796,0.0012471059,0.0012214326,0.0047902996,0.0026043605,0.0019539385,0.0049761087],"category_scores_gemma":[0.027200265,0.0012061388,0.00194857,0.0018737529,0.0063883387,0.01666029,0.0054889466,0.007229207,0.000981711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007078623,0.000055472166,0.0003284438,0.00024706844,0.00002866436,0.00011385982,0.0006399587,0.008246476,0.0016959839,0.9548076,0.0028911603,0.030874597],"study_design_scores_gemma":[0.000047282832,0.000038539485,0.00011257342,0.00010901597,0.000033984616,0.00020293637,0.00011359449,0.038078677,0.0025684196,0.94598925,0.01268304,0.000022676968],"about_ca_topic_score_codex":0.0013935135,"about_ca_topic_score_gemma":0.0012471474,"teacher_disagreement_score":0.00766881,"about_ca_system_score_codex":0.002589203,"about_ca_system_score_gemma":0.0023854803,"threshold_uncertainty_score":0.040557027},"labels":[],"label_agreement":null},{"id":"W7024323353","doi":"","title":"Quanta Services Announces Preliminary Third Quarter Results","year":2015,"lang":"en","type":"other","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Work (physics); Subject (documents)","score_opus":0.014224611518497632,"score_gpt":0.24720736397523074,"score_spread":0.2329827524567331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024323353","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056823674,0.0013644738,0.017274164,0.06127604,0.03155865,0.00081838685,0.040165722,0.016015181,0.82584506],"genre_scores_gemma":[0.025593555,0.0004948844,0.0062804488,0.009573505,0.0032354703,0.00034008786,0.025187118,0.0052945674,0.92400044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951031,0.0005336528,0.00008913642,0.0002984066,0.0029635986,0.0010120975],"domain_scores_gemma":[0.98820007,0.0017611771,0.00020778165,0.0014067612,0.004453283,0.003970949],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008874748,0.001195458,0.0016020813,0.001963562,0.003731798,0.011147131,0.0025972677,0.0044565066,0.363082],"category_scores_gemma":[0.016043127,0.00057736045,0.0013875074,0.00142442,0.0014803481,0.004027708,0.003991768,0.0044938163,0.19623014],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020873074,0.00008744966,0.000157975,0.000032552387,0.0000066280795,0.000029656449,0.000013042649,0.00027420683,0.00025567276,0.006800164,0.9836668,0.008467139],"study_design_scores_gemma":[0.00017991375,0.00015815253,0.0011687985,0.0000625409,0.000017772607,0.000040584484,0.00008654679,0.0046550045,0.0020154107,0.017442282,0.97413784,0.00003511393],"about_ca_topic_score_codex":0.014130973,"about_ca_topic_score_gemma":0.023807261,"teacher_disagreement_score":0.363082,"about_ca_system_score_codex":0.004644614,"about_ca_system_score_gemma":0.0065950467,"threshold_uncertainty_score":0.90848625},"labels":[],"label_agreement":null},{"id":"W7025017871","doi":"","title":"TOLL::::FREE:::Hp:::Support:::18.00.790.9186 Technical support phone number customer care phone number","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phone; 3d printer; Service (business); Smart phone; Phone call","score_opus":0.011399453245133867,"score_gpt":0.26931699593921865,"score_spread":0.2579175426940848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025017871","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057141064,0.00026552292,0.00095991575,0.00072380196,0.001058078,0.00016759356,0.0018096905,0.0038672597,0.99057674],"genre_scores_gemma":[0.0007585434,0.0001868717,0.00021881003,0.00012401758,0.00009804238,0.000023100223,0.00059309,0.0004564269,0.9975412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993554,0.000052241234,0.000022470775,0.00011211113,0.00035128155,0.000106397536],"domain_scores_gemma":[0.9976452,0.00016957198,0.000055919172,0.00017630678,0.001062216,0.0008907071],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000498818,0.0011134386,0.0010021959,0.0010806152,0.0018804757,0.0054838783,0.00088512315,0.0014207785,0.9377802],"category_scores_gemma":[0.002233392,0.0005673795,0.000535314,0.0011503657,0.0004910167,0.0021304039,0.0020317237,0.0012977851,0.9340746],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037580066,0.000037170983,0.00011738179,0.00005747938,0.0000013803821,0.00003372577,0.000023564622,0.000025345,0.00088613,0.00044823685,0.97215354,0.02617839],"study_design_scores_gemma":[0.000018742878,0.000062234045,0.00073325506,0.00007408514,0.000006031997,0.00011848123,0.00012501623,0.00012130434,0.00067420973,0.00015160718,0.9979044,0.000010634995],"about_ca_topic_score_codex":0.002874352,"about_ca_topic_score_gemma":0.0041338797,"teacher_disagreement_score":0.0622198,"about_ca_system_score_codex":0.0008493108,"about_ca_system_score_gemma":0.0011770558,"threshold_uncertainty_score":0.08874899},"labels":[],"label_agreement":null},{"id":"W7028017585","doi":"","title":"Efficient Geo-Distributed Transaction Processing","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Online transaction processing; Transaction processing; Commit; Compensating transaction; Distributed transaction; Database transaction; Transaction processing system; Serializability","score_opus":0.010457934834238576,"score_gpt":0.2074289269569261,"score_spread":0.19697099212268754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028017585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100246586,0.0028614071,0.84875476,0.00096820464,0.00024212917,0.00024728605,0.001641304,0.008815726,0.03622262],"genre_scores_gemma":[0.73335737,0.0012969237,0.2443613,0.00015426126,0.000100055346,0.00014258442,0.0025263068,0.00030469836,0.017756457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910176,0.00014436031,0.000059207396,0.00012973453,0.0004680639,0.00009686866],"domain_scores_gemma":[0.9991015,0.0001569183,0.00005791925,0.00036438697,0.00029179858,0.000027523882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053569453,0.00035521775,0.00033868838,0.00049280486,0.00052343134,0.0015448006,0.0009912552,0.00042239373,0.00397735],"category_scores_gemma":[0.001698986,0.00027692725,0.00019918599,0.0011464003,0.0002903169,0.0014510521,0.0009933303,0.00038653405,0.0024038078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004655949,0.00017643848,0.0043104943,0.00039235112,0.00009179944,0.00034270983,0.0003054244,0.18231434,0.08377163,0.057206243,0.046036854,0.62458616],"study_design_scores_gemma":[0.000073935,0.00012963318,0.0028548937,0.000029164168,0.00003651367,0.0003562433,0.00033053258,0.82703847,0.055700727,0.033855397,0.079560384,0.000034102515],"about_ca_topic_score_codex":0.0024843225,"about_ca_topic_score_gemma":0.0044441475,"teacher_disagreement_score":0.00397735,"about_ca_system_score_codex":0.0005848154,"about_ca_system_score_gemma":0.0011594158,"threshold_uncertainty_score":0.013305604},"labels":[],"label_agreement":null},{"id":"W7035612681","doi":"","title":"Acoustic Analysis of Electric Ducted Fans","year":2022,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.007717979387029243,"score_gpt":0.2056143389540666,"score_spread":0.19789635956703736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035612681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92624223,0.00023483245,0.05638529,0.00010377001,0.000037936123,0.000030144784,0.000115718765,0.0002049294,0.016645143],"genre_scores_gemma":[0.99424946,0.00003906032,0.0011998627,0.00000613431,0.0000058411306,0.000003905226,0.00003939518,0.0000106416965,0.004445733],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998524,0.000018149558,0.000003152372,0.000021774278,0.00008245631,0.00002209329],"domain_scores_gemma":[0.99984205,0.000053155414,0.000009567961,0.0000072712883,0.00007798235,0.000010022203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014805091,0.00025381616,0.0002245846,0.00047069357,0.0003157447,0.00028011829,0.00027067214,0.00027513903,0.0019750465],"category_scores_gemma":[0.00039665116,0.00010924033,0.00013032228,0.00022662162,0.00037039473,0.00019215823,0.00021769195,0.00020259096,0.00022608058],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009897834,0.00018993295,0.023073398,0.00011153557,0.00003493293,0.00058207737,0.00062495447,0.41126433,0.4342987,0.0053475252,0.0012173963,0.12226536],"study_design_scores_gemma":[0.000024101379,0.00018245174,0.030807465,0.000010020376,0.0000112313255,0.00016277471,0.0003050824,0.92894083,0.034932677,0.0007657667,0.0038341086,0.00002347055],"about_ca_topic_score_codex":0.008844667,"about_ca_topic_score_gemma":0.0071007106,"teacher_disagreement_score":0.008844667,"about_ca_system_score_codex":0.0003863736,"about_ca_system_score_gemma":0.0002504402,"threshold_uncertainty_score":0.01758641},"labels":[],"label_agreement":null},{"id":"W7036748358","doi":"","title":"CPC MP and immigration critic Michelle Rempel calls out Trudeau on failing to act on illegal border crossings and Morneau on a gender-based analysis of a national carbon tax","year":2018,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Parliament; Immigration; Refugee; Prime minister; National security; Immigration policy","score_opus":0.009253728737521517,"score_gpt":0.23334050125690112,"score_spread":0.2240867725193796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036748358","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064478694,0.002756096,0.0012450248,0.29943123,0.007992388,0.00008553491,0.00069009006,0.0004184422,0.6809334],"genre_scores_gemma":[0.040709235,0.0016597183,0.00058750383,0.032911256,0.00072421617,0.000035291592,0.0002104741,0.00040365438,0.92275864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806327,0.00017619572,0.000033593955,0.00015900617,0.0009802333,0.0005877365],"domain_scores_gemma":[0.9964323,0.0007527273,0.00012573123,0.00014519725,0.0016438363,0.00090017356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015644714,0.00035409254,0.0003057518,0.0011711913,0.019805107,0.0058320044,0.0010015997,0.004385315,0.08219657],"category_scores_gemma":[0.0064082122,0.0004017965,0.00034319004,0.0014760246,0.0028835123,0.002787098,0.0018093281,0.0061144214,0.011599352],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093768285,0.0000069337957,0.0003102731,0.000018006232,8.3553874e-7,0.00011772214,0.0009747872,0.00003150244,0.00013446344,0.01399945,0.9761465,0.008250127],"study_design_scores_gemma":[0.0000019208428,0.0000038958706,0.0005690441,0.00002992675,0.0000013285508,0.00006212978,0.0018337227,0.000037741986,0.00020353372,0.00062791025,0.99662006,0.000008621139],"about_ca_topic_score_codex":0.5441287,"about_ca_topic_score_gemma":0.74252874,"teacher_disagreement_score":0.45587128,"about_ca_system_score_codex":0.014843032,"about_ca_system_score_gemma":0.015464845,"threshold_uncertainty_score":0.917112},"labels":[],"label_agreement":null},{"id":"W7037315430","doi":"","title":"Effects of cattle and wild ungulate foraging on trembling aspen regeneration in Alberta's lower boreal forest","year":2001,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ungulate; Taiga; Foraging; Regeneration (biology); Exclosure; Natural regeneration; Forest regeneration","score_opus":0.0073556187808581,"score_gpt":0.22575517235790055,"score_spread":0.21839955357704244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037315430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99876535,0.00013606244,0.00001851094,0.000054573906,0.0000036257234,0.0000023017835,0.00021876162,0.0000051127336,0.00079578324],"genre_scores_gemma":[0.9976548,0.000119609904,0.000065622815,0.000050699422,0.0000031584648,0.0000026423404,0.00040426536,0.0000033982985,0.0016957168],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996711,0.00007612758,0.000010916108,0.000043197848,0.00006640434,0.00013229754],"domain_scores_gemma":[0.99870217,0.00027592224,0.00018666574,0.000049836784,0.00022423528,0.00056123146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319131,0.0002504204,0.00030710062,0.000568506,0.0012894148,0.00084745674,0.00089808786,0.00043003392,0.0020743357],"category_scores_gemma":[0.0010042441,0.00015078924,0.0002577839,0.0007461708,0.0010347062,0.0002466685,0.00055031595,0.0003702302,0.00020329184],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066444064,0.00049928046,0.9636002,0.00006205364,0.00024476607,0.0008520715,0.0010041976,0.0033165638,0.0086668115,0.0003412784,0.0026039432,0.012164492],"study_design_scores_gemma":[0.000014765815,0.000110096524,0.99771845,0.000006973846,0.00003164931,0.000048381182,0.0010580329,0.00040538475,0.00020239134,0.00004145767,0.00035735866,0.000004999459],"about_ca_topic_score_codex":0.8270141,"about_ca_topic_score_gemma":0.96909404,"teacher_disagreement_score":0.17298591,"about_ca_system_score_codex":0.00641675,"about_ca_system_score_gemma":0.0039709797,"threshold_uncertainty_score":0.3480093},"labels":[],"label_agreement":null},{"id":"W7037849563","doi":"","title":"The evaluation of the research on the social sciences in Turkey: A scientometric approach","year":2021,"lang":"en","type":"article","venue":"DSpace (Sirnak University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subject (documents); Nucleofection; Government (linguistics); Context (archaeology); Work (physics)","score_opus":0.2518332468355427,"score_gpt":0.38299869691802574,"score_spread":0.13116545008248304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037849563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90016764,0.012421754,0.010018592,0.0025791412,0.00022951314,0.0008943373,0.0037215736,0.00012491916,0.06984253],"genre_scores_gemma":[0.9909122,0.0025411036,0.0041687717,0.00007147489,0.00019283888,0.00023069384,0.0012172007,0.000014640478,0.00065109937],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9543765,0.013373657,0.006835196,0.0014630896,0.022638652,0.0013129028],"domain_scores_gemma":[0.9439607,0.022622112,0.011847689,0.0020628683,0.017823743,0.001682749],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.025239244,0.0007743849,0.0012445902,0.09867024,0.0019940112,0.009587073,0.0009947409,0.0012135763,0.0017684594],"category_scores_gemma":[0.06663025,0.00024968063,0.0008826088,0.10472778,0.001865552,0.004579158,0.003374189,0.00045638555,0.00051061966],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025678435,0.0002961221,0.6552909,0.003061862,0.00065500056,0.00078049104,0.007121606,0.005616688,0.0011973175,0.017022211,0.0047633904,0.3039377],"study_design_scores_gemma":[0.000022457361,0.00040511144,0.9358369,0.0009587428,0.00033795735,0.00063563325,0.018183263,0.010884135,0.0016480547,0.0071043563,0.02388716,0.00009627849],"about_ca_topic_score_codex":0.0041374858,"about_ca_topic_score_gemma":0.003762469,"teacher_disagreement_score":0.9747608,"about_ca_system_score_codex":0.005757882,"about_ca_system_score_gemma":0.0066961804,"threshold_uncertainty_score":0.13347948},"labels":[{"model":"gemma","categories":["metaresearch","bibliometrics"],"domain":"evaluation","study_design":"not_applicable","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W7039019765","doi":"","title":"Joe Gorder, CEO of Valero Energy Corporation (VLO), on the effects of the 2022 quarter – Transcript of the earnings call","year":2022,"lang":"en","type":"other","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Earnings; Corporation; Quarter (Canadian coin); Initial public offering","score_opus":0.004534908223567141,"score_gpt":0.17609689352419852,"score_spread":0.17156198530063138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039019765","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010088853,0.0037533732,0.0016440771,0.31991595,0.051768202,0.00024324188,0.0042885127,0.001125342,0.6071724],"genre_scores_gemma":[0.014587513,0.00074551255,0.0002167557,0.016316904,0.002387281,0.000041136318,0.0007276068,0.00025684785,0.9647204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847096,0.00012095712,0.000040548915,0.000095485135,0.0008829749,0.00038909537],"domain_scores_gemma":[0.9968978,0.00062641,0.00013785213,0.00011377113,0.001611597,0.00061261654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016473368,0.0003371845,0.00028173308,0.00057852693,0.0029752052,0.0034855288,0.000691529,0.003734707,0.1119699],"category_scores_gemma":[0.007312269,0.00023483782,0.00025748127,0.00046044236,0.00037829677,0.0012765481,0.0008691293,0.0033878188,0.040960856],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002669761,0.000011100124,0.00010916767,0.000006795388,8.704593e-7,0.000032965734,0.000023198805,0.000040784424,0.0001006593,0.0016836222,0.99350363,0.0044604596],"study_design_scores_gemma":[0.000013408246,0.000029958539,0.002147652,0.00003960196,0.0000030571728,0.000036155994,0.0004571259,0.0002751591,0.0003422164,0.00090200803,0.9957339,0.000019769308],"about_ca_topic_score_codex":0.028831607,"about_ca_topic_score_gemma":0.04975551,"teacher_disagreement_score":0.8880301,"about_ca_system_score_codex":0.0016678841,"about_ca_system_score_gemma":0.0031537814,"threshold_uncertainty_score":0.37457663},"labels":[],"label_agreement":null},{"id":"W7039330065","doi":"","title":"Les auberges et les cabarets de Montréal au milieu du XVIIIe siècle","year":2024,"lang":"fr","type":"article","venue":"Érudit (Université de Montréal)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Identity (music); Perspective (graphical); Government (linguistics)","score_opus":0.010156172581842633,"score_gpt":0.19090969378010755,"score_spread":0.18075352119826493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039330065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39408657,0.035687707,0.004210522,0.031564757,0.003200097,0.0003385833,0.00491949,0.0004914514,0.52550083],"genre_scores_gemma":[0.38244212,0.0060214633,0.002055071,0.0013453105,0.0002950109,0.00012420109,0.00055172906,0.00013790233,0.6070271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983071,0.00031113974,0.00003611975,0.00028533713,0.00034154614,0.00071863085],"domain_scores_gemma":[0.99944085,0.00008528002,0.00006735405,0.000018561852,0.00013211023,0.00025581944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549225,0.0012211435,0.00074475957,0.0016870969,0.012982602,0.0055096997,0.0011041694,0.0017855732,0.044976845],"category_scores_gemma":[0.0015492478,0.00079400034,0.00067438075,0.0025711507,0.0032032323,0.0015056961,0.0025758336,0.005104964,0.0029583205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001444426,0.00030830322,0.0464409,0.00073096075,0.00029870303,0.008887803,0.05680159,0.004917082,0.00917793,0.47625786,0.16067433,0.23406018],"study_design_scores_gemma":[0.000048550417,0.000045905017,0.031697586,0.00012019644,0.000020720987,0.00024741323,0.0049166773,0.0001920935,0.0006552554,0.0013454343,0.9606579,0.000052209234],"about_ca_topic_score_codex":0.9188032,"about_ca_topic_score_gemma":0.9717604,"teacher_disagreement_score":0.081196785,"about_ca_system_score_codex":0.044429228,"about_ca_system_score_gemma":0.024946226,"threshold_uncertainty_score":0.32235813},"labels":[],"label_agreement":null},{"id":"W7042445952","doi":"","title":"Peoples perception of pet illness – is it still disenfranchised?","year":2023,"lang":"en","type":"other","venue":"NORMA","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Empathy; Grief; Perception; Disenfranchised grief; Affect (linguistics); Scale (ratio)","score_opus":0.01292868218484917,"score_gpt":0.25628079367098744,"score_spread":0.24335211148613828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042445952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967535,0.00035960524,0.00016864632,0.00039990238,0.000018835894,0.000007635994,0.000011467194,0.0000022865247,0.002278021],"genre_scores_gemma":[0.9994873,0.00013679595,0.000045298133,0.000084576895,0.0000050469393,0.000003213759,0.000007068184,7.0743846e-7,0.00022992336],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9985123,0.0008795438,0.00007965701,0.00009309731,0.00027754996,0.0001577976],"domain_scores_gemma":[0.9968291,0.00079071516,0.0013718808,0.00016317955,0.00033497947,0.0005100873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020366644,0.00021629684,0.0002651092,0.000491337,0.0010918191,0.001686322,0.00018799593,0.0006495069,0.0020203672],"category_scores_gemma":[0.00661419,0.00013344978,0.00029250927,0.00028243018,0.0020308595,0.0013336665,0.0014738413,0.0010243825,0.00015750607],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004265845,0.00021825614,0.27594683,0.00030830372,0.000104279345,0.0020355945,0.67753196,0.00011316912,0.0065085655,0.0025104748,0.0013043568,0.03299159],"study_design_scores_gemma":[0.000018787669,0.00050089916,0.2127825,0.00015454293,0.00004081848,0.002701061,0.7740169,0.00021108934,0.00069242774,0.0011027756,0.0077258605,0.00005236171],"about_ca_topic_score_codex":0.0028109204,"about_ca_topic_score_gemma":0.0030784868,"teacher_disagreement_score":0.0028109204,"about_ca_system_score_codex":0.0007652288,"about_ca_system_score_gemma":0.00031410242,"threshold_uncertainty_score":0.010771036},"labels":[],"label_agreement":null},{"id":"W7043022955","doi":"","title":"Regreening program : 2018 Annual report","year":2021,"lang":"en","type":"book","venue":"Lu Zone Ul (Laurentian University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Vegetation (pathology); Topsoil; Smelting; Lead smelting; Erosion","score_opus":0.011678457942134906,"score_gpt":0.21268975138761453,"score_spread":0.20101129344547963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043022955","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026183932,0.0033864013,0.0016769483,0.017752983,0.016278071,0.0008026083,0.036088385,0.0045652743,0.916831],"genre_scores_gemma":[0.0018282929,0.0008566222,0.0003075283,0.0011516579,0.0008603251,0.00013565584,0.006730762,0.00028621545,0.9878429],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994987,0.000027210219,0.000016900736,0.00004725797,0.00032615682,0.00008377023],"domain_scores_gemma":[0.9987312,0.00007480135,0.000058723283,0.00007747712,0.0007029045,0.0003549136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082194846,0.0005891675,0.00028689345,0.00091706926,0.0008116548,0.0017508884,0.0010067559,0.0013588391,0.35552898],"category_scores_gemma":[0.001415066,0.00019160059,0.00027087374,0.0006646303,0.00015846522,0.0010303034,0.0010140901,0.0010374591,0.29664585],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012486249,0.00001869087,0.00008638162,0.00002020325,2.8484544e-7,0.000009840194,0.0000040945815,0.000013873657,0.00006651726,0.00020275234,0.9774935,0.022071486],"study_design_scores_gemma":[0.0000051625084,0.000012611825,0.00068178464,0.000019942298,5.8839595e-7,0.00001060674,0.000009278453,0.000025952868,0.0001119407,0.00006150438,0.9990588,0.0000018096065],"about_ca_topic_score_codex":0.00859544,"about_ca_topic_score_gemma":0.015892657,"teacher_disagreement_score":0.35552898,"about_ca_system_score_codex":0.0007867864,"about_ca_system_score_gemma":0.0023836812,"threshold_uncertainty_score":0.91925967},"labels":[],"label_agreement":null},{"id":"W7043756255","doi":"","title":"Tulevien hyvinvointialueiden toiveet lääkehuoltopalveluista ja niiden järjestämisestä","year":2022,"lang":"fi","type":"other","venue":"Työväentutkimus Vuosikirja","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Power (physics); Primary care; Quarter (Canadian coin)","score_opus":0.015674619250933382,"score_gpt":0.2429352191206859,"score_spread":0.22726059986975253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043756255","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022242676,0.0075383587,0.0035963068,0.022821767,0.009254896,0.00019457104,0.0033641811,0.0008676581,0.9301196],"genre_scores_gemma":[0.0212774,0.0020595875,0.0017498839,0.0013270169,0.00023663252,0.000057086716,0.0010883607,0.0002830684,0.9719211],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910307,0.00007746968,0.000034543486,0.00014769797,0.00038213131,0.0002551513],"domain_scores_gemma":[0.99902177,0.000121892925,0.000055127188,0.00005554859,0.00038199074,0.00036364485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012812135,0.00048998813,0.0004130554,0.0004977885,0.0030296347,0.007269089,0.0007677685,0.0018991106,0.20835237],"category_scores_gemma":[0.0015693958,0.00029743282,0.0004079206,0.0005527765,0.00087802316,0.0020905333,0.0036310926,0.0023852976,0.07160446],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000669766,0.00026663343,0.008751872,0.0006971757,0.00002942933,0.0008810127,0.004263762,0.0003510114,0.014982744,0.045160223,0.6249393,0.29900703],"study_design_scores_gemma":[0.0000053359245,0.000025423182,0.0019719496,0.000079122576,0.000004020702,0.000048279606,0.0009444417,0.000065809654,0.00085602794,0.0005138179,0.9954776,0.000008211921],"about_ca_topic_score_codex":0.026244547,"about_ca_topic_score_gemma":0.088368215,"teacher_disagreement_score":0.20835237,"about_ca_system_score_codex":0.003311697,"about_ca_system_score_gemma":0.007350449,"threshold_uncertainty_score":0.69700813},"labels":[],"label_agreement":null},{"id":"W7071385636","doi":"","title":"Scoped Behaviour for Optimized Distributed Data Sharing","year":2000,"lang":"en","type":"article","venue":"TSpace (University of Toronto)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Abstraction; Set (abstract data type); Flexibility (engineering); Interface (matter); Field (mathematics); Workstation; Data sharing; Protocol (science); Abstraction layer","score_opus":0.03779252250726848,"score_gpt":0.27300529775591587,"score_spread":0.2352127752486474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071385636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038991496,0.00020301186,0.9497443,0.00025091053,0.0000507352,0.000084794025,0.000055376004,0.004478308,0.0061410274],"genre_scores_gemma":[0.49444258,0.00025710143,0.4965722,0.00032477462,0.000041056315,0.00029217117,0.00029582996,0.0020222382,0.0057520703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.0003450939,0.0001284852,0.00015574819,0.00054633955,0.00017955131],"domain_scores_gemma":[0.99798346,0.00042217935,0.00012773716,0.0010349489,0.00032156118,0.00011005511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014408709,0.00033755534,0.00040009717,0.00044588905,0.00063055137,0.001044893,0.0011243862,0.00048553938,0.0021231791],"category_scores_gemma":[0.0035716204,0.00042659036,0.00052922795,0.00058456045,0.0012002884,0.001767337,0.0027236973,0.0012660247,0.000710816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007431026,0.00019745715,0.0064054322,0.00034769214,0.00009537691,0.0005277192,0.0023835953,0.16226031,0.14883491,0.34565613,0.015518818,0.31702948],"study_design_scores_gemma":[0.00015238236,0.00023154021,0.0015614947,0.000081421786,0.0000781088,0.00044815306,0.00023843329,0.65683955,0.06985191,0.18046635,0.08995458,0.0000962007],"about_ca_topic_score_codex":0.0013570711,"about_ca_topic_score_gemma":0.0020587915,"teacher_disagreement_score":0.0021231791,"about_ca_system_score_codex":0.00080863317,"about_ca_system_score_gemma":0.001104202,"threshold_uncertainty_score":0.007620156},"labels":[],"label_agreement":null},{"id":"W7083853012","doi":"","title":"3/13: Sports Update: Warriors slip by Rockets, Westbrook's triple-double, MLB changes, Brown eyes Rice","year":2019,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Guard (computer science); Victory; Slip (aerodynamics); Time line","score_opus":0.009404015706247614,"score_gpt":0.22593548086947637,"score_spread":0.21653146516322877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083853012","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007097649,0.003242761,0.0007701237,0.013980666,0.014002169,0.001229884,0.025003772,0.005014424,0.93604636],"genre_scores_gemma":[0.002505659,0.0047179856,0.0007040147,0.014321611,0.0057271966,0.0009379001,0.01971279,0.0012364736,0.9501363],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907696,0.000088778914,0.00007006046,0.000072736184,0.00046768284,0.00022380274],"domain_scores_gemma":[0.99524635,0.00039838196,0.00023421289,0.00015336665,0.0024695995,0.0014982085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011118116,0.0012842831,0.0009283659,0.0014952004,0.0016847597,0.0032953608,0.0023390984,0.0055331597,0.64617556],"category_scores_gemma":[0.0045253136,0.00070004497,0.000796457,0.001399451,0.0004121892,0.0027892708,0.0030239695,0.0044653816,0.53185225],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003700189,0.00003376043,0.000049347356,0.000052701394,9.735367e-7,0.000012437369,0.000004979853,0.000010787518,0.000023902066,0.00003555611,0.99064904,0.0090895705],"study_design_scores_gemma":[0.00006157186,0.00003722039,0.001161921,0.0001830398,0.0000035086957,0.00003160336,0.00002557271,0.00002216621,0.000037680253,0.00008407806,0.9983424,0.000009258299],"about_ca_topic_score_codex":0.023577763,"about_ca_topic_score_gemma":0.08892149,"teacher_disagreement_score":0.64617556,"about_ca_system_score_codex":0.001510812,"about_ca_system_score_gemma":0.0023592992,"threshold_uncertainty_score":0.5046876},"labels":[],"label_agreement":null},{"id":"W7091684084","doi":"10.5281/zenodo.17361471","title":"InsPIRe: Communication-Efficient PIR with Server-side Preprocessing","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Protocol (science); Preprocessor; Identification (biology); Set (abstract data type); Scheme (mathematics)","score_opus":0.018213165715483044,"score_gpt":0.23594005213564784,"score_spread":0.2177268864201648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091684084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018878173,0.00024446214,0.79182446,0.0003271117,0.00025400025,0.00067914696,0.0013331933,0.15566067,0.030798785],"genre_scores_gemma":[0.43779573,0.00019130268,0.4983731,0.0007435965,0.00015899462,0.0009233039,0.008072199,0.013413252,0.040328637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747366,0.0004878102,0.00015562339,0.00043347862,0.0010159588,0.0004333745],"domain_scores_gemma":[0.9973206,0.00045305665,0.00014011803,0.0015845553,0.00040327583,0.00009831739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022411412,0.0011513808,0.001380314,0.0007259581,0.0010011127,0.0017020741,0.003611647,0.0014939578,0.026655437],"category_scores_gemma":[0.003770182,0.00077735557,0.0006255094,0.00078329875,0.00094722677,0.0032491942,0.0026989023,0.0020796014,0.011292561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0069901906,0.0014883209,0.001556008,0.0011988599,0.00024808024,0.00050116546,0.0005664399,0.027788073,0.15878701,0.095280476,0.25668642,0.4489089],"study_design_scores_gemma":[0.0014229083,0.0011284329,0.0010833023,0.00011180412,0.00013596825,0.0008202735,0.00018034336,0.5086368,0.31389973,0.04169389,0.13064428,0.00024222022],"about_ca_topic_score_codex":0.0010511115,"about_ca_topic_score_gemma":0.0011321882,"teacher_disagreement_score":0.026655437,"about_ca_system_score_codex":0.00070374034,"about_ca_system_score_gemma":0.0014915009,"threshold_uncertainty_score":0.08917129},"labels":[],"label_agreement":null},{"id":"W7095194278","doi":"","title":"The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing (Extended Abstract)","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Detector; Consensus algorithm; Consensus; Distributed database; Distributed algorithm; Fault tolerance","score_opus":0.010383171610539121,"score_gpt":0.2371301651643811,"score_spread":0.22674699355384198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095194278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039626997,0.0014948541,0.9494042,0.003538905,0.00038481897,0.00012930216,0.000092490256,0.0005655631,0.0047628963],"genre_scores_gemma":[0.52813005,0.0017270395,0.45528555,0.0010729294,0.0011541168,0.00064531737,0.00035447552,0.00029344624,0.011336982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966703,0.0011745094,0.00023848639,0.00063452666,0.000941951,0.00034027247],"domain_scores_gemma":[0.9707652,0.023256276,0.0012840198,0.0016627309,0.0023577693,0.00067401736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049163364,0.00094008184,0.0014195301,0.0012155297,0.0013394501,0.002621916,0.0013394674,0.0014574489,0.0026679793],"category_scores_gemma":[0.030645331,0.00073825335,0.0010311563,0.0009267786,0.0033547492,0.004008235,0.0028334768,0.004439928,0.00052750483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050199084,0.00023769354,0.0031379338,0.0005771199,0.00016132968,0.00026313943,0.0006915888,0.15816581,0.006899673,0.6855591,0.018081052,0.12572359],"study_design_scores_gemma":[0.000114459464,0.00016908077,0.00030164482,0.000056291847,0.000055442488,0.00011134599,0.000099322315,0.35960793,0.006367143,0.6270559,0.006022914,0.000038573617],"about_ca_topic_score_codex":0.0012933015,"about_ca_topic_score_gemma":0.0011704854,"teacher_disagreement_score":0.0049163364,"about_ca_system_score_codex":0.0015215027,"about_ca_system_score_gemma":0.0023035302,"threshold_uncertainty_score":0.02600038},"labels":[],"label_agreement":null},{"id":"W7095423560","doi":"","title":"LOCK-FREE LINKED LISTS AND SKIP LISTS MIKHAIL FOMITCHEV","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correctness; Implementation; Amortized analysis; Data structure; Robustness (evolution); Gratitude","score_opus":0.009135215348563592,"score_gpt":0.2130998645220355,"score_spread":0.2039646491734719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095423560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03461839,0.007911747,0.89969915,0.0045932173,0.0013340351,0.00022933987,0.00059297256,0.0037398618,0.04728122],"genre_scores_gemma":[0.4522184,0.01137195,0.43480107,0.0028418016,0.0011004794,0.0011761839,0.0016577316,0.0019042108,0.0929282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823904,0.00030206217,0.00012962894,0.00028476477,0.00079209794,0.00025251746],"domain_scores_gemma":[0.9974667,0.0009584471,0.00021831825,0.0005083136,0.00074113434,0.0001070648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011244199,0.00054054224,0.0005481484,0.0013246881,0.0011762768,0.0032754133,0.0014016671,0.00097531645,0.008223495],"category_scores_gemma":[0.006920977,0.00065533747,0.00047595453,0.0021057953,0.0021730815,0.006532135,0.002829341,0.0021146324,0.0045560426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019497868,0.000051563253,0.00090522517,0.00032042727,0.000028204471,0.00010321806,0.00050018274,0.010359853,0.0064370306,0.74738026,0.028344959,0.20537399],"study_design_scores_gemma":[0.000083369945,0.0001824837,0.0008017163,0.00026529818,0.00005665894,0.00036587086,0.0002417539,0.052484315,0.026967123,0.6432043,0.2752205,0.00012664504],"about_ca_topic_score_codex":0.0026180123,"about_ca_topic_score_gemma":0.0015210094,"teacher_disagreement_score":0.008223495,"about_ca_system_score_codex":0.0015807637,"about_ca_system_score_gemma":0.002175696,"threshold_uncertainty_score":0.027510345},"labels":[],"label_agreement":null},{"id":"W7096145282","doi":"","title":"Toronto, Ontario,","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correctness; Bounded function; Transformation (genetics); Class (philosophy); Memory model; Model checking","score_opus":0.008067048135629053,"score_gpt":0.21299497766032505,"score_spread":0.204927929524696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096145282","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070103398,0.011887984,0.002342816,0.008472135,0.0017255363,0.00013939539,0.019224435,0.00064717984,0.9485502],"genre_scores_gemma":[0.012996155,0.005462555,0.001696806,0.0008751602,0.00006736422,0.000059110476,0.0038618005,0.00023907985,0.974742],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923134,0.00006097689,0.000040029536,0.00024127778,0.00025711456,0.00016931405],"domain_scores_gemma":[0.9984345,0.00020778996,0.00011776318,0.00013738977,0.0007089368,0.00039372194],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039920377,0.0009618886,0.0007496711,0.0010946346,0.005154403,0.0040927683,0.000992589,0.001530963,0.5173016],"category_scores_gemma":[0.001652225,0.0006212913,0.00054302724,0.003570144,0.001256031,0.0017379483,0.0018174914,0.0014797145,0.15873307],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005336418,0.00007512415,0.007066687,0.0015166556,0.00007271997,0.002417412,0.0022198856,0.0022080985,0.0041500377,0.060583904,0.68915397,0.2300019],"study_design_scores_gemma":[0.000021835504,0.000019176818,0.005547996,0.00018409209,0.00001601875,0.00015374989,0.0006260343,0.00032784304,0.00043013968,0.0020663203,0.9905827,0.000024176683],"about_ca_topic_score_codex":0.52532005,"about_ca_topic_score_gemma":0.85461575,"teacher_disagreement_score":0.52532005,"about_ca_system_score_codex":0.011999898,"about_ca_system_score_gemma":0.013055393,"threshold_uncertainty_score":0.95495087},"labels":[],"label_agreement":null},{"id":"W7096452452","doi":"","title":": Canada (2011)&amp;quot; Design and Performance Analysis of CAPE based on Discontinuous Incremental Checkpoints","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Key (lock); Cape; Process (computing)","score_opus":0.027130590445097,"score_gpt":0.2069146038356563,"score_spread":0.1797840133905593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096452452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44187182,0.0016865518,0.4521866,0.0015081052,0.00024068903,0.00055580994,0.0011180143,0.008141967,0.09269044],"genre_scores_gemma":[0.8992165,0.00038210003,0.07324201,0.000083614425,0.000011874008,0.00008376758,0.00040594718,0.00029293637,0.026281195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984646,0.0000143016005,0.000004313558,0.000030766358,0.00007413013,0.000030035833],"domain_scores_gemma":[0.9996331,0.00004149328,0.000020486921,0.000043404994,0.00022189629,0.000039654722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899388,0.00022312047,0.00016046286,0.00033600375,0.00046321028,0.00073920377,0.0006241689,0.00018898728,0.005998271],"category_scores_gemma":[0.0006024029,0.00015589967,0.00014194228,0.00028009826,0.0004878218,0.00028867717,0.00022118806,0.000287577,0.00067202194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012423978,0.00024132112,0.012563555,0.00044242735,0.000052685733,0.00061408,0.00047399214,0.30253303,0.2590102,0.034012586,0.027675856,0.36113784],"study_design_scores_gemma":[0.00016433903,0.0008136167,0.008548035,0.000058521608,0.00009199071,0.00022597352,0.00020606561,0.7477523,0.16518925,0.0034388613,0.07345895,0.000052133302],"about_ca_topic_score_codex":0.111536875,"about_ca_topic_score_gemma":0.1509602,"teacher_disagreement_score":0.111536875,"about_ca_system_score_codex":0.0025550337,"about_ca_system_score_gemma":0.0028027908,"threshold_uncertainty_score":0.2217753},"labels":[],"label_agreement":null},{"id":"W7096673736","doi":"","title":"Author manuscript, published in &amp;quot;HPCC-2011- International Conferences on High Performance Computing and Communications, Banff: Canada (2011)&amp;quot; Improving Performance of CAPE using Discontinuous Incremental Checkpointing","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Supercomputer; Transfer (computing); Order (exchange); Execution time; Data transmission","score_opus":0.050640548474560704,"score_gpt":0.25346945285385053,"score_spread":0.20282890437928983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096673736","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01134443,0.011245663,0.058556616,0.022018958,0.17901526,0.0006647016,0.012069243,0.005560125,0.69952494],"genre_scores_gemma":[0.01480503,0.0034271362,0.011677765,0.00063311245,0.0028501567,0.0000468308,0.003103448,0.0013760846,0.9620804],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926203,0.00008376581,0.00004694858,0.0001978714,0.00030722245,0.00010215275],"domain_scores_gemma":[0.99571973,0.0006794998,0.00009873058,0.0006007234,0.002436126,0.00046512013],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016843171,0.0006849268,0.0011943858,0.0012550522,0.0014015904,0.0048426418,0.0011148576,0.0009962826,0.4079158],"category_scores_gemma":[0.006888751,0.00050251774,0.00063944247,0.0020514776,0.0007184154,0.0015406301,0.0011940543,0.0007424559,0.17803237],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003404554,0.00008478785,0.0010631812,0.00046772146,0.000055357283,0.00025930756,0.00013038355,0.0014151814,0.0035829486,0.010819227,0.7979361,0.18384533],"study_design_scores_gemma":[0.000036348483,0.00008915156,0.00082078745,0.00010075649,0.000021288966,0.00024679632,0.000069335954,0.0018253407,0.0036423716,0.002358008,0.99077004,0.000019867583],"about_ca_topic_score_codex":0.0031891314,"about_ca_topic_score_gemma":0.006954513,"teacher_disagreement_score":0.4079158,"about_ca_system_score_codex":0.0011925289,"about_ca_system_score_gemma":0.0018201016,"threshold_uncertainty_score":0.84453624},"labels":[],"label_agreement":null},{"id":"W7097888486","doi":"","title":"Performance Evaluation Of Replica Control Strategies In A Distributed System","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Replica; Replication (statistics); Correctness; Distributed database; Variety (cybernetics); Control (management); Data access; Object (grammar); Distributed object; Access control","score_opus":0.017899782645076502,"score_gpt":0.2725418613164446,"score_spread":0.25464207867136807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097888486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9794277,0.00034961433,0.016829386,0.000103425074,0.000019397557,0.00009624853,0.000056445293,0.00033696427,0.0027807788],"genre_scores_gemma":[0.9964784,0.000040123137,0.003203695,0.0000064525893,0.0000024213828,0.00002320812,0.0000366108,0.000010938824,0.0001980853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969426,0.0012831177,0.00021239645,0.00028539693,0.00091454963,0.00036198556],"domain_scores_gemma":[0.97304666,0.018437253,0.0016731,0.002014065,0.003929387,0.0008995369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047807433,0.0007656446,0.00077239866,0.0010562923,0.00064580125,0.0010150917,0.00089076214,0.0007880342,0.0009900145],"category_scores_gemma":[0.019425929,0.00027911458,0.00027383913,0.0009421823,0.0009018866,0.00081539166,0.00062873034,0.00047786458,0.00019538852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017600296,0.00042519785,0.011676216,0.00009620378,0.00008354807,0.000092181486,0.0001844503,0.9299917,0.012966367,0.0024403906,0.00045128915,0.039832503],"study_design_scores_gemma":[0.000085659696,0.0011881596,0.0029299078,0.000008898644,0.00003339792,0.000032597636,0.00010248448,0.98420495,0.01060688,0.0005675064,0.00021774857,0.000021868662],"about_ca_topic_score_codex":0.0074138027,"about_ca_topic_score_gemma":0.0031807397,"teacher_disagreement_score":0.0074138027,"about_ca_system_score_codex":0.001976123,"about_ca_system_score_gemma":0.0010639902,"threshold_uncertainty_score":0.025283277},"labels":[],"label_agreement":null},{"id":"W7098003479","doi":"","title":"On the power of shared object types to implement one-resilient Consensus","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Object (grammar); Power (physics); Natural (archaeology); Commonwealth; Context (archaeology)","score_opus":0.020896712144482216,"score_gpt":0.27112832426117606,"score_spread":0.25023161211669387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098003479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10282371,0.0006918363,0.8599548,0.0022256982,0.0004308393,0.00013498442,0.0001031249,0.0017598949,0.031875018],"genre_scores_gemma":[0.82191926,0.00053170254,0.16235656,0.00057666417,0.00020748249,0.00021087793,0.00015242922,0.00045650394,0.013588522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979388,0.0006977596,0.00020994282,0.00019519802,0.0006302434,0.0003279378],"domain_scores_gemma":[0.982605,0.0102181705,0.00055156386,0.004897664,0.0013404364,0.0003871556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048791855,0.00037018573,0.00053992437,0.0012103878,0.0015783694,0.0024343415,0.0019200176,0.0011815109,0.004780378],"category_scores_gemma":[0.015060246,0.00069163844,0.00071114395,0.0009998474,0.004642478,0.0069355015,0.0037887963,0.0026874894,0.00080603716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005544726,0.00009029463,0.0010104598,0.00013061608,0.00004262467,0.00016889829,0.0006202418,0.06540007,0.004849292,0.84891295,0.004780336,0.07343982],"study_design_scores_gemma":[0.00015751406,0.00014637006,0.00029077256,0.000063102525,0.00007337186,0.00013721363,0.00012961857,0.31245616,0.006414364,0.6705671,0.00950447,0.000059967806],"about_ca_topic_score_codex":0.0024636856,"about_ca_topic_score_gemma":0.0033803552,"teacher_disagreement_score":0.0048791855,"about_ca_system_score_codex":0.0014559237,"about_ca_system_score_gemma":0.0010459815,"threshold_uncertainty_score":0.025803924},"labels":[],"label_agreement":null},{"id":"W7098008592","doi":"","title":"THE UNIVERSITY OF CALGARY Limitations and Capabilities ofWeak Memory Consistency Systems","year":2000,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Consistency model; Sequential consistency; Causal consistency; Weak consistency; Consistency (knowledge bases); Equivalence (formal languages); Strong consistency; Formalism (music)","score_opus":0.014137514456243505,"score_gpt":0.1845425023439074,"score_spread":0.1704049878876639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098008592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21772566,0.007692554,0.3767516,0.019665416,0.00079166336,0.0002791829,0.00070433994,0.0034999836,0.37288964],"genre_scores_gemma":[0.86904913,0.0022667244,0.078230076,0.0012651016,0.00017527952,0.00021508879,0.00049395114,0.00043803026,0.04786653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958092,0.0012812996,0.00034160836,0.0005524561,0.0013093314,0.0007059946],"domain_scores_gemma":[0.9893027,0.0038845567,0.00060813734,0.0035436768,0.002174677,0.0004862014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004065428,0.00046053674,0.00082258385,0.001013306,0.002304259,0.007510556,0.0023481192,0.0014314627,0.015640846],"category_scores_gemma":[0.016191732,0.0006404653,0.0006594015,0.001312357,0.0031969442,0.0073077534,0.007931508,0.0026569434,0.0016967125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011108321,0.000036413876,0.0020023677,0.00019026357,0.000023836523,0.00019764838,0.0013235519,0.014716555,0.0017752249,0.92315286,0.0063043423,0.050165795],"study_design_scores_gemma":[0.00008213447,0.00011586773,0.0015463277,0.0005938238,0.000059231956,0.0002861203,0.0011634309,0.097332716,0.006385702,0.6890097,0.20335314,0.00007181606],"about_ca_topic_score_codex":0.041613147,"about_ca_topic_score_gemma":0.027589433,"teacher_disagreement_score":0.041613147,"about_ca_system_score_codex":0.006761212,"about_ca_system_score_gemma":0.005537037,"threshold_uncertainty_score":0.082741916},"labels":[],"label_agreement":null},{"id":"W7098935910","doi":"","title":"An ontology-based solution for knowledge management and elearning integration. Intelligent Tutoring Systems, 2006, 716-718 161 Approach for Automatic Aggregation Biographies Amal Zouaq is a Ph.D. Student at the University of Montreal. She is a member of t","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exploit; Competence (human resources); Organizational memory; Organizational learning; Set (abstract data type); Intelligent tutoring system; Asset (computer security)","score_opus":0.017954385928768735,"score_gpt":0.24998924325370167,"score_spread":0.23203485732493292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098935910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055253827,0.0002833071,0.98644257,0.0011693249,0.00009421374,0.00022478992,0.00027349824,0.0013469041,0.0046399725],"genre_scores_gemma":[0.04335765,0.0002594856,0.9512637,0.00015660339,0.000027992954,0.00019419419,0.00065192045,0.00010229363,0.0039860336],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984824,0.00032542177,0.00023456402,0.00025129435,0.00056351715,0.00014277248],"domain_scores_gemma":[0.9987349,0.00028771255,0.00013092087,0.0003291234,0.00038080622,0.00013661594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026863855,0.00043034187,0.0006845522,0.002411691,0.0016313429,0.0038289677,0.0024334535,0.0021973806,0.0045286273],"category_scores_gemma":[0.0050797793,0.00062597846,0.0017235497,0.0023932823,0.00092396245,0.0060458626,0.00430923,0.0022676792,0.0017140759],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018394622,0.000658441,0.0029045697,0.0004310044,0.000249328,0.00072591985,0.002158314,0.017405266,0.01576667,0.22214118,0.027609363,0.7097661],"study_design_scores_gemma":[0.00011503107,0.000095483054,0.0020407427,0.00031764357,0.0003430658,0.0008676598,0.0022795177,0.5789303,0.016621042,0.22637261,0.17192377,0.00009308448],"about_ca_topic_score_codex":0.007406105,"about_ca_topic_score_gemma":0.01329798,"teacher_disagreement_score":0.007406105,"about_ca_system_score_codex":0.0013570259,"about_ca_system_score_gemma":0.002336595,"threshold_uncertainty_score":0.015149832},"labels":[],"label_agreement":null},{"id":"W7100253954","doi":"","title":"Organization","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Advice (programming); Conjunction (astronomy); Software; Steering committee","score_opus":0.011266202179895445,"score_gpt":0.18821885132314217,"score_spread":0.17695264914324674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100253954","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004789204,0.006859505,0.021483537,0.082623854,0.054623052,0.0029906149,0.019113895,0.0055022086,0.8020141],"genre_scores_gemma":[0.016934508,0.0026179426,0.007509439,0.011233541,0.0035392062,0.0014342694,0.011783973,0.0013288582,0.9436183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.991247,0.0016601139,0.00057042914,0.0019160622,0.0028016602,0.0018047849],"domain_scores_gemma":[0.9603415,0.0017391567,0.0014316954,0.004887233,0.02228723,0.009313142],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009880849,0.0011890408,0.00094157696,0.00276382,0.004815693,0.013476014,0.004098619,0.0033732604,0.38849708],"category_scores_gemma":[0.020112742,0.00049315236,0.00068238325,0.0029561918,0.0012852779,0.003679554,0.0061195665,0.0024805462,0.33232135],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001258109,0.00003259919,0.0007399421,0.0002638585,0.000009026855,0.000097970034,0.0004840006,0.00010237976,0.0004875337,0.012375902,0.91520053,0.07008052],"study_design_scores_gemma":[0.0000065215627,0.000014784373,0.00034825152,0.00008674645,0.0000025039446,0.000051765386,0.0003369371,0.000060804847,0.000109993256,0.0011319758,0.9978441,0.0000055177875],"about_ca_topic_score_codex":0.009069699,"about_ca_topic_score_gemma":0.007469034,"teacher_disagreement_score":0.6115029,"about_ca_system_score_codex":0.007538131,"about_ca_system_score_gemma":0.020612752,"threshold_uncertainty_score":0.8722347},"labels":[],"label_agreement":null},{"id":"W7100297849","doi":"","title":"Fast Deterministic Computations on a Faulty PRAM","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiprocessing; Computation; Bounded function; Task (project management); Preprocessor; Parallel processing; Fraction (chemistry)","score_opus":0.015979653645831666,"score_gpt":0.2826921580382353,"score_spread":0.2667125043924036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100297849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07166605,0.00006638751,0.9248729,0.000169115,0.000037126756,0.0000529355,0.00006317709,0.0011433513,0.0019289914],"genre_scores_gemma":[0.6825811,0.00012927738,0.31342125,0.00007822129,0.000043449887,0.00023911518,0.00015777012,0.00014861966,0.0032012148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00038473847,0.00006512641,0.00020246007,0.00032877247,0.00015809765],"domain_scores_gemma":[0.99628216,0.0018800469,0.00027762234,0.001128135,0.00033315792,0.00009890965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010624075,0.00048343508,0.00067065307,0.00030764804,0.0008584236,0.0008143721,0.0018991767,0.00076390133,0.0023679412],"category_scores_gemma":[0.0058803884,0.0004593858,0.0010239239,0.00037234952,0.0019109925,0.0017636443,0.0016565693,0.0013014885,0.00045990042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024686984,0.0000472393,0.001179291,0.00007853543,0.000048872793,0.00024537888,0.0002143182,0.8579751,0.008231943,0.11588502,0.00067156367,0.015175807],"study_design_scores_gemma":[0.000034779157,0.000047797228,0.000055804197,0.000004365536,0.000010405695,0.00003687887,0.000011903958,0.96411926,0.0038454055,0.03087039,0.00095563644,0.0000073516585],"about_ca_topic_score_codex":0.002165046,"about_ca_topic_score_gemma":0.001570303,"teacher_disagreement_score":0.0023679412,"about_ca_system_score_codex":0.0006647422,"about_ca_system_score_gemma":0.000976461,"threshold_uncertainty_score":0.0079215765},"labels":[],"label_agreement":null},{"id":"W7106207000","doi":"","title":"Hapax Locks : Value-Based Mutual Exclusion","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mutual exclusion; FIFO (computing and electronics); Latency (audio); Coherence (philosophical gambling strategy); Space (punctuation)","score_opus":0.022346242155894452,"score_gpt":0.2675336411757164,"score_spread":0.24518739901982192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106207000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013835965,0.0004073935,0.971298,0.00021736967,0.00025734436,0.00013079242,0.00011955019,0.007391489,0.0063422373],"genre_scores_gemma":[0.6314746,0.0004148274,0.34725082,0.00047514855,0.00026940688,0.00042074517,0.0005127713,0.0018684465,0.017313188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883574,0.00029652662,0.0000652063,0.00017279576,0.00040613086,0.00022359769],"domain_scores_gemma":[0.9983889,0.00062754075,0.00016392156,0.00047397485,0.0001971837,0.00014849358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010906258,0.0004600359,0.0005643269,0.00046744564,0.00096939347,0.0016155567,0.0021312342,0.00056682655,0.008031144],"category_scores_gemma":[0.0037972252,0.00032377988,0.00029272324,0.00059076253,0.0011338919,0.0023761946,0.0032767633,0.0013116042,0.0016319598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015409595,0.00028864612,0.003086106,0.0005062335,0.00013219846,0.00034887766,0.0006424475,0.04672499,0.034873545,0.25155157,0.047589302,0.61271507],"study_design_scores_gemma":[0.00059329,0.00051628065,0.00077991374,0.000111679015,0.00010917795,0.0004858901,0.00019158259,0.57674205,0.078976326,0.20818491,0.1331657,0.0001432],"about_ca_topic_score_codex":0.0010746097,"about_ca_topic_score_gemma":0.0016415337,"teacher_disagreement_score":0.008031144,"about_ca_system_score_codex":0.0004693551,"about_ca_system_score_gemma":0.001218354,"threshold_uncertainty_score":0.026866794},"labels":[],"label_agreement":null},{"id":"W7109943489","doi":"10.4230/lipics.disc.2025.3","title":"An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Bounded function; Asynchronous communication; Communication complexity; Binary logarithm; Value (mathematics); Leader election; Key (lock); Time complexity","score_opus":0.010093199235443285,"score_gpt":0.2679484564725383,"score_spread":0.257855257237095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109943489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14766696,0.0030684944,0.7915364,0.010184048,0.0005849793,0.00040258793,0.00104939,0.0035072628,0.041999865],"genre_scores_gemma":[0.82503724,0.001111419,0.15326695,0.0016026214,0.0005539351,0.000670252,0.0011747722,0.0012733748,0.015309446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931636,0.001665477,0.00023800609,0.0012574191,0.0017324927,0.0019431624],"domain_scores_gemma":[0.95834374,0.03231544,0.0016396436,0.0048902305,0.001327163,0.0014838119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040458,0.0016090752,0.00168677,0.0011601058,0.0018075936,0.004890998,0.0042577717,0.00189207,0.01140266],"category_scores_gemma":[0.026859663,0.00063076866,0.0022402052,0.001443057,0.0031603994,0.012428004,0.004473293,0.0060644015,0.0026281832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003992397,0.0012052394,0.008767878,0.0014796407,0.00042500685,0.00069708657,0.0013073409,0.37145293,0.04674827,0.37553132,0.037013713,0.15137926],"study_design_scores_gemma":[0.00016525951,0.00028395085,0.00088119035,0.00006820987,0.00010555408,0.00019901014,0.00012207153,0.728507,0.010999396,0.25399977,0.004614222,0.00005437418],"about_ca_topic_score_codex":0.0015539763,"about_ca_topic_score_gemma":0.0019713673,"teacher_disagreement_score":0.01140266,"about_ca_system_score_codex":0.0034277595,"about_ca_system_score_gemma":0.0033433756,"threshold_uncertainty_score":0.03814572},"labels":[],"label_agreement":null},{"id":"W7109999228","doi":"10.4230/lipics.disc.2025.55","title":"Brief Announcement: Concurrent Double-Ended Priority Queues","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Priority inheritance; Priority queue; Priority ceiling protocol; Queue; Priority inversion; Multilevel queue","score_opus":0.01507876169370958,"score_gpt":0.28471995167040764,"score_spread":0.26964118997669806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109999228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012734343,0.014383572,0.6452271,0.04015678,0.18980257,0.0009650349,0.0013560874,0.010354706,0.08501987],"genre_scores_gemma":[0.24307384,0.025748214,0.22325076,0.018647922,0.097532794,0.0009745179,0.0054292926,0.0033539985,0.38198867],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997062,0.0004621143,0.00026072658,0.00050423935,0.001275166,0.00043576502],"domain_scores_gemma":[0.99393046,0.0013426559,0.00019194919,0.0005849362,0.0029122178,0.0010377299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006031907,0.00080367265,0.00055673777,0.0007740459,0.0015752302,0.004793402,0.0023023908,0.0028655014,0.029859185],"category_scores_gemma":[0.01048482,0.000967733,0.00059146114,0.0014962401,0.0009916017,0.0062298155,0.0019086893,0.003990686,0.010393011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012327981,0.00020732178,0.00069354154,0.0007639594,0.00004657668,0.0006099558,0.0004357838,0.0024562543,0.013390034,0.22116327,0.50434846,0.25465202],"study_design_scores_gemma":[0.00023058944,0.00041017926,0.00024708573,0.00012568019,0.000046145866,0.0004375001,0.00008444933,0.009749731,0.010851382,0.026919596,0.95080984,0.00008780161],"about_ca_topic_score_codex":0.0020843847,"about_ca_topic_score_gemma":0.0015997734,"teacher_disagreement_score":0.029859185,"about_ca_system_score_codex":0.0017395505,"about_ca_system_score_gemma":0.0026289457,"threshold_uncertainty_score":0.09988892},"labels":[],"label_agreement":null},{"id":"W7110002706","doi":"10.4230/lipics.disc.2025.48","title":"Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Indian Institute of Technology Madras","keywords":"Asynchronous communication; Protocol (science); Upper and lower bounds; Asynchronous system; Download; Peer-to-peer; Resilience (materials science); Fraction (chemistry); Crash","score_opus":0.012050778160938367,"score_gpt":0.28325987314159373,"score_spread":0.2712090949806554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110002706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07143284,0.05464255,0.57959396,0.15758988,0.058591068,0.00061263156,0.0039366307,0.005921023,0.06767942],"genre_scores_gemma":[0.75365126,0.033939667,0.058404088,0.0131185055,0.075572655,0.0007193094,0.0048640007,0.0011344993,0.058596008],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974298,0.0008026478,0.0001400496,0.00057266804,0.00069501676,0.0003598623],"domain_scores_gemma":[0.98849106,0.00818844,0.00058971666,0.00070836896,0.0012381278,0.00078430463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025915424,0.0008973877,0.0016095012,0.0012212628,0.0018440393,0.0032795414,0.0021664423,0.004364431,0.014380923],"category_scores_gemma":[0.022764152,0.0009303156,0.0008092148,0.0020271617,0.0021135893,0.007998824,0.0020897186,0.005106418,0.0035303428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015210435,0.00019560222,0.0027430372,0.0025474445,0.00013751589,0.0011995728,0.00052894966,0.054451443,0.005053163,0.3756414,0.435036,0.12094484],"study_design_scores_gemma":[0.0004827774,0.0005516268,0.0024293452,0.00037642728,0.00022448876,0.0013678881,0.0004533851,0.29130077,0.004155648,0.35883117,0.3395619,0.00026452148],"about_ca_topic_score_codex":0.0026185152,"about_ca_topic_score_gemma":0.0018814874,"teacher_disagreement_score":0.014380923,"about_ca_system_score_codex":0.002951921,"about_ca_system_score_gemma":0.0014137641,"threshold_uncertainty_score":0.048108995},"labels":[],"label_agreement":null},{"id":"W7115577997","doi":"10.1108/978-1-83708-468-520251009","title":"Disruption Maximization","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario College of Art and Design","funders":"","keywords":"","score_opus":0.011594510115202385,"score_gpt":0.22577028958059567,"score_spread":0.2141757794653933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115577997","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005575428,0.0026162425,0.438917,0.0029516509,0.00059236516,0.00014464882,0.00068055146,0.0012049011,0.5473172],"genre_scores_gemma":[0.27453458,0.005756761,0.09407747,0.0015913201,0.00080725556,0.0004237628,0.0013044928,0.0014001635,0.6201042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949086,0.000121659745,0.0000129124255,0.00013693949,0.00014815136,0.000089530644],"domain_scores_gemma":[0.999342,0.00025395176,0.000041346677,0.00016409573,0.00012229488,0.00007624599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253088,0.0014047393,0.0010173818,0.00064467866,0.0008305653,0.002393961,0.0016550063,0.0011798531,0.054660667],"category_scores_gemma":[0.003013137,0.0003826815,0.00047937903,0.001475785,0.0010932361,0.0023102083,0.0014769265,0.002517848,0.01605061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092625254,0.000093272174,0.00012308627,0.00020248047,0.000025980084,0.000059120386,0.00008732945,0.03350451,0.0022464213,0.688565,0.10328548,0.1717147],"study_design_scores_gemma":[0.000026133508,0.00005143336,0.00020553496,0.00006406909,0.000019990646,0.00018591998,0.000069925954,0.08418241,0.0024045992,0.78928643,0.12348605,0.00001745317],"about_ca_topic_score_codex":0.0009921512,"about_ca_topic_score_gemma":0.0010045804,"teacher_disagreement_score":0.054660667,"about_ca_system_score_codex":0.0016047597,"about_ca_system_score_gemma":0.0011321381,"threshold_uncertainty_score":0.18285811},"labels":[],"label_agreement":null},{"id":"W7117103606","doi":"10.1007/s10619-025-07455-x","title":"Revisiting shared registers and leaderless consensus in WAN environments","year":2025,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Latency (audio); Throughput; Overhead (engineering); Protocol (science); Process (computing); Communications protocol; Distributed database","score_opus":0.029226334190379503,"score_gpt":0.2739984755017218,"score_spread":0.24477214131134228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117103606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07197771,0.0042459145,0.87895226,0.0070049143,0.0013063747,0.00009089119,0.00011262388,0.00085004506,0.03545916],"genre_scores_gemma":[0.86510223,0.003205983,0.10871863,0.0009429807,0.0010498363,0.00010629943,0.00015202284,0.0005842589,0.020137824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976089,0.0009834323,0.000121618425,0.0003996225,0.00055595674,0.00033035237],"domain_scores_gemma":[0.98896885,0.0062864115,0.00032809147,0.0028007592,0.0013490252,0.0002668202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050325952,0.00051981077,0.0009316981,0.0008503266,0.0017758168,0.0036953748,0.0031865116,0.0018463606,0.004867916],"category_scores_gemma":[0.019453669,0.00057252665,0.0006594996,0.0014078886,0.0035257128,0.016054278,0.003926725,0.0033398247,0.0010140539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038064568,0.00009140014,0.0009647949,0.0002445801,0.0000409106,0.00024238694,0.0010294041,0.062644884,0.0022302822,0.825875,0.0053498778,0.10090588],"study_design_scores_gemma":[0.00006976415,0.00010760469,0.00022263297,0.00008318076,0.000057114252,0.000072635456,0.0005185762,0.21522391,0.0031261384,0.75428593,0.026195757,0.00003662724],"about_ca_topic_score_codex":0.003191395,"about_ca_topic_score_gemma":0.0037084485,"teacher_disagreement_score":0.0050325952,"about_ca_system_score_codex":0.001196941,"about_ca_system_score_gemma":0.0019202388,"threshold_uncertainty_score":0.026615262},"labels":[],"label_agreement":null},{"id":"W7117978547","doi":"10.1145/3712285.3787171","title":"10.1145/3712285.3787171","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Key (lock); Component (thermodynamics)","score_opus":0.004671834842515869,"score_gpt":0.17175077156802274,"score_spread":0.16707893672550686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117978547","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001970778,0.006524472,0.01097431,0.0012336877,0.0019365719,0.00046892633,0.012370066,0.016109046,0.94841206],"genre_scores_gemma":[0.0029469056,0.0021685562,0.0015846791,0.00064977125,0.00013291783,0.00018868981,0.0073219454,0.0018179406,0.98318857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991824,0.000054985405,0.0000636978,0.0002364019,0.0002812267,0.00018129883],"domain_scores_gemma":[0.99835545,0.00035068483,0.00008637457,0.0005575451,0.000373359,0.00027654206],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016636915,0.0039304234,0.0029823086,0.0030335607,0.002921956,0.005109871,0.0033359143,0.0062765074,0.9391376],"category_scores_gemma":[0.0032150138,0.0019516076,0.0013342382,0.0103800185,0.0014483837,0.010865988,0.0062926174,0.0031398062,0.96235436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029497346,0.00017034383,0.00042754406,0.00062697974,0.000044020613,0.00021762388,0.00009063507,0.00069148256,0.0013860774,0.0065515283,0.63129437,0.3582044],"study_design_scores_gemma":[0.00004065411,0.000036321508,0.00061526423,0.000258788,0.000044459153,0.00015418962,0.00005728028,0.00074059906,0.0005274389,0.0014429413,0.9960465,0.00003558571],"about_ca_topic_score_codex":0.018624403,"about_ca_topic_score_gemma":0.012536258,"teacher_disagreement_score":0.060862422,"about_ca_system_score_codex":0.00252495,"about_ca_system_score_gemma":0.0010838922,"threshold_uncertainty_score":0.086812794},"labels":[],"label_agreement":null},{"id":"W7117982320","doi":"10.1145/3712285.3787163","title":"10.1145/3712285.3787163","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Resilience (materials science); Anomaly (physics); Psychological resilience; Component (thermodynamics)","score_opus":0.004671834842515869,"score_gpt":0.17175077156802274,"score_spread":0.16707893672550686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117982320","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002070906,0.006059814,0.010065823,0.0011850912,0.0020110423,0.0005195244,0.012022628,0.016405316,0.9496599],"genre_scores_gemma":[0.0027365526,0.0020407848,0.0014695403,0.00068009127,0.00013627067,0.00019811068,0.0064718225,0.0017713441,0.9844956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916506,0.000051602,0.000066269975,0.0002544362,0.00028152156,0.00018107037],"domain_scores_gemma":[0.9982895,0.00036047725,0.000088953944,0.00056882086,0.0003895531,0.00030276447],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017687221,0.0040513794,0.0030974757,0.0030337134,0.0029610714,0.0051559554,0.003364311,0.0063090385,0.94746125],"category_scores_gemma":[0.0031210883,0.0021136417,0.0014355049,0.009962544,0.001540785,0.0114764385,0.0065204976,0.003248652,0.96814317],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030655414,0.00019500453,0.00047865981,0.0006532649,0.00004814697,0.00023035883,0.00009772022,0.0006973922,0.0014526701,0.005868218,0.64853376,0.34143826],"study_design_scores_gemma":[0.000048173835,0.000043205488,0.0007098323,0.0002940246,0.000050570892,0.00016556638,0.000067178466,0.0007759308,0.00053921476,0.0013406754,0.9959241,0.0000415802],"about_ca_topic_score_codex":0.019164572,"about_ca_topic_score_gemma":0.012931175,"teacher_disagreement_score":0.052538753,"about_ca_system_score_codex":0.0025603327,"about_ca_system_score_gemma":0.001074728,"threshold_uncertainty_score":0.074940085},"labels":[],"label_agreement":null},{"id":"W7118021943","doi":"10.1145/3712285.3787164","title":"10.1145/3712285.3787164","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Resilience (materials science); Anomaly (physics); Psychological resilience; Component (thermodynamics)","score_opus":0.0046816301291892045,"score_gpt":0.17190509750435634,"score_spread":0.16722346737516713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118021943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020416656,0.005877132,0.010166984,0.001166974,0.0019353131,0.0005155876,0.011287839,0.01587572,0.9511327],"genre_scores_gemma":[0.0025925152,0.0018737861,0.0014466654,0.00063868717,0.00012814476,0.00019197186,0.0059791505,0.0016143752,0.98553455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991555,0.000055475022,0.0000669316,0.00025400656,0.00028415903,0.00018386288],"domain_scores_gemma":[0.9982291,0.0003688915,0.00009333275,0.0006022083,0.00039140912,0.00031517565],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017942548,0.0041148034,0.003016059,0.0030007989,0.0029692985,0.005025158,0.003401612,0.006292117,0.9479786],"category_scores_gemma":[0.0031687745,0.0020650104,0.0013866976,0.01009111,0.0015121772,0.011235356,0.0063720606,0.00317239,0.96766424],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030489665,0.0001893114,0.00046488436,0.00063518656,0.00004663824,0.00022709828,0.00009520872,0.00069089705,0.0014670359,0.0058347536,0.6346765,0.35536775],"study_design_scores_gemma":[0.000046090707,0.00004210252,0.0006790811,0.0002749551,0.000048126447,0.0001634832,0.00006489865,0.00076921214,0.00053899497,0.0013235766,0.9960096,0.00003992091],"about_ca_topic_score_codex":0.018657371,"about_ca_topic_score_gemma":0.013167494,"teacher_disagreement_score":0.052021384,"about_ca_system_score_codex":0.0025090456,"about_ca_system_score_gemma":0.0010727956,"threshold_uncertainty_score":0.07420212},"labels":[],"label_agreement":null},{"id":"W7118999048","doi":"10.1145/3725843.3786400","title":"10.1145/3725843.3786400","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Session key; Component (thermodynamics)","score_opus":0.004656685918956445,"score_gpt":0.17182601200989361,"score_spread":0.16716932609093718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118999048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018903717,0.005313432,0.010372177,0.0010961891,0.0016963736,0.0005761908,0.0112334145,0.017192459,0.9506294],"genre_scores_gemma":[0.0024562231,0.0017537696,0.0018133296,0.0006998583,0.00013103092,0.00023163328,0.0057989093,0.0017495065,0.98536587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914694,0.000059671336,0.00006959009,0.0002621608,0.00027122712,0.00019043962],"domain_scores_gemma":[0.99821556,0.0004123309,0.00009517319,0.0005764654,0.00035143932,0.00034909902],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020262492,0.004546688,0.003257773,0.0030739168,0.0028594122,0.0051579564,0.0036352251,0.0074250363,0.9566309],"category_scores_gemma":[0.0032825994,0.0022362692,0.0014746569,0.0098531265,0.0016444927,0.012076878,0.0062439246,0.0033936794,0.9697258],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030113218,0.00020065527,0.00041991717,0.00069088093,0.000048672217,0.00019728628,0.000091412665,0.00071620324,0.0014163288,0.0054993173,0.6567702,0.33364803],"study_design_scores_gemma":[0.00006240584,0.000046895104,0.0007040426,0.00027663982,0.000050597635,0.00015505217,0.00006570972,0.00085695344,0.0005277025,0.0013091277,0.9958988,0.00004616414],"about_ca_topic_score_codex":0.019730266,"about_ca_topic_score_gemma":0.013338107,"teacher_disagreement_score":0.043369114,"about_ca_system_score_codex":0.0026461517,"about_ca_system_score_gemma":0.0011424822,"threshold_uncertainty_score":0.0618608},"labels":[],"label_agreement":null},{"id":"W7124508255","doi":"10.52202/083088-0062","title":"Printed Platforms for Fast Access to Space","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"C-Com Satellite Systems (Canada)","funders":"","keywords":"","score_opus":0.027055735760149604,"score_gpt":0.3225014618144224,"score_spread":0.29544572605427283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124508255","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01572396,0.0021370342,0.13289948,0.0037085668,0.014694855,0.0003776041,0.0058432207,0.052057065,0.7725582],"genre_scores_gemma":[0.052345138,0.0008165661,0.037369564,0.0005938379,0.0013121266,0.0002068919,0.0026251432,0.004234498,0.90049624],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914527,0.00009630831,0.000039894,0.00010700346,0.00049527985,0.000116222625],"domain_scores_gemma":[0.9964754,0.0006339641,0.00020123825,0.001322616,0.0009931277,0.00037373364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058295194,0.0015464895,0.00084600726,0.0023440712,0.0011893377,0.0031838424,0.0019515519,0.002015959,0.6447036],"category_scores_gemma":[0.003730095,0.0007420573,0.0006142711,0.0019126912,0.00058130245,0.0034604936,0.0031017205,0.0019269355,0.33080247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006795741,0.0002161016,0.00029770474,0.00043866018,0.000034594927,0.000535834,0.00016885088,0.0029566234,0.05994193,0.0330035,0.5434424,0.35828424],"study_design_scores_gemma":[0.0001730534,0.0003535016,0.00064360054,0.00014243567,0.000033746303,0.0004613807,0.00010244318,0.0062406887,0.040367715,0.015925013,0.93549085,0.00006557701],"about_ca_topic_score_codex":0.00033080683,"about_ca_topic_score_gemma":0.00060147437,"teacher_disagreement_score":0.6447036,"about_ca_system_score_codex":0.00046523588,"about_ca_system_score_gemma":0.00044337186,"threshold_uncertainty_score":0.5067871},"labels":[],"label_agreement":null},{"id":"W7132875481","doi":"","title":"Interposing on calls in the K42 operating system","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Code (set theory); Indirection; Overhead (engineering); Path (computing); Object (grammar); Dead code","score_opus":0.026663924205914683,"score_gpt":0.37034835119091725,"score_spread":0.34368442698500257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132875481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26194268,0.0018186441,0.45448318,0.0006674448,0.00034576587,0.00075228635,0.0016408426,0.14019457,0.13815464],"genre_scores_gemma":[0.754611,0.0010130339,0.1660458,0.00056546234,0.00011727792,0.0004839685,0.002724302,0.010667375,0.06377171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.0002618319,0.00016964493,0.00039860763,0.00088641833,0.0004423104],"domain_scores_gemma":[0.99687093,0.00041470636,0.00023227326,0.0016347711,0.0006715168,0.00017570116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093850534,0.00097353116,0.0004335346,0.0008680497,0.0011952171,0.0023071175,0.0017623042,0.0008526467,0.011186905],"category_scores_gemma":[0.0038041798,0.00093238935,0.0005382559,0.0009819897,0.0008722732,0.0027778773,0.0026142534,0.0016042709,0.006468372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030781892,0.00046366866,0.012254623,0.00074423413,0.0001955799,0.0009256492,0.0023411454,0.0159748,0.15333724,0.067936905,0.08422898,0.6585189],"study_design_scores_gemma":[0.00037618596,0.001181082,0.019167121,0.0003750672,0.000266868,0.00170329,0.0008624843,0.1254143,0.2461904,0.02659694,0.57719356,0.00067275326],"about_ca_topic_score_codex":0.0038755308,"about_ca_topic_score_gemma":0.0035917128,"teacher_disagreement_score":0.011186905,"about_ca_system_score_codex":0.0008646396,"about_ca_system_score_gemma":0.0026025106,"threshold_uncertainty_score":0.03742391},"labels":[],"label_agreement":null},{"id":"W7132927982","doi":"","title":"Design and implementation of K42&apos;s dynamic clustered object switching mechanism","year":2000,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Object (grammar); Mechanism (biology); Stability (learning theory); Control system; Class (philosophy)","score_opus":0.01827331580280113,"score_gpt":0.34996423392130477,"score_spread":0.33169091811850365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132927982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14623399,0.00068108295,0.79144907,0.0005112362,0.00028999045,0.00095898577,0.00034298314,0.01831767,0.041215032],"genre_scores_gemma":[0.7362241,0.00021529215,0.24336666,0.00026824616,0.000036092682,0.0002789033,0.00031744133,0.00040918714,0.018884081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.000051526524,0.000030383464,0.000076477605,0.00016193229,0.00011504191],"domain_scores_gemma":[0.9995278,0.00006592954,0.00004598355,0.00015179906,0.0001613329,0.000047103254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006664758,0.00032263636,0.00034284324,0.0005040663,0.00063627126,0.0016816084,0.002828959,0.00064674206,0.006939982],"category_scores_gemma":[0.00093164045,0.00046748886,0.00027255868,0.00046889758,0.0004494028,0.0006699124,0.0005971316,0.0005340478,0.0015866425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013871355,0.000581188,0.0037278011,0.0006752697,0.0001913076,0.0005248629,0.00085049437,0.057670373,0.2729695,0.1103918,0.02481282,0.52621746],"study_design_scores_gemma":[0.00078457734,0.001210102,0.0042024767,0.00009573457,0.0003106569,0.00063524407,0.00032239658,0.525475,0.31898215,0.0098362705,0.13799751,0.00014777473],"about_ca_topic_score_codex":0.0071060443,"about_ca_topic_score_gemma":0.0071240356,"teacher_disagreement_score":0.0071060443,"about_ca_system_score_codex":0.0011533848,"about_ca_system_score_gemma":0.00166488,"threshold_uncertainty_score":0.023216546},"labels":[],"label_agreement":null},{"id":"W7132986139","doi":"","title":"The Space Complexity of Asynchronous Algorithms from Bounded Size Base Objects","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Bounded function; Domain (mathematical analysis); Base (topology); Swap (finance); Asynchronous communication; Object (grammar); Upper and lower bounds","score_opus":0.040555319561654694,"score_gpt":0.32102014207978813,"score_spread":0.2804648225181334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132986139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23780504,0.0011799188,0.7386128,0.0019020798,0.00013968446,0.0003111497,0.0004830863,0.0019576224,0.017608605],"genre_scores_gemma":[0.8431016,0.0007372625,0.14735705,0.00028940503,0.000163068,0.00066558167,0.0007809459,0.00047742814,0.0064277616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927246,0.0021070312,0.0006171689,0.0011005685,0.0024006732,0.0010499622],"domain_scores_gemma":[0.96357495,0.02802535,0.0017125325,0.0045387745,0.0014363069,0.0007120879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036730345,0.0012748612,0.0012215583,0.001144988,0.0014046042,0.004439808,0.0026515117,0.0014302942,0.0063714],"category_scores_gemma":[0.027626,0.00058727874,0.0013386416,0.0017295707,0.002459901,0.012229582,0.003723861,0.002775754,0.0011283794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013418722,0.00024849648,0.003230179,0.0006836593,0.00016508008,0.00019178372,0.00081317127,0.6642278,0.024100741,0.2069905,0.0034963074,0.09451032],"study_design_scores_gemma":[0.00010340218,0.00016130402,0.00047691315,0.000033847387,0.00005994512,0.000055591332,0.00009507793,0.87285304,0.007143516,0.1171977,0.0017963406,0.000023358785],"about_ca_topic_score_codex":0.0020455157,"about_ca_topic_score_gemma":0.0020058937,"teacher_disagreement_score":0.0063714,"about_ca_system_score_codex":0.0029830544,"about_ca_system_score_gemma":0.0034158586,"threshold_uncertainty_score":0.021643639},"labels":[],"label_agreement":null},{"id":"W7133059789","doi":"","title":"A Study of the Potential of Intel&apos;s Transactional Synchronization Extensions for Hybrid Transactional Memory","year":2014,"lang":"","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Software transactional memory; Synchronization (alternating current); Scalability; Transactional leadership; Software; Transaction processing","score_opus":0.02493048458764057,"score_gpt":0.3252587960097883,"score_spread":0.3003283114221477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133059789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95149845,0.001826219,0.033100914,0.0003449628,0.000056051627,0.000059208134,0.00014031382,0.0013975692,0.01157631],"genre_scores_gemma":[0.95984375,0.0002996822,0.037949648,0.00006541546,0.000017901713,0.000044820892,0.00015583796,0.000114851944,0.0015082144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986098,0.00039854355,0.00006591888,0.00018163698,0.0005559639,0.0001881104],"domain_scores_gemma":[0.9950537,0.0025789856,0.00044126672,0.0013053208,0.0005154448,0.00010537761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422328,0.0005275262,0.00034121677,0.0004405399,0.00037300054,0.0009882946,0.0013759906,0.00033522514,0.0013575422],"category_scores_gemma":[0.0052936054,0.0002812905,0.00029259265,0.0010933768,0.0005654306,0.0021093485,0.00044806287,0.00093139545,0.00016473432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002571914,0.0014209988,0.025313184,0.0010371136,0.00017817004,0.0002776205,0.00051171356,0.23322468,0.15919925,0.0655352,0.008454853,0.50227535],"study_design_scores_gemma":[0.0002929093,0.0036502325,0.013363517,0.000083273044,0.0001604227,0.00037450844,0.00033070164,0.83339,0.12348462,0.010932718,0.013876413,0.00006072559],"about_ca_topic_score_codex":0.0018432443,"about_ca_topic_score_gemma":0.0025906207,"teacher_disagreement_score":0.0018432443,"about_ca_system_score_codex":0.0008301131,"about_ca_system_score_gemma":0.0009698467,"threshold_uncertainty_score":0.007522106},"labels":[],"label_agreement":null},{"id":"W7133113552","doi":"","title":"Replication and Workload Management for In-Memory OLTP Databases","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concurrency control; Online transaction processing; Workload; Replication (statistics); Transaction processing; Distributed database; Backup; Rollback; Backup software; Database transaction","score_opus":0.035734292746176045,"score_gpt":0.35341824833833646,"score_spread":0.3176839555921604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133113552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16775647,0.0012070653,0.81950617,0.0006471932,0.00023759916,0.0004080761,0.00020109356,0.0039154543,0.006120912],"genre_scores_gemma":[0.8453732,0.0006139185,0.14858687,0.00016239236,0.00019703763,0.00023318693,0.0005450243,0.00023138925,0.004057021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762887,0.00046446855,0.00027360962,0.00039881404,0.0009772566,0.0002570469],"domain_scores_gemma":[0.996967,0.00044746918,0.00033947322,0.0010830888,0.00095805206,0.00020494548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015895133,0.00059016456,0.0005578083,0.00054354453,0.0011978637,0.0025195552,0.0025202564,0.0005356873,0.00091910653],"category_scores_gemma":[0.003915493,0.0004628839,0.00035488466,0.00071198144,0.00036380763,0.002257902,0.00145053,0.0008116076,0.0004863145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091505784,0.000840158,0.017263677,0.00041904132,0.00018360883,0.0008695731,0.0018354765,0.14659677,0.2520284,0.031364482,0.015760997,0.5319228],"study_design_scores_gemma":[0.000105296655,0.0002654109,0.003571498,0.0000329519,0.000080650636,0.0005595651,0.00057022646,0.85254043,0.10728492,0.014498852,0.020414466,0.000075748656],"about_ca_topic_score_codex":0.0026238882,"about_ca_topic_score_gemma":0.0019695584,"teacher_disagreement_score":0.0026238882,"about_ca_system_score_codex":0.0010256701,"about_ca_system_score_gemma":0.001518934,"threshold_uncertainty_score":0.008406222},"labels":[],"label_agreement":null},{"id":"W7135507286","doi":"","title":"What is Deadpan?","year":2017,"lang":"en","type":"article","venue":"Bristol Research (University of Bristol)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Johns Hopkins University; McKnight Foundation","keywords":"Presentation (obstetrics); Limiting; Work (physics); Quality (philosophy); Best practice","score_opus":0.08271483874196246,"score_gpt":0.3406478114749743,"score_spread":0.25793297273301186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135507286","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002538667,0.025487069,0.0013493365,0.74562836,0.05281614,0.000062169,0.00038020525,0.00030025942,0.17143784],"genre_scores_gemma":[0.0646933,0.04269322,0.002148392,0.46292734,0.01856941,0.00028394887,0.0011115468,0.00089754694,0.4066753],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944312,0.0022477752,0.00017468493,0.0006826534,0.0011813166,0.001282371],"domain_scores_gemma":[0.99075645,0.0015985268,0.00032764548,0.0004480215,0.0016726557,0.0051967963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052876254,0.00078558957,0.0008323876,0.0012094001,0.01046591,0.014587705,0.0019297282,0.0051985807,0.10618078],"category_scores_gemma":[0.020178838,0.0003300234,0.00063510344,0.0011860139,0.008893655,0.018262235,0.009974045,0.013165543,0.036463436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028928142,0.000048573627,0.0006489826,0.0001786049,0.000008869753,0.00018584321,0.0036414713,0.000018185898,0.000052087395,0.027966658,0.89699924,0.07022245],"study_design_scores_gemma":[0.000004355254,0.000018546043,0.00036495517,0.0005536129,0.0000048443962,0.00019420774,0.008799501,0.000012660107,0.000039717663,0.0103724105,0.9796246,0.000010495887],"about_ca_topic_score_codex":0.0070930826,"about_ca_topic_score_gemma":0.014432095,"teacher_disagreement_score":0.10618078,"about_ca_system_score_codex":0.004525185,"about_ca_system_score_gemma":0.011910391,"threshold_uncertainty_score":0.35521013},"labels":[],"label_agreement":null},{"id":"W7135606448","doi":"","title":"LIPIcs","year":2025,"lang":"en","type":"article","venue":"Institute of Science and Technology Austria","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Asynchronous communication; Communication complexity; Computational complexity theory; Time complexity; Key (lock); Binary logarithm; Value (mathematics)","score_opus":0.009278245920948081,"score_gpt":0.2582649941789484,"score_spread":0.2489867482580003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135606448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019156527,0.0066244146,0.1306943,0.013688678,0.0033847734,0.00022788587,0.004264667,0.0012978752,0.8206608],"genre_scores_gemma":[0.33980286,0.0063851653,0.050660018,0.0043600136,0.0021401173,0.00067396776,0.0062901904,0.0012246015,0.58846307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991351,0.00014878067,0.00006579557,0.00030908937,0.00021860938,0.00012278545],"domain_scores_gemma":[0.9990771,0.00028371837,0.00010536517,0.00021585886,0.00021924391,0.0000986259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055100775,0.00091890205,0.00065114815,0.0010924366,0.002039379,0.0043765735,0.0011317569,0.0011545038,0.19188233],"category_scores_gemma":[0.003358761,0.00029791586,0.00086562056,0.00144927,0.0013230924,0.0045483112,0.0027158766,0.0024339221,0.061136495],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013764433,0.00004840967,0.00063044275,0.00023604208,0.000019415505,0.00020848171,0.00019517397,0.0027511003,0.0012358077,0.86633056,0.05886896,0.06933788],"study_design_scores_gemma":[0.000032900574,0.000053769676,0.0006242989,0.00012550803,0.000015820246,0.00040463477,0.00018786648,0.0070267087,0.001382203,0.55036294,0.43975466,0.000028632097],"about_ca_topic_score_codex":0.001818137,"about_ca_topic_score_gemma":0.0013043607,"teacher_disagreement_score":0.19188233,"about_ca_system_score_codex":0.0020792591,"about_ca_system_score_gemma":0.0010379534,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W763938970","doi":"10.1016/j.cl.2015.04.001","title":"A formal semantics of nested atomic sections with thread escape","year":2015,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Japan Science and Technology Agency; Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Agence Nationale de la Recherche","keywords":"Atomicity; Computer science; Programming language; Thread (computing); Compiler; Modularity (biology); Mutual exclusion; Programming paradigm; Semantics (computer science); Optimizing compiler; Theoretical computer science","score_opus":0.014055229782921886,"score_gpt":0.2434491590086239,"score_spread":0.229393929225702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W763938970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015698247,0.00021928537,0.9726872,0.0004898699,0.00015115886,0.000079085,0.00007439054,0.00095629954,0.009644492],"genre_scores_gemma":[0.5836354,0.00035453544,0.40416744,0.00041160182,0.00021803979,0.0003071746,0.00020579297,0.0007157444,0.009984309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786085,0.0005801796,0.00022676564,0.00036238309,0.0006011755,0.00036863005],"domain_scores_gemma":[0.9967309,0.001550412,0.00026140147,0.00071375293,0.0005486617,0.00019484802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033074094,0.0007919748,0.00072278915,0.0009325356,0.0019231454,0.00426926,0.002435013,0.0019980748,0.0059641013],"category_scores_gemma":[0.006024855,0.0012069644,0.0016028044,0.0010006074,0.005866726,0.008364444,0.00394724,0.003629918,0.0008747248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003069046,0.000017611414,0.00012963156,0.000030329547,0.000006071309,0.000100052726,0.00050390314,0.0025030759,0.0012676046,0.9903527,0.0004009505,0.0046574166],"study_design_scores_gemma":[0.00007054776,0.000043364755,0.00011041974,0.000056174173,0.00004227046,0.00021442078,0.00026738847,0.03667436,0.004004034,0.9373822,0.021100894,0.000033944092],"about_ca_topic_score_codex":0.00287759,"about_ca_topic_score_gemma":0.002245115,"teacher_disagreement_score":0.0059641013,"about_ca_system_score_codex":0.0013976044,"about_ca_system_score_gemma":0.0019461781,"threshold_uncertainty_score":0.01995188},"labels":[],"label_agreement":null},{"id":"W78547775","doi":"10.1007/978-0-387-74390-5_2","title":"Vulnerability Analysis for Mail Protocols","year":2008,"lang":"en","type":"book-chapter","venue":"Advances in information security","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"March of Dimes Canada","funders":"","keywords":"Vulnerability (computing); Computer science; Vulnerability assessment; Computer security; Psychology; Social psychology","score_opus":0.01830844840210653,"score_gpt":0.29792537167307115,"score_spread":0.2796169232709646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78547775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03154643,0.0036091637,0.91013354,0.0013900056,0.00017098054,0.00014708354,0.00034132914,0.002005263,0.050656203],"genre_scores_gemma":[0.7332718,0.005438704,0.21123633,0.00036003304,0.0005654998,0.00033391517,0.0012560672,0.00068019825,0.046857484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987417,0.0002916854,0.00006271291,0.00015666653,0.00060412625,0.00014319332],"domain_scores_gemma":[0.99786526,0.0011550087,0.0001537887,0.00045643502,0.00030670935,0.00006279092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009502197,0.0008113474,0.0008473433,0.002678954,0.00090244366,0.0017646562,0.00097436685,0.0010966015,0.0044474844],"category_scores_gemma":[0.005355185,0.00042637571,0.0010721162,0.0016687394,0.0014054225,0.0036969958,0.0016415055,0.002483037,0.001022525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007459342,0.000072647046,0.0015094053,0.00020253849,0.00006605914,0.00026701903,0.0005091319,0.044266324,0.004708682,0.7440715,0.017836317,0.1864159],"study_design_scores_gemma":[0.0000044744916,0.00002077914,0.00060710375,0.000059386166,0.000026999262,0.00028533646,0.000083170875,0.18283537,0.0027836738,0.80129117,0.011980564,0.000021903988],"about_ca_topic_score_codex":0.00092074997,"about_ca_topic_score_gemma":0.0006062386,"teacher_disagreement_score":0.0044474844,"about_ca_system_score_codex":0.0011544158,"about_ca_system_score_gemma":0.00060076284,"threshold_uncertainty_score":0.014878333},"labels":[],"label_agreement":null},{"id":"W83599667","doi":"","title":"Order and balance in continuously-fault-tolerant distributions of objects","year":2006,"lang":"en","type":"article","venue":"International Conference on Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Cistel Technology (Canada); Carleton University","funders":"","keywords":"Fault tolerance; Distributed computing; Computer science; Replication (statistics); Object (grammar); Set (abstract data type); Order (exchange); Mathematics; Artificial intelligence; Programming language","score_opus":0.011339824670055211,"score_gpt":0.24954888364168784,"score_spread":0.23820905897163264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83599667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14597745,0.00067369157,0.8454666,0.00046247247,0.00008577329,0.00016964902,0.00017607528,0.0009128155,0.0060754577],"genre_scores_gemma":[0.850137,0.00051608327,0.13501193,0.00017540429,0.00019807977,0.00028540601,0.0002988979,0.00024375407,0.013133348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976968,0.0003531378,0.00017583717,0.0005645979,0.00085229304,0.00035741003],"domain_scores_gemma":[0.99586797,0.0012480102,0.0006169571,0.0011776956,0.0008051331,0.00028424716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927015,0.0005462822,0.0008932652,0.0012530211,0.0013679985,0.002532878,0.0015630086,0.0009179596,0.0024470738],"category_scores_gemma":[0.0076214843,0.0005799742,0.0003783339,0.001669917,0.0019089736,0.004965088,0.0021251906,0.0007554805,0.0008834511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017355279,0.00028899242,0.004538665,0.00022840532,0.000069858106,0.00072020025,0.0024031277,0.2859748,0.034855425,0.4239102,0.004534376,0.24074042],"study_design_scores_gemma":[0.00039479724,0.0005336851,0.0019717258,0.0000447949,0.00006452539,0.00061681133,0.0004990948,0.53335065,0.01892632,0.42156312,0.021936461,0.000098015604],"about_ca_topic_score_codex":0.0026046108,"about_ca_topic_score_gemma":0.0014647089,"teacher_disagreement_score":0.0026046108,"about_ca_system_score_codex":0.0015992898,"about_ca_system_score_gemma":0.0011416167,"threshold_uncertainty_score":0.011603773},"labels":[],"label_agreement":null},{"id":"W8691679","doi":"10.1007/978-3-642-33065-0_5","title":"Maintaining Consistency in Software Transactional Memory through Dynamic Versioning Tuning","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Transactional memory; Computer science; Cache coherence; Software transactional memory; Software versioning; Commit; Consistency (knowledge bases); Cache; Consistency model; Thread (computing); Operating system; Distributed computing; Parallel computing; Software; CPU cache; Database transaction; Programming language; Database; Cache algorithms; Data consistency","score_opus":0.016142643435037764,"score_gpt":0.24364800180672097,"score_spread":0.2275053583716832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8691679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16615672,0.0022436082,0.8156861,0.00036449914,0.00024257525,0.00007159468,0.000079039244,0.007085566,0.008070284],"genre_scores_gemma":[0.8638522,0.000401913,0.13133055,0.00010394259,0.00009050234,0.000060148985,0.00012530171,0.0007779701,0.0032574553],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980565,0.00040058707,0.00019064713,0.00030698,0.000839253,0.00020609623],"domain_scores_gemma":[0.99252397,0.0023776232,0.0004107959,0.003802362,0.00074266974,0.00014262713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020201297,0.00042368946,0.00075463107,0.00074040756,0.000665195,0.0023468863,0.0030163687,0.00077166304,0.0018862409],"category_scores_gemma":[0.010596514,0.0007179336,0.0003672617,0.0014123403,0.0009294483,0.0038447124,0.001552892,0.0019360919,0.0005352872],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006863125,0.00033629767,0.0037722164,0.00029396085,0.00010643247,0.0002248232,0.00065070385,0.12211775,0.11681814,0.05904733,0.004941554,0.6910045],"study_design_scores_gemma":[0.00010834007,0.00022694428,0.0011045756,0.000051226467,0.00011411997,0.0003577765,0.00011672692,0.82851875,0.089668274,0.071140535,0.008514617,0.00007801039],"about_ca_topic_score_codex":0.0005258805,"about_ca_topic_score_gemma":0.0006123334,"teacher_disagreement_score":0.0030163687,"about_ca_system_score_codex":0.0005684144,"about_ca_system_score_gemma":0.0006732165,"threshold_uncertainty_score":0.010683596},"labels":[],"label_agreement":null},{"id":"W92219756","doi":"10.1007/978-3-642-38613-8_29","title":"Characterizing Fault-Tolerant Systems by Means of Simulation Relations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Fault tolerance; Bisimulation; Distributed computing; Characterization (materials science); Theoretical computer science; Simple (philosophy); Fault (geology); Software fault tolerance; Algorithm","score_opus":0.01502695898041974,"score_gpt":0.2369565728334026,"score_spread":0.22192961385298285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92219756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023424622,0.00024091484,0.9715109,0.00012669255,0.000023027258,0.000068539826,0.000086919375,0.0007619281,0.00375635],"genre_scores_gemma":[0.73661566,0.0008093314,0.25844327,0.00011487313,0.00010371788,0.0002656277,0.00064089725,0.00033645867,0.0026702513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771595,0.0008596399,0.00018980305,0.00035357694,0.00069007766,0.00019089968],"domain_scores_gemma":[0.9938829,0.0041596787,0.0004752151,0.0010293309,0.00035390307,0.000098937555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018012663,0.0014233727,0.0010356525,0.0015914781,0.00077706977,0.0021928751,0.0017575442,0.0011743444,0.0024815258],"category_scores_gemma":[0.007726986,0.0007554153,0.001312172,0.0014242708,0.0019369427,0.0048667267,0.0018279639,0.0020248138,0.00062665687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021728904,0.00012194137,0.0017521618,0.00025027807,0.00009098803,0.00019532307,0.0006950372,0.41352344,0.016620342,0.5076588,0.0010948291,0.057779588],"study_design_scores_gemma":[0.000018611256,0.00006192834,0.00022106124,0.000029523924,0.000042375646,0.000094696836,0.00006225159,0.59642935,0.0071925162,0.3921124,0.0037137237,0.000021524818],"about_ca_topic_score_codex":0.00090877886,"about_ca_topic_score_gemma":0.00086410914,"teacher_disagreement_score":0.0024815258,"about_ca_system_score_codex":0.0011679583,"about_ca_system_score_gemma":0.00074737135,"threshold_uncertainty_score":0.009526134},"labels":[],"label_agreement":null},{"id":"W97666251","doi":"10.1007/978-3-319-08404-6_11","title":"B-slack Trees: Space Efficient B-Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Amortized analysis; Computer science; Node (physics); Combinatorics; Binary logarithm; B-tree; Degree (music); Weight-balanced tree; Space (punctuation); Discrete mathematics; Time complexity; Mathematics; Algorithm; Data structure; Binary search tree; Operating system; Binary tree; Physics","score_opus":0.011820448216732242,"score_gpt":0.2314975536933154,"score_spread":0.21967710547658315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97666251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014541998,0.0032098503,0.93851715,0.00053545175,0.0003791118,0.00014633844,0.0023270568,0.009286039,0.03105702],"genre_scores_gemma":[0.16121972,0.0032073297,0.7807489,0.00060269795,0.00024246665,0.00034700707,0.0067293136,0.0036806245,0.04322203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.000050249786,0.000034188906,0.000058601123,0.00018598053,0.00007132603],"domain_scores_gemma":[0.9992329,0.00022255415,0.00006456431,0.00019359273,0.00018887188,0.00009751848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035668814,0.00076374883,0.0005783761,0.0011155222,0.00059302134,0.0012872588,0.0014774385,0.00072299415,0.022533905],"category_scores_gemma":[0.0017649427,0.0005962029,0.00045185344,0.0029913012,0.00037571267,0.0023813068,0.0013984146,0.0014200412,0.008918525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046298612,0.00015380718,0.00029777738,0.00068462646,0.000030864194,0.00011557513,0.00013333175,0.021541173,0.02516281,0.13732779,0.11181916,0.7022701],"study_design_scores_gemma":[0.00022357122,0.0003513581,0.00058608985,0.0002549959,0.000054749304,0.00071061694,0.00013891108,0.17769335,0.031015586,0.48643902,0.30245858,0.000073117764],"about_ca_topic_score_codex":0.00073015015,"about_ca_topic_score_gemma":0.0011620229,"teacher_disagreement_score":0.022533905,"about_ca_system_score_codex":0.00047591256,"about_ca_system_score_gemma":0.00071209884,"threshold_uncertainty_score":0.075383365},"labels":[],"label_agreement":null}]}