{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005614629,0.00028880755,0.9944495,0.00046462048,0.0023081347,0.000423216,0.000036717847,0.00026611536,0.0017572567],"genre_scores_gemma":[0.022459446,0.000012655622,0.972953,0.0022282456,0.0005150779,0.000013892227,0.00003328718,0.000050198974,0.0017341962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953067,0.00006211267,0.0006185277,0.0019137012,0.0012761705,0.0008228466],"domain_scores_gemma":[0.99671185,0.00032043082,0.00038457732,0.001932429,0.0003616933,0.00028904583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011267331,0.0006586768,0.0007110771,0.00066772226,0.00031756662,0.00068516616,0.0040051434,0.0004449733,0.000035282643],"category_scores_gemma":[0.00006252393,0.00059647183,0.00021008949,0.0006615343,0.0005003142,0.00042969926,0.00092994276,0.00079591107,0.00027911202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032171295,0.000042429176,0.000017732242,0.00004770071,0.000008218187,0.00010964146,0.00014858691,0.02168701,0.000051214312,0.0036810492,0.00026126843,0.9739419],"study_design_scores_gemma":[0.0005855095,0.00014066414,0.000057811187,0.0005292524,0.000005506228,0.00003632315,6.268151e-8,0.963365,0.0003240439,0.0040739556,0.030177101,0.00070475205],"about_ca_topic_score_codex":0.00004115254,"about_ca_topic_score_gemma":0.000026148758,"teacher_disagreement_score":0.97323716,"about_ca_system_score_codex":0.00033956833,"about_ca_system_score_gemma":0.0006433701,"threshold_uncertainty_score":0.9996487},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045652323,0.0021344281,0.7235976,0.00007506079,0.0013962286,0.00039527818,0.000077749275,0.00039813278,0.27187985],"genre_scores_gemma":[0.07797387,0.00025992806,0.016482072,0.00032736457,0.0013697232,0.00004820982,0.0010986873,0.00012465444,0.9023155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697727,0.000079245874,0.00093449943,0.00085865415,0.0005605515,0.0005897774],"domain_scores_gemma":[0.99820936,0.00013456233,0.0003853136,0.0009538777,0.00016575745,0.00015110189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038709055,0.00044479157,0.0008324998,0.00022841619,0.00013538264,0.0003523932,0.001586261,0.00046097365,0.0000040171903],"category_scores_gemma":[0.000030448577,0.00042548627,0.00015499652,0.00040696946,0.000051311436,0.0002949137,0.00039986186,0.00064881414,0.00022085587],"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.000005364376,0.0001264728,0.0002845935,0.0005751318,0.000100865785,0.0012573785,0.00045847194,0.05871032,0.000007597324,0.7553567,0.17677079,0.006346293],"study_design_scores_gemma":[0.00047238127,0.000025850728,0.00013884585,0.0012494747,0.0000041594353,0.00019133488,0.000016735536,0.59724414,0.0000024645162,0.00035707915,0.399596,0.0007015379],"about_ca_topic_score_codex":0.00013014479,"about_ca_topic_score_gemma":0.000014952926,"teacher_disagreement_score":0.75499964,"about_ca_system_score_codex":0.0005398385,"about_ca_system_score_gemma":0.0005354614,"threshold_uncertainty_score":0.9998197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004015553,0.00022218798,0.99387145,0.00066067063,0.00034386548,0.00020518842,0.00027160606,0.0001407583,0.0002687432],"genre_scores_gemma":[0.64253527,0.000033312015,0.35467616,0.00053286506,0.00027680688,0.000034111312,0.0002994481,0.000011925753,0.001600107],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999066,0.000011615544,0.00016789176,0.00039857728,0.00020233028,0.00015356197],"domain_scores_gemma":[0.99857676,0.000052756415,0.00004456749,0.0011676074,0.000094883246,0.0000634501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010666345,0.000100443096,0.00012009275,0.00003051919,0.0002601445,0.00012388751,0.0013332553,0.000052883977,0.0000239001],"category_scores_gemma":[0.000057245226,0.000084258405,0.000023799495,0.00008898856,0.000036043428,0.0009541224,0.00022945479,0.00005617469,0.0000033481122],"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.00006801952,0.00014045664,0.0031087233,0.00022220795,0.00013169741,0.00003456414,0.0009550278,0.0014509647,0.0010294983,0.06295115,0.7751566,0.15475105],"study_design_scores_gemma":[0.0071815173,0.00034888455,0.11270653,0.0000800438,0.00004380219,0.0011966155,0.00017646691,0.46661898,0.0069918847,0.040684298,0.36215076,0.0018202418],"about_ca_topic_score_codex":0.000051349245,"about_ca_topic_score_gemma":0.000045511693,"teacher_disagreement_score":0.63919526,"about_ca_system_score_codex":0.000011965031,"about_ca_system_score_gemma":0.0000668,"threshold_uncertainty_score":0.3435958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028158051,0.000096348755,0.9851957,0.000735226,0.00018814437,0.00011350828,0.00007182109,0.0002678422,0.010515637],"genre_scores_gemma":[0.97234845,0.0000042501956,0.025237184,0.0003060787,0.000011821255,0.00001035925,0.00007735931,0.000006278616,0.0019981936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988811,0.00009477098,0.00019901006,0.00029158161,0.00023406092,0.0002995011],"domain_scores_gemma":[0.9993122,0.000062440165,0.000034506193,0.0003593291,0.00010435029,0.00012713145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002669507,0.00010141689,0.00012341139,0.000034936274,0.00018627629,0.0001911665,0.00040045095,0.0000406074,0.000053418335],"category_scores_gemma":[0.00003458323,0.00009202205,0.000045129218,0.00054571795,0.00002644509,0.00032461723,0.000051766638,0.000099125245,0.0002485253],"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.0000016760084,0.00018963758,0.0012054908,0.000025317206,0.000039918436,0.00002952919,0.00033035674,0.0021324037,0.0015929841,0.45152268,0.534996,0.00793406],"study_design_scores_gemma":[0.000966021,0.000052709704,0.00061803,0.000042705855,0.0000068169093,0.0000741273,0.00020384073,0.22101901,0.0040605892,0.0014346497,0.7709724,0.0005491266],"about_ca_topic_score_codex":0.000060586168,"about_ca_topic_score_gemma":0.000004484398,"teacher_disagreement_score":0.96953267,"about_ca_system_score_codex":0.00004273006,"about_ca_system_score_gemma":0.00006634344,"threshold_uncertainty_score":0.37525502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007652838,0.00059449,0.9833712,0.0042013945,0.00028059407,0.00057829195,0.00006017992,0.00038056922,0.0028804245],"genre_scores_gemma":[0.8791324,0.000021483818,0.11311755,0.000748996,0.00049821945,0.0002617104,0.00009282865,0.000024250981,0.0061025596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984602,0.000031883937,0.00036645346,0.00057178276,0.00023307912,0.00033661845],"domain_scores_gemma":[0.9980927,0.00007464754,0.00019871094,0.0013005235,0.00022847154,0.00010494384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003815381,0.00015432923,0.00021632962,0.000051244613,0.00014534545,0.00018452028,0.00073942327,0.00010899835,0.000012032815],"category_scores_gemma":[0.00015265735,0.00014889833,0.00009164509,0.0004215301,0.000035893703,0.00045452736,0.000080066464,0.000099143115,0.00012890389],"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.000080830214,0.0002989458,0.00022033074,0.00014941007,0.0000930393,0.000009739101,0.0012818559,0.0003971894,0.006992512,0.17070739,0.21978493,0.5999838],"study_design_scores_gemma":[0.0012027789,0.00006422108,0.0003483521,0.000058133686,0.000006333248,0.000026636884,0.00002682544,0.14079948,0.002478495,0.00027015412,0.8544801,0.00023851037],"about_ca_topic_score_codex":0.000019670713,"about_ca_topic_score_gemma":0.000017260316,"teacher_disagreement_score":0.8714796,"about_ca_system_score_codex":0.00009500756,"about_ca_system_score_gemma":0.00011256968,"threshold_uncertainty_score":0.6071898},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.8607745e-7,0.00082071684,0.23120862,0.000027392429,0.00020655118,0.000653811,0.0003342508,0.00025487153,0.7664933],"genre_scores_gemma":[0.13783832,0.000021599633,0.022823187,0.0013401712,0.0021878537,0.00134202,0.0000334689,0.000093549446,0.83431983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981992,0.000010883092,0.00038863198,0.0006897721,0.00038925375,0.0003222603],"domain_scores_gemma":[0.99828804,0.000019037052,0.00024782406,0.0011023503,0.00016285446,0.00017991295],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007724415,0.00036629487,0.0003918966,0.00003906099,0.00012673858,0.00016512584,0.001223846,0.00032351524,0.000019620724],"category_scores_gemma":[0.0000013463858,0.000367229,0.00020694295,0.000033205808,0.00007149766,0.00009806176,0.0002652926,0.00023882966,0.0012124145],"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.0000020411808,0.0000087709905,4.122522e-7,0.000007961618,0.000033272954,0.000012847145,0.000019932739,0.000027748354,0.0000013684253,0.9165219,0.0047233836,0.07864038],"study_design_scores_gemma":[0.00014349034,0.000052758995,0.000003572242,0.00007303381,0.000014580338,0.000041400494,0.0000034000473,0.0005634762,0.0000056447166,0.1646776,0.83404374,0.00037731006],"about_ca_topic_score_codex":0.000025645004,"about_ca_topic_score_gemma":0.000032051692,"teacher_disagreement_score":0.8293204,"about_ca_system_score_codex":0.00025077394,"about_ca_system_score_gemma":0.00019288395,"threshold_uncertainty_score":0.999878},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48976368,0.0074106753,0.030313691,0.016632603,0.008491336,0.009496482,0.0005328141,0.001216819,0.4361419],"genre_scores_gemma":[0.43928942,0.00016960397,0.00081265456,0.000040325387,0.0008599046,0.0000684686,0.00029747255,0.00010501394,0.5583571],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99544626,0.0005884793,0.00039925863,0.001310383,0.0009548712,0.0013007312],"domain_scores_gemma":[0.9968151,0.00076959643,0.00029202783,0.0013022143,0.0004749077,0.00034615627],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096952,0.00048164386,0.0005297123,0.00069984474,0.00322742,0.0017821656,0.0023875549,0.00049162004,0.000005015859],"category_scores_gemma":[0.000073908275,0.00040581013,0.00030027385,0.0013573659,0.00042982935,0.0003904189,0.00038718802,0.0014124962,0.00002617737],"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.004938093,0.000597624,0.0067833387,0.003954592,0.0016672993,0.0021413658,0.0035301102,0.00186264,0.017695447,0.08824694,0.8377813,0.030801209],"study_design_scores_gemma":[0.0012635618,0.0003609544,0.0027786654,0.00025441754,0.000043470907,0.00005593692,0.0003759902,0.0032369364,0.0022426317,0.0019857804,0.98682666,0.00057501264],"about_ca_topic_score_codex":0.007524288,"about_ca_topic_score_gemma":0.042653,"teacher_disagreement_score":0.1490453,"about_ca_system_score_codex":0.0004342631,"about_ca_system_score_gemma":0.0015909179,"threshold_uncertainty_score":0.99983937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041179042,0.00031252802,0.9972125,0.00010471237,0.0005038709,0.00038425054,0.000015187909,0.00006662002,0.0009885312],"genre_scores_gemma":[0.8950756,0.000015671802,0.104475014,0.00020325597,0.00009447841,0.00001277412,0.000006146555,0.000018003626,0.00009905027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768233,0.000033269098,0.00042495114,0.00093950075,0.0005818946,0.00033806934],"domain_scores_gemma":[0.99832743,0.00011416949,0.00033756846,0.00076066144,0.00034621876,0.00011396633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004196913,0.00032966942,0.00042504063,0.00037686274,0.00018836596,0.00019452075,0.00096669164,0.00022260167,0.0000073859255],"category_scores_gemma":[0.000024793686,0.00027229523,0.0000439537,0.00042210435,0.0005098135,0.00047283096,0.00021379042,0.0003182237,0.0000046145974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013216583,0.000152723,0.0005761653,0.00043315988,0.00006630606,0.00010922642,0.0027826966,0.2769918,0.007222883,0.046417497,0.000024234421,0.6650911],"study_design_scores_gemma":[0.0005366311,0.00046151283,0.00049229024,0.0005791435,0.000010837247,0.0000415812,1.6803749e-7,0.9855364,0.0074263583,0.0024776445,0.001972597,0.00046480983],"about_ca_topic_score_codex":0.00016800685,"about_ca_topic_score_gemma":0.0004194147,"teacher_disagreement_score":0.8946638,"about_ca_system_score_codex":0.00008262262,"about_ca_system_score_gemma":0.00032667024,"threshold_uncertainty_score":0.99997294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029015964,0.00035902287,0.9723096,0.0000862909,0.00016063817,0.0009305496,0.00012790292,0.00014268473,0.02585432],"genre_scores_gemma":[0.8362408,0.000049474478,0.12139167,0.0003373191,0.00055400457,0.00007396423,0.0028328288,0.00013168262,0.038388256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981897,0.000012341354,0.0005661062,0.0006099979,0.00024796627,0.00037387392],"domain_scores_gemma":[0.9990567,0.000100125624,0.00026569606,0.00030666063,0.00018565991,0.0000851315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043089647,0.0002713859,0.00036248716,0.00015875908,0.0001377546,0.00017101383,0.00030027356,0.00026908334,0.000005512373],"category_scores_gemma":[0.000017029195,0.0002633565,0.00006827747,0.00012124801,0.000029919212,0.00010624558,0.00018540001,0.00016571392,0.0000071930876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015012488,0.00006456974,0.000086529966,0.0003760618,0.00003143569,0.000016485697,0.00019259495,0.010920623,0.000022038346,0.8418846,0.0023211683,0.14406887],"study_design_scores_gemma":[0.000566353,0.000062706844,0.00021094481,0.00030087263,0.000007556845,0.0000126241885,0.0000044307044,0.949041,0.000007220848,0.003948211,0.045499973,0.00033811622],"about_ca_topic_score_codex":0.000050164377,"about_ca_topic_score_gemma":0.00009513961,"teacher_disagreement_score":0.93812037,"about_ca_system_score_codex":0.00022122395,"about_ca_system_score_gemma":0.00007368619,"threshold_uncertainty_score":0.9999819},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5740937,0.006473648,0.4067587,0.00741728,0.001816656,0.0007050034,0.000015789366,0.00003858619,0.0026806484],"genre_scores_gemma":[0.99025506,0.00008483451,0.008802165,0.0006211113,0.00018602028,0.0000039539677,4.6267306e-7,0.0000020862622,0.000044308585],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987322,0.00008351162,0.000424793,0.00011358181,0.00044236874,0.00020356431],"domain_scores_gemma":[0.99929184,0.00007922535,0.0002445046,0.00028618277,0.00003728569,0.000060946037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741324,0.00009044371,0.00018539904,0.000057527774,0.00003912078,0.00007124304,0.0009582485,0.000042111613,0.000010201451],"category_scores_gemma":[0.00002516719,0.000055532782,0.00008402626,0.00016523682,0.000016493388,0.00033342064,0.000022334589,0.0002449303,0.000032114494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072990304,0.0021546683,0.0024886136,0.000020284688,0.00003570602,0.0012287503,0.024361452,0.0458258,0.005396536,0.002909759,0.030551886,0.88495356],"study_design_scores_gemma":[0.005207026,0.0013412879,0.17714947,0.00027399612,0.00001529582,0.0008283989,0.00110432,0.3237916,0.0011384601,0.0014951181,0.48711127,0.0005437587],"about_ca_topic_score_codex":0.0000027768187,"about_ca_topic_score_gemma":0.0000012499396,"teacher_disagreement_score":0.8844098,"about_ca_system_score_codex":0.00003973884,"about_ca_system_score_gemma":0.000028197215,"threshold_uncertainty_score":0.22645612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1138444,0.0025107663,0.8813001,0.0012778428,0.00054114586,0.00018594955,0.00006304017,0.00020611034,0.00007065054],"genre_scores_gemma":[0.9970773,0.000095147276,0.0020855402,0.00039361036,0.00018812086,0.000012475174,0.00010014706,0.000014827434,0.00003283993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980263,0.00010864872,0.00040569084,0.00061762764,0.00022173581,0.00062000315],"domain_scores_gemma":[0.998498,0.00026330774,0.0002153856,0.0007190534,0.000075080854,0.00022916027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065877626,0.0003058585,0.00032528967,0.000028636441,0.00080464536,0.00064566144,0.00094398553,0.00017466475,0.0000022253726],"category_scores_gemma":[0.000055006225,0.00022988593,0.00006733748,0.0002954275,0.0001392733,0.00018985574,0.00068993436,0.0006784143,0.0000027536705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006387165,0.00036028493,0.017851623,0.00024578132,0.0003419218,0.00014059845,0.002400604,0.08351307,0.0008692216,0.019213134,0.053968526,0.82103133],"study_design_scores_gemma":[0.00063183124,0.000036287565,0.005317559,0.00008322212,0.000012200487,0.00009591012,0.000096987096,0.98475504,0.0000025529737,0.00020121946,0.0084378,0.00032936665],"about_ca_topic_score_codex":0.0001657333,"about_ca_topic_score_gemma":0.00006573414,"teacher_disagreement_score":0.901242,"about_ca_system_score_codex":0.000017735094,"about_ca_system_score_gemma":0.000026385615,"threshold_uncertainty_score":0.9374476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009420421,0.00030484257,0.9912259,0.0013247438,0.00096700067,0.0004577203,0.000097161115,0.00024057798,0.0052878335],"genre_scores_gemma":[0.8442071,0.00008312063,0.14973274,0.0023367137,0.0012213087,0.000024726787,0.00018077496,0.000068089445,0.002145394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556935,0.000038582828,0.00049587304,0.0017808812,0.0013257316,0.0007895738],"domain_scores_gemma":[0.9972453,0.00025346392,0.0003562849,0.0014174638,0.00047210202,0.00025535683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049816084,0.0006586812,0.0006600494,0.0003241401,0.0003782647,0.0006026366,0.0019415477,0.00033611545,0.0000074058776],"category_scores_gemma":[0.00003876689,0.0005492106,0.00014078985,0.0008957923,0.0006707749,0.0008004411,0.00047897117,0.00084543333,0.00005957796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051171035,0.00015003367,0.00009182472,0.00007592518,0.000049199993,0.0011459057,0.00089922285,0.058229674,0.00008245957,0.14165686,0.00051393226,0.7970538],"study_design_scores_gemma":[0.0018386578,0.0015515884,0.0050779395,0.00482755,0.00003924785,0.0016911282,0.0000015390424,0.8538388,0.0019351961,0.092383176,0.03313229,0.0036828653],"about_ca_topic_score_codex":0.000039255403,"about_ca_topic_score_gemma":0.0000642544,"teacher_disagreement_score":0.84411293,"about_ca_system_score_codex":0.0005355499,"about_ca_system_score_gemma":0.00070808374,"threshold_uncertainty_score":0.99969596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21515073,0.000032083342,0.762154,0.0014417006,0.00018702216,0.00045538275,0.00000583165,0.00021449209,0.020358788],"genre_scores_gemma":[0.9849878,0.000003920359,0.013912957,0.00084792695,0.000017805067,0.00004779543,0.0000066743714,0.0000053000886,0.00016984329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990012,0.0000122032025,0.00031557464,0.00013882683,0.0002373812,0.00029480524],"domain_scores_gemma":[0.99947745,0.000012976368,0.000096359676,0.000304033,0.000041035913,0.00006815013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018060021,0.000121407335,0.00014837239,0.00010466861,0.00007215319,0.00021317118,0.0003663403,0.000048049504,0.000010635489],"category_scores_gemma":[0.0000072702815,0.00009776781,0.000028863751,0.0005153503,0.00003137597,0.0015197487,0.000060310194,0.00015178273,0.00018474116],"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.00012987522,0.0013788226,0.017074913,0.00078038574,0.00019899724,0.00014814272,0.04920606,0.016200168,0.0016379424,0.8436782,0.00483481,0.06473172],"study_design_scores_gemma":[0.04859844,0.005646357,0.14562011,0.0057172617,0.000068480775,0.0020327813,0.009230351,0.13251728,0.060112637,0.026102038,0.557775,0.006579251],"about_ca_topic_score_codex":0.0001767527,"about_ca_topic_score_gemma":0.000095195675,"teacher_disagreement_score":0.8175761,"about_ca_system_score_codex":0.00018023865,"about_ca_system_score_gemma":0.00008023649,"threshold_uncertainty_score":0.39868554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007929656,0.0002085649,0.99545896,0.00079637754,0.001657116,0.0008634132,0.00006411332,0.00025281325,0.00069070666],"genre_scores_gemma":[0.4445526,0.000034124463,0.55295557,0.00081950566,0.00029592274,0.000097349286,0.00001812975,0.000058490055,0.0011683097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964626,0.000014757062,0.00061507797,0.0014900807,0.00073516375,0.000682317],"domain_scores_gemma":[0.9979881,0.00016978597,0.00024153081,0.0010850646,0.00032150542,0.00019398998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052552525,0.0005332921,0.0005746599,0.0005394548,0.00038628213,0.0004892418,0.0021023916,0.00042626268,0.000011572769],"category_scores_gemma":[0.000014464007,0.0005157954,0.00028321886,0.0005509693,0.00031297037,0.0008597703,0.00005752512,0.0006007819,0.000014653177],"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.000007660592,0.000032760912,3.4746213e-7,0.000059951013,0.0000098896535,0.000009928378,0.0006590638,0.67126435,0.00009136848,0.018517548,0.0000059536756,0.3093412],"study_design_scores_gemma":[0.0005055998,0.00010101231,0.0000042799425,0.0003266759,0.000012171067,0.0000454294,1.2700306e-7,0.8760307,0.00035243464,0.12141483,0.0006962502,0.0005104845],"about_ca_topic_score_codex":0.00002995539,"about_ca_topic_score_gemma":0.00014182787,"teacher_disagreement_score":0.44454467,"about_ca_system_score_codex":0.0004965728,"about_ca_system_score_gemma":0.0010025961,"threshold_uncertainty_score":0.99972934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38265863,0.09725807,0.1675156,0.01966389,0.07086539,0.016731882,0.007283331,0.012517604,0.22550558],"genre_scores_gemma":[0.9188707,0.0061133364,0.008324129,0.005076844,0.0075142276,0.0008375271,0.0007249991,0.0011100256,0.051428236],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9595859,0.0025980335,0.00876692,0.0097271325,0.008022372,0.011299616],"domain_scores_gemma":[0.9720572,0.0017064146,0.0051024803,0.012077099,0.0032570774,0.005799727],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005297619,0.006683529,0.007470213,0.0025210946,0.0061107404,0.0036300851,0.013971147,0.0040145232,0.0035216098],"category_scores_gemma":[0.0019244973,0.0070896824,0.004221487,0.009084762,0.0038117333,0.007330811,0.0048786197,0.006226914,0.024082523],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020257966,0.010779543,0.025306672,0.0036119502,0.0045918594,0.020184083,0.022448128,0.0032765486,0.009395088,0.078602396,0.7121512,0.107626714],"study_design_scores_gemma":[0.0144302845,0.0030601376,0.049306944,0.0041451207,0.0010126247,0.010272055,0.0018021475,0.02241152,0.006131787,0.0043814536,0.86919093,0.013854964],"about_ca_topic_score_codex":0.0033258179,"about_ca_topic_score_gemma":0.0007506865,"teacher_disagreement_score":0.536212,"about_ca_system_score_codex":0.0029011567,"about_ca_system_score_gemma":0.0061708,"threshold_uncertainty_score":0.99946326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032390782,0.0001138457,0.98436254,0.0021984463,0.0017575831,0.00041520243,0.00009033239,0.00009177745,0.010646333],"genre_scores_gemma":[0.88002527,0.0000048116444,0.11839316,0.0012714005,0.00018839806,0.000008498414,0.000008301077,0.000015646043,0.00008450257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669975,0.000055410906,0.00060648605,0.0010295048,0.0011283967,0.00048047784],"domain_scores_gemma":[0.9966527,0.0006714963,0.0004557586,0.0017433111,0.00034854905,0.00012818782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009012823,0.00043381337,0.00055257673,0.00015990243,0.00036336322,0.00035962168,0.0043591694,0.000287108,0.000029955754],"category_scores_gemma":[0.000111554655,0.00030846434,0.0001735407,0.00075621594,0.0019997128,0.00024821746,0.0008632818,0.00092382095,0.000045424553],"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.000003352039,0.00004187455,0.00002995365,0.0000228811,0.000011126842,0.000019736492,0.00017942332,0.009911756,0.000056787296,0.9303245,0.000062754676,0.059335846],"study_design_scores_gemma":[0.0002080959,0.0001231707,0.0007231022,0.00036313632,0.0000056136078,0.00004255818,1.8098673e-7,0.25331086,0.00038889455,0.7431931,0.001225112,0.00041618384],"about_ca_topic_score_codex":0.00005396632,"about_ca_topic_score_gemma":0.00020850878,"teacher_disagreement_score":0.8797014,"about_ca_system_score_codex":0.00017854966,"about_ca_system_score_gemma":0.00046453587,"threshold_uncertainty_score":0.99993676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035904765,0.00037013335,0.8890097,0.0015796787,0.006297456,0.00042456444,0.000047403762,0.0005632106,0.06580309],"genre_scores_gemma":[0.99424154,0.0000031276813,0.0044402312,0.00066782505,0.00008843864,0.000023478582,0.000027701024,0.0000050490676,0.0005026229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988416,0.00002112197,0.00039457838,0.00012436592,0.00035527037,0.00026307817],"domain_scores_gemma":[0.99912035,0.000018142246,0.00015678685,0.0003950196,0.00010159242,0.00020809236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028603149,0.00012407481,0.00017638571,0.000051049654,0.00008879836,0.0003853036,0.00056625827,0.000036092282,0.000015611995],"category_scores_gemma":[0.000035444795,0.00010832552,0.000041422692,0.00019088275,0.000040184797,0.0016924815,0.00018473718,0.00009058757,0.00047939204],"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.000019213252,0.00034519954,0.0048385393,0.00028345082,0.00009299298,0.00003244542,0.053564675,0.000054397366,0.00015481327,0.5554182,0.14046052,0.24473552],"study_design_scores_gemma":[0.00071768474,0.00009146143,0.0008659576,0.000048663995,0.0000033617603,0.000035144105,0.00060331274,0.016437376,0.00015325527,0.00029203217,0.9805158,0.00023598607],"about_ca_topic_score_codex":0.000014118729,"about_ca_topic_score_gemma":0.0000011131726,"teacher_disagreement_score":0.9583368,"about_ca_system_score_codex":0.0001934739,"about_ca_system_score_gemma":0.00009646817,"threshold_uncertainty_score":0.6161775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050904667,0.000021411102,0.98355496,0.0009660964,0.00015534878,0.00041079265,0.000057961744,0.00013043592,0.00961252],"genre_scores_gemma":[0.9633881,0.0000040129808,0.026744777,0.00024913746,0.000031852698,0.000107638094,0.0000023061152,0.000008517013,0.009463656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903196,0.000031513362,0.00014274291,0.00037524017,0.00017029674,0.00024823737],"domain_scores_gemma":[0.99940914,0.000082033024,0.00005474603,0.00027689655,0.000103591265,0.00007359843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001340672,0.00013992087,0.0002062926,0.000034333574,0.00029470952,0.00047909142,0.00071983493,0.00005678817,0.00007496395],"category_scores_gemma":[0.000012634332,0.00012163295,0.00005654628,0.00021813146,0.000025821982,0.0018349933,0.000077233315,0.00009399431,0.000018362021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013029976,0.001713681,0.000039333336,0.00011162785,0.000279115,0.000012618223,0.010363476,0.036559306,0.0657071,0.6793988,0.06914832,0.13653637],"study_design_scores_gemma":[0.0006340442,0.000039830444,0.000038045066,0.000009656299,0.0000029309113,0.000009297191,0.000052629224,0.990181,0.006499263,0.0004879001,0.001863984,0.00018138495],"about_ca_topic_score_codex":0.000025832216,"about_ca_topic_score_gemma":0.00003479113,"teacher_disagreement_score":0.9582976,"about_ca_system_score_codex":0.000057888206,"about_ca_system_score_gemma":0.00005618611,"threshold_uncertainty_score":0.49600476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013036586,0.0006427214,0.98693144,0.0006385263,0.0009509866,0.00093748706,0.00004926768,0.00019660087,0.009522616],"genre_scores_gemma":[0.41202456,0.00009001733,0.57866174,0.0031826424,0.0013598856,0.00012728255,0.000071621245,0.00013162842,0.0043505966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955284,0.00002123689,0.000630996,0.001882061,0.0010963498,0.0008409785],"domain_scores_gemma":[0.99731344,0.0003074471,0.000356831,0.0013407416,0.00046335056,0.00021819156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006168752,0.0006428575,0.0007231434,0.00046899496,0.00053897814,0.0008595161,0.0030563439,0.00035385595,0.000019248166],"category_scores_gemma":[0.000042238422,0.0005084307,0.00014740443,0.00065178366,0.0007828569,0.00072373165,0.0004800125,0.0005383414,0.00003852116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005946104,0.00007405332,0.000040737174,0.0001700186,0.000022536547,0.000116217365,0.0008982625,0.0066386526,0.00004085732,0.053475507,0.00016703084,0.9382967],"study_design_scores_gemma":[0.0024808918,0.0020606567,0.00019438892,0.0032872492,0.000042192634,0.0010267257,9.550793e-7,0.64855886,0.00061048364,0.21250238,0.1262455,0.0029897213],"about_ca_topic_score_codex":0.000021207617,"about_ca_topic_score_gemma":0.00017127823,"teacher_disagreement_score":0.93530697,"about_ca_system_score_codex":0.00024406049,"about_ca_system_score_gemma":0.0017330943,"threshold_uncertainty_score":0.9997367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24481773,0.000035132878,0.7540033,0.000074313175,0.000060769005,0.000093007584,0.00000930182,0.000038609407,0.0008678577],"genre_scores_gemma":[0.97032845,0.000021507994,0.029453946,0.000050685452,0.00001839964,0.000021850774,0.000017764403,0.000004252523,0.00008311915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891216,0.000020581727,0.0003134492,0.00028195736,0.00023703989,0.00023482266],"domain_scores_gemma":[0.99927527,0.000022433513,0.00011515798,0.00041108305,0.00011585838,0.000060215276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016255822,0.00011387365,0.0002952051,0.00022743922,0.00005086233,0.000051469106,0.00043445482,0.000025244504,0.0000063047355],"category_scores_gemma":[0.0000021479493,0.000089940804,0.0000639904,0.002411455,0.000038138096,0.00038846032,0.00004715633,0.000092886454,0.000003914507],"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.0000061983883,0.00014691862,0.0074393866,0.000009344828,0.00017373692,0.000029318206,0.00026850856,0.9226147,0.000016916665,0.008471864,0.000045774294,0.06077731],"study_design_scores_gemma":[0.00043366506,0.0000613193,0.033874366,0.000044989756,0.0000327841,0.000008884451,0.00004109416,0.9651039,0.00014914676,0.000016707752,0.0001067316,0.00012641272],"about_ca_topic_score_codex":0.0005717349,"about_ca_topic_score_gemma":0.00049308833,"teacher_disagreement_score":0.7255108,"about_ca_system_score_codex":0.000046982062,"about_ca_system_score_gemma":0.000073869596,"threshold_uncertainty_score":0.36676797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029000998,0.0022012165,0.991086,0.00008034143,0.003742131,0.00091545645,0.000051476967,0.00021835513,0.0014149882],"genre_scores_gemma":[0.9849681,0.00013515024,0.013485663,0.00020304619,0.0004989865,0.00011610645,0.000026125344,0.000046435933,0.0005203802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501616,0.00007297156,0.000969925,0.0018449902,0.0011648999,0.00093106634],"domain_scores_gemma":[0.9972555,0.00022515864,0.0004262756,0.0016076639,0.00025681005,0.000228586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008803569,0.00065499207,0.00080829527,0.00081679795,0.00022256357,0.00086331076,0.002909429,0.0005026626,0.000011347677],"category_scores_gemma":[0.00005045546,0.00062156323,0.00015782271,0.0012903725,0.00031049937,0.0006442427,0.0007495661,0.00094572006,0.00010002982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006640619,0.00009465659,0.00010094129,0.00013522452,0.000015573734,0.00037295878,0.00046951202,0.2660851,0.000121810284,0.006344494,0.000072439594,0.7261807],"study_design_scores_gemma":[0.00047314077,0.00021617213,0.000238486,0.00085766404,0.0000058667515,0.00018056203,7.0831805e-7,0.97387195,0.00035998938,0.0056732376,0.017196123,0.0009261048],"about_ca_topic_score_codex":0.00012947473,"about_ca_topic_score_gemma":0.00016867409,"teacher_disagreement_score":0.9846781,"about_ca_system_score_codex":0.000978166,"about_ca_system_score_gemma":0.00020411825,"threshold_uncertainty_score":0.9996236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008251798,0.00017535337,0.9894373,0.0017651208,0.0005822507,0.0011264216,0.0005535517,0.0002148183,0.0060627116],"genre_scores_gemma":[0.6425376,0.00015953019,0.34548527,0.0070733572,0.0010946841,0.00029563348,0.0020658397,0.0001849794,0.0011031034],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99353766,0.000073202486,0.0015019039,0.0022258407,0.0017498182,0.0009115578],"domain_scores_gemma":[0.9946443,0.00029690203,0.00076183525,0.0032322756,0.00067785307,0.00038682247],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015990175,0.00070610695,0.0010265423,0.00059881277,0.0002525721,0.00039651874,0.0056625227,0.00034914148,0.00002638365],"category_scores_gemma":[0.00003237674,0.00069720286,0.00019864136,0.002730845,0.00032817925,0.0003804225,0.0019627616,0.00057151425,0.00012461942],"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.000055767454,0.000220222,0.00021113017,0.00041666356,0.000066120316,0.00013583188,0.00071716803,0.082134105,0.00026390658,0.19244966,0.0017319017,0.7215975],"study_design_scores_gemma":[0.0019389482,0.00053100643,0.0057361145,0.0015866933,0.000037356218,0.0001306313,0.0000067997366,0.12370499,0.0011841028,0.06890283,0.7927246,0.003515885],"about_ca_topic_score_codex":0.000089117326,"about_ca_topic_score_gemma":0.00013595297,"teacher_disagreement_score":0.79099274,"about_ca_system_score_codex":0.0005054216,"about_ca_system_score_gemma":0.00021826812,"threshold_uncertainty_score":0.9997173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000949043,0.0005960326,0.99255514,0.00060066435,0.00320162,0.00094801036,0.0000532014,0.00025302888,0.0016974198],"genre_scores_gemma":[0.7989338,0.00003581163,0.1959603,0.001289868,0.002278383,0.00010847251,0.00002587734,0.000078402845,0.0012890999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956312,0.000027719656,0.00069952133,0.0018104648,0.0010172892,0.000813806],"domain_scores_gemma":[0.9972937,0.00027745473,0.00042772037,0.0013655846,0.0004108141,0.00022468771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010403156,0.0005691068,0.0006325813,0.00052565517,0.00036877423,0.00059639383,0.0028986263,0.00045012328,0.000009840945],"category_scores_gemma":[0.00006963682,0.0005185823,0.00023080742,0.0005444914,0.00047296463,0.0003459804,0.0006003,0.00063435314,0.000053408436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011934487,0.00004190516,0.000011968103,0.000078709636,0.000015667218,0.000018098503,0.0003750594,0.11907967,0.00022575262,0.009580278,0.00006036581,0.87050056],"study_design_scores_gemma":[0.00054331945,0.0002232046,0.00008311628,0.00036214225,0.000010537768,0.00007318532,1.6445506e-7,0.96259314,0.0019796216,0.009427231,0.024026891,0.00067747425],"about_ca_topic_score_codex":0.000011400871,"about_ca_topic_score_gemma":0.000058763406,"teacher_disagreement_score":0.8698231,"about_ca_system_score_codex":0.00037211488,"about_ca_system_score_gemma":0.00040071947,"threshold_uncertainty_score":0.9997266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010408442,0.0011861287,0.5158477,0.0035586203,0.0060977666,0.0034139478,0.28293133,0.0055355844,0.17102052],"genre_scores_gemma":[0.9939969,0.0000010195027,0.0012959542,0.0004107156,0.00031516395,0.00009406526,0.0035177881,0.000010594912,0.0003577756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989892,0.00002613019,0.00016173418,0.0003510741,0.0002203902,0.00025142395],"domain_scores_gemma":[0.9992404,0.000049809885,0.000075209515,0.0003938509,0.00014371626,0.00009702564],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00004584997,0.00013529714,0.00012094602,0.000041753872,0.00014680173,0.00016053351,0.00058981986,0.0000913127,0.0083833225],"category_scores_gemma":[0.00016145948,0.00012090562,0.00004840416,0.00024493053,0.000008340789,0.00027768782,0.000032880926,0.00013839241,0.0051015476],"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.000049289865,0.0002681578,0.000017134038,0.0003647802,0.000049922783,0.00007835396,0.0019052454,0.0024949864,0.00032405672,0.0029181112,0.8384029,0.15312701],"study_design_scores_gemma":[0.0011763279,0.00063353096,0.0037492644,0.00272118,0.0000063849334,0.000050942952,0.00003735912,0.27278554,0.0065299054,0.00042808297,0.71097744,0.0009040199],"about_ca_topic_score_codex":0.000006286112,"about_ca_topic_score_gemma":0.0000051071547,"teacher_disagreement_score":0.98358846,"about_ca_system_score_codex":0.000029110786,"about_ca_system_score_gemma":0.00003528637,"threshold_uncertainty_score":0.9956731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001203589,0.00051725295,0.9661939,0.0020611521,0.0007593,0.00023333021,0.00015735548,0.00068393315,0.028190188],"genre_scores_gemma":[0.9598241,0.000024616596,0.025768794,0.000993668,0.00023857273,0.00006528933,0.0000834594,0.000019908806,0.012981616],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981094,0.000048772956,0.00038883096,0.00054647925,0.0004226224,0.00048392374],"domain_scores_gemma":[0.99867076,0.00004555784,0.00009241793,0.00084507256,0.00013784628,0.00020836537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017972845,0.00021824511,0.00027600507,0.000057227044,0.0001679472,0.00035748704,0.0011320222,0.00009696016,0.00071962446],"category_scores_gemma":[0.00002935713,0.00018138389,0.00011777507,0.0005848807,0.000036298665,0.00067954866,0.00018565678,0.00015047328,0.00078634114],"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.0000062225968,0.0005873756,0.00020619614,0.0000462963,0.0000955019,0.0003378058,0.0014054872,0.0013636987,0.00074121926,0.02436895,0.65846914,0.31237215],"study_design_scores_gemma":[0.0006805826,0.00004904761,0.0006259535,0.000029005272,0.000004014252,0.00006801359,0.000048537626,0.8232907,0.0005120812,0.00021474212,0.17409521,0.00038207666],"about_ca_topic_score_codex":0.000077500445,"about_ca_topic_score_gemma":0.000007691924,"teacher_disagreement_score":0.9586205,"about_ca_system_score_codex":0.00005246657,"about_ca_system_score_gemma":0.000014541628,"threshold_uncertainty_score":0.99999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024221225,0.0010480414,0.9932577,0.00046959706,0.0000037618597,0.00036387626,0.0000139533595,0.00026760547,0.002153343],"genre_scores_gemma":[0.9410978,0.00019182813,0.05780415,0.00007560683,0.00001553603,0.00069866225,0.000028378185,0.000007921276,0.0000801446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991149,0.00002518964,0.00019081435,0.0003654321,0.00009054884,0.00021315731],"domain_scores_gemma":[0.99955535,0.00001609767,0.00008518361,0.00018972153,0.00007773502,0.00007588439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016411259,0.00013918756,0.00015349878,0.000060942002,0.00021776506,0.00020084676,0.0001470128,0.00008008637,9.4942527e-7],"category_scores_gemma":[0.0000051167017,0.00011576745,0.000011840064,0.0005645222,0.00007087612,0.0003111789,0.000031560507,0.00013883894,8.6556895e-7],"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.000030080504,0.00043081303,0.013298321,0.00037526697,0.000018767934,0.000019026467,0.00047745282,0.00010343645,0.0011704349,0.7037564,0.0007405314,0.27957946],"study_design_scores_gemma":[0.0022425042,0.00036462178,0.009304209,0.000661566,0.000035046225,0.0009931707,0.00041396075,0.022220057,0.009437228,0.07212755,0.8805265,0.0016736288],"about_ca_topic_score_codex":0.000043858596,"about_ca_topic_score_gemma":0.00001647549,"teacher_disagreement_score":0.93867564,"about_ca_system_score_codex":0.00002264101,"about_ca_system_score_gemma":0.00004689355,"threshold_uncertainty_score":0.47208595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005376953,0.0001207225,0.97577304,0.001919218,0.00010484439,0.00010292127,0.00000936444,0.00022411325,0.016368814],"genre_scores_gemma":[0.80206,0.00001264067,0.19490075,0.00038062411,0.000028512746,0.000008275493,0.000018418159,0.0000033922447,0.0025874006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991137,0.000019237232,0.00014893008,0.00039575296,0.00015244361,0.0001699634],"domain_scores_gemma":[0.99889034,0.00002246544,0.00005458427,0.00093111367,0.000058893726,0.000042583928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017498154,0.00007241788,0.0000787587,0.000020244752,0.0001297752,0.00009046477,0.00047928843,0.000028663231,0.000036504713],"category_scores_gemma":[0.000022161614,0.000063328094,0.000027216403,0.00024225321,0.000015122001,0.0013218236,0.0001409333,0.000058997044,0.00043278455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012154534,0.00034610523,0.0006626018,0.000040891126,0.000031710562,0.000014573554,0.0013571576,0.0032394603,0.021587048,0.48087293,0.054572515,0.43726283],"study_design_scores_gemma":[0.00031486078,0.000011134055,0.000728741,0.000026899408,0.0000016056895,0.000010909986,0.0000433457,0.7406092,0.003081288,0.00015035621,0.25488308,0.00013856062],"about_ca_topic_score_codex":0.00013433545,"about_ca_topic_score_gemma":0.000026255939,"teacher_disagreement_score":0.796683,"about_ca_system_score_codex":0.000057279736,"about_ca_system_score_gemma":0.000020301324,"threshold_uncertainty_score":0.55627143},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07230673,0.0013378117,0.89406276,0.00051104446,0.001594431,0.0006468543,0.00012100616,0.00037923723,0.029040128],"genre_scores_gemma":[0.898417,0.00009654688,0.009357927,0.00070959626,0.00036497077,0.00012684653,0.00078524894,0.000061654166,0.09008022],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956551,0.00027200728,0.00090487767,0.0010248149,0.00065477175,0.0014883917],"domain_scores_gemma":[0.99766654,0.00012182758,0.0005418801,0.0009494603,0.00027784373,0.0004424291],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00092840765,0.00067494967,0.0006621677,0.00019962958,0.00038982366,0.001234458,0.0017458526,0.0006587615,0.0001421208],"category_scores_gemma":[0.00007031737,0.0006712182,0.00034650433,0.00065101526,0.000057513786,0.00043215256,0.00011661813,0.00058821816,0.00021684254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041093703,0.0028551666,0.038339514,0.0047952193,0.0010468288,0.0020514242,0.044871915,0.01810498,0.059465706,0.13601273,0.40325865,0.28878695],"study_design_scores_gemma":[0.002332321,0.00039076677,0.045678556,0.002971558,0.0002869506,0.00039526453,0.004763976,0.83407307,0.022037914,0.0041296156,0.07933644,0.003603588],"about_ca_topic_score_codex":0.005061561,"about_ca_topic_score_gemma":0.00039002654,"teacher_disagreement_score":0.8847048,"about_ca_system_score_codex":0.000788562,"about_ca_system_score_gemma":0.001049253,"threshold_uncertainty_score":0.99980235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022727675,0.00025645664,0.9922525,0.00087433704,0.0032963776,0.00047615412,0.000122054815,0.00025947197,0.0022353365],"genre_scores_gemma":[0.8470765,0.0002017999,0.14316562,0.006542532,0.0019443694,0.00004945301,0.00017150988,0.00012876227,0.0007194969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483234,0.000032344382,0.0007580625,0.0021549545,0.0012628239,0.0009594868],"domain_scores_gemma":[0.9963678,0.00017028475,0.0004784613,0.002433287,0.0002542842,0.00029589157],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00077075104,0.0007194725,0.00072837144,0.00069210504,0.00031602193,0.0020729643,0.0074601225,0.00033353316,0.000052357293],"category_scores_gemma":[0.00004938858,0.0006697392,0.00016799594,0.00066624355,0.00034550863,0.0024709457,0.0030082285,0.0009899165,0.000095344345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014699217,0.00015072276,0.000949481,0.000490977,0.000049562103,0.0014476234,0.001327185,0.016376078,0.0009872054,0.12850131,0.00010807345,0.8495971],"study_design_scores_gemma":[0.0047725495,0.0008959399,0.009204465,0.022257702,0.000082551276,0.0013306807,0.0000013562909,0.6146082,0.01786267,0.24161685,0.07563532,0.011731706],"about_ca_topic_score_codex":0.00014375137,"about_ca_topic_score_gemma":0.00012211643,"teacher_disagreement_score":0.84908694,"about_ca_system_score_codex":0.00048765147,"about_ca_system_score_gemma":0.0007986909,"threshold_uncertainty_score":0.9995754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013578249,0.0008497741,0.9935851,0.00011724647,0.0013340765,0.0006531458,0.000038002116,0.00035202276,0.0017127695],"genre_scores_gemma":[0.8646905,0.000009578214,0.13465416,0.00022619213,0.00028292503,0.000014347525,0.0000356249,0.00004481293,0.000041851967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99305314,0.00005555041,0.001243315,0.003301761,0.0012938766,0.0010523706],"domain_scores_gemma":[0.9951978,0.00015259717,0.0005849974,0.0034951256,0.0003163316,0.00025316555],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023712455,0.0007033395,0.0008613694,0.0010768746,0.00045364854,0.0011481763,0.007356286,0.00045295953,0.000004648985],"category_scores_gemma":[0.000042993855,0.0007107263,0.000089722824,0.0014313791,0.00042007523,0.0028263994,0.0007614817,0.0010786719,0.000010230104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007870442,0.0001557907,0.0010840798,0.0018871544,0.00001578055,0.0011758857,0.0018778157,0.12181492,0.000982111,0.0107851,0.0000025532995,0.8601401],"study_design_scores_gemma":[0.0007060332,0.00006561825,0.00069742056,0.004486379,0.0000070568635,0.0001117784,0.0000031978714,0.99115217,0.0005069653,0.0011959167,0.00021869226,0.00084880047],"about_ca_topic_score_codex":0.000072554314,"about_ca_topic_score_gemma":0.0012031243,"teacher_disagreement_score":0.8693372,"about_ca_system_score_codex":0.0010191889,"about_ca_system_score_gemma":0.00081707817,"threshold_uncertainty_score":0.9998887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115782874,0.0008195918,0.9926459,0.0025132108,0.00031532612,0.00089593173,0.000019750281,0.00012101147,0.0025534902],"genre_scores_gemma":[0.70961165,0.00008670807,0.2887072,0.0009812986,0.00024297634,0.00008214197,0.000043404143,0.00004325038,0.00020136086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996634,0.000044563378,0.0006042138,0.0013408681,0.00070564257,0.0006707045],"domain_scores_gemma":[0.9971633,0.0004484578,0.00018479068,0.001850439,0.00021929352,0.00013373689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008495136,0.00049065426,0.0006032341,0.0005638892,0.00023608812,0.000596756,0.0037208705,0.0003300568,0.000005535952],"category_scores_gemma":[0.00002911061,0.00042462847,0.00010080425,0.00071801216,0.00055283494,0.00067980174,0.00038169316,0.00073334976,0.000011151098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037829624,0.00005582304,0.00013222585,0.00008520081,0.000015537145,0.00004480708,0.0016120867,0.10113947,0.000019554016,0.026932985,0.00007431222,0.86985016],"study_design_scores_gemma":[0.001171344,0.0005208683,0.0008652359,0.0027056874,0.00001444548,0.00014178996,0.0000021497356,0.8909277,0.00022147063,0.055562504,0.046198085,0.0016687587],"about_ca_topic_score_codex":0.00012029889,"about_ca_topic_score_gemma":0.0010956553,"teacher_disagreement_score":0.8681814,"about_ca_system_score_codex":0.00025533306,"about_ca_system_score_gemma":0.00042770454,"threshold_uncertainty_score":0.99982053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6199221,0.004504301,0.009166013,0.023269923,0.0027671338,0.01595345,0.0008705639,0.015475138,0.30807137],"genre_scores_gemma":[0.94666827,0.00017423893,0.046460453,0.0013730609,0.00012999267,0.00043861673,0.00005368636,0.000086059874,0.0046156496],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99485725,0.000117125644,0.0009932843,0.0016564612,0.0011581022,0.0012177812],"domain_scores_gemma":[0.9969437,0.00033581024,0.00038296453,0.001689516,0.00006327439,0.0005847386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005245043,0.0008056753,0.00090588705,0.00012403328,0.0005510028,0.0003009039,0.0023677342,0.0005497999,0.00036368857],"category_scores_gemma":[0.00019188544,0.00064519054,0.00029998925,0.0007708104,0.00038447182,0.0009935277,0.00036175695,0.00067172374,0.00024721297],"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.00062989845,0.0006496285,0.00062463677,0.000076826764,0.000175568,0.00020414802,0.00015255166,0.00012437628,0.73395765,0.024218062,0.016949829,0.2222368],"study_design_scores_gemma":[0.0011815318,0.0008340089,0.7207612,0.00038118943,0.00002628744,0.00012308291,0.000019763533,4.5115783e-7,0.00011236409,0.00091431825,0.27490053,0.0007453358],"about_ca_topic_score_codex":0.00005571635,"about_ca_topic_score_gemma":0.014044849,"teacher_disagreement_score":0.7338453,"about_ca_system_score_codex":0.0003302805,"about_ca_system_score_gemma":0.00022029695,"threshold_uncertainty_score":0.99959993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022001038,0.0016305208,0.99497336,0.00004722963,0.00047040678,0.0004825466,0.000035343655,0.000029881052,0.0021106896],"genre_scores_gemma":[0.97565174,0.00019175513,0.023641825,0.00017426143,0.00007664343,0.00002713334,0.000009342745,0.0000149211055,0.00021240105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973889,0.00003011713,0.0006568313,0.0009817422,0.00055740506,0.00038501437],"domain_scores_gemma":[0.9986004,0.00026502402,0.00028470045,0.00068811094,0.000052903084,0.00010881733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047477472,0.00036549268,0.0006001159,0.00040381416,0.00007777405,0.00017285025,0.0012142786,0.00021710833,0.000029310586],"category_scores_gemma":[0.00003551385,0.00033425345,0.00005979007,0.00031186533,0.00054322643,0.00035185122,0.00021113372,0.00043592803,0.000010042508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012680184,0.000063580526,0.00010105686,0.00006325284,0.000007544486,0.000043345444,0.0005891446,0.06421942,0.0004464223,0.009134901,0.000008550915,0.9253101],"study_design_scores_gemma":[0.0010409073,0.00030976316,0.00066447887,0.0011948091,0.00001113174,0.000043665004,4.803153e-7,0.957644,0.0006337253,0.03593188,0.0019065685,0.0006186245],"about_ca_topic_score_codex":0.000029837202,"about_ca_topic_score_gemma":0.000019719122,"teacher_disagreement_score":0.9754317,"about_ca_system_score_codex":0.00015795912,"about_ca_system_score_gemma":0.0001941036,"threshold_uncertainty_score":0.99991095},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018978858,0.0043662786,0.29405886,0.00050535105,0.00102544,0.0005687084,0.000026395825,0.00033834265,0.6972127],"genre_scores_gemma":[0.86934584,0.0034661624,0.07178149,0.00054127775,0.0009462525,0.00010967891,0.00018291322,0.000111036,0.05351536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563646,0.00022539096,0.00096417905,0.001088934,0.0014392815,0.00064578006],"domain_scores_gemma":[0.9979396,0.00009239517,0.00043888658,0.0012867673,0.0000886137,0.00015376127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019231674,0.00044735637,0.00074450806,0.00030497482,0.00012570411,0.0004233951,0.0013469955,0.00045490745,0.000059613074],"category_scores_gemma":[0.00015636839,0.00040907876,0.00017083548,0.00048116123,0.00004724667,0.000551137,0.00030583504,0.00060954597,0.00010271626],"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.000023468428,0.0007411389,0.006011439,0.00048018835,0.0000930399,0.002242777,0.00068097666,0.0010869054,0.0007085008,0.008392624,0.090117,0.88942194],"study_design_scores_gemma":[0.0006672094,0.00009182783,0.02580873,0.0016503293,0.000020982056,0.000753152,0.000050835773,0.012002338,0.00008912312,0.0011556749,0.95631,0.0013998538],"about_ca_topic_score_codex":0.0019525776,"about_ca_topic_score_gemma":0.000092862334,"teacher_disagreement_score":0.88802207,"about_ca_system_score_codex":0.00073555583,"about_ca_system_score_gemma":0.0007178706,"threshold_uncertainty_score":0.9998361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011094539,0.0004382168,0.991426,0.0004138191,0.0013221953,0.0005929814,0.00028125913,0.00019106892,0.0053233635],"genre_scores_gemma":[0.016482009,0.0000029739037,0.9802605,0.00069143286,0.00096967584,0.00002790049,0.0004374774,0.000042342006,0.0010857104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994943,0.000040480718,0.0007530865,0.0022022729,0.0011938489,0.00086727506],"domain_scores_gemma":[0.99531794,0.0011229428,0.0007300097,0.002293526,0.00040478248,0.00013080194],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002237826,0.0005368993,0.0006683607,0.0004415319,0.00043068684,0.0011724556,0.006066059,0.00041565893,0.0000036593333],"category_scores_gemma":[0.00034625706,0.0005173389,0.00013694799,0.0005121498,0.00018969816,0.0008326679,0.0013211727,0.0004971961,0.000008990158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008512201,0.0001052641,0.000528756,0.00029233546,0.000048591366,0.00003386884,0.0002743313,0.2995608,0.00005143889,0.006482648,0.005410568,0.68720293],"study_design_scores_gemma":[0.00037849502,0.0000490013,0.00006735521,0.00030368022,0.000013116253,0.0000109177,1.6599425e-7,0.9811556,0.00005423499,0.003406205,0.013971042,0.00059020024],"about_ca_topic_score_codex":0.000048443566,"about_ca_topic_score_gemma":0.000035720117,"teacher_disagreement_score":0.6866127,"about_ca_system_score_codex":0.00045084587,"about_ca_system_score_gemma":0.0006579065,"threshold_uncertainty_score":0.9998644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007004931,0.0010346627,0.99273396,0.00048714495,0.0034017903,0.00065303233,0.000012014293,0.00029762922,0.00130974],"genre_scores_gemma":[0.14296183,0.000029816258,0.8545345,0.0014801627,0.00038743197,0.00003465848,0.000010981983,0.000047413636,0.0005132234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939796,0.00003416874,0.0010200649,0.0022649802,0.0015848354,0.0011163598],"domain_scores_gemma":[0.9966802,0.00022072402,0.00044485717,0.001949093,0.00034026522,0.0003648786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090394117,0.0008627551,0.0008600277,0.0006377437,0.00046229805,0.0009066958,0.0047625136,0.0006117565,0.000029389466],"category_scores_gemma":[0.00008364271,0.0007728684,0.00020093369,0.00079770834,0.00049367204,0.00054557086,0.0014898295,0.0012898098,0.00027381923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073499127,0.00016317838,0.00005728954,0.00014226988,0.000042308286,0.0005343133,0.004122476,0.11091789,0.000054662945,0.08050696,0.000040072922,0.80341125],"study_design_scores_gemma":[0.0019000544,0.00031615788,0.0009445141,0.0077468427,0.000021244194,0.00031902432,0.0000011702372,0.74002993,0.0023736323,0.1819336,0.060096193,0.0043176413],"about_ca_topic_score_codex":0.000032794644,"about_ca_topic_score_gemma":0.00006741674,"teacher_disagreement_score":0.7990936,"about_ca_system_score_codex":0.0010186215,"about_ca_system_score_gemma":0.0017312677,"threshold_uncertainty_score":0.9994722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011480967,0.000042365486,0.9807609,0.0006544714,0.00080332486,0.014108741,0.000010069319,0.00007198951,0.0034333623],"genre_scores_gemma":[0.63078177,0.000025014799,0.33804014,0.010857203,0.00065058586,0.018789565,0.00005560887,0.000178206,0.00062187173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966394,0.00018955831,0.0006980073,0.0010017321,0.0010471214,0.0004242184],"domain_scores_gemma":[0.9952971,0.000666721,0.00058840465,0.003006535,0.000326702,0.00011453328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017548267,0.000438468,0.00052186154,0.00030756427,0.00037489933,0.00039185587,0.005159529,0.0002581792,0.000023423867],"category_scores_gemma":[0.00009690326,0.00029802628,0.00011117339,0.00065074285,0.00073795416,0.00046981568,0.0007013505,0.00079443416,0.000014902262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028792821,0.00019791053,0.000012022393,0.00009220033,0.000012692669,0.000024762345,0.0010964255,0.022864727,0.00012599753,0.4127515,0.00021088957,0.5625821],"study_design_scores_gemma":[0.00065779494,0.0006233021,0.00010370825,0.0017276449,0.0000058676696,0.00008044872,9.4237316e-7,0.7584765,0.0014312076,0.22309734,0.012984125,0.0008111409],"about_ca_topic_score_codex":0.000041522133,"about_ca_topic_score_gemma":0.00007025144,"teacher_disagreement_score":0.73561174,"about_ca_system_score_codex":0.00016205953,"about_ca_system_score_gemma":0.00023542985,"threshold_uncertainty_score":0.9999472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054776818,0.0006921288,0.98488134,0.00002106117,0.005818679,0.0022936328,0.000015890126,0.00024639769,0.0005532144],"genre_scores_gemma":[0.9074246,0.0000070842225,0.0921751,0.000036790392,0.0002301727,0.000052261137,0.0000017477083,0.000032235082,0.00003999925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492496,0.00016425143,0.0015370874,0.0015267137,0.0012763827,0.000570619],"domain_scores_gemma":[0.99492884,0.00075115287,0.0011890199,0.0022412355,0.0007043645,0.00018537669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023330394,0.0006238071,0.0014383148,0.0008017624,0.00031729817,0.00066756515,0.002455582,0.000353679,0.000003602513],"category_scores_gemma":[0.00015258623,0.00053226453,0.00017724358,0.0008581422,0.00049151696,0.0005955867,0.0007471542,0.0009804801,0.000013636703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008884137,0.003933609,0.0063542407,0.13564214,0.0018608768,0.05446048,0.1324547,0.18585885,0.0030292596,0.192202,0.00005396297,0.28406107],"study_design_scores_gemma":[0.001022151,0.0008419472,0.000021814063,0.014263048,0.00012920062,0.026208848,0.00008805565,0.95132077,0.00040633147,0.0039624195,0.00012684145,0.0016085658],"about_ca_topic_score_codex":0.00038388924,"about_ca_topic_score_gemma":0.00032585268,"teacher_disagreement_score":0.9019469,"about_ca_system_score_codex":0.00029861793,"about_ca_system_score_gemma":0.00061176077,"threshold_uncertainty_score":0.9997129},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012815405,0.00023479722,0.9864736,0.00068600825,0.00083308213,0.00038712734,0.000012150861,0.00023834717,0.011122042],"genre_scores_gemma":[0.19563414,0.000047325542,0.7984479,0.0033703742,0.00057282724,0.000024116587,0.000027916538,0.000053196953,0.0018222174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953233,0.000023139235,0.00061678514,0.0022616135,0.0011295588,0.00064561394],"domain_scores_gemma":[0.9960746,0.0002162729,0.00037917928,0.0028698896,0.00027053128,0.0001895038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093229325,0.0005464023,0.00054386194,0.00051280233,0.00028098942,0.00065684237,0.0033241345,0.00034835358,0.000005317764],"category_scores_gemma":[0.00011345199,0.00050614274,0.00013917318,0.00054117467,0.00025783596,0.0004667684,0.00046078456,0.0007742723,0.000053958283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021723358,0.00001900529,5.7361945e-7,0.000010723743,0.0000029916098,0.000029083525,0.000115287614,0.3820489,0.000028366618,0.056648675,0.000040745574,0.56105345],"study_design_scores_gemma":[0.00014418806,0.0001156465,0.000013573341,0.0004086113,0.00000348287,0.00003649939,2.2713165e-8,0.81021464,0.00021016886,0.18760717,0.0007898912,0.0004560908],"about_ca_topic_score_codex":0.00000928053,"about_ca_topic_score_gemma":0.0000061657975,"teacher_disagreement_score":0.56059736,"about_ca_system_score_codex":0.00042596384,"about_ca_system_score_gemma":0.00039050003,"threshold_uncertainty_score":0.999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002190312,0.0010855632,0.99458283,0.0010016258,0.0015051871,0.00097282097,0.000032499567,0.000120030614,0.00067752786],"genre_scores_gemma":[0.4202786,0.00006109002,0.5758893,0.0015981551,0.0012403558,0.00025316188,0.000056373385,0.000075846045,0.0005471159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964496,0.000014015778,0.0005424337,0.0016137185,0.0007937359,0.00058653136],"domain_scores_gemma":[0.9978838,0.0003824644,0.0002686526,0.0009812085,0.0003149491,0.00016890359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080278405,0.00044656405,0.0005025024,0.00047003286,0.00027173926,0.00039475472,0.0029488245,0.0005481641,0.000018290139],"category_scores_gemma":[0.000039061906,0.00043175058,0.00014288006,0.0005137909,0.00046188495,0.00050291815,0.00016323125,0.0010834954,0.000026010386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001552153,0.00006424936,0.000013763339,0.00011034558,0.000007436165,0.000017011045,0.00096935587,0.062706076,0.0013179145,0.018711973,0.0000975973,0.9159688],"study_design_scores_gemma":[0.0007596838,0.00010258612,0.00018047531,0.0003836272,0.0000044154367,0.000044697743,5.2080185e-7,0.6778751,0.0014647619,0.2727343,0.045414016,0.0010358128],"about_ca_topic_score_codex":0.000019983818,"about_ca_topic_score_gemma":0.00027293642,"teacher_disagreement_score":0.91493297,"about_ca_system_score_codex":0.00015742838,"about_ca_system_score_gemma":0.0005979568,"threshold_uncertainty_score":0.99981344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040245923,0.00046339683,0.9716127,0.0013465278,0.002121783,0.00046022033,0.00001237002,0.0004636895,0.023479104],"genre_scores_gemma":[0.12973654,0.0001884901,0.8585356,0.005663048,0.0024504762,0.00002612889,0.000031877975,0.00015200401,0.0032158182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947318,0.000060937677,0.0007733157,0.002040755,0.0013355421,0.0010576623],"domain_scores_gemma":[0.9967333,0.00038465875,0.00032413803,0.0019221485,0.00029673884,0.00033900767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010314329,0.000713086,0.0007552901,0.0006742713,0.00036350562,0.00102224,0.0045281765,0.0005137186,0.00003860864],"category_scores_gemma":[0.00006689592,0.00064795767,0.000185418,0.001015402,0.0004653822,0.0007840621,0.0017556754,0.0013075722,0.00020892956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126171035,0.00014075868,0.00014164847,0.00016841394,0.00004976077,0.0007684061,0.0020222932,0.012557372,0.00008028745,0.09901144,0.0006193537,0.88442767],"study_design_scores_gemma":[0.0007185946,0.00022340778,0.00010774533,0.0007478183,0.000014785735,0.00068650075,2.0910821e-7,0.76833993,0.0002645204,0.10021276,0.12707599,0.0016077494],"about_ca_topic_score_codex":0.000016677777,"about_ca_topic_score_gemma":0.000029072819,"teacher_disagreement_score":0.8828199,"about_ca_system_score_codex":0.000441282,"about_ca_system_score_gemma":0.00070009765,"threshold_uncertainty_score":0.9995972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031963896,0.00013981908,0.98704976,0.00065948075,0.0012652809,0.00013793731,0.000026615162,0.00036782754,0.007156863],"genre_scores_gemma":[0.8589633,0.0000026744735,0.13829057,0.0010865558,0.00018214973,0.000032794185,0.000015055143,0.000012624706,0.0014142622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821794,0.000060717884,0.00030934266,0.0004650441,0.0005688875,0.0003780914],"domain_scores_gemma":[0.99870723,0.000018264212,0.00008873001,0.000687612,0.00023307693,0.0002650635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041330143,0.00017765671,0.00022393226,0.00006603014,0.0000792262,0.0004195475,0.001014635,0.000071402355,0.000027940669],"category_scores_gemma":[0.000022973867,0.0001534107,0.000083664316,0.00037508892,0.000019503204,0.0006911306,0.00015596916,0.000121250996,0.00022729549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000984168,0.0003097097,0.0034596724,0.000097516626,0.00004242776,0.00029700517,0.001588283,0.0034720032,0.00027673508,0.019443035,0.042208925,0.92879486],"study_design_scores_gemma":[0.0010388629,0.00005768266,0.0028792692,0.00007939053,0.0000034654513,0.000026365276,0.0001294817,0.9440818,0.0024384928,0.00061451667,0.048250247,0.00040042162],"about_ca_topic_score_codex":0.0004085913,"about_ca_topic_score_gemma":0.000022980623,"teacher_disagreement_score":0.9406098,"about_ca_system_score_codex":0.000068888745,"about_ca_system_score_gemma":0.00014878553,"threshold_uncertainty_score":0.6255907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10831862,0.000047449972,0.88808256,0.00032457508,0.0004952171,0.000118648495,0.000005578108,0.00011895791,0.0024883754],"genre_scores_gemma":[0.9765786,0.00000382901,0.023275845,0.00007895333,0.00005137782,0.0000016934388,0.0000010176182,0.0000041362114,0.000004536947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978043,0.0001174005,0.00045496502,0.0005649414,0.0005654837,0.00049293134],"domain_scores_gemma":[0.9987551,0.00017430866,0.000118902564,0.0006262002,0.00017281805,0.00015267462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011441233,0.00014927951,0.00027619395,0.00019511668,0.00015958761,0.00016467947,0.00089271954,0.00005166391,0.000020879996],"category_scores_gemma":[0.00008603558,0.00013111661,0.000058346697,0.0023346825,0.0010924311,0.000485053,0.00047750017,0.00017037908,0.000031923602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027042518,0.00013164023,0.00039830717,0.000013344236,0.0000022000959,0.0000350446,0.00049385277,0.0014353475,0.0006615291,0.95580643,0.000084583175,0.040935006],"study_design_scores_gemma":[0.00026996376,0.000083824154,0.007249863,0.000073518924,0.0000012025993,0.00006922077,0.000006029456,0.9841682,0.0012468377,0.0065009585,0.00016667729,0.00016370231],"about_ca_topic_score_codex":0.000012906839,"about_ca_topic_score_gemma":0.0000010777492,"teacher_disagreement_score":0.98273283,"about_ca_system_score_codex":0.000070482834,"about_ca_system_score_gemma":0.000024177425,"threshold_uncertainty_score":0.534678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033469446,0.00020805345,0.99586904,0.00046429635,0.0015375958,0.0010117835,0.000078093224,0.00018311596,0.0003133408],"genre_scores_gemma":[0.51882046,0.00000511112,0.47932035,0.0005419382,0.0006261933,0.00012238434,0.00023833218,0.000042416897,0.00028282296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958059,0.000024581472,0.00059953076,0.0017318344,0.001109297,0.0007288156],"domain_scores_gemma":[0.99702764,0.00030798189,0.0004498908,0.0012314244,0.000725014,0.00025803165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005785721,0.00060436217,0.00086072367,0.0007963659,0.00036207002,0.0009341606,0.0026820684,0.0003684037,0.000012355068],"category_scores_gemma":[0.000019550891,0.0004780364,0.00029901316,0.001492677,0.00077703426,0.00042094305,0.00041203792,0.0007661082,0.000011267248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040873954,0.00027240397,0.0010653612,0.00017978734,0.00044975968,0.00012331559,0.0006829785,0.030513255,0.000835892,0.051530182,0.000038045975,0.91426814],"study_design_scores_gemma":[0.0016396607,0.0011603968,0.0012912797,0.0009020429,0.0002434988,0.00019851615,3.375012e-7,0.948125,0.002574446,0.018594563,0.02301939,0.0022508681],"about_ca_topic_score_codex":0.000028061442,"about_ca_topic_score_gemma":0.00040654227,"teacher_disagreement_score":0.9176117,"about_ca_system_score_codex":0.00018162561,"about_ca_system_score_gemma":0.00057075947,"threshold_uncertainty_score":0.9997671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013386749,0.00079032866,0.9784265,0.00007438358,0.0010275403,0.0001797939,0.000037593458,0.00012561842,0.005951483],"genre_scores_gemma":[0.99781364,0.000013485766,0.00011311707,0.000035385827,0.000013801005,0.000011012371,0.0000015243766,0.000003914723,0.0019941002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999084,0.000051191113,0.00027174427,0.00021109321,0.00022948312,0.00015247114],"domain_scores_gemma":[0.99936575,0.000066095345,0.00012075294,0.00031982103,0.000070605776,0.000056976798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013694447,0.00009522744,0.00015953467,0.000056018933,0.000044876764,0.00006495035,0.0002740671,0.000028048047,0.000029499406],"category_scores_gemma":[0.000018529065,0.00007419428,0.000044681005,0.00022443761,0.000016889247,0.0001575155,0.00003628239,0.00007162026,0.0001346559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003632118,0.0011854102,0.00040541554,0.0006213486,0.00017930144,0.00012378566,0.002647725,0.082097374,0.004989962,0.33233866,0.022776771,0.55259794],"study_design_scores_gemma":[0.00034648122,0.00014815836,0.0001270401,0.00006394275,0.0000016401531,0.000010918484,0.000009287868,0.9872384,0.0012830611,0.00010321055,0.010554708,0.0001131209],"about_ca_topic_score_codex":0.00013928385,"about_ca_topic_score_gemma":0.000016898623,"teacher_disagreement_score":0.9844269,"about_ca_system_score_codex":0.000022326438,"about_ca_system_score_gemma":0.0000043001824,"threshold_uncertainty_score":0.30255547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019882757,0.0006386423,0.9930701,0.00028908218,0.0027445338,0.0012699856,0.00047686935,0.00041064576,0.0010802422],"genre_scores_gemma":[0.43329954,0.0000047044437,0.56500936,0.0004695689,0.0007969785,0.00009688785,0.00005311474,0.000072594165,0.00019724466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943171,0.00003922839,0.0010926229,0.002174396,0.0011368754,0.0012397417],"domain_scores_gemma":[0.9934772,0.0029569797,0.00073023053,0.0016165631,0.0008903128,0.00032871487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012527762,0.0008453726,0.0009975922,0.000623176,0.00054131664,0.0015104,0.003829399,0.00049965165,0.0000076178967],"category_scores_gemma":[0.0009336086,0.0008076377,0.00022455993,0.0011054977,0.00093568116,0.0005301385,0.00053913274,0.00073335104,0.000025064232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008102042,0.00015853168,0.00038343592,0.0006714033,0.000036429537,0.00027136187,0.00016256122,0.37407988,0.00060577196,0.052306637,0.0002835067,0.57103235],"study_design_scores_gemma":[0.0006538347,0.00023838038,0.00005760901,0.002110139,0.000013201414,0.00012154473,1.6982676e-7,0.981391,0.00025358435,0.008968229,0.005231592,0.0009607023],"about_ca_topic_score_codex":0.000031288524,"about_ca_topic_score_gemma":0.000007880392,"teacher_disagreement_score":0.6073111,"about_ca_system_score_codex":0.0005713087,"about_ca_system_score_gemma":0.0006839139,"threshold_uncertainty_score":0.99952614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013407446,0.0020193583,0.9936622,0.0003872667,0.0022043174,0.00040036943,0.0000157706,0.00016314477,0.0010135452],"genre_scores_gemma":[0.89790165,0.000010052571,0.10036822,0.0011280761,0.00038662984,0.000015724458,0.000010416863,0.00003277856,0.00014643301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958256,0.000044957687,0.00080523494,0.0013664485,0.0009833425,0.00097442337],"domain_scores_gemma":[0.99720055,0.0005756913,0.0004545985,0.0013360407,0.0002078595,0.00022528223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013437544,0.0005633307,0.00066386216,0.00067123,0.00018796868,0.000501511,0.0029413584,0.00040562954,0.0000293578],"category_scores_gemma":[0.00014112871,0.000536128,0.00015766331,0.0006519972,0.0003291287,0.000872437,0.0005762902,0.0010708788,0.00010725101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045892443,0.000050454702,0.00066128833,0.00006318412,0.0000049742603,0.00011820611,0.000398185,0.044759367,0.000035883084,0.0053675794,0.000025683363,0.9485106],"study_design_scores_gemma":[0.0014866688,0.00020948223,0.0026689952,0.0034725736,0.000011722407,0.00014321004,0.0000013323147,0.9421828,0.0013440993,0.02722012,0.018835083,0.0024239167],"about_ca_topic_score_codex":0.00010448906,"about_ca_topic_score_gemma":0.00027508562,"teacher_disagreement_score":0.9460867,"about_ca_system_score_codex":0.00044871052,"about_ca_system_score_gemma":0.00065016025,"threshold_uncertainty_score":0.999709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024586416,0.0111285355,0.98626727,0.00000558398,0.0004439122,0.00041710175,0.000030815514,0.0004037283,0.0013005993],"genre_scores_gemma":[0.0027271253,0.0014034952,0.99165386,0.000029249524,0.0002788781,0.00015186667,0.000011966164,0.000090021975,0.0036535421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998223,0.0000090489,0.0004751033,0.00061633514,0.0002830851,0.00039343748],"domain_scores_gemma":[0.99880713,0.00018999344,0.00018676305,0.0006690711,0.000055230987,0.000091787646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013779913,0.00039599746,0.00042439607,0.00021223306,0.000068527224,0.000099575394,0.00087713194,0.0002077134,0.000013812541],"category_scores_gemma":[0.000027832433,0.00045268374,0.00010068634,0.00013538776,0.000017639733,0.0006815729,0.00016171894,0.0004048133,0.00002348201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1882356e-7,0.000012404944,0.00008894782,0.0002186574,0.000020212809,0.00006185901,0.000050531013,0.7863822,0.000011800595,0.15865298,0.000027070406,0.05447244],"study_design_scores_gemma":[0.00034358335,0.000028832788,0.00003428668,0.0019370457,0.000017181133,0.00007792499,0.000001855241,0.3819374,0.000027693057,0.0066634,0.6076457,0.0012850765],"about_ca_topic_score_codex":0.0000040907107,"about_ca_topic_score_gemma":0.0000013437963,"teacher_disagreement_score":0.60761863,"about_ca_system_score_codex":0.00020246772,"about_ca_system_score_gemma":0.000025099207,"threshold_uncertainty_score":0.9997925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054309997,0.00035478416,0.97924984,0.00023260662,0.00066009443,0.00023891979,0.000012056106,0.0004724017,0.013348326],"genre_scores_gemma":[0.96172416,0.0000051616807,0.037438836,0.000104143975,0.00012507588,0.000026391413,0.000003966411,0.000006754021,0.00056550966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988876,0.000037409,0.0002618556,0.00036025862,0.00017101243,0.0002818611],"domain_scores_gemma":[0.9990847,0.000040952506,0.00007087554,0.0005824146,0.00011159956,0.00010945856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003583018,0.000117567055,0.00017819519,0.000048379556,0.000118736156,0.00027594046,0.00073904684,0.00007329101,0.000011218124],"category_scores_gemma":[0.00001468346,0.00009534337,0.000071965675,0.00027914334,0.000015095016,0.0005315554,0.000043261214,0.00009888158,0.00008549503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041728695,0.00016960192,0.0022344382,0.0002531621,0.000027425962,0.000018411234,0.0005837203,0.00003521286,0.0015720528,0.6148626,0.0041150753,0.3761241],"study_design_scores_gemma":[0.0006457835,0.0001596091,0.0016798844,0.00012273353,0.000006298291,0.00007454466,0.00033668178,0.84491926,0.0049996087,0.00033716668,0.14625761,0.00046080534],"about_ca_topic_score_codex":0.000044198907,"about_ca_topic_score_gemma":0.000009879007,"teacher_disagreement_score":0.95629317,"about_ca_system_score_codex":0.00005983677,"about_ca_system_score_gemma":0.000009017995,"threshold_uncertainty_score":0.38879898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044236396,0.000023611923,0.9543264,0.00035106187,0.000095253905,0.0004127828,0.000013111471,0.00026577146,0.00027563394],"genre_scores_gemma":[0.907291,0.0000011142578,0.092449404,0.00011205852,0.000070964175,0.000008369601,0.00004871604,0.000009939798,0.00000842319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977419,0.00015669617,0.00049633085,0.0007256743,0.00045660636,0.00042278922],"domain_scores_gemma":[0.9986009,0.00011978431,0.00027933114,0.00039021234,0.000491972,0.000117815245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027059342,0.00031325826,0.00038805744,0.00019451561,0.00018184447,0.00040910416,0.00045859185,0.00011731152,0.000007760003],"category_scores_gemma":[0.000008353877,0.00029316006,0.00006225208,0.0010045484,0.00004777418,0.0011696414,0.000026752996,0.00026608282,0.00001390133],"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.00007575123,0.00011660427,0.0012502794,0.000018012326,0.00000980333,0.00002690991,0.0006636425,0.921878,0.00019011971,0.0032418375,0.0000026785199,0.07252641],"study_design_scores_gemma":[0.0011576929,0.00020613476,0.032296624,0.0004382034,0.000007221194,0.0000029963971,0.00001962481,0.9646982,0.00023303917,0.0004909105,0.00007868106,0.0003706742],"about_ca_topic_score_codex":0.000054994784,"about_ca_topic_score_gemma":0.00002393416,"teacher_disagreement_score":0.86305463,"about_ca_system_score_codex":0.00016067146,"about_ca_system_score_gemma":0.00026614583,"threshold_uncertainty_score":0.9999521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002221988,0.00019039387,0.9904886,0.00031581573,0.00073075714,0.0056340545,0.000012120086,0.00017468257,0.0022314063],"genre_scores_gemma":[0.7152417,0.000077512595,0.27921236,0.0015537513,0.001112772,0.0018544181,0.000053422296,0.000116030205,0.0007780686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955607,0.000058762074,0.00082383765,0.0016928035,0.0011428536,0.0007210567],"domain_scores_gemma":[0.99749553,0.00019706115,0.00043016172,0.0014905671,0.00022788903,0.00015877422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007298982,0.0005526068,0.0007010467,0.0008694751,0.00019990277,0.00044539035,0.0032669774,0.00040142526,0.000009798073],"category_scores_gemma":[0.00010371326,0.00051258825,0.0001265081,0.0010742137,0.00033774256,0.00094488036,0.00093031017,0.0008489105,0.00004815448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027023592,0.00015135606,0.003909586,0.00021940429,0.000016568787,0.0006649795,0.004495596,0.042640056,0.00011066997,0.026146857,0.0001932106,0.9214247],"study_design_scores_gemma":[0.0015835584,0.0005029409,0.016647246,0.005108647,0.0000051131815,0.0003551282,3.6981257e-7,0.8504121,0.0005601173,0.09633419,0.025987573,0.0025030726],"about_ca_topic_score_codex":0.00015198838,"about_ca_topic_score_gemma":0.00014014186,"teacher_disagreement_score":0.9189216,"about_ca_system_score_codex":0.00056225766,"about_ca_system_score_gemma":0.0004963012,"threshold_uncertainty_score":0.99973255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085150685,0.000193999,0.9774358,0.00040860582,0.0015630114,0.0007850578,0.000010884184,0.00029528575,0.019222181],"genre_scores_gemma":[0.3661418,0.000009611928,0.62762403,0.0023518426,0.0009263156,0.000081619204,0.000022594208,0.000078948615,0.002763257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952912,0.000026530828,0.00074278185,0.0019265687,0.0011724944,0.0008404316],"domain_scores_gemma":[0.99759686,0.00018351195,0.00029861915,0.0014211921,0.00024523193,0.00025455572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008536956,0.00061731593,0.00074723136,0.00086887187,0.00037918062,0.0008626661,0.0026332054,0.00038560334,0.000013974216],"category_scores_gemma":[0.000042786865,0.00059835496,0.00014917625,0.001538664,0.0002677759,0.0003738536,0.00075272226,0.00068056467,0.0001088945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005249666,0.00014373715,0.000058950616,0.0002001234,0.000039139744,0.00027370834,0.0015736055,0.27271953,0.0027809665,0.06538443,0.003251922,0.65352136],"study_design_scores_gemma":[0.001121864,0.00025895564,0.00021614674,0.001015748,0.0000119679025,0.00013039271,4.0405752e-7,0.92555845,0.0032230143,0.03757742,0.028949603,0.0019360087],"about_ca_topic_score_codex":0.000087527864,"about_ca_topic_score_gemma":0.00013308374,"teacher_disagreement_score":0.65283895,"about_ca_system_score_codex":0.0005507358,"about_ca_system_score_gemma":0.00046373912,"threshold_uncertainty_score":0.9996468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026347598,0.00020989255,0.9951654,0.0005499478,0.00020090517,0.00030155663,0.00038622777,0.00028936868,0.0028703515],"genre_scores_gemma":[0.15763862,0.0000091711645,0.8380075,0.00074293534,0.00013125993,0.000090984984,0.00051987317,0.000016209193,0.0028434033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863297,0.000023784405,0.00025665655,0.00067822775,0.00015515841,0.00025319742],"domain_scores_gemma":[0.99716115,0.00005000319,0.00007041453,0.002452073,0.0001261215,0.00014026002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002160092,0.00011252526,0.0001634841,0.000026691318,0.000111266236,0.00029710727,0.0019166784,0.00004786543,0.0000831187],"category_scores_gemma":[0.0000348617,0.00009663879,0.00003344076,0.00019465174,0.000023586226,0.00059759,0.00019069228,0.00004584169,0.00006732595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032019682,0.0005040949,0.000038347705,0.000034100234,0.00006084467,0.000036335066,0.00019678817,0.0002654807,0.00051968574,0.01776691,0.26227096,0.71830326],"study_design_scores_gemma":[0.00032463638,0.000058446305,0.000073329575,0.000010665929,0.000004604332,0.000021045342,0.000011275963,0.9274968,0.00007228159,0.00010066922,0.07168461,0.00014163404],"about_ca_topic_score_codex":0.000024842528,"about_ca_topic_score_gemma":0.0000019668214,"teacher_disagreement_score":0.9272313,"about_ca_system_score_codex":0.000017702228,"about_ca_system_score_gemma":0.0000145357835,"threshold_uncertainty_score":0.39408153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001251561,0.00013427396,0.9917344,0.002541781,0.0011862626,0.0010639423,0.000070223236,0.00014789592,0.0029960861],"genre_scores_gemma":[0.76451576,0.000107779095,0.22647648,0.0018029226,0.00047437902,0.00026506616,0.00016386634,0.00011091511,0.0060828645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993603,0.000038460934,0.0008284979,0.0020929575,0.002506421,0.0009306914],"domain_scores_gemma":[0.99766743,0.000083649626,0.00025665644,0.0013856415,0.0003233508,0.00028329543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009914262,0.0006692203,0.00064086757,0.00089476415,0.00019222926,0.0004276299,0.0025687744,0.00031831753,0.00004722576],"category_scores_gemma":[0.00003783931,0.00064905506,0.00012203607,0.0014526203,0.00023950258,0.0005886748,0.00044333533,0.0007708529,0.00015427143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024196252,0.00025296578,0.00008246902,0.00016499593,0.00003764613,0.00051859464,0.0022931357,0.30908802,0.000039338436,0.010963896,0.00027095914,0.67626375],"study_design_scores_gemma":[0.0014867855,0.000361322,0.0009343199,0.0012206738,0.000023413717,0.000099270685,0.000002908393,0.86862534,0.00053759135,0.018387549,0.10637422,0.001946592],"about_ca_topic_score_codex":0.000023420527,"about_ca_topic_score_gemma":0.000028427261,"teacher_disagreement_score":0.7652579,"about_ca_system_score_codex":0.00082026934,"about_ca_system_score_gemma":0.00010923093,"threshold_uncertainty_score":0.99959606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020775509,0.00015517818,0.9930266,0.0006920125,0.00040460858,0.00041196414,0.000041120835,0.0003307143,0.0028602476],"genre_scores_gemma":[0.059749093,0.000039237737,0.92479086,0.0010317115,0.00007661998,0.00008635025,0.00003680928,0.000018651108,0.0141706625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985717,0.000034687146,0.0002806863,0.00044056168,0.00022428314,0.00044806628],"domain_scores_gemma":[0.9990162,0.000120438024,0.000050847615,0.0005906677,0.0000766538,0.0001451707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016887936,0.00016701325,0.00023695725,0.000030949785,0.00017395582,0.00024729516,0.00059238845,0.00011367773,0.00039816138],"category_scores_gemma":[0.000014278042,0.00013953642,0.00012252676,0.00028352664,0.000030259751,0.00028679264,0.0000428214,0.000097946,0.00027232151],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001139523,0.00012699247,0.000009669377,0.0000114923105,0.000031467316,0.00001179043,0.00035239503,0.00006450581,0.00005635921,0.07184727,0.0063628997,0.9211138],"study_design_scores_gemma":[0.0007090542,0.00006114668,0.0001183735,0.0000467384,0.000005101536,0.000017738796,0.000018984801,0.79343635,0.000107472595,0.015258957,0.18995047,0.00026959996],"about_ca_topic_score_codex":0.000036052657,"about_ca_topic_score_gemma":0.000004553559,"teacher_disagreement_score":0.92084414,"about_ca_system_score_codex":0.000046615656,"about_ca_system_score_gemma":0.00005430644,"threshold_uncertainty_score":0.56901306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016152338,0.00035589378,0.99043095,0.0011662602,0.0047046044,0.0009196362,0.000026963453,0.00028372832,0.0019504657],"genre_scores_gemma":[0.16383553,0.000042349133,0.8268698,0.0015699859,0.003333332,0.00017114653,0.000058692323,0.00013001845,0.0039891624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956026,0.000034576093,0.00061666284,0.0019354059,0.0009345344,0.0008762259],"domain_scores_gemma":[0.99607366,0.00024383036,0.0003968412,0.002428655,0.00059679407,0.00026021188],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006859975,0.0006167719,0.00061104435,0.00055753416,0.0005201413,0.0015564805,0.00419662,0.00048791387,0.000029317836],"category_scores_gemma":[0.000096708296,0.00057780877,0.000180729,0.0006152812,0.0005074433,0.0017296732,0.00046708342,0.0006532178,0.000067493165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150955,0.00007743512,0.00003850773,0.00014021683,0.000033695283,0.000022290455,0.00083997566,0.023725174,0.0013054294,0.16387519,0.0018365507,0.80809045],"study_design_scores_gemma":[0.0006585723,0.00046060188,0.00016724649,0.00030620597,0.000012633794,0.0001507446,8.102793e-7,0.681633,0.0019715359,0.28288832,0.030598935,0.0011513797],"about_ca_topic_score_codex":0.0001036725,"about_ca_topic_score_gemma":0.00016284945,"teacher_disagreement_score":0.80693907,"about_ca_system_score_codex":0.00041346613,"about_ca_system_score_gemma":0.00048113684,"threshold_uncertainty_score":0.99966735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102208454,0.0034773033,0.98061657,0.00038552142,0.00450893,0.0009537869,0.000017334198,0.000243126,0.009695245],"genre_scores_gemma":[0.7443689,0.00023468227,0.24888311,0.0018046211,0.002130853,0.00008290124,0.00003574435,0.00010521534,0.0023539627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942469,0.00011097777,0.0010263249,0.0017349453,0.0016853677,0.0011954748],"domain_scores_gemma":[0.9960776,0.0007046012,0.00057024264,0.0019108709,0.000373686,0.00036302494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031183783,0.000755638,0.001395144,0.0006969015,0.00042372264,0.0007123227,0.003766715,0.0004656085,0.0000790389],"category_scores_gemma":[0.00015073658,0.00061358814,0.00034193997,0.0008073269,0.0009414762,0.00060063356,0.0017619625,0.0008785945,0.00025803945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046056445,0.0001735423,0.000022348268,0.00012055433,0.000048425638,0.00013366826,0.0024564152,0.09683209,0.00024100761,0.17415205,0.0002668969,0.7250925],"study_design_scores_gemma":[0.01112141,0.00007181248,0.000027024986,0.00066386553,0.00002227031,0.000115341725,2.8040643e-7,0.9482444,0.00045248054,0.024943648,0.013202817,0.001134673],"about_ca_topic_score_codex":0.00005621534,"about_ca_topic_score_gemma":0.000021792974,"teacher_disagreement_score":0.8514123,"about_ca_system_score_codex":0.00037209678,"about_ca_system_score_gemma":0.0005416475,"threshold_uncertainty_score":0.9996315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5012472,0.0017120604,0.32538122,0.0019629567,0.0014683001,0.0017969043,0.00019645182,0.0003956213,0.16583925],"genre_scores_gemma":[0.99038655,0.000003987189,0.0094141,0.00008259152,0.000008126624,0.000019416684,0.000024223385,0.0000038536614,0.00005718133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983891,0.00013396017,0.0007843395,0.00010803809,0.00035676244,0.00022777375],"domain_scores_gemma":[0.99855465,0.00008000494,0.00035527654,0.00076313847,0.00013735681,0.00010956757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000871954,0.00011591157,0.00029751146,0.000103576276,0.000060695438,0.00019705459,0.0007480505,0.000054995802,0.000004041257],"category_scores_gemma":[0.0000536224,0.00010791453,0.000033967,0.0003708254,0.00016421116,0.00055812096,0.00024285544,0.00012203218,0.000045206987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007638798,0.0009233373,0.017291022,0.0010918633,0.00010601969,0.000029279288,0.0335331,0.0057567465,0.00028106215,0.8923738,0.033158053,0.015379331],"study_design_scores_gemma":[0.004802986,0.0002362485,0.010662362,0.0010021728,0.000012095642,0.00013210539,0.009787253,0.92470306,0.00045725738,0.004268115,0.043297138,0.00063918164],"about_ca_topic_score_codex":0.00051711843,"about_ca_topic_score_gemma":0.00003502,"teacher_disagreement_score":0.9189463,"about_ca_system_score_codex":0.0001387478,"about_ca_system_score_gemma":0.00010972962,"threshold_uncertainty_score":0.44006267},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025900104,0.00087124674,0.98706496,0.00031456508,0.004966019,0.00063211186,0.000011008574,0.0001598315,0.0057212682],"genre_scores_gemma":[0.946019,0.000099340825,0.04961176,0.0006695062,0.0010003009,0.0000894133,0.00002284131,0.000060941773,0.0024269142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995849,0.000059043065,0.0007722394,0.0015717965,0.000998478,0.00074940774],"domain_scores_gemma":[0.99750227,0.0002809038,0.0003409032,0.0014509918,0.00025324343,0.0001716889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008522122,0.00054577144,0.0006989241,0.0008497386,0.00015790085,0.000887289,0.0031050092,0.00045431164,0.000020001939],"category_scores_gemma":[0.000046489156,0.0004975581,0.00010855003,0.00083792006,0.00030927564,0.0012293361,0.0007387718,0.00090020907,0.00022988816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006350468,0.0000699801,0.0001941059,0.00025111172,0.000015111355,0.0002879918,0.00074777764,0.14582436,0.000111898196,0.09284527,0.00029785803,0.7593482],"study_design_scores_gemma":[0.00038027755,0.000108826935,0.0006238595,0.0012669952,0.0000035331345,0.00013112185,7.364932e-7,0.9537534,0.000106969834,0.034322727,0.008390631,0.0009108831],"about_ca_topic_score_codex":0.00038896865,"about_ca_topic_score_gemma":0.00017933603,"teacher_disagreement_score":0.94576,"about_ca_system_score_codex":0.00048340205,"about_ca_system_score_gemma":0.0004129005,"threshold_uncertainty_score":0.99974763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010385354,0.00004785921,0.99593997,0.00032734463,0.00093398173,0.00051601406,0.000029535799,0.00021517262,0.00095158606],"genre_scores_gemma":[0.6632759,9.482647e-7,0.33145598,0.00037387983,0.000914698,0.00071936665,0.000097268516,0.000015682299,0.0031462468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.000022895363,0.00019117756,0.0003236625,0.00012615141,0.0002066266],"domain_scores_gemma":[0.9993698,0.000022221504,0.00005811677,0.00025484807,0.00017991515,0.000115112256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038070456,0.000092674265,0.00010822653,0.000040567156,0.00010737294,0.00015048523,0.00018138181,0.000058492777,8.0612966e-7],"category_scores_gemma":[0.000019335574,0.00008171655,0.000052688814,0.00016087895,0.000011822529,0.0005519462,0.000017434902,0.0000317012,0.000007825267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028439536,0.0012932533,0.00006021624,0.000038365713,0.00007104589,0.0000036960544,0.005271748,0.0011289436,0.006608442,0.08282074,0.29261747,0.6098017],"study_design_scores_gemma":[0.0021894486,0.0009828234,0.00003613719,0.0000064281526,0.0000017630547,0.000016426802,0.00017388808,0.8450122,0.019640697,0.00039124297,0.13138473,0.00016423066],"about_ca_topic_score_codex":0.00012581392,"about_ca_topic_score_gemma":0.000023610475,"teacher_disagreement_score":0.8438832,"about_ca_system_score_codex":0.000071202485,"about_ca_system_score_gemma":0.000051736213,"threshold_uncertainty_score":0.3332304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024244594,0.00069380994,0.99538434,0.00009717175,0.0019819473,0.00039040207,0.0004354154,0.000047630157,0.0007268234],"genre_scores_gemma":[0.5139154,0.000073126364,0.48497742,0.00019799307,0.00025746287,0.0000048138613,0.0005087298,0.000025160281,0.00003987259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956315,0.000048784364,0.0008848209,0.0019994378,0.0009353313,0.0005000915],"domain_scores_gemma":[0.99485874,0.00016402616,0.00054181286,0.004153369,0.00016607033,0.00011597954],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010727375,0.0004409609,0.0006473235,0.00054230663,0.00008366665,0.0002715184,0.01117806,0.00024948214,0.00002503569],"category_scores_gemma":[0.000062580184,0.00039960767,0.000046428297,0.00055843487,0.00056340697,0.001995927,0.005149765,0.0006040443,0.000010157464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006620134,0.000038655824,0.00016975129,0.00007917317,0.000013339859,0.000040694817,0.000657804,0.016669841,0.000034581357,0.016029641,0.000082262064,0.96617764],"study_design_scores_gemma":[0.00053850276,0.00011798435,0.0006914077,0.00056873803,0.000009218176,0.000044868553,5.0434403e-7,0.97788125,0.00035937893,0.01612002,0.0030895818,0.0005785696],"about_ca_topic_score_codex":0.0001414337,"about_ca_topic_score_gemma":0.00025677177,"teacher_disagreement_score":0.96559906,"about_ca_system_score_codex":0.00013224143,"about_ca_system_score_gemma":0.0005974688,"threshold_uncertainty_score":0.99984556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01789317,0.0005170747,0.9643777,0.0122930845,0.00015817182,0.0017224508,0.000056259316,0.00013561394,0.0028464831],"genre_scores_gemma":[0.9875598,0.000009215909,0.010754212,0.00042973444,0.000073067305,0.000056114288,0.000024453984,0.000009157951,0.001084263],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987329,0.000063441694,0.0004416668,0.00027927005,0.00026394374,0.00021872818],"domain_scores_gemma":[0.99919087,0.00010641298,0.00018665989,0.00035072773,0.00013453329,0.000030819927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941098,0.00012340464,0.00020787198,0.000054281,0.00009226928,0.00010574278,0.00065145316,0.00006992841,0.00002922636],"category_scores_gemma":[0.00009355242,0.00007511705,0.000044454584,0.00078085193,0.000017836797,0.00047255904,0.000080512364,0.000093374656,0.000004978848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024832523,0.0023256508,0.049431246,0.005246993,0.00020777427,0.00012017232,0.06858769,0.0050785975,0.012826856,0.2152836,0.5261618,0.11448134],"study_design_scores_gemma":[0.005655996,0.0009711562,0.012071275,0.0015039167,0.00003658387,0.00017319755,0.0079371,0.76359075,0.005220291,0.0024038665,0.19905484,0.0013810532],"about_ca_topic_score_codex":0.00005320325,"about_ca_topic_score_gemma":0.00010514873,"teacher_disagreement_score":0.9696666,"about_ca_system_score_codex":0.00004041634,"about_ca_system_score_gemma":0.00009391288,"threshold_uncertainty_score":0.30631846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042693417,0.0022409044,0.9899599,0.0002327487,0.0003377235,0.00059441646,0.000037371854,0.00005777299,0.006496499],"genre_scores_gemma":[0.9980109,0.00048019827,0.0004175871,0.00045833932,0.00034359322,0.00002035897,0.0000940768,0.000025823843,0.00014916355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.000081609214,0.00036055892,0.00039080819,0.00032077357,0.00024843882],"domain_scores_gemma":[0.99909484,0.0001667209,0.00021209582,0.00042590217,0.000067479516,0.000032952114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014966461,0.00026885569,0.0003630298,0.00005968715,0.00007102796,0.0001271453,0.0004513369,0.00025081233,0.0000010050242],"category_scores_gemma":[0.000022469801,0.00020648101,0.00006165678,0.00018551935,0.000043919405,0.00016842977,0.000032348915,0.0003037749,0.0000051284433],"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.000024224319,0.00007239121,0.0009374262,0.00039477274,0.000045824698,0.000154654,0.0041996953,0.038064223,0.00002923364,0.87156975,0.00053637015,0.08397141],"study_design_scores_gemma":[0.006996076,0.00022952762,0.0027445764,0.003999202,0.00011764602,0.0003659932,0.000027925204,0.7354416,0.00038806716,0.083003365,0.16406211,0.0026238763],"about_ca_topic_score_codex":0.00003551956,"about_ca_topic_score_gemma":0.000049406473,"teacher_disagreement_score":0.99796814,"about_ca_system_score_codex":0.0001093488,"about_ca_system_score_gemma":0.000055243887,"threshold_uncertainty_score":0.84200513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006311308,0.0005843301,0.99416965,0.00024897145,0.0011997736,0.00036014244,0.0000103520715,0.0000732745,0.0027223933],"genre_scores_gemma":[0.6313078,0.00008434932,0.36768973,0.00043190518,0.0002410624,0.000011722552,0.000010212321,0.0000331565,0.00019011323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956163,0.000024051846,0.00074515963,0.0016726858,0.0011779158,0.00076384534],"domain_scores_gemma":[0.99798095,0.00019872683,0.00027921086,0.0013262185,0.00005619158,0.00015869201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007346016,0.00056544936,0.0006227403,0.00068022456,0.00014947384,0.0007711061,0.0033324151,0.00036434262,0.000025453277],"category_scores_gemma":[0.000034456894,0.0005171613,0.00011656165,0.00061544566,0.00046750891,0.0010963733,0.0010864694,0.0007872398,0.00008923388],"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.000009945314,0.00006819666,0.00006305722,0.000028351802,0.0000062213353,0.00038110887,0.00047512335,0.5875461,0.00016191216,0.062147792,0.00001259705,0.3490996],"study_design_scores_gemma":[0.0021273794,0.0004536759,0.0025560826,0.0031777099,0.000008458031,0.00020277027,0.0000012253936,0.71273977,0.0011079161,0.26292354,0.012485786,0.002215716],"about_ca_topic_score_codex":0.000070264236,"about_ca_topic_score_gemma":0.000088367204,"teacher_disagreement_score":0.6306766,"about_ca_system_score_codex":0.0003444044,"about_ca_system_score_gemma":0.0006132371,"threshold_uncertainty_score":0.999728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007508126,0.0003621139,0.97431,0.0004920355,0.0014223286,0.00055993424,0.000020139698,0.00018771752,0.02257069],"genre_scores_gemma":[0.21362497,0.00010426023,0.7819817,0.0028085639,0.00048690566,0.000045982957,0.00003418518,0.00004675622,0.0008666672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554706,0.000024750678,0.00077079743,0.001179034,0.0015710567,0.0009073323],"domain_scores_gemma":[0.9968549,0.00008639165,0.0006314335,0.0016173186,0.00063889025,0.000171065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000786978,0.00064569357,0.00065904116,0.0003241037,0.00030366716,0.0007838688,0.0031571547,0.00030076402,0.00004129217],"category_scores_gemma":[0.000035826448,0.00051357114,0.000107026586,0.0007632438,0.00047651105,0.0026922484,0.0009443062,0.0006439188,0.0001665917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007958294,0.00011441068,0.00021804149,0.00027390503,0.00006778938,0.00012686009,0.00363962,0.023356771,0.0002740518,0.20959243,0.0008637198,0.76139283],"study_design_scores_gemma":[0.0032997944,0.001985789,0.0005382536,0.0045729093,0.000044855093,0.00056181615,0.0000018688344,0.53742874,0.005421574,0.11621613,0.32581156,0.00411667],"about_ca_topic_score_codex":0.00017058733,"about_ca_topic_score_gemma":0.0001247379,"teacher_disagreement_score":0.7572762,"about_ca_system_score_codex":0.0002936685,"about_ca_system_score_gemma":0.0007395343,"threshold_uncertainty_score":0.9997316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000431288,0.0029110624,0.98934406,0.00020838654,0.0035628253,0.00040526234,0.000044238426,0.00010695458,0.0033740965],"genre_scores_gemma":[0.9196578,0.00040662664,0.07732766,0.0008736628,0.0008332302,0.000018374134,0.000029639685,0.0000661532,0.0007868504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959093,0.0000443578,0.0008912621,0.0013745547,0.0011268423,0.00065372384],"domain_scores_gemma":[0.99717677,0.00017451559,0.0006058389,0.0014918038,0.0003722534,0.00017880676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005583707,0.0005885798,0.0009430917,0.00049100036,0.00016068864,0.0004407935,0.0037769692,0.00035515105,0.00010381716],"category_scores_gemma":[0.00004769493,0.0005078482,0.00017430239,0.00069562293,0.00066985225,0.00055889727,0.0010278092,0.00057584624,0.00003026467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046800674,0.000052954292,0.00012569354,0.00028777486,0.00003453951,0.00006589849,0.0005476276,0.02637729,0.0001436833,0.18878815,0.00039013132,0.7831816],"study_design_scores_gemma":[0.00094372727,0.000409637,0.00028420752,0.0020097708,0.000021811871,0.00016518089,3.2926073e-7,0.7393379,0.002951547,0.18704492,0.0650549,0.0017760311],"about_ca_topic_score_codex":0.000046297548,"about_ca_topic_score_gemma":0.000024293282,"teacher_disagreement_score":0.9196147,"about_ca_system_score_codex":0.00016376123,"about_ca_system_score_gemma":0.0003177798,"threshold_uncertainty_score":0.9997373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012784051,0.0002614327,0.96841073,0.0011413641,0.0017967656,0.0003944724,0.00023326268,0.0004946475,0.014483285],"genre_scores_gemma":[0.9912349,0.0000058440983,0.005083547,0.000537486,0.00005041387,0.00003327359,0.000017715049,0.000008656617,0.003028152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977104,0.00017507847,0.0005193704,0.000671822,0.0004456284,0.0004777019],"domain_scores_gemma":[0.99806625,0.00008030474,0.00013081165,0.001291199,0.00024481074,0.00018663792],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065334985,0.00022623847,0.00035123742,0.000041087438,0.00016974847,0.0003765815,0.0008399428,0.00012604454,0.00020714587],"category_scores_gemma":[0.000096969525,0.00019050682,0.00009996175,0.0005920453,0.000044908207,0.00047812198,0.000094588206,0.00014417546,0.0008069626],"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.0000043169644,0.00014682676,0.0006345648,0.000058505877,0.000032098527,0.000020287556,0.000139423,0.0003877993,0.00035776346,0.92548543,0.071827635,0.0009053692],"study_design_scores_gemma":[0.0010419947,0.0000952962,0.0027623624,0.00004647519,0.000010212252,0.00008649368,0.000102440325,0.024726314,0.008252233,0.0013962178,0.9607633,0.0007167024],"about_ca_topic_score_codex":0.00039647223,"about_ca_topic_score_gemma":0.0000059730914,"teacher_disagreement_score":0.97845083,"about_ca_system_score_codex":0.00009940587,"about_ca_system_score_gemma":0.00010648438,"threshold_uncertainty_score":0.99997103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057209632,0.0003298375,0.9942105,0.00034312738,0.0020407578,0.0013275743,0.00021578246,0.00032969858,0.0011455197],"genre_scores_gemma":[0.7315801,0.000006609996,0.26687187,0.0006714522,0.0003219413,0.00021313525,0.00023094387,0.000044580465,0.000059416237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605983,0.000060982216,0.00073088706,0.0015354912,0.00093528134,0.0006775341],"domain_scores_gemma":[0.9949706,0.0009464686,0.00057452265,0.0028608697,0.00044551882,0.00020199944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014164826,0.0006035165,0.00069563696,0.0004566146,0.0005872343,0.00090020156,0.005050725,0.0005469716,0.000005213672],"category_scores_gemma":[0.000063218395,0.0005345883,0.00021644635,0.00057387975,0.00047364514,0.00047836412,0.0005790241,0.00091260014,0.000029295004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006859415,0.00028122708,0.00013277431,0.00093114766,0.000042785723,0.00006337462,0.0005437675,0.17088272,0.00074515713,0.164117,0.00017796451,0.6620135],"study_design_scores_gemma":[0.0006229563,0.0003528044,0.000098380944,0.0014059272,0.000011422751,0.000022935572,5.466228e-7,0.9650452,0.0009599322,0.0067091854,0.024008851,0.0007618182],"about_ca_topic_score_codex":0.000033372868,"about_ca_topic_score_gemma":0.00015329004,"teacher_disagreement_score":0.7941625,"about_ca_system_score_codex":0.00041528983,"about_ca_system_score_gemma":0.00033283228,"threshold_uncertainty_score":0.99971056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67123973,0.0001537841,0.3271643,0.00016066802,0.00008756051,0.00020703909,0.0000016184083,0.00003465124,0.0009506832],"genre_scores_gemma":[0.98164254,0.000025697369,0.018139992,0.000027259912,0.000017441107,0.0000025495228,0.0000053194444,0.0000036385798,0.00013555642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910206,0.0000641618,0.00031076343,0.0002315158,0.00017260674,0.000118908785],"domain_scores_gemma":[0.9995006,0.000020893365,0.00013894764,0.00023014906,0.00008125419,0.000028210781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027377784,0.000082336104,0.0001389221,0.000116047406,0.00003903472,0.00007311523,0.00013964076,0.000055120836,0.000007902849],"category_scores_gemma":[0.000037185117,0.00007680985,0.000020156142,0.0005262398,0.000018638848,0.0005565572,0.00003410521,0.000050418872,0.000005507299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041206622,0.00074260595,0.05074859,0.0007853321,0.00006911843,0.000028372586,0.024048071,0.008510511,0.31731242,0.03523555,0.0024732074,0.560005],"study_design_scores_gemma":[0.0003324315,0.000058538175,0.0099780215,0.00010392662,0.0000028521936,0.000013519933,0.00006590278,0.9682179,0.02047555,0.0003753007,0.00025345926,0.00012256787],"about_ca_topic_score_codex":0.00081748614,"about_ca_topic_score_gemma":0.0001531647,"teacher_disagreement_score":0.95970744,"about_ca_system_score_codex":0.0000439486,"about_ca_system_score_gemma":0.000018851642,"threshold_uncertainty_score":0.31322148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032154454,0.000977022,0.9928362,0.0001921231,0.0013288041,0.0010413707,0.000031113235,0.00008161669,0.00029631628],"genre_scores_gemma":[0.7144436,0.000046024426,0.28481108,0.00020457064,0.00014639217,0.000023270633,0.0000031931581,0.000022324179,0.00029949818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516255,0.00008269375,0.0010270058,0.0023551297,0.0008797871,0.0004928322],"domain_scores_gemma":[0.9952844,0.00022591789,0.00055269146,0.003152048,0.00054175284,0.00024318413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002000079,0.0004450417,0.0007217758,0.0003256658,0.00018205425,0.00030876393,0.0019243825,0.00026794864,0.0000055413966],"category_scores_gemma":[0.00025992445,0.00041177185,0.00010003416,0.0006270923,0.00047123883,0.00039806045,0.0010068978,0.0003967245,0.00001667978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017981401,0.00028831052,0.0010570385,0.0010116609,0.000029484121,0.00003948634,0.0028574814,0.3762043,0.0042548743,0.0077782823,0.00008206091,0.60637903],"study_design_scores_gemma":[0.00013369012,0.00011926612,0.0006026111,0.0007548666,0.0000072370644,0.000035059704,3.1822265e-7,0.99209267,0.0018283048,0.0015717172,0.0023493122,0.00050492235],"about_ca_topic_score_codex":0.00018617215,"about_ca_topic_score_gemma":0.000022401822,"teacher_disagreement_score":0.7112282,"about_ca_system_score_codex":0.0005014686,"about_ca_system_score_gemma":0.00019518346,"threshold_uncertainty_score":0.9998334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19276631,0.0014552181,0.8030484,0.00025534842,0.0011754251,0.0010126176,0.000022333197,0.0001363543,0.00012801045],"genre_scores_gemma":[0.99348605,0.000018705536,0.0057778736,0.00025766893,0.00023616158,0.000082542974,0.000034709454,0.000015175649,0.0000910864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997667,0.00034990226,0.00055772887,0.00056505913,0.0004359048,0.00042437302],"domain_scores_gemma":[0.9988804,0.00008855405,0.00020915248,0.0002933987,0.00016698687,0.00036150403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095369434,0.0002687043,0.00036042696,0.00012721978,0.00026306996,0.00080347754,0.00032303366,0.000069132984,0.0000022092336],"category_scores_gemma":[0.0000056004665,0.00023009353,0.000032115877,0.00039604193,0.000030757237,0.00059307495,0.00013313853,0.000089926056,0.000012620349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000461849,0.00023515591,0.053769067,0.0008950377,0.0005934751,0.00017957282,0.06981566,0.14786547,0.0054661785,0.085042596,0.05474605,0.5809299],"study_design_scores_gemma":[0.0025151204,0.00046417673,0.0034565378,0.00026147437,0.00002938662,0.00022274506,0.0031483583,0.9589892,0.00016026705,0.00017436946,0.030009447,0.0005689325],"about_ca_topic_score_codex":0.000509148,"about_ca_topic_score_gemma":0.000027235588,"teacher_disagreement_score":0.8111237,"about_ca_system_score_codex":0.000061062376,"about_ca_system_score_gemma":0.00006484126,"threshold_uncertainty_score":0.93829423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477237,0.0053486875,0.07121991,0.039924264,0.0011283325,0.011185778,0.023274792,0.00006762676,0.00012690388],"genre_scores_gemma":[0.9823862,0.0004297976,0.016504917,0.000019865896,0.000020527417,0.00012293141,0.00014995753,0.000008186931,0.0003576249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798554,0.00020770561,0.0005446028,0.0005251363,0.00038561557,0.00035140227],"domain_scores_gemma":[0.99492604,0.0009573409,0.0003361243,0.000978825,0.002759813,0.00004187513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010792819,0.00015078667,0.0004117633,0.00012673029,0.00019984467,0.000039772534,0.0014657723,0.00002683771,9.2655745e-7],"category_scores_gemma":[0.0021079849,0.000106928936,0.00004919285,0.00078464084,0.00023050349,0.00061339646,0.000655288,0.00014344334,7.318935e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041577644,0.0053958897,0.005541413,0.0034232535,0.001154891,0.000005417638,0.021799758,0.1060462,0.17444885,0.36131513,0.02653563,0.2901758],"study_design_scores_gemma":[0.0038610625,0.0005094802,0.0011892711,0.002070536,0.000012819571,3.7078934e-7,0.020175908,0.90874815,0.028596828,0.0006040907,0.033949643,0.00028181914],"about_ca_topic_score_codex":0.00001932218,"about_ca_topic_score_gemma":0.008078115,"teacher_disagreement_score":0.80270195,"about_ca_system_score_codex":0.00024801728,"about_ca_system_score_gemma":0.00068542187,"threshold_uncertainty_score":0.45077777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013965592,0.0021230783,0.98482347,0.0004668475,0.00092258357,0.00042894698,0.0000047629683,0.00012866566,0.010961988],"genre_scores_gemma":[0.9270572,0.00021972983,0.07102422,0.0010171087,0.00028398447,0.000024950203,0.000020085183,0.000038917824,0.00031379124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963689,0.00007415418,0.00073999166,0.001314982,0.000779429,0.00072255585],"domain_scores_gemma":[0.9969162,0.0003126141,0.00027193746,0.0022074152,0.00014414013,0.00014770114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011316831,0.00047868415,0.00057776395,0.0006241987,0.00021745363,0.00053282926,0.0043869633,0.0003869199,0.000022748241],"category_scores_gemma":[0.000026870215,0.00045387167,0.000113828995,0.0010323514,0.00049206294,0.00024367803,0.0009127773,0.0010589383,0.00005467488],"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.0000029535845,0.000029363553,0.000019144763,0.000009041966,0.0000024365931,0.000033234777,0.00025463675,0.63203853,0.0000024900567,0.02504842,0.000016776397,0.34254298],"study_design_scores_gemma":[0.00027343543,0.00004589546,0.00022949679,0.00073522935,0.0000021411695,0.00003461719,8.044679e-8,0.96498984,0.000014211736,0.02729792,0.0058845556,0.0004925601],"about_ca_topic_score_codex":0.000078383055,"about_ca_topic_score_gemma":0.00024082599,"teacher_disagreement_score":0.92691755,"about_ca_system_score_codex":0.00038281377,"about_ca_system_score_gemma":0.00030732056,"threshold_uncertainty_score":0.9997913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005425574,0.00001974657,0.98389095,0.0016580625,0.00007673438,0.004996181,0.0000043622053,0.00005740999,0.008753983],"genre_scores_gemma":[0.98725134,3.1664956e-7,0.008194954,0.0002178433,0.00001443292,0.0037188283,5.8184304e-7,0.0000026883454,0.0005990368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989799,0.00015832973,0.00030598807,0.0002227332,0.00019755843,0.00013548664],"domain_scores_gemma":[0.9983807,0.0001823961,0.00011478951,0.0010634485,0.00022018421,0.000038482456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096875074,0.00006428615,0.00011553438,0.000008896528,0.00013745135,0.000086182896,0.0004320188,0.000031897394,0.00000751461],"category_scores_gemma":[0.00028477816,0.000037074748,0.000053685762,0.00018964587,0.000045641686,0.0000955575,0.000010581021,0.000046218505,0.000007940096],"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.00001827635,0.00015608795,0.002677779,0.000029875011,0.000007988029,0.0000010140246,0.000035309884,0.0042417007,0.0022051355,0.97291553,0.013124507,0.0045868084],"study_design_scores_gemma":[0.0017516387,0.00018513332,0.0016365238,0.000038600847,0.000002882373,0.0000032554342,0.000011913852,0.32829425,0.060906675,0.0057298564,0.60122585,0.00021344445],"about_ca_topic_score_codex":0.000018386168,"about_ca_topic_score_gemma":0.000008490673,"teacher_disagreement_score":0.98670876,"about_ca_system_score_codex":0.000016404925,"about_ca_system_score_gemma":0.00013067448,"threshold_uncertainty_score":0.15118644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031977534,0.000006992982,0.9131068,0.00076369656,0.00030176245,0.076030925,0.0000060349566,0.00038587998,0.0090781115],"genre_scores_gemma":[0.73293364,0.0000013787416,0.008848821,0.001161742,0.00048290967,0.25013903,0.000013067518,0.000033946595,0.0063854633],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998531,0.00004289736,0.00036763484,0.0004144149,0.00021324465,0.00043082307],"domain_scores_gemma":[0.99898976,0.00009843252,0.00012889122,0.00054670335,0.00011592191,0.00012027163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002439546,0.0001833065,0.00029042934,0.000048634804,0.00018810533,0.00065233343,0.0012346623,0.000084106345,0.00009836787],"category_scores_gemma":[0.00001978264,0.00014549043,0.00008924257,0.00034371216,0.000021109145,0.00069049647,0.00021152475,0.00010442726,0.000035712605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055008277,0.001405932,0.0037501452,0.0005792253,0.0002079219,0.00007468915,0.00070914184,0.024014767,0.0002689825,0.37681478,0.50083524,0.09078906],"study_design_scores_gemma":[0.0073524504,0.0001374004,0.00077700504,0.0000692134,0.0000033001472,0.000004363146,0.000003975138,0.9423583,0.0002329826,0.000494668,0.048294302,0.00027202486],"about_ca_topic_score_codex":0.00008605945,"about_ca_topic_score_gemma":0.000019607018,"teacher_disagreement_score":0.91834354,"about_ca_system_score_codex":0.000028918075,"about_ca_system_score_gemma":0.000011004489,"threshold_uncertainty_score":0.6290466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012280532,0.00008615024,0.9875269,0.00003543175,0.00039100955,0.006791305,0.000027071133,0.0001262107,0.0037878947],"genre_scores_gemma":[0.98741317,0.000004500373,0.008604155,0.00016914397,0.00007289097,0.003529722,0.0000073155593,0.0000088495535,0.00019024771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838704,0.00014438196,0.00038989465,0.00034261317,0.0003239736,0.00041207715],"domain_scores_gemma":[0.9988876,0.00018299826,0.00018927734,0.00048592192,0.00014314603,0.00011106075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035196453,0.00019155955,0.00035867872,0.000029166878,0.00009883507,0.00006570335,0.000551518,0.000076684475,0.00001215569],"category_scores_gemma":[0.00005989908,0.0001505433,0.00008306672,0.00048564043,0.00004317848,0.00023748547,0.000030572563,0.00013426217,0.000044808785],"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.00006937056,0.0013687278,0.0072911624,0.0009608533,0.000187147,0.00006256721,0.0001812015,0.0067524742,0.00090512214,0.66226476,0.032409318,0.2875473],"study_design_scores_gemma":[0.014638232,0.003165574,0.030727409,0.001832711,0.00003511356,0.000051675393,0.0000134088705,0.6386658,0.05691676,0.0021396824,0.2502743,0.0015393358],"about_ca_topic_score_codex":0.0000048569796,"about_ca_topic_score_gemma":3.164136e-7,"teacher_disagreement_score":0.98618513,"about_ca_system_score_codex":0.000029519197,"about_ca_system_score_gemma":0.00007384714,"threshold_uncertainty_score":0.6138978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010576743,0.0005598714,0.988049,0.0010762634,0.0012287421,0.0004970964,0.00003217834,0.000078558216,0.007420647],"genre_scores_gemma":[0.8787549,0.00000998585,0.11961543,0.0010070819,0.00026193805,0.000012925209,0.0000048397346,0.00003187039,0.000301017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.000041809904,0.000551502,0.0011945668,0.0012582137,0.00059609575],"domain_scores_gemma":[0.9963416,0.00053649215,0.000590479,0.0018733528,0.00053502625,0.00012304532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011526408,0.00047976113,0.0005733015,0.00026463834,0.0003169433,0.0004925695,0.0035380714,0.00020245062,0.000017802407],"category_scores_gemma":[0.000044762637,0.00030388846,0.0001054008,0.00063529034,0.001727669,0.00030606662,0.00073688914,0.00095354544,0.000008769884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094171555,0.00029943718,0.0012707857,0.00040139956,0.00020411995,0.00046462344,0.012357386,0.063850276,0.010107207,0.39108917,0.00027404484,0.5195874],"study_design_scores_gemma":[0.0070097093,0.0033308452,0.0019086604,0.0063597728,0.00013086802,0.0014663069,0.00001601242,0.51884615,0.024561998,0.18770473,0.24137118,0.0072937417],"about_ca_topic_score_codex":0.00009904461,"about_ca_topic_score_gemma":0.0005015472,"teacher_disagreement_score":0.8776972,"about_ca_system_score_codex":0.00009369812,"about_ca_system_score_gemma":0.00059962634,"threshold_uncertainty_score":0.99994135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029526286,0.00010974337,0.96322477,0.00010688755,0.00012497917,0.000087038614,0.00003523909,0.000021528838,0.006763545],"genre_scores_gemma":[0.99483055,0.000004689511,0.004824366,0.00004246836,0.0000032232904,0.0000026364169,0.0000044214653,0.0000014697297,0.00028619153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994887,0.00003126374,0.00013043903,0.0001278783,0.00013659763,0.000085094885],"domain_scores_gemma":[0.9996284,0.000017425913,0.00005236343,0.00023443082,0.00003515052,0.00003218563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001650378,0.00004653119,0.00009238013,0.000014867001,0.000020322675,0.000018494069,0.00029017843,0.000020643014,0.000007197776],"category_scores_gemma":[0.0000147406045,0.00003813418,0.000012113243,0.0002956213,0.000022444603,0.00015501669,0.000050715902,0.000021362808,0.00004945113],"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.000028655422,0.0012027508,0.056631617,0.000040921877,0.00015589001,0.000041298743,0.0033778057,0.010494862,0.013885067,0.86840636,0.0066189803,0.039115813],"study_design_scores_gemma":[0.0014901027,0.00018454954,0.9513242,0.00003219895,0.0000019230079,0.0000033814924,0.000061616964,0.0025966377,0.030242004,0.0015872557,0.012191335,0.0002847519],"about_ca_topic_score_codex":0.0003810626,"about_ca_topic_score_gemma":0.00007958064,"teacher_disagreement_score":0.96530426,"about_ca_system_score_codex":0.000018844736,"about_ca_system_score_gemma":0.000044582055,"threshold_uncertainty_score":0.15550669},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09189298,0.000018448705,0.90407026,0.000075832155,0.00038005153,0.00014655301,0.000007648745,0.00012322947,0.0032849882],"genre_scores_gemma":[0.9456539,8.7278494e-8,0.053902686,0.00022387346,0.000035977697,0.000017591101,0.0000023342043,0.0000044758976,0.0001590342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991933,0.000040219133,0.0001622276,0.00026577926,0.00009851231,0.00023994569],"domain_scores_gemma":[0.99944,0.000048191763,0.00004887556,0.00033067208,0.00005325786,0.00007897427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019393481,0.0000871369,0.00011085578,0.00002370688,0.00008484764,0.00016549621,0.00036206652,0.000029569288,0.000013236168],"category_scores_gemma":[0.000023685541,0.000070440845,0.00004633729,0.000097224714,0.000019721065,0.00023900259,0.000016606866,0.00004318859,0.000011473222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021075446,0.000046654233,0.007906835,0.000031357074,0.000016983675,0.0000067365822,0.00058326434,0.0001813018,0.0038199802,0.2968964,0.00036679348,0.69014156],"study_design_scores_gemma":[0.0070084822,0.0011198246,0.008618927,0.00021109269,0.000024006045,0.0026823957,0.0020113077,0.6655585,0.13539156,0.045724936,0.12848066,0.0031682733],"about_ca_topic_score_codex":0.000022796792,"about_ca_topic_score_gemma":0.000011187669,"teacher_disagreement_score":0.85376096,"about_ca_system_score_codex":0.000010254139,"about_ca_system_score_gemma":0.000027727772,"threshold_uncertainty_score":0.28724942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016143985,0.0016129838,0.9680771,0.00033976015,0.00066079927,0.0002894392,0.00002105351,0.00027829126,0.012576578],"genre_scores_gemma":[0.99616385,0.000013899712,0.0029504364,0.00010084418,0.000039439077,0.000022981128,0.000004241245,0.000004604735,0.0006997129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987716,0.00004749669,0.00028495287,0.0003656252,0.0002421297,0.00028816613],"domain_scores_gemma":[0.999232,0.000035285524,0.000058679485,0.00054200157,0.00005357018,0.00007848244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028971146,0.000112312366,0.00017539975,0.000076823635,0.0000642695,0.00021747513,0.0006618763,0.00004969718,0.00001942025],"category_scores_gemma":[0.00003211159,0.000096985896,0.000028612196,0.0005104085,0.000015330035,0.000683116,0.00011908771,0.00012330707,0.00015323257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018027486,0.0024162426,0.085039146,0.0014352156,0.00007542418,0.0015439789,0.005350786,0.010323717,0.0042762356,0.72899604,0.056092594,0.104432575],"study_design_scores_gemma":[0.00048440762,0.000010666979,0.0009835542,0.00009363076,8.9317825e-7,0.000026514526,0.000046168134,0.9815208,0.00013407815,0.000048257658,0.016463561,0.00018751883],"about_ca_topic_score_codex":0.00064047164,"about_ca_topic_score_gemma":0.000085151514,"teacher_disagreement_score":0.98001987,"about_ca_system_score_codex":0.000033393615,"about_ca_system_score_gemma":0.0000084808635,"threshold_uncertainty_score":0.395497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01703027,0.00015356413,0.6596288,0.008429977,0.00038225288,0.00032158275,0.000009310291,0.000737788,0.31330645],"genre_scores_gemma":[0.99011296,0.0000018237472,0.004869209,0.00048418873,0.0000526318,0.0000124908165,0.0000011546276,0.0000040077875,0.0044615455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990388,0.000013842166,0.0001578279,0.00025427283,0.0002041529,0.00033107057],"domain_scores_gemma":[0.9995256,0.000016170834,0.000050555664,0.0003063182,0.00004380592,0.000057554007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014036936,0.00008488987,0.0000881267,0.00003343688,0.00013658851,0.00017265228,0.0004669998,0.00002691907,0.00019755874],"category_scores_gemma":[0.000011590685,0.00006670094,0.00003337858,0.00026123272,0.0000073287583,0.00027188144,0.00008487875,0.000065724285,0.00046350123],"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.0000012553307,0.00018849086,0.0013758279,0.000054610715,0.00002369374,0.00003519804,0.001201197,0.00011852442,0.0003649664,0.5732274,0.23255858,0.19085026],"study_design_scores_gemma":[0.00039432515,0.00008070325,0.0004529867,0.00004150101,0.0000015923415,0.000017066222,0.00010781747,0.12896939,0.0015192437,0.00052816304,0.8676151,0.00027213167],"about_ca_topic_score_codex":0.00001433527,"about_ca_topic_score_gemma":0.000023269822,"teacher_disagreement_score":0.97308266,"about_ca_system_score_codex":0.0000133553,"about_ca_system_score_gemma":0.0000050351687,"threshold_uncertainty_score":0.5957525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008983784,0.0032273831,0.9901368,0.00036789294,0.00305965,0.00061242684,0.000076588694,0.00022293677,0.0022064948],"genre_scores_gemma":[0.77104163,0.00035750025,0.22321475,0.0011828865,0.0019932445,0.000037751783,0.000168191,0.00011723015,0.0018868273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941462,0.00006852001,0.0010441482,0.0025594975,0.0011927525,0.0009888449],"domain_scores_gemma":[0.99478316,0.0005473898,0.00042495385,0.003831426,0.00020212137,0.00021096793],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015797262,0.0007174257,0.0009526917,0.00083798094,0.00021859679,0.0014022082,0.00823581,0.00042134649,0.0000033364402],"category_scores_gemma":[0.00020229029,0.00067818974,0.00008978576,0.0009968479,0.00057217706,0.0017518406,0.0023706171,0.0009961753,0.00003502405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008464041,0.000052825784,0.00040513946,0.00014612677,0.000012010221,0.0004865273,0.00075219286,0.06671708,0.000100563266,0.01957662,0.00009335424,0.9116491],"study_design_scores_gemma":[0.00042146308,0.0000833501,0.00036874483,0.0017649273,0.0000037994698,0.00017246466,9.0027646e-7,0.95328176,0.00005912878,0.0034077556,0.039527565,0.00090814347],"about_ca_topic_score_codex":0.00021793904,"about_ca_topic_score_gemma":0.00039723658,"teacher_disagreement_score":0.910741,"about_ca_system_score_codex":0.00037042974,"about_ca_system_score_gemma":0.0004942578,"threshold_uncertainty_score":0.99963444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016664865,0.0007861187,0.98878765,0.0002817813,0.002579636,0.00051370537,0.000022216624,0.00022278914,0.005139643],"genre_scores_gemma":[0.9197701,0.0000058265787,0.079500906,0.0003266105,0.00013202058,0.000014875998,0.00000773291,0.00003702388,0.00020485661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947655,0.00008237596,0.000818535,0.0020575374,0.0012846948,0.0009913534],"domain_scores_gemma":[0.99663544,0.0006444925,0.0004183856,0.0015414291,0.00049711304,0.00026311487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022494067,0.00066635164,0.00087764807,0.0010697164,0.00018533763,0.0006448889,0.0038085603,0.0003781033,0.000005816081],"category_scores_gemma":[0.0003738013,0.000630216,0.00014890826,0.0017332974,0.0005915819,0.00069823756,0.0013881782,0.0011408053,0.00005206076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013743083,0.00013952158,0.0007971564,0.00010772119,0.000014825665,0.00056141714,0.001067099,0.13652802,0.00020977958,0.028015269,0.00006559807,0.83247983],"study_design_scores_gemma":[0.00051061605,0.00020591295,0.0008097463,0.0009836768,0.0000039189495,0.00013728341,3.9736085e-7,0.90710163,0.00006073519,0.08852886,0.00087075564,0.0007864406],"about_ca_topic_score_codex":0.00014336349,"about_ca_topic_score_gemma":0.0005868502,"teacher_disagreement_score":0.91810364,"about_ca_system_score_codex":0.0007569184,"about_ca_system_score_gemma":0.0008109829,"threshold_uncertainty_score":0.9996149},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024350416,0.003477295,0.008455131,0.000114946226,0.0014985065,0.00038752717,0.00017992471,0.00010145861,0.98576087],"genre_scores_gemma":[0.00083917705,0.010277243,0.042999335,0.00017767701,0.0010393274,0.00006611357,0.00027322772,0.00011546742,0.94421244],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972829,0.000023679811,0.00088087126,0.0007508699,0.00066917995,0.00039245203],"domain_scores_gemma":[0.9981385,0.000082600294,0.00044178497,0.0010365527,0.0001551263,0.00014543494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002162948,0.0004436766,0.00081389485,0.00030595818,0.00005084447,0.000037756196,0.001452894,0.0004298074,0.00019346493],"category_scores_gemma":[0.000025558138,0.00044839678,0.00022654909,0.000155906,0.00010247918,0.00036317378,0.00029737692,0.00049497985,0.0001411291],"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.000031199837,0.00036083758,0.00014207255,0.00046223923,0.00025958536,0.0032681213,0.006076529,0.00021132527,0.000018372519,0.08819748,0.33908814,0.5618841],"study_design_scores_gemma":[0.0007221212,0.0001051642,0.00055047724,0.000565761,0.000011181731,0.00008898963,0.000010513699,0.0023412209,0.000016963928,0.0037575127,0.9910162,0.00081390457],"about_ca_topic_score_codex":0.00008452692,"about_ca_topic_score_gemma":0.000024694758,"teacher_disagreement_score":0.65192807,"about_ca_system_score_codex":0.000094538715,"about_ca_system_score_gemma":0.00026065263,"threshold_uncertainty_score":0.9997968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002527936,0.000475857,0.9958681,0.0008387273,0.0010010931,0.0005613981,0.000060098086,0.0000854123,0.000856559],"genre_scores_gemma":[0.06589626,0.000031568772,0.92966425,0.0013520614,0.001121523,0.000023804723,0.000028375265,0.000056189365,0.001825947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722713,0.00001565227,0.00045925254,0.0011769015,0.00052375486,0.000597278],"domain_scores_gemma":[0.9982912,0.00026540653,0.00025651723,0.00079299,0.00023445062,0.00015946617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006009924,0.0004050771,0.0004436054,0.00036305955,0.00040644465,0.00079038733,0.0013137596,0.00019843529,0.000017905697],"category_scores_gemma":[0.000032611304,0.0003878965,0.0001063554,0.00033912965,0.000464731,0.00066739897,0.00057431904,0.00028483247,0.000015288317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001695035,0.00007920063,0.00005118572,0.0001196287,0.00005410861,0.00006912933,0.0019939905,0.06236921,0.0013032053,0.09311393,0.00041173506,0.84041774],"study_design_scores_gemma":[0.00041542592,0.0001416372,0.000043338623,0.0002492871,0.000012550303,0.00010283551,2.3839867e-7,0.9493725,0.00023264671,0.0212195,0.027606156,0.00060389016],"about_ca_topic_score_codex":0.00002354918,"about_ca_topic_score_gemma":0.00008656922,"teacher_disagreement_score":0.8870033,"about_ca_system_score_codex":0.00027063658,"about_ca_system_score_gemma":0.00038193434,"threshold_uncertainty_score":0.9998573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006585106,0.00095922337,0.98563886,0.00033008648,0.00041157487,0.0000997905,0.00024578877,0.00007438535,0.011581753],"genre_scores_gemma":[0.9969093,0.000005655329,0.0025224793,0.00017205613,0.000032716584,0.0000016178278,0.000011837254,0.0000023059588,0.00034201457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911255,0.000030449202,0.00023130781,0.00026548078,0.00017833925,0.00018188544],"domain_scores_gemma":[0.99861306,0.000029926981,0.00008699794,0.0011535141,0.00006316616,0.000053316377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014910981,0.00007576604,0.0001711896,0.000023428805,0.000034215067,0.000039439867,0.0014871749,0.00003633273,0.00019875081],"category_scores_gemma":[0.000027205571,0.000059016224,0.000026597618,0.00019777215,0.000021774511,0.0003750291,0.00017671101,0.000053745764,0.000045899484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034289246,0.00023811415,0.004097137,0.000058074376,0.00007207177,0.000023190916,0.0005042185,0.000054113345,0.0010916321,0.7670762,0.14717294,0.0796089],"study_design_scores_gemma":[0.0015525502,0.00003443881,0.0015900151,0.000022555178,0.000005407459,0.000013474248,0.000017670049,0.8290764,0.00025436998,0.0004767561,0.16679274,0.00016359074],"about_ca_topic_score_codex":0.000011958129,"about_ca_topic_score_gemma":0.000002940906,"teacher_disagreement_score":0.9962508,"about_ca_system_score_codex":0.0000044713065,"about_ca_system_score_gemma":0.000010318439,"threshold_uncertainty_score":0.27635658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026810525,0.0006327963,0.9865697,0.0002966608,0.0011156054,0.00036290355,0.000028745884,0.00017879378,0.010787958],"genre_scores_gemma":[0.29066157,0.00018190297,0.70800316,0.000393976,0.00035826917,0.000018304745,0.000011104742,0.000042208412,0.00032949614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967458,0.000026439271,0.0007966185,0.0009343076,0.0009678481,0.0005289821],"domain_scores_gemma":[0.99777305,0.00022310497,0.00034318,0.0012025038,0.0003157214,0.00014241494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064552034,0.00041021447,0.0005919444,0.00056640233,0.00018810638,0.00026784753,0.0026928561,0.00026921733,0.00002352516],"category_scores_gemma":[0.000025509851,0.00037821897,0.00017550198,0.0007607989,0.00033863497,0.00080471917,0.00034628247,0.0005305385,0.000032625558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018654242,0.00010582232,0.000035522,0.00022039347,0.000029720228,0.000058097412,0.003751702,0.02709546,0.00009728001,0.06216335,0.00006179919,0.906379],"study_design_scores_gemma":[0.00030119112,0.0001282436,0.00005590659,0.0005227307,0.000009305151,0.000073214105,3.223941e-7,0.96375155,0.0007455835,0.027404021,0.006422464,0.00058548426],"about_ca_topic_score_codex":0.000016219441,"about_ca_topic_score_gemma":0.000013727664,"teacher_disagreement_score":0.93665606,"about_ca_system_score_codex":0.0001992499,"about_ca_system_score_gemma":0.000268029,"threshold_uncertainty_score":0.99986696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002673326,0.001175095,0.9920993,0.0009305871,0.002777666,0.0010021343,0.000017591712,0.00009348309,0.0018774047],"genre_scores_gemma":[0.91709524,0.00007873529,0.0801555,0.0011949022,0.00082598976,0.0001280074,0.000033264223,0.00004088683,0.00044747134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960757,0.000035993173,0.0010851043,0.00089656736,0.0009861399,0.00092052453],"domain_scores_gemma":[0.9970312,0.0007230119,0.0005936022,0.0011542962,0.00036228626,0.00013556542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019605693,0.00052128616,0.00061161607,0.00054199103,0.000657509,0.0028072293,0.003317423,0.0003935585,8.029719e-7],"category_scores_gemma":[0.00011602396,0.00039810198,0.00015067446,0.00060730684,0.0004680696,0.0017343432,0.00047945307,0.00069408794,0.0000133889525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009108301,0.000011757691,0.000010174322,0.00010064914,0.000007820556,0.000016680506,0.0009903635,0.10554593,0.000027565653,0.021345237,0.00021498872,0.8717197],"study_design_scores_gemma":[0.0004170708,0.000106673644,0.00014891737,0.0012929944,0.0000042514694,0.000038805778,0.0000030270178,0.954176,0.00009298858,0.010559465,0.03263801,0.000521794],"about_ca_topic_score_codex":0.00010711624,"about_ca_topic_score_gemma":0.00019466881,"teacher_disagreement_score":0.9170685,"about_ca_system_score_codex":0.00045479252,"about_ca_system_score_gemma":0.0005803915,"threshold_uncertainty_score":0.9998471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19410707,0.001311985,0.802985,0.0006941223,0.00043501935,0.00011516111,0.0000022339855,0.000025548246,0.0003238692],"genre_scores_gemma":[0.9979505,0.000013193225,0.0018829026,0.00006446891,0.00004925066,9.660685e-7,0.0000025638315,0.0000027004294,0.000033454784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884945,0.00010304906,0.0004934251,0.000122026104,0.00030179965,0.0001302721],"domain_scores_gemma":[0.9991652,0.000048290785,0.00037814985,0.0001817662,0.00016183336,0.00006479856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097130827,0.000086410655,0.00022773276,0.00020880759,0.000034932287,0.0001902136,0.00032401216,0.00006257729,8.523754e-7],"category_scores_gemma":[0.000040839146,0.00007686,0.000039890776,0.00022711784,0.000010911852,0.00066480704,0.000014692257,0.00012263693,0.0000023580558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001594142,0.0020549602,0.015843192,0.0006876595,0.000106018146,0.0032171705,0.0032548825,0.006350322,0.13123113,0.28221127,0.004664176,0.5502198],"study_design_scores_gemma":[0.0031298383,0.00050380663,0.10987779,0.00046479187,0.000012819101,0.00026246614,0.000080979786,0.8716395,0.0046341848,0.00089944707,0.008250327,0.00024406548],"about_ca_topic_score_codex":0.000011834634,"about_ca_topic_score_gemma":0.0000029904077,"teacher_disagreement_score":0.86528915,"about_ca_system_score_codex":0.00007324954,"about_ca_system_score_gemma":0.00006401752,"threshold_uncertainty_score":0.313426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007261224,0.0015807,0.9917548,0.0004894929,0.0012408552,0.0007712208,0.0000858348,0.00017795837,0.0031730433],"genre_scores_gemma":[0.99016386,0.000061532424,0.00726682,0.0014223203,0.00041422056,0.00002163007,0.00001567696,0.00003500691,0.00059895625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583733,0.00004810572,0.0006165684,0.0017769616,0.0009893834,0.00073163165],"domain_scores_gemma":[0.99753386,0.00036279287,0.00041293373,0.0009791488,0.000437937,0.0002733111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074187765,0.00069386064,0.00081623223,0.0004486979,0.0002811396,0.00079189724,0.0020462053,0.00039660887,0.000016611077],"category_scores_gemma":[0.00010387702,0.0005464025,0.00018787172,0.00045402825,0.00029993587,0.00090834586,0.000411785,0.0007319841,0.000056723988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015704517,0.00022075394,0.00027793244,0.00028460883,0.00013140295,0.000752854,0.0020178289,0.090883724,0.00096193963,0.025841463,0.0003286289,0.8781418],"study_design_scores_gemma":[0.0017062428,0.00049048825,0.0008661093,0.0010449432,0.000014378334,0.00019701407,3.4880776e-7,0.98451805,0.00031371604,0.008782875,0.0011226028,0.00094325806],"about_ca_topic_score_codex":0.000057388548,"about_ca_topic_score_gemma":0.00004895801,"teacher_disagreement_score":0.9894377,"about_ca_system_score_codex":0.00031997636,"about_ca_system_score_gemma":0.00030721334,"threshold_uncertainty_score":0.99969876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032001022,0.000052315285,0.96634686,0.0027587211,0.0011971763,0.0019543965,0.006536298,0.00034130638,0.020780902],"genre_scores_gemma":[0.47028086,0.00010509219,0.18081586,0.0031326085,0.0023790046,0.0036140005,0.29153344,0.00024119295,0.047897946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958475,0.000036459995,0.0020691315,0.0007230814,0.00085024367,0.00047353256],"domain_scores_gemma":[0.994949,0.00018143555,0.0015247475,0.0005757854,0.0025662465,0.00020280857],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007359348,0.0005822736,0.0005220614,0.0007074957,0.0013390671,0.002939804,0.0011819684,0.0004865538,0.000029840456],"category_scores_gemma":[0.0005283596,0.0006161367,0.00023943893,0.0002281966,0.000089651236,0.0067847646,0.00011593959,0.00063876074,0.000038398895],"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.00017133607,0.00026666897,0.000037227954,0.0006670836,0.00012663647,0.000006810842,0.0030116555,0.021818085,0.00011947935,0.8214651,0.046747494,0.10556247],"study_design_scores_gemma":[0.0011808219,0.00012134488,0.000049488743,0.00040605423,0.00002047756,0.00005985756,0.000085188396,0.48225784,0.00020361246,0.011068235,0.5038202,0.0007269105],"about_ca_topic_score_codex":0.00003278531,"about_ca_topic_score_gemma":0.00022120004,"teacher_disagreement_score":0.8103968,"about_ca_system_score_codex":0.0004949418,"about_ca_system_score_gemma":0.0010170746,"threshold_uncertainty_score":0.9999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005923164,0.00049444794,0.9892902,0.0008913778,0.00046335775,0.00084868085,0.0001598328,0.00025066352,0.0016783015],"genre_scores_gemma":[0.9973344,0.0000032391054,0.0019235119,0.00023130683,0.000120193945,0.000077076205,0.00002415176,0.0000114437335,0.00027463696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976473,0.00012799479,0.0006930741,0.00057080475,0.00029910324,0.0006617086],"domain_scores_gemma":[0.99879044,0.00028787245,0.00013563436,0.00048459176,0.00013040414,0.00017103704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047975546,0.00023287915,0.00048590256,0.00009771159,0.0001408772,0.00042167993,0.00079976965,0.00012814805,0.000011197154],"category_scores_gemma":[0.000044387765,0.00019727058,0.000116015246,0.00049676595,0.000040678166,0.00031313673,0.000067472276,0.00020840752,0.000038985825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006963169,0.001059588,0.002842521,0.000370421,0.00012859773,0.00023291685,0.0011112035,0.2145609,0.0005844359,0.68061113,0.03557867,0.06284999],"study_design_scores_gemma":[0.0023285092,0.00010356761,0.0009120836,0.00007926585,0.0000031650636,0.000036994847,0.000058701615,0.9832118,0.000009161902,0.00022958308,0.012767656,0.0002595095],"about_ca_topic_score_codex":0.00015165193,"about_ca_topic_score_gemma":0.000024729521,"teacher_disagreement_score":0.99141127,"about_ca_system_score_codex":0.000089907684,"about_ca_system_score_gemma":0.000028538758,"threshold_uncertainty_score":0.8044461},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76780874,0.0009977686,0.023088599,0.00084291754,0.0014682784,0.0005541136,0.0031253987,0.0018462198,0.200268],"genre_scores_gemma":[0.99001217,0.000011708359,0.006373523,0.0009309613,0.00022360947,0.000014741811,0.0005476358,0.00002443835,0.0018611853],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828255,0.000023039507,0.00034267228,0.0005538777,0.00031633832,0.00048154173],"domain_scores_gemma":[0.9988708,0.000076272765,0.00006923123,0.00062779913,0.000015959427,0.00033994677],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004191891,0.00024514625,0.0002828847,0.000075204836,0.00015546009,0.00060248026,0.0010129557,0.000089194386,0.000023510238],"category_scores_gemma":[0.000010803609,0.00022711793,0.00008908117,0.000508053,0.00003892192,0.0030422704,0.00038991024,0.00014002225,0.0013389812],"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.000087851105,0.00033557005,0.5586457,0.000087138884,0.00007084564,0.0016303395,0.00061755336,0.0005073578,0.00023666228,0.00629006,0.38718358,0.04430734],"study_design_scores_gemma":[0.00036429078,0.00016560138,0.08324849,0.00008470414,0.0000022944364,0.00065839617,0.000011350718,0.0013784355,0.0010506118,0.00059852004,0.91178757,0.0006497098],"about_ca_topic_score_codex":0.0000052667797,"about_ca_topic_score_gemma":0.0000010674386,"teacher_disagreement_score":0.524604,"about_ca_system_score_codex":0.000014186639,"about_ca_system_score_gemma":0.000056154622,"threshold_uncertainty_score":0.9994386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023013349,0.00019070209,0.9919483,0.00037251873,0.00009339462,0.0002209365,0.000009660966,0.00010067092,0.00476246],"genre_scores_gemma":[0.9821317,0.0000022249121,0.016891023,0.0001803754,0.000095122676,0.0002123334,0.000010485902,0.0000025283432,0.0004741866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957806,0.000007893077,0.000093851515,0.00011160807,0.00004628163,0.00016229333],"domain_scores_gemma":[0.9997099,0.000029647053,0.000025082203,0.000118192176,0.00004435065,0.000072824456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013137802,0.000044957615,0.000058620048,0.000010377088,0.00018097763,0.00013662639,0.00009162378,0.000013525194,0.000004876259],"category_scores_gemma":[0.0000053723757,0.000039196126,0.0000150279675,0.00007477788,0.000010565366,0.00029527332,0.000029372393,0.000020190846,0.00002005947],"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.0000017366743,0.00006904238,0.001967828,0.000026589942,0.000012500728,1.9652414e-7,0.000118277225,0.000015244223,0.0005093846,0.91565764,0.01781549,0.06380609],"study_design_scores_gemma":[0.0005399281,0.00003601903,0.0045284564,0.000014875167,0.0000064332808,0.00004412661,0.00005624582,0.10685218,0.0060521737,0.0044482434,0.8771324,0.00028888712],"about_ca_topic_score_codex":0.000008765055,"about_ca_topic_score_gemma":0.0000015683949,"teacher_disagreement_score":0.9798304,"about_ca_system_score_codex":0.000007716231,"about_ca_system_score_gemma":0.000008283888,"threshold_uncertainty_score":0.15983717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9078361,0.0001417837,0.08175511,0.0011674184,0.00012883396,0.00031240634,0.000040706418,0.00024586535,0.008371792],"genre_scores_gemma":[0.97909117,0.00000526612,0.018213663,0.00006158525,0.000036414578,5.422643e-7,0.000009553381,0.000017464456,0.0025643443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978433,0.000065358494,0.00018541477,0.0007630362,0.0006289647,0.0005138759],"domain_scores_gemma":[0.9982397,0.00003687242,0.00026476037,0.00093537703,0.00024555056,0.00027775735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045127625,0.0002709599,0.00040945646,0.0002202053,0.00051565305,0.000111895824,0.0018691362,0.00017568015,0.00008419568],"category_scores_gemma":[0.0000197106,0.00029380555,0.00015698798,0.0009246305,0.00020038505,0.002055358,0.0006364735,0.00037597507,0.0005193714],"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.003581872,0.0030090904,0.3161734,0.0007170613,0.00240235,0.0051279617,0.042875174,0.032807276,0.07503369,0.49744588,0.0025655634,0.018260658],"study_design_scores_gemma":[0.025826953,0.0032996745,0.8894628,0.0034092008,0.00032914395,0.0007745068,0.0045743734,0.011190758,0.018914064,0.01836077,0.018967044,0.004890653],"about_ca_topic_score_codex":0.00025308286,"about_ca_topic_score_gemma":0.00019391617,"teacher_disagreement_score":0.57328945,"about_ca_system_score_codex":0.00025355833,"about_ca_system_score_gemma":0.00017702079,"threshold_uncertainty_score":0.9999514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015936873,0.0014107636,0.9898128,0.0017882837,0.0015876896,0.0006121775,0.000049622755,0.0001905296,0.0029544784],"genre_scores_gemma":[0.92302644,0.0002534744,0.07298324,0.0014800665,0.0017405321,0.000010945149,0.000038260212,0.000058044894,0.0004089773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467003,0.00012266751,0.00081717264,0.001889972,0.0016047345,0.0008954481],"domain_scores_gemma":[0.9966286,0.0006761348,0.00047207985,0.0016801133,0.00026883328,0.0002742269],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012893531,0.000732992,0.00083225925,0.0004329246,0.001500639,0.00079542235,0.0037426057,0.00044762468,0.000011372396],"category_scores_gemma":[0.00008226944,0.00054020516,0.00016947283,0.00072713924,0.0025217643,0.0007349553,0.0031697247,0.0012263304,0.000046554575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019920266,0.000058236037,0.00043537098,0.00010782889,0.00003346197,0.00027091097,0.006006296,0.0031099634,0.00036191725,0.02522432,0.0008770273,0.9634947],"study_design_scores_gemma":[0.0015843033,0.0006986142,0.0051874947,0.0023087086,0.00004380071,0.0012083185,0.0000031414227,0.7791775,0.0012094826,0.14657597,0.05895581,0.0030468737],"about_ca_topic_score_codex":0.00009262564,"about_ca_topic_score_gemma":0.00008295745,"teacher_disagreement_score":0.96044785,"about_ca_system_score_codex":0.00029344633,"about_ca_system_score_gemma":0.00039353213,"threshold_uncertainty_score":0.99979925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022551956,0.00009979227,0.9754418,0.0001547976,0.000109149696,0.00015228303,0.00023928635,0.00016286764,0.0010880678],"genre_scores_gemma":[0.99239594,0.000006194262,0.0071162395,0.000033575063,0.000020843143,0.000043840024,0.00017240079,0.0000034802317,0.00020746715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.000030171852,0.00030809618,0.00040591854,0.0001678805,0.00016362153],"domain_scores_gemma":[0.9983675,0.000059417533,0.00014763074,0.0011219451,0.00024373077,0.000059811195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020472937,0.00009677781,0.00025903885,0.00010079885,0.00007653315,0.00017501254,0.0005451144,0.000047874477,0.00002857529],"category_scores_gemma":[0.000023151846,0.00008218756,0.000118502896,0.0012000509,0.000031173815,0.00066779845,0.000024579207,0.000026865842,0.0000027526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013979068,0.00052658515,0.009352549,0.000069412636,0.0007031857,0.0000016698701,0.0016675037,0.009488767,0.005216548,0.93320125,0.0111526465,0.02860588],"study_design_scores_gemma":[0.00016764902,0.000093791794,0.01751843,0.000005382784,0.00008925174,7.0373443e-7,0.00024208004,0.9662145,0.00094019953,0.00077392755,0.013795816,0.00015829445],"about_ca_topic_score_codex":0.0001393557,"about_ca_topic_score_gemma":0.00009409531,"teacher_disagreement_score":0.969844,"about_ca_system_score_codex":0.000021373397,"about_ca_system_score_gemma":0.000015291558,"threshold_uncertainty_score":0.33515114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011854259,0.00025739465,0.97938037,0.00015445349,0.0006491905,0.00020597434,0.000050202718,0.00017813216,0.017938882],"genre_scores_gemma":[0.9959423,0.00000448345,0.0020313251,0.00004615267,0.000010982667,0.000055103534,0.0000107113965,0.0000052229793,0.0018937323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988038,0.000104431325,0.00030661217,0.00030723552,0.00019138728,0.00028651723],"domain_scores_gemma":[0.9993244,0.000040772757,0.00004582666,0.00043992675,0.00005514202,0.000093949966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029957615,0.00011647433,0.00018498102,0.00007136007,0.00006977445,0.00019408675,0.00039974152,0.00006682157,0.00008492229],"category_scores_gemma":[0.00001864655,0.00010420942,0.00005151637,0.0006771784,0.000014769994,0.00045786073,0.000008373882,0.00011001662,0.00008583046],"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.000015319825,0.0011036303,0.0019196096,0.00024197304,0.00010433059,0.00031903642,0.0020748044,0.06541345,0.0016206792,0.8856407,0.019719822,0.021826636],"study_design_scores_gemma":[0.0036947832,0.000115293886,0.0062026195,0.00024265352,0.000012140621,0.0003156482,0.0013019097,0.5510394,0.0021258171,0.0011557264,0.43240696,0.0013870536],"about_ca_topic_score_codex":0.00023082127,"about_ca_topic_score_gemma":0.00006584569,"teacher_disagreement_score":0.9947569,"about_ca_system_score_codex":0.000067132394,"about_ca_system_score_gemma":0.00006650792,"threshold_uncertainty_score":0.4249537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4947014,0.00046222945,0.43048453,0.040752493,0.00028918407,0.00044658675,0.000005258727,0.00013208618,0.03272624],"genre_scores_gemma":[0.99772984,0.000025427897,0.0008425494,0.0009711659,0.000007931703,0.000011279627,0.0000031258887,0.0000013093485,0.00040736934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951833,0.00004269171,0.00012036947,0.00014204287,0.00009342013,0.00008312215],"domain_scores_gemma":[0.9997046,0.000026828438,0.000030520765,0.00019594937,0.000027580994,0.0000145405065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016134798,0.000048987175,0.00004994157,0.00002282991,0.00004508065,0.00016039913,0.00022034327,0.000026992486,0.000014540433],"category_scores_gemma":[0.0000056738468,0.000032556432,0.000008574666,0.00025757033,0.000005350499,0.0003499079,0.000013439322,0.000046456687,0.000047989804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009549858,0.0005187266,0.00755989,0.000175311,0.000027503736,0.000053694246,0.06388961,0.0013561269,0.006108936,0.30614644,0.033936232,0.58021796],"study_design_scores_gemma":[0.00013361829,0.00001286729,0.020960165,0.000010280871,6.085471e-7,0.000018671197,0.0001907041,0.97287434,0.000020465008,0.0004133287,0.005304681,0.000060242284],"about_ca_topic_score_codex":0.00023261661,"about_ca_topic_score_gemma":0.0021401623,"teacher_disagreement_score":0.9715182,"about_ca_system_score_codex":0.000010509625,"about_ca_system_score_gemma":0.0000030633623,"threshold_uncertainty_score":0.15467325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07271711,0.00006686631,0.9244107,0.0001710691,0.0014175805,0.00040265254,0.000017660488,0.000054331205,0.00074206124],"genre_scores_gemma":[0.9949176,0.0000034245056,0.004971754,0.000020794081,0.000024780678,0.00004173737,0.000001508962,0.000004706515,0.000013745471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763227,0.00015424012,0.0006853512,0.00045776792,0.0006877822,0.00038258894],"domain_scores_gemma":[0.9984269,0.00024500286,0.00016204905,0.0005250362,0.00046965078,0.00017134042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077972555,0.0001606844,0.00038565972,0.00026085012,0.00012432408,0.00011153257,0.0013574917,0.00006675525,0.00006760666],"category_scores_gemma":[0.000017948041,0.00013824925,0.00009414807,0.0017153638,0.0017633495,0.00072265154,0.00005272782,0.00018287693,0.000014548817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059311956,0.00033046748,0.000060742528,0.000075863965,0.000008761467,0.0000028906252,0.000923816,0.013516929,0.0038813106,0.9424234,0.000022700495,0.038747154],"study_design_scores_gemma":[0.0005139718,0.00014124627,0.0041160462,0.00017679375,0.000005374773,0.000039428327,0.00008498258,0.987449,0.004590341,0.0026619374,0.000031345615,0.00018951649],"about_ca_topic_score_codex":0.00015772012,"about_ca_topic_score_gemma":0.0000035801509,"teacher_disagreement_score":0.9739321,"about_ca_system_score_codex":0.000060575687,"about_ca_system_score_gemma":0.00023226693,"threshold_uncertainty_score":0.64971346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10904575,0.000098256765,0.8878162,0.0001677564,0.00011826166,0.00009168202,0.0000034851423,0.000075452146,0.0025831643],"genre_scores_gemma":[0.9972366,0.0000025458257,0.002507424,0.000103593644,0.000034692446,0.0000021461599,0.00001768508,0.0000039131373,0.00009140468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892205,0.000029510351,0.00036559757,0.00021979549,0.00016305305,0.0002999899],"domain_scores_gemma":[0.99935216,0.00008120035,0.00010620438,0.0003066052,0.000097915276,0.00005589904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007016075,0.000094537274,0.00017669311,0.000038639428,0.00003755922,0.000046687353,0.0004194117,0.00007612309,0.00000913011],"category_scores_gemma":[0.000016987608,0.000087630855,0.0000331914,0.0007880958,0.000011155368,0.0003329673,0.000114186936,0.00009275375,0.000019930952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011432119,0.00091232255,0.1238406,0.00036388313,0.00010862169,0.00024183268,0.0029217878,0.12201539,0.01853827,0.47622722,0.005805337,0.2489104],"study_design_scores_gemma":[0.00043183684,0.000026576268,0.12669897,0.00018936742,0.0000019227396,0.000013312669,0.000055193213,0.86876994,0.0016634512,0.00044984726,0.0014752864,0.00022428416],"about_ca_topic_score_codex":0.0005776061,"about_ca_topic_score_gemma":0.0006345771,"teacher_disagreement_score":0.88819087,"about_ca_system_score_codex":0.000049710547,"about_ca_system_score_gemma":0.000023032973,"threshold_uncertainty_score":0.35734826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054600332,0.00014711074,0.8288938,0.00018568698,0.0008284747,0.00008235649,0.0000026079665,0.00018619487,0.115073435],"genre_scores_gemma":[0.9796167,0.0000028093527,0.018817581,0.00014556882,0.0001518661,0.0000035610467,0.000002894604,0.000003548027,0.0012554944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992172,0.000028879105,0.00011672061,0.00015907802,0.00019161914,0.00028647692],"domain_scores_gemma":[0.99956053,0.000022582457,0.000036808276,0.00026787154,0.000030816125,0.000081398655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012216781,0.0000837207,0.000094149655,0.000015934955,0.000099162644,0.00005785483,0.00030920227,0.000036807254,0.00011734769],"category_scores_gemma":[0.000009991703,0.000065457265,0.00004511569,0.00017476633,0.000020180385,0.0012170796,0.000113804155,0.0000644554,0.00030736535],"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.0000049707323,0.00015589912,0.060192186,0.000016739808,0.000045958375,0.000005167829,0.015499761,0.00016124694,0.0008807091,0.8815435,0.035978045,0.005515802],"study_design_scores_gemma":[0.0012489037,0.00017500772,0.30662775,0.00011229722,0.00001834326,0.000058973037,0.0024963103,0.036538042,0.0037571834,0.0015964218,0.64639276,0.000977973],"about_ca_topic_score_codex":0.00004512879,"about_ca_topic_score_gemma":9.476366e-7,"teacher_disagreement_score":0.92501634,"about_ca_system_score_codex":0.00004156979,"about_ca_system_score_gemma":0.000012358978,"threshold_uncertainty_score":0.39506623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012674218,0.00007787735,0.98441917,0.0012640211,0.0005759592,0.00023873686,0.000023978002,0.00010365497,0.00062239805],"genre_scores_gemma":[0.9722931,8.9635057e-7,0.02640187,0.00013322492,0.00008115607,0.00009942555,0.0000031940374,0.0000056815566,0.0009814921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992813,0.00001472053,0.00017366318,0.00021405442,0.00010700455,0.00020924963],"domain_scores_gemma":[0.9994412,0.0001257888,0.00004062884,0.0002440819,0.00009905926,0.000049218794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003430347,0.000078580786,0.00008293817,0.000023129662,0.00030244887,0.00024805617,0.00035894112,0.0000518471,0.000010348818],"category_scores_gemma":[0.000041943415,0.000051024443,0.000045170484,0.00015789023,0.000032180804,0.00035337164,0.000016800384,0.00014823479,0.000005599767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013292796,0.00006319289,0.00020668347,0.00006682569,0.0000068903582,0.00020055322,0.0006077583,0.00011578449,0.00033801832,0.015790734,0.0049115317,0.9776787],"study_design_scores_gemma":[0.0033833708,0.00012978939,0.0033401097,0.00013416132,0.00001197499,0.00536177,0.0015786925,0.594879,0.0039130384,0.013425193,0.37276742,0.0010755453],"about_ca_topic_score_codex":0.00005300213,"about_ca_topic_score_gemma":0.0015410031,"teacher_disagreement_score":0.9766032,"about_ca_system_score_codex":0.000012324104,"about_ca_system_score_gemma":0.000090962654,"threshold_uncertainty_score":0.23920113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018039888,0.00008991009,0.9418434,0.011384044,0.00033603943,0.00030587174,0.00001533809,0.00019031891,0.027795209],"genre_scores_gemma":[0.9924699,0.000008579451,0.0053378674,0.0016559869,0.000075057156,0.00001306294,0.000040563853,0.00000420772,0.00039478927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998315,0.000051773375,0.0004081795,0.00041586923,0.00042982955,0.0003793821],"domain_scores_gemma":[0.9985395,0.000060413062,0.000084155756,0.001068467,0.000041189414,0.00020626944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009313463,0.000079544516,0.00015716127,0.000048414662,0.000041201198,0.00032350048,0.0040819827,0.000063495114,0.00043909193],"category_scores_gemma":[0.00013084762,0.00006175582,0.000013482258,0.00036217365,0.000018776362,0.0019425544,0.0014408797,0.00014477382,0.00024317592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017184987,0.00019169792,0.08281332,0.00007651494,0.000012202576,0.00011511025,0.00025285274,0.00002384214,0.00002134547,0.062336683,0.3048458,0.5493089],"study_design_scores_gemma":[0.0004788365,0.0000203018,0.098707356,0.000077489625,8.206744e-7,0.000030952713,0.000049067923,0.8705855,0.000025603204,0.0013877568,0.028414045,0.00022225067],"about_ca_topic_score_codex":0.005293573,"about_ca_topic_score_gemma":0.00068608974,"teacher_disagreement_score":0.97443,"about_ca_system_score_codex":0.000017942362,"about_ca_system_score_gemma":0.00016710036,"threshold_uncertainty_score":0.80023336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20559345,0.00003878028,0.7912991,0.0001280873,0.0022403416,0.00007401109,0.000005131997,0.000022313767,0.0005987883],"genre_scores_gemma":[0.732218,0.000006341977,0.26767924,0.000024025947,0.00006533819,7.36336e-7,0.0000015836471,0.0000029712073,0.00000171881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739575,0.00006506264,0.0010142408,0.00022056558,0.0011371057,0.00016725296],"domain_scores_gemma":[0.9943232,0.000111457084,0.0013016721,0.00027906313,0.0038849632,0.00009964183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918176,0.000115194256,0.0002664371,0.0006351385,0.00009190457,0.00013920746,0.0027890038,0.000032578697,0.000007812419],"category_scores_gemma":[0.000089776506,0.00010617802,0.00012717691,0.00084004435,0.0002780693,0.0020183935,0.0002981388,0.000112906535,0.000005020774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022222976,0.005109981,0.033134,0.00023664354,0.0010530828,0.00012800864,0.030258514,0.016652286,0.064928524,0.55466384,0.0006351316,0.29297775],"study_design_scores_gemma":[0.002291978,0.00074240897,0.15558808,0.00065683585,0.000034019013,0.0005495008,0.000121869045,0.79589796,0.02947812,0.012984664,0.0012283707,0.00042622624],"about_ca_topic_score_codex":0.000032007007,"about_ca_topic_score_gemma":0.0000018867127,"teacher_disagreement_score":0.7792457,"about_ca_system_score_codex":0.000102943406,"about_ca_system_score_gemma":0.0003958463,"threshold_uncertainty_score":0.51827097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777707,0.00031764538,0.9712418,0.00023433995,0.0013129554,0.00036869402,0.00002705425,0.0001936317,0.009526212],"genre_scores_gemma":[0.9904683,0.0000023485313,0.008217713,0.000059232392,0.00016618434,0.000129664,0.000010834891,0.000009207186,0.0009365023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982995,0.000049258346,0.0004187564,0.00031170566,0.0004702905,0.0004505141],"domain_scores_gemma":[0.99939716,0.000030745072,0.000064463784,0.0002750236,0.00006716053,0.0001654403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005147378,0.00016763431,0.00022276449,0.000107113316,0.00010304767,0.00006345517,0.00036741045,0.000093261035,0.000068405745],"category_scores_gemma":[0.0000026436664,0.00014882423,0.00012262205,0.00033270643,0.00001662741,0.0009911595,0.000013703591,0.00018171723,0.00012997485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019929433,0.0038000005,0.034964677,0.0020425976,0.00035754743,0.00017419276,0.006114997,0.038658403,0.0055473344,0.769889,0.0021418594,0.13611011],"study_design_scores_gemma":[0.0075105694,0.0003308065,0.053934205,0.001452538,0.00007527359,0.0021162785,0.005576549,0.8291312,0.02767122,0.0003447256,0.068858884,0.0029977532],"about_ca_topic_score_codex":0.00008682516,"about_ca_topic_score_gemma":0.000019956511,"teacher_disagreement_score":0.9736906,"about_ca_system_score_codex":0.00019901895,"about_ca_system_score_gemma":0.000095922536,"threshold_uncertainty_score":0.6068876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008094969,0.0013739038,0.9869502,0.0002863564,0.001978626,0.00062441843,0.00012484657,0.00017632236,0.0003903399],"genre_scores_gemma":[0.99140114,0.000006583343,0.008224578,0.00004290297,0.00020206165,0.00002477542,0.000037664897,0.000012435881,0.000047875685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703866,0.00048091175,0.00090878736,0.00032445017,0.0004725972,0.00077457353],"domain_scores_gemma":[0.99615043,0.0019092546,0.0006208143,0.000773053,0.00036753927,0.00017889266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025638891,0.00026046936,0.0007022837,0.00004547714,0.00048199427,0.0001926503,0.0011696924,0.000101214784,0.0000038806343],"category_scores_gemma":[0.0005024263,0.00016090847,0.0002254524,0.0007842351,0.00026655872,0.00015927361,0.00027629806,0.00023134516,0.000009650431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026989733,0.0005897211,0.0019726213,0.00015476115,0.00054497115,0.000042392272,0.0024509688,0.003833033,0.0002041211,0.13805689,0.010979299,0.83847225],"study_design_scores_gemma":[0.02330962,0.00005249243,0.0006711123,0.00017351762,0.00004014913,0.00014648012,0.00030791815,0.96010023,0.0038222251,0.00055703067,0.010378562,0.00044068717],"about_ca_topic_score_codex":0.000061448874,"about_ca_topic_score_gemma":0.0000026400303,"teacher_disagreement_score":0.98330617,"about_ca_system_score_codex":0.000059165,"about_ca_system_score_gemma":0.000121163255,"threshold_uncertainty_score":0.6561657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003182544,0.00016291163,0.85380876,0.00027503778,0.0004890636,0.000025267642,5.084202e-7,0.00012698359,0.14192891],"genre_scores_gemma":[0.98776925,7.985889e-7,0.009516689,0.00027767182,0.00008222483,0.0000027754008,3.930001e-7,0.0000011548976,0.0023490174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996359,0.000008267127,0.000057336736,0.00006238862,0.000075458345,0.00016067972],"domain_scores_gemma":[0.99968994,0.000007623366,0.000012264629,0.00021069015,0.000012989254,0.0000665047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010378051,0.00003187184,0.0000394412,0.000010062929,0.00002592154,0.000037723512,0.00023961623,0.000014467276,0.000032484877],"category_scores_gemma":[0.000003853654,0.000023931807,0.00001714873,0.00010088176,0.000004464339,0.0004085728,0.00004733936,0.000021249472,0.0005977451],"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":[1.6494029e-7,0.00003265041,0.003772798,0.0000023055247,0.000002710598,7.76521e-7,0.00017264675,0.0000018050785,0.00018030374,0.9346462,0.031163618,0.030024022],"study_design_scores_gemma":[0.00013838401,0.0000111229965,0.026884424,0.000005088568,7.765521e-7,0.000023855757,0.00002256965,0.0058316463,0.0013495146,0.0005981759,0.9649799,0.00015454929],"about_ca_topic_score_codex":0.000011813666,"about_ca_topic_score_gemma":5.4562753e-7,"teacher_disagreement_score":0.9845867,"about_ca_system_score_codex":0.0000057234297,"about_ca_system_score_gemma":0.0000047369113,"threshold_uncertainty_score":0.76830035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074365893,0.00009989738,0.75277734,0.002448283,0.00033509042,0.00019099857,9.701894e-7,0.0002860736,0.23642479],"genre_scores_gemma":[0.97760046,0.0000021068668,0.016954634,0.00074875104,0.000019149342,0.000025012392,8.319666e-7,0.0000028408153,0.0046462417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936277,0.000015624433,0.0001336559,0.00018804516,0.00012446872,0.0001754096],"domain_scores_gemma":[0.9994217,0.000013899674,0.000031110474,0.00037423856,0.00008441042,0.00007463565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000062013154,0.000068167625,0.000094007206,0.000020955715,0.000058758833,0.000184198,0.0004061262,0.000027335635,0.00015816347],"category_scores_gemma":[0.000010498881,0.000051719893,0.000031191412,0.00015084445,0.000024842091,0.00043798494,0.00006018643,0.000041528347,0.0012604016],"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":[6.6260935e-7,0.00007103811,0.011183274,0.000017167546,0.000023716517,0.0000065889894,0.00028484102,0.000018298293,0.00087218045,0.72298187,0.16169225,0.102848135],"study_design_scores_gemma":[0.0014362279,0.00014574731,0.066137224,0.00006596716,0.0000062309578,0.000094508054,0.00040070538,0.23008458,0.0011663766,0.019834433,0.67957455,0.0010534609],"about_ca_topic_score_codex":0.00037482922,"about_ca_topic_score_gemma":0.000011650134,"teacher_disagreement_score":0.9701638,"about_ca_system_score_codex":0.000008300641,"about_ca_system_score_gemma":0.00003205941,"threshold_uncertainty_score":0.99951726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072027417,0.00010147654,0.9918361,0.0003207916,0.00063506234,0.00024126306,0.000008476747,0.0002197104,0.005916852],"genre_scores_gemma":[0.93831885,0.000014235777,0.058607627,0.0026124031,0.00031144856,0.00006450619,0.000048808513,0.0000052406676,0.000016900907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799234,0.00005604484,0.0005507119,0.00030061434,0.0007668889,0.00033342358],"domain_scores_gemma":[0.998432,0.000043511154,0.00029082168,0.00052051566,0.00055462023,0.00015854293],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002565,0.00015399719,0.00020980518,0.00022470561,0.0004254961,0.00196332,0.000956916,0.000052712356,0.0000013473111],"category_scores_gemma":[0.000046486082,0.00012940436,0.000027506063,0.00087542017,0.00012830405,0.0060209176,0.0002089469,0.00008650527,0.000026659982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015926677,0.000015310297,0.00022989618,0.00020514654,0.0000047389854,5.7772945e-7,0.00045557343,0.00030752807,0.0005046102,0.08271986,0.01935132,0.8962038],"study_design_scores_gemma":[0.00014276443,0.000046754063,0.00017094827,0.000091556205,8.3457326e-7,0.000012254031,0.000014115801,0.67774594,0.00060079707,0.000012512413,0.32101652,0.0001450081],"about_ca_topic_score_codex":0.000028828626,"about_ca_topic_score_gemma":5.7000225e-8,"teacher_disagreement_score":0.9375986,"about_ca_system_score_codex":0.00006288884,"about_ca_system_score_gemma":0.00009904369,"threshold_uncertainty_score":0.99907273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000763804,0.00022654161,0.9948777,0.0032475886,0.00014895102,0.0005837789,0.000020327301,0.000028101755,0.000103182276],"genre_scores_gemma":[0.97768295,0.000020410811,0.021416178,0.00017514983,0.00003263705,0.000063857355,0.000014468835,0.000004025091,0.0005903173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921685,0.000039264865,0.0002585749,0.00013638612,0.00022477108,0.00012416292],"domain_scores_gemma":[0.99897593,0.00026009823,0.00014482846,0.00030729134,0.00028867234,0.000023155219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021985521,0.00007096607,0.00010791422,0.000014913722,0.00013246549,0.00007010827,0.00039240217,0.000036342077,0.0000032706228],"category_scores_gemma":[0.00002754118,0.00003739121,0.00010761531,0.00019347272,0.000052712403,0.00019863287,0.0000038912503,0.000040240266,5.291768e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013681641,0.00029932242,0.000065916254,0.000043918077,0.000055416964,6.0635796e-7,0.0006577446,0.041710965,0.00038978964,0.110343404,0.007431989,0.8388641],"study_design_scores_gemma":[0.0013756047,0.00060617994,0.004443122,0.000111399335,0.000030580373,0.0000049578084,0.00022865312,0.80732954,0.0074880007,0.0019806423,0.17619288,0.00020842187],"about_ca_topic_score_codex":0.000025969695,"about_ca_topic_score_gemma":0.000025860541,"teacher_disagreement_score":0.9769192,"about_ca_system_score_codex":0.0000109547445,"about_ca_system_score_gemma":0.0000645664,"threshold_uncertainty_score":0.15247694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008028727,0.000017776814,0.6514865,0.00005630898,0.00016263881,0.000019853424,2.98329e-7,0.0001104983,0.3473432],"genre_scores_gemma":[0.9614332,9.091124e-7,0.034262873,0.0003019193,0.000019029281,0.0000034578195,2.6033652e-7,0.0000014599054,0.0039769406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966407,0.0000069567395,0.00006568428,0.00010697503,0.000059320286,0.00009698868],"domain_scores_gemma":[0.9996721,0.0000032459336,0.000013879439,0.00025488934,0.000018863058,0.00003699795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054633914,0.000033510973,0.000040871884,0.000011576534,0.000021884724,0.000027041286,0.0003730277,0.000014620136,0.00005778257],"category_scores_gemma":[0.0000021942176,0.000025543295,0.000017580358,0.000102804814,0.000006301496,0.00019014454,0.000048567526,0.00002126445,0.00024313042],"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":[3.5433123e-7,0.000017233642,0.00046810994,0.0000011516129,0.000002126413,0.000007024325,0.00017507545,3.161683e-7,0.00004398519,0.97157115,0.012375808,0.0153376395],"study_design_scores_gemma":[0.00056304515,0.00012806922,0.057426468,0.000019660982,0.0000024828491,0.000065522036,0.000065363136,0.039961822,0.0072316,0.012929429,0.88109285,0.00051368243],"about_ca_topic_score_codex":0.00005032658,"about_ca_topic_score_gemma":0.0000016023282,"teacher_disagreement_score":0.9606303,"about_ca_system_score_codex":0.0000033867695,"about_ca_system_score_gemma":0.000007718731,"threshold_uncertainty_score":0.31250307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034982928,0.0023550687,0.96460056,0.028327357,0.000654906,0.00036786395,0.000009618193,0.000051454652,0.00013489873],"genre_scores_gemma":[0.9402634,0.0004687347,0.054857124,0.0036252043,0.00056071434,0.00011728928,0.000012234654,0.000009389161,0.000085931504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988103,0.000013925326,0.0004167384,0.00017183549,0.0003792321,0.00020798466],"domain_scores_gemma":[0.99903846,0.000054187072,0.0002446405,0.00018173887,0.0003835646,0.00009739212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068030984,0.000086157226,0.0001460843,0.00029523915,0.00008731648,0.000032166863,0.0009956204,0.00013364348,0.0000043484188],"category_scores_gemma":[0.000010463071,0.00007448347,0.00004723979,0.00034342305,0.00003618892,0.00008561024,0.0002065359,0.00021276547,0.000001797807],"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.000033402062,0.0000636231,0.00081617903,0.0001132644,0.00013168923,0.00013177501,0.0000723053,0.00012453606,0.000013744397,0.5987599,0.0013131845,0.39842638],"study_design_scores_gemma":[0.0009287235,0.00015060758,0.0012219935,0.00026177047,0.000012479718,0.00032280892,0.00018435548,0.0011047721,0.00009122579,0.053501032,0.94208807,0.00013216716],"about_ca_topic_score_codex":0.000012396768,"about_ca_topic_score_gemma":0.000077403885,"teacher_disagreement_score":0.94077486,"about_ca_system_score_codex":0.000052118878,"about_ca_system_score_gemma":0.000040971867,"threshold_uncertainty_score":0.30373478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047662805,0.00018661296,0.9896952,0.00036267107,0.0014736042,0.000891305,0.006437166,0.00021524214,0.00026159696],"genre_scores_gemma":[0.9465595,0.000032814187,0.050208434,0.00027361495,0.00015676889,0.00070038013,0.0012045901,0.00003777323,0.0008261548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746805,0.00021141283,0.00044370687,0.0012078546,0.00034006077,0.0003289267],"domain_scores_gemma":[0.98983574,0.00020056467,0.000308832,0.0092917355,0.00018182457,0.00018131883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010192634,0.0002115714,0.00027013183,0.000109611574,0.0003662662,0.0002860872,0.0029407775,0.00006847743,0.0000086001255],"category_scores_gemma":[0.0002264319,0.00019783867,0.00005821977,0.00040042688,0.0000319423,0.0015708968,0.00003012916,0.00015208937,0.00006759712],"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.00023583941,0.0058505023,0.0009087333,0.0014754372,0.0011978914,0.00015396437,0.0018328663,0.03085976,0.0047455574,0.708931,0.09163543,0.15217301],"study_design_scores_gemma":[0.0015546263,0.0001926529,0.00012842102,0.00032055992,0.00004436214,0.00014060538,0.0006725869,0.32645002,0.0023421422,0.00063141726,0.6668081,0.0007144853],"about_ca_topic_score_codex":0.00030002606,"about_ca_topic_score_gemma":0.000102716214,"teacher_disagreement_score":0.94608283,"about_ca_system_score_codex":0.0000621909,"about_ca_system_score_gemma":0.00007522446,"threshold_uncertainty_score":0.8067627},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030458039,0.0006266505,0.9923627,0.000095599025,0.0015941578,0.00058781484,0.0009109736,0.0002806211,0.000495672],"genre_scores_gemma":[0.9983792,0.00005301585,0.00090832525,0.0000774998,0.00003295009,0.00028569906,0.000025073727,0.000015792908,0.0002224525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975018,0.00021433971,0.0007285856,0.00066831865,0.00038265984,0.00050428574],"domain_scores_gemma":[0.998792,0.00013997819,0.00016270237,0.00051575864,0.00012624654,0.00026329255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036025685,0.00034736216,0.0005227568,0.00018860828,0.000248525,0.00013268593,0.00047806514,0.00023225557,0.00003754668],"category_scores_gemma":[0.0000068071954,0.00032310755,0.00015048198,0.0005313081,0.00009939199,0.00058799353,0.0000019964834,0.00040359446,0.00006386563],"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.0022625544,0.007580903,0.0056031994,0.0013553915,0.0013184955,0.0012309154,0.010277726,0.83771944,0.0015679369,0.040401816,0.008108846,0.08257275],"study_design_scores_gemma":[0.031220865,0.0017349978,0.025053542,0.0014188624,0.00022383184,0.001284152,0.002215345,0.91803825,0.00056262186,0.0020863158,0.011934275,0.0042269244],"about_ca_topic_score_codex":0.0005493288,"about_ca_topic_score_gemma":0.00006860401,"teacher_disagreement_score":0.9953334,"about_ca_system_score_codex":0.000097107724,"about_ca_system_score_gemma":0.00010027801,"threshold_uncertainty_score":0.9999221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088857405,0.0018168048,0.90775687,0.000379078,0.000590353,0.00024423574,0.00001116091,0.000005792108,0.0003383244],"genre_scores_gemma":[0.9812409,0.0018572854,0.016624855,0.00020385154,0.00003896835,0.000005167375,0.0000020984078,0.0000024023586,0.000024436013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998592,0.00004464959,0.0007671307,0.00005957982,0.0004136582,0.00012293992],"domain_scores_gemma":[0.99688816,0.0006066626,0.0008902216,0.0000642428,0.0015043598,0.00004635812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045068428,0.00009977772,0.00014242083,0.000068413676,0.00008325173,0.00034047375,0.00048547023,0.000030809108,0.0000061137216],"category_scores_gemma":[0.00015877814,0.00006108689,0.00004803214,0.00011291511,0.00012525544,0.0015794783,0.00011601825,0.00016089293,0.0000044985845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051459945,0.000029859979,0.0005007809,0.000020094378,0.00019331493,0.0000039005363,0.007788628,0.000067580775,0.00034554448,0.028549567,0.00046429032,0.961985],"study_design_scores_gemma":[0.0034722371,0.0024906376,0.027592862,0.0030802074,0.00012370416,0.003041048,0.06271231,0.5477027,0.17059015,0.15566722,0.022198526,0.0013283979],"about_ca_topic_score_codex":0.000033796146,"about_ca_topic_score_gemma":0.000002901619,"teacher_disagreement_score":0.9606566,"about_ca_system_score_codex":0.000021272124,"about_ca_system_score_gemma":0.00005496268,"threshold_uncertainty_score":0.3283196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043462113,0.04150423,0.9098304,0.00044834343,0.002315146,0.0017502018,0.00037037345,0.00019721041,0.000121998644],"genre_scores_gemma":[0.9865558,0.0010678732,0.011779078,0.00009517392,0.00019103286,0.00006263683,0.0001278197,0.000025003741,0.000095564144],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677044,0.00031346592,0.0014427528,0.0005618794,0.0005301106,0.00038135832],"domain_scores_gemma":[0.9966297,0.000159078,0.0008514545,0.0015434353,0.0006810929,0.0001352463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015291842,0.00032042808,0.0008692039,0.000057336318,0.00022799884,0.00021225028,0.0017290788,0.00014101385,0.000016802082],"category_scores_gemma":[0.0013589623,0.0002630492,0.00013748647,0.0009247695,0.00004057053,0.000842687,0.00030258388,0.0002903701,0.000028565019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035824018,0.0027198747,0.048118632,0.14507405,0.0017671394,0.00029846767,0.0034203955,0.09361754,0.30778718,0.11836541,0.027719589,0.2510759],"study_design_scores_gemma":[0.0012321335,0.0001442946,0.0029331557,0.032349993,0.00014879896,0.0005060121,0.00008593454,0.9381038,0.0015583124,0.000075757634,0.021525687,0.0013361011],"about_ca_topic_score_codex":0.00028247366,"about_ca_topic_score_gemma":0.000019497407,"teacher_disagreement_score":0.9430937,"about_ca_system_score_codex":0.000056436013,"about_ca_system_score_gemma":0.00020883982,"threshold_uncertainty_score":0.9999822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14916563,0.000015672344,0.8179658,0.0009814202,0.00046068156,0.00008026576,0.0000035657404,0.000265722,0.03106124],"genre_scores_gemma":[0.9427597,4.5616073e-7,0.054818165,0.00017404005,0.00007903115,0.00000859574,0.000005894661,0.0000031202137,0.0021509947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992901,0.000008787122,0.00013116404,0.00030565623,0.00012224128,0.00014205949],"domain_scores_gemma":[0.9988595,0.000015135861,0.000045365116,0.0009509666,0.00006832447,0.000060658425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017937245,0.000059548387,0.000066419256,0.000021118462,0.000062409476,0.0001678072,0.0004280106,0.000045638877,0.00003545249],"category_scores_gemma":[0.000026989019,0.000050542516,0.000029636343,0.00017486971,0.000016645716,0.0003412828,0.00007517694,0.00009114907,0.00032225743],"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.000003128927,0.00019585628,0.001669487,0.00000989055,0.000008376502,0.000008469463,0.00040691043,0.00009474736,0.33633727,0.46032372,0.026144268,0.17479788],"study_design_scores_gemma":[0.00034457658,0.0000792261,0.009751538,0.000009225049,0.0000023284929,0.00007562828,0.000014185073,0.1682372,0.039794445,0.0007217697,0.78063655,0.00033335245],"about_ca_topic_score_codex":0.000036038262,"about_ca_topic_score_gemma":0.000024279821,"teacher_disagreement_score":0.79359406,"about_ca_system_score_codex":0.000007547078,"about_ca_system_score_gemma":0.000015415999,"threshold_uncertainty_score":0.4142075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007954379,0.000029744884,0.98971266,0.00012710155,0.00004732023,0.0012832162,0.000035185963,0.00030846216,0.00050195673],"genre_scores_gemma":[0.9689363,0.000004417316,0.030170228,0.00004186643,0.000002059439,0.00079158216,0.00004160567,0.0000020162267,0.000009905474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928784,0.0000134114825,0.000342123,0.00008576642,0.000110653404,0.00016020265],"domain_scores_gemma":[0.9992895,0.000014157919,0.00019438048,0.00030839047,0.00016294193,0.000030596988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019962655,0.00007289584,0.00012679922,0.00014173388,0.00008380617,0.00005232811,0.00025858285,0.00012561156,0.000005345821],"category_scores_gemma":[0.00017336216,0.0000664776,0.000018365366,0.00045730648,0.00005368912,0.0014633457,0.00005093416,0.000077583965,0.000015402518],"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.0000066134953,0.000037178863,0.006939263,0.00010974171,0.000009979792,9.61618e-7,0.00027518094,0.00006383647,0.000096229065,0.8149971,0.00048259727,0.17698133],"study_design_scores_gemma":[0.00266975,0.00039966675,0.008904892,0.00014811651,0.000007522956,0.0002701691,0.00055396534,0.01285029,0.02926668,0.023517579,0.92084795,0.0005634128],"about_ca_topic_score_codex":0.000005764721,"about_ca_topic_score_gemma":0.0000011923704,"teacher_disagreement_score":0.96098197,"about_ca_system_score_codex":0.000016606546,"about_ca_system_score_gemma":0.000050345632,"threshold_uncertainty_score":0.2710878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005931524,0.0012566147,0.99157983,0.00036304927,0.0013542597,0.00064597256,0.0000038970197,0.00018658632,0.004016623],"genre_scores_gemma":[0.47349647,0.00005505534,0.5247823,0.0008164496,0.0004555137,0.000018352719,0.000013312518,0.0000647721,0.00029778204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947759,0.000057127876,0.0008333033,0.0018375322,0.0010571056,0.0014390372],"domain_scores_gemma":[0.99743277,0.00040981767,0.00034356324,0.0013143431,0.00023094127,0.00026856226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011731059,0.00070000073,0.0008768598,0.00047674731,0.0003124854,0.0010605049,0.0031339254,0.00037516636,0.000039073057],"category_scores_gemma":[0.00003146056,0.00059209164,0.000116563024,0.0011549369,0.00040173344,0.0008535585,0.00084478565,0.0010654734,0.000064400265],"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.000012711604,0.000025772255,0.0030556882,0.000052528674,0.000021793563,0.00024538665,0.00040986933,0.69588035,0.0000125332135,0.028520383,0.000065008644,0.271698],"study_design_scores_gemma":[0.00093629037,0.00014233912,0.0008924236,0.003082456,0.0000098105,0.00015168932,0.0000013100058,0.95506984,0.000063234766,0.034371976,0.0040030372,0.0012756066],"about_ca_topic_score_codex":0.000552404,"about_ca_topic_score_gemma":0.001007666,"teacher_disagreement_score":0.4729033,"about_ca_system_score_codex":0.00037975542,"about_ca_system_score_gemma":0.0005928006,"threshold_uncertainty_score":0.9999765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027386323,0.00009300806,0.92965823,0.011952859,0.00047375594,0.0002497761,0.000016059232,0.00023984181,0.029930124],"genre_scores_gemma":[0.22616324,0.000028313627,0.7468758,0.01560675,0.00049693877,0.00008376044,0.00006273781,0.000047660084,0.010634747],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972593,0.00021385652,0.0006132293,0.0007521732,0.00052845594,0.00063294946],"domain_scores_gemma":[0.99769664,0.00025548847,0.0002183967,0.0014849949,0.00017699935,0.00016751103],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011995155,0.00027730927,0.000375932,0.00013579962,0.000120584584,0.0004173536,0.0012209634,0.00015116228,0.00024209595],"category_scores_gemma":[0.0003040559,0.00024595446,0.00011002001,0.00043934153,0.000050510214,0.0013432633,0.00032745017,0.00029147213,0.0022611117],"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.00011336606,0.0015757367,0.045650136,0.0002910049,0.00023077222,0.000012805669,0.014684704,0.00024882163,0.019765686,0.27199182,0.5554854,0.089949705],"study_design_scores_gemma":[0.00044994146,0.00003828738,0.0027549353,0.00003603797,0.00000549713,0.000032179312,0.00003805193,0.0008777468,0.0001160514,0.007425971,0.9878795,0.00034577333],"about_ca_topic_score_codex":0.0012334043,"about_ca_topic_score_gemma":0.0010071298,"teacher_disagreement_score":0.4323941,"about_ca_system_score_codex":0.00007599494,"about_ca_system_score_gemma":0.000070986134,"threshold_uncertainty_score":0.9999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013513509,0.0005246236,0.99452597,0.00044929984,0.000058747097,0.0012763927,0.00081693416,0.000060458286,0.00093623996],"genre_scores_gemma":[0.92277676,0.000082043756,0.07137467,0.0001106705,0.0002637355,0.004476116,0.00045061915,0.000013618467,0.00045177594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990755,0.000014158156,0.00023589851,0.00034985362,0.00011873832,0.00020589808],"domain_scores_gemma":[0.99934036,0.00017530425,0.00007904989,0.00029668998,0.000035130008,0.00007344457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007884164,0.00012349509,0.00015777315,0.000021556556,0.0002085467,0.0002796298,0.00026826054,0.000054032796,0.0000042742718],"category_scores_gemma":[0.000008008802,0.00011453899,0.00003866369,0.00016049897,0.000054712775,0.0003940154,0.00002862616,0.000044925084,0.000025795543],"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.00000873834,0.00042477783,0.00043863233,0.00004666542,0.00003347863,0.0000016460766,0.00037225487,0.0009291008,0.007034662,0.08391637,0.0033101302,0.90348357],"study_design_scores_gemma":[0.0011150396,0.000058513022,0.016735945,0.000017724587,0.000016536093,0.0000036747583,0.00007476595,0.04864088,0.0024195611,0.0016164549,0.92897475,0.0003261552],"about_ca_topic_score_codex":0.000017729795,"about_ca_topic_score_gemma":0.00001147683,"teacher_disagreement_score":0.9256646,"about_ca_system_score_codex":0.000030496672,"about_ca_system_score_gemma":0.000028638175,"threshold_uncertainty_score":0.46707645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052678525,0.000049026887,0.6358638,0.000578059,0.0010054946,0.00039089975,0.000008054631,0.0004940194,0.30893216],"genre_scores_gemma":[0.9921832,7.8390286e-7,0.002273561,0.00075567863,0.000026247273,0.00003298584,9.5350106e-7,0.0000034463412,0.004723133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928606,0.000014421497,0.00012556162,0.00021753903,0.00014690483,0.00020948968],"domain_scores_gemma":[0.999371,0.00004927237,0.000019840778,0.00042798714,0.000050098475,0.00008179651],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005466111,0.00007887608,0.00009406066,0.000027042159,0.000058844867,0.00015892378,0.00043335013,0.000029320292,0.00015649668],"category_scores_gemma":[0.00001980954,0.000059622267,0.000026763948,0.00015971958,0.00001046693,0.00029433868,0.000046600086,0.000048086058,0.0028192482],"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.0000016744482,0.00014719485,0.00023259551,0.000024715351,0.000014107898,0.00003065361,0.0002595624,0.00026506156,0.0015727703,0.78537023,0.16400234,0.048079092],"study_design_scores_gemma":[0.0015626684,0.0007598028,0.039251294,0.00018303061,0.000007017574,0.00008992592,0.00012472288,0.79429424,0.0055017625,0.064003006,0.092801034,0.0014215051],"about_ca_topic_score_codex":0.00009661575,"about_ca_topic_score_gemma":0.0000068843456,"teacher_disagreement_score":0.9395047,"about_ca_system_score_codex":0.000012572686,"about_ca_system_score_gemma":0.000022746968,"threshold_uncertainty_score":0.99795717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010026081,0.000070069036,0.9818374,0.0014437526,0.00023178056,0.00018669588,0.0000022580687,0.00015066381,0.0060513048],"genre_scores_gemma":[0.97411454,0.0000044038325,0.021298805,0.00040366926,0.0000382255,0.00006205476,0.000008511543,0.0000044445283,0.004065338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00002219034,0.00020415854,0.00023529574,0.00018669754,0.00016839559],"domain_scores_gemma":[0.99953353,0.000027066551,0.000032950753,0.0002652599,0.00008517021,0.00005598993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011998388,0.00007847381,0.00009563394,0.000055466095,0.000038874397,0.000103596954,0.00032755214,0.000051378258,0.00024395519],"category_scores_gemma":[0.000007755333,0.000069554844,0.000031156396,0.00025617043,0.000013383175,0.00073713216,0.000017634522,0.00008057406,0.00042508714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010135099,0.00053188007,0.0073521202,0.00012702902,0.000039756567,0.000027851667,0.0019223328,0.007577514,0.0029368023,0.07427114,0.05253816,0.85266525],"study_design_scores_gemma":[0.002739099,0.00016074149,0.33260408,0.0002455381,0.00000655858,0.00012139457,0.0004912148,0.58177996,0.0033488641,0.0132749695,0.06384246,0.0013851427],"about_ca_topic_score_codex":0.0006553388,"about_ca_topic_score_gemma":0.000105842344,"teacher_disagreement_score":0.96408844,"about_ca_system_score_codex":0.000037315363,"about_ca_system_score_gemma":0.000036865797,"threshold_uncertainty_score":0.5463777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07870083,0.0003248561,0.914018,0.0008292586,0.00016781143,0.00018307367,0.00004103549,0.00010992473,0.005625219],"genre_scores_gemma":[0.9818057,0.000005245713,0.017846387,0.00007390658,0.000047946207,0.000019693069,0.000030804676,0.0000026336058,0.00016768255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883074,0.00009104782,0.00026892312,0.00018514339,0.0004849225,0.00013922955],"domain_scores_gemma":[0.99910814,0.00001609229,0.00010063844,0.00038497878,0.00034600787,0.000044134256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064943143,0.00007833234,0.0001416352,0.000027552987,0.000040938055,0.000048183327,0.00033827263,0.000037005517,0.00007553031],"category_scores_gemma":[0.00004142811,0.00006342474,0.000048255162,0.00025198836,0.000022385804,0.0003692242,0.000055555724,0.00003173733,0.00002743388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117724085,0.00024144813,0.0013120725,0.000027270022,0.00005109043,0.0000016849377,0.00067392626,0.010624213,0.0056653684,0.70589966,0.028785458,0.24670602],"study_design_scores_gemma":[0.0011292927,0.000035842004,0.0067735068,0.000022168795,0.000013695268,0.0000064298556,0.000035864396,0.9212402,0.00947761,0.0018377051,0.059238426,0.0001892421],"about_ca_topic_score_codex":0.000058542795,"about_ca_topic_score_gemma":0.000026653284,"teacher_disagreement_score":0.910616,"about_ca_system_score_codex":0.000044822616,"about_ca_system_score_gemma":0.00007728135,"threshold_uncertainty_score":0.2586386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35265154,0.00051820895,0.63902223,0.00005147987,0.0016524656,0.00018404351,0.000011409048,0.000022924996,0.005885735],"genre_scores_gemma":[0.9992749,0.0000160304,0.0005619333,0.000034635475,0.00009687539,0.0000018891404,0.0000016530458,0.0000036567294,0.000008397068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849445,0.0000671473,0.00072708237,0.000094508774,0.00044601253,0.00017082356],"domain_scores_gemma":[0.99847907,0.000041653635,0.0008574617,0.00013138291,0.00040608094,0.0000843322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049744395,0.00010412168,0.0002900029,0.00016351142,0.000051381303,0.000054483236,0.00036067748,0.000039234896,0.000005809219],"category_scores_gemma":[0.000015236683,0.00008348055,0.00010430505,0.00020056643,0.000028169328,0.0004979641,0.000051786992,0.00011554057,0.0000048442557],"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.0000658449,0.00054629124,0.0012496433,0.00026019695,0.000165605,0.00002716213,0.034786783,0.020918403,0.00016071078,0.89647484,0.0034729461,0.041871578],"study_design_scores_gemma":[0.007907257,0.0064583663,0.053468123,0.0034755038,0.00012815872,0.0011521754,0.006176276,0.87315184,0.007829632,0.023822589,0.015192767,0.001237311],"about_ca_topic_score_codex":0.00011414115,"about_ca_topic_score_gemma":0.0000013309807,"teacher_disagreement_score":0.87265223,"about_ca_system_score_codex":0.00005494718,"about_ca_system_score_gemma":0.00007160477,"threshold_uncertainty_score":0.3404238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17428963,0.0001854769,0.8122897,0.0010384636,0.00044684974,0.00012122612,0.000049231934,0.00014289541,0.011436492],"genre_scores_gemma":[0.94512564,0.00006839807,0.04836647,0.0017462422,0.00008785203,0.000007658124,0.000045982884,0.000005301134,0.00454643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930155,0.000025243713,0.0001767954,0.00021600582,0.000121688965,0.00015869866],"domain_scores_gemma":[0.9994871,0.000036491456,0.000027115782,0.0003873181,0.000022362867,0.00003958466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000910271,0.00006493653,0.000104582374,0.00005017368,0.00003417423,0.000020407442,0.00034325715,0.000018834648,0.00002144819],"category_scores_gemma":[0.0000198947,0.000053172636,0.000024979961,0.00026122158,0.000015192194,0.000519442,0.00012098773,0.00005966186,0.00008480198],"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.000069484646,0.0034212535,0.08858759,0.00011309072,0.00005257327,0.0016262588,0.0016753628,0.0050306874,0.0008342964,0.1359828,0.60644394,0.15616265],"study_design_scores_gemma":[0.0024502003,0.00014286689,0.19109765,0.00016774544,0.0000021395183,0.0005449928,0.00009264215,0.24424495,0.0007533844,0.0006389905,0.559003,0.0008614601],"about_ca_topic_score_codex":0.00026864948,"about_ca_topic_score_gemma":0.00028015944,"teacher_disagreement_score":0.77083606,"about_ca_system_score_codex":0.00001772063,"about_ca_system_score_gemma":0.00003539669,"threshold_uncertainty_score":0.21683173},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25551277,0.0000214421,0.7420651,0.00030476242,0.00031486884,0.00019841769,3.4946066e-7,0.00010662461,0.0014756839],"genre_scores_gemma":[0.98707485,8.1656344e-7,0.0126626855,0.000104342915,0.000025183828,0.000047930145,5.9566156e-7,0.0000059761587,0.00007761935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889827,0.00009918065,0.00019642303,0.00035698953,0.0001983896,0.00025072828],"domain_scores_gemma":[0.99946153,0.000071201466,0.00003433037,0.00029858312,0.00004902106,0.00008533437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089567,0.000107105705,0.00017070054,0.00010982624,0.0000597195,0.00013414146,0.00040955312,0.000052245556,0.0000026749706],"category_scores_gemma":[0.000036238478,0.000098460216,0.000040970055,0.00073887996,0.0000071433665,0.00035848087,0.00003184357,0.00012241432,0.00007118307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006276802,0.00014138501,0.016688794,0.00011561187,0.000027770431,0.000014566075,0.0023289095,0.14010872,0.0051448587,0.010136661,0.00005374597,0.8251762],"study_design_scores_gemma":[0.0013974134,0.00016899603,0.19387306,0.0008021676,0.000005850784,0.000012379159,0.000074060204,0.79249096,0.007136391,0.00094569096,0.0023190049,0.0007740512],"about_ca_topic_score_codex":0.0001386893,"about_ca_topic_score_gemma":0.00017980926,"teacher_disagreement_score":0.82440215,"about_ca_system_score_codex":0.0001010278,"about_ca_system_score_gemma":0.00001186899,"threshold_uncertainty_score":0.4015091},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067355916,0.0002115263,0.92865366,0.00007428402,0.0005251018,0.00043198888,0.00041355132,0.00069062127,0.0016433634],"genre_scores_gemma":[0.986017,0.0000053805575,0.013510753,0.00003351882,0.00009046745,0.000037708178,0.00026745372,0.00003058739,0.0000071224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959791,0.00021323923,0.0012311774,0.00089831045,0.0006444846,0.0010337327],"domain_scores_gemma":[0.9969604,0.00020155577,0.00074833684,0.0013407803,0.00045769423,0.00029123007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073664397,0.0004892829,0.00085521146,0.00015662033,0.00033068337,0.00021990162,0.0022727635,0.00021655041,0.000016953187],"category_scores_gemma":[0.00016416679,0.0004688042,0.00033370117,0.001720999,0.0001581281,0.00043210105,0.0004618856,0.00033742064,0.000039300758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950135,0.003770065,0.069564044,0.0010924016,0.0010861858,0.0006542484,0.008265054,0.0073347846,0.0033933974,0.26567245,0.002236908,0.63677096],"study_design_scores_gemma":[0.001827891,0.00036481724,0.06173458,0.0019466222,0.00014679963,0.00025612922,0.0011447514,0.8889293,0.031622406,0.0024260997,0.0074074985,0.002193079],"about_ca_topic_score_codex":0.0002444548,"about_ca_topic_score_gemma":0.0000052244745,"teacher_disagreement_score":0.9186611,"about_ca_system_score_codex":0.000112806985,"about_ca_system_score_gemma":0.000114115515,"threshold_uncertainty_score":0.99977636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066949246,0.23475552,0.75214756,0.00039200118,0.0027522289,0.0026133852,0.000049564656,0.0003834598,0.000211362],"genre_scores_gemma":[0.8876572,0.001838304,0.10742346,0.00062231993,0.00074281066,0.0010553763,0.00004593339,0.000065961925,0.0005486118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996446,0.00020304878,0.001257967,0.00072539714,0.00043437257,0.0009332281],"domain_scores_gemma":[0.9968638,0.0002880031,0.00045544247,0.0017778014,0.0003448567,0.00027013436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023147236,0.00045692787,0.0010851466,0.000050659382,0.00046876993,0.00046317652,0.0016438022,0.000149488,0.0000060172238],"category_scores_gemma":[0.0008784524,0.00038052964,0.00022656325,0.0004978733,0.000029745424,0.0013572857,0.00041348743,0.00025313123,0.00011651527],"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.000021711874,0.0019499027,0.02319319,0.19729772,0.0012534558,0.00011455883,0.009081064,0.0052575204,0.042998664,0.41737705,0.06955366,0.23190148],"study_design_scores_gemma":[0.006359115,0.00043548975,0.0042805667,0.14640388,0.000334513,0.0012911179,0.0009861174,0.39203686,0.0026629567,0.00009667961,0.43892625,0.0061864466],"about_ca_topic_score_codex":0.00027521644,"about_ca_topic_score_gemma":0.0000059925164,"teacher_disagreement_score":0.8809623,"about_ca_system_score_codex":0.00015628325,"about_ca_system_score_gemma":0.00008247896,"threshold_uncertainty_score":0.99986464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1552009,0.0004113813,0.8239523,0.005114533,0.0026427347,0.00015249207,0.000014146087,0.000019091154,0.012492435],"genre_scores_gemma":[0.98216975,0.000008730205,0.017161757,0.00014274949,0.00018587541,1.431498e-7,2.8482037e-7,0.0000031560933,0.00032754228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99903154,0.000030307636,0.00041393837,0.00007067071,0.00034580863,0.000107749685],"domain_scores_gemma":[0.9981352,0.00015915027,0.000572176,0.00088660803,0.00020520891,0.00004164523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014292512,0.000051294395,0.00012508068,0.000062266045,0.00004065087,0.000039739196,0.0021773865,0.000035419143,0.000011260556],"category_scores_gemma":[0.0004482253,0.000031283158,0.00008435328,0.00027639978,0.000016902191,0.00019045876,0.00015191566,0.00012731919,0.0000063479297],"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.0004972499,0.00093587826,0.0065830457,0.0001257214,0.0002446873,0.00012180071,0.003306981,0.0023312478,0.114853375,0.49160615,0.24466097,0.1347329],"study_design_scores_gemma":[0.002788419,0.00079468015,0.5106371,0.0018608858,0.000053543812,0.0006903177,0.00035451332,0.0046336236,0.079106,0.13566472,0.26287603,0.0005401844],"about_ca_topic_score_codex":0.0000056138206,"about_ca_topic_score_gemma":0.0000018641161,"teacher_disagreement_score":0.82696885,"about_ca_system_score_codex":0.000036833888,"about_ca_system_score_gemma":0.00003000662,"threshold_uncertainty_score":0.40461624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038975928,0.000069287984,0.9584748,0.00016682627,0.000072574425,0.00036810816,8.2435986e-7,0.00015563663,0.0017159902],"genre_scores_gemma":[0.97414863,0.0000015778307,0.02561298,0.0000464101,0.000021917283,0.000030113373,0.000017167304,0.000004544035,0.000116661366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906605,0.000027041162,0.00016949551,0.00033066308,0.00016836743,0.00023839362],"domain_scores_gemma":[0.9991864,0.000016482742,0.00005611127,0.0006172131,0.00007335723,0.000050422044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438422,0.00008054201,0.00009505951,0.000047870257,0.000046204463,0.00030682344,0.00073237915,0.000030740153,0.0000132327705],"category_scores_gemma":[0.000015349939,0.00005770367,0.0000069528082,0.0007909809,0.00001088384,0.0010695049,0.0001697309,0.000065868866,0.00010086561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015716652,0.0001280005,0.051344257,0.000034563593,0.000009761315,0.000015988908,0.00019586118,0.0006307249,0.000039915798,0.0046052635,0.00070039893,0.9422937],"study_design_scores_gemma":[0.00038816946,0.000055981815,0.009179095,0.000059612477,0.0000013689764,0.000025632882,0.00006948811,0.98757106,0.00006209153,0.00009650628,0.0023276873,0.00016328669],"about_ca_topic_score_codex":0.0006886246,"about_ca_topic_score_gemma":0.00026270925,"teacher_disagreement_score":0.9869404,"about_ca_system_score_codex":0.000035754645,"about_ca_system_score_gemma":0.000038281676,"threshold_uncertainty_score":0.29587054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13200366,0.00011313123,0.8633454,0.00011748476,0.00040817255,0.00054054713,0.000071764065,0.00063644414,0.0027634355],"genre_scores_gemma":[0.9737752,0.0000039686374,0.025778104,0.00012276224,0.000103886814,0.000021535538,0.00015660995,0.00001991924,0.000018008448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967882,0.00036974737,0.00071253034,0.0008266295,0.00053592137,0.00076695246],"domain_scores_gemma":[0.9978835,0.0002125694,0.0004255075,0.0009325684,0.00030282242,0.00024301358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011714274,0.00040158426,0.0008319716,0.000116020514,0.00050964014,0.0002590365,0.0014761185,0.0001350974,0.000022738659],"category_scores_gemma":[0.00009052819,0.00031600555,0.00021547485,0.0009312319,0.00031407792,0.00042115554,0.000436569,0.00034400963,0.00009089259],"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.020169083,0.0018980218,0.007216029,0.00030399693,0.0009183624,0.0012557259,0.010863532,0.0025858276,0.0020963333,0.8710959,0.0062270006,0.07537018],"study_design_scores_gemma":[0.105971925,0.00026457285,0.008488575,0.000376878,0.00006990506,0.00035304678,0.0002237181,0.86895543,0.004850393,0.007191775,0.001846284,0.0014075225],"about_ca_topic_score_codex":0.00022641766,"about_ca_topic_score_gemma":0.000014543453,"teacher_disagreement_score":0.8663696,"about_ca_system_score_codex":0.000098804536,"about_ca_system_score_gemma":0.000106255124,"threshold_uncertainty_score":0.9999292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012739659,0.00030655047,0.9440391,0.00072857545,0.000632179,0.0004294103,0.000012916364,0.00019957802,0.04091205],"genre_scores_gemma":[0.9815186,0.0000039674837,0.014696784,0.0001594494,0.000017800887,0.000026349946,0.000001704751,0.0000046664236,0.00357067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993075,0.000009663911,0.00013806073,0.00025916495,0.000096489275,0.0001891158],"domain_scores_gemma":[0.99958813,0.00003592038,0.000038698938,0.00019777683,0.00007313335,0.00006632208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001210999,0.00008525241,0.00012139859,0.000031737793,0.00013089058,0.00013141979,0.00019281253,0.00005475413,0.0000051461625],"category_scores_gemma":[0.000018234618,0.000070266105,0.000038382746,0.00026857978,0.000029126197,0.00023867811,0.00004771501,0.00004549739,0.00001592272],"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.00004328824,0.00013447048,0.00004544809,0.000021861564,0.00006558701,0.000041451556,0.0015372215,0.00046447906,0.0005004331,0.98186594,0.009248092,0.0060317134],"study_design_scores_gemma":[0.028475162,0.0067736492,0.010035772,0.0006805726,0.00007072976,0.00083286397,0.0011253896,0.31701583,0.011091943,0.433127,0.18735395,0.003417172],"about_ca_topic_score_codex":0.00004829858,"about_ca_topic_score_gemma":0.00003042969,"teacher_disagreement_score":0.96877897,"about_ca_system_score_codex":0.000040242066,"about_ca_system_score_gemma":0.00008252915,"threshold_uncertainty_score":0.28653684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010867672,0.00014951256,0.7429727,0.0059322617,0.00048746454,0.00013762858,0.000003369468,0.00035476443,0.23909463],"genre_scores_gemma":[0.96507704,0.0000012303901,0.025147673,0.0010967735,0.00005004131,0.0000068572226,2.917511e-7,0.0000031271697,0.008616977],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992882,0.00001764231,0.00013700445,0.00022502545,0.00013623416,0.00019586967],"domain_scores_gemma":[0.99941117,0.000025024028,0.000021310141,0.0003905833,0.000043025568,0.00010887137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001014518,0.00006511317,0.000089895315,0.000031973042,0.000065172564,0.00012537825,0.00038679334,0.000025050564,0.000066339424],"category_scores_gemma":[0.00002262442,0.0000551316,0.000026528278,0.0002917157,0.000008973264,0.00007278616,0.0000777906,0.000042881053,0.0011003957],"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.0000015225828,0.00008582621,0.0004459669,0.000013281426,0.000014397243,0.0000792775,0.0013341459,0.00019684048,0.001913394,0.28270274,0.5222724,0.1909402],"study_design_scores_gemma":[0.00035062258,0.000067693836,0.0018101011,0.000044179924,0.0000015326436,0.000091780654,0.000059907565,0.20964654,0.00091533357,0.00043242486,0.78621733,0.0003625642],"about_ca_topic_score_codex":0.00003976707,"about_ca_topic_score_gemma":0.000005988407,"teacher_disagreement_score":0.9542094,"about_ca_system_score_codex":0.000016969148,"about_ca_system_score_gemma":0.000004876045,"threshold_uncertainty_score":0.99967736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4368544,0.0001077994,0.55950105,0.0013821825,0.0008237452,0.00028182095,0.00021585202,0.00032942442,0.0005036946],"genre_scores_gemma":[0.99392873,0.0000037604802,0.004887434,0.00017879036,0.0006721188,0.00000472685,0.00028897336,0.000020174823,0.000015297794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968447,0.00023483884,0.000682902,0.00083255174,0.00062924577,0.0007757765],"domain_scores_gemma":[0.997655,0.00045792115,0.00036479093,0.0010328706,0.00021971922,0.00026974335],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012477163,0.00038931545,0.00046708118,0.00008149299,0.0017649912,0.0007576782,0.0016066686,0.00021980735,0.000011660824],"category_scores_gemma":[0.00015509863,0.00030296945,0.00013344214,0.0007884503,0.00040635077,0.00041331706,0.0012377693,0.0009093558,0.000043383952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079969366,0.0005738526,0.06743652,0.00029136156,0.0002701904,0.00021901829,0.008585045,0.0011808175,0.061891805,0.37504604,0.018734397,0.465691],"study_design_scores_gemma":[0.002024465,0.00019492004,0.1438912,0.0003179033,0.000055990757,0.0002963657,0.0004442159,0.7941356,0.0036351208,0.009689615,0.043942988,0.0013716638],"about_ca_topic_score_codex":0.00013355531,"about_ca_topic_score_gemma":0.000028036904,"teacher_disagreement_score":0.79295474,"about_ca_system_score_codex":0.000064615975,"about_ca_system_score_gemma":0.00007953659,"threshold_uncertainty_score":0.99994224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032784555,0.0002610614,0.9455004,0.00051799434,0.00044547956,0.00034368847,0.000013783643,0.00015149442,0.019981561],"genre_scores_gemma":[0.9767141,0.000009792875,0.0098273605,0.0006371947,0.00010681551,0.000039127266,0.000002329824,0.000009220633,0.012654064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922186,0.000011690478,0.00015312244,0.00027387237,0.00014037073,0.0001990901],"domain_scores_gemma":[0.99956024,0.000026616202,0.000039779905,0.00025300068,0.0000505396,0.00006984701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012686572,0.000093776805,0.000118704505,0.000027173817,0.00020146952,0.00008277865,0.00025077673,0.00005141458,0.00002237985],"category_scores_gemma":[0.0000066533535,0.00006934929,0.00003710129,0.00011512126,0.00004438052,0.00023017387,0.00007211651,0.000037660153,0.000031077405],"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.00008186802,0.0007825206,0.009512359,0.00026780015,0.000095170566,0.00007813448,0.0083373515,0.00018296865,0.010951542,0.48214078,0.4360497,0.051519785],"study_design_scores_gemma":[0.00067961233,0.00015172068,0.00078946573,0.000027356262,0.0000016455009,0.00008222116,0.000010698747,0.03546579,0.00047831787,0.00096395944,0.9611464,0.00020282085],"about_ca_topic_score_codex":0.000038690745,"about_ca_topic_score_gemma":0.000016980925,"teacher_disagreement_score":0.94392955,"about_ca_system_score_codex":0.000011973281,"about_ca_system_score_gemma":0.000027096148,"threshold_uncertainty_score":0.2827982},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060874883,0.000012794943,0.93703806,0.00042747345,0.00026282176,0.00053284725,0.000029322307,0.000114066024,0.0007077241],"genre_scores_gemma":[0.72374874,6.072177e-8,0.27607962,0.00003625681,0.000025208268,0.000026567708,0.000014550775,0.0000032293053,0.00006571868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885505,0.000042082123,0.00041570602,0.00030325647,0.00014108869,0.00024280722],"domain_scores_gemma":[0.99859774,0.00027395165,0.00015861771,0.00038734692,0.00051203603,0.000070280475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034153266,0.00011220063,0.00023991049,0.000020854437,0.00011798386,0.000118588934,0.0004664516,0.000046293364,0.0000153557],"category_scores_gemma":[0.00023395054,0.00008820417,0.00006953353,0.00031641297,0.000050460032,0.00040247705,0.0001149843,0.00006215869,0.000014765145],"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.000042128544,0.00094228145,0.06382653,0.0010126218,0.00020116175,0.000004368622,0.004004517,0.37562233,0.005139984,0.19349681,0.1360589,0.21964838],"study_design_scores_gemma":[0.00028994266,0.00005210112,0.005548295,0.0000580021,0.0000019722183,0.0000014564721,0.000102735015,0.99178374,0.00072461617,0.0009309633,0.00038760755,0.00011855336],"about_ca_topic_score_codex":0.00021020975,"about_ca_topic_score_gemma":0.0000025012894,"teacher_disagreement_score":0.66287386,"about_ca_system_score_codex":0.00003095776,"about_ca_system_score_gemma":0.000046618083,"threshold_uncertainty_score":0.35968617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068768024,0.00018194363,0.9267905,0.0005329281,0.0014411412,0.00046201385,0.00009539849,0.0009038461,0.0008242536],"genre_scores_gemma":[0.9745835,0.0000012972489,0.02488757,0.00007888351,0.00027409228,0.000032611886,0.00008199816,0.000022132836,0.000037888858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721944,0.000115673065,0.0005364588,0.0008444806,0.00047688317,0.0008070376],"domain_scores_gemma":[0.9979669,0.00011718693,0.00031362596,0.0009578314,0.00038004093,0.00026443184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006339776,0.00035995874,0.00041309648,0.000098131924,0.00055610243,0.0006499505,0.0017726867,0.00017734812,0.000009958095],"category_scores_gemma":[0.00009370782,0.0002687549,0.00016073059,0.0010911601,0.00014408928,0.0005465351,0.00039097044,0.000678016,0.00007644282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006399565,0.0009946864,0.033203863,0.00019536914,0.00025947302,0.0005115271,0.0021352423,0.0020565782,0.0094493,0.26103103,0.006871632,0.6832273],"study_design_scores_gemma":[0.000936918,0.00015586922,0.013539332,0.00027031393,0.000017163224,0.00021910988,0.00019094502,0.9504822,0.0022779733,0.0011059946,0.029879509,0.00092466123],"about_ca_topic_score_codex":0.00005641381,"about_ca_topic_score_gemma":0.000010666639,"teacher_disagreement_score":0.94842565,"about_ca_system_score_codex":0.00006659214,"about_ca_system_score_gemma":0.00014816539,"threshold_uncertainty_score":0.99997646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089380203,0.00026247653,0.9905936,0.0014059388,0.004885478,0.00028748746,0.000020136536,0.00056152116,0.0010895506],"genre_scores_gemma":[0.9312487,0.000012357038,0.065735765,0.0004957441,0.0010001957,0.00008215402,0.0000038324997,0.000019400963,0.0014018172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981066,0.00010470582,0.0004551309,0.0005518603,0.00039485027,0.00038684948],"domain_scores_gemma":[0.99786705,0.00011201977,0.00010388394,0.0016376842,0.00010855821,0.00017083483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024154119,0.00023728397,0.0002897597,0.00015503148,0.00024719952,0.00042942053,0.0016772854,0.00010890882,0.000013914365],"category_scores_gemma":[0.0000030279582,0.00021792336,0.00014922586,0.00045569864,0.000025783796,0.0006380141,0.000023807987,0.00022028596,0.0008701165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015830377,0.0006709634,0.000041690048,0.00012228689,0.00018343519,0.00004798201,0.0013345294,0.18710613,0.000109781584,0.030468741,0.018377267,0.76152134],"study_design_scores_gemma":[0.00071523694,0.00016870287,0.00019476835,0.00018878988,0.000008775208,0.0002005729,0.000024916622,0.5873579,0.00028527802,0.000076386845,0.4103377,0.0004410495],"about_ca_topic_score_codex":0.00005925756,"about_ca_topic_score_gemma":0.000013036018,"teacher_disagreement_score":0.93035495,"about_ca_system_score_codex":0.00009680658,"about_ca_system_score_gemma":0.000042757914,"threshold_uncertainty_score":0.99990785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012900349,0.0007016331,0.9382669,0.00092803733,0.00035246176,0.0001898964,0.000011766933,0.00052346935,0.046125498],"genre_scores_gemma":[0.9760993,0.000012871484,0.014103262,0.0009263766,0.00006235421,0.000028667686,0.0000031330621,0.00000964742,0.008754395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985541,0.000028418297,0.00029863685,0.0005180459,0.00025510316,0.00034570045],"domain_scores_gemma":[0.9988341,0.000026606183,0.00012845742,0.00083929155,0.000059818187,0.000111749774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001668138,0.00013610696,0.00015500578,0.000024782155,0.00016461688,0.0002393098,0.0008979468,0.000054459353,0.00009006567],"category_scores_gemma":[0.000033792763,0.00012187978,0.000054719472,0.00032319303,0.00001908917,0.00051570626,0.0001425643,0.00010855732,0.00036146815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001433496,0.0002092905,0.0010153984,0.000056312074,0.000019978219,0.000025299796,0.000756831,0.00020162771,0.016083175,0.019342074,0.43010032,0.53218824],"study_design_scores_gemma":[0.00028635014,0.000022681474,0.00018817862,0.000022889486,0.0000013563445,0.000018409604,0.00001935325,0.86331004,0.0022944976,0.000056791232,0.13353151,0.00024793396],"about_ca_topic_score_codex":0.00010928742,"about_ca_topic_score_gemma":0.000002336496,"teacher_disagreement_score":0.96319896,"about_ca_system_score_codex":0.000030895924,"about_ca_system_score_gemma":0.000005604938,"threshold_uncertainty_score":0.4970113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703073,0.00017893377,0.928389,0.0019295104,0.0008113922,0.00017870085,0.0003513311,0.0004287565,0.00070163864],"genre_scores_gemma":[0.9960711,0.000022734386,0.003566563,0.00006609613,0.00016412037,0.000004303737,0.000047107776,0.000012035005,0.000045922752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804366,0.00010577378,0.00034715098,0.00065718073,0.0003022648,0.0005439767],"domain_scores_gemma":[0.9984874,0.0002159585,0.00022653531,0.0006755104,0.00016253212,0.00023207831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024128423,0.00026833764,0.00033062923,0.000083125444,0.00042763306,0.00051664753,0.0011368357,0.000119567994,0.000013574714],"category_scores_gemma":[0.000059671565,0.00020332319,0.00009466748,0.00045348844,0.00021339559,0.00082312146,0.0005961313,0.00015934928,0.000020874451],"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.000081950246,0.0002440748,0.08011099,0.00010764032,0.00033865758,0.00032959267,0.0008510143,0.002690503,0.003391437,0.5542651,0.021030828,0.33655825],"study_design_scores_gemma":[0.011337956,0.00040514593,0.3069931,0.0018507553,0.00012363112,0.0015719563,0.0011690297,0.47729218,0.0035812394,0.012922112,0.17874372,0.0040091784],"about_ca_topic_score_codex":0.00007887979,"about_ca_topic_score_gemma":0.000008159874,"teacher_disagreement_score":0.9290404,"about_ca_system_score_codex":0.000086268155,"about_ca_system_score_gemma":0.0000698251,"threshold_uncertainty_score":0.8291279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002097093,0.00015844034,0.95138645,0.0004262539,0.00063902675,0.00004147767,0.0000027862447,0.00014401072,0.045104437],"genre_scores_gemma":[0.9889912,0.000002030244,0.008733136,0.00019488705,0.00014798978,0.0000058503265,0.0000016254842,0.000002905125,0.0019203568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934226,0.000017889615,0.00012266482,0.00012001946,0.00016583395,0.00023131093],"domain_scores_gemma":[0.9996372,0.000022111157,0.000025123492,0.00019538526,0.000029061051,0.00009112594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018920594,0.00006209323,0.00007454966,0.000022757687,0.00006633359,0.00006908317,0.00025281493,0.000032892553,0.00014347052],"category_scores_gemma":[0.0000039884353,0.000050938474,0.000044621505,0.00014792143,0.000009441597,0.00087592565,0.000011058888,0.00005772987,0.00019168785],"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.0000037163857,0.00021874341,0.0029182287,0.000016817043,0.0000241472,0.0000045854486,0.0012542228,0.00008772377,0.0013726788,0.6495597,0.009237947,0.3353015],"study_design_scores_gemma":[0.00063536264,0.00004203333,0.066385426,0.000035128967,0.000006729366,0.00019120332,0.00011342564,0.027439725,0.0042382665,0.0011294577,0.8992574,0.00052584393],"about_ca_topic_score_codex":0.000018592576,"about_ca_topic_score_gemma":0.0000025380825,"teacher_disagreement_score":0.98689413,"about_ca_system_score_codex":0.000016324868,"about_ca_system_score_gemma":0.000013469823,"threshold_uncertainty_score":0.24638234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01835001,0.00013949303,0.9776894,0.0011758531,0.0008895511,0.00039523328,0.000116973424,0.0004908159,0.000752655],"genre_scores_gemma":[0.98276985,0.0000013999153,0.016206201,0.00044822873,0.0002237811,0.000027702341,0.00011575705,0.000018223807,0.00018886966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980525,0.00005655859,0.00035405005,0.0006281577,0.0002608776,0.00064790505],"domain_scores_gemma":[0.9985731,0.000075592,0.00024623246,0.0006245383,0.0003364492,0.00014407116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033876736,0.00026036933,0.00031341054,0.00008582002,0.00039270436,0.00041397472,0.00092149957,0.00014319443,0.000007124259],"category_scores_gemma":[0.00006285042,0.0002581716,0.00018344908,0.00069630414,0.000040446634,0.00047962816,0.0001188376,0.00018529689,0.000020112033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018530859,0.0012694263,0.0029060082,0.00064135663,0.0006878547,0.00009826807,0.019421095,0.0005248918,0.015971778,0.20363306,0.3066598,0.44800118],"study_design_scores_gemma":[0.0025248383,0.0003588778,0.0029156832,0.00017134975,0.000045526,0.00010621762,0.0033032214,0.84645313,0.0945071,0.0050266255,0.043261517,0.0013259031],"about_ca_topic_score_codex":0.00009007869,"about_ca_topic_score_gemma":0.0000030052572,"teacher_disagreement_score":0.96441984,"about_ca_system_score_codex":0.00008593869,"about_ca_system_score_gemma":0.00005988154,"threshold_uncertainty_score":0.99998707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03296838,0.0002156236,0.9638891,0.00041395682,0.0010164843,0.00035481717,0.000060681756,0.00031226003,0.000768666],"genre_scores_gemma":[0.9482287,0.0000017387341,0.050898213,0.00020831548,0.000314346,0.000020200243,0.00014211626,0.0000143037205,0.00017202045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819297,0.0000571452,0.00047830783,0.00051297474,0.00022047042,0.00053814915],"domain_scores_gemma":[0.99895495,0.00016803348,0.00022452831,0.00046200582,0.00011270591,0.00007775579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003770552,0.00020296659,0.00029124806,0.0000586641,0.00029172184,0.00029195193,0.0007891442,0.00008019467,0.0000026322532],"category_scores_gemma":[0.00003775909,0.0002036857,0.0001632594,0.00031855394,0.00002256492,0.0002637028,0.00017573054,0.00010320513,0.000051711446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001709731,0.0017290614,0.014334144,0.0004957834,0.0001959656,0.00009323308,0.00051360804,0.22707939,0.00072583096,0.2537564,0.357627,0.14327861],"study_design_scores_gemma":[0.0010682762,0.00011749145,0.008652646,0.00005851294,0.000006614216,0.000020673877,0.000011083145,0.92887455,0.00008663593,0.0066511407,0.054088943,0.00036340207],"about_ca_topic_score_codex":0.00012851688,"about_ca_topic_score_gemma":0.000011111129,"teacher_disagreement_score":0.9152604,"about_ca_system_score_codex":0.000084396524,"about_ca_system_score_gemma":0.000037362865,"threshold_uncertainty_score":0.8306062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038815428,0.005320636,0.6456681,0.0011879015,0.002761634,0.0003547857,0.000013318417,0.00026217007,0.30561605],"genre_scores_gemma":[0.99370736,0.000027702885,0.0027756034,0.00008298205,0.00006613178,0.000005676308,5.4863636e-7,0.000002684663,0.003331294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992362,0.00003438525,0.00019168529,0.000097620956,0.00018273886,0.00025737227],"domain_scores_gemma":[0.99923384,0.00007283351,0.00009843532,0.00047963965,0.000048726215,0.00006652836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041646653,0.000064032545,0.000090401445,0.00001258723,0.000097558135,0.000057103018,0.0006189119,0.000029118259,0.0000060998555],"category_scores_gemma":[0.000023164977,0.000035158144,0.00004676118,0.00018806547,0.000043966935,0.0002912373,0.000098887554,0.00004727242,0.000096271826],"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.0000025487213,0.00008764546,0.00797761,0.000012285229,0.000018535391,3.9759698e-7,0.00077415747,0.00000676136,0.0019626026,0.8348829,0.02064367,0.13363089],"study_design_scores_gemma":[0.00015370644,0.000030117222,0.010929875,0.000016307904,0.0000022082932,0.000012563041,0.00015452264,0.0031114586,0.011156503,0.0008790641,0.97341776,0.00013590371],"about_ca_topic_score_codex":0.000033428503,"about_ca_topic_score_gemma":0.0000047522262,"teacher_disagreement_score":0.9548919,"about_ca_system_score_codex":0.000010900151,"about_ca_system_score_gemma":0.000019382182,"threshold_uncertainty_score":0.14337075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05619281,0.000044569813,0.93901753,0.00041946291,0.0004374255,0.0001655151,4.871712e-7,0.00019311291,0.0035290923],"genre_scores_gemma":[0.7923535,0.0000015172292,0.20722505,0.00030528242,0.00009886005,0.0000037214063,8.1046636e-7,0.000008261728,0.0000030014016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968143,0.00016180414,0.0003890966,0.00085364154,0.00068925536,0.0010918712],"domain_scores_gemma":[0.9984265,0.00029544556,0.000079469864,0.00076606206,0.00012703669,0.00030550588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00275004,0.00022827972,0.00033357175,0.0001203839,0.00040798157,0.0006325818,0.0021382892,0.000058909503,0.00001317503],"category_scores_gemma":[0.00004575185,0.00017582857,0.000046870893,0.0018151896,0.0009723071,0.0006302653,0.0005346387,0.00025798194,0.00003196529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011022995,0.000024407062,0.0054014367,0.000006219365,0.0000029879325,0.000014219325,0.00013352983,0.03602821,0.000023266914,0.9365264,0.000018655312,0.021809654],"study_design_scores_gemma":[0.0005755682,0.00012593454,0.0044278367,0.00020719388,0.0000027199656,0.000047375033,0.000011399148,0.959283,0.00012616081,0.034393683,0.00049598055,0.00030316508],"about_ca_topic_score_codex":0.000051312727,"about_ca_topic_score_gemma":0.000021802009,"teacher_disagreement_score":0.9232548,"about_ca_system_score_codex":0.00006891324,"about_ca_system_score_gemma":0.000117115946,"threshold_uncertainty_score":0.71700805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139744,0.0021185505,0.6833919,0.00016818725,0.000119037584,0.0001138788,0.000068602196,0.000038846716,0.0000065730655],"genre_scores_gemma":[0.9466567,0.000021069533,0.0530792,0.00003303553,0.00017779825,0.0000018332069,0.00001644531,0.000009674945,0.0000042132397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980928,0.000061295985,0.00079578743,0.00030772857,0.00027440803,0.00046802836],"domain_scores_gemma":[0.9982563,0.00012853155,0.0008959101,0.00010919755,0.00043828425,0.00017175592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173514,0.00022602608,0.0004445755,0.000099393554,0.0006952356,0.0005098975,0.00025053276,0.00009449454,0.0000025110678],"category_scores_gemma":[0.00013962273,0.00019625947,0.00010135327,0.00039716958,0.000051765295,0.0003224391,0.00014656372,0.00020776517,3.9113633e-7],"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.00041675533,0.0019625316,0.05394758,0.0025673434,0.0007449185,0.00023617852,0.007772049,0.6641773,0.01210862,0.047996055,0.0058671273,0.20220354],"study_design_scores_gemma":[0.0012808988,0.00011939237,0.0022875639,0.00036812483,0.000030062216,0.0004560223,0.0002862251,0.99213904,0.00008757447,0.00023099937,0.0024821584,0.00023193585],"about_ca_topic_score_codex":0.000004564746,"about_ca_topic_score_gemma":0.0000012003251,"teacher_disagreement_score":0.6326823,"about_ca_system_score_codex":0.000060381382,"about_ca_system_score_gemma":0.00004224638,"threshold_uncertainty_score":0.8003229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015910871,0.0010561682,0.9797714,0.000029245557,0.0007409847,0.0005025218,0.000013407124,0.00035328942,0.0016221207],"genre_scores_gemma":[0.9464925,0.000021027936,0.05138312,0.0002630992,0.00021310472,0.00009261575,0.0000126974965,0.000015092301,0.0015067495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984043,0.000020450136,0.00032323197,0.00046765414,0.00019979318,0.00058457523],"domain_scores_gemma":[0.99875796,0.000101402016,0.00008443037,0.0006838699,0.00015075067,0.00022156752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064203225,0.0001608469,0.00020217444,0.00004736397,0.00016978593,0.00016112778,0.0008339066,0.000115928284,0.000024996982],"category_scores_gemma":[0.000011197211,0.00013808443,0.00008405568,0.0003295413,0.000020935327,0.00058115314,0.00006612707,0.00009259467,0.000029744135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073839445,0.0003213508,0.0006086341,0.00003887285,0.000036353824,0.000026305714,0.00037886755,0.012216428,0.002469422,0.014964968,0.015104736,0.9537602],"study_design_scores_gemma":[0.00069151266,0.00046101792,0.0017790067,0.000020519876,0.000003837958,0.0000118149155,0.000103999555,0.5725652,0.0015779627,0.00021733463,0.42223,0.00033777035],"about_ca_topic_score_codex":0.000017768023,"about_ca_topic_score_gemma":0.00022889089,"teacher_disagreement_score":0.9534224,"about_ca_system_score_codex":0.000041155352,"about_ca_system_score_gemma":0.000034690343,"threshold_uncertainty_score":0.56309193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023091817,0.0022530078,0.9918975,0.00083879026,0.00043842447,0.0008820307,0.000038405688,0.00035176694,0.0009908839],"genre_scores_gemma":[0.9944273,0.00010420478,0.00396371,0.000051691124,0.000015983445,0.0009882312,0.000004757829,0.000013281257,0.00043083006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985707,0.000031956864,0.0003805366,0.0005768813,0.00012287592,0.00031707375],"domain_scores_gemma":[0.9989331,0.0001095385,0.00011299619,0.0006590616,0.00010964404,0.00007570325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000322565,0.00018957575,0.00030333616,0.00044214953,0.00028430988,0.000054501,0.0007588095,0.0003772988,0.000025882317],"category_scores_gemma":[0.000013652273,0.00018569539,0.00006162955,0.00065402145,0.00010577737,0.00028641048,0.0000025844877,0.00032819653,0.000027389986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020904027,0.0008390187,0.00035000147,0.00048937753,0.00017958191,0.000019851255,0.0026494781,0.005444916,0.004047459,0.14338309,0.001061233,0.84132695],"study_design_scores_gemma":[0.014135261,0.002564098,0.0047214753,0.0017777059,0.000128368,0.0012890287,0.012025709,0.338186,0.052953456,0.34720317,0.22002156,0.0049941633],"about_ca_topic_score_codex":0.0000789457,"about_ca_topic_score_gemma":0.000054636224,"teacher_disagreement_score":0.9921181,"about_ca_system_score_codex":0.000034840345,"about_ca_system_score_gemma":0.000056246376,"threshold_uncertainty_score":0.7572438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970131,0.0060285535,0.26538128,0.05884486,0.010688249,0.0010076339,0.000053453598,0.00021483257,0.060768016],"genre_scores_gemma":[0.99289185,0.00001569528,0.00436479,0.0019468919,0.00033815112,0.0000016960381,5.57579e-8,0.000008108875,0.00043274378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986627,0.0001399517,0.00041226993,0.000120903474,0.00043518716,0.00022900314],"domain_scores_gemma":[0.9974392,0.00009439413,0.00045189806,0.0017597851,0.00017128122,0.00008341295],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009443681,0.0001130056,0.00018223167,0.000032868546,0.00022718556,0.00015061429,0.006892935,0.000047077105,0.000022313425],"category_scores_gemma":[0.00030999674,0.00005182539,0.00024058227,0.00032607705,0.000060803373,0.00046279113,0.0008889864,0.00033300565,0.000030720264],"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.00015804093,0.0005399784,0.025824951,0.00008392108,0.0007138806,0.00040862148,0.04034558,0.0048559196,0.004766014,0.063620046,0.758585,0.10009807],"study_design_scores_gemma":[0.001704709,0.00028640512,0.018703911,0.00059512164,0.000108914144,0.004242992,0.0008509836,0.017616415,0.008481612,0.047105696,0.8996963,0.00060693704],"about_ca_topic_score_codex":0.000028539733,"about_ca_topic_score_gemma":0.0000022790557,"teacher_disagreement_score":0.39587873,"about_ca_system_score_codex":0.000027252963,"about_ca_system_score_gemma":0.00008638518,"threshold_uncertainty_score":0.99848026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67020667,0.0001609749,0.12322868,0.008746945,0.0014127187,0.00029557908,0.00012936119,0.00031237878,0.19550672],"genre_scores_gemma":[0.9978523,0.000015511416,0.0017976889,0.00011174407,0.000053260723,0.000013757133,0.000041060724,0.0000038235485,0.00011085102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987538,0.000019473915,0.0003458602,0.00035397784,0.0004103087,0.00011658179],"domain_scores_gemma":[0.99860936,0.000019396375,0.00032396478,0.0006317625,0.00037228,0.00004325338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012801061,0.000111124216,0.00016565721,0.000069720125,0.0000450608,0.00025805944,0.0013980207,0.00005960188,0.000031086394],"category_scores_gemma":[0.0000088049555,0.000102856815,0.000044644352,0.00014655782,0.00003459561,0.000570629,0.00008905421,0.00009949647,0.00005821833],"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.000011183861,0.00012116751,0.0011901633,0.000034832585,0.000019569956,0.0000020764157,0.00048258933,0.0010548831,0.013002407,0.9820579,0.000074457676,0.0019487606],"study_design_scores_gemma":[0.003436752,0.00080016453,0.05634579,0.0024359107,0.000021958764,0.00005022148,0.007915663,0.6383436,0.06406214,0.19052416,0.034783453,0.0012802164],"about_ca_topic_score_codex":0.00021938777,"about_ca_topic_score_gemma":0.0001356978,"teacher_disagreement_score":0.79153377,"about_ca_system_score_codex":0.00004212724,"about_ca_system_score_gemma":0.00016110195,"threshold_uncertainty_score":0.41943792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026954265,0.00012415263,0.9695642,0.0007273773,0.00014371975,0.0012567785,0.00018510042,0.00024793757,0.0007964622],"genre_scores_gemma":[0.68817896,0.000012132294,0.30468154,0.00062512496,0.00028958588,0.0019892985,0.000108167245,0.000018440598,0.0040967693],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989282,0.0000154349,0.00024666128,0.00044681877,0.000116724375,0.0002461676],"domain_scores_gemma":[0.9988659,0.00010626012,0.00006661365,0.00069964223,0.0001260691,0.00013548281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022590262,0.00013641609,0.00018713444,0.000053337044,0.00014209135,0.00013265718,0.0005088334,0.00007930727,0.000021343238],"category_scores_gemma":[0.000022711154,0.000108330736,0.00006181546,0.00024690857,0.000052381583,0.00015861906,0.00013462732,0.00018935041,0.000008708432],"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.00006383569,0.0021645064,0.0008422073,0.00046185686,0.00007908918,0.000004027497,0.0009295834,0.0007993325,0.10168806,0.18569842,0.01038658,0.6968825],"study_design_scores_gemma":[0.0008335982,0.00013069453,0.00052898633,0.000014302399,0.0000076091032,0.00003049822,0.000041366802,0.06708166,0.0034804624,0.0065565496,0.92103535,0.00025891644],"about_ca_topic_score_codex":0.00003932175,"about_ca_topic_score_gemma":0.00016865274,"teacher_disagreement_score":0.91064876,"about_ca_system_score_codex":0.00000879762,"about_ca_system_score_gemma":0.000048691003,"threshold_uncertainty_score":0.4417599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14563167,0.0011672525,0.8424468,0.0072963373,0.00017936928,0.00016275984,3.2031886e-7,0.000046554724,0.0030689319],"genre_scores_gemma":[0.99500453,0.000038480735,0.004682118,0.00010325789,0.000036415273,0.000009604098,3.0997714e-7,0.0000033051476,0.00012195885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992449,0.00012470914,0.00023131455,0.00007462643,0.00016263926,0.00016177188],"domain_scores_gemma":[0.9994748,0.000037386464,0.00013302047,0.00022245532,0.00009709059,0.000035198427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072939316,0.000055489578,0.00007506197,0.00004472532,0.00030532505,0.00047764616,0.00065197307,0.000026650026,0.000017716126],"category_scores_gemma":[0.000014055167,0.000036278638,0.000025418634,0.0002898088,0.000020538775,0.0010130983,0.000024600386,0.00029061586,0.00003144205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003351953,0.00007337379,0.0006597193,0.000021585467,0.0000068516956,0.0000037061027,0.0051323245,0.00297067,0.0031297088,0.0024346688,0.0013016126,0.9842624],"study_design_scores_gemma":[0.000756018,0.000048552443,0.032357346,0.00049145403,0.0000052256833,0.0005238406,0.0013209387,0.947131,0.0010038438,0.011491528,0.0046446687,0.00022560621],"about_ca_topic_score_codex":0.000093487324,"about_ca_topic_score_gemma":0.000012715549,"teacher_disagreement_score":0.9840368,"about_ca_system_score_codex":0.00004499301,"about_ca_system_score_gemma":0.00003537703,"threshold_uncertainty_score":0.4605953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05903056,0.00007995628,0.9298832,0.00061850576,0.00039724977,0.00012891676,0.000044181714,0.00014419881,0.009673236],"genre_scores_gemma":[0.99773175,0.0000014061246,0.0016471399,0.00009026753,0.00006360433,0.000015992528,0.00006202599,0.0000038015723,0.00038403991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988736,0.00004563097,0.00029705753,0.0002931917,0.00023710141,0.0002534567],"domain_scores_gemma":[0.9995956,0.00005254955,0.000054715554,0.00020123275,0.000051657094,0.000044252014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018983135,0.00010890987,0.00013822762,0.00006535267,0.00007210123,0.000087554516,0.00031632962,0.000056349232,0.000058970647],"category_scores_gemma":[0.00000688935,0.00010004204,0.000056588822,0.00037388084,0.00001978815,0.0005428975,0.00003465208,0.000111065885,0.00007478215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002375284,0.0031140444,0.04002683,0.0004508437,0.00009005839,0.00058589753,0.0025518474,0.06441483,0.0120092705,0.4732422,0.25072765,0.15254898],"study_design_scores_gemma":[0.010275755,0.00012981726,0.07123583,0.00032377124,0.000009845423,0.00012538033,0.0005128317,0.82645583,0.00555353,0.0048079654,0.07926643,0.0013029792],"about_ca_topic_score_codex":0.00034924483,"about_ca_topic_score_gemma":0.000080897014,"teacher_disagreement_score":0.93870115,"about_ca_system_score_codex":0.00007058634,"about_ca_system_score_gemma":0.000038039896,"threshold_uncertainty_score":0.4079596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04623018,0.00054283306,0.9510559,0.00017744969,0.000450461,0.00024313953,0.00011808345,0.000049528688,0.001132441],"genre_scores_gemma":[0.9423863,0.0000039578263,0.056975745,0.00008548935,0.000021009255,0.000020707026,0.000016368807,0.0000063807115,0.0004840081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.000027314027,0.00032564328,0.00027365118,0.00022791124,0.00015729312],"domain_scores_gemma":[0.99912935,0.00010504428,0.00012184314,0.00021624783,0.0003192521,0.000108261505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460365,0.000117052536,0.00027985888,0.000055451917,0.000048470058,0.000052452935,0.00031455254,0.000052848707,0.000008259036],"category_scores_gemma":[0.000036285513,0.0001000356,0.000066150285,0.00012641145,0.00006360745,0.0002941418,0.000039933566,0.0000652378,0.0000070954147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018673977,0.0027685098,0.013355582,0.00080843485,0.0007927371,0.000030639436,0.058514718,0.011623364,0.013266142,0.5138108,0.2570166,0.12614505],"study_design_scores_gemma":[0.0037040277,0.0014623075,0.002031869,0.00014029404,0.000030383108,0.00004320737,0.0050251083,0.92925465,0.020266037,0.0020458114,0.03542812,0.00056816597],"about_ca_topic_score_codex":0.000066884655,"about_ca_topic_score_gemma":0.00003340304,"teacher_disagreement_score":0.9176313,"about_ca_system_score_codex":0.000024995306,"about_ca_system_score_gemma":0.00009041741,"threshold_uncertainty_score":0.40793332},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008079177,0.00020867196,0.98851645,0.000070868875,0.0008670073,0.00048422886,0.00018758413,0.00054572395,0.0010402658],"genre_scores_gemma":[0.90370303,0.0000017759232,0.095773555,0.00008726402,0.00018823543,0.00003266505,0.0001608329,0.000020686639,0.000031974592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745685,0.000085209234,0.00058716204,0.00078041514,0.0002992217,0.00079112226],"domain_scores_gemma":[0.9981568,0.00017122395,0.0003375348,0.0007367075,0.00039419293,0.0002035372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056312134,0.00032044746,0.00040998182,0.00008775306,0.00044533037,0.00021514,0.001376604,0.00013780686,0.000007802539],"category_scores_gemma":[0.00007701012,0.00031908322,0.00020572076,0.0006368583,0.00006136308,0.00037521325,0.00026873214,0.00021247363,0.00003579983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022502869,0.0012588005,0.009931132,0.00032149412,0.0007215747,0.00047043356,0.010919681,0.0039609815,0.0011874489,0.26995456,0.010768696,0.6902802],"study_design_scores_gemma":[0.0012733401,0.00027355328,0.013694454,0.00019832782,0.00002474729,0.000059694226,0.00034093446,0.9756922,0.002392248,0.0023135524,0.0030132567,0.0007236713],"about_ca_topic_score_codex":0.000069185255,"about_ca_topic_score_gemma":0.0000040796517,"teacher_disagreement_score":0.97173125,"about_ca_system_score_codex":0.00011040963,"about_ca_system_score_gemma":0.00008071404,"threshold_uncertainty_score":0.99992615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05570958,0.00081857695,0.93037707,0.00009128001,0.002067753,0.0008637592,0.000011683594,0.00026785978,0.0097924555],"genre_scores_gemma":[0.99372476,0.000001078387,0.004917585,0.000066500346,0.00025839655,0.00004179386,0.0000053766717,0.000016867634,0.00096761005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980788,0.00022766982,0.0006223055,0.00036462868,0.00028824885,0.00041833014],"domain_scores_gemma":[0.99787587,0.0005189391,0.00039990497,0.0007634353,0.00033561068,0.00010622641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013768442,0.0002009867,0.00047475786,0.00009291845,0.00019514105,0.00030223155,0.0011552693,0.00009254999,0.0000058101896],"category_scores_gemma":[0.00006181602,0.00017421757,0.00013988656,0.00027554383,0.00007448367,0.00030241988,0.00014931076,0.00009809137,0.00007734901],"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.000009035865,0.00007989014,0.0002586751,0.0004762822,0.00007558805,0.0000019721551,0.0021577794,0.0012324974,0.0012024973,0.9719194,0.008593715,0.013992669],"study_design_scores_gemma":[0.0027945116,0.00064311025,0.0067049162,0.0020235695,0.000041069874,0.00014087519,0.0014650781,0.8858272,0.0022635069,0.04977811,0.04689555,0.001422532],"about_ca_topic_score_codex":0.00008232385,"about_ca_topic_score_gemma":0.0000011134786,"teacher_disagreement_score":0.9380152,"about_ca_system_score_codex":0.00004072948,"about_ca_system_score_gemma":0.00006164124,"threshold_uncertainty_score":0.7104386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89625865,0.00016090258,0.023791946,0.011953245,0.002896202,0.0015003909,0.00006310275,0.00037811618,0.06299744],"genre_scores_gemma":[0.9921904,0.000004319895,0.0072603566,0.000112355476,0.00005853337,0.000040599138,0.000001144497,0.000003789894,0.00032848434],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991353,0.0000020664345,0.00019356841,0.00027469377,0.0002575691,0.00013680889],"domain_scores_gemma":[0.99909407,0.000010532557,0.00018722733,0.00050940696,0.00015440528,0.000044338823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036841407,0.00007403183,0.00008892407,0.00002464716,0.000078786594,0.00007130908,0.0012147889,0.000028033077,0.0000053398585],"category_scores_gemma":[0.00008963555,0.000048836828,0.0000490164,0.00024914218,0.00003430751,0.0003265763,0.00032043146,0.00012614111,0.000012298986],"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.0000025242905,0.00006744034,0.0017932792,0.000035981975,0.000007845022,1.1299123e-7,0.00018206701,0.0000010108998,0.56899005,0.4119978,0.008593479,0.008328416],"study_design_scores_gemma":[0.0005003724,0.000043394626,0.010081649,0.00009178728,0.000011022573,0.000041156734,0.000055056116,0.0056377416,0.8418312,0.0067811683,0.13470244,0.00022302712],"about_ca_topic_score_codex":0.000033878514,"about_ca_topic_score_gemma":0.000002453319,"teacher_disagreement_score":0.40521663,"about_ca_system_score_codex":0.00001326218,"about_ca_system_score_gemma":0.000017152328,"threshold_uncertainty_score":0.22574002},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023611167,0.00018849774,0.9705511,0.0008066003,0.002293389,0.00019839586,0.0003224778,0.000024752158,0.0020036686],"genre_scores_gemma":[0.99207693,0.00003234333,0.006169434,0.00073626597,0.0005266071,0.0000048514153,0.00007810815,0.000005401321,0.0003700647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975002,0.00012469952,0.0011128128,0.00013643007,0.0009749884,0.00015086672],"domain_scores_gemma":[0.99672633,0.00006870469,0.0006150276,0.00046959415,0.001987004,0.0001333075],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0007340978,0.00013958555,0.00027384193,0.00026241923,0.00009288798,0.0018869697,0.002875718,0.000047518886,0.000040424235],"category_scores_gemma":[0.00013925406,0.00010935051,0.00005419816,0.00031011252,0.00002233851,0.014542278,0.0002259333,0.00014249115,0.00014627252],"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.00031342698,0.0002236342,0.0007929156,0.00006331887,0.0016138767,0.00018466577,0.013620745,0.6372149,0.0011408424,0.08645129,0.059246786,0.1991336],"study_design_scores_gemma":[0.00071407045,0.00008606922,0.0003024346,0.00030582614,0.000011546133,0.0008590034,0.00071960094,0.19922307,0.0003364437,0.000020027048,0.7971939,0.00022799615],"about_ca_topic_score_codex":0.000089266396,"about_ca_topic_score_gemma":0.0000037788443,"teacher_disagreement_score":0.96846575,"about_ca_system_score_codex":0.000121092526,"about_ca_system_score_gemma":0.00025444204,"threshold_uncertainty_score":0.9992408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009388498,0.00020804381,0.994787,0.0008722554,0.0001241167,0.0015282333,0.000029059642,0.0006554261,0.0008570159],"genre_scores_gemma":[0.13249445,0.000014138855,0.86597747,0.0001487891,0.00013789075,0.0010352663,0.00004606789,0.000033348242,0.00011257335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976445,0.00002761676,0.0006640999,0.0007103463,0.0004802646,0.0004731718],"domain_scores_gemma":[0.99733496,0.00010214623,0.00042527757,0.0016215733,0.0002794815,0.00023654586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002517435,0.00035014423,0.00043598274,0.00017816626,0.00040580652,0.00037624795,0.0014752024,0.00010801293,0.0000020282603],"category_scores_gemma":[0.000006923361,0.00030514307,0.000109696004,0.0010569405,0.0000851372,0.0004177476,0.00013563038,0.00020383147,0.00026432326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062107606,0.0020026772,0.00006382921,0.0009056627,0.00029040696,0.000025701878,0.014416147,0.032835472,0.004430258,0.77960557,0.0011652597,0.16425279],"study_design_scores_gemma":[0.003738751,0.00017464,0.0007706776,0.0013275454,0.00006236837,0.0007993958,0.0009610912,0.8721713,0.0018290618,0.03946987,0.07682706,0.0018682735],"about_ca_topic_score_codex":0.000050414164,"about_ca_topic_score_gemma":0.000009521325,"teacher_disagreement_score":0.8393358,"about_ca_system_score_codex":0.00022011758,"about_ca_system_score_gemma":0.00014289988,"threshold_uncertainty_score":0.9999401},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096184514,0.0005905965,0.90097487,0.00017025393,0.0004053979,0.00070652115,0.00038569683,0.000082650564,0.00049952004],"genre_scores_gemma":[0.9960707,0.000010551268,0.0033118275,0.000017468736,0.000013026666,0.00007286685,0.00002305494,0.000012033235,0.00046847237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836975,0.00010984126,0.0005367496,0.00049593067,0.00022515678,0.00026258884],"domain_scores_gemma":[0.9988685,0.00014300268,0.0002254657,0.00058983883,0.000108702705,0.000064452885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025347786,0.00020712658,0.00038260987,0.00017892366,0.00012119575,0.000097080614,0.0003794286,0.000052834974,0.000003834357],"category_scores_gemma":[0.000009087006,0.00018382983,0.00007438425,0.0003130931,0.00006114401,0.00064330193,0.000023595832,0.0001713737,0.0000061534133],"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.0014689189,0.007535336,0.009536872,0.0023719205,0.0012855696,0.0006416585,0.012197273,0.4096344,0.037998646,0.2256567,0.0009411264,0.29073155],"study_design_scores_gemma":[0.0056171753,0.0009791015,0.068766765,0.003134199,0.000064110536,0.0001936676,0.005840919,0.90443367,0.0025420582,0.00047084803,0.0064891772,0.0014682916],"about_ca_topic_score_codex":0.0064981193,"about_ca_topic_score_gemma":0.0009817376,"teacher_disagreement_score":0.8998862,"about_ca_system_score_codex":0.00014686561,"about_ca_system_score_gemma":0.00007539167,"threshold_uncertainty_score":0.9823256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01189146,0.0000628853,0.93644166,0.0010704269,0.00087899703,0.0010239566,0.00003768539,0.0003719953,0.048220944],"genre_scores_gemma":[0.98683864,0.0000012890758,0.012354334,0.000083018,0.00005884668,0.00008757176,0.000030638363,0.0000066299676,0.0005390461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986422,0.00008712726,0.00033541716,0.00043314524,0.00022478611,0.0002773203],"domain_scores_gemma":[0.9988967,0.00005819732,0.00010959109,0.0007248578,0.00010675667,0.00010385126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635108,0.0001311315,0.00020785828,0.00006083176,0.00008476618,0.0006474652,0.0018617461,0.00010444382,0.0000069385446],"category_scores_gemma":[0.000029573703,0.00011331937,0.000026851438,0.000609828,0.00001809037,0.00076913845,0.00041016328,0.00023049003,0.000086698514],"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.000010915979,0.00022018111,0.001190844,0.0000236548,0.000017504166,0.00002451426,0.0004927017,0.0005381293,0.00066175236,0.9832035,0.01002197,0.0035943508],"study_design_scores_gemma":[0.00088369974,0.0000615617,0.008027241,0.000050553543,0.0000028570098,0.000038020815,0.00029032608,0.6633408,0.00028548046,0.00052525295,0.32613254,0.00036162647],"about_ca_topic_score_codex":0.0008649645,"about_ca_topic_score_gemma":0.00033818276,"teacher_disagreement_score":0.98267823,"about_ca_system_score_codex":0.00005675477,"about_ca_system_score_gemma":0.0000858422,"threshold_uncertainty_score":0.62435216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041562565,0.0000212534,0.94593406,0.000305032,0.0010802838,0.00008224917,0.0000023816574,0.000118585274,0.010893579],"genre_scores_gemma":[0.935862,8.716579e-7,0.063057184,0.00019959043,0.00010539446,0.0000061256123,0.0000015294225,0.000003988088,0.0007632864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991847,0.000011163021,0.00016571884,0.00022629552,0.00022154037,0.00019053514],"domain_scores_gemma":[0.9995452,0.000016186767,0.000038350623,0.0002802806,0.000044338685,0.00007561161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018365754,0.000084391686,0.00009184337,0.000032570275,0.0001219364,0.00011688925,0.00034842125,0.000046362118,0.00016059089],"category_scores_gemma":[0.0000031334707,0.000072974675,0.000048259535,0.00012437938,0.000017879765,0.0003391038,0.000028275239,0.00013892309,0.000047199926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042202835,0.00067336747,0.0011861165,0.00011305008,0.00017809728,0.000113922826,0.0024029678,0.04445904,0.32483414,0.45375097,0.014376876,0.15786926],"study_design_scores_gemma":[0.0010726658,0.000042389158,0.0014831418,0.00002915775,0.000007682946,0.00018246961,0.00014841049,0.89563125,0.016256256,0.0008507349,0.08375828,0.00053756026],"about_ca_topic_score_codex":0.00006848646,"about_ca_topic_score_gemma":0.000033995664,"teacher_disagreement_score":0.89429945,"about_ca_system_score_codex":0.000016734451,"about_ca_system_score_gemma":0.000051655465,"threshold_uncertainty_score":0.2975821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047096696,0.00095364515,0.9000734,0.00040446446,0.0006167136,0.0020205916,0.000023168732,0.0012168168,0.047594473],"genre_scores_gemma":[0.97371805,0.000047419944,0.025836991,0.000098366654,0.000052003557,0.00014764915,0.0000020425389,0.000011924509,0.00008552921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986978,0.000046603647,0.00034756775,0.0003897914,0.00012579704,0.00039239528],"domain_scores_gemma":[0.9993841,0.00004675965,0.00013454424,0.00028262357,0.00007238874,0.00007957561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048256957,0.00016011685,0.0002582102,0.00013150425,0.00011421574,0.00022562093,0.00036966085,0.00006041287,5.125276e-7],"category_scores_gemma":[0.0000064207816,0.00014049193,0.00003341697,0.0002686896,0.000014182962,0.00072753604,0.0001359135,0.00007407246,0.0000037522293],"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.000010475992,0.000203947,0.0036991192,0.00051927264,0.0000729294,0.000016111264,0.033570778,0.000035627265,0.00073851773,0.956916,0.00024889526,0.0039683767],"study_design_scores_gemma":[0.0016778043,0.0004033923,0.026751205,0.00091819186,0.000022658585,0.00011803246,0.004340047,0.93608063,0.0007327672,0.0033013488,0.024572624,0.0010812918],"about_ca_topic_score_codex":0.00197422,"about_ca_topic_score_gemma":0.000084136846,"teacher_disagreement_score":0.9536146,"about_ca_system_score_codex":0.000057765934,"about_ca_system_score_gemma":0.000028483217,"threshold_uncertainty_score":0.5729095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053936923,0.00011887279,0.99068916,0.00034837687,0.0019243837,0.000614364,0.00013201345,0.0004673791,0.00031176818],"genre_scores_gemma":[0.86752915,0.00004322325,0.13142376,0.00015641964,0.00022626713,0.00012429275,0.00004011968,0.000029792676,0.00042697036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997339,0.00015032393,0.0005814514,0.00077236496,0.00070398016,0.00045287077],"domain_scores_gemma":[0.99765825,0.00012148637,0.00017936142,0.0016503001,0.00018125557,0.00020932533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024310306,0.00036653725,0.0003993025,0.00023330552,0.0007664766,0.00026494166,0.0011570054,0.00011076827,0.000019928853],"category_scores_gemma":[0.0000020164466,0.00032164322,0.00014169578,0.000715519,0.0000736971,0.0011894515,0.0000140940665,0.00032394368,0.0001263743],"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.00033467202,0.0031161571,0.0013336478,0.00058270973,0.0014700855,0.0011721331,0.0066172364,0.84524876,0.0014841632,0.019666454,0.0067328326,0.11224118],"study_design_scores_gemma":[0.0070117945,0.0015837797,0.00984725,0.0015054052,0.00013701514,0.0054165665,0.0003645212,0.9249528,0.002085953,0.00016448965,0.04420117,0.0027292643],"about_ca_topic_score_codex":0.0006044145,"about_ca_topic_score_gemma":0.00012416585,"teacher_disagreement_score":0.86213547,"about_ca_system_score_codex":0.00014559194,"about_ca_system_score_gemma":0.00012233168,"threshold_uncertainty_score":0.9999236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581695,0.0024974747,0.037086684,0.00009822393,0.00042844808,0.0003363932,0.00003420223,0.00009109927,0.0012579756],"genre_scores_gemma":[0.99691904,0.000072753304,0.0019596638,0.000064404194,0.000071761264,0.000044936925,0.0000066365556,0.000013268988,0.00084751117],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847925,0.00003117438,0.00052165834,0.00040961587,0.00022442383,0.00033390365],"domain_scores_gemma":[0.9991123,0.000033156633,0.00024216932,0.00029374077,0.00023623275,0.000082421044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020984198,0.00020503129,0.00033732905,0.000054343698,0.00019042121,0.00016734806,0.00045998933,0.00010400358,0.000017515005],"category_scores_gemma":[0.000007711586,0.00017314083,0.000064749314,0.00028840167,0.000091768656,0.00093482377,0.00005946663,0.00012983811,0.00002909832],"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.000029171038,0.00023010686,0.015492409,0.0036750876,0.00015180335,0.000007446165,0.009909744,0.0002828928,0.93194526,0.0014567598,0.0049057077,0.031913616],"study_design_scores_gemma":[0.006302439,0.0010560659,0.040574506,0.0039530834,0.00009321064,0.0016206442,0.0039356146,0.08621853,0.7720836,0.00047834608,0.08063755,0.003046434],"about_ca_topic_score_codex":0.0006344157,"about_ca_topic_score_gemma":0.0000068993486,"teacher_disagreement_score":0.15986167,"about_ca_system_score_codex":0.000024726503,"about_ca_system_score_gemma":0.000059498183,"threshold_uncertainty_score":0.7060478},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010200517,0.001411951,0.9782928,0.0011435496,0.003560194,0.0003439805,0.00008280619,0.000051595525,0.0049125776],"genre_scores_gemma":[0.99835294,0.00006298914,0.00089243485,0.00027593228,0.0002971818,0.0000059962194,0.00006217443,0.0000039490656,0.00004640197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967486,0.000091484224,0.001736937,0.00019756453,0.0010148208,0.00021059405],"domain_scores_gemma":[0.99605244,0.000027222648,0.0012638753,0.0004496771,0.002114665,0.00009210555],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015720591,0.00017431931,0.00036559804,0.00046923212,0.0000765149,0.0021484839,0.0033492905,0.00007449743,0.0000024007625],"category_scores_gemma":[0.00014168936,0.00014407023,0.000043099004,0.00048648575,0.000020671547,0.013244104,0.00020298075,0.0002693129,0.00003836126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003476949,0.00041775024,0.0041212607,0.0002651202,0.00029364586,0.000392125,0.014355019,0.38581216,0.0008598831,0.41965684,0.015671672,0.15780684],"study_design_scores_gemma":[0.001753254,0.000097687654,0.0018519438,0.0014902093,0.0000045832685,0.0006551437,0.0010918038,0.8595007,0.000053548414,0.00009260955,0.13312599,0.00028252462],"about_ca_topic_score_codex":0.000033516455,"about_ca_topic_score_gemma":0.000004344285,"teacher_disagreement_score":0.98815244,"about_ca_system_score_codex":0.00025158792,"about_ca_system_score_gemma":0.00028616504,"threshold_uncertainty_score":0.99888736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009602559,0.00007166535,0.98905176,0.000084674895,0.00007865882,0.0001705772,0.0000011613323,0.0001261535,0.00081278797],"genre_scores_gemma":[0.956163,0.0000035511412,0.043702394,0.000059626236,0.00005095874,0.0000067326464,0.000005592004,0.0000042688102,0.0000039006986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899876,0.000043313703,0.00035042642,0.0002614805,0.00016163688,0.00018440558],"domain_scores_gemma":[0.9992971,0.00015328302,0.00018536666,0.00021140283,0.000121149445,0.000031710246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029805693,0.00008981981,0.0001607692,0.00008400794,0.000053032792,0.000033518794,0.00047016022,0.00005378372,9.742594e-7],"category_scores_gemma":[0.000020289866,0.00009419903,0.000035066212,0.0007014841,0.00003471701,0.00017890976,0.00013241396,0.00012705837,0.0000039717925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034964135,0.00004237257,0.004364794,0.000007658814,0.0000034232303,0.0000030620467,0.00025000915,0.27330843,0.000029853525,0.019296058,0.000018614128,0.70267224],"study_design_scores_gemma":[0.000052947562,0.00001842805,0.011517169,0.00006483759,6.4966594e-7,0.000012885276,0.00003387951,0.9825708,0.00033841663,0.0048019867,0.00049329834,0.00009469704],"about_ca_topic_score_codex":0.000079665486,"about_ca_topic_score_gemma":0.0000075859,"teacher_disagreement_score":0.94656044,"about_ca_system_score_codex":0.000043450204,"about_ca_system_score_gemma":0.000027500886,"threshold_uncertainty_score":0.3841325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014929456,0.000038402763,0.87327266,0.00022519293,0.00015402398,0.000028904447,0.0000014257798,0.0001659896,0.11118394],"genre_scores_gemma":[0.9659187,0.000004162498,0.010180181,0.0002520038,0.00002064306,0.0000024523574,5.154774e-7,0.0000013083942,0.023620013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961984,0.0000071641266,0.000067539906,0.00011161169,0.00009644224,0.00009740862],"domain_scores_gemma":[0.9996703,0.0000068100826,0.000013846398,0.00025026905,0.000020881838,0.000037877457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040092928,0.000034252782,0.000047300528,0.000008047075,0.0000601183,0.000021745198,0.00030133594,0.000013471125,0.00003832914],"category_scores_gemma":[0.0000033608333,0.000026823549,0.000018962504,0.00012135293,0.000011367811,0.00019028397,0.000043059725,0.000024498146,0.00028414055],"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":[8.4426296e-7,0.000052024607,0.004022717,0.000005700911,0.0000063042808,0.00015116326,0.0004079891,0.00006354646,0.00043506743,0.91551846,0.069414414,0.009921764],"study_design_scores_gemma":[0.00028850653,0.0000312435,0.019244118,0.000004555271,2.9500382e-7,0.00009836205,0.000016449803,0.034249686,0.001545996,0.00033044288,0.94400245,0.00018789215],"about_ca_topic_score_codex":0.00002737964,"about_ca_topic_score_gemma":0.000001767675,"teacher_disagreement_score":0.95098925,"about_ca_system_score_codex":0.000005486908,"about_ca_system_score_gemma":0.00001733631,"threshold_uncertainty_score":0.36521468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06885799,0.000019768153,0.9275189,0.0012337371,0.0006992924,0.00029895396,0.000039254694,0.00010091258,0.0012311789],"genre_scores_gemma":[0.9434998,0.0000012858126,0.056072287,0.000304967,0.00006788192,0.000014175897,0.0000048062966,0.0000061936457,0.000028583161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792784,0.00006225535,0.0003730524,0.00055091805,0.0006287677,0.00045716934],"domain_scores_gemma":[0.99768305,0.00014116235,0.00016189614,0.00067715993,0.001075899,0.00026083988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216657,0.0001569312,0.0002922006,0.00011454728,0.0001964917,0.00029054473,0.0014989519,0.00006140296,0.0000063022817],"category_scores_gemma":[0.00016522146,0.00013249104,0.00005538221,0.0012122283,0.0011538843,0.00047714793,0.00042267336,0.000080264144,0.000016503838],"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.000020970147,0.000060490867,0.00005384566,0.000023702718,0.0000058396486,0.0000022272418,0.0013116099,0.0000709079,0.0058204634,0.9880028,0.0003192845,0.0043078964],"study_design_scores_gemma":[0.00076443696,0.00038401075,0.00037872276,0.00006941761,0.000007800023,0.000029660383,0.000027175602,0.9139033,0.03134159,0.05088396,0.0019307489,0.00027915233],"about_ca_topic_score_codex":0.0000073129404,"about_ca_topic_score_gemma":8.726485e-7,"teacher_disagreement_score":0.9371188,"about_ca_system_score_codex":0.000045227956,"about_ca_system_score_gemma":0.00036777905,"threshold_uncertainty_score":0.5402828},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23019816,0.00037062186,0.76756424,0.000024363248,0.0001303149,0.0001373279,0.0000016309338,0.00012418971,0.0014491585],"genre_scores_gemma":[0.9679465,0.000008417929,0.0318767,0.000041011772,0.00008040457,0.0000031669438,0.0000028109182,0.000008010999,0.000032959713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985684,0.000029863011,0.00041078543,0.00034430905,0.00029566622,0.00035094476],"domain_scores_gemma":[0.9990556,0.0000146616485,0.00016846746,0.00046360245,0.0002151665,0.00008250509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026905478,0.00017129089,0.00030334864,0.00006894236,0.00014577004,0.00018337092,0.00055292714,0.00007677893,0.0000017563583],"category_scores_gemma":[0.0000051428824,0.00013406889,0.00004491086,0.00048756544,0.000012594759,0.0008240067,0.000057269754,0.00013763011,0.0000019376128],"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.000006879105,0.00001669721,0.00057478406,0.00004105853,0.0000097100865,0.0000044662784,0.00009920169,0.99284196,0.00022530783,0.004400999,0.0000056786316,0.0017732409],"study_design_scores_gemma":[0.00025019044,0.00007465118,0.00014126394,0.00068851374,0.00000406247,0.000034356817,0.00011074519,0.9983991,0.00007824923,0.000009343018,0.000017004411,0.00019253563],"about_ca_topic_score_codex":0.00014046085,"about_ca_topic_score_gemma":0.0000039462943,"teacher_disagreement_score":0.7377483,"about_ca_system_score_codex":0.000042991574,"about_ca_system_score_gemma":0.00006350893,"threshold_uncertainty_score":0.54671705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034811337,0.0007092262,0.95997304,0.00050920574,0.0024783148,0.00024419973,0.00017726286,0.0001238069,0.0009736008],"genre_scores_gemma":[0.9759204,0.0000019946594,0.021543413,0.00046810604,0.0006452652,0.000062014944,0.000012317413,0.000012200215,0.0013343032],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990413,0.000027696595,0.00017452786,0.00022802483,0.0001530105,0.0003753919],"domain_scores_gemma":[0.99941504,0.00006269224,0.000053857977,0.00029564966,0.000057172685,0.00011559353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018874343,0.00012814677,0.00014844854,0.00004528135,0.0001304183,0.000073967574,0.00044492944,0.000062520434,0.00002636054],"category_scores_gemma":[0.0000070370324,0.00011318786,0.00012439674,0.00011069541,0.000028006345,0.00018306583,0.0000135337405,0.000098341865,0.000066765664],"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.0001234802,0.0007324884,0.00083734235,0.0004069355,0.0002625361,0.000021796925,0.008173025,0.002244944,0.4582281,0.0076402687,0.28682172,0.23450737],"study_design_scores_gemma":[0.0014053753,0.00009074314,0.004504912,0.00007625289,0.000021479842,0.000251767,0.00006414708,0.0034979982,0.22641645,0.0011757503,0.76181585,0.00067925785],"about_ca_topic_score_codex":0.00002314337,"about_ca_topic_score_gemma":0.0000065614236,"teacher_disagreement_score":0.94110906,"about_ca_system_score_codex":0.000029077295,"about_ca_system_score_gemma":0.000036933157,"threshold_uncertainty_score":0.4615667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086666355,0.00033584627,0.9880597,0.00015417874,0.0012057604,0.00059893815,0.00009404473,0.00018671437,0.00069818925],"genre_scores_gemma":[0.99601203,0.0000037386949,0.0036303713,0.000053735184,0.00009591403,0.0000653573,0.00011968069,0.000011067425,0.0000081172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752796,0.00008167002,0.00093192403,0.00035737487,0.00033386805,0.0007671803],"domain_scores_gemma":[0.9982021,0.0003382642,0.00046563565,0.0006016368,0.00027986907,0.00011252721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012366415,0.00025910098,0.00033278397,0.00010181929,0.00075467105,0.0010089304,0.0012940911,0.0001420483,8.1174556e-7],"category_scores_gemma":[0.00012461146,0.00021019725,0.0001181341,0.00063062273,0.00008400942,0.0010111626,0.00021881331,0.00025112508,0.000014593132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018215338,0.00039129105,0.008705511,0.0010316911,0.00029691862,0.0000838076,0.020887747,0.08146242,0.00073126156,0.32737255,0.023207119,0.5356475],"study_design_scores_gemma":[0.0007129982,0.000045897825,0.0067194435,0.0003252561,0.0000064521614,0.00001701964,0.0013450567,0.9761412,0.000272846,0.0002637322,0.013849916,0.000300138],"about_ca_topic_score_codex":0.00038851946,"about_ca_topic_score_gemma":0.000024910998,"teacher_disagreement_score":0.9873454,"about_ca_system_score_codex":0.0001603021,"about_ca_system_score_gemma":0.00011489167,"threshold_uncertainty_score":0.9729139},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015070277,0.001635266,0.9282715,0.0002912292,0.00038358208,0.0007963408,0.066841185,0.00019663054,0.00007725989],"genre_scores_gemma":[0.7898236,0.00017121465,0.093347356,0.00018196205,0.00025008267,0.00011702171,0.1160682,0.00002405083,0.00001653285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970985,0.000103124796,0.000460635,0.0014314414,0.0003481441,0.0005581256],"domain_scores_gemma":[0.99546695,0.00011130017,0.00019758588,0.0038932208,0.00007385245,0.0002570825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073261635,0.00032231148,0.00037417343,0.00007738052,0.0004935938,0.0005358897,0.003201032,0.000057966874,0.0000011599902],"category_scores_gemma":[0.000049315444,0.00028110153,0.00003534345,0.00028562653,0.00006658804,0.0018718828,0.0015868105,0.00018128456,0.0000063793163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031600642,0.0009870976,0.0006206861,0.0010530247,0.0006409367,0.00035573376,0.00054100953,0.21512201,0.00014041188,0.7107523,0.024734152,0.04473662],"study_design_scores_gemma":[0.0034638268,0.00029913007,0.0016644229,0.0008287836,0.00014087616,0.00016780307,0.001252328,0.60875374,0.000021283779,0.0012049053,0.3810396,0.0011632994],"about_ca_topic_score_codex":0.0006214988,"about_ca_topic_score_gemma":0.00018166436,"teacher_disagreement_score":0.8349241,"about_ca_system_score_codex":0.000045402245,"about_ca_system_score_gemma":0.00006688944,"threshold_uncertainty_score":0.9999641},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052570184,0.00032883062,0.98536336,0.006683223,0.0004950745,0.0014114896,0.00006463451,0.00025169697,0.0001446769],"genre_scores_gemma":[0.10701819,0.0000036442161,0.8836157,0.004591454,0.00074013305,0.0023588417,0.000754596,0.00004837558,0.0008690912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803543,0.000056525943,0.0005107642,0.0006612049,0.0002465368,0.0004895413],"domain_scores_gemma":[0.99872446,0.000077397985,0.00029121435,0.0003566251,0.00043872482,0.00011156107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019104074,0.0002914089,0.0003212206,0.00012040172,0.00044236737,0.000904484,0.0006059013,0.00011716424,0.000026813552],"category_scores_gemma":[0.000027675842,0.0002655499,0.00011935858,0.00032221002,0.000047802696,0.0014536027,0.00005978639,0.00013791547,0.000028997734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005094377,0.00027421396,0.00007170996,0.00057469687,0.00013044513,0.0000053970093,0.00157968,0.014817363,0.14840662,0.0010972238,0.41577658,0.4172151],"study_design_scores_gemma":[0.0014397571,0.000055057844,0.0004089233,0.00007228044,0.000012555894,0.000013783153,0.000022339005,0.99041665,0.00040091033,0.00034119582,0.0064293393,0.00038719238],"about_ca_topic_score_codex":0.00005305928,"about_ca_topic_score_gemma":0.000007785031,"teacher_disagreement_score":0.9755993,"about_ca_system_score_codex":0.00007203592,"about_ca_system_score_gemma":0.00006931975,"threshold_uncertainty_score":0.9999797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014301686,0.00024529384,0.9754253,0.0052351095,0.00067716563,0.000728956,0.00011125139,0.00023712877,0.0030381202],"genre_scores_gemma":[0.7973026,0.0000023491884,0.19001502,0.0013466756,0.00023768166,0.00018729949,0.00019943489,0.00001857676,0.010690382],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985905,0.000032236727,0.00020802033,0.00050953886,0.00030653985,0.0003531268],"domain_scores_gemma":[0.9982065,0.00011254447,0.0000506111,0.0013002955,0.00019269406,0.00013734328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034916544,0.0001169086,0.00016042804,0.000039975384,0.00014609964,0.00024892992,0.0017227201,0.000053598753,0.0000498808],"category_scores_gemma":[0.000047482965,0.000089800305,0.00003524996,0.00022787126,0.00003265098,0.001183503,0.0006865854,0.00007507591,0.00032876336],"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.0000045463007,0.00010821683,0.00029669137,0.000040367286,0.000026424132,0.000005533211,0.00014156585,0.00057253795,0.0009336766,0.33261496,0.6531896,0.012065909],"study_design_scores_gemma":[0.00042420728,0.00006523672,0.0016005739,0.000028885992,0.0000022268105,0.0000122711135,0.000020926482,0.7117938,0.00016849203,0.0034837697,0.28220552,0.00019408122],"about_ca_topic_score_codex":0.00051971944,"about_ca_topic_score_gemma":0.00001151228,"teacher_disagreement_score":0.7854103,"about_ca_system_score_codex":0.000025103966,"about_ca_system_score_gemma":0.00010671695,"threshold_uncertainty_score":0.42256972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0837679,0.0000520852,0.9096244,0.00056582084,0.000116130796,0.00025574208,0.0000069111384,0.00032071435,0.0052903276],"genre_scores_gemma":[0.992629,0.000007021875,0.006586274,0.000043975117,0.000010126577,0.000039474817,0.000015100218,0.0000066196735,0.0006624225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873084,0.000036546822,0.0003105622,0.00034267837,0.00025198987,0.0003273676],"domain_scores_gemma":[0.9994304,0.000021430422,0.000073067305,0.00027925958,0.000117847405,0.00007798588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021010223,0.0001309947,0.00018595238,0.000053786753,0.00007143068,0.0002711304,0.0003728704,0.00007150509,0.000066076595],"category_scores_gemma":[0.0000102096965,0.00011400337,0.00003851669,0.00055863574,0.00001619221,0.001122705,0.00002542925,0.00010629519,0.0002840589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024921392,0.0006504921,0.00471101,0.00041326095,0.000041188792,0.000092137314,0.0031970742,0.007510701,0.16669106,0.0045813615,0.0072361864,0.8048506],"study_design_scores_gemma":[0.00035209415,0.000018671426,0.025098605,0.0000883545,0.0000013821526,0.000014481809,0.000051715102,0.9730349,0.00027623805,0.00034591314,0.00052470446,0.00019294127],"about_ca_topic_score_codex":0.0011116031,"about_ca_topic_score_gemma":0.000113007365,"teacher_disagreement_score":0.9655242,"about_ca_system_score_codex":0.00021562533,"about_ca_system_score_gemma":0.000092704235,"threshold_uncertainty_score":0.46489227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077093234,0.00093013037,0.98614067,0.0032294153,0.00062378484,0.00016297925,0.000007883133,0.0003650295,0.0008307668],"genre_scores_gemma":[0.9245591,0.000004694101,0.072929256,0.0017369491,0.00044830184,0.0000456431,0.000045791294,0.000018767996,0.00021148258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801683,0.000057513134,0.00039163925,0.0005689031,0.00046797155,0.0004971473],"domain_scores_gemma":[0.9992933,0.000026219865,0.00019449029,0.00033016768,0.000064401196,0.00009140685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022516333,0.00023991911,0.00024699778,0.000084453844,0.00031210948,0.00046956982,0.0007625065,0.0000691429,0.0000041678063],"category_scores_gemma":[0.0000058709984,0.00021534412,0.00008526182,0.00039914445,0.00008045135,0.00068805506,0.00016767533,0.0001788626,0.0001017095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014322339,0.00048068954,0.00096311833,0.00024800596,0.000030416753,0.00028312413,0.0009245571,0.0032563887,0.016567642,0.018660942,0.102569595,0.8560012],"study_design_scores_gemma":[0.0022004463,0.00009406789,0.0060006455,0.00033694116,0.000017321385,0.00012716568,0.000029905555,0.79531604,0.00037915612,0.001039688,0.19335368,0.0011049322],"about_ca_topic_score_codex":0.00012123643,"about_ca_topic_score_gemma":0.00000578742,"teacher_disagreement_score":0.9168498,"about_ca_system_score_codex":0.0000770208,"about_ca_system_score_gemma":0.00004017647,"threshold_uncertainty_score":0.8781478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010952669,0.00006141255,0.98121387,0.00703111,0.00019132724,0.00022196406,0.000023034292,0.00007548284,0.0002291259],"genre_scores_gemma":[0.9566275,0.0000035742623,0.042819716,0.00024934596,0.00011455478,0.0000775998,0.000009795021,0.00000728198,0.0000906657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988063,0.00007281865,0.00036139906,0.0003025055,0.00023887158,0.00021812078],"domain_scores_gemma":[0.9988484,0.00021430165,0.00005662156,0.0007392216,0.0001032673,0.000038208364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049783225,0.00009746464,0.00013905912,0.00006300871,0.00006790258,0.00007191106,0.0007181784,0.000047138976,0.0000049780824],"category_scores_gemma":[0.00016791023,0.00007974382,0.000036186124,0.00038294127,0.000019912355,0.00007809775,0.0001953382,0.00011551119,0.00009527618],"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.00004167436,0.0004461684,0.00038035028,0.000086435044,0.000012394039,0.00003825583,0.0009167756,0.6911609,0.0010507456,0.013162616,0.02401161,0.26869205],"study_design_scores_gemma":[0.00017274426,0.000031360036,0.0006980212,0.00003347674,0.0000015944988,0.000007712926,0.000019545781,0.9562038,0.00020027958,0.0018172747,0.040710147,0.00010401576],"about_ca_topic_score_codex":0.0011313545,"about_ca_topic_score_gemma":0.00004601544,"teacher_disagreement_score":0.9456748,"about_ca_system_score_codex":0.00003327606,"about_ca_system_score_gemma":0.000022226506,"threshold_uncertainty_score":0.32518584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03639401,0.000041474737,0.94880855,0.002411389,0.002170436,0.00006821251,0.000025210107,0.000022594464,0.01005815],"genre_scores_gemma":[0.99442494,0.000009728361,0.004869876,0.00050056004,0.00016966675,7.592214e-7,0.000014304587,0.000001089903,0.000009060239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818844,0.000022394257,0.000831213,0.000054093656,0.00079100777,0.00011286516],"domain_scores_gemma":[0.99775434,0.000060368115,0.0006024947,0.00013728722,0.0013572976,0.00008821143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433967,0.00007142894,0.00010931001,0.00017075035,0.000038647835,0.00016901353,0.00083394867,0.000039820345,0.00004870473],"category_scores_gemma":[0.00012639133,0.00005973087,0.000094121795,0.00012842267,0.000028475037,0.0026518288,0.00008574117,0.00014272168,0.000033509343],"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.0002043944,0.000317458,0.0056800074,0.000035151308,0.00020522301,0.000081283186,0.008066192,0.00036498503,0.00022934591,0.82079965,0.017055914,0.14696038],"study_design_scores_gemma":[0.002591754,0.00021473078,0.10468463,0.00014814123,0.000008978958,0.0010043281,0.0011368919,0.018086262,0.0030634343,0.023330992,0.845354,0.00037585222],"about_ca_topic_score_codex":0.000020868772,"about_ca_topic_score_gemma":0.000005161574,"teacher_disagreement_score":0.95803094,"about_ca_system_score_codex":0.00012549103,"about_ca_system_score_gemma":0.000085306725,"threshold_uncertainty_score":0.24357542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020432281,0.00013924939,0.6915367,0.00027183004,0.000105751096,0.00003492115,0.0000033432977,0.00012407082,0.3057409],"genre_scores_gemma":[0.99043614,9.086851e-7,0.006816727,0.0002883934,0.00007560569,0.0000048561433,0.000004676025,0.000001917783,0.0023707906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999286,0.000038126018,0.0001209039,0.00014687792,0.00015776837,0.00025033022],"domain_scores_gemma":[0.9994069,0.000032928478,0.000036169262,0.00037907084,0.000031514355,0.00011344611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023653917,0.00006485072,0.00012894385,0.00008217266,0.00005464692,0.00007122144,0.0003720712,0.000026652779,0.000088512956],"category_scores_gemma":[0.000008550983,0.000051020364,0.0000947865,0.0009425525,0.000013009147,0.00035609488,0.00008337175,0.00004345597,0.00026513173],"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":[5.0512847e-7,0.000036421658,0.009099911,0.0000013345252,0.000094744406,0.0000011568986,0.00033059635,0.000030355875,0.000026266378,0.9835828,0.0036217668,0.0031741275],"study_design_scores_gemma":[0.000118236974,0.000011550578,0.06924711,0.0000036489955,0.000040136554,0.000005431824,0.0001592228,0.01003304,0.00039848828,0.00012301927,0.9196755,0.00018456788],"about_ca_topic_score_codex":0.000029167222,"about_ca_topic_score_gemma":0.000007358251,"teacher_disagreement_score":0.9883929,"about_ca_system_score_codex":0.000015723277,"about_ca_system_score_gemma":0.000006503134,"threshold_uncertainty_score":0.34078205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49075308,0.000121538025,0.50839394,0.00009238014,0.00014750542,0.0003378564,0.0000030067367,0.000027464188,0.00012322543],"genre_scores_gemma":[0.9698376,0.0000016905193,0.030085027,0.000013632703,0.000024980847,0.000012888076,0.0000034238954,0.0000042725837,0.000016476992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837166,0.00015039666,0.0006564612,0.0003847572,0.00020981037,0.00022691982],"domain_scores_gemma":[0.99806833,0.0004938203,0.0003803503,0.0005386989,0.0004507889,0.00006800972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148155,0.00013006362,0.0003139843,0.00003592552,0.00007539361,0.00009787847,0.0003365576,0.00005628396,0.00001939825],"category_scores_gemma":[0.00032305243,0.00010693589,0.00005358045,0.00044427943,0.0001107605,0.00053342915,0.00016814712,0.0001024308,0.0000028510306],"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.000075715856,0.0007204076,0.051346775,0.0012210505,0.00012186553,0.0000012163898,0.0031210377,0.651089,0.039816253,0.09418919,0.00040925454,0.1578882],"study_design_scores_gemma":[0.00016041378,0.000060618877,0.012294495,0.00016346016,0.000005956698,0.0000070216925,0.000090591835,0.9782896,0.0011485924,0.0076094866,0.000035677378,0.00013410371],"about_ca_topic_score_codex":0.001371441,"about_ca_topic_score_gemma":0.000036883575,"teacher_disagreement_score":0.47908452,"about_ca_system_score_codex":0.000041206084,"about_ca_system_score_gemma":0.000052928084,"threshold_uncertainty_score":0.4360719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03319113,0.00010157151,0.9310128,0.0006585769,0.00043179604,0.000085228676,0.0000017797677,0.00021129202,0.03430585],"genre_scores_gemma":[0.9858045,7.7513425e-7,0.013683995,0.00025431297,0.00003480299,0.000006597849,0.0000011614003,0.0000028588126,0.00021098625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.000008534193,0.00013406042,0.0002345885,0.00017708614,0.00021381842],"domain_scores_gemma":[0.99945796,0.000008563567,0.000028516677,0.00039464765,0.000031379997,0.00007896404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009731651,0.0000777689,0.00009112387,0.000028076005,0.000071331015,0.00009933845,0.00047126535,0.000030162333,0.000031751046],"category_scores_gemma":[0.0000044427316,0.00006210543,0.000040648352,0.00015171208,0.000016724736,0.00006226557,0.00007987944,0.00004762321,0.00067175546],"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.0000013742996,0.00018781617,0.000052090138,0.000011932398,0.000010507347,0.000062457184,0.00036684587,0.07722798,0.0007143282,0.90315586,0.001499505,0.016709305],"study_design_scores_gemma":[0.0070830625,0.0006674576,0.0170623,0.0002515862,0.00001603945,0.00072172907,0.00024750255,0.771759,0.02262958,0.020893998,0.15614669,0.0025210932],"about_ca_topic_score_codex":0.00006305266,"about_ca_topic_score_gemma":0.0000060087996,"teacher_disagreement_score":0.95261335,"about_ca_system_score_codex":0.000060314713,"about_ca_system_score_gemma":0.00005476077,"threshold_uncertainty_score":0.8634281},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64209336,0.00010328619,0.35518926,0.00012655211,0.00022278687,0.00011114531,0.0000025382658,0.000050498234,0.0021005527],"genre_scores_gemma":[0.9909037,7.361716e-7,0.008943437,0.00004774609,0.000048072598,0.000002798821,0.0000016456889,0.0000042815395,0.000047577414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988458,0.00012935726,0.0003233607,0.00023182698,0.00021443109,0.0002551948],"domain_scores_gemma":[0.99925333,0.00022493895,0.00016352323,0.00020300089,0.00010851117,0.000046680627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278389,0.000093364586,0.00022789171,0.00006405902,0.000073562514,0.000072145325,0.00036656758,0.000057580495,0.000012699965],"category_scores_gemma":[0.000066205204,0.000094269606,0.000045200046,0.00044147414,0.000021696282,0.00037169826,0.00007469604,0.00014892567,0.00001735117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023147146,0.0011081708,0.2806352,0.00045387115,0.00014796814,0.000044738415,0.0074968194,0.08306669,0.03588647,0.016805204,0.004798607,0.5695331],"study_design_scores_gemma":[0.0004866782,0.000020491862,0.2542009,0.00016352664,0.0000019269394,0.00001528685,0.00008176293,0.74217564,0.0017518582,0.0006884955,0.00022512591,0.00018828109],"about_ca_topic_score_codex":0.0012711951,"about_ca_topic_score_gemma":0.000016620419,"teacher_disagreement_score":0.659109,"about_ca_system_score_codex":0.000070017064,"about_ca_system_score_gemma":0.000062920255,"threshold_uncertainty_score":0.38442028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02983743,0.00059241033,0.96733403,0.00082137896,0.000056385943,0.0011665991,0.000012580675,0.000007461787,0.00017172834],"genre_scores_gemma":[0.93175095,0.00016641476,0.067676395,0.00014321235,0.000014428048,0.00022862772,0.000007240431,0.0000040278437,0.00000872436],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986703,0.00027240216,0.0002698004,0.00033840782,0.00029222723,0.0001568863],"domain_scores_gemma":[0.99912834,0.00012285575,0.00016636879,0.00055521703,0.000011366544,0.00001584444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008915447,0.00015701872,0.00018037329,0.00005618275,0.000033721855,0.000095451396,0.0008694648,0.00007638598,0.0000056351264],"category_scores_gemma":[0.0000036643971,0.00007248515,0.000024311681,0.000109509674,0.0000647772,0.00010541433,0.00017760774,0.00042612708,7.244996e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006570262,0.0006008975,0.021417005,0.00045540425,0.000044812936,0.000050362432,0.09449364,0.112245075,0.00073578424,0.016552212,0.00026499716,0.7530741],"study_design_scores_gemma":[0.007855472,0.0010974505,0.66327363,0.00096260017,0.000062751074,0.00021076358,0.022851972,0.22335656,0.00183834,0.013575063,0.06288374,0.0020316578],"about_ca_topic_score_codex":0.00035690414,"about_ca_topic_score_gemma":0.0013461536,"teacher_disagreement_score":0.9019135,"about_ca_system_score_codex":0.0000140949,"about_ca_system_score_gemma":0.00004039278,"threshold_uncertainty_score":0.29558587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8282051,0.010872913,0.005062136,0.006889109,0.009105797,0.015149262,0.0019335841,0.020647254,0.102134846],"genre_scores_gemma":[0.97882676,0.000028938644,0.019199373,0.00020128977,0.00035384012,0.0010000418,0.000036345726,0.00007827897,0.00027512343],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99371934,0.00029564442,0.0019055966,0.0013632644,0.001174368,0.0015417979],"domain_scores_gemma":[0.9949112,0.00080420147,0.0005924818,0.0027080013,0.00032931505,0.00065481255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023975498,0.00081649394,0.0015269652,0.00017840807,0.0004471877,0.00022434529,0.0026142034,0.0008844397,0.00003123491],"category_scores_gemma":[0.0006058253,0.00067864795,0.0007715421,0.0009901345,0.00070170016,0.0014042644,0.00052724686,0.00076605234,0.00007354253],"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.00025215233,0.00089485734,0.00045637635,0.00059223565,0.000074913514,0.000012472245,0.00009096305,0.00012490933,0.7169667,0.27103233,0.006571393,0.00293074],"study_design_scores_gemma":[0.0011743892,0.0013798488,0.8798658,0.0005226339,0.00007475156,0.00024125454,0.00026684857,0.000011862826,0.00018800003,0.00026591404,0.1150008,0.0010078504],"about_ca_topic_score_codex":0.000072457995,"about_ca_topic_score_gemma":0.0020097136,"teacher_disagreement_score":0.8794095,"about_ca_system_score_codex":0.00043346724,"about_ca_system_score_gemma":0.00014657082,"threshold_uncertainty_score":0.9995665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061262548,0.00025436337,0.9229743,0.000576489,0.0015076125,0.00009274509,0.00002501039,0.00018409675,0.013122837],"genre_scores_gemma":[0.98992723,0.0000014122571,0.005576509,0.00020025473,0.0002281888,0.000008545114,0.000006022084,0.00000576228,0.004046092],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924076,0.000020655378,0.00016486092,0.00022862737,0.00015287199,0.00019220628],"domain_scores_gemma":[0.99960065,0.000017841427,0.000040119234,0.00026068295,0.00004518081,0.000035532164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009294221,0.00008759632,0.000100176854,0.000033940643,0.0000949812,0.00012116321,0.00037640802,0.000046373614,0.00002239519],"category_scores_gemma":[9.2536345e-7,0.00008376423,0.000063248655,0.00017916267,0.000028034878,0.00021883061,0.000008455417,0.00007273714,0.00019493607],"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.000015688809,0.00036801648,0.0002789971,0.000049538758,0.00004246967,0.00009570314,0.00031788548,0.0021068319,0.7215926,0.03993659,0.20786285,0.027332794],"study_design_scores_gemma":[0.0019531427,0.00006425909,0.009977279,0.000060442133,0.00001178222,0.0003234101,0.000028069098,0.012565887,0.327532,0.008976295,0.63765466,0.00085276965],"about_ca_topic_score_codex":0.00018100612,"about_ca_topic_score_gemma":0.0000315147,"teacher_disagreement_score":0.9286647,"about_ca_system_score_codex":0.0000356288,"about_ca_system_score_gemma":0.000044249817,"threshold_uncertainty_score":0.3415806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018675298,0.00022719977,0.8776687,0.00043547843,0.00059641345,0.000049490332,0.0000017964755,0.000120983874,0.11903242],"genre_scores_gemma":[0.98794234,0.0000020179386,0.008656453,0.0005737542,0.000106003055,0.000006705425,0.000001589946,0.0000016022349,0.0027095566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994483,0.000011218769,0.00008950587,0.00009441776,0.0001358284,0.0002207166],"domain_scores_gemma":[0.9995933,0.0000071386844,0.000020042873,0.00027143554,0.000024679215,0.00008339489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016768329,0.000047018446,0.000054112163,0.000012326527,0.000040042756,0.00005967127,0.00027867133,0.000016421161,0.000042650037],"category_scores_gemma":[0.0000037606756,0.000036545094,0.00002078257,0.00012461598,0.000006881955,0.00047773632,0.00006950933,0.000025958461,0.00030683115],"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":[4.479212e-7,0.00007679715,0.0041830004,0.000004124372,0.0000057997277,0.0000011901352,0.00025982357,0.000005064106,0.00027731582,0.9088708,0.060669124,0.025646504],"study_design_scores_gemma":[0.00011357071,0.000012608134,0.007740401,0.0000040407363,6.011662e-7,0.000009709235,0.000014750445,0.0026823424,0.00046831023,0.00017931132,0.9886802,0.000094181516],"about_ca_topic_score_codex":0.000023589982,"about_ca_topic_score_gemma":9.3315873e-7,"teacher_disagreement_score":0.9860748,"about_ca_system_score_codex":0.000014947042,"about_ca_system_score_gemma":0.000009342534,"threshold_uncertainty_score":0.39437962},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046852333,0.000064554755,0.96100307,0.0013308914,0.000532247,0.00018836251,0.000020536132,0.00020490302,0.03197021],"genre_scores_gemma":[0.9107238,0.0000039057536,0.0871043,0.00050253316,0.000058274,0.000022260636,0.000028875738,0.000004515316,0.0015515353],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992069,0.000021216494,0.00012223628,0.00033401782,0.00014636698,0.00016927943],"domain_scores_gemma":[0.998517,0.000017239301,0.00003060322,0.0012938045,0.00007159555,0.00006975872],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104036815,0.00007047163,0.00008767716,0.000028046077,0.00005251646,0.00021610672,0.0016642751,0.000032329914,0.00010432521],"category_scores_gemma":[0.000012979605,0.000052668274,0.00001724307,0.0002638603,0.000019428795,0.001479861,0.00046572156,0.00006297846,0.000879715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6170705e-7,0.00008098331,0.0009852304,0.000008305379,0.000032112428,0.0000072237403,0.00029089744,0.000022543421,0.00046949205,0.28098273,0.41498148,0.30213845],"study_design_scores_gemma":[0.00041322384,0.000046314835,0.016745457,0.000021877791,0.0000031916447,0.000023462931,0.00013748078,0.79897374,0.0003228772,0.027897594,0.15498024,0.00043453855],"about_ca_topic_score_codex":0.0004088573,"about_ca_topic_score_gemma":0.00001353897,"teacher_disagreement_score":0.9060386,"about_ca_system_score_codex":0.0000065888926,"about_ca_system_score_gemma":0.000020809599,"threshold_uncertainty_score":0.9998982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05905445,0.00024701803,0.93728054,0.00046037097,0.0009832223,0.00039300657,0.00018453358,0.00032497308,0.0010718835],"genre_scores_gemma":[0.9834828,0.00000575302,0.015578427,0.0002208117,0.000242085,0.000022248669,0.00023415376,0.000014275759,0.0001994739],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768746,0.000043464304,0.00053555274,0.00063178793,0.00037079718,0.00073093845],"domain_scores_gemma":[0.9984337,0.00013355911,0.00022327928,0.00072339864,0.0003140929,0.00017198747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039909108,0.00025784917,0.0003581341,0.00006131891,0.00073543517,0.00022443233,0.0010259667,0.00009233029,0.000012070353],"category_scores_gemma":[0.0000698311,0.00025265012,0.00017769828,0.00063740835,0.00006802525,0.00029527416,0.00021269998,0.00014446073,0.000075297256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001991462,0.0030224097,0.029541373,0.00058273383,0.0006675191,0.0008480909,0.0020728833,0.03555658,0.008683004,0.32807243,0.4848797,0.10587413],"study_design_scores_gemma":[0.002059432,0.00022285324,0.007867376,0.00013692085,0.000013753962,0.00016179874,0.000039792736,0.742118,0.0022760392,0.00051504426,0.24386266,0.0007263445],"about_ca_topic_score_codex":0.000031478154,"about_ca_topic_score_gemma":0.0000016502058,"teacher_disagreement_score":0.92442834,"about_ca_system_score_codex":0.00006373929,"about_ca_system_score_gemma":0.00010183659,"threshold_uncertainty_score":0.99999255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8700023,0.00037545373,0.11497895,0.011901199,0.0018628637,0.00019087624,0.0000164529,0.00004081539,0.000631036],"genre_scores_gemma":[0.9700554,0.000003926184,0.029100548,0.00047198875,0.00015698798,7.939309e-7,4.393269e-7,0.0000067304286,0.00020317042],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871284,0.00012024801,0.00032874898,0.00012580743,0.0005111603,0.00020119129],"domain_scores_gemma":[0.9975743,0.00006604038,0.0004718573,0.0013651081,0.0003509024,0.00017176106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368216,0.000113468566,0.00023445733,0.00005483421,0.000084168074,0.00023417469,0.003620784,0.00004288147,0.0000026765954],"category_scores_gemma":[0.00031542388,0.000060867213,0.000100918725,0.00032659786,0.00007453975,0.0006507066,0.00058974104,0.00027099528,0.000014199302],"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.00084162917,0.0010489408,0.121806554,0.000081247264,0.0007818836,0.00085710996,0.0045768344,0.0028814748,0.0023426116,0.07280719,0.7654657,0.026508871],"study_design_scores_gemma":[0.0126633365,0.002199722,0.33143258,0.0013154547,0.00017675631,0.013879709,0.00073470897,0.070028916,0.0027542885,0.052482236,0.51085365,0.0014786269],"about_ca_topic_score_codex":0.000056681718,"about_ca_topic_score_gemma":0.000028449613,"teacher_disagreement_score":0.25461197,"about_ca_system_score_codex":0.00009468482,"about_ca_system_score_gemma":0.00020416483,"threshold_uncertainty_score":0.6728378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040820808,0.00014816769,0.9956228,0.0010642809,0.0008580386,0.00066312146,0.00003732254,0.00011789046,0.00108013],"genre_scores_gemma":[0.8074259,0.00003301806,0.18908781,0.0004271663,0.00034049794,0.0003255626,0.000025956866,0.000014663797,0.0023194358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879783,0.00002647652,0.00027814152,0.00033125177,0.00018192428,0.00038439795],"domain_scores_gemma":[0.998886,0.0002615544,0.00009069639,0.00044668163,0.00024153481,0.000073545365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004288711,0.0001249639,0.00017046886,0.000018140438,0.0009936057,0.0005231955,0.0013442308,0.00006747578,0.0000037218897],"category_scores_gemma":[0.00009339396,0.00008393547,0.0001220035,0.00015533627,0.000047694386,0.000482727,0.00010483889,0.000068560475,0.0000030145052],"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.000084193525,0.00014574478,0.00008520652,0.00009691845,0.000076982484,0.000014290507,0.00018869493,0.01285899,0.00029579,0.8997148,0.05668365,0.029754702],"study_design_scores_gemma":[0.0010480818,0.000054464683,0.00080997066,0.00001394273,0.000010711831,0.00005579027,0.000011499679,0.81987745,0.00014140226,0.017454099,0.16029589,0.00022671805],"about_ca_topic_score_codex":0.00005613782,"about_ca_topic_score_gemma":0.000007838387,"teacher_disagreement_score":0.88226074,"about_ca_system_score_codex":0.00001968622,"about_ca_system_score_gemma":0.00008563503,"threshold_uncertainty_score":0.76421124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0701034,0.00024155412,0.9239806,0.0001582736,0.0008600277,0.0007113399,0.00279796,0.00041907508,0.0007277523],"genre_scores_gemma":[0.9647329,0.0000019834968,0.03399343,0.00005056236,0.0001029492,0.000010339468,0.0010723416,0.00002264625,0.000012835715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951001,0.00031715608,0.0017953503,0.0011737263,0.00054261537,0.0010710887],"domain_scores_gemma":[0.99547213,0.00088231085,0.0010285743,0.0015050174,0.00083247933,0.0002794753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023464195,0.000462003,0.00085684774,0.00011864629,0.00053992093,0.00028571472,0.0015378916,0.00023364997,0.0000025501402],"category_scores_gemma":[0.0011927445,0.00047565135,0.00039564367,0.0015622608,0.00014261607,0.0003372133,0.00025078093,0.00031564623,0.000007963256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005797469,0.0032914907,0.034575474,0.0017839014,0.0009596645,0.000115463605,0.0039144857,0.11651411,0.011697661,0.67928636,0.033211455,0.1140702],"study_design_scores_gemma":[0.007730723,0.00052301347,0.020863,0.0005422675,0.00006716172,0.00010060928,0.0005135322,0.90995026,0.019385934,0.0054685483,0.033269595,0.0015853314],"about_ca_topic_score_codex":0.000043395943,"about_ca_topic_score_gemma":0.000004831496,"teacher_disagreement_score":0.89462954,"about_ca_system_score_codex":0.00020324647,"about_ca_system_score_gemma":0.00024263687,"threshold_uncertainty_score":0.9997695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2664139,0.00035565216,0.7046169,0.004708594,0.01343216,0.00027419114,0.000056823763,0.0002598796,0.009881895],"genre_scores_gemma":[0.9928271,0.000007941592,0.0032942134,0.00027344577,0.0002840739,0.000014700714,0.0000016458531,0.0000067383057,0.0032901035],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928135,0.000021064494,0.00014229056,0.00018991118,0.00016064408,0.00020472199],"domain_scores_gemma":[0.9993537,0.00006421666,0.00004169876,0.00042110428,0.000063635074,0.000055613335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023198374,0.00007891942,0.00007210563,0.000014588485,0.00025687914,0.00019669117,0.00070913474,0.000049767557,0.000017194587],"category_scores_gemma":[0.0000059291656,0.00005455044,0.00005520812,0.00012503451,0.000057534155,0.00017283467,0.000014616001,0.00021482723,0.00020056103],"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.000012017537,0.00008323498,0.00008181289,0.0000135102555,0.000037536483,0.000022532504,0.00070739107,0.00007318797,0.7665688,0.015426832,0.08963174,0.1273414],"study_design_scores_gemma":[0.0003324616,0.000017486762,0.0016433888,0.000007931328,0.0000025861302,0.000079726386,0.000026240667,0.0031269935,0.08666247,0.00067874277,0.907233,0.00018898468],"about_ca_topic_score_codex":0.00002508268,"about_ca_topic_score_gemma":0.00006832459,"teacher_disagreement_score":0.81760126,"about_ca_system_score_codex":0.000010998825,"about_ca_system_score_gemma":0.00006378559,"threshold_uncertainty_score":0.25778732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020828578,1.2708463e-7,0.9248928,0.00027173662,0.0003166861,0.058416095,0.0000064437413,0.0001542414,0.015733574],"genre_scores_gemma":[0.48139995,1.0233204e-8,0.10033102,0.0002592292,0.00021205185,0.4152902,0.0000021555509,0.0000136426925,0.0024917345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990559,0.000010196878,0.00022086767,0.00030840666,0.0001423046,0.00026227362],"domain_scores_gemma":[0.9991872,0.0000607404,0.00007963407,0.00050167425,0.00008141574,0.00008935462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022237675,0.000113935275,0.00014328178,0.000030248246,0.00014223918,0.00032062508,0.00062845915,0.00006618137,0.000022479646],"category_scores_gemma":[0.00003626416,0.00008736543,0.00006628501,0.00013067148,0.000027724582,0.00029947967,0.00008598507,0.0001065236,0.000038264352],"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.000057800935,0.0005860263,0.00088871125,0.00075887906,0.000042345655,0.00007531117,0.00089623197,0.00001955406,0.0648065,0.520586,0.08201655,0.32926607],"study_design_scores_gemma":[0.0020222338,0.00018417214,0.0018170899,0.00008426792,0.0000032812745,0.000042572647,0.000019645073,0.36849746,0.0052045984,0.0041657146,0.6175094,0.00044956346],"about_ca_topic_score_codex":0.000009570926,"about_ca_topic_score_gemma":0.000018842582,"teacher_disagreement_score":0.8245618,"about_ca_system_score_codex":0.000008306712,"about_ca_system_score_gemma":0.00007516087,"threshold_uncertainty_score":0.35626587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016359767,0.000007772261,0.8097952,0.0008773358,0.0010063037,0.000034277626,8.537358e-7,0.00019873433,0.17171977],"genre_scores_gemma":[0.9750526,2.3440465e-7,0.02187813,0.00024001305,0.000053107076,0.0000026926373,3.836774e-7,0.0000012245107,0.002771631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996582,0.0000036664808,0.000059773607,0.0001105355,0.00007483383,0.00009298301],"domain_scores_gemma":[0.9995979,0.00000838481,0.000012409798,0.0003143156,0.00002430678,0.000042656433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007591424,0.00003251025,0.000038978225,0.000011357121,0.000031132815,0.00008122542,0.00039941925,0.000022991562,0.000060735943],"category_scores_gemma":[0.000007313597,0.000024610528,0.000017432349,0.00009871064,0.0000086040045,0.00017034882,0.000047491892,0.00006739779,0.00035693086],"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":[1.2638962e-7,0.000011976377,0.00035963889,0.0000010979624,0.0000012230113,0.0000034523405,0.000032501775,9.924153e-7,0.005263756,0.9508841,0.012877368,0.030563736],"study_design_scores_gemma":[0.00016250358,0.000013593089,0.007379982,0.0000024144995,4.3476433e-7,0.0000320358,0.000005969857,0.027226424,0.0037355837,0.0040022433,0.9572969,0.00014193388],"about_ca_topic_score_codex":0.00001872048,"about_ca_topic_score_gemma":0.00001998489,"teacher_disagreement_score":0.9586928,"about_ca_system_score_codex":0.0000013995409,"about_ca_system_score_gemma":0.000011580445,"threshold_uncertainty_score":0.4587743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076096132,0.00000756315,0.86450565,0.0021561666,0.0009907507,0.000032156982,8.344381e-7,0.00018713006,0.12451012],"genre_scores_gemma":[0.9778562,2.2408419e-7,0.019682748,0.00045457613,0.000053987496,0.0000026039054,4.1339254e-7,0.0000012426951,0.0019479588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999676,0.0000033251388,0.00005661194,0.000103596074,0.000072030285,0.00008844778],"domain_scores_gemma":[0.9996194,0.000007782527,0.000011808733,0.00029769505,0.000022933162,0.000040345203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006990175,0.00003097858,0.000036974394,0.000010829391,0.00002926061,0.00007469627,0.00037539023,0.00002213741,0.00004427977],"category_scores_gemma":[0.000006517875,0.00002345987,0.000016251459,0.00008974111,0.000008309434,0.00016041372,0.000044807246,0.00006419103,0.00027499069],"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":[1.7283021e-7,0.000015874177,0.00030867648,0.0000015052444,0.0000016543212,0.0000044593216,0.000040085317,8.8522313e-7,0.0054711387,0.8841798,0.050524324,0.05945148],"study_design_scores_gemma":[0.000082397324,0.000007323321,0.0022673262,0.0000012305842,2.2601688e-7,0.0000149412435,0.000002651566,0.014161419,0.0018956743,0.002002942,0.97949123,0.00007261707],"about_ca_topic_score_codex":0.000015044566,"about_ca_topic_score_gemma":0.000016360953,"teacher_disagreement_score":0.9702466,"about_ca_system_score_codex":0.0000014095931,"about_ca_system_score_gemma":0.00000787828,"threshold_uncertainty_score":0.35345405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045018406,0.0009803999,0.8476052,0.008462189,0.0011789055,0.0002731128,0.000022910557,0.00044645788,0.13652898],"genre_scores_gemma":[0.99056,0.000025489388,0.0040227193,0.00040024985,0.000034032477,0.0000122013225,0.0000024886056,0.000006052912,0.004936772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879175,0.00006880315,0.00021588946,0.00032861237,0.00022953581,0.00036539498],"domain_scores_gemma":[0.99919194,0.000029473253,0.00005406921,0.0005158541,0.0000723156,0.00013636705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001640332,0.0001353624,0.00018995276,0.000042878008,0.0001096289,0.00016252365,0.00057526224,0.000034941815,0.00007101955],"category_scores_gemma":[0.000014385168,0.00011200587,0.000053073447,0.00044723114,0.000021279633,0.00015697833,0.00004283614,0.00010003009,0.00015198272],"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.0000015789115,0.000077811426,0.001238736,0.000021656271,0.000022169304,0.0000341015,0.0005948513,0.00016839975,0.00035433818,0.879553,0.102960505,0.014972823],"study_design_scores_gemma":[0.00040672984,0.000042020783,0.00068920775,0.00003936679,0.0000029017567,0.000063151885,0.00008467365,0.014902156,0.0031330911,0.0050941044,0.97519755,0.00034501698],"about_ca_topic_score_codex":0.0004381331,"about_ca_topic_score_gemma":0.0004495471,"teacher_disagreement_score":0.9860582,"about_ca_system_score_codex":0.00005029699,"about_ca_system_score_gemma":0.00012438711,"threshold_uncertainty_score":0.4567467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00967978,0.00037096202,0.98154813,0.00038695586,0.00015980937,0.00019836912,0.0057812673,0.00017602154,0.0016987091],"genre_scores_gemma":[0.93562,0.00001531892,0.021606397,0.00033196865,0.0002052235,0.000023411845,0.041978326,0.000011144054,0.00020822567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985438,0.00004731883,0.00021855377,0.0006959118,0.00025926236,0.00023513235],"domain_scores_gemma":[0.996239,0.000051796163,0.000119943055,0.003469176,0.0000733806,0.00004670395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039782046,0.00012058193,0.00012229552,0.000051811432,0.00014492526,0.00020910773,0.0010948965,0.000032930642,0.00003674175],"category_scores_gemma":[0.0000455101,0.00009965023,0.000015218767,0.00040019024,0.000019191782,0.0022456353,0.00034291937,0.00006899979,0.000059048005],"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.000048752652,0.0007619601,0.0230365,0.00010751757,0.00003660625,0.000103113896,0.000047529193,0.00027732988,0.003377244,0.14013591,0.82476884,0.007298661],"study_design_scores_gemma":[0.0005923561,0.00004902753,0.013192031,0.00008182238,0.000012962804,0.000038320864,0.00001332776,0.18221295,0.00089130556,0.0001392337,0.80248153,0.0002951558],"about_ca_topic_score_codex":0.00039417733,"about_ca_topic_score_gemma":0.00027253732,"teacher_disagreement_score":0.95994174,"about_ca_system_score_codex":0.000019632687,"about_ca_system_score_gemma":0.00005683388,"threshold_uncertainty_score":0.40636185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025160664,0.00019379327,0.848068,0.00031528773,0.00048283365,0.00002843613,7.503204e-7,0.00012840643,0.1482664],"genre_scores_gemma":[0.9881277,8.1019596e-7,0.009508912,0.0003437972,0.00006135154,0.0000028644276,3.8532656e-7,0.0000010774144,0.0019530781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996395,0.000009393154,0.000060194532,0.00006180363,0.00007039252,0.00015871084],"domain_scores_gemma":[0.99969,0.000011326945,0.000012987258,0.00020214463,0.000014970383,0.00006859729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106456966,0.000032337164,0.00004241384,0.000009966476,0.000026827229,0.00003698211,0.00021705155,0.000014872885,0.000039219292],"category_scores_gemma":[0.0000048714564,0.000024549177,0.000016159545,0.00009205446,0.0000070946226,0.0003587035,0.00004278847,0.0000217759,0.00059934944],"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":[1.428054e-7,0.000023834973,0.003930161,0.0000017239075,0.000002398201,6.605137e-7,0.00010937941,8.4285324e-7,0.00013225173,0.9552424,0.02507348,0.0154827535],"study_design_scores_gemma":[0.00016001197,0.000010281946,0.014622282,0.0000049778428,8.358899e-7,0.00003165683,0.000024595454,0.004512025,0.0014426057,0.00061189866,0.9784316,0.00014724293],"about_ca_topic_score_codex":0.000010040657,"about_ca_topic_score_gemma":4.6546793e-7,"teacher_disagreement_score":0.9856117,"about_ca_system_score_codex":0.0000053804392,"about_ca_system_score_gemma":0.0000063254656,"threshold_uncertainty_score":0.77036244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02174422,0.000117205345,0.9746499,0.00040218135,0.0013176467,0.00017530975,0.00018678502,0.0005169658,0.00088979927],"genre_scores_gemma":[0.99432516,4.1778415e-7,0.004250524,0.00047284953,0.0005857969,0.000010196111,0.00032892084,0.000015818432,0.000010330988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975591,0.00015338924,0.00045463952,0.00046422717,0.00047308017,0.0008955759],"domain_scores_gemma":[0.99831367,0.00019584464,0.00020248396,0.0008559452,0.00013320943,0.00029882637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006880685,0.0002857314,0.0003153556,0.00007534583,0.0003112705,0.00024944035,0.00095935963,0.000116991214,0.000023513367],"category_scores_gemma":[0.000067296074,0.00026759057,0.00013242144,0.00073834526,0.000038696682,0.00035296366,0.00015208965,0.00024931258,0.00029606587],"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.0001390699,0.0030047132,0.07860126,0.00037261704,0.00024728794,0.00021847918,0.0014804201,0.39919835,0.001718489,0.18356985,0.10157469,0.22987476],"study_design_scores_gemma":[0.0005476991,0.000050799612,0.0056480374,0.000095471434,0.00000737046,0.00001329033,0.000025736197,0.9646257,0.0010639203,0.000027804002,0.027535018,0.0003591328],"about_ca_topic_score_codex":0.000015967782,"about_ca_topic_score_gemma":2.92607e-7,"teacher_disagreement_score":0.9725809,"about_ca_system_score_codex":0.00011493333,"about_ca_system_score_gemma":0.00007116236,"threshold_uncertainty_score":0.99997765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017836461,0.000053963802,0.9384327,0.0015989658,0.00024437683,0.000053427837,0.0000018007959,0.00014277601,0.057688337],"genre_scores_gemma":[0.97756207,0.000002725682,0.020312406,0.00087488076,0.00003770883,0.0000068377262,0.0000018401121,0.0000018223195,0.0011997205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994514,0.0000047927683,0.00009837172,0.00016121473,0.0001461379,0.00013808093],"domain_scores_gemma":[0.99960625,0.0000031672928,0.000019398442,0.00028955744,0.00003393405,0.00004767274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007784212,0.000049637514,0.000057051653,0.00001415638,0.000045550623,0.00009597759,0.00035366448,0.000016632228,0.000013710894],"category_scores_gemma":[0.0000031357908,0.000039858896,0.000023158778,0.00015761658,0.0000093243225,0.00022621371,0.000058630176,0.000028328028,0.0001965886],"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":[3.9883096e-7,0.00003923731,0.000057092373,0.0000025622724,0.000003540235,0.0000114064505,0.00010712916,0.00037047546,0.0002701953,0.9867217,0.0038188943,0.00859738],"study_design_scores_gemma":[0.0013567057,0.0001246228,0.0035471055,0.00003773293,0.0000015724743,0.000048605845,0.000039421815,0.0045379917,0.0035843523,0.02123251,0.9651438,0.00034555062],"about_ca_topic_score_codex":0.000094267074,"about_ca_topic_score_gemma":0.00000912062,"teacher_disagreement_score":0.9757784,"about_ca_system_score_codex":0.000031804735,"about_ca_system_score_gemma":0.00003613948,"threshold_uncertainty_score":0.25268143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118796475,0.000076323144,0.87929046,0.00036040277,0.0005101873,0.00018104921,0.000023867202,0.00020026526,0.00056099147],"genre_scores_gemma":[0.92879134,0.0000067041433,0.07098944,0.00011541,0.00006835923,0.0000069485354,0.000008511853,0.000007527544,0.000005732978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684846,0.0001386216,0.0005996456,0.0007450131,0.001083291,0.00058496493],"domain_scores_gemma":[0.99798346,0.00012605714,0.00021071614,0.00085231266,0.0005573721,0.00027009184],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009524528,0.00024086903,0.00042514197,0.0001466725,0.0005345785,0.00016378416,0.0020444468,0.00007496316,0.00000799825],"category_scores_gemma":[0.00007708198,0.0001997561,0.00011281204,0.0017221806,0.003707293,0.0008239156,0.00061044627,0.00017316181,0.000028778208],"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.0000122461715,0.00011613069,0.00023349021,0.000022999096,0.000007089927,0.000047965077,0.0007212833,0.0024905682,0.00091945275,0.98725766,0.00023441153,0.007936718],"study_design_scores_gemma":[0.00049149984,0.0002801506,0.0067844945,0.00011357045,0.0000046575574,0.00023994937,0.00001743979,0.9553971,0.005406959,0.030493604,0.0004112157,0.00035933344],"about_ca_topic_score_codex":0.00001382053,"about_ca_topic_score_gemma":3.4540474e-7,"teacher_disagreement_score":0.95676404,"about_ca_system_score_codex":0.00006277022,"about_ca_system_score_gemma":0.00022073748,"threshold_uncertainty_score":0.99900407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071871825,0.00018053343,0.8820744,0.0015007526,0.00023079803,0.00034625843,0.00003134245,0.00009056387,0.04367352],"genre_scores_gemma":[0.98190135,0.000013820127,0.017550806,0.000047395835,0.000008596609,0.000006924628,0.0000028169184,0.0000022429435,0.0004660344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993599,0.00003933422,0.00018173059,0.00015167672,0.00012206063,0.00014531637],"domain_scores_gemma":[0.9993917,0.000048579182,0.00008229924,0.00034696254,0.000079720936,0.0000507549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021498749,0.00006169168,0.00009582947,0.000015729667,0.00015760442,0.000058714344,0.0003701574,0.000015949738,0.00004782138],"category_scores_gemma":[0.000008334286,0.00004220183,0.000024170573,0.0001335244,0.00014341756,0.00016069035,0.00012868467,0.00003724849,0.000010691594],"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.000005583784,0.00007142735,0.005309575,0.000012678966,0.000028638771,0.0000021300377,0.0018783147,9.71067e-7,0.0004646723,0.9831135,0.002486531,0.0066259583],"study_design_scores_gemma":[0.001279779,0.0003164438,0.91347903,0.000053258518,0.00002213719,0.00003413929,0.001659166,0.01769243,0.015402802,0.041232646,0.008368302,0.00045984547],"about_ca_topic_score_codex":0.0005422808,"about_ca_topic_score_gemma":0.00041249717,"teacher_disagreement_score":0.9418809,"about_ca_system_score_codex":0.0000068254735,"about_ca_system_score_gemma":0.00003195649,"threshold_uncertainty_score":0.17209408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000842187,0.000117594274,0.9925781,0.0017658031,0.00005363375,0.00056578085,0.000117354284,0.00019109459,0.0037684732],"genre_scores_gemma":[0.9241143,0.0000054475536,0.06820339,0.0003756628,0.000083313775,0.0010765315,0.0003457312,0.000006953069,0.0057887025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924743,0.000007627886,0.00019668585,0.00030965114,0.000090471156,0.00014810548],"domain_scores_gemma":[0.9988256,0.00003433399,0.00006924341,0.0009249006,0.00011473796,0.000031192216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013704525,0.00006587723,0.000079536745,0.000032108186,0.00010989457,0.0000976179,0.00041571437,0.000022914866,0.000001939894],"category_scores_gemma":[0.000008710772,0.00005688451,0.000038660717,0.00018090766,0.000017461645,0.00022550242,0.00004879775,0.000022763388,0.000030341445],"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.000001026684,0.000055001994,0.000112961985,0.000013358083,0.0000029056241,1.11226846e-7,0.000011364289,0.000038984348,0.007162554,0.9722941,0.009482116,0.010825498],"study_design_scores_gemma":[0.00061526155,0.00003754819,0.009620482,0.000017765908,0.000007026745,0.0000147503015,0.000054317643,0.25086674,0.003907111,0.010557359,0.7239926,0.00030905346],"about_ca_topic_score_codex":0.00041740513,"about_ca_topic_score_gemma":0.00009628483,"teacher_disagreement_score":0.96173674,"about_ca_system_score_codex":0.000030830815,"about_ca_system_score_gemma":0.000020230988,"threshold_uncertainty_score":0.2319683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46886715,0.00017865216,0.5285946,0.0003769137,0.00016449751,0.00045738817,0.000027281063,0.000043662843,0.0012898513],"genre_scores_gemma":[0.9948706,0.0000032126961,0.004926574,0.00004904354,0.00008788486,0.000014339742,0.000007877856,0.0000079735955,0.000032511387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983701,0.0000034618213,0.0004558848,0.00044092018,0.00031967773,0.00040991962],"domain_scores_gemma":[0.9991546,0.000068728536,0.00013880867,0.00024040088,0.0003270958,0.00007032043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023479175,0.000102184145,0.00019628328,0.00010244725,0.000049016697,0.00009051991,0.0009624342,0.00005426163,0.0000016457576],"category_scores_gemma":[0.00013328047,0.00009907792,0.00003186079,0.0004153396,0.000025314916,0.00032224524,0.00034206267,0.00010168705,0.0000032705075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016864263,0.0010388246,0.06417638,0.0025252942,0.00007272818,0.000036687386,0.007674333,0.0010978099,0.042138215,0.083329014,0.004556754,0.7931853],"study_design_scores_gemma":[0.0021552064,0.0002392007,0.013098377,0.00085601036,0.000010409403,0.000036230726,0.0012667691,0.9072687,0.05989727,0.00023280206,0.014423119,0.0005159091],"about_ca_topic_score_codex":0.00010599904,"about_ca_topic_score_gemma":0.000016755122,"teacher_disagreement_score":0.9061709,"about_ca_system_score_codex":0.00003806793,"about_ca_system_score_gemma":0.0000361513,"threshold_uncertainty_score":0.40402806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007774894,0.000022362226,0.9700917,0.00068547146,0.00032353346,0.0001815991,0.000017401242,0.0002546674,0.020648368],"genre_scores_gemma":[0.91415,0.000007484738,0.08415147,0.0012793617,0.000058826085,0.000022357364,0.000021027437,0.0000058787555,0.00030360694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879974,0.000023739272,0.00036951323,0.00013806605,0.00037771417,0.00029124753],"domain_scores_gemma":[0.9990527,0.000058306956,0.000114086186,0.0005625848,0.00008522412,0.0001271024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018145642,0.00013174204,0.00017307866,0.00007477695,0.00023919965,0.00009645836,0.00073450344,0.00006948506,0.000035518973],"category_scores_gemma":[0.000040177823,0.00010948204,0.000065760694,0.0003384534,0.000045711742,0.0012023543,0.00016980871,0.0001212584,0.00045402834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032485324,0.0005802315,0.00060462917,0.00029154026,0.000085792315,0.00035457432,0.01877241,0.0004946711,0.00055395666,0.032998536,0.30930132,0.6359298],"study_design_scores_gemma":[0.00047737797,0.00006435815,0.0009638853,0.00003865435,0.0000016758352,0.00011546888,0.00003716432,0.81237423,0.00031460455,0.00007580943,0.18534032,0.00019646979],"about_ca_topic_score_codex":0.000023803796,"about_ca_topic_score_gemma":0.0000010777999,"teacher_disagreement_score":0.9063751,"about_ca_system_score_codex":0.00003722595,"about_ca_system_score_gemma":0.0001287695,"threshold_uncertainty_score":0.5835767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062612034,0.0000128494075,0.98466355,0.00029922734,0.0006015645,0.00031691592,0.000009498719,0.0003727804,0.007462417],"genre_scores_gemma":[0.98313886,2.1844065e-7,0.016100356,0.00020970717,0.00009987046,0.00009388401,0.0000029567943,0.000007847104,0.0003463023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888575,0.000039255396,0.00024905056,0.0003654132,0.00018030601,0.00028022513],"domain_scores_gemma":[0.99912447,0.00003659851,0.000075048425,0.00046687052,0.0001820757,0.000114943796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022334103,0.0001293973,0.00016907344,0.00005829511,0.00014464307,0.00010092843,0.0006373992,0.0001158378,0.000011119564],"category_scores_gemma":[0.000010775163,0.00010713869,0.000070655406,0.0003598814,0.000012775093,0.00036055953,0.000092543756,0.00010534859,0.000103544124],"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.0001285008,0.00033811352,0.0021602162,0.001218377,0.00014153235,0.000044403965,0.0049973605,0.00011012374,0.0072685974,0.8121815,0.0055165403,0.16589475],"study_design_scores_gemma":[0.0025599715,0.00040752444,0.013823313,0.00022985581,0.00002374457,0.00028587037,0.0010642594,0.7944511,0.021498922,0.0037887574,0.16078837,0.0010782772],"about_ca_topic_score_codex":0.00024515376,"about_ca_topic_score_gemma":0.0002857859,"teacher_disagreement_score":0.9768776,"about_ca_system_score_codex":0.000047629906,"about_ca_system_score_gemma":0.000031654017,"threshold_uncertainty_score":0.4368989},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6651632,0.00058849575,0.3331377,0.00051884016,0.00023583605,0.00017638839,4.8633024e-7,0.000029611261,0.00014943014],"genre_scores_gemma":[0.9939563,0.000017163227,0.0057529896,0.00006243857,0.00003940168,0.000015784632,1.1568848e-7,0.0000034129866,0.00015239314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916726,0.00016564695,0.00025215303,0.0001111797,0.00013767478,0.0001661094],"domain_scores_gemma":[0.9995567,0.00004507844,0.00012746034,0.00017333862,0.000045870565,0.000051541272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004275525,0.0000798184,0.0001099955,0.00007852236,0.0001939051,0.00031085682,0.0002683119,0.00003240485,0.000014450945],"category_scores_gemma":[0.000037037265,0.000049039892,0.000037824124,0.00016288686,0.000047161866,0.00024686515,0.000051375468,0.0001996122,0.000019141746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046412465,0.00008049011,0.0036621017,0.000041637588,0.000035271845,0.000016969585,0.0039310316,0.00044315378,0.004000664,0.0007856808,0.00020820873,0.9867901],"study_design_scores_gemma":[0.001198721,0.00015851634,0.46072257,0.00026063254,0.0000099594445,0.0019195547,0.0004971633,0.5142197,0.0004574899,0.019544994,0.0007758898,0.00023479265],"about_ca_topic_score_codex":0.000060922208,"about_ca_topic_score_gemma":0.000070230606,"teacher_disagreement_score":0.98655534,"about_ca_system_score_codex":0.000024594961,"about_ca_system_score_gemma":0.000028871405,"threshold_uncertainty_score":0.29975995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068734266,0.003953606,0.92015326,0.0005053744,0.0049495106,0.00019412911,0.000011185681,0.000024322891,0.0014743326],"genre_scores_gemma":[0.9749791,0.000022342572,0.024440942,0.000027675085,0.00038645792,0.000005845776,0.0000027474807,0.000006045948,0.00012886383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980053,0.000076521166,0.0007846975,0.0001088999,0.0007905366,0.00023406219],"domain_scores_gemma":[0.99859786,0.00006739306,0.00057903596,0.00012534943,0.00051872426,0.000111608875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892122,0.00010801509,0.0002606047,0.00022412188,0.000021647858,0.00010028435,0.0008424879,0.00006196853,0.000009071897],"category_scores_gemma":[0.000047174686,0.00009568117,0.00014064161,0.0001681606,0.000034356122,0.0009880145,0.000038022867,0.00019862497,0.0000053703],"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.0006479737,0.0031441646,0.03463256,0.00037472558,0.0014743551,0.0035462498,0.015640363,0.06834961,0.0052341004,0.18137294,0.0014201816,0.6841628],"study_design_scores_gemma":[0.0095406035,0.0005173871,0.036955252,0.0024472266,0.000057215435,0.029019028,0.0022523967,0.06066599,0.0013753506,0.0006595978,0.8554327,0.0010772836],"about_ca_topic_score_codex":0.00006830153,"about_ca_topic_score_gemma":0.0000036764545,"teacher_disagreement_score":0.9062448,"about_ca_system_score_codex":0.00009851996,"about_ca_system_score_gemma":0.00007870952,"threshold_uncertainty_score":0.3901765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004624429,0.00011312697,0.92696327,0.0009144913,0.00052318804,0.00021293918,0.000010412654,0.00010072628,0.06653743],"genre_scores_gemma":[0.9253971,0.0000012319132,0.03161084,0.00033350213,0.00019393646,0.000046272107,0.000014011689,0.0000056515423,0.042397458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991422,0.000007040383,0.00019235043,0.00024812875,0.00015477395,0.0002554618],"domain_scores_gemma":[0.99947995,0.000021142378,0.00004450982,0.00033270614,0.00008422343,0.000037495553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016750285,0.00008380633,0.00011023936,0.000022998856,0.000097513985,0.00020052478,0.0003581853,0.000030093825,0.00004584257],"category_scores_gemma":[0.000004606114,0.00006747544,0.000056540408,0.00015631357,0.000014255078,0.00022306482,0.000057928835,0.000024887919,0.000118905096],"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.000005427217,0.00019058198,0.00049486646,0.00002282643,0.0000092649725,0.0000057058123,0.000012122711,0.00016814563,0.0012331279,0.67347866,0.31806043,0.0063188435],"study_design_scores_gemma":[0.0006011405,0.000069727736,0.0014376761,0.000014685074,0.0000023251096,0.0000048083907,0.0000039413026,0.05338698,0.00227418,0.0027843337,0.9392475,0.00017273433],"about_ca_topic_score_codex":0.00017721766,"about_ca_topic_score_gemma":0.00004636656,"teacher_disagreement_score":0.9207727,"about_ca_system_score_codex":0.00001116078,"about_ca_system_score_gemma":0.000022218626,"threshold_uncertainty_score":0.27515686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240917,0.000052077074,0.95358074,0.00050425594,0.0006943683,0.00017237304,0.000026779251,0.00036844902,0.0021917892],"genre_scores_gemma":[0.98827165,5.328929e-7,0.011339653,0.00006135832,0.000059065216,0.000019704017,0.000038627557,0.0000049543414,0.00020446222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899036,0.0000444029,0.00019485492,0.00036428627,0.00021070964,0.00019541851],"domain_scores_gemma":[0.99912405,0.000056892583,0.00009037263,0.0005202856,0.00009464545,0.00011374547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024746987,0.00011012387,0.00014109467,0.000039805447,0.00014981651,0.00030828713,0.00032839552,0.00007944374,0.0000044643175],"category_scores_gemma":[0.000059735063,0.000091140304,0.00004060339,0.00030338852,0.000026928206,0.00031453752,0.00006504015,0.0001564678,0.0000152499715],"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.000022417607,0.0000968185,0.0111275455,0.00016720954,0.000037346035,0.000105861756,0.000309521,0.0008281018,0.014932973,0.9336702,0.015271221,0.023430763],"study_design_scores_gemma":[0.0015493917,0.00006928089,0.07152817,0.00020981477,0.0000142704985,0.00030874947,0.00041794503,0.9015413,0.00986599,0.00022543789,0.013711411,0.000558259],"about_ca_topic_score_codex":0.00015936793,"about_ca_topic_score_gemma":0.000060209157,"teacher_disagreement_score":0.9458625,"about_ca_system_score_codex":0.000019233661,"about_ca_system_score_gemma":0.0000392813,"threshold_uncertainty_score":0.37165937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013929951,0.00022691558,0.9959314,0.00043168786,0.0005048637,0.00048804487,0.00016764687,0.00027775188,0.0005786944],"genre_scores_gemma":[0.9847081,0.0000022098423,0.013836785,0.0001582764,0.000056985893,0.00021713595,0.00006057529,0.000007733783,0.0009522428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998691,0.00003883423,0.0003251029,0.0003626198,0.00026250037,0.00031992383],"domain_scores_gemma":[0.99894917,0.000080792306,0.00009183242,0.00056596234,0.00018803077,0.00012421061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525303,0.00014413966,0.00025225134,0.00004460181,0.0001907306,0.00009502375,0.0006188253,0.000058825037,0.0000044851135],"category_scores_gemma":[0.000028001363,0.00011463158,0.0001414488,0.00029297205,0.000023823031,0.0002631033,0.000047983795,0.000049625647,0.000032738524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060915056,0.0008309374,0.0010770229,0.00033964714,0.00018956396,0.000107577886,0.00032405707,0.16841157,0.001660086,0.6076859,0.21573117,0.0035815346],"study_design_scores_gemma":[0.0006450033,0.000048559818,0.0002924335,0.000017468838,0.0000040423247,0.000027673901,0.000008817683,0.92536384,0.00040150466,0.00011091655,0.07291181,0.00016793796],"about_ca_topic_score_codex":0.00007708321,"about_ca_topic_score_gemma":0.00000305707,"teacher_disagreement_score":0.98331505,"about_ca_system_score_codex":0.000049437083,"about_ca_system_score_gemma":0.00011501158,"threshold_uncertainty_score":0.46745402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007334273,0.000057719753,0.99008995,0.00020386225,0.00023557951,0.0001236771,0.000008427782,0.000046868474,0.0018996645],"genre_scores_gemma":[0.95677614,7.951841e-7,0.042771306,0.00040752668,0.000007877903,0.000011802703,0.000010371552,0.00000297754,0.0000112148045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891275,0.000030919015,0.00052087737,0.0000868851,0.00030705318,0.00014151644],"domain_scores_gemma":[0.9989143,0.000018182149,0.0005164267,0.00022021284,0.00029888703,0.000032012493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029744243,0.00008745289,0.00016500051,0.00011372814,0.000054400152,0.00007874562,0.00032405838,0.000041138333,0.0000028118109],"category_scores_gemma":[0.00005604521,0.00007980404,0.0000342451,0.0005605138,0.000049607,0.0020850922,0.000022531578,0.00006776733,0.0000035493663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091094125,0.00008326096,0.00035337717,0.0009369712,0.000021124335,0.0000019904635,0.0048915716,0.0040430436,0.0021170417,0.010592234,0.0024562022,0.9744941],"study_design_scores_gemma":[0.0028360125,0.00017550007,0.0023102574,0.0015896485,0.000025560312,0.00011801664,0.00093819614,0.5790603,0.32154676,0.0008136762,0.089632384,0.0009536783],"about_ca_topic_score_codex":0.000008227691,"about_ca_topic_score_gemma":1.6699174e-7,"teacher_disagreement_score":0.97354037,"about_ca_system_score_codex":0.000018938968,"about_ca_system_score_gemma":0.00009126373,"threshold_uncertainty_score":0.32543144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016297568,0.0008071454,0.981241,0.00011698411,0.0003444988,0.0009959387,0.0000062539057,0.00018471101,0.000005907689],"genre_scores_gemma":[0.9670662,0.0000032446364,0.03262407,0.000082746636,0.00007263242,0.0001272938,0.0000114641525,0.000011165719,0.0000011704142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985119,0.00006361981,0.00049080444,0.00033988143,0.00021974368,0.0003740454],"domain_scores_gemma":[0.99858665,0.00044347165,0.00017148266,0.00051859627,0.0001687498,0.00011106337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026058126,0.00021509062,0.000539417,0.00012899122,0.00009723888,0.00008607613,0.0009126316,0.000073008356,1.9194553e-7],"category_scores_gemma":[0.000023768318,0.00021453362,0.00010811798,0.0005997831,0.00002149013,0.00025537534,0.00007222092,0.00022393106,0.0000011018444],"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.000016983853,0.0004285011,0.000024552915,0.000018789045,0.00005978468,0.0000015560283,0.0003807065,0.9834209,0.00009014724,0.011127189,0.000111578054,0.0043193176],"study_design_scores_gemma":[0.004849397,0.0007572863,0.0004191677,0.00007336691,0.000015463387,0.0000033786625,0.000010632006,0.9931769,0.00014424279,0.00011997091,0.00021138715,0.00021883428],"about_ca_topic_score_codex":0.000024803705,"about_ca_topic_score_gemma":0.0000014880206,"teacher_disagreement_score":0.95076865,"about_ca_system_score_codex":0.000117770076,"about_ca_system_score_gemma":0.00006343268,"threshold_uncertainty_score":0.8748427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017157854,0.00004953449,0.9792356,0.00043404236,0.0001359848,0.00010443378,0.000079647434,0.00017028037,0.018074695],"genre_scores_gemma":[0.96808153,0.0000027034625,0.031395577,0.00012783105,0.000039146795,0.000004632184,0.00005308487,0.0000043837235,0.00029110213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987827,0.00009583959,0.000347933,0.00029056513,0.0002644492,0.0002185129],"domain_scores_gemma":[0.9988494,0.000055820266,0.0001403452,0.0007020906,0.00015861486,0.0000937257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042482416,0.00011736867,0.00029182443,0.000035672638,0.00006206835,0.000066182976,0.0007807452,0.000050667633,0.000048627244],"category_scores_gemma":[0.000054008622,0.00009560103,0.00007834213,0.00042007802,0.00009004471,0.00016948888,0.0001578689,0.00007331302,0.000045585013],"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.0000031114264,0.00009001652,0.0006312457,0.000053487372,0.000017833765,0.0000028768407,0.00005855391,0.000036746165,0.00075403816,0.9677875,0.012414443,0.018150147],"study_design_scores_gemma":[0.0014623884,0.00019336313,0.03460812,0.00015651432,0.000013236572,0.000027757736,0.000033331547,0.73510575,0.0071435072,0.022357218,0.1982701,0.0006286979],"about_ca_topic_score_codex":0.00007772765,"about_ca_topic_score_gemma":0.0000049393243,"teacher_disagreement_score":0.96636575,"about_ca_system_score_codex":0.000015649475,"about_ca_system_score_gemma":0.000015276411,"threshold_uncertainty_score":0.3898497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036409445,0.000175838,0.9583027,0.00024824863,0.00062803715,0.0006810318,0.0025438664,0.0009861721,0.000024692386],"genre_scores_gemma":[0.8769027,8.277548e-7,0.12059265,0.000085056614,0.000112826856,0.000045259265,0.0022399009,0.000020268368,5.267534e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709624,0.00013406783,0.00092476344,0.0004588895,0.00044555342,0.0009404991],"domain_scores_gemma":[0.997484,0.00045794842,0.0006688433,0.00072823034,0.00041253347,0.00024839607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074572704,0.00032577966,0.0005268579,0.00011409341,0.00029135018,0.00015372888,0.00095402676,0.00017125263,0.000006444982],"category_scores_gemma":[0.00007134611,0.0003341535,0.00023818832,0.0009781207,0.000055044282,0.00059197756,0.00015151662,0.0001773976,0.0000065234253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006517652,0.0009544241,0.015634336,0.00048676238,0.00027003602,0.000005401835,0.0011806907,0.17871279,0.0022920694,0.7693945,0.009006813,0.021996971],"study_design_scores_gemma":[0.0011828928,0.0000782453,0.009052184,0.00015237725,0.000027630094,0.000005865738,0.00024716795,0.9819377,0.0036543491,0.0021547065,0.0011332661,0.0003735814],"about_ca_topic_score_codex":0.00007768668,"about_ca_topic_score_gemma":0.0000015226341,"teacher_disagreement_score":0.84049326,"about_ca_system_score_codex":0.00015329309,"about_ca_system_score_gemma":0.00012063349,"threshold_uncertainty_score":0.99991107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00395247,0.00033247468,0.8798588,0.0047498033,0.0018730116,0.00039178855,0.00003636894,0.0007119723,0.10809331],"genre_scores_gemma":[0.9721354,0.000022176862,0.008951871,0.0005088505,0.0008665645,0.000085306034,0.000060281112,0.000034275858,0.01733524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981264,0.000056479086,0.00031341688,0.00058012584,0.00043345,0.00049016526],"domain_scores_gemma":[0.9990564,0.000029501798,0.000104901905,0.00062851876,0.00008682541,0.00009383627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020379697,0.0002239309,0.00021541498,0.00009775625,0.00021686142,0.0003171628,0.00058874156,0.000106392494,0.000019980962],"category_scores_gemma":[0.000004912332,0.000193502,0.00011159822,0.000551774,0.00004462575,0.00052199943,0.000072627125,0.00017183593,0.00032700467],"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.00008479463,0.0011995727,0.0018679125,0.00014354369,0.0001668886,0.00024582373,0.00064380065,0.018041845,0.076294124,0.51485753,0.31097773,0.075476445],"study_design_scores_gemma":[0.0023131685,0.0007976054,0.006242939,0.00019781191,0.00002731813,0.00015204858,0.000066181805,0.47671226,0.059403,0.00857582,0.44381213,0.0016997398],"about_ca_topic_score_codex":0.00034758318,"about_ca_topic_score_gemma":0.000014488581,"teacher_disagreement_score":0.968183,"about_ca_system_score_codex":0.00008746553,"about_ca_system_score_gemma":0.000040513118,"threshold_uncertainty_score":0.78907824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15224439,0.018486986,0.81963307,0.0001293148,0.0052806307,0.002854937,0.00043208548,0.00019309782,0.00074548845],"genre_scores_gemma":[0.9985132,0.00004074265,0.00011778497,0.000015559006,0.00016437922,0.0005585183,0.000060180548,0.00004320141,0.0004864253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423134,0.00080117735,0.0019224547,0.00075750815,0.0011002943,0.0011872259],"domain_scores_gemma":[0.99691135,0.0003278169,0.0007499218,0.0014336032,0.00020712432,0.00037018606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002503231,0.0005199432,0.0012363484,0.00062037417,0.00010546853,0.0002015734,0.0014632579,0.00023257839,0.0000056282997],"category_scores_gemma":[0.00019382607,0.00043763535,0.00032353448,0.0019075706,0.00009693943,0.00095195,0.00021528671,0.0002992159,0.00006650207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002897475,0.0028180147,0.25569463,0.011144536,0.0011199949,0.00019209781,0.009101275,0.2814418,0.0046241344,0.4263278,0.0013443889,0.0059015728],"study_design_scores_gemma":[0.0020370807,0.00017991888,0.0245714,0.0013453013,0.000044514978,0.0001325975,0.00083205826,0.968142,0.0000087317085,0.000105369465,0.001891228,0.0007098387],"about_ca_topic_score_codex":0.0013164222,"about_ca_topic_score_gemma":0.000036474397,"teacher_disagreement_score":0.84626883,"about_ca_system_score_codex":0.0004929302,"about_ca_system_score_gemma":0.00013545912,"threshold_uncertainty_score":0.99980754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006156394,0.0000072732428,0.98468095,0.0004914342,0.00062156474,0.00056114956,0.00024817119,0.00021073382,0.01256309],"genre_scores_gemma":[0.69494265,6.9299324e-7,0.3009441,0.001096228,0.00027218016,0.00014266555,0.00013989474,0.000014671216,0.0024469153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844766,0.000059563958,0.00022485548,0.0007096504,0.00023927342,0.00031898814],"domain_scores_gemma":[0.9976519,0.00003584084,0.000057331472,0.0019853525,0.00008354477,0.000186076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091141026,0.00012441381,0.0001738984,0.000052918473,0.00011887107,0.00023368975,0.0022585883,0.00002603909,0.0000057465745],"category_scores_gemma":[0.000010411052,0.00010253874,0.000030410167,0.00018412908,0.0000049978157,0.0006030475,0.00066055876,0.00003286265,0.000118733034],"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.000010698265,0.00012876852,0.00007247658,0.00015884158,0.00003063273,0.000007839507,0.00035173458,0.00034147003,0.000031560925,0.91667175,0.035447255,0.046747],"study_design_scores_gemma":[0.000418634,0.0000720645,0.00015960877,0.00004463771,0.0000045870133,0.0000027195642,0.0002305786,0.714381,0.00012179961,0.00014447511,0.28428057,0.00013931998],"about_ca_topic_score_codex":0.000052179126,"about_ca_topic_score_gemma":0.00008384728,"teacher_disagreement_score":0.9165273,"about_ca_system_score_codex":0.00003632718,"about_ca_system_score_gemma":0.0000087727485,"threshold_uncertainty_score":0.4197057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32104486,0.00041842792,0.6776543,0.000046566547,0.00045205254,0.00017978875,0.000004876807,0.000066203764,0.00013291583],"genre_scores_gemma":[0.7066262,0.0000067967403,0.29323584,0.000021316231,0.000082054205,0.000008641492,6.518e-7,0.0000045198453,0.00001398522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979703,0.000032932796,0.0004116731,0.0003726826,0.00063756586,0.00057488814],"domain_scores_gemma":[0.99883676,0.00006800802,0.00029070742,0.00037384484,0.00029545763,0.00013520016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090105925,0.00017240054,0.00028968885,0.00014048287,0.00026735273,0.00012681072,0.00081158534,0.000051376202,0.000001612619],"category_scores_gemma":[0.000016714543,0.00015241066,0.000066485496,0.0008938322,0.0007414426,0.002955659,0.0002375562,0.00013133182,0.0000016321828],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013943875,0.00015902544,0.0062295008,0.0002256276,0.000018831028,9.91972e-7,0.007396237,0.00049882644,0.0025613601,0.012950338,0.000014043338,0.96993124],"study_design_scores_gemma":[0.0027984078,0.003007299,0.21747188,0.001956308,0.00007737763,0.00058528414,0.0024290618,0.6922318,0.0700038,0.0010778756,0.0060006496,0.0023602573],"about_ca_topic_score_codex":0.00013905416,"about_ca_topic_score_gemma":0.0000019157237,"teacher_disagreement_score":0.967571,"about_ca_system_score_codex":0.00003900872,"about_ca_system_score_gemma":0.00014987201,"threshold_uncertainty_score":0.62151265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030865833,0.000011719266,0.9335339,0.005947102,0.0006496375,0.0003272874,0.000004578717,0.00032233752,0.028337575],"genre_scores_gemma":[0.9581341,0.0000070161745,0.035262205,0.004565254,0.00021147386,0.00006085832,0.0000037088794,0.000030719973,0.0017246223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631095,0.00010657885,0.00097149384,0.0009781986,0.0006293847,0.0010034136],"domain_scores_gemma":[0.9981609,0.00015199785,0.00014747644,0.00096842,0.000094116294,0.00047708763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015966898,0.00039510906,0.0005571489,0.00041140133,0.00020598962,0.00041721304,0.0014087175,0.0001444894,0.000050656556],"category_scores_gemma":[0.000246535,0.00032587792,0.0001265068,0.001818637,0.000029884444,0.0008145072,0.00046680967,0.00023073926,0.00022793685],"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.0005750094,0.00062192295,0.0013271166,0.00035096606,0.00009963109,0.00012386248,0.013889496,0.012092034,0.024365325,0.7584898,0.010319922,0.17774494],"study_design_scores_gemma":[0.003829795,0.0014529225,0.007815798,0.0013555542,0.000017140852,0.00018022774,0.0025674263,0.6565354,0.0720444,0.0017441045,0.24961947,0.0028377562],"about_ca_topic_score_codex":0.0003640373,"about_ca_topic_score_gemma":0.0003618781,"teacher_disagreement_score":0.9272683,"about_ca_system_score_codex":0.0004623409,"about_ca_system_score_gemma":0.00009893295,"threshold_uncertainty_score":0.99991935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13025703,0.00011041156,0.8673805,0.00025460438,0.00031957298,0.00025208155,0.0005421471,0.0005381932,0.0003454828],"genre_scores_gemma":[0.9941862,0.0000073968918,0.0053340625,0.000039935774,0.000056540764,0.000010541369,0.00034782942,0.000012581672,0.0000049046694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744284,0.00024516528,0.00092368934,0.00041588573,0.00047888453,0.00049352215],"domain_scores_gemma":[0.9972537,0.00037173243,0.00086360547,0.00088642945,0.000527483,0.000097014105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082559435,0.0002465942,0.00051980134,0.000051876446,0.00039945188,0.00016324672,0.0013188635,0.00007930574,0.0000031551203],"category_scores_gemma":[0.00012300575,0.00019535149,0.00013634843,0.00070426334,0.00032464848,0.00025182436,0.00021693979,0.0001722938,0.000009172862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012125453,0.0006032411,0.006679233,0.00068263366,0.00028784477,0.000010467024,0.002024692,0.19059423,0.0119011775,0.7133087,0.014825823,0.058960736],"study_design_scores_gemma":[0.00054668286,0.00007594873,0.009674996,0.00024566374,0.000007701393,0.000009510077,0.00009609925,0.97816443,0.0058447304,0.0023283658,0.002797384,0.00020850498],"about_ca_topic_score_codex":0.0001083536,"about_ca_topic_score_gemma":0.000008386373,"teacher_disagreement_score":0.86392915,"about_ca_system_score_codex":0.000043960394,"about_ca_system_score_gemma":0.00004846201,"threshold_uncertainty_score":0.79662025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014963865,0.00016498458,0.98211837,0.0017902501,0.00017064957,0.00030583146,0.000004049924,0.00011662033,0.0003654035],"genre_scores_gemma":[0.95784354,0.0000071367563,0.041700587,0.00029245927,0.00010607611,0.000036276062,0.0000046323344,0.0000049399105,0.00000435432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973819,0.000068926056,0.00044966897,0.00066413893,0.00047757084,0.00095779746],"domain_scores_gemma":[0.998738,0.0003287169,0.000084724474,0.0005595964,0.00015319174,0.00013575087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838712,0.00017850795,0.0002956136,0.00037710374,0.00024974652,0.00033494664,0.0018236284,0.000062326755,0.000014072478],"category_scores_gemma":[0.000082379345,0.00015727604,0.0001535747,0.0030947435,0.00056663674,0.00096917106,0.00013293883,0.00021566467,0.000018864346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004634673,0.000045035646,0.00007484052,0.000004829023,0.0000115061885,2.1698662e-7,0.0004707951,0.008616195,0.00008330181,0.79413044,0.000005413699,0.1965528],"study_design_scores_gemma":[0.0003905,0.00014595024,0.00027149852,0.000012328481,0.000015258176,0.0000065687536,0.0000027197107,0.9566229,0.0022984007,0.037590116,0.0024315084,0.00021222983],"about_ca_topic_score_codex":0.000005527869,"about_ca_topic_score_gemma":0.00002059342,"teacher_disagreement_score":0.94800675,"about_ca_system_score_codex":0.00023709635,"about_ca_system_score_gemma":0.00021263213,"threshold_uncertainty_score":0.6413531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2684711,0.00013785143,0.6744888,0.003173425,0.00069202343,0.041947614,0.00006517351,0.00038575512,0.010638304],"genre_scores_gemma":[0.97160214,0.0000033083975,0.010847807,0.00020808142,0.00023804007,0.016822837,0.000029772134,0.00000557525,0.00024243243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985448,0.000044537206,0.00028411506,0.0003276707,0.00052594795,0.00027291014],"domain_scores_gemma":[0.999018,0.00004649264,0.00011707164,0.00043532645,0.0003227986,0.00006026841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014576399,0.00012410701,0.00013821939,0.00006098801,0.00020965302,0.0001536756,0.00037211258,0.000055220633,0.000034808243],"category_scores_gemma":[0.000071338385,0.00010583719,0.000046459227,0.0002037561,0.000017904955,0.00084234594,0.000032387943,0.0000703932,0.0004643414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065535256,0.00023611201,0.0008115432,0.00009088147,0.000014559133,1.7611862e-7,0.00052811805,0.042996142,0.0010769016,0.0026628587,0.013489509,0.9380277],"study_design_scores_gemma":[0.0013090188,0.00018832149,0.0037751931,0.00008439388,0.0000048481966,0.0000023780422,0.0000044872017,0.9334407,0.005482122,0.000064097585,0.05550007,0.00014435562],"about_ca_topic_score_codex":0.0000015104348,"about_ca_topic_score_gemma":0.0000022342895,"teacher_disagreement_score":0.9378833,"about_ca_system_score_codex":0.00011310863,"about_ca_system_score_gemma":0.000089598994,"threshold_uncertainty_score":0.5968324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016385128,0.00044335512,0.9663423,0.0053874603,0.0006196846,0.00014045775,0.000008809722,0.0001939341,0.02522554],"genre_scores_gemma":[0.98151845,0.0000046287787,0.008299499,0.0016654517,0.00028818147,0.000032408516,0.0000030798087,0.0000049099585,0.008183372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991543,0.000018388933,0.00012536674,0.00021311938,0.00019155213,0.00029727007],"domain_scores_gemma":[0.99909675,0.00001471535,0.00006126192,0.0006196853,0.00006287514,0.00014473945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016351484,0.0000953286,0.0001109551,0.000021193655,0.00008288141,0.00021529918,0.0005215143,0.000045613662,0.000011561652],"category_scores_gemma":[0.000005999091,0.00007756407,0.00005895222,0.00023607159,0.000017435023,0.00063741585,0.0001027721,0.000055836215,0.00035113702],"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.00000121993,0.00015015883,0.010081055,0.000019373418,0.000024562434,0.000001140279,0.00064133195,0.0000019251347,0.0011555349,0.7796368,0.17298543,0.035301495],"study_design_scores_gemma":[0.00016740784,0.000008720317,0.002585101,0.0000045949546,0.000003146467,0.000022504779,0.00007660456,0.0037099514,0.0016516603,0.00041779375,0.99117625,0.00017624439],"about_ca_topic_score_codex":0.000021338948,"about_ca_topic_score_gemma":0.0000013720067,"teacher_disagreement_score":0.97988,"about_ca_system_score_codex":0.000017901677,"about_ca_system_score_gemma":0.000014605087,"threshold_uncertainty_score":0.45132732},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060992632,0.00008495388,0.8350429,0.00017155046,0.00059787405,0.00013430853,6.9648837e-7,0.00014122379,0.102833875],"genre_scores_gemma":[0.9889256,6.4200174e-7,0.010161166,0.0001723141,0.000009255114,0.0000055743153,2.6214258e-7,0.0000016785029,0.0007235531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994738,0.000019671597,0.00013725854,0.00014963243,0.00007715976,0.00014244583],"domain_scores_gemma":[0.99970764,0.000009167376,0.000028229493,0.00020294721,0.000018920371,0.000033107182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016328672,0.000046245408,0.00007223115,0.000028663371,0.00001844116,0.000010847609,0.00037068033,0.000021767635,0.000028861477],"category_scores_gemma":[0.0000089281975,0.00003866349,0.000018701077,0.00016015064,0.0000049233295,0.0002446922,0.00006669551,0.000039981667,0.00013934905],"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.0000033647843,0.00017499785,0.09990922,0.000014227648,0.000008643523,0.000044539083,0.004389922,0.0000049238347,0.0001193828,0.57163906,0.001766401,0.3219253],"study_design_scores_gemma":[0.0030495261,0.00018628903,0.7798646,0.00031452722,0.0000029010032,0.00007379972,0.0008481659,0.10419653,0.004615914,0.05522054,0.05069574,0.0009314335],"about_ca_topic_score_codex":0.00034772736,"about_ca_topic_score_gemma":0.0000977525,"teacher_disagreement_score":0.9279329,"about_ca_system_score_codex":0.000011479314,"about_ca_system_score_gemma":0.000011653415,"threshold_uncertainty_score":0.17910966},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035831693,0.000030514611,0.9711114,0.00019758825,0.0006604285,0.01957586,0.0017286297,0.0002814302,0.0028309394],"genre_scores_gemma":[0.99147314,0.0000059509307,0.0018422017,0.00002994761,0.00031944344,0.0051655252,0.00092526234,0.0000213538,0.00021714967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650234,0.0001768953,0.0010230299,0.0010016231,0.00063686166,0.00065926946],"domain_scores_gemma":[0.9971655,0.00046419946,0.00066222163,0.00045990077,0.00090485555,0.00034333367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011318099,0.0004797991,0.0006267999,0.0001839564,0.00043411873,0.001046843,0.00071996346,0.0001949348,0.000005083519],"category_scores_gemma":[0.00009837944,0.0004211051,0.00009466443,0.00033454114,0.00012128143,0.00042577478,0.00028517115,0.0002646116,0.000014221877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008390621,0.00036129516,0.0009225977,0.0003601415,0.00038696843,0.00012279728,0.00073716365,0.015428386,0.0017560245,0.9704178,0.0044215024,0.0042462433],"study_design_scores_gemma":[0.002752475,0.00033539292,0.0014049597,0.0010661997,0.000012949876,0.00012514662,0.0010195784,0.9886656,0.000033866803,0.00041150558,0.003642974,0.0005293566],"about_ca_topic_score_codex":0.00032001338,"about_ca_topic_score_gemma":0.000006547387,"teacher_disagreement_score":0.98789,"about_ca_system_score_codex":0.00015378547,"about_ca_system_score_gemma":0.00008692427,"threshold_uncertainty_score":0.99999017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013512529,0.000005003466,0.9390256,0.000105223124,0.00010729599,0.058650978,0.0000029901462,0.00010206299,0.0006496224],"genre_scores_gemma":[0.76885927,3.0409194e-7,0.0199955,0.000108640306,0.000056657344,0.21028069,0.0000055516107,0.000010317862,0.0006830495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988572,0.00003125821,0.00028844655,0.00033871256,0.00013659208,0.0003478178],"domain_scores_gemma":[0.9994068,0.00004701673,0.000056779976,0.0003620624,0.000053563002,0.00007377074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017932232,0.00012444671,0.00017612518,0.000047021924,0.00009071715,0.000054004468,0.00045842296,0.00007438434,0.000007785533],"category_scores_gemma":[0.000011938009,0.00010417563,0.00005651282,0.00028400565,0.000030689298,0.00024029627,0.00007931581,0.000094999006,0.000016540462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007781569,0.0067976173,0.041741084,0.001413484,0.00020253629,0.003063077,0.008108393,0.12974805,0.008242177,0.58641475,0.07909211,0.13439856],"study_design_scores_gemma":[0.0013882293,0.000068208916,0.002391557,0.00002979075,4.778569e-7,0.000024383702,0.000009047913,0.9856288,0.00006629178,0.00014023612,0.010096766,0.00015625283],"about_ca_topic_score_codex":0.000056349058,"about_ca_topic_score_gemma":0.0000856973,"teacher_disagreement_score":0.9190301,"about_ca_system_score_codex":0.000045959743,"about_ca_system_score_gemma":0.000039455597,"threshold_uncertainty_score":0.4248159},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29658124,0.00015130718,0.70240873,0.000024539206,0.00011768169,0.00016593888,0.00018656379,0.000072035225,0.00029196285],"genre_scores_gemma":[0.93884426,0.000002227875,0.060993176,0.000020262649,0.000022741055,0.0000037419777,0.00010474249,0.0000065820677,0.0000022331312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983964,0.00009620574,0.0006168203,0.00037021172,0.00020477427,0.0003155921],"domain_scores_gemma":[0.9990048,0.000069750065,0.00020827708,0.00037601416,0.0002387598,0.00010240719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318955,0.0001592405,0.00028448165,0.0000852308,0.00033936382,0.0001186566,0.0004089652,0.000048221307,0.000011234803],"category_scores_gemma":[0.000037264537,0.00016061524,0.000056484394,0.0005148532,0.00008651978,0.00018393411,0.0002127437,0.000109414024,0.0000025225204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003084481,0.001637405,0.102253504,0.0002548633,0.00033159606,0.000036199126,0.028422303,0.15773298,0.014832729,0.6206006,0.0005316175,0.07333537],"study_design_scores_gemma":[0.00037772005,0.000052250143,0.035223946,0.00009526396,0.000017233251,0.000017776969,0.0009404147,0.9604916,0.0022318687,0.000098735254,0.00025531434,0.00019785247],"about_ca_topic_score_codex":0.00031067952,"about_ca_topic_score_gemma":0.000011765444,"teacher_disagreement_score":0.80275863,"about_ca_system_score_codex":0.000043065622,"about_ca_system_score_gemma":0.000061758095,"threshold_uncertainty_score":0.65496993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057949718,0.0005352573,0.9399476,0.00044278085,0.0004759361,0.000076041055,0.0000037139484,0.00006442799,0.00050450955],"genre_scores_gemma":[0.8827621,0.000008862528,0.11655163,0.00013544214,0.0005051295,5.1932966e-7,0.00000833266,0.000010484195,0.000017496328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785554,0.00014658304,0.0007236489,0.00031207272,0.00040377185,0.00055838696],"domain_scores_gemma":[0.99819416,0.00030082153,0.00060968474,0.00029585345,0.0003251173,0.00027435122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582042,0.0002443277,0.00053106283,0.00006962659,0.00036325736,0.00040158676,0.0006690679,0.000087433895,0.000002227085],"category_scores_gemma":[0.000075591925,0.00018212666,0.00010402847,0.0005977304,0.00006443983,0.00043779347,0.00019552873,0.00037074575,0.0000034634172],"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.000043463504,0.000058169007,0.037309766,0.000037996884,0.00008264702,0.00006219443,0.00014348012,0.9308196,0.000011265572,0.011248738,0.007073595,0.013109095],"study_design_scores_gemma":[0.002067305,0.00045375357,0.026872898,0.0008024723,0.00003430948,0.00097089185,0.00021713835,0.9528161,0.000007170383,0.0011879584,0.014131372,0.00043860846],"about_ca_topic_score_codex":0.00002840117,"about_ca_topic_score_gemma":0.0000036588444,"teacher_disagreement_score":0.8248124,"about_ca_system_score_codex":0.000043090575,"about_ca_system_score_gemma":0.00008461127,"threshold_uncertainty_score":0.742691},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010988988,0.000035177192,0.98064786,0.00018778679,0.00046296616,0.00025155637,0.0000043834216,0.00019196462,0.0072293174],"genre_scores_gemma":[0.94152117,3.304919e-7,0.05752064,0.00025588606,0.00013066453,0.000016083668,0.0000072074795,0.000008221835,0.0005398165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988421,0.0000510373,0.00026803504,0.0003686795,0.00018121707,0.0002888955],"domain_scores_gemma":[0.99930334,0.000076047676,0.00010297074,0.00041163393,0.000025397696,0.00008060612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001824,0.00013067378,0.00019393383,0.00002528168,0.00024995228,0.00030147433,0.0006060649,0.000047531485,0.0000017829586],"category_scores_gemma":[0.000006841307,0.000109547196,0.00005419502,0.000092910435,0.000010029124,0.000290129,0.00015982558,0.000046468856,0.00007313271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006499035,0.00014869988,0.009104568,0.001517452,0.0000998428,0.0000068955546,0.002222744,0.009446515,0.006795691,0.8696192,0.002469939,0.098561995],"study_design_scores_gemma":[0.0003512172,0.00004036665,0.00082662,0.000118539945,0.0000026416863,0.000008483842,0.00020767693,0.9515963,0.00063677225,0.00003231109,0.04602131,0.00015776009],"about_ca_topic_score_codex":0.000073656585,"about_ca_topic_score_gemma":0.000009769309,"teacher_disagreement_score":0.94214976,"about_ca_system_score_codex":0.00003732051,"about_ca_system_score_gemma":0.000007923243,"threshold_uncertainty_score":0.4467205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037229165,0.00020542408,0.95900327,0.0006796777,0.0018443272,0.000411626,0.000030097097,0.00043993178,0.00015645598],"genre_scores_gemma":[0.8908152,3.9102403e-7,0.1067621,0.0009474689,0.0012481713,0.000022486462,0.00009338259,0.000024808924,0.00008597668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981922,0.00008447892,0.00041170875,0.0005815611,0.00024758838,0.00048247422],"domain_scores_gemma":[0.9988948,0.00008823,0.00019160962,0.0006279849,0.00010529004,0.000092095615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049463153,0.00020167457,0.00026975933,0.00008543921,0.00034502993,0.0005682278,0.000985066,0.00006740883,0.0000010162647],"category_scores_gemma":[0.000007342511,0.00019365427,0.00009700682,0.00026172222,0.000029224657,0.00040103102,0.00013227123,0.000106406405,0.000016937309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014125223,0.00048226476,0.0005077965,0.00036072402,0.00007483994,0.0002680123,0.0011132953,0.13967337,0.079013444,0.021275485,0.23418178,0.5230349],"study_design_scores_gemma":[0.0005009825,0.000044861263,0.001074039,0.000090301415,0.0000041774806,0.00003391001,0.000021936714,0.98759586,0.000359303,0.00005136723,0.009948214,0.00027502445],"about_ca_topic_score_codex":0.0003029333,"about_ca_topic_score_gemma":0.0000027774643,"teacher_disagreement_score":0.8535861,"about_ca_system_score_codex":0.00008073075,"about_ca_system_score_gemma":0.00002757715,"threshold_uncertainty_score":0.7896992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139211,0.0007821116,0.68470836,0.00034096435,0.00010135725,0.00004008602,0.0000051017273,0.000009778904,0.000091148104],"genre_scores_gemma":[0.9239333,0.00006190805,0.075796254,0.00005504771,0.00013634021,4.0343727e-7,0.0000042572315,0.0000041541794,0.000008297518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837816,0.000053892192,0.00074631034,0.0002061734,0.00032130626,0.0002941781],"domain_scores_gemma":[0.99913764,0.00010553503,0.00040830157,0.00016805752,0.0000485819,0.00013189121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055127405,0.00015413131,0.00032775736,0.00010664833,0.00009012285,0.0002447558,0.00047535158,0.000067662964,0.0000038104424],"category_scores_gemma":[0.000035148147,0.00012804382,0.00007439637,0.00024674783,0.000034304438,0.00077134516,0.0001661065,0.00024405557,0.0000060157727],"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.0000897108,0.00034819674,0.007518177,0.000020684616,0.000044096567,0.00025156964,0.0005941401,0.862415,0.0005924062,0.013218085,0.00149313,0.11341481],"study_design_scores_gemma":[0.0038233334,0.00025492787,0.11195929,0.0003569096,0.000011917818,0.0007152393,0.00042511598,0.844773,0.00008803469,0.0008919255,0.03630224,0.0003980442],"about_ca_topic_score_codex":0.000008742017,"about_ca_topic_score_gemma":0.000003256695,"teacher_disagreement_score":0.61001223,"about_ca_system_score_codex":0.000038801532,"about_ca_system_score_gemma":0.000052967785,"threshold_uncertainty_score":0.52214754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19477233,0.00000834995,0.8038395,0.000014879254,0.00014272946,0.00029158476,0.000094291114,0.00030359306,0.00053272326],"genre_scores_gemma":[0.98374057,0.0000010145351,0.016055731,0.0000085105485,0.000051674033,0.000004086329,0.00010217209,0.000012254877,0.000023988343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778,0.00008712235,0.0008058057,0.00046470732,0.0004852241,0.00037710677],"domain_scores_gemma":[0.9971552,0.0008215189,0.00044607383,0.0008852042,0.0005430873,0.0001489528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081131293,0.00021461448,0.00034971096,0.00014916799,0.00014712788,0.0001108841,0.0006377146,0.00010054493,0.0000150224405],"category_scores_gemma":[0.00019616818,0.00021844497,0.00008053758,0.0005236938,0.000057211077,0.000597673,0.00017683179,0.00011444581,0.000070272086],"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.000028322005,0.0000741623,0.0030770958,0.00013945154,0.000018659302,0.000010772374,0.00021854586,0.9314717,0.031736556,0.028386865,0.0000038735343,0.0048339977],"study_design_scores_gemma":[0.00057595846,0.000021274258,0.052638963,0.00018836342,0.00000876814,0.0000010262501,0.000044567478,0.94473356,0.0012505793,0.000028175942,0.00029475018,0.00021403129],"about_ca_topic_score_codex":0.00034269615,"about_ca_topic_score_gemma":0.000014460153,"teacher_disagreement_score":0.7889682,"about_ca_system_score_codex":0.00012725718,"about_ca_system_score_gemma":0.0000625408,"threshold_uncertainty_score":0.8907927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20572568,0.00060589623,0.79044056,0.00020376385,0.0006505979,0.00024605557,0.00008548668,0.00065039983,0.001391534],"genre_scores_gemma":[0.9837412,0.0000035009218,0.015430464,0.00032283232,0.000304431,0.0000016495503,0.00014533734,0.000024536797,0.000026040518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963823,0.00009315432,0.0008939746,0.0009682222,0.00052917446,0.0011331541],"domain_scores_gemma":[0.99783397,0.00034901046,0.000372009,0.0007990343,0.0002647006,0.00038129132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014697112,0.00042201477,0.0005309588,0.00015500972,0.00068023114,0.0006677269,0.001181139,0.00018527242,0.0000064840747],"category_scores_gemma":[0.000090705544,0.00042714333,0.0001323113,0.00101318,0.00010552255,0.00043713683,0.00058474246,0.00043960856,0.00004120814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006265619,0.00053630647,0.023990758,0.00036148037,0.00022886648,0.001446018,0.0052301213,0.017368902,0.0052018766,0.047756337,0.007355185,0.8904615],"study_design_scores_gemma":[0.0016430947,0.00011926776,0.07002632,0.0003556416,0.000018577051,0.00050844124,0.0006129013,0.9139845,0.001429731,0.00033913055,0.009898175,0.0010642576],"about_ca_topic_score_codex":0.00008675518,"about_ca_topic_score_gemma":0.000011183159,"teacher_disagreement_score":0.89661556,"about_ca_system_score_codex":0.0001238267,"about_ca_system_score_gemma":0.00006818712,"threshold_uncertainty_score":0.999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006899204,0.00068091735,0.9918356,0.0031590036,0.0005181187,0.0006229155,0.000011975825,0.00033090665,0.0021506732],"genre_scores_gemma":[0.96992654,9.766704e-7,0.026985347,0.0011000193,0.000106036474,0.00011066561,0.000015285596,0.000006705632,0.0017484211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984358,0.00003178636,0.0004037731,0.00041858907,0.00030235024,0.00040771396],"domain_scores_gemma":[0.998907,0.00003289855,0.00015473962,0.00043234442,0.00033471716,0.0001382855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039693678,0.00016343332,0.00025393374,0.00006133961,0.00015670455,0.0009963684,0.0007626203,0.00007338284,0.0000025295722],"category_scores_gemma":[0.000038132264,0.0001286356,0.00010550566,0.0002780758,0.00001477382,0.00086703966,0.000023182454,0.000067993446,0.000013944299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008452823,0.0008115142,0.00049597776,0.0004489848,0.00004382964,0.0000310396,0.00037017817,0.013551871,0.0020743946,0.6669589,0.09914034,0.21598844],"study_design_scores_gemma":[0.0015237668,0.000204326,0.00088940153,0.00016066075,0.0000057191855,0.00001260863,0.00012840948,0.93606955,0.00028837,0.0003651388,0.060014404,0.000337667],"about_ca_topic_score_codex":0.000041388234,"about_ca_topic_score_gemma":0.0000045437378,"teacher_disagreement_score":0.9692366,"about_ca_system_score_codex":0.000051667346,"about_ca_system_score_gemma":0.00012486156,"threshold_uncertainty_score":0.9608003},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002413706,0.0000072347434,0.8829666,0.00021131504,0.00021687026,0.11359064,0.0000023256605,0.00035261153,0.0024110791],"genre_scores_gemma":[0.40273002,1.1086661e-7,0.08564831,0.00012467756,0.0002978856,0.5108409,0.000016696584,0.000017400618,0.00032399592],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998333,0.00003803984,0.00038770103,0.00035583827,0.00024491205,0.0006405459],"domain_scores_gemma":[0.99892825,0.000029095263,0.00014911746,0.0005445212,0.00013983928,0.00020920459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041699372,0.00019990058,0.00021636505,0.000039945353,0.00016691914,0.0002486178,0.00061822205,0.000084641884,0.000021141801],"category_scores_gemma":[0.000025442865,0.00015800346,0.000109353125,0.00031770897,0.000021129363,0.00088138424,0.000114272196,0.00007609298,0.000094352305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050710558,0.0022352526,0.004828479,0.0005673973,0.0000877526,0.0000039944925,0.0012478394,0.00006864769,0.0007875717,0.32244787,0.007179699,0.6604948],"study_design_scores_gemma":[0.0077566733,0.001409786,0.007813468,0.0002827716,0.000017983839,0.00010785026,0.00013644846,0.39720467,0.0015732332,0.0016428138,0.5803937,0.0016606306],"about_ca_topic_score_codex":0.000047174985,"about_ca_topic_score_gemma":0.000014432299,"teacher_disagreement_score":0.7973182,"about_ca_system_score_codex":0.00009146089,"about_ca_system_score_gemma":0.00006907994,"threshold_uncertainty_score":0.6443194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03788013,0.0013093934,0.9535551,0.0020163874,0.00008755315,0.00041644397,0.0041621886,0.00013351992,0.00043925553],"genre_scores_gemma":[0.9708322,0.0002442283,0.021636495,0.000471898,0.000095887255,0.000112782385,0.0064412397,0.000008659138,0.00015656982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998389,0.0000954998,0.00035511397,0.00066960225,0.00018137546,0.0003094129],"domain_scores_gemma":[0.9985345,0.00009151983,0.000110294815,0.0010923961,0.000053342184,0.0001179214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040053864,0.00017024417,0.00020682752,0.00007228922,0.00010348734,0.000112641275,0.00043603292,0.00003984063,0.000014594227],"category_scores_gemma":[0.00011093472,0.00015663335,0.000035863803,0.0003825039,0.00004360262,0.0012419826,0.0002793861,0.0001330664,0.000047016332],"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.0003404335,0.0025788373,0.06182885,0.00042720424,0.00015511127,0.00020962539,0.0017860538,0.0040199747,0.0023564547,0.46251678,0.23736376,0.22641692],"study_design_scores_gemma":[0.0029546476,0.00006723877,0.053465296,0.00034541587,0.000017549199,0.000107931686,0.00014988985,0.18251327,0.0007245965,0.00050118106,0.75835556,0.0007974313],"about_ca_topic_score_codex":0.00015727888,"about_ca_topic_score_gemma":0.00025157374,"teacher_disagreement_score":0.9329521,"about_ca_system_score_codex":0.000037297235,"about_ca_system_score_gemma":0.000037955717,"threshold_uncertainty_score":0.63873225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020565849,0.0005539302,0.9691758,0.0003806355,0.008442631,0.0005763053,0.000035108835,0.00008868977,0.00018102558],"genre_scores_gemma":[0.96313745,0.0000068539402,0.030706644,0.000054835327,0.005740812,0.00011256176,0.00003087769,0.000012107769,0.0001978408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985409,0.00011174852,0.00037410733,0.00040507736,0.00039015766,0.00017804677],"domain_scores_gemma":[0.99900156,0.00002204898,0.00017312498,0.00032137232,0.00038162325,0.00010024269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014473136,0.00018988753,0.00026855807,0.000103050465,0.00018183792,0.00023688216,0.0001969815,0.00009361402,0.000019320762],"category_scores_gemma":[5.3991675e-7,0.00014766537,0.000057792702,0.00030338473,0.000042989952,0.00032134887,0.000010518189,0.00010615929,0.000010950772],"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.00002930553,0.0004006702,0.0001427178,0.00040176813,0.00037061164,0.000015054723,0.008386547,0.7939716,0.008080159,0.051175937,0.025819037,0.11120661],"study_design_scores_gemma":[0.00056391687,0.00014120163,0.0029193878,0.00007132736,0.000012241799,0.0001265834,0.00019537537,0.99142045,0.0007412141,0.0000045780216,0.003580024,0.00022372323],"about_ca_topic_score_codex":0.000103229606,"about_ca_topic_score_gemma":0.000016072501,"teacher_disagreement_score":0.94257164,"about_ca_system_score_codex":0.000043208955,"about_ca_system_score_gemma":0.00006023607,"threshold_uncertainty_score":0.6021619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08739621,0.00003165545,0.9090262,0.0008243803,0.0012859375,0.000045572233,0.000005072772,0.000018086097,0.0013668826],"genre_scores_gemma":[0.8068914,0.0000019313036,0.19274467,0.000042465777,0.00028019477,5.472072e-7,0.0000017237066,0.0000029302887,0.000034155997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767333,0.000022868391,0.00063799444,0.00021280297,0.0012692196,0.00018378191],"domain_scores_gemma":[0.9960634,0.00008014338,0.0008068959,0.00025936298,0.0027219295,0.00006826202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063760043,0.00010609044,0.00018073,0.0004324758,0.00012607616,0.0003685376,0.0025351332,0.00001979176,0.000005010785],"category_scores_gemma":[0.000039173316,0.000083112805,0.00007106357,0.00081147434,0.00027449254,0.0020873314,0.00020680328,0.00010986554,0.0000056273775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008623649,0.0010048104,0.019831885,0.000029798804,0.00018582557,0.00032280487,0.0009968458,0.15202107,0.017111422,0.43991685,0.0019197114,0.36657274],"study_design_scores_gemma":[0.0037833615,0.0009661683,0.15775481,0.0010584872,0.000026460959,0.00535786,0.000067212415,0.7871905,0.014096013,0.005285088,0.023688974,0.0007250786],"about_ca_topic_score_codex":0.00004814681,"about_ca_topic_score_gemma":0.000007373745,"teacher_disagreement_score":0.7194952,"about_ca_system_score_codex":0.000053264466,"about_ca_system_score_gemma":0.00039317255,"threshold_uncertainty_score":0.47109506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06280994,0.000010474102,0.93418723,0.000430763,0.00026554265,0.000087305074,7.9707854e-7,0.00008424814,0.0021237063],"genre_scores_gemma":[0.94816494,8.1888675e-7,0.051479127,0.0002581792,0.00008895886,0.0000030215435,5.8485705e-7,0.0000028571246,0.0000015321656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00012249143,0.00021911645,0.00053399365,0.00038048704,0.0003449363],"domain_scores_gemma":[0.99918145,0.00015975203,0.000048679467,0.00036810676,0.00009243636,0.00014959989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015330298,0.00011472759,0.00017578392,0.000064458305,0.00016019231,0.00034458624,0.00077877514,0.000032502256,0.000001301546],"category_scores_gemma":[0.000047968948,0.00009834462,0.000019677913,0.0008306811,0.0010637903,0.0005519788,0.00043370778,0.00012130249,0.000016682934],"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.0000011218235,0.00002335616,0.00048386023,0.000005989013,4.7738445e-7,0.0000017522639,0.00017947941,0.00047869093,0.0000692722,0.87664396,0.000009842971,0.122102186],"study_design_scores_gemma":[0.0001837643,0.00005623764,0.012416302,0.00002133698,5.6021906e-7,0.000009994996,0.0000016719154,0.8006102,0.00020029015,0.18629432,0.00009103313,0.0001142976],"about_ca_topic_score_codex":0.000010971559,"about_ca_topic_score_gemma":0.0000017362103,"teacher_disagreement_score":0.885355,"about_ca_system_score_codex":0.000032229735,"about_ca_system_score_gemma":0.000037025296,"threshold_uncertainty_score":0.40103772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009375869,0.008483303,0.9804561,0.00044484684,0.0007776295,0.0002916502,0.0000792439,0.000033646997,0.00005771622],"genre_scores_gemma":[0.7777476,0.00017264667,0.22164434,0.00005890553,0.00024600932,0.000023787541,0.00008857001,0.0000063716616,0.000011816492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988444,0.00007013889,0.0005069783,0.00014152678,0.00026768944,0.00016925621],"domain_scores_gemma":[0.997131,0.0004723177,0.0005939991,0.0008262452,0.000862981,0.000113494134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082021556,0.000100487545,0.00017153205,0.00009833488,0.00016897148,0.0001721351,0.003228697,0.00004752702,0.0000012643554],"category_scores_gemma":[0.00016148077,0.00008951337,0.000049201954,0.0001014112,0.00007372879,0.0010241162,0.0010223908,0.00014735058,0.0000021462422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021474323,0.0011640731,0.005040053,0.00004583689,0.0003434871,0.0000033911829,0.009175005,0.028158478,0.00018133817,0.0058942563,0.0032610337,0.9467116],"study_design_scores_gemma":[0.0005287711,0.000035955232,0.0003714622,0.00011765084,0.00001561274,0.00010339157,0.00016407453,0.98559445,0.000020047823,0.00008671843,0.012868839,0.000093050854],"about_ca_topic_score_codex":0.0000059558674,"about_ca_topic_score_gemma":0.0000026454486,"teacher_disagreement_score":0.95743597,"about_ca_system_score_codex":0.000047268004,"about_ca_system_score_gemma":0.000106813524,"threshold_uncertainty_score":0.5999776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019425038,0.00017544041,0.87504864,0.060675684,0.0007767385,0.00051670807,0.000020033145,0.00047059235,0.042891096],"genre_scores_gemma":[0.94585055,0.0000023003347,0.04866396,0.0014533531,0.000215973,0.000027489388,8.0378567e-7,0.0000070644187,0.003778494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989509,0.000013105804,0.00021664519,0.00025147022,0.00022310011,0.00034476444],"domain_scores_gemma":[0.9989746,0.00010186365,0.000045147903,0.0006265714,0.00010187704,0.00014991997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023272955,0.00011493249,0.00010899425,0.000024497569,0.00027737307,0.00033892237,0.0008660723,0.000044200922,0.000017368111],"category_scores_gemma":[0.000035025598,0.00006964094,0.000053958272,0.00027602137,0.00003055747,0.000121788515,0.00013402091,0.00009139406,0.00094547047],"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.000012632192,0.000060387996,0.00010437725,0.00000820745,0.00003320275,0.000019789428,0.00077344925,0.0005734191,0.002460102,0.37556353,0.29679874,0.32359216],"study_design_scores_gemma":[0.0001735158,0.00003796756,0.0004889389,0.000009447574,0.0000012235661,0.000031369793,0.00009353074,0.021470765,0.0015426436,0.0001107324,0.97589326,0.00014662984],"about_ca_topic_score_codex":0.000048353384,"about_ca_topic_score_gemma":0.0014134516,"teacher_disagreement_score":0.9264255,"about_ca_system_score_codex":0.000040871677,"about_ca_system_score_gemma":0.000050282237,"threshold_uncertainty_score":0.9998324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.600382,0.0000590611,0.34959236,0.0002758829,0.0013372058,0.0003039183,0.000043602464,0.00068571634,0.04732032],"genre_scores_gemma":[0.9768218,0.0000013030881,0.019373918,0.00012489356,0.00006185958,0.000040422827,0.000014315942,0.000004377296,0.003557103],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884844,0.00001762996,0.00024357291,0.0004018297,0.00019835561,0.00029020247],"domain_scores_gemma":[0.99868023,0.000086638625,0.00006280182,0.0009423766,0.00011687606,0.000111077774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002400611,0.00013024396,0.00016706005,0.000027641008,0.00010424848,0.00059117924,0.00096206536,0.000096087206,0.00014411275],"category_scores_gemma":[0.000103273116,0.00009958765,0.00007105404,0.0002459605,0.00008471732,0.00090931234,0.00029380852,0.00018392269,0.0013494465],"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.00001418095,0.0012048676,0.24499288,0.00014429419,0.00006801396,0.000016404048,0.0011653989,0.00018599074,0.0054238616,0.13107695,0.1295169,0.48619026],"study_design_scores_gemma":[0.00015281427,0.000025568745,0.022723619,0.000004479201,0.0000012674087,0.00001968542,0.00002002113,0.0011854247,0.0001714006,0.0018548139,0.97361636,0.00022456802],"about_ca_topic_score_codex":0.000044024557,"about_ca_topic_score_gemma":0.0006870183,"teacher_disagreement_score":0.84409946,"about_ca_system_score_codex":0.000018097126,"about_ca_system_score_gemma":0.000056387908,"threshold_uncertainty_score":0.9994281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002066889,0.0000054344873,0.96877086,0.0014864538,0.0008236215,0.00030226939,0.000009844515,0.00013328223,0.026401369],"genre_scores_gemma":[0.8975064,7.8932e-7,0.10039151,0.00021081064,0.00020950992,0.00014360921,0.000015992586,0.0000037239756,0.0015176401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993483,0.000008696965,0.00014589437,0.00028826002,0.000085068044,0.00012378347],"domain_scores_gemma":[0.99911344,0.0000240156,0.0000651719,0.0005856035,0.00017066064,0.000041089483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894693,0.000056232064,0.00006941892,0.0000215204,0.000079620484,0.000097887474,0.00031531675,0.000052664494,0.00001645715],"category_scores_gemma":[0.000058237227,0.00004737312,0.00003550402,0.00010936201,0.000009949512,0.00035542407,0.000021105696,0.000057604546,0.000036301833],"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.0000035862533,0.000015888538,0.000011998266,0.0000031596928,0.0000033558888,1.5788494e-7,0.000087546476,0.0000040678988,0.011954965,0.773087,0.009958948,0.20486933],"study_design_scores_gemma":[0.0006362254,0.00019122731,0.005054319,0.000013029075,0.0000044246244,0.0000231757,0.0000535727,0.43516457,0.06882205,0.018380346,0.47130787,0.00034918674],"about_ca_topic_score_codex":0.000038453152,"about_ca_topic_score_gemma":0.000044517445,"teacher_disagreement_score":0.8954395,"about_ca_system_score_codex":0.000010014912,"about_ca_system_score_gemma":0.000042431497,"threshold_uncertainty_score":0.19318198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04342012,0.000049131333,0.95425856,0.00008846201,0.00019484678,0.00017447588,0.000004754767,0.000107128486,0.0017024993],"genre_scores_gemma":[0.97243273,8.389083e-7,0.027418805,0.000034847944,0.000012036,0.000027674714,0.000005549213,0.000003198339,0.00006428995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896055,0.000055409342,0.00033270026,0.00030210795,0.0002120566,0.00013719122],"domain_scores_gemma":[0.9990698,0.000044164488,0.00010082775,0.0006635849,0.00008240752,0.000039215447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031194842,0.000074692776,0.00019495173,0.000080183745,0.00004212864,0.000015593845,0.00038313973,0.000036039015,0.0000017881272],"category_scores_gemma":[0.000011153382,0.00006685211,0.00004152486,0.0004511728,0.000019236184,0.00015391127,0.000042491483,0.000049096856,0.000007954721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008827934,0.0027769648,0.085330926,0.0016269869,0.000099417135,0.00090630644,0.007165728,0.024846388,0.026537722,0.24173382,0.008320575,0.60056686],"study_design_scores_gemma":[0.00036798313,0.000019147119,0.012850551,0.00014069573,7.120023e-7,0.00004541659,0.00005517817,0.98318964,0.0027609323,0.0000051396128,0.00047857524,0.0000860357],"about_ca_topic_score_codex":0.00035525777,"about_ca_topic_score_gemma":0.00000720153,"teacher_disagreement_score":0.95834327,"about_ca_system_score_codex":0.000070386785,"about_ca_system_score_gemma":0.000058873127,"threshold_uncertainty_score":0.272615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09486375,0.00085721037,0.8867367,0.000008711401,0.0012444941,0.00021437669,0.000009617768,0.00012287014,0.01594229],"genre_scores_gemma":[0.99620014,0.0000016878266,0.0035730628,0.0000067410197,0.000029509729,0.0000026850962,0.00000280176,0.0000068128325,0.00017655274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813443,0.00049816805,0.0006568186,0.00023994557,0.0002711407,0.00019951412],"domain_scores_gemma":[0.998368,0.00017621354,0.0005387008,0.0006475132,0.00022311568,0.000046448313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019989212,0.000114990995,0.0003628657,0.000073576266,0.0000812692,0.000045841243,0.0005237822,0.000058854377,0.000004199201],"category_scores_gemma":[0.00008634188,0.00010913377,0.000076798555,0.00032010765,0.00009022845,0.0001499888,0.000047232377,0.00006139487,0.00001253756],"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.000003304399,0.000044972334,0.00017057126,0.00020206207,0.000027229065,0.0000013797195,0.00061557844,0.0021905324,0.004696435,0.99079025,0.00014990104,0.0011077627],"study_design_scores_gemma":[0.004657522,0.0007076941,0.007923165,0.0041916952,0.00012377629,0.00066874776,0.0033440385,0.8003544,0.100477315,0.046967372,0.028595941,0.0019883192],"about_ca_topic_score_codex":0.000039631417,"about_ca_topic_score_gemma":2.289098e-7,"teacher_disagreement_score":0.9438229,"about_ca_system_score_codex":0.000026207637,"about_ca_system_score_gemma":0.00010654117,"threshold_uncertainty_score":0.4450346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026024252,0.000018296461,0.98523104,0.0010388789,0.0016895593,0.00038513527,0.00008776324,0.000104562205,0.008842352],"genre_scores_gemma":[0.99164873,7.298647e-7,0.005781202,0.0003531372,0.000077992794,0.00011034831,0.000013862949,0.000004990697,0.0020090071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903697,0.000013691456,0.0002671012,0.00028570762,0.00016068458,0.00023582246],"domain_scores_gemma":[0.99942386,0.00007581298,0.000049302984,0.00027349262,0.000098106975,0.000079400284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031652566,0.00009881594,0.00017270145,0.000048905473,0.000055407516,0.00006646256,0.0004250775,0.00008315239,0.00013646662],"category_scores_gemma":[0.000020528689,0.00008656335,0.00008066755,0.00013373907,0.000025563417,0.00034849366,0.000009392536,0.00017435587,0.0000421665],"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.00012795688,0.00074398576,0.007426343,0.00017336717,0.000084726016,0.0000689312,0.0013366068,0.0003880089,0.024927739,0.66902494,0.08112704,0.21457034],"study_design_scores_gemma":[0.0134551525,0.0003306549,0.024578877,0.000047546564,0.000014856701,0.00012564175,0.00010868092,0.34442806,0.0039770766,0.004112353,0.6078433,0.000977821],"about_ca_topic_score_codex":0.00003242058,"about_ca_topic_score_gemma":0.00015140873,"teacher_disagreement_score":0.9890463,"about_ca_system_score_codex":0.000013752816,"about_ca_system_score_gemma":0.000113058144,"threshold_uncertainty_score":0.35299507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035381047,0.000143065,0.9950162,0.00060794316,0.00045769266,0.00018054749,0.0000028447728,0.000029613837,0.000023962988],"genre_scores_gemma":[0.78066504,0.0000038615285,0.219092,0.000038453152,0.00016703065,0.000016656224,0.0000029694622,0.000006103544,0.000007880421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870986,0.000045127228,0.00050063693,0.00017227075,0.00042121304,0.0001508651],"domain_scores_gemma":[0.99910426,0.000119665034,0.0003321365,0.000111076064,0.00024872468,0.000084158506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058495573,0.000109685156,0.00017999395,0.00010525047,0.000077185134,0.00023016043,0.00042008376,0.000049218877,0.0000010314492],"category_scores_gemma":[0.000030228439,0.00009726282,0.000120991,0.000040852177,0.0000197838,0.00038749631,0.000017512173,0.00008952968,0.0000017151665],"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.000053647076,0.000042652628,0.00008005639,0.000026759139,0.000049629325,0.000004594929,0.00011597831,0.89314693,0.000044807977,0.0060442244,0.000005286324,0.100385405],"study_design_scores_gemma":[0.0012738518,0.0001157675,0.000043218894,0.00011715612,0.000011649077,0.000037338585,0.000046796176,0.984642,0.000013151433,0.00033015208,0.01326916,0.00009972486],"about_ca_topic_score_codex":0.000010486452,"about_ca_topic_score_gemma":0.0000013498403,"teacher_disagreement_score":0.77712697,"about_ca_system_score_codex":0.000091539856,"about_ca_system_score_gemma":0.000031261312,"threshold_uncertainty_score":0.39662626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051032994,0.000028436936,0.94511086,0.00050436176,0.0030264251,0.00012138084,0.00008389558,0.00002498239,0.00006667486],"genre_scores_gemma":[0.69255596,9.053973e-7,0.30704162,0.000028626735,0.0003508991,0.0000031377986,0.000011700686,0.0000029583075,0.0000042023635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977773,0.000040632363,0.0006934328,0.0002835034,0.0009875151,0.0002176126],"domain_scores_gemma":[0.9951161,0.00016498905,0.00071859703,0.00035821006,0.003539233,0.00010283817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232801,0.00011860369,0.00021799658,0.00040005674,0.00018340745,0.0005392055,0.0029588514,0.00003280499,0.0000030771487],"category_scores_gemma":[0.00006674944,0.00010650066,0.00014306816,0.0006525654,0.00025583166,0.001558154,0.0001476246,0.0000893511,0.0000024108977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029722549,0.0017129162,0.000805135,0.000012740887,0.00009191075,0.000026453552,0.00039330317,0.21272102,0.006498683,0.22287297,0.0013396661,0.55349547],"study_design_scores_gemma":[0.0006914124,0.00022300144,0.011039623,0.000047601825,0.0000058662654,0.00013310072,0.000009354546,0.9775371,0.0035184654,0.0039982293,0.002666345,0.00012987609],"about_ca_topic_score_codex":0.00003658237,"about_ca_topic_score_gemma":0.000003985689,"teacher_disagreement_score":0.7648161,"about_ca_system_score_codex":0.00016067771,"about_ca_system_score_gemma":0.00043984485,"threshold_uncertainty_score":0.5498331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03538839,0.0000835946,0.9605249,0.00025712964,0.00028392693,0.00046925893,0.000009067421,0.00020750408,0.0027762118],"genre_scores_gemma":[0.97550666,7.270938e-7,0.023948459,0.000050540948,0.000056791017,0.00012868605,0.000011314884,0.0000062837817,0.00029056007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988097,0.000050371782,0.0003544945,0.00029638462,0.00025737373,0.00023169302],"domain_scores_gemma":[0.99932516,0.000018638138,0.00007690008,0.000456596,0.000049818333,0.00007286792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023170581,0.000115829986,0.0001620024,0.000071836104,0.000048750542,0.00010416738,0.00037498077,0.00006079045,0.0000053406693],"category_scores_gemma":[0.0000032082994,0.000100412944,0.000056078345,0.00029918645,0.000009846231,0.0003799497,0.000053081058,0.000073652714,0.00007679601],"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.0000031315515,0.00016412487,0.004743985,0.00004050105,0.0000031765687,0.000018628742,0.00012746596,0.9018203,0.00031810714,0.05679264,0.00026543826,0.03570252],"study_design_scores_gemma":[0.00037110763,0.000031043546,0.014220588,0.00005802878,0.000002646827,0.0000057560414,0.000039227092,0.98349273,0.00018042617,0.000018229743,0.0014294696,0.00015075222],"about_ca_topic_score_codex":0.00006691037,"about_ca_topic_score_gemma":0.00009291008,"teacher_disagreement_score":0.94011825,"about_ca_system_score_codex":0.00017416207,"about_ca_system_score_gemma":0.000036292487,"threshold_uncertainty_score":0.4094721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025868923,0.000073467585,0.9563885,0.00030897147,0.00035733415,0.00006332022,0.0000071100717,0.00012042125,0.040093992],"genre_scores_gemma":[0.95525014,9.906064e-7,0.04204863,0.00013355071,0.00010274255,0.000011621154,0.0000071859818,0.000002342482,0.0024428053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943507,0.000013054398,0.000112546346,0.000088891305,0.000104478415,0.00024598723],"domain_scores_gemma":[0.9996126,0.000013695535,0.000024743891,0.00023320405,0.000029103467,0.00008659838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013447693,0.00004736999,0.000052923173,0.0000191708,0.00007403346,0.00008156324,0.00025032993,0.000015009839,0.00012460748],"category_scores_gemma":[0.000004409338,0.000039363324,0.000022916744,0.00016272649,0.000005976167,0.0006661334,0.000063802596,0.000031312775,0.00031090746],"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":[3.9398398e-7,0.0000806583,0.011790078,0.0000042000033,0.000010654566,5.713847e-7,0.00033507956,0.00005227703,0.00039275453,0.9391905,0.037771806,0.010370992],"study_design_scores_gemma":[0.0005058895,0.000042262454,0.026272358,0.0000068071613,0.0000046232253,0.00001848232,0.00024498717,0.035049867,0.0023851865,0.000491216,0.9346832,0.00029509136],"about_ca_topic_score_codex":0.000061000006,"about_ca_topic_score_gemma":0.0000055438045,"teacher_disagreement_score":0.95266324,"about_ca_system_score_codex":0.00001288127,"about_ca_system_score_gemma":0.00001604832,"threshold_uncertainty_score":0.399619},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46682355,0.00012895229,0.4885605,0.0017224491,0.0027680562,0.00055564183,0.00014549616,0.0009426824,0.038352683],"genre_scores_gemma":[0.92254275,0.000007316944,0.07316474,0.0006980232,0.00041249327,0.000018591834,0.00006862793,0.000027694881,0.0030597781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673915,0.000101320424,0.0005801317,0.0009545506,0.0007801672,0.00084466836],"domain_scores_gemma":[0.9973372,0.00011852911,0.0002187261,0.001594276,0.00031416028,0.00041706586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004611746,0.00044891692,0.00051981024,0.00014599263,0.00054246705,0.00063259696,0.0020509427,0.00032771632,0.0007674478],"category_scores_gemma":[0.00011541503,0.00038392763,0.00021135488,0.0008020356,0.00022910709,0.0009389045,0.00067418383,0.0007415952,0.00077141594],"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.00007921071,0.0005305095,0.011199119,0.00028542618,0.00017424017,0.000120199766,0.0040009636,0.0032301417,0.049112566,0.59014523,0.29295743,0.048164956],"study_design_scores_gemma":[0.0017440501,0.0001114858,0.03316372,0.00013939058,0.000018971004,0.00020907489,0.00008394059,0.10153053,0.0005851053,0.005524459,0.8557323,0.0011569541],"about_ca_topic_score_codex":0.00013949977,"about_ca_topic_score_gemma":0.00041261382,"teacher_disagreement_score":0.5846208,"about_ca_system_score_codex":0.00007592526,"about_ca_system_score_gemma":0.00017062777,"threshold_uncertainty_score":0.99986124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020615987,0.00012902924,0.97152984,0.0010948005,0.0010724975,0.0008384692,0.0020966688,0.0013388846,0.0012838456],"genre_scores_gemma":[0.9882842,0.0000019352447,0.009931463,0.0005328055,0.0005336903,0.000043675587,0.0005931309,0.00005204286,0.000027110158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930766,0.0014506301,0.001423387,0.0018925439,0.00070552074,0.0014512866],"domain_scores_gemma":[0.98616004,0.009830131,0.00083280087,0.0023264494,0.0004605113,0.00039008292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0059307683,0.0007940175,0.0010465727,0.00019289623,0.0011780488,0.0007087586,0.0027318483,0.00037616817,0.000007092546],"category_scores_gemma":[0.007927983,0.0006994369,0.00055962714,0.0010038167,0.00022448787,0.00023558467,0.00048462613,0.00057148514,0.00004901411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001532398,0.0009847136,0.0003150862,0.00036669036,0.0004704814,0.000025478086,0.00086262525,0.061358407,0.0010931108,0.5254176,0.02795085,0.37962252],"study_design_scores_gemma":[0.003732617,0.00069860864,0.009232253,0.0008761833,0.000115339615,0.00006417121,0.00012900161,0.8343353,0.01672064,0.085972965,0.045880023,0.0022428744],"about_ca_topic_score_codex":0.000022108898,"about_ca_topic_score_gemma":0.0000058182623,"teacher_disagreement_score":0.9676682,"about_ca_system_score_codex":0.00030526178,"about_ca_system_score_gemma":0.00013761735,"threshold_uncertainty_score":0.9995457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24701342,0.000012886918,0.75131613,0.00017885031,0.0008081668,0.0002340935,0.0000012474924,0.00016419252,0.0002709793],"genre_scores_gemma":[0.6203817,1.243971e-7,0.37944058,0.00005747904,0.00009299639,0.000008559068,0.0000012243554,0.000006019408,0.000011313456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729025,0.000031559448,0.00036439468,0.0006858684,0.0010280062,0.00059992843],"domain_scores_gemma":[0.99814695,0.00006579636,0.00027287216,0.00084432453,0.00046331593,0.00020672094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011651597,0.00020303269,0.00025978297,0.00023409813,0.0004401307,0.0008813005,0.002008858,0.00006972541,0.0000040953705],"category_scores_gemma":[0.000034657824,0.00015893548,0.0000699426,0.0017452596,0.0006231134,0.0013188492,0.00037800046,0.00028809757,0.000008704249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029145642,0.00035974185,0.0038741413,0.000092354014,0.00001448272,0.000047065216,0.0014923618,0.0012243149,0.035655025,0.08209704,0.00008807829,0.8750262],"study_design_scores_gemma":[0.0008250015,0.00051817414,0.0047002314,0.00021837908,0.0000052144887,0.000063950385,0.000026450705,0.9674636,0.012881881,0.00032657152,0.012528595,0.0004419347],"about_ca_topic_score_codex":0.000092750044,"about_ca_topic_score_gemma":0.000047164973,"teacher_disagreement_score":0.9662393,"about_ca_system_score_codex":0.000033203476,"about_ca_system_score_gemma":0.0005489828,"threshold_uncertainty_score":0.8498401},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001239218,0.000022321314,0.98786116,0.000082146704,0.00022724552,0.010439502,0.0000025395245,0.00003308666,0.000092805516],"genre_scores_gemma":[0.57352656,0.0000022694808,0.41043848,0.00016160955,0.0034058776,0.012438889,0.0000018237841,0.000010027226,0.000014464979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991234,0.000027211114,0.00037722447,0.00017509471,0.00012221519,0.00017485996],"domain_scores_gemma":[0.99889255,0.000107715176,0.00037735305,0.0001583466,0.0003639521,0.000100111356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004101475,0.000096472024,0.00018415402,0.00003898567,0.00025166664,0.0001540298,0.0003604921,0.000060352468,0.0000011263476],"category_scores_gemma":[0.0000018963519,0.00008277788,0.00007685413,0.00026691493,0.000027074519,0.0002190178,0.00007309327,0.00024952332,0.0000012171395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059836726,0.0004339058,0.002410615,0.00009863101,0.00011496503,0.0000020509112,0.00073803775,0.020668676,0.00029957178,0.27364373,0.03130648,0.6702235],"study_design_scores_gemma":[0.0004972786,0.00026562528,0.00093267864,0.000026734959,0.0000067351043,0.00015538407,0.0000062569466,0.7477832,0.000022928552,0.009241254,0.24095687,0.00010504801],"about_ca_topic_score_codex":0.000002558751,"about_ca_topic_score_gemma":0.0000058986343,"teacher_disagreement_score":0.7271145,"about_ca_system_score_codex":0.000012491882,"about_ca_system_score_gemma":0.0000564609,"threshold_uncertainty_score":0.33755842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016350193,0.0000032723271,0.9476932,0.00038665527,0.00010321201,0.019545196,0.000004005397,0.00035790767,0.030271515],"genre_scores_gemma":[0.91329163,1.2386593e-7,0.030431038,0.00036034468,0.00022519073,0.052849375,0.000008839293,0.000013647203,0.0028197917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987411,0.000043642554,0.00033028482,0.00036309505,0.00023649211,0.00028539606],"domain_scores_gemma":[0.9992457,0.00001406001,0.000083986044,0.000535981,0.00005330347,0.00006699112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001990862,0.0001297817,0.00016233312,0.00003518278,0.00008086784,0.00019941661,0.00064009445,0.000048849506,0.000028360699],"category_scores_gemma":[0.000003942173,0.00010293966,0.000079628015,0.0002752442,0.000031978016,0.00031865435,0.00014456095,0.00008505615,0.00028607828],"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.000012197675,0.00037774758,0.002810181,0.00009482691,0.0000135734,0.000049842904,0.00006697309,0.0002761584,0.0023955645,0.94581354,0.034176704,0.0139126945],"study_design_scores_gemma":[0.0019025012,0.00012548741,0.021692667,0.00007491314,0.0000029079765,0.000059645565,0.000014624984,0.28444684,0.003296431,0.012328947,0.67546886,0.00058618706],"about_ca_topic_score_codex":0.0005562834,"about_ca_topic_score_gemma":0.000092947535,"teacher_disagreement_score":0.9334846,"about_ca_system_score_codex":0.00005343855,"about_ca_system_score_gemma":0.000037016063,"threshold_uncertainty_score":0.41977572},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31511074,0.00042612496,0.6810264,0.000051974705,0.0031350048,0.000056569934,0.0000015204624,0.00003641874,0.00015525053],"genre_scores_gemma":[0.83949876,0.00009777262,0.15918688,0.00006234527,0.001141755,0.0000010311621,7.9452667e-7,0.0000063255557,0.000004315901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988714,0.000034513974,0.00043502208,0.00018098061,0.00026222804,0.00021586522],"domain_scores_gemma":[0.9987649,0.00014518923,0.00045036446,0.00010943289,0.00046265824,0.00006747435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380619,0.00011809026,0.0002150595,0.00011084702,0.00016269452,0.00015926867,0.0006184753,0.00004561812,0.0000010051065],"category_scores_gemma":[0.000011894017,0.00010416918,0.000073505325,0.00011978581,0.000024895706,0.0005553906,0.00014258534,0.00016486047,7.277465e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023199715,0.00007177222,0.004164067,0.000019597108,0.00010619463,0.000018882987,0.0016099671,0.00032911703,0.0000151125405,0.0012211388,0.00008670683,0.99233425],"study_design_scores_gemma":[0.0008302776,0.00019050656,0.007547934,0.00033431483,0.000010835942,0.0004737354,0.000036682723,0.9842066,0.000350253,0.0006232268,0.005233225,0.00016237442],"about_ca_topic_score_codex":0.000010205818,"about_ca_topic_score_gemma":7.9124806e-7,"teacher_disagreement_score":0.9921719,"about_ca_system_score_codex":0.000055561777,"about_ca_system_score_gemma":0.00004528581,"threshold_uncertainty_score":0.42478958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23619612,0.00038422554,0.76177543,0.00008420574,0.0005545875,0.000266007,0.00036265262,0.00012597679,0.00025076626],"genre_scores_gemma":[0.9992072,0.00003953243,0.0003383196,0.000038792597,0.000023240053,0.00006291271,0.000019400495,0.0000113900005,0.00025922895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981201,0.00010787293,0.0005462862,0.00044770216,0.00041449143,0.0003635155],"domain_scores_gemma":[0.9987632,0.00011313633,0.00019904305,0.0006256094,0.00011722755,0.00018175412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017318729,0.000272716,0.0004184424,0.00013012232,0.0002518179,0.000114839124,0.00046524423,0.00013128232,0.00002435105],"category_scores_gemma":[0.000003581859,0.00022552942,0.00014022384,0.00041569007,0.00010343909,0.0001695194,0.0000033271037,0.00020514881,0.000035185923],"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.00005756516,0.00045743334,0.001384544,0.00028526303,0.0000684991,0.000009789692,0.00022943586,0.99242896,0.00024330748,0.00075124385,0.00095102,0.003132938],"study_design_scores_gemma":[0.0011851814,0.0003579703,0.0024469204,0.0001721696,0.000020932051,0.0000310983,0.000057703794,0.9929568,0.0005263215,0.000010136784,0.0019115622,0.00032321425],"about_ca_topic_score_codex":0.00009679439,"about_ca_topic_score_gemma":0.0000084651765,"teacher_disagreement_score":0.76301104,"about_ca_system_score_codex":0.000036750098,"about_ca_system_score_gemma":0.000023484365,"threshold_uncertainty_score":0.9196823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06336344,0.0003288409,0.8747323,0.051048733,0.0032836816,0.0002139738,0.000006701849,0.00051430386,0.006508036],"genre_scores_gemma":[0.92396194,0.0000015767649,0.06241959,0.012381952,0.00053871813,0.000031850566,0.000015037713,0.000020549507,0.0006287635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818057,0.000052633644,0.0003154605,0.000494737,0.0004730823,0.0004835081],"domain_scores_gemma":[0.99807537,0.0001817996,0.000114787945,0.0014779193,0.000056351342,0.00009379867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020327198,0.00019772483,0.00020616247,0.000068246074,0.00013575064,0.0006713879,0.002132378,0.000103874845,0.000026502405],"category_scores_gemma":[0.00012387223,0.00018296685,0.00009945621,0.00055332837,0.000050073588,0.00097017596,0.00031250488,0.00025817906,0.00015924289],"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.000002687199,0.000046888606,0.0036839447,0.000015077318,0.000016238597,0.000106802356,0.00008964171,0.0003135291,0.0018489859,0.05091257,0.9389979,0.003965685],"study_design_scores_gemma":[0.00070834823,0.000047840545,0.030048221,0.00018120017,0.000011895476,0.000060602855,0.00003509605,0.0017687507,0.0006927581,0.050202865,0.9151877,0.0010546952],"about_ca_topic_score_codex":0.00044762515,"about_ca_topic_score_gemma":0.00001946724,"teacher_disagreement_score":0.8605985,"about_ca_system_score_codex":0.000056055113,"about_ca_system_score_gemma":0.000032798518,"threshold_uncertainty_score":0.7461172},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2006788,0.0004462223,0.79720896,0.0003428379,0.00041804218,0.00021817502,0.000013808394,0.0000632979,0.0006098403],"genre_scores_gemma":[0.9819694,0.000013823297,0.01754404,0.00020843501,0.00021060203,0.0000015373746,0.000023523466,0.000010237643,0.000018397977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680835,0.000035551602,0.0013485469,0.00034516418,0.0006455796,0.00081679365],"domain_scores_gemma":[0.9973203,0.00016063947,0.0012199196,0.0002564319,0.00070383167,0.00033888762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023056723,0.00027710467,0.00051109976,0.00014176281,0.00046810642,0.00043118544,0.0005844677,0.00009854801,0.0000027537478],"category_scores_gemma":[0.00011048025,0.00021364837,0.00020808836,0.0004139479,0.000078882345,0.00037295933,0.00025967718,0.00036381418,0.000004239326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076859654,0.00215157,0.06505278,0.00077433477,0.001289133,0.0030754746,0.0031730486,0.012580845,0.0016366664,0.25040576,0.003689926,0.6554019],"study_design_scores_gemma":[0.040084854,0.011278723,0.181104,0.008248261,0.00064431946,0.020612558,0.013866061,0.43263415,0.003972,0.019372327,0.2616098,0.0065729576],"about_ca_topic_score_codex":0.0000120766545,"about_ca_topic_score_gemma":0.0000134344455,"teacher_disagreement_score":0.7812906,"about_ca_system_score_codex":0.00010187579,"about_ca_system_score_gemma":0.00012264766,"threshold_uncertainty_score":0.87123275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026052082,0.000015969685,0.9699522,0.000042375792,0.0003050646,0.00023383825,0.000031510837,0.00015831453,0.0032086],"genre_scores_gemma":[0.76246357,3.871771e-7,0.23724258,0.000107799984,0.000052315365,0.000011192414,0.000017635126,0.0000056209074,0.000098868106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915236,0.000032452128,0.0001803286,0.00029131057,0.00012731983,0.00021625514],"domain_scores_gemma":[0.9991939,0.000014465684,0.000073128955,0.0005285925,0.00010420395,0.000085694075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023985664,0.000100980855,0.00012828042,0.000038191778,0.00015148963,0.00009028828,0.0005078094,0.00006039011,0.000024844518],"category_scores_gemma":[0.000010928983,0.000085616855,0.000049847356,0.00013938032,0.000015869367,0.00050930405,0.000048037655,0.000063252715,0.0000066799307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017794495,0.0013033132,0.01344812,0.00037348064,0.000115618735,0.00003722913,0.013911067,0.017224822,0.027955892,0.7528137,0.01591249,0.15672635],"study_design_scores_gemma":[0.00056777353,0.00016338265,0.0056350413,0.000046133126,0.000007387873,0.000026313852,0.000059950013,0.9365654,0.010641775,0.0182232,0.027709724,0.0003539006],"about_ca_topic_score_codex":0.00018489834,"about_ca_topic_score_gemma":0.000036107343,"teacher_disagreement_score":0.9193406,"about_ca_system_score_codex":0.000024419285,"about_ca_system_score_gemma":0.00003227141,"threshold_uncertainty_score":0.3491354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02305937,0.00002238274,0.97501045,0.00024952117,0.00029418894,0.00019106427,0.00003157631,0.000037686823,0.001103755],"genre_scores_gemma":[0.9655671,0.0000056131216,0.033517238,0.000048601065,0.000023494684,0.000029413313,0.000012019291,0.0000033864817,0.00079310883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938446,0.000007347908,0.00019052779,0.00018219065,0.00012249718,0.000112997324],"domain_scores_gemma":[0.9996313,0.00003852341,0.000043783602,0.00014776208,0.00008705333,0.000051591924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001443971,0.00006655941,0.00011899954,0.000027989181,0.00004432826,0.000030947493,0.00015118386,0.000049401093,0.0000554122],"category_scores_gemma":[0.0000058413266,0.000055515593,0.000040165018,0.00006734944,0.000028696468,0.0002480892,0.0000056806043,0.000043975644,0.0000019161666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020601724,0.0011335118,0.009898566,0.0009287324,0.00019628539,0.000006163756,0.004064692,0.0083595365,0.2610683,0.35023737,0.016034475,0.34786633],"study_design_scores_gemma":[0.003630106,0.00026483086,0.029190999,0.000038607985,0.000023510773,0.000048460228,0.00011070894,0.8101923,0.079117484,0.0016487917,0.075239114,0.0004951069],"about_ca_topic_score_codex":0.000024395444,"about_ca_topic_score_gemma":0.000060848222,"teacher_disagreement_score":0.94250774,"about_ca_system_score_codex":0.0000029305493,"about_ca_system_score_gemma":0.000031443593,"threshold_uncertainty_score":0.22638601},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30065605,0.00004060356,0.698584,0.00019328976,0.00041991356,0.000056306733,0.000028179616,0.00000447166,0.000017163124],"genre_scores_gemma":[0.8639729,0.0000047250137,0.13593069,0.000032642893,0.0000519361,0.0000013087868,0.0000017377971,0.0000020463565,0.0000019895758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873215,0.000035534256,0.0004444279,0.00017067551,0.00047159966,0.00014559063],"domain_scores_gemma":[0.9980038,0.00017641655,0.00050131266,0.00010029326,0.0011495415,0.00006865508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477245,0.00007859015,0.00015671336,0.0002486274,0.00013815265,0.00017456431,0.00053848716,0.000025224354,0.0000017612456],"category_scores_gemma":[0.00025119534,0.00006783749,0.00004851238,0.00030155777,0.00013371796,0.00031611553,0.00007093487,0.000071051545,1.0701071e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005160047,0.0004403312,0.00537686,0.000056548542,0.00013748414,0.0000063495613,0.0015878772,0.12574042,0.013848699,0.75495946,0.00027801504,0.09751634],"study_design_scores_gemma":[0.00088218105,0.0003069264,0.024987742,0.00013332682,0.0000090012,0.00031465146,0.000049400503,0.95644456,0.008720854,0.0070438124,0.0009952028,0.00011234638],"about_ca_topic_score_codex":0.000006940774,"about_ca_topic_score_gemma":0.00000189224,"teacher_disagreement_score":0.83070415,"about_ca_system_score_codex":0.00005952153,"about_ca_system_score_gemma":0.00022286951,"threshold_uncertainty_score":0.27663326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98519117,0.0002757652,0.012041004,0.000037397953,0.000339576,0.00036013816,0.000007698475,0.00006671047,0.0016805133],"genre_scores_gemma":[0.99515676,0.000016861095,0.0045716604,0.000036604586,0.000025587715,0.000036369456,0.0000020002635,0.0000044829485,0.00014969411],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989358,0.000043550863,0.0003958945,0.00024884197,0.00017266237,0.00020321143],"domain_scores_gemma":[0.99925035,0.00002872082,0.00014326382,0.00041473607,0.000111350644,0.00005157914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023905546,0.00009408649,0.00020810717,0.00008020859,0.000033282064,0.00010633469,0.00043600792,0.00006367456,0.000054888616],"category_scores_gemma":[0.0000026526168,0.00008000481,0.000032278254,0.0003098177,0.000011570714,0.0006053403,0.00010095654,0.000059151607,0.00016809964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041988646,0.001346631,0.5114611,0.007453876,0.00013454449,0.00008186812,0.005446233,0.04294012,0.2808265,0.12501068,0.009102051,0.016154418],"study_design_scores_gemma":[0.00047245133,0.000037707257,0.006925794,0.00046432766,0.0000020681248,0.000017271459,0.00017854296,0.9854671,0.0012236929,0.00016453746,0.0048803915,0.00016615956],"about_ca_topic_score_codex":0.0015275643,"about_ca_topic_score_gemma":0.0005199647,"teacher_disagreement_score":0.94252694,"about_ca_system_score_codex":0.00004261115,"about_ca_system_score_gemma":0.000043995766,"threshold_uncertainty_score":0.32625014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05020417,0.000120138146,0.94463056,0.0022748432,0.0009610055,0.0003610759,0.00009569363,0.0004464957,0.0009060306],"genre_scores_gemma":[0.9825905,8.946805e-7,0.016718797,0.0003413366,0.00026196367,0.000006013976,0.000034936063,0.000015920703,0.000029634979],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99712795,0.000041189152,0.00067235494,0.0005757377,0.00049323466,0.001089556],"domain_scores_gemma":[0.9973776,0.0006534647,0.00023705482,0.0010102892,0.00035599465,0.00036560406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014599396,0.0002940848,0.0002852704,0.000074408534,0.0010664777,0.00067406375,0.0017463651,0.00012040327,0.0000024827457],"category_scores_gemma":[0.00022600946,0.00022597618,0.0001387472,0.0012499824,0.000078607154,0.000108121545,0.00036221818,0.00033290984,0.00016121249],"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.00012336623,0.00029388134,0.00409085,0.00008504108,0.0002681248,0.00063750456,0.002231699,0.00941796,0.010411859,0.33263135,0.08170771,0.55810064],"study_design_scores_gemma":[0.0015826563,0.0002973772,0.031189565,0.00027515576,0.000022957905,0.0003673042,0.0016054858,0.2510063,0.009032396,0.00093678635,0.70218015,0.0015038875],"about_ca_topic_score_codex":0.000058762387,"about_ca_topic_score_gemma":0.00016787002,"teacher_disagreement_score":0.93238634,"about_ca_system_score_codex":0.00016129673,"about_ca_system_score_gemma":0.00009446714,"threshold_uncertainty_score":0.92150414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052884025,0.0009649688,0.990413,0.00018146816,0.00096722477,0.0006289051,0.0005237406,0.00036577292,0.0006664865],"genre_scores_gemma":[0.9952284,0.000012036669,0.0043901834,0.000015603535,0.00004249751,0.00020836284,0.000007771169,0.000021412257,0.000073723946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975915,0.0002830406,0.0007025728,0.0005893716,0.00044886972,0.00038463],"domain_scores_gemma":[0.99755156,0.00040434985,0.0003345964,0.0010407304,0.0003609915,0.00030777138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006920621,0.0003159874,0.00063685514,0.00018009036,0.00020746436,0.00023586606,0.0007334332,0.00015631581,0.0000017525948],"category_scores_gemma":[0.000055511806,0.00027860646,0.0001324218,0.0005230036,0.0000809364,0.00037966485,0.00001998646,0.00019115697,0.000018025778],"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.00044374616,0.0036950759,0.0013050853,0.0023700537,0.0016255433,0.0001769811,0.0053211106,0.7710663,0.001594608,0.13613781,0.0016431264,0.07462057],"study_design_scores_gemma":[0.0017775568,0.0008235614,0.00046575165,0.0009383251,0.00011299397,0.000105479005,0.0032074773,0.9660718,0.002007796,0.00013571784,0.023463206,0.00089033146],"about_ca_topic_score_codex":0.0011047311,"about_ca_topic_score_gemma":0.00001869839,"teacher_disagreement_score":0.98994,"about_ca_system_score_codex":0.00022709467,"about_ca_system_score_gemma":0.00029207778,"threshold_uncertainty_score":0.9999666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012506485,0.00015958525,0.969202,0.00034640168,0.00021341725,0.00018623445,0.0000058276632,0.00018461494,0.017195469],"genre_scores_gemma":[0.8934546,3.957927e-7,0.105887905,0.00010996396,0.000048702685,0.0000211601,0.0000012533943,0.0000038617786,0.0004721489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866265,0.00002687385,0.0005164722,0.0002517273,0.0003078883,0.00023440813],"domain_scores_gemma":[0.99925405,0.000021697495,0.000126474,0.00038984467,0.00012154607,0.00008637966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028471876,0.000120060184,0.00026347913,0.000048095855,0.00007342484,0.00005612546,0.000585122,0.00004857783,0.000012664539],"category_scores_gemma":[0.0000043192013,0.00009071489,0.000057084235,0.00019274247,0.000013137657,0.00023430993,0.000058823025,0.000048715323,0.00016115069],"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.000026850603,0.0003434951,0.00030118454,0.00030019795,0.0001612493,0.000027138656,0.004073697,0.002527264,0.012176648,0.68730843,0.006478472,0.28627536],"study_design_scores_gemma":[0.0017654822,0.000031645886,0.0011036923,0.00019608533,0.000006230676,0.000046229194,0.00021463902,0.48292375,0.018854579,0.000010174813,0.49448803,0.00035948292],"about_ca_topic_score_codex":0.0000114005015,"about_ca_topic_score_gemma":0.000021035275,"teacher_disagreement_score":0.8809481,"about_ca_system_score_codex":0.00007048166,"about_ca_system_score_gemma":0.00009569273,"threshold_uncertainty_score":0.3699246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16540861,0.0018142891,0.82877266,0.0008952623,0.0003697582,0.00056552613,0.001000474,0.0005819259,0.00059147074],"genre_scores_gemma":[0.9936332,0.000011360074,0.0048012096,0.000035668316,0.0003070481,0.000022191865,0.0011189795,0.000024202061,0.000046116565],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962919,0.00029934422,0.0011026,0.0009414016,0.0004722442,0.00089253404],"domain_scores_gemma":[0.9978272,0.00037505614,0.00038830214,0.00086439244,0.00021074308,0.00033431032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013227707,0.0004040768,0.0006513553,0.00020424604,0.00052059756,0.0007810615,0.0010230435,0.0002861564,0.000004515872],"category_scores_gemma":[0.0001945537,0.0004280769,0.000089249814,0.0015463985,0.000075518896,0.00087762304,0.00037343436,0.0007351555,0.00005982436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004984299,0.0006385157,0.44888088,0.00052450266,0.00023808274,0.00032722886,0.003651124,0.38274515,0.0005578961,0.05015256,0.022630451,0.08960379],"study_design_scores_gemma":[0.0015769644,0.00005447723,0.13886611,0.00044361746,0.000019250781,0.000091680966,0.00041860732,0.83775,0.00009422353,0.00022428896,0.019717364,0.0007433891],"about_ca_topic_score_codex":0.00025464807,"about_ca_topic_score_gemma":0.000021699469,"teacher_disagreement_score":0.8282246,"about_ca_system_score_codex":0.00032139337,"about_ca_system_score_gemma":0.0001262483,"threshold_uncertainty_score":0.99981713},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021934073,0.0036094624,0.93573564,0.002854515,0.0018323859,0.00088692683,0.000012327482,0.00016016372,0.032974474],"genre_scores_gemma":[0.9848633,0.00061435887,0.010677551,0.0001086958,0.00033306307,0.000050461986,0.0000017340174,0.000037124737,0.00331375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976295,0.00013356167,0.0008295285,0.00023474642,0.0006268904,0.00054572977],"domain_scores_gemma":[0.99842614,0.00021433589,0.00043403465,0.0006482297,0.00010951522,0.00016772586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013018042,0.0002277237,0.00033499982,0.000095200005,0.00039513936,0.0011781533,0.0013079148,0.00007739885,0.0000052123737],"category_scores_gemma":[0.000066199565,0.00013479551,0.00011978306,0.0004636626,0.00006795276,0.00036218064,0.00010536242,0.0004685799,0.00012875238],"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.00002648356,0.00039180665,0.0005786498,0.00021673358,0.00009178919,0.000844835,0.0031281686,0.0073011206,0.00012415886,0.94714695,0.0056657274,0.03448357],"study_design_scores_gemma":[0.0029802516,0.00091715116,0.0015031734,0.0044523166,0.000031502364,0.011040901,0.0034735426,0.5597692,0.0000640375,0.06630234,0.34804255,0.0014230474],"about_ca_topic_score_codex":0.000009446953,"about_ca_topic_score_gemma":0.0000054623633,"teacher_disagreement_score":0.9629292,"about_ca_system_score_codex":0.00015781654,"about_ca_system_score_gemma":0.00008498667,"threshold_uncertainty_score":0.99985874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049181666,0.00002108739,0.94424236,0.003917927,0.00010976332,0.00012232445,0.000002471654,0.00029934428,0.0021030663],"genre_scores_gemma":[0.95117515,4.738042e-7,0.04385436,0.0048864363,0.00003704535,0.0000135345335,0.000017013846,0.000005108974,0.0000108952745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882185,0.000009032993,0.0003603386,0.00015095774,0.00037996515,0.00027784595],"domain_scores_gemma":[0.9992697,0.000008783256,0.00027174616,0.00021874721,0.0001639848,0.000067037545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718746,0.00013967871,0.00012458948,0.00009736826,0.00025373793,0.0006630765,0.00041642025,0.00003853124,0.0000011830705],"category_scores_gemma":[0.000021314201,0.00011360251,0.00002421006,0.000509926,0.00004836665,0.0051396666,0.000046385478,0.00012463663,0.000073871786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011161705,0.0001533968,0.0013651476,0.0011123131,0.000070483926,0.00012635776,0.022366999,0.14795431,0.0045554573,0.03882858,0.0027038674,0.78065145],"study_design_scores_gemma":[0.022586154,0.0006857519,0.017665142,0.00673693,0.000056532343,0.0030597616,0.0016558367,0.5943952,0.015904132,0.0018001773,0.33079332,0.0046610064],"about_ca_topic_score_codex":0.000030724044,"about_ca_topic_score_gemma":0.000002495108,"teacher_disagreement_score":0.90199345,"about_ca_system_score_codex":0.000047718277,"about_ca_system_score_gemma":0.00013733775,"threshold_uncertainty_score":0.63940626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14680058,0.013963839,0.82818353,0.0022868,0.0040400857,0.00037181308,0.00007636996,0.0003008085,0.0039761495],"genre_scores_gemma":[0.91767335,0.0022054387,0.06490294,0.00045074726,0.0022711144,0.000016269469,0.000015140337,0.000084266176,0.012380714],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9936773,0.0014596469,0.0017092011,0.00078122795,0.0010404922,0.0013320991],"domain_scores_gemma":[0.99611044,0.00028695038,0.0011420714,0.0008405517,0.00085730845,0.00076270313],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014618626,0.0007029063,0.00087484455,0.0003156844,0.0016645062,0.0011269466,0.0016132529,0.0004035355,0.00037102652],"category_scores_gemma":[0.00053917983,0.00062629214,0.0005136599,0.0010020209,0.0004775176,0.0011619884,0.00034837078,0.0012292169,0.00066222996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037037484,0.00043284416,0.005083072,0.0002448809,0.00019722928,0.003512568,0.015441118,0.014744771,0.002430662,0.005454468,0.01038468,0.9420367],"study_design_scores_gemma":[0.0012078254,0.00048636855,0.5781457,0.0013014275,0.000073069685,0.032316428,0.00032350325,0.33511773,0.00068319053,0.013343035,0.03617111,0.0008306556],"about_ca_topic_score_codex":0.0007349409,"about_ca_topic_score_gemma":0.00011796766,"teacher_disagreement_score":0.94120604,"about_ca_system_score_codex":0.00092590286,"about_ca_system_score_gemma":0.001202677,"threshold_uncertainty_score":0.99991},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008448916,0.00011783801,0.9795529,0.00032124764,0.0004695212,0.00019668527,0.00009284944,0.00023381077,0.018170219],"genre_scores_gemma":[0.9581688,0.000001015044,0.04118353,0.0002631156,0.000027074213,0.000038906976,0.000028582812,0.00000356138,0.00028543116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990104,0.000027260483,0.00019107043,0.00030216205,0.00013980448,0.0003293225],"domain_scores_gemma":[0.999351,0.000038834034,0.000047863396,0.00036664165,0.00009341559,0.000102241276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002105537,0.000109809334,0.00013799623,0.0000139946715,0.00012098265,0.000168891,0.00042573747,0.000047403235,0.000018024328],"category_scores_gemma":[0.000075058226,0.000093839015,0.00007572736,0.00037318587,0.000013840096,0.00025828704,0.00003556505,0.000026748165,0.000022746384],"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.0000018425676,0.000035547313,0.001287328,0.000010643472,0.000013363871,0.000003838396,0.000015117696,0.0001696087,0.000029324056,0.96112853,0.0317204,0.0055844802],"study_design_scores_gemma":[0.0015160465,0.00008793332,0.004438069,0.000031783635,0.0000098945275,0.00008325794,0.000044046625,0.09416489,0.0009715392,0.034376353,0.86372197,0.0005542126],"about_ca_topic_score_codex":0.000015201658,"about_ca_topic_score_gemma":0.00001599419,"teacher_disagreement_score":0.9573239,"about_ca_system_score_codex":0.000057831647,"about_ca_system_score_gemma":0.00006395184,"threshold_uncertainty_score":0.3826644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06439809,0.000046212248,0.9337216,0.0005519976,0.00008179691,0.00061177014,0.00006783365,0.00003952095,0.00048120404],"genre_scores_gemma":[0.99298173,0.0000060267203,0.006406731,0.000062124935,0.000016410393,0.00030618758,0.000012870206,0.0000038590706,0.00020405043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.00003686741,0.00029981264,0.0002491334,0.00018824129,0.00018478069],"domain_scores_gemma":[0.9992573,0.00010789144,0.00010106001,0.00043147313,0.00008510175,0.000017175473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022808218,0.00008741369,0.00012701008,0.0000349578,0.000060101072,0.000042103467,0.00066941744,0.000033368357,0.0000026219648],"category_scores_gemma":[0.000003883024,0.000064578984,0.0000560132,0.00034914963,0.000021546244,0.00038089807,0.0000081541575,0.000058479258,0.000002352086],"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.0000861842,0.0011066146,0.006550262,0.00053624925,0.000025047542,0.0000058257997,0.0044966997,0.5807993,0.012004669,0.2029542,0.0023357465,0.1890992],"study_design_scores_gemma":[0.0022138401,0.00014372732,0.049485937,0.000114478025,0.0000082748265,0.000010150126,0.0011850232,0.8935135,0.010849144,0.0047327094,0.037313357,0.00042986032],"about_ca_topic_score_codex":0.0007183855,"about_ca_topic_score_gemma":0.00090071186,"teacher_disagreement_score":0.9285836,"about_ca_system_score_codex":0.000017753184,"about_ca_system_score_gemma":0.000021580605,"threshold_uncertainty_score":0.26334545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024968566,0.00044193745,0.95921165,0.00070205185,0.00055527635,0.0016826417,0.00007427445,0.00055414275,0.011809449],"genre_scores_gemma":[0.96786416,0.000003683414,0.025497785,0.0020945654,0.000072208815,0.00094976136,0.000010491479,0.000013924514,0.0034934091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868673,0.00002489024,0.00025315187,0.00044154155,0.00022440816,0.00036926652],"domain_scores_gemma":[0.99880177,0.000098080585,0.00006961432,0.0006674114,0.00021555158,0.00014759923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001398351,0.00016227095,0.00019749413,0.00004657999,0.0001263207,0.00019052836,0.00074128236,0.00007645308,0.00019841443],"category_scores_gemma":[0.00001734387,0.00013921893,0.000093393275,0.00040827447,0.000017684853,0.00029392427,0.00007614561,0.000066881534,0.0008345392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009660226,0.0046704523,0.0007453191,0.0010796099,0.00019207232,0.00016053289,0.008732778,0.027319737,0.009135238,0.09103036,0.25251582,0.6043215],"study_design_scores_gemma":[0.00084049243,0.00025494027,0.00004906328,0.000025963409,0.000003305457,0.000008976293,0.000056915986,0.74427605,0.0015077012,0.000068873735,0.25270247,0.00020525626],"about_ca_topic_score_codex":0.00010412218,"about_ca_topic_score_gemma":0.000025957253,"teacher_disagreement_score":0.9428956,"about_ca_system_score_codex":0.000032321725,"about_ca_system_score_gemma":0.00002671347,"threshold_uncertainty_score":0.99994344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55719703,0.00007411819,0.43363714,0.0013023983,0.00008584566,0.00016163064,0.0000031436814,0.000041281055,0.00749738],"genre_scores_gemma":[0.9984445,0.0000011994875,0.0009824636,0.000030265703,0.0000074725535,0.0000017074918,3.8115311e-7,9.799581e-7,0.0005310075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996548,0.000040589057,0.000067569585,0.000097026415,0.00009153421,0.000048432557],"domain_scores_gemma":[0.9997301,0.000029278654,0.00003972901,0.00013362587,0.00003642825,0.000030855514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024981087,0.000036121113,0.00005767549,0.000011799158,0.00003378322,0.00003811986,0.00007811675,0.000016240265,0.0000029705443],"category_scores_gemma":[0.00002011513,0.000022411376,0.000009067281,0.00007099873,0.00004472665,0.000104030136,0.000043390697,0.00002690329,0.000007975181],"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.000027895523,0.00010109616,0.000289195,0.000026213535,0.000022103015,0.000001305134,0.000903209,0.000058084795,0.00607452,0.92882955,0.004815721,0.058851108],"study_design_scores_gemma":[0.0014176456,0.0010680329,0.03788837,0.00012340586,0.000010794299,0.000064484244,0.00022528472,0.76885235,0.02063673,0.16307864,0.0063060457,0.00032818803],"about_ca_topic_score_codex":0.00006894078,"about_ca_topic_score_gemma":0.00002685089,"teacher_disagreement_score":0.7687943,"about_ca_system_score_codex":0.0000059551207,"about_ca_system_score_gemma":0.000007375165,"threshold_uncertainty_score":0.09139094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022391228,0.00037506327,0.974239,0.0016062466,0.00010738671,0.0004662853,0.0001867906,0.00016652203,0.00046150535],"genre_scores_gemma":[0.9835366,0.00001534407,0.015764197,0.00011412631,0.000025300546,0.00004255128,0.0000547777,0.000004759011,0.0004423528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.000033091997,0.00034402002,0.000619863,0.00013378213,0.00030957488],"domain_scores_gemma":[0.99883395,0.00014453231,0.00006912517,0.0007816019,0.000035203248,0.00013556167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026632793,0.00013379185,0.00022092526,0.000044381723,0.00007308671,0.00011104535,0.0004288176,0.00004064972,0.000051433053],"category_scores_gemma":[0.00012179616,0.000112618414,0.000029704936,0.0005316668,0.00003382737,0.00036343603,0.00011487728,0.000066507826,0.000022824543],"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.000045021465,0.0009101943,0.019212455,0.00017184757,0.000029155122,0.00003261596,0.00064028933,0.00020502797,0.0007005464,0.7392757,0.13658129,0.10219586],"study_design_scores_gemma":[0.005901174,0.0004060473,0.08268268,0.00014970676,0.000016118092,0.000074178075,0.00005410206,0.73879904,0.0023133955,0.009991646,0.15835537,0.0012565585],"about_ca_topic_score_codex":0.0007150472,"about_ca_topic_score_gemma":0.00010023828,"teacher_disagreement_score":0.96114534,"about_ca_system_score_codex":0.000034486613,"about_ca_system_score_gemma":0.000024081404,"threshold_uncertainty_score":0.45924455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022597797,0.000070658185,0.9639838,0.00054394885,0.00017462314,0.00021003948,0.000043284468,0.00008083272,0.012295064],"genre_scores_gemma":[0.99660873,0.000007593982,0.0023647978,0.00043605684,0.00003906313,0.0000029707708,0.000021029406,0.0000036604686,0.000516074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862224,0.000048041613,0.00023979336,0.00054880383,0.00026437224,0.00027672647],"domain_scores_gemma":[0.99883026,0.000042331776,0.00006789846,0.0009815871,0.0000076547985,0.000070245136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025008983,0.00013213888,0.00017254394,0.000048511247,0.00006278538,0.00009306634,0.0012884078,0.000050618106,0.000009247717],"category_scores_gemma":[0.000010214075,0.000114175215,0.000019340792,0.00021692879,0.00001557898,0.0005650305,0.00024174307,0.0001261909,0.000095866846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005474011,0.0009718856,0.0040317983,0.000019445559,0.000039213977,0.00043316206,0.0010793367,0.003122939,0.0017636764,0.116415404,0.01680995,0.85525846],"study_design_scores_gemma":[0.0009933246,0.00022692337,0.031429805,0.0001880637,0.0000026850958,0.00001703469,0.00011034073,0.95537895,0.0005230718,0.00070312625,0.009999909,0.0004267775],"about_ca_topic_score_codex":0.00004589333,"about_ca_topic_score_gemma":0.000015875923,"teacher_disagreement_score":0.97401094,"about_ca_system_score_codex":0.00004109045,"about_ca_system_score_gemma":0.000019713149,"threshold_uncertainty_score":0.465593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012930073,0.00050264806,0.93076056,0.0003289275,0.0010384001,0.00014690445,9.666561e-7,0.00043689966,0.053854592],"genre_scores_gemma":[0.98959935,0.00000720574,0.0048491103,0.00023119616,0.00006425319,0.000011248537,8.119894e-7,0.000005227035,0.0052315937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989713,0.000033064756,0.00018020689,0.00030689716,0.00023176316,0.00027678194],"domain_scores_gemma":[0.99932104,0.000049893246,0.000057209545,0.00044905333,0.000040233193,0.00008258071],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013546155,0.00010015407,0.00012818325,0.000047128255,0.00011815532,0.00018351464,0.00059566775,0.00004136048,0.00006869087],"category_scores_gemma":[0.000029850316,0.00008872154,0.00006908419,0.00031767844,0.000012433801,0.00046100235,0.00011508576,0.000076118624,0.0010275227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016982573,0.00046976475,0.0059311544,0.00043329218,0.000093753355,0.00045130186,0.0024045296,0.00010686409,0.008236961,0.34309825,0.13281754,0.50595486],"study_design_scores_gemma":[0.002486389,0.00014989126,0.02462666,0.000478746,0.000017443363,0.00024395727,0.00007891041,0.71789324,0.013334183,0.0042726593,0.235001,0.0014169054],"about_ca_topic_score_codex":0.0000233091,"about_ca_topic_score_gemma":0.0000029214236,"teacher_disagreement_score":0.97666925,"about_ca_system_score_codex":0.000018386503,"about_ca_system_score_gemma":0.000003503553,"threshold_uncertainty_score":0.9997503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50071096,0.0004651298,0.18169622,0.013136861,0.003989565,0.0016386438,0.000013279587,0.0006125223,0.2977368],"genre_scores_gemma":[0.9971385,0.0000045378406,0.0022658247,0.00015397358,0.00006377158,0.00001909656,1.4956503e-7,0.000003881318,0.00035025302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991644,0.0000048927614,0.0001885269,0.00019116451,0.00028552653,0.00016549017],"domain_scores_gemma":[0.99948394,0.000014023885,0.0001627259,0.00018474089,0.00011469086,0.000039878163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172962,0.00008410968,0.00012748178,0.000026054868,0.00007396817,0.00007566482,0.0010788158,0.000026558695,0.0000025077459],"category_scores_gemma":[0.000044945486,0.000053172014,0.00007586957,0.00023913155,0.000025306112,0.00023115703,0.0002963919,0.0000629722,0.000014834529],"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.0000071575714,0.00010592337,0.0056121103,0.000108150976,0.000026945962,1.3674187e-7,0.0005112722,0.000033241908,0.04444461,0.88084936,0.016339617,0.051961467],"study_design_scores_gemma":[0.0020706651,0.00035821766,0.03465035,0.0005434484,0.00003405881,0.00006159868,0.00022207093,0.040167626,0.44563195,0.049288746,0.42624098,0.0007302884],"about_ca_topic_score_codex":0.000019242902,"about_ca_topic_score_gemma":4.504925e-7,"teacher_disagreement_score":0.8315606,"about_ca_system_score_codex":0.00002500387,"about_ca_system_score_gemma":0.000008758345,"threshold_uncertainty_score":0.21682918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19054675,0.00025917462,0.80446005,0.00026380463,0.0007366688,0.00052271964,0.00004776781,0.00023840067,0.0029246565],"genre_scores_gemma":[0.9946157,0.000007658707,0.0046540787,0.00010444303,0.00005012062,0.000050380386,0.0000045778957,0.000009041336,0.00050401606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982175,0.000044847155,0.00045020573,0.0005573272,0.00026493668,0.0004651507],"domain_scores_gemma":[0.9988029,0.000054503696,0.00009188869,0.00082662783,0.00009874365,0.00012536251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002387698,0.00017548093,0.00026951195,0.000101464946,0.00010326144,0.00027285915,0.00070211897,0.00007904176,0.000009878867],"category_scores_gemma":[0.000063073,0.00015416401,0.000043769185,0.00088896684,0.000016409424,0.00057566573,0.00018390815,0.00012418456,0.00013363616],"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.00010302729,0.002382231,0.268165,0.0013255976,0.0001690993,0.0004360739,0.0038380516,0.33488807,0.05264279,0.074746124,0.04020842,0.22109553],"study_design_scores_gemma":[0.00035347402,0.00005032411,0.00437442,0.000080375146,0.0000012099108,0.000021922167,0.000039780272,0.9627211,0.0004163038,0.0000045098373,0.03170785,0.00022870753],"about_ca_topic_score_codex":0.00033363167,"about_ca_topic_score_gemma":0.000025929628,"teacher_disagreement_score":0.8040689,"about_ca_system_score_codex":0.00014288837,"about_ca_system_score_gemma":0.00001915609,"threshold_uncertainty_score":0.6286626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07970914,0.00012441256,0.91724354,0.00017596001,0.00010928295,0.00008818773,0.000012951089,0.00012524422,0.002411294],"genre_scores_gemma":[0.99507916,0.0000031787536,0.004670271,0.00007626771,0.0000072689204,0.000008212762,0.000003972927,0.0000030132612,0.00014867778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991733,0.00005818635,0.00016696418,0.00029465114,0.00011013423,0.00019679975],"domain_scores_gemma":[0.9996018,0.000009875544,0.000031090447,0.00021604646,0.000064620406,0.00007656081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029359286,0.000087830085,0.00011645923,0.000018156792,0.00013163601,0.00018471286,0.000148939,0.000041760526,0.000019006911],"category_scores_gemma":[0.000013058317,0.00006978562,0.000025337922,0.00021938616,0.00002421905,0.0005199234,0.000016624257,0.0000747451,0.000008399548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008565661,0.003227854,0.08460826,0.0012623133,0.00011882268,0.00005729143,0.025720572,0.00047141436,0.014794768,0.3140362,0.006975866,0.54864097],"study_design_scores_gemma":[0.004609813,0.0003240233,0.058143355,0.0002798144,0.00002735617,0.00034355008,0.0038964928,0.59078103,0.018298196,0.006378289,0.31526875,0.0016493112],"about_ca_topic_score_codex":0.000009122432,"about_ca_topic_score_gemma":0.000025861656,"teacher_disagreement_score":0.91537,"about_ca_system_score_codex":0.000024030496,"about_ca_system_score_gemma":0.000024015912,"threshold_uncertainty_score":0.2845775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014083928,0.00005844885,0.98356366,0.00036691598,0.000037315393,0.00011248614,0.00006152692,0.00014807105,0.001567675],"genre_scores_gemma":[0.9969739,0.0000085780575,0.002642129,0.000045534358,0.000023178565,0.000009497649,0.00008999726,0.0000018325095,0.00020537453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990645,0.000032135475,0.00024775433,0.00035017045,0.00017255121,0.00013287648],"domain_scores_gemma":[0.99925244,0.000056779394,0.00009647681,0.00044642366,0.000080032296,0.00006786578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017835578,0.00008057894,0.00013629104,0.00008099594,0.000100535566,0.00017018542,0.00022443545,0.00004648517,0.0000106597545],"category_scores_gemma":[0.000031199026,0.00007145112,0.00004964456,0.0012009523,0.000017616305,0.0004016705,0.00006245479,0.000042953885,0.000040596184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004642061,0.00094828237,0.061125025,0.00008977778,0.000985598,0.000020197434,0.0021764578,0.26851508,0.0010301401,0.19470169,0.011403072,0.45895827],"study_design_scores_gemma":[0.00022564555,0.000010242053,0.04052012,0.000001804828,0.000022801021,7.0072593e-7,0.000006014737,0.9519616,0.00003561079,0.0002383508,0.006887666,0.00008946704],"about_ca_topic_score_codex":0.000108174696,"about_ca_topic_score_gemma":0.00005719282,"teacher_disagreement_score":0.98288995,"about_ca_system_score_codex":0.000022234784,"about_ca_system_score_gemma":0.0000019935374,"threshold_uncertainty_score":0.2913692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017479298,0.00006091919,0.9104401,0.0027942145,0.00023487212,0.00004439096,0.0000019624133,0.00017968721,0.08449594],"genre_scores_gemma":[0.96607155,0.0000017667403,0.025632722,0.00067316566,0.00011878451,0.0000061177307,0.0000013875625,0.0000023627151,0.0074921562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941343,0.000009137276,0.00011692569,0.0001644059,0.00016332637,0.0001327594],"domain_scores_gemma":[0.9996638,0.000011076576,0.000018583523,0.00021987442,0.000032062522,0.000054607386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009082058,0.000056518173,0.00006524208,0.000022656319,0.00006359657,0.0000864279,0.00032880067,0.000027256016,0.00017710682],"category_scores_gemma":[0.0000015034442,0.00004762222,0.00003969029,0.00013357755,0.000012894899,0.00041991787,0.0000129818645,0.000048541406,0.00039406883],"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.0000046701657,0.00015886624,0.00006604678,0.000009145346,0.000025294126,0.0000070270335,0.00040183106,0.0018429918,0.0014327267,0.57815224,0.03515403,0.38274515],"study_design_scores_gemma":[0.00066409004,0.000027632499,0.0025002495,0.0000091865495,0.000002182381,0.000070641465,0.000031050557,0.16983107,0.004212701,0.001604059,0.82077277,0.0002743712],"about_ca_topic_score_codex":0.000015774784,"about_ca_topic_score_gemma":0.000021276917,"teacher_disagreement_score":0.9643236,"about_ca_system_score_codex":0.00002503376,"about_ca_system_score_gemma":0.00003167287,"threshold_uncertainty_score":0.5065089},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030970344,0.0002791619,0.99461496,0.0012317812,0.0002458004,0.00089838926,0.00002959607,0.00019926942,0.0021913403],"genre_scores_gemma":[0.9233111,0.000022760472,0.07246535,0.00043343677,0.000059308077,0.0010084503,0.000025846306,0.000012546823,0.0026612002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989465,0.00003886033,0.00020136804,0.00030245967,0.00019354005,0.00031726956],"domain_scores_gemma":[0.99905586,0.00015089121,0.00005815107,0.0006304925,0.000031688327,0.00007289457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032903752,0.00012014401,0.00011863467,0.000011747068,0.00019779016,0.00018955511,0.0005572056,0.00004517943,0.000033474458],"category_scores_gemma":[0.000048680555,0.00007098354,0.000091890885,0.00015997047,0.000036705776,0.00013870523,0.000052248735,0.000061176754,0.00006253607],"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.000009954024,0.0004967572,0.0006870388,0.000027341897,0.00008756016,0.000008000672,0.00020950935,0.0005917861,0.00015863775,0.68678224,0.08686779,0.2240734],"study_design_scores_gemma":[0.00033340658,0.000071646165,0.00104112,0.0000053303047,0.0000056276463,0.000011576473,0.000030946157,0.030009206,0.00037419106,0.00085721695,0.96712625,0.00013346861],"about_ca_topic_score_codex":0.000010282926,"about_ca_topic_score_gemma":0.0000035716564,"teacher_disagreement_score":0.9230014,"about_ca_system_score_codex":0.000036712034,"about_ca_system_score_gemma":0.000027748078,"threshold_uncertainty_score":0.28946248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09737463,0.008035847,0.8420578,0.0035930765,0.009193246,0.0012466954,0.000077581884,0.001400869,0.037020225],"genre_scores_gemma":[0.9731738,0.00015025967,0.021270564,0.0017163276,0.0004982065,0.000036196143,0.000014476831,0.000028475648,0.0031117138],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979689,0.0001242357,0.00037772488,0.0005671378,0.00043733383,0.00052465673],"domain_scores_gemma":[0.99796486,0.00011702393,0.00014273789,0.0014858827,0.0000780445,0.00021146277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120243,0.00024080176,0.000293944,0.00007706319,0.0002259611,0.00026369918,0.0014891848,0.00013414446,0.00003480854],"category_scores_gemma":[0.00024432887,0.00021020013,0.00012342064,0.00041653856,0.000039758375,0.00081743055,0.00032226,0.0002056271,0.0006170844],"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.000026771551,0.0007195297,0.001963474,0.000093755676,0.00011377258,0.0006158747,0.0050203586,0.00032764624,0.017553508,0.19353941,0.15188658,0.6281393],"study_design_scores_gemma":[0.0016093854,0.00023823549,0.0028025538,0.00008923567,0.000012168314,0.00016989557,0.00024803134,0.009062391,0.008062806,0.0077450834,0.9690465,0.00091371423],"about_ca_topic_score_codex":0.00009551427,"about_ca_topic_score_gemma":0.000008965593,"teacher_disagreement_score":0.8757991,"about_ca_system_score_codex":0.00006634761,"about_ca_system_score_gemma":0.000109484354,"threshold_uncertainty_score":0.85717124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005491285,0.000022604827,0.9438709,0.0027136693,0.000097461416,0.0006622679,0.0000027827296,0.0002795569,0.046859477],"genre_scores_gemma":[0.89454585,7.169331e-7,0.10269113,0.0018756259,0.000029555153,0.00014702095,0.000023569386,0.000005013295,0.0006815352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981993,0.000044416083,0.00039584766,0.0005982747,0.00033542328,0.00042675724],"domain_scores_gemma":[0.9989164,0.000015426622,0.00007152968,0.0007325311,0.00008884455,0.00017529473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031181463,0.00017210345,0.00023583161,0.000105897736,0.00005801727,0.0002277472,0.0009811681,0.000078680845,0.0000051028705],"category_scores_gemma":[0.000013523235,0.00014990807,0.00006232916,0.0010098777,0.000018358553,0.0002898926,0.000028311708,0.00012061833,0.00012507927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057194546,0.0034569446,0.010930999,0.000063873355,0.000011491408,0.000042314186,0.0017127567,0.034229852,0.0006613424,0.5010657,0.01644465,0.4313229],"study_design_scores_gemma":[0.0009611091,0.0002164781,0.059388965,0.000041143376,0.0000014008309,0.000008631957,0.000073442316,0.8931251,0.000057827896,0.00047107687,0.04522626,0.00042856767],"about_ca_topic_score_codex":0.000042775457,"about_ca_topic_score_gemma":0.000017426823,"teacher_disagreement_score":0.88905454,"about_ca_system_score_codex":0.000057574875,"about_ca_system_score_gemma":0.000107219144,"threshold_uncertainty_score":0.6113074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054630795,0.000005768374,0.81320685,0.000103343744,0.00004032637,0.17883052,0.00005282628,0.00010219121,0.0021950859],"genre_scores_gemma":[0.7921684,0.0000010544437,0.0041514006,0.000012680677,0.000019507483,0.2035316,0.000044225842,0.000006996433,0.00006417275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826723,0.00010773982,0.0006153923,0.0004379434,0.00032967047,0.00024204739],"domain_scores_gemma":[0.998903,0.000013720378,0.0002700358,0.00063950877,0.00010288742,0.00007088691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003882229,0.00015728973,0.00022057965,0.00013348374,0.0001015029,0.00018865413,0.00038042746,0.000070148635,0.000005118121],"category_scores_gemma":[0.0000045033466,0.00014572074,0.000026635838,0.0003664891,0.000029032057,0.0009900217,0.00006108757,0.00008633199,0.000010473288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024934037,0.0032191286,0.002848176,0.0030397517,0.000057098176,0.000030488178,0.00157917,0.01892738,0.019321594,0.82562107,0.0009247337,0.124182075],"study_design_scores_gemma":[0.0025943401,0.00044583486,0.079516806,0.0008134951,0.0000044008953,0.00001451672,0.00020253586,0.9066068,0.0027086902,0.000336272,0.0063815643,0.00037473103],"about_ca_topic_score_codex":0.000029439108,"about_ca_topic_score_gemma":0.000002593745,"teacher_disagreement_score":0.88767946,"about_ca_system_score_codex":0.00010474136,"about_ca_system_score_gemma":0.0000071342365,"threshold_uncertainty_score":0.5942319},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011742372,0.00005033135,0.96994513,0.00019950724,0.0003828753,0.00015525622,0.00002451403,0.00014833295,0.027919827],"genre_scores_gemma":[0.9143897,6.3012925e-7,0.08219098,0.0003391376,0.00007648848,0.000061209845,0.000003845707,0.000005497761,0.0029325045],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936235,0.000012364808,0.00012495197,0.00021578967,0.000117398864,0.00016715085],"domain_scores_gemma":[0.9995977,0.000026488884,0.000027115546,0.00023525798,0.000053409927,0.000060002276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096024196,0.00007753058,0.00009198705,0.000031373213,0.000077379984,0.00003616809,0.0004101541,0.000034011413,0.00012243357],"category_scores_gemma":[0.0000054036955,0.00006065001,0.00008142831,0.00007959662,0.000017663855,0.00010204138,0.000014396631,0.00004657094,0.000027561382],"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.00009665433,0.0003620554,0.0002956116,0.00014033649,0.0001405975,0.000023421277,0.0060260016,0.00056340796,0.0014704164,0.45961455,0.040857885,0.49040905],"study_design_scores_gemma":[0.0052040434,0.00089850865,0.03685081,0.00013914687,0.000041642328,0.0003492124,0.00052241894,0.17832118,0.08404906,0.09603627,0.595346,0.0022417454],"about_ca_topic_score_codex":0.00004327105,"about_ca_topic_score_gemma":0.000018980214,"teacher_disagreement_score":0.91321546,"about_ca_system_score_codex":0.000008223989,"about_ca_system_score_gemma":0.000028789245,"threshold_uncertainty_score":0.24732357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55126727,0.0000734403,0.44790122,0.00007020437,0.0000962083,0.00024779508,0.000010624497,0.00002859474,0.00030467563],"genre_scores_gemma":[0.9794292,0.000086623346,0.02003749,0.000043600212,0.00009998427,0.00014565846,0.000107826694,0.00000885778,0.000040780524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00005945844,0.0005667151,0.0003985177,0.0008082343,0.000325967],"domain_scores_gemma":[0.9985622,0.000043757864,0.00032815052,0.00052804913,0.00047640095,0.00006141867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844151,0.00018153392,0.00035023617,0.00044761834,0.000120349905,0.00006615192,0.00046886696,0.000054318498,0.000019572084],"category_scores_gemma":[0.000011870293,0.00016154343,0.00006905015,0.002560891,0.00004682614,0.001396901,0.00005047715,0.00015804968,0.00000886024],"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.0000102446775,0.00011135317,0.010220831,0.000008983923,0.000063540305,2.6498458e-7,0.00030060223,0.629659,0.000049269893,0.00008912891,0.000023943665,0.35946283],"study_design_scores_gemma":[0.0008254567,0.00008134266,0.19588317,0.000076943914,0.000106955486,0.0000049807677,0.000022331957,0.80241066,0.0002555217,7.5064946e-7,0.00016586563,0.00016600864],"about_ca_topic_score_codex":0.00005780704,"about_ca_topic_score_gemma":0.00017243,"teacher_disagreement_score":0.42816192,"about_ca_system_score_codex":0.00017312485,"about_ca_system_score_gemma":0.00016349145,"threshold_uncertainty_score":0.658755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009389969,0.00007171144,0.9655605,0.0002632145,0.00029081636,0.00020181412,0.000011576443,0.00037170356,0.023838716],"genre_scores_gemma":[0.74378353,6.838328e-7,0.2542503,0.0005201777,0.00005119585,0.000015433665,0.000010344177,0.000008791489,0.0013595301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844795,0.000017464508,0.00029941258,0.00045469764,0.0003620128,0.0004184871],"domain_scores_gemma":[0.99923575,0.000052560412,0.00004513681,0.00037834875,0.00009205615,0.00019615561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005429303,0.00014710876,0.00016577482,0.000117391384,0.00015677558,0.0001207503,0.0006201596,0.00007131563,0.000013824876],"category_scores_gemma":[0.000014768756,0.00013557078,0.00008233138,0.00058993045,0.00001937467,0.00035538548,0.00005737842,0.00013547309,0.00010282964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110443216,0.0017302143,0.0022028445,0.00039332148,0.0001677765,0.00025816233,0.0038315328,0.019618943,0.012131603,0.18773885,0.014229389,0.7575869],"study_design_scores_gemma":[0.003352669,0.0005170546,0.054345947,0.000285638,0.000028655108,0.0010236053,0.0026452858,0.874827,0.0052215434,0.0017151498,0.053025443,0.0030119568],"about_ca_topic_score_codex":0.00006187407,"about_ca_topic_score_gemma":0.000026239743,"teacher_disagreement_score":0.8552081,"about_ca_system_score_codex":0.000073386866,"about_ca_system_score_gemma":0.000046469057,"threshold_uncertainty_score":0.5528416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07433756,0.00048417697,0.9179622,0.00088292017,0.00018034091,0.00011154317,0.000014037901,0.0005546786,0.005472554],"genre_scores_gemma":[0.97911406,0.000033348708,0.02047321,0.00010524449,0.0000096728545,0.0000060672555,0.0000037408156,0.0000049782525,0.00024968042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990995,0.0000278177,0.000181274,0.0003038035,0.00014696614,0.00024066541],"domain_scores_gemma":[0.99945724,0.000041070398,0.000044704968,0.0003326514,0.00003191395,0.00009243886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012959194,0.00010920174,0.00013242717,0.000030393956,0.0001333214,0.0002447196,0.000324067,0.000041326835,0.000028340359],"category_scores_gemma":[0.000008540302,0.00009333343,0.00002940335,0.00023630293,0.000015829322,0.0004374529,0.00013637148,0.00008101048,0.000058867998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006015281,0.0013270361,0.01069856,0.00045363212,0.0002135881,0.0002849115,0.0125049455,0.001251423,0.0041858614,0.72695696,0.018362518,0.22375457],"study_design_scores_gemma":[0.00032225167,0.000027933287,0.0046727587,0.000027273341,0.0000036348729,0.00007436711,0.00010209542,0.9737658,0.00004364566,0.0017538191,0.018948125,0.00025833317],"about_ca_topic_score_codex":0.000024548379,"about_ca_topic_score_gemma":0.000011410806,"teacher_disagreement_score":0.97251433,"about_ca_system_score_codex":0.00003408069,"about_ca_system_score_gemma":0.0000047951808,"threshold_uncertainty_score":0.3806027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00878119,0.00004380824,0.9487724,0.0006202707,0.0005036643,0.00011603659,0.000033825167,0.0002157622,0.04091306],"genre_scores_gemma":[0.9917873,0.0000030674369,0.0054219994,0.00016741939,0.000023451847,0.000015825697,0.00001491656,0.0000036233007,0.0025623804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991171,0.000075851654,0.00013612164,0.00024414543,0.00021435079,0.00021244616],"domain_scores_gemma":[0.9993513,0.00003478496,0.000009299079,0.00042466316,0.000095913725,0.00008401714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018650298,0.00008666956,0.00009812975,0.000029853703,0.00018259561,0.00024992586,0.00032675476,0.00003323928,0.000055524662],"category_scores_gemma":[0.000058228787,0.00006787236,0.000033651617,0.00040625356,0.000020852665,0.00023939098,0.000030089182,0.00007776985,0.00021906126],"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":[6.999741e-7,0.000053560743,0.00038735376,0.0000022926495,0.0000058041146,0.0000048760257,0.000086027016,0.0010994221,0.00023468494,0.9912076,0.0058936095,0.001024085],"study_design_scores_gemma":[0.0010305083,0.00026491063,0.007849326,0.000052520845,0.000004627048,0.0000417978,0.00021854919,0.08459337,0.05937403,0.0017631981,0.84401834,0.00078878825],"about_ca_topic_score_codex":0.000047942438,"about_ca_topic_score_gemma":0.000013497176,"teacher_disagreement_score":0.9894444,"about_ca_system_score_codex":0.000032536278,"about_ca_system_score_gemma":0.00005917453,"threshold_uncertainty_score":0.28156623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077308943,0.00013403427,0.9763481,0.0120301265,0.00010694258,0.00051314814,0.0016275207,0.0001010745,0.0014081567],"genre_scores_gemma":[0.96577716,0.000008866683,0.032511782,0.00088619185,0.00009164767,0.00008060037,0.00015385644,0.000008256742,0.0004816283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983763,0.00006228754,0.00048162125,0.0002995587,0.00049896404,0.00028126998],"domain_scores_gemma":[0.9986849,0.00009125533,0.00009608418,0.0008650145,0.00015345789,0.00010933217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034826115,0.00017503329,0.00020465543,0.000026317994,0.00029986986,0.00013873236,0.0015906215,0.00006753663,0.000030180468],"category_scores_gemma":[0.000018471696,0.00009437173,0.00012271761,0.00037079002,0.00003653337,0.00052451936,0.00022669684,0.00015240908,0.000057845227],"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.000008121579,0.00010362149,0.0000036556498,0.0000038970124,0.000021884925,3.3853402e-7,0.007374289,0.918904,0.00049387716,0.004822914,0.033772122,0.034491252],"study_design_scores_gemma":[0.00032807814,0.000015686846,0.0001342357,0.000023191422,0.000009558039,0.0000017408734,0.00021451178,0.9934532,0.00080207986,0.0005539755,0.0043262737,0.0001374498],"about_ca_topic_score_codex":0.0003284918,"about_ca_topic_score_gemma":0.00042490743,"teacher_disagreement_score":0.95804626,"about_ca_system_score_codex":0.000066203305,"about_ca_system_score_gemma":0.00010284459,"threshold_uncertainty_score":0.38483676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036109106,0.00012641534,0.9867376,0.0019211157,0.000689339,0.00064373115,0.00042728946,0.00023215704,0.005611458],"genre_scores_gemma":[0.9561541,0.0000012379971,0.0361274,0.0019946035,0.00021523332,0.0001977722,0.00033610882,0.000017022434,0.0049565337],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787027,0.0000699305,0.0005284241,0.0006065409,0.0003603708,0.000564452],"domain_scores_gemma":[0.99816394,0.00035306992,0.0001783961,0.0008408334,0.00030677632,0.00015697168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033760263,0.00027321873,0.00038635675,0.00007390973,0.00020530912,0.0005595449,0.00079757214,0.000119126234,0.00019004091],"category_scores_gemma":[0.00008628457,0.00023034628,0.00020912237,0.00031671938,0.000060519495,0.0005840053,0.000047227015,0.0001140956,0.00005063936],"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.00006750424,0.00051696325,0.0040612984,0.00013196489,0.000049074486,0.000013764412,0.00010526926,0.0014303237,0.0027901318,0.32631662,0.66066176,0.00385533],"study_design_scores_gemma":[0.0031505988,0.000048911515,0.0017452372,0.000042146752,0.000015722575,0.000009306565,0.000005165901,0.09781618,0.00030831524,0.00086954975,0.8955363,0.00045257105],"about_ca_topic_score_codex":0.0011647244,"about_ca_topic_score_gemma":0.0010116796,"teacher_disagreement_score":0.9525432,"about_ca_system_score_codex":0.000055451583,"about_ca_system_score_gemma":0.00015574529,"threshold_uncertainty_score":0.93932486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43565726,0.00047500787,0.5560225,0.00014235405,0.00007784929,0.00036712992,0.00006428979,0.00039204207,0.0068015307],"genre_scores_gemma":[0.95810664,0.0000029473183,0.03859618,0.0003234766,0.000029497116,0.000018461671,0.00002965416,0.000018187206,0.0028749388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974836,0.00031687037,0.0005908552,0.00062705245,0.000632016,0.00034962076],"domain_scores_gemma":[0.997848,0.00011257791,0.00029516366,0.0012522184,0.00036205404,0.00013004131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008489748,0.00023553192,0.000707289,0.00033468433,0.00011190382,0.00015338277,0.0006493122,0.00009925853,0.0000285196],"category_scores_gemma":[0.000011226784,0.00017612378,0.00019137793,0.0038819972,0.000036322883,0.00049109774,0.000139424,0.00010552577,0.000046123096],"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.00055044406,0.0010849979,0.0051981374,0.00066979026,0.003056281,0.00016958248,0.006189884,0.9555859,0.018652655,0.00305934,0.0048233815,0.000959606],"study_design_scores_gemma":[0.00035999017,0.000066178596,0.002236897,0.00007490605,0.00018060871,0.00005193521,0.000085208325,0.9947733,0.00004401153,5.678166e-7,0.001872806,0.0002535704],"about_ca_topic_score_codex":0.00049008307,"about_ca_topic_score_gemma":0.000011205655,"teacher_disagreement_score":0.5224494,"about_ca_system_score_codex":0.00010059944,"about_ca_system_score_gemma":0.000047569436,"threshold_uncertainty_score":0.71821195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056578346,0.00036366645,0.9407136,0.00017161597,0.00034118365,0.0002401961,0.00003022337,0.00008295281,0.0014782576],"genre_scores_gemma":[0.9756901,0.00005897908,0.023473158,0.000024669496,0.00004921735,0.000040538773,0.0000049909654,0.0000044732587,0.0006538706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991801,0.000014631456,0.00027146764,0.00018564734,0.00015738422,0.00019077724],"domain_scores_gemma":[0.9993956,0.000034966633,0.00009031315,0.00034172114,0.000090994225,0.000046379024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017227125,0.00008648503,0.00016179986,0.000050004615,0.000080731195,0.00005956379,0.0003487382,0.00003634043,0.0000073693946],"category_scores_gemma":[0.000006882524,0.000072784096,0.000050910978,0.00018839941,0.000018700619,0.000637213,0.000015736592,0.000040904128,0.000013750743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011845661,0.0012046446,0.006156756,0.0049385303,0.00026217496,0.000007337878,0.004413217,0.32881045,0.032983083,0.5238133,0.019253263,0.07803877],"study_design_scores_gemma":[0.000354372,0.000066993234,0.00013823593,0.0000679463,0.0000032949572,0.000009025026,0.000060619885,0.9938863,0.0008820139,0.0000057790876,0.00442761,0.000097829296],"about_ca_topic_score_codex":0.00007585827,"about_ca_topic_score_gemma":0.0000029626858,"teacher_disagreement_score":0.9191117,"about_ca_system_score_codex":0.000014203422,"about_ca_system_score_gemma":0.000008844558,"threshold_uncertainty_score":0.29680493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41771787,0.00016017078,0.5699057,0.0014049745,0.0019317245,0.0025636286,0.00034600077,0.0052645835,0.00070533686],"genre_scores_gemma":[0.95646447,0.000016900512,0.0415519,0.00027767985,0.0005165211,0.0005172275,0.000037242724,0.00009254342,0.0005255431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522984,0.0000035290502,0.0009692575,0.0015364776,0.00076213176,0.0014987598],"domain_scores_gemma":[0.9954666,0.00007610384,0.00046461285,0.00031902944,0.002874162,0.0007995255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005064437,0.0008883725,0.00095485494,0.00033088925,0.0005013777,0.001011536,0.0024366179,0.00044241114,0.000040122595],"category_scores_gemma":[0.00033733924,0.0009382448,0.00024041082,0.0012453625,0.00010979608,0.0033711984,0.00013912105,0.0006136844,0.000046458812],"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.00045776024,0.001717584,0.10552139,0.0071003507,0.00095537346,0.000114475915,0.025027888,0.00072136824,0.10135838,0.6348924,0.10703457,0.015098477],"study_design_scores_gemma":[0.01880373,0.0038452563,0.11759625,0.0029715083,0.00042840416,0.0026526046,0.0028020965,0.5858074,0.02619051,0.0039215763,0.22381021,0.011170479],"about_ca_topic_score_codex":0.00004182694,"about_ca_topic_score_gemma":0.0000011423137,"teacher_disagreement_score":0.6309708,"about_ca_system_score_codex":0.00017181884,"about_ca_system_score_gemma":0.00020138586,"threshold_uncertainty_score":0.9993068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026364435,0.0010533071,0.9631959,0.005579807,0.00013373049,0.0027881437,0.00012278573,0.00010678739,0.0006551045],"genre_scores_gemma":[0.997815,0.000010834344,0.0003571687,0.00008617352,0.000044069428,0.0016426372,0.000009584355,0.000007273639,0.000027231981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850416,0.00009429281,0.00032552122,0.00055147184,0.00024417962,0.00028037265],"domain_scores_gemma":[0.9990284,0.00008164113,0.00013987221,0.00046713115,0.00018310624,0.00009987238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902085,0.00017488848,0.00030741683,0.00005087783,0.000081919534,0.00016844302,0.00043105657,0.00009665349,5.260794e-7],"category_scores_gemma":[0.00013909535,0.00015082612,0.000049879993,0.00016314996,0.000028015358,0.00025521565,0.000033006156,0.00010914284,0.00000768227],"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.000068386114,0.000193881,0.0026382909,0.00027296503,0.00003629887,0.000011836152,0.00090909965,0.0032037913,0.00107527,0.9349377,0.000049495357,0.05660295],"study_design_scores_gemma":[0.029571915,0.002195654,0.1423289,0.0045327446,0.00011177112,0.000076992634,0.0015112169,0.7322844,0.0048287115,0.06063438,0.01884343,0.0030798272],"about_ca_topic_score_codex":0.0001581389,"about_ca_topic_score_gemma":0.00021328822,"teacher_disagreement_score":0.97145057,"about_ca_system_score_codex":0.00009332406,"about_ca_system_score_gemma":0.000090472735,"threshold_uncertainty_score":0.6150511},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012796928,0.00092240906,0.9956711,0.0011833276,0.0006374148,0.00060065615,0.000019245876,0.00012763838,0.00071027357],"genre_scores_gemma":[0.48340753,0.0002520305,0.5110157,0.0026051258,0.0019142787,0.000093565905,0.00006321945,0.00006048378,0.0005880779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972201,0.000015245267,0.0005081157,0.0012565007,0.0004876033,0.0005124612],"domain_scores_gemma":[0.9983897,0.00024052453,0.00030146595,0.00062075164,0.00031030766,0.00013725388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068575214,0.00040072942,0.00046618975,0.00028687948,0.00029600208,0.0007201648,0.0011702871,0.0002423622,0.000001600632],"category_scores_gemma":[0.000116128096,0.00036008318,0.00007714176,0.00035617364,0.0002892999,0.000713531,0.00022201183,0.0003054703,0.000004902601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010535434,0.00002891622,0.000059305625,0.00023086106,0.00000866731,0.000016382288,0.00096192135,0.0045369007,0.000241378,0.024901627,0.00006104814,0.96894246],"study_design_scores_gemma":[0.0008292421,0.00062968297,0.0003796014,0.0014603254,0.000015996873,0.0001487574,4.7534286e-7,0.81680197,0.0048940675,0.12745489,0.045991216,0.0013937935],"about_ca_topic_score_codex":0.000013001327,"about_ca_topic_score_gemma":0.00008818033,"teacher_disagreement_score":0.96754867,"about_ca_system_score_codex":0.000119412325,"about_ca_system_score_gemma":0.0004048817,"threshold_uncertainty_score":0.99988514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019776605,0.00027076603,0.8865312,0.00071980467,0.0019893555,0.000319777,0.000016407821,0.0004726264,0.10770241],"genre_scores_gemma":[0.972455,0.00000952052,0.025094101,0.00019161157,0.00011515819,0.00006301645,0.00003920926,0.000013368562,0.0020189825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982939,0.000086718734,0.00039916343,0.0006538453,0.00028440854,0.00028197645],"domain_scores_gemma":[0.99807054,0.000041016305,0.00022945648,0.0013501513,0.00021330823,0.0000955301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042632458,0.0002481085,0.00033403977,0.0000913927,0.00009695144,0.00034678009,0.0017621814,0.00025578015,0.00006109631],"category_scores_gemma":[0.00002742997,0.00022590278,0.0001373822,0.0001789319,0.00003217887,0.00028054035,0.0015445139,0.00042103315,0.00016606998],"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.0000036577264,0.00017876185,0.0011789162,0.00028296304,0.00007100235,0.000024414807,0.0014306287,0.00027761742,0.00016055393,0.8951739,0.05727394,0.043943666],"study_design_scores_gemma":[0.0015695442,0.00018808697,0.013135147,0.001190449,0.000059141985,0.00006894676,0.00030165524,0.38011262,0.004094584,0.31183627,0.2836761,0.0037674725],"about_ca_topic_score_codex":0.00037401222,"about_ca_topic_score_gemma":0.000036792244,"teacher_disagreement_score":0.97047734,"about_ca_system_score_codex":0.00007715744,"about_ca_system_score_gemma":0.00010285931,"threshold_uncertainty_score":0.9212048},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005577099,0.00010760085,0.89204687,0.025648242,0.00021204466,0.00025453066,0.000010658763,0.00017057308,0.080991775],"genre_scores_gemma":[0.97728455,0.0000037372147,0.013928691,0.002860625,0.00006853016,0.0000336661,0.0000010290129,0.0000039707215,0.0058152066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912775,0.00005395383,0.00014753186,0.00021466316,0.00017889448,0.00027723398],"domain_scores_gemma":[0.9992326,0.00004790028,0.000028926925,0.00051222544,0.00009444883,0.00008391376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019546588,0.00008282909,0.00008796097,0.000025764255,0.00030742068,0.00015700534,0.00059656735,0.000027208303,0.000040596922],"category_scores_gemma":[0.000011282813,0.000052151372,0.000043797732,0.00041791375,0.000021724894,0.00016971136,0.00018506417,0.00008448723,0.0014457034],"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":[6.5625045e-7,0.000058193473,0.000041660627,0.0000025841034,0.000014448333,0.000014268831,0.0016199349,0.00066065433,0.0000653893,0.32459438,0.6422924,0.030635422],"study_design_scores_gemma":[0.000180243,0.000061477556,0.0009811171,0.000021245156,0.000003258774,0.00008018921,0.0001274109,0.2596122,0.000087893626,0.0008316555,0.73780376,0.00020954802],"about_ca_topic_score_codex":0.000109741384,"about_ca_topic_score_gemma":0.00014918337,"teacher_disagreement_score":0.97672683,"about_ca_system_score_codex":0.000024033989,"about_ca_system_score_gemma":0.000008452529,"threshold_uncertainty_score":0.9993318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160455,0.00033814902,0.46739274,0.0028215144,0.00042995738,0.0003384301,0.000031153166,0.0002834197,0.012319112],"genre_scores_gemma":[0.9944074,0.00003162463,0.0041996916,0.00035508268,0.0002666602,0.0000050106123,0.000014374011,0.000008797551,0.000711353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998184,0.00014435363,0.00034868068,0.00047179364,0.00048116373,0.00037000692],"domain_scores_gemma":[0.9989091,0.00015054329,0.00011175197,0.00059934997,0.0000847586,0.00014450452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045068076,0.000199056,0.00026690785,0.00005020015,0.0011385733,0.00016250515,0.00077277364,0.000093065915,0.000025520416],"category_scores_gemma":[0.000027848551,0.00012961276,0.000068963054,0.00035102767,0.000329737,0.0004625741,0.00073801354,0.00020614889,0.00007885855],"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.00011110475,0.00063754164,0.06964634,0.00020560698,0.00018964085,0.0004506861,0.032915268,0.00018427304,0.013973756,0.48828757,0.153678,0.23972023],"study_design_scores_gemma":[0.0045957575,0.0007719183,0.44460613,0.00038401346,0.000051330513,0.0014490474,0.0009854402,0.25460717,0.006325019,0.020856416,0.26296133,0.0024064318],"about_ca_topic_score_codex":0.00025066425,"about_ca_topic_score_gemma":0.000033595912,"teacher_disagreement_score":0.47836187,"about_ca_system_score_codex":0.00004150931,"about_ca_system_score_gemma":0.00004942534,"threshold_uncertainty_score":0.87571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0532927,0.00087616296,0.94362223,0.000058525755,0.0008355311,0.00068437366,0.00015419036,0.00022350151,0.00025280606],"genre_scores_gemma":[0.94521695,0.000010033959,0.053588003,0.00051106076,0.00021517552,0.000050879156,0.00032828358,0.00002316482,0.000056415385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741024,0.00014472345,0.0006356009,0.0009405509,0.00033818567,0.0005306958],"domain_scores_gemma":[0.99733484,0.0002281793,0.00022222938,0.0018225152,0.00019808076,0.00019413322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003314777,0.00024964384,0.00039904128,0.000057113946,0.000416582,0.00014684701,0.0018274615,0.00015745284,0.0000075127027],"category_scores_gemma":[0.00003262953,0.00021313268,0.00017040838,0.00034500103,0.00009070147,0.0003505199,0.0005334577,0.00024536505,0.0000048598995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011691403,0.00053470745,0.017187288,0.00033161783,0.00017659944,0.00023461797,0.0022046973,0.35660857,0.000106535575,0.001566752,0.017840002,0.6030917],"study_design_scores_gemma":[0.0008367574,0.00014429007,0.00022836024,0.00010058527,0.000014366351,0.00002684329,0.00020576557,0.9658231,0.0000902978,0.000015635133,0.03218425,0.0003297217],"about_ca_topic_score_codex":0.000048318932,"about_ca_topic_score_gemma":0.000022419388,"teacher_disagreement_score":0.89192426,"about_ca_system_score_codex":0.000044070646,"about_ca_system_score_gemma":0.00019110194,"threshold_uncertainty_score":0.86912984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017909104,0.00046405077,0.99376744,0.0017515171,0.00035165044,0.0003020358,0.00001026038,0.000056080255,0.0015060478],"genre_scores_gemma":[0.9928704,0.000026611207,0.005085422,0.00037471578,0.00007177263,0.00008305602,0.0000022907861,0.00000418408,0.0014815398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.000012581556,0.00012594047,0.00017741344,0.000104660656,0.00013976809],"domain_scores_gemma":[0.99952805,0.00014438503,0.000026989725,0.0001954668,0.00006278876,0.000042315434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001661548,0.000067877954,0.00008477888,0.000011703471,0.00022301992,0.00016774915,0.00028183998,0.000018072547,0.00005367847],"category_scores_gemma":[0.0000046817427,0.000042439922,0.000038700844,0.00005725443,0.000027930426,0.0003680408,0.000023950166,0.00004549223,0.00002183713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003535311,0.00005928964,0.00008623132,0.00009771036,0.00007748202,0.0000027857245,0.0005730053,0.0016043897,0.001027055,0.08305453,0.01170148,0.9016807],"study_design_scores_gemma":[0.0009783215,0.000058259113,0.018200668,0.000035141962,0.000009804312,0.00008297931,0.00017925058,0.7846219,0.00151912,0.0025547186,0.19145375,0.00030610053],"about_ca_topic_score_codex":0.000089689136,"about_ca_topic_score_gemma":0.0000042599772,"teacher_disagreement_score":0.9910795,"about_ca_system_score_codex":0.000011278426,"about_ca_system_score_gemma":0.000021142549,"threshold_uncertainty_score":0.17306498},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021941117,0.000018371702,0.980539,0.0014384895,0.00012691914,0.01293906,0.000010793295,0.0001228494,0.0026104017],"genre_scores_gemma":[0.9417647,0.0000012476385,0.01894859,0.0002470713,0.000041095725,0.027292818,0.000013851537,0.000012359486,0.011678231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988976,0.000036460046,0.0002863222,0.00031943092,0.00020433615,0.00025580966],"domain_scores_gemma":[0.99940234,0.000046565245,0.00008009532,0.0003543876,0.00006902239,0.000047584683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003223901,0.000100883044,0.0001486693,0.0000656833,0.000056506975,0.00018832296,0.000576087,0.00005466298,0.000048892736],"category_scores_gemma":[0.000027488999,0.00008690437,0.00003853411,0.00030259378,0.000009019438,0.0005828458,0.00007309436,0.00005117717,0.00010417512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020313343,0.006128586,0.0074740355,0.0015065474,0.00015467567,0.0000998447,0.0075189522,0.08075708,0.040564805,0.20678413,0.16893432,0.4798739],"study_design_scores_gemma":[0.00073108333,0.00007351831,0.0009947268,0.00006425186,4.435119e-7,0.0000011128652,0.000005677745,0.9826267,0.0005005975,0.00039536244,0.014481235,0.00012530276],"about_ca_topic_score_codex":0.000031526208,"about_ca_topic_score_gemma":0.000017833074,"teacher_disagreement_score":0.9615904,"about_ca_system_score_codex":0.00008103495,"about_ca_system_score_gemma":0.000009777982,"threshold_uncertainty_score":0.35438573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00523771,0.000084083105,0.8784321,0.000085383675,0.00034624664,0.00008213918,0.000002838493,0.00005076388,0.11567875],"genre_scores_gemma":[0.9746743,0.000002328428,0.024505766,0.0000621633,0.00000906198,0.0000051817888,9.701025e-7,0.0000020279138,0.0007381974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992942,0.00004071619,0.00020821702,0.00016436068,0.00015808917,0.00013436587],"domain_scores_gemma":[0.999501,0.00001776306,0.000065014305,0.0002691437,0.000103316146,0.000043789263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019210171,0.000059274607,0.00012067878,0.000029687208,0.000033446086,0.00004155222,0.00022671798,0.0000353454,0.000049404727],"category_scores_gemma":[0.00003345018,0.000050409115,0.000050528728,0.00022792451,0.000022560915,0.00021180863,0.000026534359,0.000032158085,0.000041084062],"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.0000013292614,0.00005506419,0.00032068224,0.000019776537,0.0000094756615,0.0000060907805,0.00012321326,0.00006456355,0.0025355702,0.99229324,0.001405604,0.003165384],"study_design_scores_gemma":[0.0064734565,0.0008207201,0.009706725,0.00036295023,0.000053542743,0.0005890916,0.00077202346,0.09390522,0.36429647,0.06693891,0.45404154,0.0020393447],"about_ca_topic_score_codex":0.000063692234,"about_ca_topic_score_gemma":0.000007071868,"teacher_disagreement_score":0.9694366,"about_ca_system_score_codex":0.000015150537,"about_ca_system_score_gemma":0.00007642227,"threshold_uncertainty_score":0.20556241},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08495976,0.00032154325,0.90851307,0.00038702466,0.00016476755,0.0002071838,0.0000031719783,0.00023541738,0.0052080704],"genre_scores_gemma":[0.9686431,0.000014742701,0.030894795,0.000084764266,0.000095230214,0.000026507929,0.000006032115,0.0000079352685,0.00022685489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849916,0.000055125685,0.00036449157,0.00042700997,0.00022877708,0.00042546226],"domain_scores_gemma":[0.99939156,0.000022699176,0.000086161555,0.00035695022,0.000057401732,0.00008521258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030715976,0.00014208107,0.00020790298,0.00007319424,0.00029770043,0.00010071621,0.00034443103,0.000055262168,0.000020739402],"category_scores_gemma":[0.000013309189,0.00013401062,0.000040445728,0.0006422789,0.000042260348,0.0011250104,0.0000488894,0.00018426536,0.000018055942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006492118,0.0028994898,0.1341898,0.0029259252,0.00030284747,0.012344889,0.04084791,0.13877915,0.05256271,0.23726627,0.017461408,0.3597704],"study_design_scores_gemma":[0.0049194265,0.00013856635,0.062382348,0.0016120719,0.000014168613,0.0022210039,0.0012617841,0.91380906,0.0029477384,0.0009217007,0.008135536,0.0016366148],"about_ca_topic_score_codex":0.00012206753,"about_ca_topic_score_gemma":0.00020892863,"teacher_disagreement_score":0.8836834,"about_ca_system_score_codex":0.00006473185,"about_ca_system_score_gemma":0.00010577293,"threshold_uncertainty_score":0.5464795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03817899,0.00051335833,0.9516683,0.00047829328,0.0034639104,0.0007313204,0.000048066424,0.00050267176,0.004415087],"genre_scores_gemma":[0.9941447,0.000002349597,0.0050605014,0.00016988613,0.0004109005,0.00010265533,0.000022091284,0.000018181428,0.000068783025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997834,0.00007787768,0.00059327186,0.0006753197,0.00034235965,0.00047716635],"domain_scores_gemma":[0.9979681,0.00018019612,0.00020767462,0.0011356332,0.00020927931,0.0002991441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010742933,0.00025277102,0.0004976272,0.00010712606,0.00016288314,0.000048853653,0.0012302407,0.000093947376,0.000025410758],"category_scores_gemma":[0.00019613981,0.00019095083,0.00009239026,0.00040159654,0.00013927164,0.0005798355,0.0001230003,0.00015272618,0.000029827223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034162684,0.00184972,0.10021787,0.003222013,0.00041327532,0.00029566666,0.045632105,0.000058516853,0.009900766,0.39454865,0.010987811,0.43253195],"study_design_scores_gemma":[0.010608425,0.0074139675,0.07585439,0.003088676,0.00029143816,0.0005652123,0.0056900373,0.8547099,0.0054196003,0.01029549,0.02349378,0.0025690459],"about_ca_topic_score_codex":0.00018884956,"about_ca_topic_score_gemma":0.000028396544,"teacher_disagreement_score":0.95596564,"about_ca_system_score_codex":0.00011565023,"about_ca_system_score_gemma":0.000025264071,"threshold_uncertainty_score":0.77867484},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084533746,0.00037808518,0.39888725,0.00047617254,0.0003191499,0.00008277126,9.953121e-7,0.00028949944,0.5987207],"genre_scores_gemma":[0.9266913,0.000038344417,0.022931887,0.0004999512,0.000051042836,0.00002027096,7.67504e-7,0.000004915689,0.049761515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992837,0.000013373738,0.00011945494,0.00022985096,0.00017507329,0.00017855802],"domain_scores_gemma":[0.999449,0.000008697561,0.000024354778,0.00043823756,0.00001988012,0.00005980019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007801944,0.00007305265,0.00008035541,0.00003423431,0.000055492685,0.00009363929,0.00047629882,0.000021211072,0.00025486553],"category_scores_gemma":[0.000001978298,0.000061121,0.000037305428,0.0002248072,0.000011327885,0.00021513666,0.000109934066,0.000037944614,0.0010491104],"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":[3.9841012e-7,0.00009699364,0.00022299803,0.000025074012,0.000024390982,0.000059294554,0.00012002424,0.000017497252,0.000091059235,0.6484763,0.17643915,0.17442684],"study_design_scores_gemma":[0.00030986642,0.00001789543,0.0022275904,0.000026470083,0.0000025395082,0.000012638021,0.000021163823,0.073202595,0.0004875862,0.000593587,0.9228629,0.00023519009],"about_ca_topic_score_codex":0.0000069930225,"about_ca_topic_score_gemma":0.0000012729164,"teacher_disagreement_score":0.925846,"about_ca_system_score_codex":0.000017632783,"about_ca_system_score_gemma":0.0000014100418,"threshold_uncertainty_score":0.9997287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011212055,0.0002181434,0.9278417,0.002050768,0.0010724541,0.00058662053,0.00004562285,0.00016015588,0.056812473],"genre_scores_gemma":[0.90913016,0.000016184436,0.03798316,0.0009885229,0.00006359346,0.0001050008,0.000008433396,0.000014334496,0.051690627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988406,0.000038820664,0.00024908263,0.00035013785,0.00016136125,0.00036002623],"domain_scores_gemma":[0.99896336,0.00016182265,0.00007014211,0.0006196051,0.00011069504,0.000074363634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004614039,0.00013129962,0.00015636106,0.000017868912,0.00025633676,0.00014817105,0.00048018876,0.0000668671,0.00010837454],"category_scores_gemma":[0.000086075896,0.00008152844,0.00010791652,0.0002124238,0.00005524765,0.00025901417,0.000071099275,0.00006778898,0.0002117745],"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.000042165706,0.00020929874,0.0018130403,0.00006730707,0.000097578486,0.000035311306,0.00039892257,0.0018315202,0.002749627,0.7739439,0.20446582,0.014345521],"study_design_scores_gemma":[0.0014301355,0.00012534801,0.00047665095,0.000041669253,0.000010872868,0.0001241291,0.00008411683,0.04712949,0.007349792,0.0046570217,0.93814963,0.00042112527],"about_ca_topic_score_codex":0.000037607642,"about_ca_topic_score_gemma":0.00004029685,"teacher_disagreement_score":0.8979181,"about_ca_system_score_codex":0.000046264355,"about_ca_system_score_gemma":0.000064267486,"threshold_uncertainty_score":0.33246332},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733037,0.000092504466,0.017377103,0.0007720805,0.0001910945,0.0006034097,0.000013014649,0.00016019904,0.0074869236],"genre_scores_gemma":[0.99622124,4.5511013e-7,0.0030543907,0.00010236035,0.00006255201,0.000019853613,0.0000010227108,0.0000039628553,0.000534149],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982209,0.0001697701,0.00040149008,0.00065719726,0.00030913088,0.00024146316],"domain_scores_gemma":[0.9988538,0.00004337094,0.000061062674,0.0008346661,0.000073447314,0.00013366928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104324,0.00014751175,0.00021342417,0.000026091906,0.00010899791,0.0002460821,0.0004574372,0.000046896064,0.000010937076],"category_scores_gemma":[0.00004149385,0.000116348885,0.000044079497,0.00016914641,0.00004972327,0.00064427155,0.00034013565,0.00009075801,0.000027595073],"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.0009086116,0.016078841,0.67883855,0.00007004128,0.00015862884,0.000048615813,0.05532749,0.00014728187,0.0015648169,0.013084912,0.011650532,0.22212169],"study_design_scores_gemma":[0.0035055487,0.0005236658,0.9779518,0.000007604851,0.0000031126779,0.000010112463,0.0007085109,0.011404575,0.0013816764,0.000092280745,0.0040650787,0.0003459827],"about_ca_topic_score_codex":0.00072635093,"about_ca_topic_score_gemma":0.0002025027,"teacher_disagreement_score":0.2991133,"about_ca_system_score_codex":0.0000745933,"about_ca_system_score_gemma":0.000029667079,"threshold_uncertainty_score":0.474457},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7719695,0.0002736824,0.21795341,0.0001916452,0.00026642665,0.00023473505,0.000021237023,0.00014135978,0.008948],"genre_scores_gemma":[0.98763627,0.00021960976,0.010858606,0.000016313552,0.000029476285,0.000015747179,0.000004846223,0.0000053310296,0.0012137985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988281,0.000045419256,0.00040115835,0.0002454168,0.00023677714,0.00024309462],"domain_scores_gemma":[0.9993115,0.000028509574,0.00010336212,0.00044518226,0.00005541908,0.000056010158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027227472,0.00011271136,0.00023411521,0.000109671186,0.000047771355,0.000065505454,0.00041449844,0.00005098017,0.000028350443],"category_scores_gemma":[0.0000061493997,0.00009945217,0.000039041206,0.00041932386,0.000024988962,0.0007718351,0.00002632683,0.00008205632,0.0000888297],"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.00014292158,0.0019268199,0.05047706,0.0030893863,0.00018278397,0.000094620846,0.011148292,0.56758064,0.19770408,0.11369006,0.009701326,0.044262026],"study_design_scores_gemma":[0.00033199872,0.00004332084,0.0039158557,0.00015997123,0.000001863767,0.000013861887,0.000054054053,0.9942986,0.0005422147,0.0000025639588,0.0005088244,0.00012688777],"about_ca_topic_score_codex":0.0009808744,"about_ca_topic_score_gemma":0.000012669498,"teacher_disagreement_score":0.42671797,"about_ca_system_score_codex":0.000033520406,"about_ca_system_score_gemma":0.000013703265,"threshold_uncertainty_score":0.40555418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033218574,0.0029979711,0.99067944,0.000457647,0.0018337524,0.0010896518,0.00006383642,0.0001783063,0.002666171],"genre_scores_gemma":[0.32134193,0.0020657417,0.6630203,0.0032782499,0.0015868364,0.0002793159,0.00029610711,0.0002464004,0.007885123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952875,0.000028557648,0.0008417545,0.0019831872,0.0009877984,0.00087122497],"domain_scores_gemma":[0.99755913,0.00022231035,0.00042806973,0.0011240282,0.0004232706,0.00024321783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009090442,0.0006216849,0.00072312646,0.00043424527,0.0006122489,0.00052434846,0.0020073336,0.00045924954,0.0000092797245],"category_scores_gemma":[0.00004378079,0.0005682357,0.00013130918,0.00068232813,0.000923072,0.00077388063,0.00079287303,0.0005959111,0.00001618394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010956667,0.00007751586,0.000024961477,0.00021182669,0.00003307567,0.000117971285,0.0020749292,0.0397787,0.00020385177,0.015883313,0.00091750495,0.9406654],"study_design_scores_gemma":[0.0009329442,0.00041591638,0.00006430937,0.00085341145,0.000009055478,0.000332387,4.4677319e-7,0.9010259,0.00023690886,0.024660848,0.07057597,0.0008919065],"about_ca_topic_score_codex":0.00007086776,"about_ca_topic_score_gemma":0.00004205543,"teacher_disagreement_score":0.9397735,"about_ca_system_score_codex":0.00030188466,"about_ca_system_score_gemma":0.0005070607,"threshold_uncertainty_score":0.9996769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076154916,0.00019124543,0.99582285,0.0016755923,0.0002874239,0.00017055678,0.00026486852,0.0001998112,0.0006261056],"genre_scores_gemma":[0.8444834,0.00008149476,0.153372,0.0003926125,0.00029329836,0.00049769634,0.00057772885,0.000022997488,0.00027879947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909574,0.000007043999,0.00021856853,0.00033223937,0.00018947407,0.00015690965],"domain_scores_gemma":[0.99928606,0.000031497548,0.000047521018,0.00043068302,0.00010761309,0.00009664843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120861376,0.00013139597,0.00010605581,0.0000922073,0.000090252885,0.00017743818,0.0005402701,0.000035716428,0.0000052909127],"category_scores_gemma":[0.000009885985,0.0001310041,0.000036906215,0.00019411137,0.000023492546,0.00035198228,0.00012189608,0.00011225851,0.000041335294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061414776,0.00055693754,0.00018894431,0.0001599599,0.00015254627,0.000044506563,0.00017781837,0.16195181,0.037130613,0.764259,0.001074131,0.034297626],"study_design_scores_gemma":[0.0010692604,0.000033085926,0.00021096901,0.0001972374,0.000011424124,0.000098065415,0.000018965215,0.71170074,0.00725561,0.00036727916,0.2786215,0.00041586638],"about_ca_topic_score_codex":0.00014285023,"about_ca_topic_score_gemma":0.0000045314173,"teacher_disagreement_score":0.8437218,"about_ca_system_score_codex":0.00007113103,"about_ca_system_score_gemma":0.000053121537,"threshold_uncertainty_score":0.5342192},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017490127,0.000035937617,0.9817858,0.0008404499,0.00031170435,0.00021399584,0.000004754678,0.0002019453,0.014856399],"genre_scores_gemma":[0.8609227,0.0000013131228,0.13734545,0.0005636646,0.00007634813,0.00004251402,0.0000036981805,0.000006582957,0.0010377341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925876,0.000007811123,0.00016284567,0.00023430864,0.0001058291,0.00023042259],"domain_scores_gemma":[0.999524,0.00002300788,0.00003668909,0.00030507115,0.000056439312,0.000054814096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013492267,0.00009271077,0.00010880152,0.000028177694,0.000084689585,0.00034068036,0.000431568,0.000040458915,0.0000052233913],"category_scores_gemma":[0.0000056447166,0.0000762626,0.000054522967,0.000117592164,0.000014558169,0.0006440879,0.00008544413,0.000038779766,0.00005362983],"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.000010461148,0.000065405824,0.00001912681,0.00007208264,0.00001897212,0.000005081535,0.0011258763,0.033451155,0.0006519181,0.9445103,0.0047930484,0.015276574],"study_design_scores_gemma":[0.006195401,0.0004835458,0.0006046346,0.00021258877,0.000011472313,0.0001415251,0.0013821298,0.66817284,0.0023975573,0.112695314,0.20645332,0.0012496497],"about_ca_topic_score_codex":0.00004369287,"about_ca_topic_score_gemma":0.0000448843,"teacher_disagreement_score":0.85917366,"about_ca_system_score_codex":0.000030340776,"about_ca_system_score_gemma":0.00008807708,"threshold_uncertainty_score":0.32851887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55609316,0.0008310526,0.27565634,0.048269875,0.0032626141,0.003596234,0.00021486617,0.0011655748,0.11091029],"genre_scores_gemma":[0.9893275,0.000021548927,0.009862182,0.00012931858,0.000054506287,0.000045533074,0.0000015346168,0.000007172541,0.00055074325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984473,0.000008557899,0.00033875523,0.00032057593,0.00055458694,0.00033024352],"domain_scores_gemma":[0.9990719,0.000036039903,0.00025848136,0.00026647223,0.0002662021,0.00010092355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025765793,0.00014985877,0.00022481913,0.000035093828,0.00021126175,0.000073299365,0.0010027065,0.0000550194,0.000007378488],"category_scores_gemma":[0.00014461936,0.00009982893,0.00012292575,0.0005594726,0.00010709682,0.0004971574,0.0004543816,0.00015572096,0.000027860178],"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.0000648429,0.001228532,0.027768876,0.0002313777,0.00017490066,0.000026071351,0.0014593208,0.000051344145,0.03679095,0.5540692,0.3743352,0.0037993747],"study_design_scores_gemma":[0.0053916196,0.0006968215,0.0888715,0.0007559718,0.00010505109,0.0023291477,0.00060047494,0.042496286,0.4776981,0.014927009,0.36446068,0.001667369],"about_ca_topic_score_codex":0.00003974651,"about_ca_topic_score_gemma":0.0000011608281,"teacher_disagreement_score":0.5391422,"about_ca_system_score_codex":0.0000741856,"about_ca_system_score_gemma":0.00007026755,"threshold_uncertainty_score":0.40709057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006870808,0.00033321907,0.9964352,0.0010802099,0.00020852055,0.00032140757,0.00020412116,0.00014333442,0.00058690936],"genre_scores_gemma":[0.9823419,0.000013534091,0.0162873,0.00032251026,0.00002414123,0.00007122053,0.000005827771,0.000005103045,0.00092848256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.000020063699,0.00017737555,0.00027307632,0.00010305416,0.00022087169],"domain_scores_gemma":[0.99935347,0.00016647203,0.00004101542,0.0002676251,0.00008171693,0.00008971975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010430527,0.000106129344,0.00016060741,0.00003647764,0.0001611082,0.00011677627,0.00019764088,0.000036348687,0.00007160259],"category_scores_gemma":[0.000017324792,0.00009093058,0.00005401112,0.00011806468,0.00003408766,0.00031309633,0.0000052503474,0.000048680035,0.000016055817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079558085,0.002834228,0.005256098,0.0013818565,0.00036927382,0.000060243503,0.0020685692,0.012536256,0.0153371645,0.25551137,0.12504321,0.5795222],"study_design_scores_gemma":[0.0015856996,0.000052319614,0.00008298394,0.000025248384,0.000008808269,0.000007056809,0.000014589967,0.9625122,0.0008822456,0.00003985645,0.03464901,0.00013997695],"about_ca_topic_score_codex":0.000031739102,"about_ca_topic_score_gemma":0.000021072843,"teacher_disagreement_score":0.9816548,"about_ca_system_score_codex":0.0000095234955,"about_ca_system_score_gemma":0.00001333056,"threshold_uncertainty_score":0.37080413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2158462,0.00029679167,0.7655627,0.007679624,0.0010947125,0.00170446,0.000063597785,0.0015738979,0.006178013],"genre_scores_gemma":[0.99214196,0.00001914909,0.00685774,0.00023689478,0.00010709483,0.00039056133,0.000019666768,0.000018368351,0.00020854511],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967946,0.000014283817,0.0007422332,0.0007676984,0.0010068625,0.000674366],"domain_scores_gemma":[0.99802417,0.000020052303,0.00045669312,0.00029295345,0.0010944029,0.0001117392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000492689,0.00037949148,0.000361364,0.0004464294,0.00036411494,0.00037849246,0.0009727529,0.00026868776,0.000034826895],"category_scores_gemma":[0.000058202393,0.00037616814,0.000078405275,0.0008149718,0.00018016735,0.0013065106,0.00006534289,0.00026833077,0.00010092167],"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.00005044125,0.0009886732,0.21267167,0.00018292846,0.0001596617,0.000017861526,0.00043429772,0.00005313387,0.40041974,0.20492059,0.011752581,0.16834843],"study_design_scores_gemma":[0.028297784,0.0016156683,0.07816947,0.0014029194,0.00027904948,0.0007904168,0.0024559721,0.10108419,0.60053414,0.12045574,0.06024189,0.00467274],"about_ca_topic_score_codex":0.00008130038,"about_ca_topic_score_gemma":0.000072214796,"teacher_disagreement_score":0.7762958,"about_ca_system_score_codex":0.00039463944,"about_ca_system_score_gemma":0.00023497756,"threshold_uncertainty_score":0.99986905},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038829,0.3188276,0.65737164,0.016427398,0.0003550552,0.00069872465,0.000005697925,0.0006309662,0.0052946513],"genre_scores_gemma":[0.10354989,0.40013167,0.4757953,0.019617537,0.00013538044,0.00015502886,0.00010940269,0.000032170843,0.00047359828],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786675,0.00048764146,0.00066462246,0.0003747111,0.00032716588,0.00027910387],"domain_scores_gemma":[0.9929363,0.00031763938,0.00027917925,0.006098344,0.00023666823,0.00013182894],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006013698,0.00022288504,0.00046848238,0.000057238598,0.0003770729,0.000094534225,0.0061682137,0.00006303269,0.000033856],"category_scores_gemma":[0.00007578228,0.00020142128,0.00016918412,0.00072052877,0.00008668186,0.00058776175,0.0017717913,0.00027578312,0.0006306235],"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.0000018621262,0.00026786973,0.0009457752,0.0007973088,0.000066077235,0.000036243942,0.00058197667,0.0000394379,0.000016603593,0.07270154,0.2941909,0.6303544],"study_design_scores_gemma":[0.00023638787,0.000034696375,0.0026600994,0.001650158,0.000008561483,0.0002782802,0.0000013654933,0.0064509837,0.000018714725,0.00078309345,0.9875609,0.00031674892],"about_ca_topic_score_codex":0.000026854603,"about_ca_topic_score_gemma":0.0000020860125,"teacher_disagreement_score":0.69337,"about_ca_system_score_codex":0.000043738135,"about_ca_system_score_gemma":0.00006181206,"threshold_uncertainty_score":0.99920887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03172188,0.00022910001,0.9650287,0.0017749085,0.00013348399,0.00012542873,0.0000013708931,0.00010733647,0.00087777653],"genre_scores_gemma":[0.94504005,0.0000012830508,0.05387869,0.00086583715,0.000070199516,0.00002514436,0.0000085851825,0.000013213793,0.000097003925],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.000042031785,0.00036589382,0.00046543815,0.00029604224,0.00046376232],"domain_scores_gemma":[0.9995261,0.000016631882,0.00016461396,0.000239209,0.000008600174,0.0000448895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025354544,0.0001832259,0.00020481889,0.000088312874,0.00013355465,0.00023232916,0.0005682366,0.00005430213,0.000003782262],"category_scores_gemma":[0.0000067267065,0.00018107865,0.000042490425,0.0002911098,0.000034698805,0.00052628556,0.0000963035,0.00014792338,0.00006105623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005681226,0.0015057505,0.03830744,0.00070647884,0.00005994828,0.0013423809,0.002178686,0.26427642,0.4027897,0.1143689,0.009160599,0.16524687],"study_design_scores_gemma":[0.0035746568,0.00007312714,0.06818456,0.00061279023,0.000013504581,0.00012919275,0.000056918085,0.9016,0.0047852793,0.0029690498,0.016323958,0.0016769256],"about_ca_topic_score_codex":0.000105822044,"about_ca_topic_score_gemma":0.000012350485,"teacher_disagreement_score":0.91331816,"about_ca_system_score_codex":0.00005323241,"about_ca_system_score_gemma":0.000021924456,"threshold_uncertainty_score":0.73841727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028955508,0.000018826804,0.96896034,0.00021073248,0.00001458248,0.0014723772,0.0000011456084,0.000049758437,0.00031674115],"genre_scores_gemma":[0.9784876,9.322133e-7,0.021119045,0.000012977079,0.000006695817,0.00036201667,0.000002027226,0.0000016478506,0.000007063634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999576,0.000009778281,0.00013040467,0.00012773991,0.00009973703,0.00005634337],"domain_scores_gemma":[0.999743,0.000001987447,0.000057901365,0.00011817772,0.000057957113,0.000021003561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007965209,0.00004121071,0.00006673333,0.000022685379,0.000043984415,0.00004975324,0.000090531656,0.000025187968,7.0546804e-7],"category_scores_gemma":[8.6558066e-7,0.00003653772,0.000012019024,0.00012711865,0.000015586862,0.00047502457,0.0000048546044,0.000024964756,0.000001300315],"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.00002431563,0.00035024591,0.00021940221,0.00044775516,0.000009711898,0.000002157838,0.0013190598,0.006887865,0.68480706,0.10953448,0.000013962129,0.19638401],"study_design_scores_gemma":[0.0037746106,0.00037602385,0.041027892,0.00091083784,0.000011016506,0.000085259766,0.00014361543,0.34882596,0.59355545,0.0086757615,0.0021050395,0.00050853763],"about_ca_topic_score_codex":0.000016675622,"about_ca_topic_score_gemma":9.769836e-7,"teacher_disagreement_score":0.9495321,"about_ca_system_score_codex":0.000015410826,"about_ca_system_score_gemma":0.000020814892,"threshold_uncertainty_score":0.1489965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034351024,0.00027165818,0.9942204,0.000522855,0.0011764156,0.0007302778,0.00001600973,0.00022958689,0.0024892848],"genre_scores_gemma":[0.9634044,0.000010546389,0.025962882,0.00041928177,0.000117723735,0.00021209242,0.0000038998205,0.000012702635,0.009856454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.000028127191,0.00031625174,0.00037146994,0.00019628089,0.00030277765],"domain_scores_gemma":[0.99926734,0.000033065047,0.00005877041,0.00040023896,0.0001042332,0.00013635284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027552273,0.00013020259,0.00021543687,0.00005937006,0.00011663967,0.00020736874,0.00045237612,0.00005888398,0.00005419013],"category_scores_gemma":[0.0000102441345,0.00011316436,0.00008592289,0.00025533052,0.0000070693136,0.00037260502,0.000020034277,0.000053062875,0.0002632987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015745141,0.000584981,0.00011815056,0.0010384752,0.00010984205,0.000046795096,0.0040982505,0.014966163,0.00581225,0.012194486,0.18154308,0.77947176],"study_design_scores_gemma":[0.00061158044,0.00013083374,0.00006574134,0.00007983972,0.000005869927,0.000039227532,0.0000872389,0.7283656,0.00061563466,0.0000057379325,0.2697377,0.00025497688],"about_ca_topic_score_codex":0.00007340249,"about_ca_topic_score_gemma":0.000021969945,"teacher_disagreement_score":0.96825755,"about_ca_system_score_codex":0.000047604128,"about_ca_system_score_gemma":0.000011873773,"threshold_uncertainty_score":0.46147087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09138642,0.0013326198,0.905966,0.00013480023,0.0009171384,0.000077163735,0.0000016166571,0.000028767754,0.00015548663],"genre_scores_gemma":[0.7239709,0.000022052278,0.27576393,0.00010316542,0.00011384246,8.891151e-7,0.0000018785663,0.000009890796,0.00001344872],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985393,0.000044990225,0.00064772816,0.00020855032,0.0003001045,0.00025931845],"domain_scores_gemma":[0.9987229,0.00008523106,0.0005066411,0.0002406307,0.0002328724,0.00021172692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010700489,0.0001660226,0.0002555478,0.0001404556,0.00020252439,0.00021221169,0.00063657894,0.00008829144,0.0000065023696],"category_scores_gemma":[0.00026771027,0.00014894914,0.000076887634,0.00034191663,0.00004445965,0.00097522413,0.00025926833,0.00023056498,0.0000017950301],"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.000103910126,0.0002243608,0.00079344487,0.00005094161,0.0002391058,0.0005054563,0.009834633,0.00021378185,0.6008888,0.036038592,0.00075019826,0.35035682],"study_design_scores_gemma":[0.0034836242,0.001973933,0.00046474003,0.00081851997,0.000035670957,0.0029241736,0.019585727,0.17586446,0.7748091,0.017206525,0.0017535678,0.0010799322],"about_ca_topic_score_codex":0.000040563886,"about_ca_topic_score_gemma":0.0000024123078,"teacher_disagreement_score":0.63258445,"about_ca_system_score_codex":0.00020939205,"about_ca_system_score_gemma":0.000078978264,"threshold_uncertainty_score":0.60739696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01262687,0.0002612675,0.98370206,0.00081281766,0.00040707417,0.0004929023,0.00093019067,0.00016101683,0.00060581503],"genre_scores_gemma":[0.99159276,0.000061549894,0.007766127,0.00015517182,0.000027692085,0.00004173311,0.00031235427,0.00000614226,0.000036484813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812216,0.00016216609,0.0004981329,0.00066489604,0.00026114634,0.00029150915],"domain_scores_gemma":[0.9978519,0.00015605034,0.00011646892,0.0016723892,0.00006724177,0.00013592502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919423,0.00020580302,0.00028652107,0.00021528467,0.00015033464,0.00016501399,0.00059116987,0.00007451172,0.000020069905],"category_scores_gemma":[0.000079902864,0.00019352575,0.00004022391,0.00062361226,0.00006644613,0.0009343825,0.000016430773,0.00037031044,0.00002410201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042858903,0.004380023,0.004930387,0.0008123831,0.00026255776,0.00064412644,0.0024998847,0.0057104286,0.049087305,0.27072895,0.0118585825,0.6486568],"study_design_scores_gemma":[0.012954013,0.0016789454,0.056685567,0.0065754796,0.00014019173,0.002595461,0.002579472,0.8087973,0.0119340625,0.0021525945,0.089015886,0.004891015],"about_ca_topic_score_codex":0.0006153391,"about_ca_topic_score_gemma":0.000098575794,"teacher_disagreement_score":0.9789659,"about_ca_system_score_codex":0.00006525768,"about_ca_system_score_gemma":0.000059433605,"threshold_uncertainty_score":0.78917503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035831446,0.00002947024,0.98205405,0.0013137894,0.00064681476,0.00010542547,0.000019795763,0.00024140283,0.01200613],"genre_scores_gemma":[0.76469845,0.0000017110061,0.23328696,0.00024218162,0.000054564192,0.00000742064,0.000038748203,0.0000029433486,0.0016670326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.000010991929,0.00015094488,0.00047371158,0.00010611236,0.00011683883],"domain_scores_gemma":[0.99581826,0.00001830965,0.000047749993,0.0039981036,0.00006183445,0.000055718894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033682218,0.000055186083,0.00006664081,0.00001835365,0.000070107424,0.00012194243,0.0017591532,0.000039940245,0.000021337328],"category_scores_gemma":[0.00009665979,0.00004495212,0.000014691034,0.00015399656,0.000019569352,0.00055969646,0.00033112883,0.00009628148,0.00021099955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014581748,0.00026222682,0.0034865977,0.000017151078,0.000016623962,0.000009735516,0.00017093707,0.0000034195311,0.07470507,0.5313523,0.05910273,0.33087176],"study_design_scores_gemma":[0.00030976767,0.000010164821,0.0216265,0.000005987535,0.0000021602248,0.00004294292,0.000011960841,0.5377111,0.0013227314,0.00041514685,0.4383454,0.00019613196],"about_ca_topic_score_codex":0.00008150614,"about_ca_topic_score_gemma":0.00012455358,"teacher_disagreement_score":0.7611153,"about_ca_system_score_codex":0.0000031133907,"about_ca_system_score_gemma":0.000035584595,"threshold_uncertainty_score":0.32689735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029176673,0.0002692173,0.96128696,0.00014703658,0.00064188434,0.000099046905,0.000004336265,0.00023755067,0.008137309],"genre_scores_gemma":[0.9399221,0.0000034689574,0.059784777,0.00012712769,0.00008152738,0.000005554306,0.000007261333,0.000005879203,0.00006229382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991504,0.000032164742,0.00018056884,0.00026218145,0.00016587645,0.00020882123],"domain_scores_gemma":[0.9990635,0.000051960356,0.000104902305,0.000645311,0.00006633272,0.000068023124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015982897,0.00009975871,0.00011284837,0.000043911026,0.00010261663,0.00010464035,0.0011077151,0.000054029508,0.000052331336],"category_scores_gemma":[0.00007891658,0.000089302775,0.000028372913,0.00024321262,0.000021426069,0.0006226713,0.00016604929,0.00007105842,0.0002714903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005543249,0.00072864053,0.074851885,0.00043794478,0.00025290003,0.00037418737,0.021270717,0.0043178294,0.003919062,0.34131092,0.004103071,0.5483774],"study_design_scores_gemma":[0.0013210578,0.00036019017,0.04939254,0.00031281656,0.000047611764,0.000089633715,0.00033520872,0.9017051,0.00986217,0.017959338,0.01716885,0.0014454955],"about_ca_topic_score_codex":0.000114173585,"about_ca_topic_score_gemma":0.000018574354,"teacher_disagreement_score":0.91074544,"about_ca_system_score_codex":0.000015899093,"about_ca_system_score_gemma":0.000024454443,"threshold_uncertainty_score":0.36416614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030853331,0.0032292847,0.96145386,0.0011580809,0.0008327618,0.00015290627,0.000005099396,0.000097668424,0.002217021],"genre_scores_gemma":[0.9630232,0.0002228956,0.03584772,0.0006434556,0.00009758475,0.0000305018,0.0000114415825,0.0000056353574,0.00011756052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985445,0.00013557161,0.00029398449,0.00046667628,0.00032901755,0.00023021585],"domain_scores_gemma":[0.998915,0.00019456718,0.00018283352,0.0001918483,0.00026065935,0.0002550755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038087947,0.00016188488,0.0001743548,0.00004155966,0.000256801,0.00036312817,0.00025063116,0.000068819914,0.00000344156],"category_scores_gemma":[0.00020597268,0.00015064789,0.00002089583,0.00029212053,0.000113936265,0.0024255945,0.00022893728,0.00014416514,0.000030763287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020323612,0.00009763657,0.00017988251,0.000017953891,0.000010882306,0.000053342963,0.028560989,0.00008906497,0.000108133456,0.018309271,0.0022258582,0.9503267],"study_design_scores_gemma":[0.0015983811,0.0004159447,0.0010393678,0.000096063806,0.00001781045,0.00076890975,0.012851105,0.80975765,0.0002438145,0.003301573,0.16929916,0.00061020686],"about_ca_topic_score_codex":0.000054586468,"about_ca_topic_score_gemma":8.968929e-7,"teacher_disagreement_score":0.94971645,"about_ca_system_score_codex":0.00002131275,"about_ca_system_score_gemma":0.00009779773,"threshold_uncertainty_score":0.6143243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011101236,0.0043736817,0.9828203,0.000087560256,0.0005526568,0.00071470183,0.00007220603,0.00021438039,0.000063290354],"genre_scores_gemma":[0.9891309,0.0025935085,0.0076216278,0.00007356045,0.000035386132,0.00012366909,0.000039688435,0.00002505222,0.000356621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801284,0.000047915284,0.00045732726,0.0007432967,0.00021130171,0.0005273155],"domain_scores_gemma":[0.9984862,0.00020899587,0.00016853001,0.00077804975,0.0002088616,0.00014932416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086168223,0.00024376037,0.00026272077,0.00012773873,0.00046511117,0.00017399326,0.00026569774,0.00014330982,0.000004997637],"category_scores_gemma":[0.0000063426974,0.0002450396,0.00003983598,0.00037314848,0.00008414399,0.00042529815,0.0000057599455,0.00026569713,0.000015981404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022268394,0.0002973192,0.00020519845,0.0006059723,0.0002758058,0.000009456251,0.00020886338,0.00875018,0.002209292,0.012458624,0.0013860442,0.97337055],"study_design_scores_gemma":[0.0010718553,0.000266662,0.00009143269,0.00018354646,0.00009312159,0.00012148633,0.000033052962,0.932407,0.04115434,0.000019484984,0.02411442,0.0004435876],"about_ca_topic_score_codex":0.000052586747,"about_ca_topic_score_gemma":0.00007103996,"teacher_disagreement_score":0.97802967,"about_ca_system_score_codex":0.00022052934,"about_ca_system_score_gemma":0.00011293293,"threshold_uncertainty_score":0.9992426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085168314,0.000009150931,0.9415905,0.00028563623,0.000117602016,0.055407807,0.000051253413,0.00022935463,0.0022235673],"genre_scores_gemma":[0.3681206,7.671131e-7,0.32426235,0.0006884096,0.0001327118,0.30300927,0.000050430008,0.00003308292,0.0037023323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988309,0.000026936836,0.00024779653,0.00040301727,0.00019461043,0.00029671486],"domain_scores_gemma":[0.9991069,0.000041505,0.00008411192,0.00061525445,0.00007496863,0.00007729921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001316369,0.00014360901,0.0001749013,0.000043171854,0.00015435569,0.00016356034,0.0006148078,0.000039993647,0.00006010228],"category_scores_gemma":[0.000030726085,0.000113626586,0.00007956471,0.00023767621,0.000023962668,0.00044985674,0.000101067264,0.00007193943,0.000021730611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069043585,0.00077837444,0.0021472815,0.0009082016,0.0000962647,0.00006905295,0.0008282107,0.00037857686,0.0039465656,0.31433907,0.10760262,0.56883675],"study_design_scores_gemma":[0.0012523632,0.00005084476,0.0006273848,0.000045497927,0.0000024881024,0.000022280487,0.000008205254,0.7873606,0.00061194005,0.0009427416,0.20884871,0.00022691526],"about_ca_topic_score_codex":0.000043319196,"about_ca_topic_score_gemma":0.00016447359,"teacher_disagreement_score":0.78698206,"about_ca_system_score_codex":0.000029953058,"about_ca_system_score_gemma":0.000013642646,"threshold_uncertainty_score":0.46335578},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005897741,0.000015972166,0.99668485,0.00038855217,0.00034104896,0.00021452001,0.000067473746,0.00024588735,0.001451938],"genre_scores_gemma":[0.96353465,8.170157e-7,0.035047803,0.000062867686,0.00008752692,0.00008309218,0.000117673524,0.000006133029,0.0010594443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.000011735978,0.00018819231,0.0001865666,0.00009077983,0.0001666491],"domain_scores_gemma":[0.99956495,0.000022172442,0.000040969382,0.00019634032,0.00014633215,0.000029258801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008326976,0.00007491346,0.00009205838,0.000029544939,0.00013132124,0.00016324453,0.00019768091,0.000041832354,0.00001813731],"category_scores_gemma":[0.000008101189,0.00006806434,0.000041929714,0.00038106425,0.0000083866025,0.00036172217,0.0000076017755,0.00002486949,0.00000896021],"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.000014861924,0.00027270414,0.00048400846,0.00007472363,0.000032472137,0.0000030335088,0.00014366565,0.075868815,0.003989977,0.8823512,0.017974954,0.018789565],"study_design_scores_gemma":[0.00094469584,0.000036571517,0.0014583294,0.000017674698,0.000007294163,0.000009056441,0.000017036908,0.78135574,0.003077045,0.004631141,0.20818786,0.0002575586],"about_ca_topic_score_codex":0.0001845352,"about_ca_topic_score_gemma":0.00011229746,"teacher_disagreement_score":0.96294487,"about_ca_system_score_codex":0.000024923906,"about_ca_system_score_gemma":0.000031753738,"threshold_uncertainty_score":0.27755833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7642706,0.00033850732,0.23294123,0.000073613664,0.00040545114,0.0007199122,0.000054768076,0.00013932741,0.0010565943],"genre_scores_gemma":[0.9883562,0.0000021750845,0.011530754,0.00004608202,0.000021162929,0.000014022851,0.000003240459,0.000004412809,0.000021964803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867326,0.00008259688,0.00053021725,0.00039276795,0.00010474708,0.00021640284],"domain_scores_gemma":[0.99875325,0.000194249,0.00022524837,0.0005286555,0.00021666136,0.00008192121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082513015,0.00013082182,0.00041727241,0.00002519066,0.00008159724,0.00007412171,0.0005287625,0.000062340354,0.0000024191106],"category_scores_gemma":[0.000014146053,0.00010816558,0.00006756724,0.00010966578,0.00006673751,0.00025745606,0.00013980735,0.000043785854,0.0000018857581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002607186,0.00092145696,0.3544683,0.004880359,0.00027612646,0.0000033961348,0.006637936,0.00082041434,0.016142603,0.60567254,0.00043714434,0.009479021],"study_design_scores_gemma":[0.0010281577,0.0000978377,0.057078972,0.000051481464,0.000006859927,0.0000035094606,0.00015537861,0.93946403,0.00036560278,0.0005622209,0.001043394,0.00014254273],"about_ca_topic_score_codex":0.0005896425,"about_ca_topic_score_gemma":0.0000489996,"teacher_disagreement_score":0.93864363,"about_ca_system_score_codex":0.000029803627,"about_ca_system_score_gemma":0.00005277103,"threshold_uncertainty_score":0.44108644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018028645,0.00023719927,0.95150554,0.0020718768,0.00018372401,0.00032324812,0.000030055919,0.0001652891,0.043680213],"genre_scores_gemma":[0.99268085,0.0000039404476,0.00699056,0.00016614195,0.000007101654,0.000056130102,0.000013437729,0.0000029957012,0.00007882218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987522,0.00036093814,0.0002776657,0.00019567952,0.00019208879,0.00022145429],"domain_scores_gemma":[0.9979197,0.00018291564,0.000055043198,0.0017441729,0.00005519024,0.00004297434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007761976,0.00009383081,0.00012547293,0.0000326353,0.00015766996,0.00021804823,0.0020144144,0.000041922507,0.0000035617352],"category_scores_gemma":[0.00006287455,0.00006043006,0.00004217369,0.0006590389,0.000043876753,0.00021945426,0.000102941194,0.00014568641,0.00008774053],"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":[3.4863257e-7,0.00007774333,0.000698622,0.0000088314355,0.0000033586377,0.000007733705,0.00040823777,0.00006170638,0.000015359934,0.99664485,0.0015571356,0.00051605096],"study_design_scores_gemma":[0.0015872784,0.00005791741,0.021043934,0.00018029648,0.000010004282,0.0002920902,0.00718194,0.5059547,0.00021468409,0.0013221432,0.46152207,0.00063294964],"about_ca_topic_score_codex":0.00011409799,"about_ca_topic_score_gemma":0.00010299846,"teacher_disagreement_score":0.9953227,"about_ca_system_score_codex":0.000054066593,"about_ca_system_score_gemma":0.000033573557,"threshold_uncertainty_score":0.37433165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016744427,0.0005177496,0.9601727,0.00024046467,0.0016244545,0.00020507968,0.000070423404,0.0002769028,0.020147804],"genre_scores_gemma":[0.9964697,0.000010731609,0.0022744902,0.000025432619,0.00008442061,0.000013837661,0.000007832406,0.0000061860947,0.0011073697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987015,0.00006406752,0.0004871152,0.000278578,0.00025705455,0.0002116814],"domain_scores_gemma":[0.9989446,0.000089087494,0.00021440016,0.0005385436,0.0001243745,0.00008901128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017922456,0.00012996554,0.00025145232,0.00007847372,0.000094094954,0.00017479694,0.0005646168,0.000042734875,0.000058968406],"category_scores_gemma":[0.000042985386,0.000108254564,0.00008210617,0.00050219876,0.000032359432,0.00051117514,0.000099755605,0.00011655986,0.00011809296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015013602,0.0010888133,0.00783788,0.000463662,0.0003381761,0.00011199061,0.004493586,0.02614931,0.0098077925,0.8132335,0.11849777,0.017962493],"study_design_scores_gemma":[0.0004874294,0.00007096592,0.0022799282,0.00026667124,0.000010018206,0.00012813155,0.0005560601,0.9500662,0.0019275425,0.00019362217,0.043647103,0.0003663457],"about_ca_topic_score_codex":0.00018945013,"about_ca_topic_score_gemma":0.000022887583,"teacher_disagreement_score":0.97972524,"about_ca_system_score_codex":0.00004205719,"about_ca_system_score_gemma":0.000012611178,"threshold_uncertainty_score":0.44144928},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74567604,0.00011517328,0.2443618,0.0034292173,0.00036911096,0.0007498232,0.0008343709,0.00023574795,0.0042286976],"genre_scores_gemma":[0.9978073,8.6404475e-7,0.0015347047,0.00051262794,0.000034189787,0.000010229433,0.00004955284,0.000009352946,0.00004114013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790055,0.00013631416,0.0005405734,0.00046705175,0.00047321653,0.00048232588],"domain_scores_gemma":[0.9982887,0.0003543404,0.00016092103,0.0008919312,0.00017336963,0.00013074322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124231,0.00020728962,0.0003001149,0.000052742875,0.00023968065,0.00016213393,0.0010814551,0.000052072683,0.00022733539],"category_scores_gemma":[0.00009619706,0.00015855,0.00011705686,0.00073592813,0.000033254943,0.000043520988,0.00015521243,0.0001555573,0.00017241538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002752447,0.0014024883,0.0018427536,0.00011118318,0.0005165552,0.000109252964,0.0061426875,0.11923312,0.004817611,0.5710436,0.16544038,0.12906514],"study_design_scores_gemma":[0.0057099797,0.0031849784,0.13155392,0.0026074224,0.00010638754,0.0001223188,0.0016564775,0.6194769,0.030477159,0.00745294,0.19400214,0.0036493663],"about_ca_topic_score_codex":0.00007816831,"about_ca_topic_score_gemma":0.0000048343304,"teacher_disagreement_score":0.56359065,"about_ca_system_score_codex":0.00007561926,"about_ca_system_score_gemma":0.00006661278,"threshold_uncertainty_score":0.64654815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001774345,0.0003554578,0.98800224,0.0007483198,0.0022498372,0.0005163515,0.000021277501,0.00025211132,0.007676952],"genre_scores_gemma":[0.38101757,0.000043443513,0.61279446,0.0016236749,0.0010776318,0.00003263979,0.000037621376,0.0001098874,0.0032631028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453753,0.00003391825,0.000619463,0.0021433218,0.0016212033,0.0010445412],"domain_scores_gemma":[0.99632764,0.00019464173,0.0004505303,0.0022268014,0.00045566814,0.0003447205],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008262535,0.00078590977,0.00079791714,0.0005415616,0.00058491615,0.0011862484,0.004028065,0.00058386254,0.000047483478],"category_scores_gemma":[0.000034438155,0.00063274725,0.00012871655,0.00096997345,0.001409708,0.00090261584,0.0013170483,0.0015636301,0.000117949596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051884632,0.0001528401,0.000118479606,0.00017968933,0.000042421863,0.0007449643,0.0020046085,0.04255864,0.0016357542,0.1260888,0.0003028179,0.8261191],"study_design_scores_gemma":[0.001502574,0.0008601372,0.0002990306,0.0020326418,0.00002393899,0.00071453024,0.0000018577225,0.8226475,0.005569163,0.066442356,0.096986406,0.002919829],"about_ca_topic_score_codex":0.00014423965,"about_ca_topic_score_gemma":0.00093436934,"teacher_disagreement_score":0.8231993,"about_ca_system_score_codex":0.00033641417,"about_ca_system_score_gemma":0.0010739076,"threshold_uncertainty_score":0.99985063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017245231,0.0017403718,0.97925436,0.0009005207,0.0005322771,0.00015048099,0.000014323051,0.000048751994,0.00011366932],"genre_scores_gemma":[0.5245716,0.000091051144,0.47450176,0.00020039071,0.00048659748,9.4706246e-7,0.000011127965,0.0000110558285,0.00012549423],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976434,0.00009924088,0.00091951725,0.00034538945,0.0005134129,0.00047902693],"domain_scores_gemma":[0.9976551,0.00041075837,0.0006168391,0.00027398716,0.0006036208,0.00043967812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085818063,0.00024782916,0.00065675116,0.000091411,0.00036484006,0.00017015396,0.00064216263,0.00012095068,0.0000051835473],"category_scores_gemma":[0.00030282512,0.00020008453,0.00023224813,0.00049185485,0.00003820311,0.00035288162,0.0001952567,0.0002941743,0.000003701013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016811884,0.001209066,0.051951475,0.0004926681,0.0013736535,0.0022534668,0.0059884894,0.19480166,0.0021953618,0.12267003,0.34103987,0.27434307],"study_design_scores_gemma":[0.003323717,0.00043603804,0.011836374,0.00017952593,0.000045190453,0.0023543572,0.000096801356,0.94236714,0.000016625228,0.0022856507,0.036681596,0.00037701093],"about_ca_topic_score_codex":0.000048290385,"about_ca_topic_score_gemma":0.000002970527,"teacher_disagreement_score":0.74756545,"about_ca_system_score_codex":0.000096291704,"about_ca_system_score_gemma":0.00045329117,"threshold_uncertainty_score":0.815921},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000303883,0.00000570015,0.9103712,0.000036343314,0.00032557402,0.08664265,0.00020879859,0.00028372032,0.0018221412],"genre_scores_gemma":[0.6735617,4.564397e-8,0.040662006,0.000045380275,0.00006474454,0.28475812,0.0000369551,0.000022596834,0.0008484894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776596,0.00012442877,0.0004956667,0.00065654446,0.00035752094,0.0005998564],"domain_scores_gemma":[0.9982431,0.00007991861,0.00015105624,0.0009352698,0.00032113053,0.00026950517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067280995,0.00024453565,0.00030091402,0.000052170282,0.00025252337,0.0005721903,0.00083479966,0.00010807368,0.00001820157],"category_scores_gemma":[0.00007953274,0.00019270256,0.00009254482,0.0003728243,0.000030318302,0.00033092286,0.000049803617,0.00009089115,0.00006450217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054034183,0.0015807434,0.0006392854,0.00042657336,0.00005200802,0.000034327422,0.0002272744,0.09712358,0.0015613202,0.8842961,0.011729537,0.0022752022],"study_design_scores_gemma":[0.0020943796,0.00016486368,0.0002556212,0.00005743013,0.0000035309995,0.00004666693,0.000086904874,0.85213333,0.0017239457,0.000103767954,0.14298448,0.00034507108],"about_ca_topic_score_codex":0.00009349397,"about_ca_topic_score_gemma":0.000009548641,"teacher_disagreement_score":0.88419235,"about_ca_system_score_codex":0.000086534186,"about_ca_system_score_gemma":0.00012700213,"threshold_uncertainty_score":0.7858182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004138561,0.000110450965,0.93578273,0.0009241918,0.000019730713,0.00017237644,0.00000779354,0.00019352161,0.05865067],"genre_scores_gemma":[0.9181645,0.000036097248,0.080895044,0.00014636452,0.000087473425,0.0000644837,0.000016679873,0.0000033588904,0.00058602175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946404,0.000011434723,0.00013899058,0.00016187526,0.00009679449,0.00012687522],"domain_scores_gemma":[0.9996979,0.000029707951,0.00003957525,0.00011460873,0.000061638646,0.00005656251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093824674,0.000057004872,0.00006849694,0.00002637894,0.00011646862,0.00009748186,0.00013548112,0.000027440217,0.000013684417],"category_scores_gemma":[0.0000023645136,0.00005229112,0.000015800197,0.00015345713,0.0000085622105,0.00063702057,0.0000523461,0.000028734063,0.0003495484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014280303,0.000047063753,0.000017506423,0.000016574964,0.000005626808,8.811931e-7,0.00015375939,0.0002587353,0.0008769383,0.8889379,0.002549371,0.107134216],"study_design_scores_gemma":[0.00047169684,0.000038344242,0.0017018021,0.000017157174,0.0000036883066,0.000067308334,0.000016883,0.93251574,0.0004090452,0.002942003,0.061604995,0.00021134729],"about_ca_topic_score_codex":0.0000048983857,"about_ca_topic_score_gemma":0.000002612019,"teacher_disagreement_score":0.932257,"about_ca_system_score_codex":0.000013534311,"about_ca_system_score_gemma":0.000015734655,"threshold_uncertainty_score":0.44928542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052779365,0.00035313988,0.93661153,0.000086341715,0.0007300907,0.0004083069,0.00002628263,0.00010573435,0.008899205],"genre_scores_gemma":[0.969423,0.0000026927628,0.029900314,0.00030456376,0.000023019373,0.000022781936,0.0000040657333,0.000009199079,0.00031035498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982258,0.00018168951,0.0004303476,0.00048775595,0.00024735398,0.0004270509],"domain_scores_gemma":[0.99880606,0.000043658423,0.0000647893,0.00082623825,0.00007344823,0.0001858188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061810075,0.000161063,0.00025740516,0.00012892981,0.00007933647,0.00021756811,0.0004900347,0.000055618628,0.000013603248],"category_scores_gemma":[0.00007157414,0.00014723903,0.000041983312,0.00062411046,0.000018744679,0.00028100435,0.00011110222,0.00008505473,0.00008953616],"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.000006630315,0.00014534812,0.0026307066,0.000077688994,0.000018347786,0.00066458,0.00025079027,0.019356253,0.003511487,0.97085035,0.0013723065,0.0011154856],"study_design_scores_gemma":[0.0026358825,0.00030658182,0.0008531519,0.0010511131,0.000018624089,0.0031117098,0.0011837723,0.8167324,0.007087047,0.0018422414,0.16278,0.0023974853],"about_ca_topic_score_codex":0.00079681614,"about_ca_topic_score_gemma":0.00012965966,"teacher_disagreement_score":0.96900815,"about_ca_system_score_codex":0.00012082504,"about_ca_system_score_gemma":0.000103158876,"threshold_uncertainty_score":0.60042334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11651591,0.00012912128,0.87833697,0.00070578395,0.0036897243,0.00012825313,0.0000012697567,0.000023178725,0.0004697901],"genre_scores_gemma":[0.91501814,0.000010784922,0.08464368,0.000076800025,0.00023030251,0.0000051478173,0.000001012595,0.0000032346813,0.00001087974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748725,0.00014884454,0.0008648674,0.0001857739,0.001054298,0.00025899656],"domain_scores_gemma":[0.9973032,0.000230824,0.0007314989,0.00024398087,0.0013851365,0.0001053674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026792253,0.00011801978,0.00032726114,0.0007776485,0.00008377267,0.00029859543,0.0018450604,0.000038653976,0.000007420541],"category_scores_gemma":[0.0002005594,0.00009830363,0.0001427177,0.00091716973,0.00023931792,0.003021206,0.00012127061,0.00017008063,0.0000050116514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050463774,0.00672055,0.067145705,0.00012652681,0.00063812523,0.000056303386,0.019728912,0.100258335,0.018646784,0.46705866,0.0014326324,0.31314108],"study_design_scores_gemma":[0.040362738,0.00022937018,0.04517936,0.0004882524,0.000024165656,0.00027672458,0.0000621183,0.8988021,0.0083638225,0.0029246295,0.0028897915,0.00039695323],"about_ca_topic_score_codex":0.000031509946,"about_ca_topic_score_gemma":0.0000101671585,"teacher_disagreement_score":0.79854375,"about_ca_system_score_codex":0.00022577215,"about_ca_system_score_gemma":0.00057877944,"threshold_uncertainty_score":0.40087056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027426733,0.00004139248,0.97001857,0.00016487956,0.00021909909,0.0015287976,0.00003493496,0.0001358986,0.0004296783],"genre_scores_gemma":[0.9917646,1.577006e-7,0.008006996,0.000036381887,0.00004418573,0.00003733603,0.00009824424,0.000006040924,0.000006034867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982085,0.00006177539,0.00064690557,0.00026486992,0.00044728324,0.000370641],"domain_scores_gemma":[0.9983837,0.0004002952,0.00038543218,0.00045026827,0.0003050618,0.000075263066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012670943,0.00013186815,0.00018366006,0.00004435397,0.0003898634,0.00017506978,0.000827454,0.000060356888,0.000001649331],"category_scores_gemma":[0.000092627044,0.00010129221,0.000087551394,0.00065414817,0.000050264698,0.0001692224,0.0001296233,0.00013275477,0.000007691612],"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.000054737568,0.000267071,0.043188736,0.000067135836,0.000087670545,0.000025887926,0.0007121328,0.07189802,0.00043235664,0.75181013,0.0030823178,0.12837383],"study_design_scores_gemma":[0.00082361954,0.00011534247,0.4656373,0.00017902009,0.0000043285586,0.000035127607,0.00016441943,0.5105296,0.000617619,0.007170006,0.014376406,0.00034721015],"about_ca_topic_score_codex":0.00003153499,"about_ca_topic_score_gemma":0.000003650719,"teacher_disagreement_score":0.9643379,"about_ca_system_score_codex":0.000060437727,"about_ca_system_score_gemma":0.00003672708,"threshold_uncertainty_score":0.41305766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064105254,0.00023150853,0.9934172,0.00013187923,0.0004010174,0.0043894523,0.000099490986,0.000179992,0.0010853647],"genre_scores_gemma":[0.9736303,0.0000716404,0.0044905473,0.00005710881,0.00023799867,0.018628182,0.000010093242,0.000045207362,0.0028289128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991013,0.00002687023,0.00020131802,0.0003224207,0.00011480919,0.00023331658],"domain_scores_gemma":[0.99859506,0.00011700254,0.00002908425,0.0011292573,0.000032925444,0.00009668437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020159093,0.00014558507,0.00011793545,0.000046485246,0.0002851718,0.00023274423,0.0009033067,0.00003857355,0.000015584768],"category_scores_gemma":[0.000004409744,0.0001067272,0.000029277026,0.00023398576,0.000025223571,0.00049843563,0.000013436213,0.00019372487,0.000085814565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002387572,0.0007990733,0.000004557031,0.00015293379,0.000115453615,0.000018536357,0.0008244284,0.008416039,0.0007480368,0.0032795651,0.019265579,0.9663519],"study_design_scores_gemma":[0.0007640615,0.000041370058,0.0000054242814,0.000039348775,0.000004666821,0.000012084777,0.000004781085,0.65413123,0.00052696635,0.000005665541,0.34435233,0.00011205707],"about_ca_topic_score_codex":0.00000767771,"about_ca_topic_score_gemma":0.000022582422,"teacher_disagreement_score":0.98892665,"about_ca_system_score_codex":0.000015925129,"about_ca_system_score_gemma":0.0000097359125,"threshold_uncertainty_score":0.4352209},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036461134,0.0003326085,0.9552263,0.000008126377,0.00031407422,0.000191247,0.000024748655,0.00023218355,0.00720959],"genre_scores_gemma":[0.9203829,0.000027777325,0.07838538,0.00006064888,0.000074882526,0.000017853432,0.000096692274,0.000009839507,0.00094403396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988359,0.00006384669,0.00026796936,0.00035243164,0.0002220202,0.00025783153],"domain_scores_gemma":[0.9989444,0.000014822839,0.00011111265,0.0007044417,0.00015354426,0.000071650655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021751993,0.00013848266,0.00014523057,0.00005544149,0.00015567815,0.00020643629,0.00042395236,0.00005048005,0.00019346597],"category_scores_gemma":[0.000013344066,0.00012281754,0.000039581933,0.00034632432,0.000045092343,0.0018308208,0.00014740335,0.00006889338,0.00020612437],"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.00004208819,0.00064459024,0.0045493385,0.00031262974,0.00012054825,0.000032212356,0.009006347,0.016845196,0.008836386,0.9145052,0.034335118,0.01077037],"study_design_scores_gemma":[0.0009064449,0.00011426743,0.0033833988,0.00025468116,0.000030384404,0.00011663164,0.0007716245,0.40019286,0.0020022278,0.001134224,0.59003234,0.0010609182],"about_ca_topic_score_codex":0.0017956371,"about_ca_topic_score_gemma":0.00030509275,"teacher_disagreement_score":0.91337097,"about_ca_system_score_codex":0.000052035746,"about_ca_system_score_gemma":0.000108020824,"threshold_uncertainty_score":0.5008354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050463947,0.000553987,0.98849773,0.00017245968,0.0010067362,0.00019148106,0.000010716105,0.00013080015,0.0043896725],"genre_scores_gemma":[0.9986711,0.000030155685,0.00031150624,0.00002794573,0.000028781336,0.000028163004,0.000004952372,0.0000026478378,0.00089474156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912953,0.00005089407,0.00023432546,0.0002406621,0.00016846631,0.0001761136],"domain_scores_gemma":[0.99959856,0.000018169063,0.000043097538,0.00025302384,0.000031803276,0.000055336688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015182578,0.000081971746,0.000114670074,0.00006314128,0.000036313246,0.00009559992,0.00021994671,0.00003827757,0.000032987293],"category_scores_gemma":[0.0000048253783,0.00007217409,0.000028963013,0.00027935702,0.000010141007,0.0005418399,0.000012981203,0.00007747398,0.0001684505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095889,0.002113429,0.004454458,0.00047590377,0.000050541577,0.000256993,0.004533772,0.023121106,0.007374025,0.45630142,0.06233448,0.4389743],"study_design_scores_gemma":[0.0004779691,0.000018704708,0.0006249445,0.000049916915,8.746581e-7,0.000015578422,0.000051260362,0.97023445,0.00022118405,0.000004694487,0.028183062,0.00011733114],"about_ca_topic_score_codex":0.00038044367,"about_ca_topic_score_gemma":0.000053120446,"teacher_disagreement_score":0.9936247,"about_ca_system_score_codex":0.00003998807,"about_ca_system_score_gemma":0.00000504723,"threshold_uncertainty_score":0.2943174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31436136,0.00035950297,0.6019365,0.03938935,0.002156476,0.00085252564,0.0000388073,0.0008793681,0.040026076],"genre_scores_gemma":[0.9336844,0.000017048616,0.03818214,0.0013565893,0.00026709225,0.00005324936,0.0000035671817,0.000014003399,0.0264219],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877745,0.000042833984,0.00017399098,0.00043760234,0.00022249747,0.00034564678],"domain_scores_gemma":[0.9984578,0.0000487023,0.00004015068,0.0012281972,0.000049235477,0.00017591417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015164563,0.00014005009,0.00019738289,0.000052108313,0.00009039453,0.0003618472,0.0015186999,0.000062545514,0.00010092689],"category_scores_gemma":[0.00007471314,0.00012301258,0.000075667216,0.00047052038,0.000011734475,0.00041839576,0.00016190701,0.000100138204,0.00069387315],"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.000010002804,0.00003944375,0.00036527784,0.000006566218,0.0000108402255,0.000028058987,0.00024312585,0.000047033434,0.00039569684,0.0018340347,0.051855437,0.9451645],"study_design_scores_gemma":[0.00032053847,0.00014672552,0.0017598136,0.00003440782,0.0000024131368,0.000021205964,0.000014064563,0.0052855937,0.0004175111,0.0025203023,0.98920584,0.00027157713],"about_ca_topic_score_codex":0.00010315411,"about_ca_topic_score_gemma":0.000046846548,"teacher_disagreement_score":0.9448929,"about_ca_system_score_codex":0.000029756065,"about_ca_system_score_gemma":0.000030189822,"threshold_uncertainty_score":0.8918567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005563217,0.0017382237,0.9841817,0.000079924495,0.00010734517,0.00015675125,0.0000454025,0.00010022991,0.0080271885],"genre_scores_gemma":[0.9809473,0.000038630056,0.018248955,0.00011197461,0.000033510878,0.00001704046,0.000049764327,0.0000043826626,0.0005484381],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991321,0.00003020362,0.00029122143,0.00022539598,0.0001707951,0.00015031523],"domain_scores_gemma":[0.99932843,0.00002679564,0.00010039441,0.0004336983,0.000064060914,0.00004662688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015877314,0.00008292233,0.00015056955,0.000028625565,0.000045533445,0.000042812942,0.0003757428,0.000023091634,0.00006092056],"category_scores_gemma":[0.000014414546,0.00007048493,0.000033814318,0.00026313393,0.000018557977,0.00057870866,0.00009060689,0.00003548995,0.00005302019],"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.000006212098,0.00051497354,0.0017845769,0.00014118211,0.000037171296,0.0000033949455,0.0008427876,0.003128095,0.014821935,0.0776165,0.21230938,0.6887938],"study_design_scores_gemma":[0.00031188375,0.000040831343,0.00019564413,0.00006166939,0.0000039460697,0.0000075295866,0.000083045335,0.32000077,0.012816345,0.000022911616,0.66626793,0.00018750975],"about_ca_topic_score_codex":0.00006151507,"about_ca_topic_score_gemma":0.000032216198,"teacher_disagreement_score":0.9753841,"about_ca_system_score_codex":0.000023491044,"about_ca_system_score_gemma":0.000028105656,"threshold_uncertainty_score":0.28742918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067648897,0.00008952038,0.98940736,0.00016268111,0.00011520093,0.00027609288,0.00005221636,0.00015803232,0.0029740026],"genre_scores_gemma":[0.9901217,0.0000057766397,0.009229679,0.000024106019,0.000006217074,0.00003895618,0.00040604832,0.0000048151055,0.0001626914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987798,0.000042798125,0.00025810098,0.000578076,0.00016937083,0.00017186956],"domain_scores_gemma":[0.9971372,0.0000138506075,0.00010494351,0.002614772,0.00008086774,0.00004834941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004133607,0.000091970796,0.0001227033,0.00004941218,0.00003562863,0.00009118932,0.0013050984,0.000043377087,0.0000034750046],"category_scores_gemma":[0.00002002881,0.000070571965,0.000007778879,0.000508093,0.00001805582,0.0008340045,0.00015898928,0.00006229928,0.000035368714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102651815,0.0011978304,0.042731065,0.0002774135,0.00011117708,0.00011074303,0.0024057168,0.0031307589,0.0014550156,0.87849206,0.0102927815,0.059692767],"study_design_scores_gemma":[0.0003057178,0.000041957366,0.050079804,0.00006077737,0.0000026858352,0.000029661973,0.00008982939,0.9454908,0.000050392344,0.00014404017,0.0035387685,0.00016557728],"about_ca_topic_score_codex":0.00095837604,"about_ca_topic_score_gemma":0.000335627,"teacher_disagreement_score":0.98335683,"about_ca_system_score_codex":0.000052954663,"about_ca_system_score_gemma":0.000047524576,"threshold_uncertainty_score":0.28778413},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030933857,0.0043608495,0.2880172,0.5141121,0.0018019781,0.0010391818,0.000056620323,0.0004130727,0.15926507],"genre_scores_gemma":[0.92078847,0.000018697412,0.078768924,0.00022193238,0.000006708227,0.0000102505055,0.0000015182303,0.0000021094197,0.00018140263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993983,0.00015501725,0.00017827541,0.000083446044,0.00011085398,0.00007408787],"domain_scores_gemma":[0.96316856,0.00018341208,0.00012093018,0.036409535,0.000096010874,0.000021568492],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00031967118,0.000043738983,0.00008421218,0.000015318416,0.00014803935,0.000028434695,0.040060192,0.000019913246,0.0000014202134],"category_scores_gemma":[0.002302499,0.00003075001,0.00006562565,0.00019131305,0.00010464185,0.000080806785,0.015795719,0.00007159596,0.000023126899],"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":[7.8151135e-7,0.00010875309,0.0013559733,0.000010915918,0.000019933557,2.9497771e-8,0.00036094172,0.000066752,0.0008743448,0.94370365,0.041711558,0.011786386],"study_design_scores_gemma":[0.0004840904,0.00004515287,0.034643784,0.00016897706,0.00001615872,0.0000139202575,0.00007321885,0.038766604,0.0015267448,0.26662046,0.65741915,0.00022177269],"about_ca_topic_score_codex":0.000020315172,"about_ca_topic_score_gemma":0.00001314211,"teacher_disagreement_score":0.8898546,"about_ca_system_score_codex":0.000010602485,"about_ca_system_score_gemma":0.000026446009,"threshold_uncertainty_score":0.9921643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48328474,0.0002010834,0.51596206,0.00014273824,0.00028825385,0.00005744218,9.870905e-7,0.000011871872,0.000050820654],"genre_scores_gemma":[0.98386544,0.000012651572,0.015884586,0.0000810756,0.00012973708,6.632077e-7,4.6191334e-7,0.0000049748055,0.000020407648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854684,0.00012367769,0.0006513338,0.00009687192,0.00039093537,0.00019033122],"domain_scores_gemma":[0.99869114,0.00015849502,0.0003948678,0.00022017221,0.0004909016,0.00004439435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150511,0.00010191728,0.00023623396,0.00003603353,0.0001689425,0.000060333237,0.00068709016,0.00004273638,0.000015773934],"category_scores_gemma":[0.0000370943,0.000066160705,0.00012064687,0.00019166572,0.00006818486,0.0013571624,0.000055243345,0.00025469085,0.0000072669072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010968667,0.00042858085,0.01121432,0.0007744178,0.0002940111,0.000014220701,0.013964199,0.061531734,0.07256723,0.0019599895,0.0013998309,0.83574176],"study_design_scores_gemma":[0.0020521535,0.0006347854,0.054430034,0.0009839124,0.00006688601,0.0013171341,0.0029992776,0.91684574,0.018865433,0.0010255504,0.00031658716,0.0004625323],"about_ca_topic_score_codex":0.0003352206,"about_ca_topic_score_gemma":0.0000016593347,"teacher_disagreement_score":0.85531396,"about_ca_system_score_codex":0.000040199775,"about_ca_system_score_gemma":0.00006897365,"threshold_uncertainty_score":0.26979554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025159672,0.0002976007,0.9672276,0.0008922895,0.00070317526,0.00089458394,0.00012973062,0.0040665073,0.000628862],"genre_scores_gemma":[0.90791035,0.0000040984387,0.09082018,0.0002797223,0.00017712617,0.0002484715,0.00019216162,0.000019735375,0.00034818065],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824077,0.000040738283,0.00036771697,0.00037644772,0.00024663197,0.00072769384],"domain_scores_gemma":[0.9980281,0.00009077119,0.00014897955,0.0013447902,0.00012580528,0.00026154157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237165,0.00021313225,0.0002725836,0.000039466006,0.00015786866,0.00016122057,0.0011583815,0.00012306675,0.0000026197265],"category_scores_gemma":[0.0002018496,0.00018243678,0.00020423626,0.0004000781,0.000028248856,0.0009099641,0.00025187098,0.00009937715,0.00006258075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010011213,0.0021980037,0.025229352,0.00037427893,0.00035189188,0.000019331359,0.0036090636,0.004358905,0.004023709,0.14693862,0.6391909,0.17360583],"study_design_scores_gemma":[0.00056007376,0.000075951735,0.0012125339,0.00003231472,0.000012479803,0.000012661333,0.000030336938,0.85197014,0.00036790772,0.00088680396,0.14452566,0.0003131258],"about_ca_topic_score_codex":0.00004764237,"about_ca_topic_score_gemma":0.000007880971,"teacher_disagreement_score":0.88275063,"about_ca_system_score_codex":0.000067369256,"about_ca_system_score_gemma":0.000069241665,"threshold_uncertainty_score":0.74395555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009938667,0.000046044966,0.9766058,0.00021947823,0.0003223244,0.00026006612,0.000013806598,0.00022914246,0.021309495],"genre_scores_gemma":[0.9212271,0.0000026070627,0.071362115,0.00033849507,0.00008865347,0.0001567602,0.00001743731,0.000007821195,0.0067990357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919385,0.000010457385,0.00016370864,0.00035979986,0.00009253663,0.00017965786],"domain_scores_gemma":[0.9988604,0.0000169074,0.000056588447,0.00086509675,0.00014057063,0.000060426028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018395158,0.000072045754,0.00009349572,0.000024028383,0.00008534067,0.000058395708,0.00054350647,0.00004459608,0.000033172033],"category_scores_gemma":[0.000020073769,0.00006031062,0.000047578793,0.00017054574,0.000011266955,0.00032959707,0.000056691963,0.000028165985,0.00009485816],"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.000018639903,0.00023619294,0.0022398022,0.00011588517,0.00002944636,0.0000041783182,0.001265284,0.000012160991,0.0008295587,0.730493,0.15955158,0.10520429],"study_design_scores_gemma":[0.0015535848,0.00036282383,0.017688612,0.00012448299,0.000014237994,0.000042654017,0.0003135706,0.2523086,0.038180795,0.018390153,0.670073,0.00094754243],"about_ca_topic_score_codex":0.00007308883,"about_ca_topic_score_gemma":0.000010838017,"teacher_disagreement_score":0.9202332,"about_ca_system_score_codex":0.000016209127,"about_ca_system_score_gemma":0.000023245282,"threshold_uncertainty_score":0.24593957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08551514,0.00028377573,0.72950476,0.00026696234,0.0011169028,0.0002712015,0.00000869551,0.0008880857,0.1821445],"genre_scores_gemma":[0.951019,0.0000026944947,0.04736016,0.0006961792,0.00007135596,0.000014579554,0.0000021744286,0.000010680065,0.0008232076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847597,0.000050902243,0.00033042248,0.00046056858,0.00026925537,0.00041286024],"domain_scores_gemma":[0.99884164,0.000030583218,0.00012474165,0.0007275012,0.000078273115,0.00019724372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025976993,0.00017651694,0.0002037469,0.00006056997,0.00017103933,0.00016118048,0.00089388475,0.00008760408,0.00013104976],"category_scores_gemma":[0.00004558692,0.00015090263,0.000070702656,0.0003514128,0.00008041371,0.0005302986,0.00022525563,0.00014988576,0.00027445555],"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.000006809919,0.00038045432,0.039826386,0.000087827626,0.00011114713,0.00026370698,0.010669505,0.00007296665,0.0026062226,0.7629021,0.038876906,0.14419596],"study_design_scores_gemma":[0.006892573,0.0014319529,0.31422153,0.00080799067,0.000073198986,0.0014290411,0.0009916102,0.43834767,0.026622357,0.086282894,0.11694388,0.0059553054],"about_ca_topic_score_codex":0.00085332367,"about_ca_topic_score_gemma":0.00010607971,"teacher_disagreement_score":0.86550385,"about_ca_system_score_codex":0.00005142993,"about_ca_system_score_gemma":0.00010806107,"threshold_uncertainty_score":0.61536306},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10531289,0.00037617618,0.3176666,0.0037936594,0.0005629666,0.13805333,0.000029649274,0.0015335124,0.43267125],"genre_scores_gemma":[0.9781019,0.000002409273,0.002355545,0.00027314143,0.000040610856,0.015561385,4.3522152e-7,0.000004347032,0.003660232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.00002002531,0.0001609073,0.00022127393,0.00014439286,0.00019158798],"domain_scores_gemma":[0.9995299,0.000012847955,0.000043118976,0.00027779336,0.000047029785,0.00008933501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011123863,0.00009222661,0.0001084884,0.000027413362,0.000106564905,0.0001413684,0.00034783917,0.000025007968,0.00009884139],"category_scores_gemma":[0.000005505978,0.00007214083,0.000018226496,0.00018727955,0.0000146893835,0.00049874577,0.00010051793,0.00006809037,0.00020186922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032791042,0.0012599919,0.002464646,0.00045371483,0.000039701077,0.00008869333,0.0016061564,0.00010673156,0.001588158,0.2772073,0.05964628,0.65550584],"study_design_scores_gemma":[0.002175003,0.00015362336,0.0002691454,0.000030438057,8.586885e-7,0.000044670283,0.000006382701,0.8519004,0.00089464965,0.000035678117,0.14433467,0.00015450947],"about_ca_topic_score_codex":0.0000057964794,"about_ca_topic_score_gemma":0.000002093133,"teacher_disagreement_score":0.872789,"about_ca_system_score_codex":0.000009137083,"about_ca_system_score_gemma":0.0000057838542,"threshold_uncertainty_score":0.29418173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17730853,0.00010135465,0.8027924,0.00091487844,0.0005267197,0.000660414,0.000010860529,0.00056061277,0.017124241],"genre_scores_gemma":[0.98308104,0.0000024873243,0.011707225,0.0017422244,0.00018189824,0.000061501545,0.000004467384,0.000014387769,0.0032047469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980725,0.000036661724,0.00030177043,0.0006288299,0.0005051357,0.00045510073],"domain_scores_gemma":[0.9986115,0.00012667765,0.000085096726,0.0007097473,0.00015574603,0.00031121614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014022559,0.00023300968,0.00029250272,0.0001141064,0.00023205687,0.00015346995,0.00095179153,0.000115441326,0.00003338854],"category_scores_gemma":[0.00013369844,0.00019151912,0.00005778707,0.0018472798,0.000059028964,0.00018362176,0.0001079798,0.00016394693,0.0003959796],"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.00046716438,0.0029862935,0.0016604075,0.00041590797,0.00016197232,0.0012812181,0.07400219,0.3825385,0.0020415904,0.10370611,0.29676822,0.13397044],"study_design_scores_gemma":[0.008123312,0.0030341714,0.015281971,0.0038778551,0.000037609934,0.001681699,0.0051440005,0.14221528,0.025067192,0.004040765,0.78525364,0.006242493],"about_ca_topic_score_codex":0.000099821744,"about_ca_topic_score_gemma":0.0000071496156,"teacher_disagreement_score":0.80577254,"about_ca_system_score_codex":0.000034265897,"about_ca_system_score_gemma":0.0002699464,"threshold_uncertainty_score":0.7809923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094194186,0.000113874084,0.9954614,0.0012066315,0.00002815062,0.0005179677,0.00001484779,0.00019944283,0.0015157543],"genre_scores_gemma":[0.86708665,0.000003942126,0.13175777,0.00016620258,0.000035739675,0.0003577549,0.000015993375,0.000006071327,0.0005699008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.000014754645,0.00021966193,0.00033190593,0.00009912126,0.00020204052],"domain_scores_gemma":[0.99951005,0.000013705694,0.000050246483,0.00032528798,0.000062861385,0.00003784956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002938835,0.00008347483,0.000119068674,0.000062501,0.0000653104,0.00008483678,0.000282933,0.000044084623,0.000008017132],"category_scores_gemma":[0.000012505847,0.00007213474,0.000027730966,0.00042193988,0.000010846462,0.00082868175,0.000016459655,0.000069219,0.00000689051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006263798,0.000718034,0.0005447701,0.0004943674,0.0000100627585,0.000014000368,0.00063524535,0.0018472557,0.14065793,0.039245587,0.015527671,0.8002424],"study_design_scores_gemma":[0.0012908168,0.00008388761,0.0005377947,0.00038639174,0.0000052349196,0.00009558975,0.00007818838,0.47282788,0.21694082,0.00070356455,0.30651915,0.0005306832],"about_ca_topic_score_codex":0.0000691314,"about_ca_topic_score_gemma":0.00015308405,"teacher_disagreement_score":0.8661447,"about_ca_system_score_codex":0.000042696538,"about_ca_system_score_gemma":0.00004773362,"threshold_uncertainty_score":0.29415694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01404976,0.00005784647,0.9663686,0.00006426809,0.00029614338,0.000108464155,0.0000043985565,0.00010166098,0.018948816],"genre_scores_gemma":[0.97297925,0.0000020024495,0.025509577,0.000102181104,0.000016424345,0.0000148597055,0.000002111538,0.0000029537339,0.0013706412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992594,0.000028060496,0.00018367701,0.00023297315,0.00014677779,0.00014910458],"domain_scores_gemma":[0.9996526,0.000014801877,0.000043603384,0.0001897578,0.000058214355,0.000041014475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013935482,0.00007676652,0.00010604443,0.000047490805,0.00003666591,0.000025853298,0.00026751857,0.000038411996,0.00012393683],"category_scores_gemma":[0.000007440385,0.000068376816,0.000046291138,0.00020603457,0.00002277764,0.00050262996,0.000015971546,0.000081128295,0.00007780894],"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.00011687938,0.0011346164,0.03654836,0.000105624866,0.00009471147,0.00027952224,0.0142737925,0.00070361583,0.002244809,0.7672475,0.0031805926,0.17407],"study_design_scores_gemma":[0.003121516,0.0001863066,0.90007955,0.00022209581,0.0000067127253,0.000087227614,0.0007378965,0.056086984,0.010324883,0.023324879,0.0048863045,0.00093561877],"about_ca_topic_score_codex":0.00021378545,"about_ca_topic_score_gemma":0.0001294686,"teacher_disagreement_score":0.9589295,"about_ca_system_score_codex":0.000033506167,"about_ca_system_score_gemma":0.000023832905,"threshold_uncertainty_score":0.27883255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027412156,0.00022450267,0.9718691,0.000036181762,0.000028624561,0.00019418252,0.000003554884,0.000027785836,0.00020392264],"genre_scores_gemma":[0.91539055,0.0000040619348,0.084064834,0.000048126065,0.0000027928309,0.000052696367,0.0000033904894,0.0000019067434,0.00043163332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930924,0.000012358785,0.0001465867,0.00027914072,0.000101361366,0.00015133023],"domain_scores_gemma":[0.99977124,0.000012897949,0.00003645478,0.00013255073,0.000012177284,0.00003468764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862587,0.00006465107,0.00008348472,0.000017045215,0.00005814981,0.000113495356,0.00012044538,0.00003232026,0.0000022107088],"category_scores_gemma":[0.00004397097,0.000059168895,0.000012541478,0.000089607245,0.000011206034,0.00037878682,0.000028648188,0.000036947866,0.000003136691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000316825,0.00027307693,0.25160637,0.00035426187,0.000011083179,0.000010077592,0.0040940824,0.007089889,0.00034982708,0.028142588,0.00029787142,0.7077392],"study_design_scores_gemma":[0.004900663,0.00011665865,0.12057246,0.00029386164,0.0000070471233,0.000022561886,0.00056242064,0.7983106,0.00038589293,0.025403203,0.04843982,0.0009848252],"about_ca_topic_score_codex":0.00001505969,"about_ca_topic_score_gemma":0.000022396476,"teacher_disagreement_score":0.8879784,"about_ca_system_score_codex":0.000045999015,"about_ca_system_score_gemma":0.000022640632,"threshold_uncertainty_score":0.24128376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011522323,0.000018462235,0.98682386,0.00020882826,0.0000445385,0.000058577763,0.0000136219105,0.000059584156,0.0012502245],"genre_scores_gemma":[0.96814775,9.761994e-7,0.031132918,0.00010659677,0.000008034933,0.0000053878316,0.000012997284,0.0000028218092,0.0005825012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917364,0.000034292116,0.00018402192,0.00022932822,0.0002647027,0.0001140365],"domain_scores_gemma":[0.99944156,0.00004139583,0.000098124525,0.00029952178,0.00008694977,0.000032464846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011339616,0.00008220812,0.00018434618,0.00016676364,0.000056517245,0.00006478774,0.00021308688,0.00002780266,0.000033258348],"category_scores_gemma":[0.0000073653964,0.000060330935,0.000055941753,0.0010964175,0.000019555198,0.0001494897,0.000015393802,0.000038918985,0.000007699453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010542948,0.00038311604,0.0020285684,0.000019318551,0.00047906593,0.000022381739,0.0006549934,0.39147258,0.0007219674,0.03816522,0.00094763516,0.56509465],"study_design_scores_gemma":[0.00019057938,0.00017760524,0.001306743,0.000017426264,0.000029484736,7.161078e-7,0.00001656552,0.99778634,0.00029879922,0.0000019662125,0.00009211539,0.00008167745],"about_ca_topic_score_codex":0.000040159128,"about_ca_topic_score_gemma":0.000080383696,"teacher_disagreement_score":0.95662546,"about_ca_system_score_codex":0.000024308638,"about_ca_system_score_gemma":0.0000101331125,"threshold_uncertainty_score":0.2460224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005818346,0.0000072360244,0.79973406,0.00083281175,0.00069164304,0.000030964697,7.177871e-7,0.0001765356,0.1927077],"genre_scores_gemma":[0.9702592,2.0041156e-7,0.023555972,0.0003608478,0.000059292175,0.0000030875988,2.5502885e-7,0.0000017874725,0.0057593966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996476,0.0000042204238,0.00006213094,0.00011439515,0.00007504375,0.00009660021],"domain_scores_gemma":[0.999575,0.000009530864,0.000021724853,0.0003316769,0.000020811567,0.000041255793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008079851,0.000035624977,0.000041400148,0.000013773136,0.00003045425,0.000081400474,0.00041624045,0.000020198439,0.00010637738],"category_scores_gemma":[0.0000078146,0.00002677719,0.000018822257,0.00011571109,0.0000094721445,0.00015089613,0.000038835613,0.00007120328,0.00036201143],"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":[1.4690298e-7,0.000012149104,0.0005379395,9.71144e-7,0.0000013988131,0.0000024112155,0.000030479003,8.078082e-7,0.0048101577,0.94010866,0.010027929,0.04446693],"study_design_scores_gemma":[0.000118971715,0.000008132641,0.0037288165,0.0000021371195,3.0967743e-7,0.000015684114,0.0000035233236,0.014531754,0.002606296,0.0034649302,0.975413,0.00010640515],"about_ca_topic_score_codex":0.000024570558,"about_ca_topic_score_gemma":0.000056289507,"teacher_disagreement_score":0.96538514,"about_ca_system_score_codex":0.0000015295504,"about_ca_system_score_gemma":0.000010547164,"threshold_uncertainty_score":0.46530452},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4369016,0.00041053165,0.556416,0.0017168313,0.00012392594,0.0003703973,0.000002861554,0.00012034749,0.003937534],"genre_scores_gemma":[0.97757834,0.000011911785,0.02166847,0.00059059175,0.000055939316,0.00005094083,0.000003883834,0.0000045524935,0.00003534097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988441,0.000074480464,0.00020314375,0.00026521928,0.0002671681,0.0003458794],"domain_scores_gemma":[0.9991046,0.00005984834,0.00006923958,0.0006750504,0.0000128521,0.00007836936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062589603,0.000117602256,0.000121923054,0.000035017296,0.00008798848,0.00012688158,0.0008379205,0.00005344228,0.000013292523],"category_scores_gemma":[0.0000033252534,0.00006555532,0.000028633332,0.00035837397,0.00003631462,0.00028624828,0.00009574088,0.00014172212,0.000056254645],"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.00008657385,0.0020980514,0.28002086,0.00022327091,0.00014460013,0.00010001317,0.008296677,0.03805865,0.0013126414,0.65674746,0.00032163828,0.012589564],"study_design_scores_gemma":[0.00211171,0.00056909025,0.4928599,0.00025649738,0.000040656807,0.00025574007,0.0015781492,0.43476704,0.0003689755,0.0010942526,0.064843304,0.0012546967],"about_ca_topic_score_codex":0.000099764686,"about_ca_topic_score_gemma":0.000015692765,"teacher_disagreement_score":0.65565324,"about_ca_system_score_codex":0.00001707213,"about_ca_system_score_gemma":0.000009671277,"threshold_uncertainty_score":0.26732683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1286341,0.027609898,0.34398293,0.015846035,0.0073082205,0.0017258994,0.000043262255,0.0015248463,0.4733248],"genre_scores_gemma":[0.9934733,0.00003496283,0.0007178239,0.000066192755,0.00006842928,0.000038344133,4.213438e-7,0.0000044010553,0.005596156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899566,0.000066513356,0.00022074353,0.00034808033,0.00014318564,0.00022583177],"domain_scores_gemma":[0.9994203,0.00007329022,0.000020772466,0.00033225305,0.00006794236,0.00008546268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019486315,0.00009441889,0.00015320476,0.00007235046,0.00008354624,0.00025174656,0.00020559733,0.000052976073,0.000023170125],"category_scores_gemma":[0.000072233976,0.00008008443,0.00001992269,0.00028285824,0.000053121665,0.00047114948,0.00006559545,0.000106288324,0.00008663108],"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.0000036224048,0.00051860884,0.0071091442,0.00032631133,0.000033273438,0.0000912479,0.0019923493,0.00040919226,0.00068225386,0.8673915,0.09681567,0.024626791],"study_design_scores_gemma":[0.00090701797,0.000114163246,0.010488356,0.0002851457,0.00000954003,0.00056309794,0.0008838951,0.7880414,0.00041424047,0.0006445356,0.19688617,0.00076241954],"about_ca_topic_score_codex":0.00038409815,"about_ca_topic_score_gemma":0.00009026911,"teacher_disagreement_score":0.866747,"about_ca_system_score_codex":0.000023622815,"about_ca_system_score_gemma":0.000010445683,"threshold_uncertainty_score":0.32657483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4941354,0.00012840396,0.5044112,0.00012870021,0.00014273426,0.0002572876,0.0000688283,0.00017611204,0.00055132585],"genre_scores_gemma":[0.9978874,0.0000064929663,0.0019025563,0.00003280244,0.000051586165,0.000019224599,0.000073171635,0.000011329274,0.000015446309],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975705,0.00015204454,0.0005531738,0.00070175296,0.000374319,0.00064822455],"domain_scores_gemma":[0.99860734,0.00026338547,0.00022051182,0.00063783926,0.0001321635,0.00013876693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068190915,0.00024821408,0.0003709017,0.00011257684,0.00050733297,0.00022502399,0.00049999816,0.00007943481,0.0000016754107],"category_scores_gemma":[0.00006966027,0.00021879312,0.00004471463,0.00081541605,0.00008092398,0.00029732968,0.00019210837,0.00029383806,0.000011328554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088806286,0.0010637834,0.4587919,0.0005431562,0.0001542523,0.00070665363,0.0023669994,0.28510013,0.00039913322,0.22846298,0.00581694,0.01650527],"study_design_scores_gemma":[0.0014927252,0.00018105574,0.14758544,0.0004490812,0.0000065452427,0.00026044104,0.00024321997,0.8451266,0.000042302217,0.00017587256,0.003941207,0.00049550406],"about_ca_topic_score_codex":0.00024593167,"about_ca_topic_score_gemma":0.000017369564,"teacher_disagreement_score":0.56002647,"about_ca_system_score_codex":0.00017191112,"about_ca_system_score_gemma":0.00007899533,"threshold_uncertainty_score":0.89221245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034576476,0.00017479462,0.9606889,0.00012423414,0.00027032802,0.0002723008,0.0000041135154,0.00006854234,0.0038202966],"genre_scores_gemma":[0.91519445,0.0000212748,0.084300905,0.0000720606,0.00004910186,0.000029518944,0.0000052866903,0.0000050172953,0.00032237536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907935,0.000008600983,0.00029462806,0.00021318828,0.00017405489,0.00023015692],"domain_scores_gemma":[0.9992629,0.0000615577,0.000102139275,0.00033478302,0.00019071014,0.00004789951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036705082,0.00008389297,0.00013905687,0.000031988737,0.00010690314,0.00004989459,0.00032035078,0.00004547955,0.00000660363],"category_scores_gemma":[0.000035501806,0.00007194646,0.000055147604,0.00028092318,0.000021991,0.00035700106,0.00005308642,0.000050821025,0.0000091505835],"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.000015693851,0.00015951289,0.0046304683,0.00013059881,0.00003158416,0.0000010903375,0.000507495,0.7740351,0.0010122956,0.127466,0.0006435409,0.09136665],"study_design_scores_gemma":[0.0006614338,0.00006665113,0.007930628,0.00009626884,0.000004915351,0.0000027783112,0.000011367767,0.98622274,0.000926386,0.00034312098,0.0036264616,0.00010724262],"about_ca_topic_score_codex":0.000039029524,"about_ca_topic_score_gemma":0.0000071004833,"teacher_disagreement_score":0.880618,"about_ca_system_score_codex":0.000032961423,"about_ca_system_score_gemma":0.000056350596,"threshold_uncertainty_score":0.29338917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06306172,0.00034735235,0.93306124,0.00088994106,0.00059097644,0.00018701302,0.00008881169,0.0002446239,0.0015282874],"genre_scores_gemma":[0.99415606,0.000013784171,0.0056023817,0.00004119021,0.0000730219,0.0000030673864,0.000052873645,0.00000840376,0.000049212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980043,0.0001414661,0.00053995306,0.0003735162,0.00043818002,0.0005025897],"domain_scores_gemma":[0.9980024,0.00028914103,0.00035904403,0.0009374224,0.0002958891,0.000116113595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484259,0.00019788285,0.00031678067,0.000035353987,0.0009827146,0.0001401503,0.0015523408,0.0000677904,0.000002888926],"category_scores_gemma":[0.00010127627,0.00015207309,0.00013803874,0.00085397676,0.00045170623,0.00017375134,0.00029959454,0.00020918252,0.000028530558],"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.000027211396,0.0002686932,0.007636001,0.000057111163,0.00013116808,0.00009885328,0.0011268306,0.00433863,0.0012485598,0.9432564,0.026316937,0.015493655],"study_design_scores_gemma":[0.0014959256,0.00016678705,0.083451614,0.0001654074,0.000014638564,0.00037965205,0.00026215377,0.82205546,0.0051572328,0.009829465,0.07622456,0.0007971154],"about_ca_topic_score_codex":0.00009183156,"about_ca_topic_score_gemma":0.000005048153,"teacher_disagreement_score":0.93342686,"about_ca_system_score_codex":0.000064073145,"about_ca_system_score_gemma":0.00013688976,"threshold_uncertainty_score":0.7558345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12875788,0.0020133173,0.8672697,0.00045216145,0.00074068835,0.00028724948,0.00004791556,0.00012908867,0.00030201586],"genre_scores_gemma":[0.98206896,0.00028944833,0.017196061,0.0003123355,0.00006980202,0.0000363522,0.000013043536,0.0000067195247,0.000007283939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801105,0.00016765934,0.00039233122,0.0007278832,0.00037541933,0.0003256578],"domain_scores_gemma":[0.9983532,0.0003225123,0.0003666354,0.000371405,0.00032128196,0.00026499902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043901868,0.00024524436,0.0002589154,0.000078215664,0.0006036941,0.00040051507,0.00045712825,0.00009150695,0.000004225006],"category_scores_gemma":[0.00033664444,0.00023073345,0.000041016592,0.00033072566,0.0002260046,0.0022103596,0.00015969013,0.0002518424,0.000015810465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061538456,0.0006170451,0.0004823038,0.00004207315,0.000040728024,0.00007962418,0.035352573,0.006691658,0.00036562938,0.035685502,0.000149257,0.9204321],"study_design_scores_gemma":[0.007943664,0.00089511444,0.0045112534,0.00017270588,0.00005999828,0.00032479386,0.008668326,0.9614691,0.00043805595,0.0032062747,0.011398577,0.0009121032],"about_ca_topic_score_codex":0.00023555341,"about_ca_topic_score_gemma":0.0000030232054,"teacher_disagreement_score":0.9547775,"about_ca_system_score_codex":0.000041569365,"about_ca_system_score_gemma":0.00010679238,"threshold_uncertainty_score":0.9409037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010635267,0.00022456385,0.9917703,0.0006273156,0.00035884042,0.00032944183,0.000006003681,0.0003259633,0.0052940147],"genre_scores_gemma":[0.49301732,5.0994896e-7,0.5059607,0.00012420579,0.00017725985,0.00008431657,0.00000650347,0.000007319451,0.0006218334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987148,0.000015099195,0.00026898706,0.0003068165,0.00019870659,0.0004955793],"domain_scores_gemma":[0.999328,0.0000830921,0.00009064244,0.00035751436,0.000081629114,0.00005910953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847479,0.00012749627,0.00016159753,0.000038733968,0.0002448223,0.00051078416,0.0004949516,0.00009109688,0.000006162026],"category_scores_gemma":[0.000023771292,0.00010646146,0.000098922435,0.00028635983,0.000022419374,0.00072388543,0.00009225705,0.00009171834,0.000016416705],"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.0000024258525,0.000041511656,0.00019173726,0.000022218288,0.0000049010164,0.0000027636634,0.00005389792,0.00010463906,0.000026940186,0.81189394,0.0018314003,0.18582362],"study_design_scores_gemma":[0.0013538218,0.00022554857,0.003263365,0.00040525477,0.000016684591,0.000058619135,0.00017595323,0.2598121,0.0026306703,0.082065344,0.64901,0.0009826273],"about_ca_topic_score_codex":0.00007247055,"about_ca_topic_score_gemma":0.000019792864,"teacher_disagreement_score":0.7298286,"about_ca_system_score_codex":0.000028324594,"about_ca_system_score_gemma":0.000035839585,"threshold_uncertainty_score":0.4925503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077994994,0.00087680895,0.9886703,0.0061862143,0.00057763746,0.0002280859,0.00011604289,0.00018787688,0.0023770994],"genre_scores_gemma":[0.67496127,0.000046617955,0.31839028,0.00053617766,0.0008955786,0.00006702741,0.0006881653,0.000028631415,0.004386235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784976,0.000036460257,0.0005228794,0.00065188843,0.0005211336,0.000417897],"domain_scores_gemma":[0.9986892,0.00012981398,0.0002182724,0.00025157988,0.00052343385,0.00018773743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032086443,0.00027039135,0.00032059048,0.00007785796,0.0002519281,0.00073093193,0.00069944665,0.00013795403,0.000011924075],"category_scores_gemma":[0.0000713766,0.00023969982,0.00010688283,0.00033813753,0.000038613143,0.00058397534,0.00016995965,0.00014115038,0.000011786572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009840329,0.0009966275,0.017640118,0.00047831592,0.0003695304,0.0001381679,0.0007745358,0.05767729,0.010892801,0.5719923,0.24389192,0.09416441],"study_design_scores_gemma":[0.0018039912,0.00007542222,0.0030419913,0.0001221851,0.00002658689,0.00009485984,0.000023750395,0.8210691,0.000065413355,0.013614608,0.15964942,0.00041267846],"about_ca_topic_score_codex":0.00037062948,"about_ca_topic_score_gemma":0.00003179935,"teacher_disagreement_score":0.7633918,"about_ca_system_score_codex":0.00013158782,"about_ca_system_score_gemma":0.00030753575,"threshold_uncertainty_score":0.9774675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006369099,0.0004349649,0.9891386,0.0004643239,0.0011739957,0.00074048317,0.0010831008,0.00020005382,0.00039537245],"genre_scores_gemma":[0.99734837,0.000013609531,0.0011349076,0.000041597443,0.00008038244,0.0007867831,0.00007249811,0.000014199273,0.00050764927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979036,0.000039691287,0.0006682166,0.00058344763,0.00028606,0.00051901035],"domain_scores_gemma":[0.9989438,0.00024067042,0.00010052406,0.0003686612,0.00018597314,0.00016038454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027680618,0.00027685653,0.00041608332,0.00016474872,0.00045388483,0.00040961232,0.00028591158,0.00019522951,0.0000031641212],"category_scores_gemma":[0.000011894569,0.00024162562,0.00013364342,0.0005229833,0.00010758879,0.0004798266,0.0000029529958,0.00021528703,0.000014310824],"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.00031019992,0.002338748,0.0005624203,0.001101213,0.00014161042,0.00008413667,0.00039623937,0.71585685,0.00059718767,0.26632655,0.010465234,0.0018196456],"study_design_scores_gemma":[0.0056183646,0.0006370812,0.002161868,0.0005355191,0.000070395225,0.00046023724,0.000555422,0.94654083,0.0004225995,0.0077573135,0.033933043,0.0013073432],"about_ca_topic_score_codex":0.00039285448,"about_ca_topic_score_gemma":0.00025902022,"teacher_disagreement_score":0.99097925,"about_ca_system_score_codex":0.00012312082,"about_ca_system_score_gemma":0.00009681494,"threshold_uncertainty_score":0.9853207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000434339,0.00004358805,0.9915655,0.00017551077,0.000045419958,0.006509529,7.6160666e-7,0.000067830515,0.0011575111],"genre_scores_gemma":[0.6655303,0.0000124706185,0.31332463,0.0004788457,0.00012165908,0.016853638,0.0000011084761,0.000019158615,0.0036581764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991779,0.000081858576,0.00017339025,0.00021989644,0.00015519343,0.00019176985],"domain_scores_gemma":[0.99940586,0.000084084946,0.000057744328,0.0003508854,0.00004633927,0.000055065568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036382035,0.000080417405,0.00012145282,0.000044026685,0.00030941085,0.00042571034,0.0003433478,0.000025168745,0.000023690449],"category_scores_gemma":[0.000011182334,0.00004905599,0.00004712087,0.0006597067,0.000025776682,0.00024123449,0.00007878464,0.00004775475,0.00001329829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047666614,0.0003927336,0.016625278,0.00016556492,0.0022588898,0.00017659634,0.0059204195,0.14461255,0.0041172802,0.21207325,0.024660284,0.5889495],"study_design_scores_gemma":[0.0001446483,0.000010464416,0.00022303521,0.0000051297056,0.0000126438035,0.0000064430906,0.000015280568,0.9853685,0.00010719554,0.0001001173,0.013928757,0.0000777688],"about_ca_topic_score_codex":0.00002511731,"about_ca_topic_score_gemma":0.0000058021296,"teacher_disagreement_score":0.84075594,"about_ca_system_score_codex":0.000015210649,"about_ca_system_score_gemma":0.000008118104,"threshold_uncertainty_score":0.41051346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004028943,0.000052838408,0.99449223,0.00026864285,0.00054249534,0.00022911337,0.000006260953,0.0000315137,0.00034797686],"genre_scores_gemma":[0.9679692,0.000009754872,0.031810366,0.000093082876,0.000022604843,0.00001083622,4.851644e-7,0.0000031650752,0.00008050061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994839,0.000017297012,0.00014276787,0.00013826035,0.000088053785,0.0001297099],"domain_scores_gemma":[0.99951565,0.000069166315,0.00008293266,0.00022354994,0.000088524524,0.00002019194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008210617,0.000061033075,0.00009529839,0.000019408848,0.000103718274,0.000035894784,0.00027067796,0.000038202157,0.0000072857633],"category_scores_gemma":[0.000007694483,0.000041065636,0.000055091976,0.00015879348,0.00003398725,0.00017128614,0.000040810828,0.000042551794,0.0000010597932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011987502,0.000041942418,0.000009537143,0.000023340572,0.0000843042,0.0000010448757,0.00059256935,0.034377184,0.00096063485,0.7480373,0.00033397254,0.21552621],"study_design_scores_gemma":[0.00018792796,0.000020337198,0.000020229862,0.0000129846785,0.0000060459092,0.000017546,0.0001489932,0.99787515,0.00026755332,0.0012661611,0.00012456713,0.000052508338],"about_ca_topic_score_codex":0.000043227363,"about_ca_topic_score_gemma":0.000015113275,"teacher_disagreement_score":0.96394026,"about_ca_system_score_codex":0.000026965154,"about_ca_system_score_gemma":0.0000066987755,"threshold_uncertainty_score":0.16746081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019293753,0.00010712641,0.99156386,0.0021817884,0.00036421325,0.00035204735,0.000048856302,0.00021706127,0.00497213],"genre_scores_gemma":[0.10319271,0.00003298853,0.8607563,0.0021201235,0.00014739066,0.00014882912,0.00003649792,0.000024404744,0.0335408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877095,0.00003795461,0.0002414685,0.000360175,0.00018862645,0.00040080058],"domain_scores_gemma":[0.9992634,0.00007721784,0.0000454138,0.00041299177,0.000060807604,0.00014018785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001431239,0.00013033925,0.00018628249,0.00003982433,0.00009977262,0.00017652796,0.00056990195,0.00006944628,0.00012194498],"category_scores_gemma":[0.000013185007,0.0001054855,0.000111945425,0.0001829723,0.000028930293,0.000261451,0.00008766111,0.000082619576,0.0001386692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046788455,0.00019044032,0.000014820159,0.000018957006,0.000028250412,0.000012175862,0.0004063722,0.000031546937,0.00005448273,0.039961252,0.06611389,0.89316314],"study_design_scores_gemma":[0.00083351886,0.000040798506,0.00004608785,0.000008778574,0.000002106347,0.000020065498,0.000005614717,0.8324206,0.000026568157,0.00073632225,0.1657212,0.0001383745],"about_ca_topic_score_codex":0.00000861534,"about_ca_topic_score_gemma":0.0000034385594,"teacher_disagreement_score":0.89302474,"about_ca_system_score_codex":0.000032910848,"about_ca_system_score_gemma":0.000011956754,"threshold_uncertainty_score":0.4301574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012662368,0.00020206136,0.90604055,0.00020312924,0.00034208375,0.000053096403,6.283294e-7,0.00019227884,0.09169993],"genre_scores_gemma":[0.96220535,7.0476653e-7,0.03641645,0.00019816197,0.00018284863,0.000003546252,0.000006429797,0.000002413909,0.000984115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936783,0.00001933773,0.00014509031,0.00016084671,0.00013857584,0.00016833369],"domain_scores_gemma":[0.9997043,0.00003122086,0.00004147543,0.00015103247,0.000046118254,0.000025842375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012270681,0.00005562067,0.00007525284,0.00003753234,0.00006708762,0.00012957706,0.0002340433,0.000025102101,0.0000048161314],"category_scores_gemma":[0.0000026254795,0.000047433383,0.000027877406,0.0008117838,0.0000068574946,0.0001925135,0.00004121379,0.00003234831,0.0001321131],"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":[4.6134795e-7,0.000022608938,0.0009111756,0.000003099615,0.00000224873,0.000004898493,0.0000048591255,0.018956646,0.0000113253645,0.84715563,0.1082953,0.024631731],"study_design_scores_gemma":[0.0002800198,0.000034143686,0.033593256,0.000011432167,0.0000015768418,0.000015680063,0.00000278659,0.8506077,0.000048708243,0.028016018,0.087189674,0.00019901479],"about_ca_topic_score_codex":0.00014074804,"about_ca_topic_score_gemma":0.000010936554,"teacher_disagreement_score":0.9609391,"about_ca_system_score_codex":0.000015049248,"about_ca_system_score_gemma":0.00001148441,"threshold_uncertainty_score":0.19342771},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044550795,0.0029584595,0.94359124,0.0015281404,0.0005104327,0.000084433545,0.000010675748,0.00007837615,0.006687425],"genre_scores_gemma":[0.99095005,0.00008117354,0.0076616844,0.0001500931,0.0004979842,0.000002292116,0.0000027399935,0.000007491654,0.0006464648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990006,0.00007131828,0.00020511528,0.00014245091,0.00031093965,0.0002695545],"domain_scores_gemma":[0.9992971,0.0000512622,0.00014599109,0.00038495735,0.00006065185,0.000060033868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051762845,0.000099799865,0.00011231731,0.00004122752,0.00036348982,0.00041051712,0.00073666614,0.000013331634,0.000012239369],"category_scores_gemma":[0.000006670561,0.000051613453,0.00004102362,0.0002672469,0.000044472046,0.0005108143,0.00007174981,0.00020086524,0.00004257617],"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.00009777313,0.00034406473,0.018325688,0.000045255863,0.00015838521,0.001493859,0.0012849439,0.0055979528,0.0061549633,0.608072,0.038400825,0.32002428],"study_design_scores_gemma":[0.0017286808,0.00019867279,0.06542601,0.00050730014,0.00003875882,0.012170225,0.00029613698,0.016400838,0.0028296139,0.007896343,0.89175975,0.0007476509],"about_ca_topic_score_codex":0.000056158216,"about_ca_topic_score_gemma":0.00001879866,"teacher_disagreement_score":0.9463993,"about_ca_system_score_codex":0.000024966132,"about_ca_system_score_gemma":0.00004399429,"threshold_uncertainty_score":0.3958626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02437422,0.0007923385,0.9715905,0.000031971555,0.00080346933,0.00047996017,0.00007258042,0.000044811295,0.0018101047],"genre_scores_gemma":[0.6149226,0.00025791043,0.338214,0.00010601776,0.00040945708,0.00017867736,0.0014116676,0.00011774642,0.044381928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880075,0.00003753575,0.000336405,0.00042191916,0.00019647012,0.00020688801],"domain_scores_gemma":[0.9990083,0.00003174574,0.00019436033,0.00040314958,0.0002864808,0.000075967735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021857716,0.00020162333,0.00034451747,0.00009785584,0.00018026026,0.00008888511,0.00036531148,0.00021654846,0.0000119201095],"category_scores_gemma":[0.000028891911,0.00019611478,0.000065594075,0.00020087717,0.00003293079,0.00022780444,0.00006725388,0.00011246726,0.0000041529975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000455671,0.001030586,0.000080579426,0.00437182,0.0005356057,0.0000874599,0.111159734,0.0033293823,0.07090686,0.24167983,0.006155363,0.5602071],"study_design_scores_gemma":[0.0011561638,0.0002887094,0.0017412268,0.0012415627,0.0000838472,0.00003591936,0.0026433824,0.9797647,0.0047197076,0.0007177887,0.0068450617,0.00076195033],"about_ca_topic_score_codex":0.0012177373,"about_ca_topic_score_gemma":0.0003022334,"teacher_disagreement_score":0.9764353,"about_ca_system_score_codex":0.000030549203,"about_ca_system_score_gemma":0.00015523515,"threshold_uncertainty_score":0.79973286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06640679,0.0006947338,0.89389473,0.005288931,0.00069356686,0.0002452018,0.000015061841,0.0005047784,0.032256182],"genre_scores_gemma":[0.9797336,0.000014924522,0.017844938,0.0005709556,0.00009190406,0.000007835996,0.0000026796527,0.0000060250163,0.0017271292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898446,0.000016371027,0.00019478708,0.00034919457,0.00020675182,0.0002484192],"domain_scores_gemma":[0.9990052,0.00002260136,0.000048415026,0.00071840646,0.00006547411,0.00013993251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014494857,0.000123455,0.00015319553,0.000038097296,0.000090516754,0.00025503107,0.00075996027,0.00007092866,0.000010045444],"category_scores_gemma":[0.000036929436,0.00010247854,0.000037297134,0.0002387411,0.00004084154,0.00035813212,0.00028474873,0.00009215463,0.00008206348],"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.000007687987,0.00018372705,0.0011767742,0.00007282836,0.000029757808,0.00015109703,0.0013420336,0.00028097932,0.00082201266,0.9392338,0.018832903,0.0378664],"study_design_scores_gemma":[0.014964148,0.000804542,0.18941668,0.000703347,0.000030571948,0.00096727884,0.000229776,0.047945816,0.005800058,0.18621933,0.5496742,0.0032442294],"about_ca_topic_score_codex":0.00024132311,"about_ca_topic_score_gemma":0.00009660239,"teacher_disagreement_score":0.9133268,"about_ca_system_score_codex":0.00003104097,"about_ca_system_score_gemma":0.000050056366,"threshold_uncertainty_score":0.41789535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11341445,0.00027272504,0.88139266,0.0016609824,0.0006201771,0.0005120241,0.000049940507,0.00045947483,0.0016175886],"genre_scores_gemma":[0.8465108,0.00000331169,0.15072499,0.00047267543,0.0020458777,0.000036259495,0.000088925306,0.000033973214,0.00008314968],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9951726,0.00036430915,0.00085707445,0.0013017432,0.0010856753,0.0012185769],"domain_scores_gemma":[0.99669576,0.00067071157,0.00031779407,0.0018191256,0.00021467629,0.00028196102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006567126,0.0006018156,0.00074450305,0.0002752546,0.0005186918,0.0006520985,0.0032095558,0.000215633,0.000015523385],"category_scores_gemma":[0.000051327363,0.0005105813,0.00028921693,0.0010064291,0.000122019264,0.0005437946,0.0015057853,0.00075460924,0.000100765945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002925665,0.00035677795,0.087101966,0.00012346714,0.00022078838,0.00034867722,0.0036388454,0.008422929,0.00336869,0.031880725,0.008539456,0.8559684],"study_design_scores_gemma":[0.0059256065,0.0015585975,0.383555,0.000824931,0.00011189014,0.00070793915,0.00009064218,0.20542695,0.017444007,0.2939994,0.08529277,0.005062273],"about_ca_topic_score_codex":0.00059786416,"about_ca_topic_score_gemma":0.0008160255,"teacher_disagreement_score":0.85090613,"about_ca_system_score_codex":0.0000909489,"about_ca_system_score_gemma":0.00012459913,"threshold_uncertainty_score":0.9997346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04350102,0.00012533674,0.95402265,0.00051451835,0.00018420177,0.001058448,0.00016959854,0.00010962529,0.00031461753],"genre_scores_gemma":[0.97158724,8.826986e-7,0.027024776,0.000017733972,0.000016651507,0.00021482051,0.0004133791,0.000008384865,0.00071614626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976851,0.00026631437,0.000865823,0.00036939836,0.0005404779,0.0002728828],"domain_scores_gemma":[0.99727637,0.00026447253,0.00030166435,0.00095823593,0.0011189607,0.00008032358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018292064,0.00015634285,0.000611027,0.00044776924,0.00009314477,0.00021645888,0.0009199163,0.00009676257,0.0000017497919],"category_scores_gemma":[0.00011918974,0.00014061462,0.00014906698,0.0016293644,0.000019470406,0.00044253873,0.000051238178,0.00005353546,0.000003536469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00020521521,0.0005654741,0.04962049,0.00026582732,0.00029173234,0.0000022423503,0.0008560737,0.65970105,0.0044599213,0.2790002,0.0032486035,0.0017831742],"study_design_scores_gemma":[0.0029279548,0.0000328174,0.046686262,0.000075424134,0.000067035835,0.0000013429731,0.00031044966,0.94768196,0.00026254653,0.000019482051,0.0017687356,0.00016598313],"about_ca_topic_score_codex":0.008835962,"about_ca_topic_score_gemma":0.0041137775,"teacher_disagreement_score":0.9280862,"about_ca_system_score_codex":0.00017103892,"about_ca_system_score_gemma":0.000037190635,"threshold_uncertainty_score":0.9977643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009977239,0.00063966267,0.972407,0.00042029872,0.0042035426,0.0004419334,0.000004661262,0.00043378078,0.021349339],"genre_scores_gemma":[0.46550265,0.0001466867,0.5300182,0.0015252795,0.0022895415,0.000026673993,0.000018864772,0.000108162065,0.00036397026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483126,0.00007336566,0.00083041587,0.0020614562,0.001175692,0.0010277854],"domain_scores_gemma":[0.9968478,0.00049318926,0.00056967326,0.0015755112,0.00026636978,0.00024743562],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010671266,0.00075001636,0.0007886872,0.0007043353,0.00056790706,0.0012383916,0.0026556114,0.00052756036,0.0000124577155],"category_scores_gemma":[0.000059540176,0.0007095617,0.00020271933,0.0010200812,0.00055975677,0.00082878687,0.0007214292,0.0012418934,0.000028753171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008627498,0.00004000664,0.00012876115,0.000052241485,0.000021757403,0.00021813474,0.0005095505,0.123914026,0.00003547802,0.030888624,0.000048444508,0.84413433],"study_design_scores_gemma":[0.0003926405,0.00017123976,0.00009596367,0.0012147786,0.000012282776,0.0002521579,9.3543815e-7,0.96950036,0.00013164434,0.017871568,0.009455019,0.0009013889],"about_ca_topic_score_codex":0.000014799683,"about_ca_topic_score_gemma":0.000034881334,"teacher_disagreement_score":0.84558636,"about_ca_system_score_codex":0.0005974031,"about_ca_system_score_gemma":0.00040280886,"threshold_uncertainty_score":0.9997984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056474023,0.0001446289,0.93801457,0.0011045461,0.003886646,0.00020147051,0.000006762691,0.000053363678,0.00011397203],"genre_scores_gemma":[0.58934814,0.0000019187949,0.4094641,0.0002464993,0.00088198035,0.0000027491512,7.55297e-7,0.000005540922,0.000048332593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969979,0.00006011874,0.0009630495,0.0005139848,0.00092447695,0.000540471],"domain_scores_gemma":[0.9970029,0.00012989536,0.0007297725,0.0006662448,0.0012702738,0.00020092016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020951473,0.0002129431,0.00043399964,0.00026969635,0.00034034043,0.00080574176,0.002806339,0.00006288027,0.000003157106],"category_scores_gemma":[0.000033271695,0.00017172411,0.00018186202,0.0010908945,0.0003567215,0.0020771914,0.00036432935,0.00019457497,0.000009565947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113435315,0.0011993732,0.0043192357,0.0002585522,0.0000893913,0.00014546614,0.00077158416,0.023034677,0.005820396,0.30218974,0.11103094,0.5510272],"study_design_scores_gemma":[0.0027682164,0.0013066615,0.026453106,0.00031715666,0.000019639187,0.0006743727,0.000008747827,0.8615613,0.0054703928,0.017109996,0.08355696,0.0007534433],"about_ca_topic_score_codex":0.000020587033,"about_ca_topic_score_gemma":0.0000023413822,"teacher_disagreement_score":0.8385266,"about_ca_system_score_codex":0.00014927368,"about_ca_system_score_gemma":0.00049463124,"threshold_uncertainty_score":0.7769787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1286558,0.0016854807,0.835767,0.032246005,0.00072520797,0.00056562,0.000007236699,0.00015768674,0.00018998835],"genre_scores_gemma":[0.99294895,0.00004016607,0.0067445273,0.00011544352,0.00007680041,0.00002391136,2.8427155e-7,0.0000095832675,0.00004035646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882716,0.000056460423,0.00045257967,0.00013756925,0.00018716788,0.0003390702],"domain_scores_gemma":[0.9984115,0.00018044404,0.0004827998,0.00061356154,0.00026888313,0.000042842366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012856693,0.00013851162,0.00025362277,0.00013746308,0.0004685251,0.00007782215,0.0015776255,0.00012533921,0.0000015370816],"category_scores_gemma":[0.00018421291,0.000070027774,0.000119061886,0.0007755032,0.00020289376,0.00017580976,0.00017793787,0.00042260916,0.0000040656796],"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.00020932448,0.0006494241,0.00025480991,0.00015728212,0.0005965442,0.0059456117,0.007104265,0.0043814597,0.0024262592,0.71088994,0.009489873,0.2578952],"study_design_scores_gemma":[0.008837979,0.0032842152,0.0002042826,0.00066165294,0.00030578696,0.16141497,0.010450642,0.006226501,0.022228658,0.062694766,0.722821,0.00086957356],"about_ca_topic_score_codex":0.00002923128,"about_ca_topic_score_gemma":0.00012730392,"teacher_disagreement_score":0.8642931,"about_ca_system_score_codex":0.00008774202,"about_ca_system_score_gemma":0.00011163087,"threshold_uncertainty_score":0.36035636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06483445,0.000056996512,0.92888695,0.00024250992,0.00054439023,0.00024711047,8.0993783e-7,0.00014994749,0.005036825],"genre_scores_gemma":[0.9384673,0.0000023920247,0.060970265,0.0003900891,0.00014417301,0.0000065093486,8.1942187e-7,0.0000066686903,0.000011735413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967451,0.000058352656,0.00042464744,0.00085813436,0.00084283936,0.0010709349],"domain_scores_gemma":[0.99832445,0.00016820504,0.000091491354,0.00091115775,0.00016725827,0.00033743787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028059022,0.00022827914,0.0002707058,0.00020495866,0.00024579169,0.00028514393,0.0023735997,0.00006822363,0.000011174668],"category_scores_gemma":[0.000020179965,0.00016954746,0.000040360916,0.0020125175,0.0013940927,0.0005619597,0.00059205934,0.00026954696,0.000041909843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002560744,0.00011886091,0.00066910434,0.000006992553,0.0000035033781,0.00021540742,0.00036351607,0.007181892,0.00007232917,0.905726,0.000030412897,0.08558636],"study_design_scores_gemma":[0.0006746168,0.0005084846,0.023011412,0.00013446364,0.000002410596,0.00015438348,0.000018596422,0.9694484,0.0005995471,0.004747571,0.0002863309,0.00041379884],"about_ca_topic_score_codex":0.000020980526,"about_ca_topic_score_gemma":0.00002220848,"teacher_disagreement_score":0.9622665,"about_ca_system_score_codex":0.00016644638,"about_ca_system_score_gemma":0.000118401935,"threshold_uncertainty_score":0.6913945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11621244,0.000047544974,0.8822971,0.00012697546,0.00065764604,0.00022385883,0.0000072885355,0.000115612405,0.00031151302],"genre_scores_gemma":[0.73548996,7.655611e-7,0.26442093,0.000011831054,0.000052537784,0.000010103566,0.0000036230479,0.0000036290653,0.0000066215907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979195,0.000023106813,0.00055938895,0.00042005826,0.0007460667,0.0003318541],"domain_scores_gemma":[0.99839544,0.000026526614,0.00039392858,0.00052820286,0.000549822,0.000106103515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262893,0.00012914886,0.0002604686,0.00020253008,0.0002083467,0.00013310004,0.0012599394,0.00004418311,6.8738814e-7],"category_scores_gemma":[0.000015908208,0.00012027228,0.00007981223,0.0018335317,0.00037138592,0.0011720365,0.00022651466,0.000085519394,0.0000072745484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003270481,0.00015414966,0.00071098236,0.00018860951,0.000010648468,0.000005223009,0.0011983169,0.0310924,0.009521787,0.8833013,0.000006469062,0.073806815],"study_design_scores_gemma":[0.0029036948,0.0007758458,0.05736948,0.0036555843,0.000023024359,0.00026857754,0.00029875207,0.8708648,0.05279542,0.0027480633,0.007081158,0.0012155832],"about_ca_topic_score_codex":0.000026825704,"about_ca_topic_score_gemma":9.4408733e-7,"teacher_disagreement_score":0.88055325,"about_ca_system_score_codex":0.00008058911,"about_ca_system_score_gemma":0.00034820873,"threshold_uncertainty_score":0.49045613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026337823,0.001358704,0.9944637,0.00023625535,0.00024211369,0.00044555185,0.000018147915,0.000050061433,0.0005516923],"genre_scores_gemma":[0.97505367,0.000031949305,0.02365946,0.000023243985,0.000026814685,0.00006281015,9.171798e-7,0.0000049592804,0.0011361843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911714,0.000042898082,0.00025836323,0.00024827092,0.0001510803,0.00018224507],"domain_scores_gemma":[0.9993684,0.0001040518,0.000071827264,0.00031148983,0.000075694,0.00006850245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022986442,0.00009458203,0.00019445806,0.000028488705,0.000053834647,0.00008027093,0.00034870472,0.00003648892,0.0000061694277],"category_scores_gemma":[0.000022596258,0.00007272153,0.000040344843,0.00013438825,0.000029469184,0.00023222783,0.000052304214,0.000027158887,0.0000061810456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464609,0.00020167488,0.00064726017,0.0008318656,0.000089605484,0.000011347382,0.0031300478,0.0033716953,0.003413413,0.9588335,0.012792855,0.016652053],"study_design_scores_gemma":[0.00034653692,0.00017449708,0.00032459624,0.00007833447,0.00000405787,0.000015208859,0.00010142979,0.99451685,0.00039493683,0.00026696283,0.0036329052,0.00014369184],"about_ca_topic_score_codex":0.0000516561,"about_ca_topic_score_gemma":0.0000013614958,"teacher_disagreement_score":0.99114513,"about_ca_system_score_codex":0.000011620603,"about_ca_system_score_gemma":0.000007787346,"threshold_uncertainty_score":0.2965498},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38228634,0.00007812803,0.6133829,0.000080757185,0.00020649793,0.000097290926,0.0000020984157,0.000043902117,0.0038220962],"genre_scores_gemma":[0.99888813,0.0000048108354,0.00087259605,0.000113724076,0.0000262254,0.000005422742,0.0000016011663,0.000004801392,0.00008270397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998738,0.000020527568,0.00046615326,0.00022891439,0.0002417468,0.00030469024],"domain_scores_gemma":[0.9993067,0.00002363306,0.00008718701,0.0003970133,0.00013000186,0.000055499757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068919495,0.000098710516,0.00019927941,0.000095369614,0.000028098588,0.000043623364,0.0005679668,0.00005818264,0.0000022372974],"category_scores_gemma":[0.000003936995,0.000085967244,0.000026051594,0.0005525706,0.0000055181117,0.00035209834,0.00010012166,0.00008195995,0.000022855667],"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.000038536542,0.00035774003,0.11681687,0.0012929579,0.00003902559,0.000064773296,0.004015482,0.8012216,0.0036538034,0.013159688,0.0003177874,0.05902172],"study_design_scores_gemma":[0.00027107476,0.000019429233,0.0031787576,0.00015000615,5.6907146e-7,0.00000976361,0.0001706882,0.9956376,0.00025645387,0.0000076336755,0.0001919355,0.00010610234],"about_ca_topic_score_codex":0.0018690209,"about_ca_topic_score_gemma":0.0004419249,"teacher_disagreement_score":0.61660177,"about_ca_system_score_codex":0.00003194793,"about_ca_system_score_gemma":0.000029744791,"threshold_uncertainty_score":0.35056424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15630063,0.000027731749,0.84158343,0.00013261297,0.0003087058,0.00009102123,0.000013405323,0.000038954444,0.0015034786],"genre_scores_gemma":[0.96399814,0.000006979169,0.035725538,0.000040649724,0.000024601135,0.000004153735,0.000005042703,0.0000038447815,0.00019108113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992069,0.00001544518,0.00022935816,0.00020838929,0.00020696373,0.00013295157],"domain_scores_gemma":[0.999597,0.000014288311,0.00005513135,0.00017959539,0.00008653084,0.0000674216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016121058,0.00008529822,0.00014457178,0.0000413255,0.000052754527,0.000045345052,0.00017606154,0.000060955634,0.00011405518],"category_scores_gemma":[0.000004605362,0.00007236472,0.000038687172,0.00012308346,0.000042127747,0.00036677482,0.000012014977,0.00007582227,0.0000023054433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009820297,0.0009832503,0.016045086,0.00057461835,0.00019661323,0.000029599221,0.005975141,0.03128845,0.5281828,0.099030994,0.002151413,0.3154438],"study_design_scores_gemma":[0.0012154696,0.00007162856,0.023955848,0.000035421286,0.000016123844,0.00008861302,0.000089260226,0.9159117,0.0520443,0.00041948326,0.005828578,0.00032360537],"about_ca_topic_score_codex":0.0001561677,"about_ca_topic_score_gemma":0.000063201805,"teacher_disagreement_score":0.8846232,"about_ca_system_score_codex":0.000006614872,"about_ca_system_score_gemma":0.000065930384,"threshold_uncertainty_score":0.29509476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04022816,0.00031286673,0.91792613,0.0000311493,0.0012562801,0.00019489648,0.00003123586,0.00030400383,0.0397153],"genre_scores_gemma":[0.9955892,0.0000012974896,0.0011751151,0.000049931306,0.00012961586,0.00003681881,0.000008435638,0.000004917526,0.0030047013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990418,0.00001838249,0.00020827635,0.00018211473,0.00020219525,0.00034725544],"domain_scores_gemma":[0.9992857,0.000016520857,0.000054481192,0.00042475364,0.000051224804,0.00016735119],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015261973,0.00009959141,0.00012312862,0.000029138211,0.000061053186,0.00017163402,0.00039052768,0.00003910056,0.00002909532],"category_scores_gemma":[0.000008459645,0.00007831491,0.00006147895,0.00024624582,0.0000069792763,0.0014257877,0.00012498291,0.000049096758,0.00089044333],"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.000007710852,0.00090797787,0.037193738,0.00009130636,0.00008258063,0.000019406845,0.0027133564,0.00016120363,0.00049006526,0.7698876,0.06635457,0.12209044],"study_design_scores_gemma":[0.00027518804,0.00006488859,0.001004168,0.000023206609,0.000001711031,0.000050570445,0.00015309236,0.015216198,0.00055205496,0.00006929162,0.98235255,0.00023709462],"about_ca_topic_score_codex":0.0000042886772,"about_ca_topic_score_gemma":0.0000013806758,"teacher_disagreement_score":0.955361,"about_ca_system_score_codex":0.000032283904,"about_ca_system_score_gemma":0.00001664852,"threshold_uncertainty_score":0.99988747},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012744041,0.8774224,0.09841989,0.0018147007,0.004178206,0.0017016957,0.000015696156,0.0005730405,0.014599952],"genre_scores_gemma":[0.9715771,0.00795847,0.013636498,0.0029435235,0.0010855554,0.00046502857,0.000023603032,0.000041530653,0.0022686732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751496,0.00033958716,0.0007667638,0.0003756641,0.0004162016,0.00058680883],"domain_scores_gemma":[0.9974944,0.00013361042,0.00023584503,0.001778357,0.00012109423,0.00023667635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019018175,0.0002507224,0.0005984182,0.000033824766,0.00022246795,0.00033347975,0.0017032062,0.00007397693,0.000017300714],"category_scores_gemma":[0.0006241701,0.00019329895,0.00012152118,0.00053409755,0.000017874745,0.0011313085,0.0003548033,0.00017365266,0.0008248834],"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.0000015819861,0.0004345718,0.01973277,0.02160632,0.0002512485,0.00006236458,0.0020547276,0.00018595446,0.0023303232,0.3157282,0.42902258,0.20858936],"study_design_scores_gemma":[0.0002623902,0.00004265598,0.0005492105,0.011179542,0.000025882584,0.00056256144,0.000048642607,0.0027295293,0.00005739547,0.000017411303,0.98388374,0.00064103736],"about_ca_topic_score_codex":0.000094232215,"about_ca_topic_score_gemma":8.187031e-7,"teacher_disagreement_score":0.9703027,"about_ca_system_score_codex":0.000057717054,"about_ca_system_score_gemma":0.00005465246,"threshold_uncertainty_score":0.9999531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60463494,0.0007275941,0.39169726,0.0015346851,0.00031466188,0.00008543678,0.000004543857,0.00006971178,0.00093119894],"genre_scores_gemma":[0.99308646,0.00002400667,0.006248422,0.00030148617,0.00024423553,0.0000044966423,0.000001195256,0.000004586886,0.00008511425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902254,0.00009444966,0.00017004649,0.00012732958,0.00022057169,0.0003650408],"domain_scores_gemma":[0.99942595,0.000049742797,0.00012053087,0.00019339821,0.00006059361,0.00014981008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822414,0.00009959012,0.00014114952,0.000019058036,0.0004523919,0.00039797506,0.00040029408,0.000036065157,0.000020083758],"category_scores_gemma":[0.000024031231,0.0000516688,0.00003191752,0.00015721242,0.00006244627,0.00082722,0.00010583498,0.00029234352,0.000020350639],"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.00049761496,0.0016052963,0.31686607,0.00025061148,0.0009279888,0.00042463568,0.023181189,0.015517805,0.079574876,0.35461658,0.06424127,0.14229605],"study_design_scores_gemma":[0.0024176058,0.00051852956,0.7311139,0.0007597424,0.000045821438,0.0066627213,0.00055904104,0.23309268,0.00046950445,0.007669544,0.015759625,0.00093127886],"about_ca_topic_score_codex":0.0000067980004,"about_ca_topic_score_gemma":0.0000012224281,"teacher_disagreement_score":0.41424784,"about_ca_system_score_codex":0.000026777127,"about_ca_system_score_gemma":0.00002515196,"threshold_uncertainty_score":0.38376826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087870704,0.000008717207,0.8500372,0.00047207193,0.00018820073,0.000020246147,2.1083353e-7,0.00012081673,0.1482738],"genre_scores_gemma":[0.98380476,3.0556782e-7,0.0133337155,0.00044520033,0.00004506976,0.000002846482,3.9435795e-7,0.0000012559524,0.002366453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996352,0.000014483317,0.00006708967,0.00011707255,0.00007149998,0.00009463441],"domain_scores_gemma":[0.9996337,0.000014947644,0.000014448206,0.00028135243,0.000017973747,0.00003755597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111301,0.000033862798,0.00004889018,0.000010674215,0.000028761517,0.000065618086,0.00034575508,0.000014367641,0.000018728413],"category_scores_gemma":[0.000009117905,0.00002598662,0.000017759286,0.00008209945,0.0000057692328,0.00014052693,0.00004393863,0.000021717346,0.0004297415],"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":[1.2772675e-7,0.000008550065,0.00022892978,0.0000017333546,0.0000012232789,4.6446988e-7,0.000026360922,0.000015257438,0.00009281537,0.9175678,0.013228734,0.06882801],"study_design_scores_gemma":[0.00015660712,0.00002906915,0.0035430738,0.000005126418,4.003943e-7,0.0000059489084,0.000003950656,0.17054924,0.00062515045,0.0042455625,0.82072735,0.00010853128],"about_ca_topic_score_codex":0.00001253811,"about_ca_topic_score_gemma":0.0000020867026,"teacher_disagreement_score":0.9829261,"about_ca_system_score_codex":0.000003847638,"about_ca_system_score_gemma":0.000005368079,"threshold_uncertainty_score":0.5523601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042376206,0.0011233013,0.9538879,0.00020895588,0.00034402043,0.00024622725,0.000009462626,0.00018007455,0.03976244],"genre_scores_gemma":[0.9940294,0.000027936778,0.0052814637,0.000052189334,0.0000058248816,0.00004266735,0.000026290389,0.0000042305383,0.00052997883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998928,0.00013439525,0.0003060775,0.00023236325,0.00016306697,0.0002360599],"domain_scores_gemma":[0.998912,0.00004560426,0.000071379756,0.0008557856,0.000056503093,0.000058734153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058356725,0.000093562005,0.00015779365,0.00004861148,0.00007467407,0.00019903193,0.0006425695,0.000061008926,0.0000083520345],"category_scores_gemma":[0.00003558217,0.000083279956,0.000026737389,0.0006076041,0.000016952077,0.00043856225,0.00006277567,0.00010654886,0.000071772905],"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":[8.7061403e-7,0.0000705675,0.0030209643,0.000013949921,0.0000031870009,0.0000046415025,0.000057063968,0.0013279896,0.000060978688,0.98926777,0.005930335,0.00024169868],"study_design_scores_gemma":[0.0015747915,0.000068104644,0.011066232,0.00024961837,0.0000031933384,0.00006490927,0.00039403434,0.28279054,0.00023169468,0.0054158834,0.69753855,0.0006024095],"about_ca_topic_score_codex":0.00049836765,"about_ca_topic_score_gemma":0.000058646838,"teacher_disagreement_score":0.9897918,"about_ca_system_score_codex":0.00006915843,"about_ca_system_score_gemma":0.000025463927,"threshold_uncertainty_score":0.3396058},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008124429,0.0004746457,0.98828214,0.000092267735,0.0011567364,0.00087614334,0.000102382925,0.00027767706,0.00061354623],"genre_scores_gemma":[0.94302756,0.000013794656,0.05596103,0.000050236868,0.00010713644,0.00008581298,0.000008215857,0.000020372301,0.00072585756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975091,0.00011436396,0.00077663956,0.000779353,0.00024412342,0.00057642435],"domain_scores_gemma":[0.9978752,0.0005425579,0.00032564282,0.00084937195,0.00019466564,0.00021256442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017497675,0.0003257582,0.0006861094,0.00045232236,0.000611713,0.0003730871,0.000697203,0.00015318736,0.0000016449936],"category_scores_gemma":[0.000011144351,0.0002984301,0.00025298417,0.0008848173,0.000045833134,0.00038285257,0.00002129053,0.00020815078,0.000012786131],"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.00010452972,0.00024537122,0.0004180071,0.00025486972,0.001783922,0.000014081259,0.0016819539,0.6940205,0.0003889121,0.038985178,0.000105952175,0.2619967],"study_design_scores_gemma":[0.00056838855,0.0002808496,0.0021302416,0.0000960903,0.00015556854,0.00005037165,0.0004956845,0.9859699,0.0001240739,0.000020476855,0.009738553,0.00036978634],"about_ca_topic_score_codex":0.00062391715,"about_ca_topic_score_gemma":0.000040471652,"teacher_disagreement_score":0.9349031,"about_ca_system_score_codex":0.00024085738,"about_ca_system_score_gemma":0.00008901518,"threshold_uncertainty_score":0.9999468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02172386,0.00011255668,0.97032684,0.000028700439,0.00023171371,0.00024467846,0.00013240083,0.00013367849,0.00706555],"genre_scores_gemma":[0.99654764,0.0000019309257,0.0027901193,0.000035722784,0.000014168121,0.00006980066,0.0001641703,0.0000070331353,0.0003693975],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980091,0.00010847901,0.00046053703,0.0004731885,0.00040921802,0.0005394943],"domain_scores_gemma":[0.9989173,0.000041866708,0.00015905187,0.0006470705,0.00011808866,0.00011665979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102293,0.00020110187,0.00041130473,0.00019984474,0.00012368748,0.00029768547,0.0005379904,0.00007600516,0.00009430541],"category_scores_gemma":[0.000028241606,0.00015156507,0.00007865916,0.0030534274,0.000025323323,0.0010607087,0.00006797677,0.000124043,0.000022054359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008452269,0.00078231015,0.37582713,0.00033226176,0.0012589019,0.00059214095,0.0009866804,0.27617434,0.00009664465,0.3319619,0.007006027,0.004897101],"study_design_scores_gemma":[0.0027367084,0.0001662817,0.079809576,0.00018140604,0.0001252111,0.000071610484,0.0005893352,0.8857249,0.00012893624,0.00012819473,0.02927932,0.001058546],"about_ca_topic_score_codex":0.0003994085,"about_ca_topic_score_gemma":0.00025511152,"teacher_disagreement_score":0.9748238,"about_ca_system_score_codex":0.00010270995,"about_ca_system_score_gemma":0.00007054982,"threshold_uncertainty_score":0.6180644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008049029,0.00033701805,0.9861316,0.000041594336,0.0003386805,0.00017595851,0.000012129645,0.00005593975,0.004858047],"genre_scores_gemma":[0.97171307,0.000025368512,0.025435532,0.0000069472953,0.0000066911102,0.000008738102,8.1957e-7,0.0000036517877,0.0027991564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.000024133287,0.00027983,0.00018675659,0.00016765788,0.00016789978],"domain_scores_gemma":[0.99948144,0.000011577434,0.00005579476,0.0003812645,0.000031414507,0.000038529586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012498006,0.00007409207,0.0001363415,0.000082924926,0.00003417416,0.000043868782,0.00027435337,0.000025594509,0.00003595397],"category_scores_gemma":[5.210064e-7,0.0000689198,0.00003310436,0.00047837288,0.000013056004,0.00029490242,0.000022713035,0.000046009038,0.000021302694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010688602,0.0023045933,0.0020133364,0.0020287402,0.0002754975,0.0007031663,0.0031109336,0.32920313,0.0019988143,0.5986658,0.0023788102,0.0573065],"study_design_scores_gemma":[0.00030799222,0.0000088773995,0.00024644536,0.00016966033,0.000004620196,0.000012082724,0.00026888563,0.99705386,0.000338476,0.0000075179514,0.0014869814,0.0000945722],"about_ca_topic_score_codex":0.0004319611,"about_ca_topic_score_gemma":0.000009426881,"teacher_disagreement_score":0.96366405,"about_ca_system_score_codex":0.000027922284,"about_ca_system_score_gemma":0.0000036131087,"threshold_uncertainty_score":0.2810468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056475993,0.00019238771,0.9329313,0.00032155417,0.0008584272,0.00036488616,0.000033367458,0.00030599203,0.008516088],"genre_scores_gemma":[0.97704184,0.0000305729,0.022300716,0.000035144833,0.000016987791,0.00002976522,0.000037525453,0.0000098682085,0.00049758307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853843,0.00005099198,0.0003561446,0.00040510553,0.0002823085,0.00036702407],"domain_scores_gemma":[0.99904966,0.00006653258,0.0000860558,0.0006592281,0.000041512612,0.000097019816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030552666,0.0001468862,0.00022746556,0.00009102556,0.00005754385,0.00019881362,0.0006455526,0.000046260946,0.000007878871],"category_scores_gemma":[0.000020892223,0.0001316325,0.000033607586,0.0004451801,0.000020883524,0.0005709865,0.00013059698,0.000098964236,0.0003169928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001228876,0.00052709994,0.00044096005,0.0003699751,0.000083989966,0.0010421434,0.0016082899,0.4169639,0.0031628204,0.568553,0.0027290848,0.0043959077],"study_design_scores_gemma":[0.0036365849,0.000099624325,0.00094770896,0.000314143,0.000004309028,0.000028894256,0.0001714873,0.9925528,0.000024572937,0.00045426466,0.0013711428,0.0003944223],"about_ca_topic_score_codex":0.002489902,"about_ca_topic_score_gemma":0.00025777964,"teacher_disagreement_score":0.92056584,"about_ca_system_score_codex":0.00020432712,"about_ca_system_score_gemma":0.00010596968,"threshold_uncertainty_score":0.5367818},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0289127,0.00050717,0.8784269,0.00020785142,0.00020195589,0.0002861451,0.000007993399,0.00011252118,0.091336764],"genre_scores_gemma":[0.97190017,0.0000014751331,0.0274651,0.00003900684,0.00006306137,0.000046471378,0.0000021748585,0.0000029007956,0.00047963436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99913627,0.000015800953,0.00026262895,0.00014422541,0.00023394325,0.00020715098],"domain_scores_gemma":[0.99919343,0.00004879204,0.000115891635,0.00046870296,0.00009619163,0.00007699407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048195207,0.00006313681,0.00010099861,0.000030718762,0.00006231161,0.000024071034,0.000453225,0.000032892127,0.00005296398],"category_scores_gemma":[0.00002249608,0.000052908454,0.000038294133,0.00026371444,0.000020246458,0.00041418796,0.00006954083,0.00005047623,0.00013065075],"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.0000027231513,0.00041934318,0.010267742,0.00011364113,0.000017809305,4.6100533e-7,0.0011673822,0.00019892192,0.023239054,0.74095595,0.0049762046,0.21864076],"study_design_scores_gemma":[0.0014132127,0.00018709464,0.72816855,0.00019711429,0.00002963386,0.000043434127,0.0008754644,0.062439587,0.028563978,0.007612793,0.16924201,0.0012271365],"about_ca_topic_score_codex":0.000036484962,"about_ca_topic_score_gemma":0.0000023203825,"teacher_disagreement_score":0.9429875,"about_ca_system_score_codex":0.0000129473665,"about_ca_system_score_gemma":0.000031133153,"threshold_uncertainty_score":0.2157544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000701307,0.00066223467,0.97661775,0.0005097408,0.0027319894,0.00045643817,0.00003334862,0.00028742285,0.018630967],"genre_scores_gemma":[0.621608,0.00009494928,0.36797148,0.004509334,0.0022972247,0.000018740586,0.00004172473,0.00012034646,0.0033381593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941771,0.00005268953,0.0008284489,0.002205269,0.0015758014,0.0011606623],"domain_scores_gemma":[0.9960968,0.0005710442,0.00044937947,0.0020168442,0.0005282686,0.00033770216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014977518,0.00081971654,0.00086897536,0.0008956503,0.0003567317,0.00077885063,0.0037146634,0.0005819779,0.000016806833],"category_scores_gemma":[0.00010065795,0.0007386432,0.00024492826,0.0010387136,0.0008931743,0.0007704482,0.0013147171,0.0011726245,0.0001808346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115533985,0.000060696413,0.00009159977,0.000046412322,0.000037048678,0.00095605536,0.0016192154,0.020592924,0.000218689,0.047661223,0.00022455395,0.92848],"study_design_scores_gemma":[0.0011859849,0.00057313516,0.0016657816,0.0024220294,0.000035167683,0.0008601113,0.0000031228187,0.8488101,0.0040899827,0.07733533,0.05914801,0.0038712758],"about_ca_topic_score_codex":0.00012263287,"about_ca_topic_score_gemma":0.0008645295,"teacher_disagreement_score":0.92460877,"about_ca_system_score_codex":0.0004678957,"about_ca_system_score_gemma":0.00060451846,"threshold_uncertainty_score":0.9995065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37803158,0.00020263043,0.60815597,0.0003127785,0.00058714533,0.00033468343,0.00009377139,0.00011553226,0.012165902],"genre_scores_gemma":[0.99619174,0.000008767721,0.0035516822,0.00013951994,0.000011856125,0.0000017653749,0.000011514215,0.000006978672,0.00007616567],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982615,0.00004421819,0.0007200029,0.00026922885,0.00036827318,0.00033676586],"domain_scores_gemma":[0.99861115,0.00022721877,0.00040581328,0.00037558985,0.0002726351,0.00010760705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062065094,0.00016107837,0.00044527117,0.0000727859,0.00004143588,0.000045953562,0.00059955847,0.00008267817,0.000015017346],"category_scores_gemma":[0.00005849857,0.00013743388,0.0000983549,0.00030977375,0.00011182918,0.00034760937,0.000078194505,0.00010139979,0.0000012090918],"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.000049937476,0.00016565692,0.004119256,0.00016595774,0.00014421737,0.000012646982,0.0012570869,0.00003650172,0.61872745,0.36709815,0.00084914616,0.007373999],"study_design_scores_gemma":[0.018086908,0.0016358458,0.042261124,0.0006670711,0.000112467824,0.00011825202,0.0065130726,0.08444295,0.79021364,0.008019601,0.045316175,0.0026128895],"about_ca_topic_score_codex":0.00008412137,"about_ca_topic_score_gemma":0.00001659892,"teacher_disagreement_score":0.6181601,"about_ca_system_score_codex":0.000039623017,"about_ca_system_score_gemma":0.00006804853,"threshold_uncertainty_score":0.5604391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065241405,0.000038607326,0.9888684,0.0017704805,0.00017646234,0.00034872477,0.000018892772,0.00015428402,0.00797173],"genre_scores_gemma":[0.9767763,0.0000010825374,0.021467328,0.0010459826,0.000051237905,0.000042942123,0.000010062268,0.0000023486564,0.0006027037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915,0.000014026742,0.00018570348,0.0003578277,0.00011559099,0.00017689889],"domain_scores_gemma":[0.99907327,0.00008898811,0.000066391636,0.0006095843,0.000099337936,0.0000624303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018992557,0.000085614745,0.00012413466,0.000024338464,0.00007398102,0.00009815472,0.0004001966,0.000037100046,0.000007838264],"category_scores_gemma":[0.00008716441,0.000071169066,0.000052878204,0.00010280271,0.000008967285,0.00014800052,0.000007466463,0.000041388488,0.00003860685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012925464,0.00006414675,0.0000031336085,0.0000036015588,0.000003883735,0.0000011997491,0.000023532684,0.0014835632,0.00026891544,0.9116783,0.014128458,0.0723283],"study_design_scores_gemma":[0.0015398933,0.0006215093,0.000741317,0.000024201976,0.0000049852374,0.0000097024395,0.0000041105723,0.96139264,0.00050352677,0.007897034,0.02704796,0.00021314439],"about_ca_topic_score_codex":0.000002092716,"about_ca_topic_score_gemma":1.4819031e-7,"teacher_disagreement_score":0.97612387,"about_ca_system_score_codex":0.000021400137,"about_ca_system_score_gemma":0.000024719644,"threshold_uncertainty_score":0.29021904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07069963,0.000048529782,0.92532307,0.0002282296,0.00039159527,0.00035034367,0.000008397805,0.0003909114,0.0025592926],"genre_scores_gemma":[0.90435845,4.0647785e-7,0.09500293,0.00021959803,0.00008760218,0.000008981813,0.000016231326,0.000008761781,0.00029704356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982439,0.00002228004,0.0003626533,0.0004323034,0.00034195866,0.00059685134],"domain_scores_gemma":[0.9988688,0.000024711684,0.0000737786,0.000591404,0.0001439682,0.00029734257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584049,0.00016806248,0.00021920186,0.00006476579,0.000127217,0.00026737078,0.0007603264,0.00007756556,0.000015114523],"category_scores_gemma":[0.000025247013,0.00014263888,0.000077132936,0.0010770423,0.000025618945,0.0003079131,0.00020787054,0.00009240801,0.0001351745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105846906,0.0011576931,0.016988965,0.00015824188,0.0001941737,0.00057013374,0.0022062801,0.0014470147,0.018786455,0.35412967,0.010850173,0.59340537],"study_design_scores_gemma":[0.0029012123,0.0004211327,0.017800637,0.00032598263,0.000023891065,0.00028814474,0.0003942115,0.40895334,0.013630312,0.0013052538,0.55202955,0.0019263045],"about_ca_topic_score_codex":0.00015390984,"about_ca_topic_score_gemma":0.00003762372,"teacher_disagreement_score":0.8336588,"about_ca_system_score_codex":0.00013656303,"about_ca_system_score_gemma":0.000060622253,"threshold_uncertainty_score":0.58166444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20445684,0.00026711944,0.7862973,0.0060591926,0.0021603233,0.00028957796,0.00006125793,0.000010862537,0.00039748385],"genre_scores_gemma":[0.937017,0.000002118254,0.061896376,0.0002829199,0.0001611843,0.0000012959724,9.0235153e-7,0.0000049212117,0.00063324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912894,0.000020095598,0.00043264564,0.00006456374,0.00020955015,0.00014420834],"domain_scores_gemma":[0.99856824,0.000115129194,0.0004168944,0.000598215,0.0002563473,0.000045152534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084383215,0.000055774235,0.0001350146,0.0000477382,0.00007336475,0.000047646998,0.0017688398,0.000025305731,0.000016940763],"category_scores_gemma":[0.00020066912,0.000034895944,0.0001712776,0.00016277467,0.000027141255,0.00024054889,0.00019123498,0.00007155233,0.0000037954626],"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.00030776463,0.001511227,0.010029204,0.00016055339,0.000665778,0.000058645906,0.006752077,0.0011851182,0.13388155,0.012402586,0.77776855,0.055276908],"study_design_scores_gemma":[0.010694247,0.0014242694,0.16880113,0.0006529665,0.00016819708,0.0007584433,0.00066478545,0.030603748,0.04791854,0.017138027,0.7203968,0.0007788637],"about_ca_topic_score_codex":0.0000036453253,"about_ca_topic_score_gemma":0.0000061479655,"teacher_disagreement_score":0.7325602,"about_ca_system_score_codex":0.0000291714,"about_ca_system_score_gemma":0.000047739428,"threshold_uncertainty_score":0.32869738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004191307,0.000100002944,0.9593288,0.000036143527,0.00031543776,0.00018326195,0.00013156496,0.00012769345,0.035585836],"genre_scores_gemma":[0.98211575,0.0000228632,0.016322764,0.000010418996,0.000031370997,0.000010132067,0.00013265104,0.000006460056,0.0013476163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877465,0.000078184625,0.0003995717,0.00027599707,0.00027142404,0.00020017875],"domain_scores_gemma":[0.998686,0.00006294609,0.00016599397,0.0008278973,0.00017063638,0.00008648411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061404763,0.000098767116,0.00018878268,0.0000529749,0.00004407157,0.00007124394,0.00045130434,0.000046970985,0.000030390565],"category_scores_gemma":[0.000048627473,0.00008446354,0.00003945744,0.0005166783,0.000026382904,0.0003183139,0.000039191127,0.00004575996,0.00013865408],"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.000002874002,0.000089968285,0.00025980032,0.000040008017,0.000012224819,0.000006699384,0.000040740033,0.00012404037,0.02458668,0.962886,0.011485573,0.0004653912],"study_design_scores_gemma":[0.0029288584,0.00028342762,0.013219318,0.00045606538,0.000036331894,0.00022079355,0.0006390042,0.2887713,0.10966445,0.0014314136,0.5806161,0.0017328993],"about_ca_topic_score_codex":0.00013396914,"about_ca_topic_score_gemma":0.0000017984936,"teacher_disagreement_score":0.9779244,"about_ca_system_score_codex":0.000032071996,"about_ca_system_score_gemma":0.000043619788,"threshold_uncertainty_score":0.34443235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043068573,0.00003894361,0.8642771,0.00044815947,0.00026351277,0.000068058376,0.0000027927358,0.00019167013,0.091641165],"genre_scores_gemma":[0.991753,1.8528836e-7,0.0053585568,0.00007213975,0.00003596883,0.0000040952477,0.0000024963615,0.000001282104,0.0027722684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994413,0.000013026363,0.00013077815,0.00016885078,0.00012365558,0.00012237794],"domain_scores_gemma":[0.9995788,0.000008566221,0.000025575619,0.00032930894,0.000031569005,0.000026190484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001200647,0.000045854555,0.0000615653,0.000010952956,0.00003449062,0.0000330786,0.0003055888,0.000019724006,0.000029272076],"category_scores_gemma":[0.0000035558892,0.000036509045,0.00003044882,0.00013599647,0.000006542478,0.00018916668,0.00004394671,0.000025449479,0.00011713767],"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":[9.85696e-7,0.00016893962,0.069170944,0.000009626255,0.0000039342726,0.0000103422235,0.000021441869,0.000092596965,0.0003025578,0.88430786,0.033103757,0.012807016],"study_design_scores_gemma":[0.0004213221,0.000028314033,0.7338844,0.000010529657,0.0000015166598,0.000019499317,0.000007862667,0.022907183,0.0012330373,0.045824178,0.19535728,0.00030487176],"about_ca_topic_score_codex":0.00028411445,"about_ca_topic_score_gemma":0.000031102994,"teacher_disagreement_score":0.94868445,"about_ca_system_score_codex":0.000011963113,"about_ca_system_score_gemma":0.000013971514,"threshold_uncertainty_score":0.15056069},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053421136,0.0000183067,0.94534963,0.0003631131,0.00008139374,0.00024094625,0.000116287134,0.00008026421,0.00032893266],"genre_scores_gemma":[0.9396549,0.0000016363697,0.0601412,0.000052144595,0.000010653175,0.000024871588,0.00007058919,0.0000035801208,0.00004042133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991231,0.000024476672,0.00028068034,0.00021959176,0.00018963948,0.00016251075],"domain_scores_gemma":[0.9993865,0.0000079431875,0.000064389475,0.00029543557,0.00019129121,0.000054435102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009718134,0.000095263415,0.00014100633,0.0000400157,0.000103709805,0.000086517124,0.00025664005,0.000027078788,0.000022810927],"category_scores_gemma":[0.0000055302257,0.00007248167,0.00003969039,0.00035517474,0.000043294116,0.0003904273,0.000045133605,0.000042864554,0.000010731449],"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.000022309465,0.0006831128,0.0063938373,0.00008462484,0.00021842738,0.00006062383,0.0030177615,0.034223445,0.019252846,0.92641467,0.0007586215,0.008869693],"study_design_scores_gemma":[0.064133555,0.0045414674,0.26573986,0.0008193901,0.00028007128,0.0010125532,0.013986505,0.1865434,0.44337076,0.0033904354,0.011721067,0.004460937],"about_ca_topic_score_codex":0.0017481298,"about_ca_topic_score_gemma":0.0021188261,"teacher_disagreement_score":0.92302424,"about_ca_system_score_codex":0.00004756547,"about_ca_system_score_gemma":0.00025087615,"threshold_uncertainty_score":0.29557166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26162994,0.00006705917,0.7049472,0.00011517058,0.00015756254,0.00046356977,0.000022473936,0.00016880232,0.03242825],"genre_scores_gemma":[0.94197524,1.4407404e-7,0.05781081,0.000044365835,0.00009686445,0.00001087442,0.000022030279,0.000010063649,0.000029586803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974482,0.000053292202,0.00083621155,0.0004302798,0.0004217841,0.00081024267],"domain_scores_gemma":[0.9989037,0.00009934792,0.00029424104,0.00036088986,0.00023228163,0.00010954323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073095446,0.00023596534,0.00043121132,0.00015018735,0.00018547532,0.0001770495,0.0007883508,0.00007203308,6.1448367e-7],"category_scores_gemma":[0.00009062229,0.00017846595,0.00008237796,0.0011076537,0.00004238042,0.00087862724,0.00043588798,0.00019756317,0.000007300355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080976155,0.0018024748,0.022932025,0.0008032296,0.00006361063,0.00015275809,0.0028683052,0.39173892,0.0038627055,0.4872485,0.0011482708,0.08729822],"study_design_scores_gemma":[0.0009919007,0.00024841962,0.09706724,0.00034496188,0.000005741801,0.00012947412,0.00018072732,0.8977798,0.0012195329,0.0006512326,0.0009291566,0.00045177757],"about_ca_topic_score_codex":0.0006670601,"about_ca_topic_score_gemma":0.00006813064,"teacher_disagreement_score":0.68034536,"about_ca_system_score_codex":0.000087751796,"about_ca_system_score_gemma":0.00012331612,"threshold_uncertainty_score":0.727763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5267986,0.0005120285,0.461327,0.0011804885,0.0003476113,0.00077009964,0.00004764332,0.000092382914,0.008924136],"genre_scores_gemma":[0.99956954,0.0000040528075,0.00024138235,0.00004288372,0.000011245469,0.000049035014,0.0000043860186,0.0000022882616,0.00007518042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982679,0.0002537386,0.00052709726,0.00031008315,0.00034021307,0.00030099106],"domain_scores_gemma":[0.9989122,0.00026859433,0.00012292733,0.00059286127,0.00006802319,0.000035358575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333287,0.000100970734,0.00020594147,0.000063372216,0.00004797221,0.00012637932,0.00089061586,0.000048928094,0.000020774687],"category_scores_gemma":[0.00016978184,0.00007087635,0.00003849792,0.0010779954,0.00006969762,0.00028376188,0.000088429246,0.00014385095,0.00002458381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021260048,0.0018028775,0.24354514,0.0003024274,0.000019238956,0.00015631452,0.016917642,0.12125525,0.0004574755,0.59838134,0.012874598,0.0042664106],"study_design_scores_gemma":[0.0004682034,0.000055689055,0.046389468,0.00016768025,0.0000012015711,0.000016302232,0.00097461714,0.948876,0.00006672854,0.00028663845,0.002550212,0.00014726556],"about_ca_topic_score_codex":0.00056329294,"about_ca_topic_score_gemma":0.00008526443,"teacher_disagreement_score":0.82762074,"about_ca_system_score_codex":0.000052372827,"about_ca_system_score_gemma":0.00001476817,"threshold_uncertainty_score":0.28902537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16316132,0.0012773435,0.8313874,0.0002362384,0.0007998488,0.0004958628,0.000025074818,0.00029966864,0.0023172293],"genre_scores_gemma":[0.97911674,0.000034582787,0.020405985,0.000116107105,0.00004356021,0.00008056146,0.00002772583,0.000007295608,0.00016746769],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986219,0.00008049979,0.00028560788,0.0005043304,0.00023607415,0.0002716283],"domain_scores_gemma":[0.9992009,0.000038916012,0.00009038587,0.0004324567,0.00010006836,0.00013727292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016794875,0.00016372591,0.00020578658,0.000028504177,0.0001457818,0.00045033076,0.00031282872,0.000073498435,0.000024509294],"category_scores_gemma":[0.000019385012,0.0001397471,0.000042121264,0.00021643397,0.00006128572,0.00036241143,0.00004310065,0.000097578675,0.000045728575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004436282,0.00038405674,0.0015354718,0.000030900923,0.000055884873,0.0000139143085,0.0011394293,0.000041497784,0.004894688,0.0637834,0.0014952685,0.9266211],"study_design_scores_gemma":[0.0036450396,0.0003252665,0.06006643,0.00014225823,0.000027388753,0.000073539035,0.00022925157,0.44065368,0.01601473,0.0036108352,0.47396705,0.0012445091],"about_ca_topic_score_codex":0.00015697394,"about_ca_topic_score_gemma":0.000018401648,"teacher_disagreement_score":0.92537653,"about_ca_system_score_codex":0.00002723186,"about_ca_system_score_gemma":0.000052889493,"threshold_uncertainty_score":0.5698722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003585352,0.000038978073,0.9378104,0.00041325402,0.00013608683,0.00018002206,0.0000031576787,0.00008082316,0.05775188],"genre_scores_gemma":[0.9790972,8.496648e-7,0.017583665,0.00009555025,0.000019908468,0.000025314614,0.0000021612168,0.0000033637803,0.003172004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992502,0.000023442743,0.0002010312,0.0002375681,0.00010310758,0.00018466167],"domain_scores_gemma":[0.99961925,0.00001957008,0.000029122752,0.00028035708,0.000023165005,0.000028562758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015086064,0.000070638314,0.00011645265,0.000049616392,0.000060847786,0.0002714046,0.000760864,0.000035864403,0.00003553626],"category_scores_gemma":[0.000001717754,0.00006271001,0.000026601567,0.0003491863,0.000011316503,0.0006307093,0.000038682418,0.000070300215,0.000057106045],"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.000017777043,0.0011431709,0.011244907,0.00004427207,0.000023035975,0.00015485901,0.0010698073,0.017598286,0.004636612,0.780667,0.009834382,0.17356588],"study_design_scores_gemma":[0.0058999327,0.000094602125,0.107498206,0.00025671333,0.0000068218146,0.00008548273,0.00030040543,0.7213428,0.010518021,0.01761314,0.1351653,0.0012186011],"about_ca_topic_score_codex":0.0042366004,"about_ca_topic_score_gemma":0.002227567,"teacher_disagreement_score":0.97551185,"about_ca_system_score_codex":0.000032004427,"about_ca_system_score_gemma":0.000028220533,"threshold_uncertainty_score":0.64045006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32495755,0.00026685983,0.6743159,0.00007325821,0.0002231581,0.00008081628,0.0000076210395,0.000011076545,0.00006376127],"genre_scores_gemma":[0.972165,0.00002176528,0.027623935,0.00001867052,0.00014352099,4.7129518e-7,0.000014212284,0.0000041747703,0.000008263003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986486,0.00002768647,0.000756179,0.00012885785,0.00023297612,0.00020574089],"domain_scores_gemma":[0.9982255,0.00015447594,0.0008545712,0.00013186276,0.000549487,0.00008411688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244339,0.00010350096,0.00027518233,0.00009195692,0.00012399234,0.00005594218,0.00029634213,0.00006446159,6.7528566e-7],"category_scores_gemma":[0.00007591651,0.000089404726,0.00007336124,0.0002884739,0.00003095875,0.00036246463,0.0000547315,0.00009759998,3.74681e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058257615,0.0004827842,0.04239114,0.0013949288,0.0002490953,0.000042548323,0.0022432688,0.2983942,0.0043498776,0.02521218,0.0031254862,0.6215319],"study_design_scores_gemma":[0.001546231,0.0003687663,0.030477677,0.00034108263,0.00002015245,0.00017629885,0.00020884216,0.9645787,0.0010804656,0.0003184807,0.00070981425,0.00017350916],"about_ca_topic_score_codex":0.0000033310582,"about_ca_topic_score_gemma":8.526167e-7,"teacher_disagreement_score":0.6661845,"about_ca_system_score_codex":0.000044418714,"about_ca_system_score_gemma":0.000060740404,"threshold_uncertainty_score":0.36458188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007066027,0.00045398079,0.98943144,0.0013307551,0.000063994754,0.00026232796,0.000037352096,0.00012778124,0.001226341],"genre_scores_gemma":[0.8877237,0.0000110610645,0.11165972,0.00022406953,0.000025054802,0.000018511737,0.00006514876,0.000005239712,0.0002674835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992688,0.000013568149,0.00017605005,0.00021677605,0.00010537082,0.00021948582],"domain_scores_gemma":[0.999168,0.00007791053,0.00005552831,0.0005284195,0.000091911395,0.000078257624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542525,0.0000878351,0.000115610754,0.0000313459,0.00014854604,0.00011047159,0.00041958125,0.00006451803,0.0000018269003],"category_scores_gemma":[0.000025450367,0.00007276746,0.00003242358,0.00020353124,0.000026928828,0.00016511731,0.00010632716,0.00008326467,0.0000026285486],"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.000047091307,0.00013748194,0.00094572315,0.00013221812,0.00004681317,0.000007832655,0.0011759899,0.001330666,0.003138417,0.90249187,0.023962718,0.06658321],"study_design_scores_gemma":[0.0013682403,0.00013188427,0.008586712,0.00008662961,0.00000929514,0.000058867932,0.00014825238,0.17992707,0.002291077,0.035810947,0.771146,0.00043500596],"about_ca_topic_score_codex":0.000045630048,"about_ca_topic_score_gemma":0.000054850912,"teacher_disagreement_score":0.8806577,"about_ca_system_score_codex":0.000017381137,"about_ca_system_score_gemma":0.000013505567,"threshold_uncertainty_score":0.2967371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14524384,0.00016843101,0.8457818,0.000055008997,0.0000785029,0.00008858217,0.0000034765162,0.000014726827,0.00856564],"genre_scores_gemma":[0.9885091,0.0000012876402,0.011386441,0.0000051880597,0.000015707075,0.0000030988344,0.0000038827516,0.0000011058916,0.00007417407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926174,0.000052746356,0.00019233966,0.00010488882,0.00033657308,0.00005173428],"domain_scores_gemma":[0.99945825,0.000018530482,0.00009461522,0.00013847661,0.00027931848,0.000010804052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089532573,0.00004008085,0.00008506505,0.00003453627,0.000018677822,0.000020668065,0.00010503744,0.000023054716,0.000004576907],"category_scores_gemma":[0.000023034389,0.00003170981,0.000016052974,0.00012731331,0.000014749115,0.00022458613,0.000023911069,0.000023234265,5.7481907e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022280815,0.00010297654,0.001079815,0.000027565775,0.000015260712,4.349743e-7,0.00054514495,0.003514584,0.046938013,0.17875701,0.00088324683,0.7681337],"study_design_scores_gemma":[0.0002598002,0.00002647095,0.014636638,0.000029936698,0.000008504463,0.0000024609833,0.000039283776,0.96673477,0.014175,0.0039249877,0.00011451749,0.00004763021],"about_ca_topic_score_codex":0.0007927919,"about_ca_topic_score_gemma":0.00007315235,"teacher_disagreement_score":0.9632202,"about_ca_system_score_codex":0.000013945032,"about_ca_system_score_gemma":0.000029368215,"threshold_uncertainty_score":0.12930885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050704,0.0001239487,0.2758267,0.0001236101,0.00008384473,0.00026207577,0.000009436139,0.00008431485,0.018415699],"genre_scores_gemma":[0.95909977,0.0000123412565,0.040558748,0.0000084064195,0.0000030468873,0.000011678639,0.0000028048935,0.000002684091,0.00030051603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99925905,0.000053840078,0.00027545443,0.00022506253,0.00008588352,0.00010069005],"domain_scores_gemma":[0.99944735,0.00003084016,0.00011047819,0.0003194995,0.0000615613,0.000030257806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002049447,0.000069623406,0.00013154009,0.000086820044,0.000026671547,0.000022268448,0.0002067924,0.000042932646,0.000010003696],"category_scores_gemma":[0.000021517058,0.000057856898,0.000019061712,0.0001830415,0.00007354574,0.00011193235,0.000034594093,0.000035977806,0.00001209365],"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.000039309733,0.0005674675,0.10505604,0.00014987032,0.00002913098,0.0000070545557,0.010429029,0.000028932693,0.26439068,0.5521666,0.00032974742,0.06680617],"study_design_scores_gemma":[0.00023075672,0.000031167314,0.92258537,0.000026764432,0.0000018266933,0.0000052989767,0.00010295819,0.07253892,0.0035513192,0.0007094358,0.000118019736,0.0000981401],"about_ca_topic_score_codex":0.0003767203,"about_ca_topic_score_gemma":0.000085788204,"teacher_disagreement_score":0.8175294,"about_ca_system_score_codex":0.000007873722,"about_ca_system_score_gemma":0.000023194603,"threshold_uncertainty_score":0.23593359},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008997499,0.0010934699,0.9938079,0.00082645245,0.00007742068,0.0005135831,0.000013950934,0.00080267683,0.0019647672],"genre_scores_gemma":[0.99543,0.00005554319,0.0034485983,0.00003218987,0.000016545591,0.0006026371,0.000009191786,0.0000032666755,0.00040205798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992629,0.000012561883,0.00019025766,0.00025659744,0.00010290446,0.00017476844],"domain_scores_gemma":[0.99930656,0.00003177804,0.00004952179,0.00047170752,0.00009219422,0.00004824716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006978572,0.00008997247,0.00011794687,0.000041678533,0.000087540975,0.000365707,0.00049644173,0.000059187983,0.0000050542335],"category_scores_gemma":[0.000011392844,0.000067826004,0.000017806662,0.0003051344,0.000049162732,0.0003164843,0.00019527753,0.00006166908,0.00020713556],"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":[1.5979805e-7,0.000034891746,0.00066309137,0.000028352808,0.000013531824,0.0000011073707,0.000051287196,0.00006077429,0.00019045931,0.7932236,0.010657878,0.19507486],"study_design_scores_gemma":[0.00029991154,0.00007143027,0.0044336445,0.00007338916,0.000006882989,0.00009717563,0.0031231195,0.1522435,0.0015009014,0.01615001,0.82136786,0.00063220767],"about_ca_topic_score_codex":0.00014777177,"about_ca_topic_score_gemma":0.000002909971,"teacher_disagreement_score":0.9945302,"about_ca_system_score_codex":0.000020051919,"about_ca_system_score_gemma":0.00001072553,"threshold_uncertainty_score":0.3526521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004529046,0.0002597646,0.9903265,0.00012833219,0.00038341768,0.00027242344,0.000012474654,0.00064591644,0.007518265],"genre_scores_gemma":[0.8904907,0.0000016085858,0.10620891,0.00018077785,0.00009425128,0.000098188175,0.0000014770401,0.00000816699,0.0029159335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989266,0.00001595202,0.00020887067,0.0003199471,0.00017007312,0.00035857563],"domain_scores_gemma":[0.9992864,0.00006506873,0.00006728064,0.00036421555,0.0001150957,0.00010195319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018673466,0.00012045381,0.00016590345,0.000039553295,0.0001504158,0.00025279092,0.0006001257,0.00006955606,0.000010367937],"category_scores_gemma":[0.000048686452,0.00010393611,0.00006855283,0.00019540024,0.000010517482,0.0003400088,0.00008593218,0.00005504886,0.000073874995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035465364,0.00056407263,0.0021911731,0.0061360896,0.00017922302,0.00019519133,0.01068064,0.011973062,0.0030409826,0.19438472,0.08357841,0.687041],"study_design_scores_gemma":[0.00047212097,0.000039785817,0.00008543895,0.000097934295,0.000002590105,0.000055073626,0.00014292295,0.98104894,0.00048065733,0.00003932733,0.017346585,0.00018861608],"about_ca_topic_score_codex":0.000026175227,"about_ca_topic_score_gemma":0.000009920101,"teacher_disagreement_score":0.96907586,"about_ca_system_score_codex":0.00007243583,"about_ca_system_score_gemma":0.000016407717,"threshold_uncertainty_score":0.42383915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041304142,0.0006857587,0.9980353,0.0003745012,0.00012467154,0.00015496586,0.000058004975,0.000043333926,0.000110396555],"genre_scores_gemma":[0.992401,0.000022688231,0.0073649054,0.00004762538,0.000026967391,0.000024528148,0.0000016544103,0.0000024038025,0.00010824802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994987,0.000013408844,0.00013707398,0.00014257939,0.00009343862,0.00011479591],"domain_scores_gemma":[0.9995605,0.000105329105,0.00004806896,0.00019499022,0.000060722123,0.00003042033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105619496,0.000059141807,0.00009007283,0.000014600871,0.00009254428,0.00004875932,0.00020321914,0.000031676216,0.000003467535],"category_scores_gemma":[0.000008485661,0.000036994257,0.000034675508,0.00015219241,0.000051840452,0.00012413741,0.00004360143,0.000032158994,0.000002793451],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6579485e-7,0.000019723437,0.0000071986096,0.000006900839,0.000009523474,4.0126264e-7,0.000052376003,0.00004396774,0.00019602373,0.0029550183,0.0006051147,0.99610287],"study_design_scores_gemma":[0.0002476552,0.0000472696,0.0010823276,0.000007287368,0.0000037764007,0.000012021392,0.000061270206,0.97493756,0.0026762995,0.00021472921,0.020654019,0.000055815657],"about_ca_topic_score_codex":0.00004467,"about_ca_topic_score_gemma":0.000014021108,"teacher_disagreement_score":0.9960471,"about_ca_system_score_codex":0.000008920282,"about_ca_system_score_gemma":0.0000031657403,"threshold_uncertainty_score":0.1508582},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69076735,0.00011191221,0.2961792,0.000043779357,0.00011835442,0.0002558997,0.000001094958,0.000074168085,0.012448247],"genre_scores_gemma":[0.9989326,0.0000022332902,0.00092673895,0.000012087638,0.00001746873,0.0000074676773,4.2947931e-7,0.0000027335384,0.000098225064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930215,0.00009366375,0.00017326177,0.00017625572,0.00014008446,0.00011457847],"domain_scores_gemma":[0.9995719,0.00007754585,0.000112290945,0.00018237284,0.000039237246,0.000016647333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027650243,0.00006730083,0.0001730419,0.0000481301,0.000025501726,0.000016332368,0.00007477251,0.000025916415,0.0000035241137],"category_scores_gemma":[0.000011558151,0.000047468726,0.00002194947,0.0006191814,0.000015113751,0.00012284514,0.000012613323,0.00005281757,0.0000024366307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011587848,0.0010431028,0.059337877,0.0017329563,0.00013247204,0.00006387379,0.0031547444,0.197424,0.029395716,0.014505784,0.0038007682,0.68824995],"study_design_scores_gemma":[0.0011320497,0.001989155,0.0101770405,0.0006715937,0.0000056204603,0.00004027197,0.000006402108,0.965381,0.01981944,0.00005289234,0.0005735244,0.00015101166],"about_ca_topic_score_codex":0.00012940141,"about_ca_topic_score_gemma":0.000051492054,"teacher_disagreement_score":0.76795703,"about_ca_system_score_codex":0.000018706016,"about_ca_system_score_gemma":0.0000049618807,"threshold_uncertainty_score":0.19357185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2660544,0.00010706175,0.7317538,0.00008946019,0.0005126006,0.00060745026,0.00037072727,0.00019781396,0.00030668097],"genre_scores_gemma":[0.9291422,0.0000032978826,0.070324756,0.00003374329,0.000049655973,0.0000042153574,0.0002281159,0.000020648173,0.0001933787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971756,0.0004275181,0.0004203907,0.0008558731,0.0005556862,0.0005649521],"domain_scores_gemma":[0.9975164,0.00014132098,0.000500891,0.00089030527,0.0005893195,0.00036177106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013754567,0.00031553264,0.000574731,0.00024251542,0.00064689765,0.00013687329,0.0017481088,0.0002760161,0.000023684584],"category_scores_gemma":[0.00004177349,0.0003635901,0.00026634705,0.0007077223,0.00010706065,0.0016018018,0.00024334996,0.00026441592,0.000055786935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067890044,0.011400888,0.14128572,0.0046897205,0.0033294589,0.0011743923,0.11057486,0.13268623,0.09284757,0.33158952,0.012568737,0.1510639],"study_design_scores_gemma":[0.0067141275,0.0012790344,0.20218493,0.00040424283,0.00018909234,0.00012402843,0.0035357547,0.7688689,0.0028505283,0.0017164209,0.010601243,0.0015316501],"about_ca_topic_score_codex":0.00035052423,"about_ca_topic_score_gemma":0.00006817391,"teacher_disagreement_score":0.6630878,"about_ca_system_score_codex":0.00018200363,"about_ca_system_score_gemma":0.000109350265,"threshold_uncertainty_score":0.9998816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3772398,0.015082146,0.50007766,0.0075376816,0.0026862358,0.00327939,0.0006509156,0.0042076297,0.08923853],"genre_scores_gemma":[0.990607,0.000045152712,0.008858628,0.00007932175,0.000024385952,0.0000082633005,0.00020715446,0.0000072728244,0.00016279127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860466,0.000057111592,0.00036901262,0.00041799602,0.00021616514,0.0003350422],"domain_scores_gemma":[0.9972611,0.000059398484,0.00009681895,0.002441552,0.000060556926,0.00008054255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000348913,0.00013494125,0.00019041622,0.000035016146,0.000091796304,0.00027295284,0.003075983,0.00006271151,0.000044727116],"category_scores_gemma":[0.000051272626,0.000117300966,0.000026999465,0.00054556155,0.00003826805,0.0005294855,0.000812899,0.00016946919,0.0001617227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012158418,0.0021128184,0.021338431,0.00012163651,0.000101029465,0.00035099537,0.0016977236,0.001725085,0.00048071114,0.01308355,0.026927728,0.93204814],"study_design_scores_gemma":[0.00044776255,0.00007554295,0.0039039399,0.00010782842,0.0000031208479,0.00006560068,0.00005448341,0.9310305,0.00009720943,0.00030317876,0.0635474,0.0003634128],"about_ca_topic_score_codex":0.00024302973,"about_ca_topic_score_gemma":0.00012571675,"teacher_disagreement_score":0.93168473,"about_ca_system_score_codex":0.000032733155,"about_ca_system_score_gemma":0.000012144844,"threshold_uncertainty_score":0.57159925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058608723,0.00015280988,0.9904243,0.00018743232,0.00013243401,0.0006116092,0.000010225389,0.00033225087,0.0075628664],"genre_scores_gemma":[0.49420425,0.000002408205,0.50441104,0.00015626509,0.000076260556,0.00016562619,0.000006888609,0.00001040086,0.0009668559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998406,0.000053499876,0.00028099885,0.00057445146,0.00025664503,0.00042838507],"domain_scores_gemma":[0.99898785,0.00003898589,0.0000824965,0.0005835397,0.00014113617,0.00016601133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035011358,0.00018749235,0.0002302217,0.000051734372,0.0001812902,0.00033092467,0.0010751417,0.00008716598,0.000030042145],"category_scores_gemma":[0.000015127499,0.00014854588,0.00007466256,0.00031327558,0.000030004312,0.00079381093,0.000024835379,0.00008280013,0.000036053032],"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.00016413291,0.0047801873,0.0001875625,0.00060058915,0.0002043471,0.00003768958,0.0137549,0.481949,0.012255761,0.11033115,0.100210585,0.2755241],"study_design_scores_gemma":[0.0004634075,0.00018426642,0.000017977405,0.000008316382,0.000003463085,0.000019246503,0.00008780431,0.98651475,0.00361464,0.0000855971,0.008746212,0.00025430572],"about_ca_topic_score_codex":0.0000067253236,"about_ca_topic_score_gemma":4.408375e-7,"teacher_disagreement_score":0.5045658,"about_ca_system_score_codex":0.000022632505,"about_ca_system_score_gemma":0.000022297727,"threshold_uncertainty_score":0.6057525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15309824,0.000010721195,0.8442851,0.00039062026,0.000102789556,0.00065366307,0.00003256287,0.000035005633,0.0013913037],"genre_scores_gemma":[0.9583508,6.0944757e-7,0.04083156,0.0003721821,0.0000065060212,0.0001190654,0.000008674723,0.0000035853886,0.00030704928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991882,0.000052500123,0.00025909115,0.00019577584,0.00014148047,0.00016297589],"domain_scores_gemma":[0.99929976,0.00020792217,0.00009444303,0.00028527062,0.00008944669,0.00002316809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034383766,0.000078090765,0.00012083239,0.00003393552,0.00005052927,0.000095478325,0.00020465165,0.000023567956,0.000021032982],"category_scores_gemma":[0.00013281123,0.000051042036,0.000039454775,0.00019031811,0.000013854823,0.0002754362,0.000018606812,0.000057488774,0.0000074844465],"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.0000042512133,0.000087429326,0.00025391797,0.000022530841,0.0000054117904,0.0000033981662,0.00027024327,0.004811675,0.0011740268,0.9786692,0.012575688,0.0021222304],"study_design_scores_gemma":[0.0021837968,0.0011148285,0.00066056,0.0001891114,0.000005734412,0.000028198298,0.0008226432,0.7954387,0.031330694,0.027589789,0.13996695,0.0006689664],"about_ca_topic_score_codex":0.000024451794,"about_ca_topic_score_gemma":0.00003236049,"teacher_disagreement_score":0.9510794,"about_ca_system_score_codex":0.0000194533,"about_ca_system_score_gemma":0.000047242393,"threshold_uncertainty_score":0.20814337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021904359,0.0003002726,0.9290506,0.00006413244,0.0014239659,0.00026090175,0.000028227045,0.00048985664,0.04647767],"genre_scores_gemma":[0.9961483,0.0000019429453,0.0027664434,0.00013616466,0.00015924241,0.000059248337,0.000012816043,0.0000041436,0.0007116962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910843,0.000046875215,0.0001597579,0.00019717056,0.00021096569,0.00027681785],"domain_scores_gemma":[0.99917036,0.000027353268,0.000049075374,0.0005943455,0.00003275888,0.00012611068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032248997,0.00009178351,0.000107945736,0.000039114628,0.000075690594,0.00007453878,0.00033995454,0.000036999005,0.000011266976],"category_scores_gemma":[0.0000061561477,0.000071149196,0.00003728944,0.00019257385,0.000009373159,0.00068511965,0.00008267623,0.00006126464,0.00073862524],"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.00000460689,0.00016576506,0.00050157565,0.000067069086,0.000008957185,0.000008624034,0.0002306611,0.00006540395,0.00091255846,0.96604675,0.022781044,0.009207004],"study_design_scores_gemma":[0.0014743804,0.00038195326,0.0058374302,0.0007137401,0.000017518769,0.00030857645,0.0013843951,0.17099878,0.015199741,0.00007631238,0.80230707,0.0013001361],"about_ca_topic_score_codex":0.000065607725,"about_ca_topic_score_gemma":0.0000014463026,"teacher_disagreement_score":0.97424394,"about_ca_system_score_codex":0.00006320275,"about_ca_system_score_gemma":0.000015825068,"threshold_uncertainty_score":0.94937795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029890654,0.000089252666,0.9950644,0.00048429467,0.00047398478,0.00029066222,0.000070939925,0.000065285225,0.000472121],"genre_scores_gemma":[0.8261509,0.0000022683378,0.17167781,0.0010530875,0.00026713073,0.000032947424,0.00008982042,0.00001573778,0.00071026967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985403,0.000024360232,0.00037310427,0.00046468936,0.00020677983,0.00039079908],"domain_scores_gemma":[0.9988525,0.00006839842,0.00006898376,0.0008838002,0.00005397691,0.0000723323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010534172,0.00011894867,0.00016446633,0.000052919157,0.00004954295,0.00013569929,0.0010567138,0.00005954696,0.000009470964],"category_scores_gemma":[0.000010502431,0.000099063014,0.0000338482,0.00024757755,0.000009373482,0.0005230319,0.00034422847,0.0000899176,0.000025052492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032224486,0.00011257545,0.0028765553,0.00002501532,0.000013966376,0.00003894424,0.00052775996,0.00016069874,0.000040133324,0.0015592396,0.0030784863,0.9915634],"study_design_scores_gemma":[0.0011235204,0.000047885544,0.007222269,0.000096308,0.0000037249615,0.0000196024,0.00019742482,0.88600904,0.00020925199,0.00073413696,0.10400276,0.00033409768],"about_ca_topic_score_codex":0.00019658284,"about_ca_topic_score_gemma":0.00024599436,"teacher_disagreement_score":0.9912293,"about_ca_system_score_codex":0.000023538934,"about_ca_system_score_gemma":0.000030647207,"threshold_uncertainty_score":0.40396726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051646894,0.000022804468,0.9502288,0.00039944483,0.00015300224,0.00026126852,0.0000026118319,0.00021407704,0.04355331],"genre_scores_gemma":[0.9071268,4.1029747e-7,0.08982515,0.0012872225,0.000046850684,0.000036315225,8.06257e-7,0.000005165405,0.0016712983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890715,0.0000070811557,0.00020911287,0.0002930927,0.00023756005,0.0003460307],"domain_scores_gemma":[0.99932355,0.00002434292,0.000029729887,0.0004008198,0.000036526904,0.00018501023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039409797,0.000097583346,0.00012111904,0.000065624976,0.000073815936,0.00012117617,0.00060186064,0.000040965537,0.0000069933335],"category_scores_gemma":[0.000009158782,0.00008296824,0.00004624713,0.0003939443,0.000006357665,0.0002591881,0.000088835324,0.00006911274,0.00016054783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146354705,0.00015456042,0.0003209882,0.000027212787,0.000020307198,0.00007773997,0.0016501204,0.015042279,0.010008238,0.6034967,0.02983407,0.33935317],"study_design_scores_gemma":[0.00026897664,0.000039155224,0.0006325313,0.000022844373,0.0000014806097,0.000024285297,0.00006560849,0.9067164,0.002903598,0.0013788168,0.087644555,0.00030172567],"about_ca_topic_score_codex":0.000032195727,"about_ca_topic_score_gemma":0.000017930368,"teacher_disagreement_score":0.9019621,"about_ca_system_score_codex":0.000033251585,"about_ca_system_score_gemma":0.000027480253,"threshold_uncertainty_score":0.33833468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07164094,0.00002160369,0.9132002,0.0009833093,0.00044695352,0.00014621211,0.0000033914757,0.000097054995,0.013460367],"genre_scores_gemma":[0.9879159,5.3156776e-7,0.011610658,0.00041457036,0.000036841102,0.000005588898,2.9283217e-7,0.0000038403446,0.000011779532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977954,0.00016836682,0.00025416497,0.00046134673,0.000939158,0.0003815848],"domain_scores_gemma":[0.9978918,0.00042973759,0.000104695704,0.0010715144,0.00026746705,0.00023482704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023907858,0.00013836841,0.00019921966,0.0000851986,0.00023665547,0.00024275489,0.003016148,0.00003517597,0.000015935007],"category_scores_gemma":[0.00021711673,0.000082273116,0.000064863016,0.0011167007,0.0020515781,0.00040329367,0.00071493175,0.00015576302,0.00011029403],"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.000006066769,0.000047655893,0.000015148744,0.0000025010265,0.0000022052423,0.000003942552,0.00031464215,0.0004446916,0.00063287915,0.9935076,0.00067975745,0.0043428782],"study_design_scores_gemma":[0.00020130348,0.00020763923,0.00012962522,0.00006255127,0.0000017646124,0.000015550899,0.0000051360494,0.60398567,0.00757518,0.38752225,0.00014203764,0.00015132519],"about_ca_topic_score_codex":0.0000044669096,"about_ca_topic_score_gemma":6.3995564e-8,"teacher_disagreement_score":0.91627496,"about_ca_system_score_codex":0.000028772067,"about_ca_system_score_gemma":0.0001234718,"threshold_uncertainty_score":0.75591254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7017355,0.000610541,0.22834079,0.06628012,0.0013775667,0.00026488723,0.000020541092,0.000015166707,0.0013548861],"genre_scores_gemma":[0.9924615,0.000021322834,0.0072354013,0.00010470909,0.00006830248,5.864125e-7,2.0706274e-7,0.0000022873562,0.00010566229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991558,0.00013066707,0.000294621,0.00006584547,0.00024353141,0.00010952143],"domain_scores_gemma":[0.99839264,0.0001982701,0.0004622524,0.0007414649,0.00015952818,0.00004581865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008016029,0.000054009844,0.00013504483,0.000018134817,0.00019358298,0.0000974664,0.0017683478,0.000015302889,0.000003919402],"category_scores_gemma":[0.00028764526,0.000028524302,0.00006872282,0.00012654626,0.000111986075,0.00015295336,0.00041780536,0.00010553954,0.000001629359],"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.00017551407,0.00065908884,0.07581697,0.00019734903,0.0007714577,0.000018792924,0.009994085,0.001131888,0.033602774,0.60294807,0.17908098,0.09560302],"study_design_scores_gemma":[0.0019373633,0.0004286503,0.8077593,0.00027324425,0.000066232584,0.00031790778,0.00051304616,0.012367259,0.0074714865,0.13037522,0.038237993,0.00025228295],"about_ca_topic_score_codex":0.000025698184,"about_ca_topic_score_gemma":0.000039767066,"teacher_disagreement_score":0.73194236,"about_ca_system_score_codex":0.000014962146,"about_ca_system_score_gemma":0.00004865038,"threshold_uncertainty_score":0.32860598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005597243,0.00016418402,0.99445206,0.00026095324,0.0013240055,0.0003468687,0.00025705792,0.00014273312,0.0024923948],"genre_scores_gemma":[0.96111363,0.0000026123842,0.036548674,0.000077623576,0.00005328806,0.00015882705,0.00003439992,0.000005015281,0.0020059443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988653,0.00006263391,0.00024991465,0.0003383884,0.0001771094,0.00030662352],"domain_scores_gemma":[0.99911904,0.00009801743,0.000045102493,0.0005094578,0.00013694691,0.00009145033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442545,0.00009459357,0.00013773878,0.000027817283,0.00024453143,0.00015898749,0.00030182587,0.0000429945,0.000049317387],"category_scores_gemma":[0.00004172582,0.000081684884,0.00006747506,0.00018837264,0.000025563757,0.00044720143,0.000014836043,0.000055103246,0.000060376104],"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.000001920069,0.000077048506,0.000025464584,0.000031620493,0.00001025342,6.594826e-7,0.000015499929,0.0008918711,0.0002611871,0.98662186,0.011700853,0.00036174827],"study_design_scores_gemma":[0.0015721876,0.000099435805,0.0004555998,0.000042665233,0.000015256308,0.000076066215,0.0001040124,0.23098238,0.0008954742,0.0045362664,0.76068807,0.0005325744],"about_ca_topic_score_codex":0.00014167766,"about_ca_topic_score_gemma":0.000016359723,"teacher_disagreement_score":0.9820856,"about_ca_system_score_codex":0.000045844536,"about_ca_system_score_gemma":0.000095271185,"threshold_uncertainty_score":0.3331013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048163544,0.00005218178,0.9261601,0.0002785577,0.00010815835,0.000118929405,0.000004378778,0.00009957071,0.025014557],"genre_scores_gemma":[0.99033415,0.0000033317237,0.0091281,0.000032675987,0.00004461574,0.000014580196,0.00001766744,0.0000039385104,0.0004209269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992525,0.000019393,0.00028495546,0.00017684785,0.00014149089,0.00012478573],"domain_scores_gemma":[0.99928814,0.000016208984,0.0001531789,0.0003620334,0.00016550474,0.000014935474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013116706,0.00006900424,0.00009833613,0.000057045854,0.000091749316,0.000055234847,0.00033254805,0.00003879659,0.0000113418555],"category_scores_gemma":[0.000004902018,0.00006411688,0.00002573968,0.00042923426,0.000019052939,0.00046907982,0.00004795002,0.00003544166,0.000020052905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003899667,0.00017160391,0.020690506,0.00022534981,0.000013524806,8.474561e-7,0.00034452789,0.040801752,0.0052469256,0.49051887,0.005611267,0.43637094],"study_design_scores_gemma":[0.00031550034,0.00003697173,0.16758075,0.00012731565,0.000005489451,0.000020487414,0.00005844985,0.82002586,0.007891063,0.0016633347,0.002028895,0.00024588997],"about_ca_topic_score_codex":0.000051216968,"about_ca_topic_score_gemma":0.000023302464,"teacher_disagreement_score":0.9421706,"about_ca_system_score_codex":0.00004164178,"about_ca_system_score_gemma":0.00003542786,"threshold_uncertainty_score":0.26146105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032956267,0.000043297525,0.91771996,0.00032272775,0.00013368764,0.023428088,0.000017370707,0.00028146195,0.05475776],"genre_scores_gemma":[0.89658153,9.774519e-7,0.07827696,0.0003678129,0.00011620454,0.023859343,2.7627019e-7,0.000010510577,0.00078639213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991656,0.000037260692,0.00016247811,0.00027741317,0.00015294392,0.00020431072],"domain_scores_gemma":[0.99951,0.000025054835,0.00004909387,0.00030070997,0.000036028443,0.000079150435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012369727,0.000101930236,0.00013086261,0.000016725193,0.00009935072,0.00023409732,0.00030617576,0.000044386863,0.00010089354],"category_scores_gemma":[0.00002462142,0.00008105848,0.000024263625,0.00025909577,0.00002493046,0.00035360776,0.000099596014,0.00003222662,0.00003653862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017948803,0.00066147576,0.012203302,0.0005229843,0.000092358314,0.00013863998,0.00038196528,0.00084874255,0.0019801888,0.4907502,0.0276539,0.4647483],"study_design_scores_gemma":[0.0004384751,0.00003412197,0.001773906,0.0000863088,0.000006033873,0.00012757113,0.000014017528,0.95411867,0.0008274151,0.0010424465,0.04122736,0.0003036574],"about_ca_topic_score_codex":0.00014085008,"about_ca_topic_score_gemma":0.0000044460553,"teacher_disagreement_score":0.95326996,"about_ca_system_score_codex":0.00003266979,"about_ca_system_score_gemma":0.000013147444,"threshold_uncertainty_score":0.33054692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012247819,0.000013388018,0.98493606,0.0013385813,0.00051251124,0.00021227318,0.000019195051,0.00013834258,0.0005818452],"genre_scores_gemma":[0.90735203,0.000016719192,0.09212033,0.00021040106,0.00006224782,0.000059169903,0.000011729782,0.0000073359483,0.00016003009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905795,0.000015726415,0.00021160334,0.00023068891,0.00026038263,0.00022362528],"domain_scores_gemma":[0.999178,0.000025590854,0.00008009972,0.00051092595,0.00011300278,0.00009239032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013146647,0.000149493,0.00012663656,0.00011794073,0.00025105287,0.00021567797,0.000307437,0.00007901488,0.000035660436],"category_scores_gemma":[0.0000058323053,0.00012291534,0.00003153078,0.0003396366,0.000047181307,0.0011131361,0.000007448446,0.0003028224,0.00006946213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001687644,0.00009248512,0.000022660495,0.000013293708,0.000027572358,0.0000024181406,0.00042038914,0.00031558503,0.0009103324,0.00049705786,0.00009529811,0.997586],"study_design_scores_gemma":[0.011446776,0.005571713,0.027748082,0.00032934934,0.00016481504,0.0024678772,0.0015365571,0.6627895,0.056431156,0.001356419,0.227021,0.0031367089],"about_ca_topic_score_codex":0.000085019594,"about_ca_topic_score_gemma":0.00013274423,"teacher_disagreement_score":0.9944493,"about_ca_system_score_codex":0.000017812612,"about_ca_system_score_gemma":0.000040820887,"threshold_uncertainty_score":0.5012342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01181692,0.004900334,0.8118018,0.003791709,0.002047083,0.0011877776,0.0018289267,0.0015822093,0.16104324],"genre_scores_gemma":[0.99684656,0.000011563847,0.0023237022,0.00009219389,0.00003388053,0.00001691203,0.00008594203,0.000006123936,0.0005830986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980704,0.00009126941,0.00045785334,0.0006679453,0.0003176347,0.0003948488],"domain_scores_gemma":[0.99768287,0.000056486446,0.00009098934,0.0019804644,0.000067432025,0.00012175425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029941573,0.00016725625,0.00028807877,0.000080000034,0.00009776554,0.00021786026,0.002033672,0.00007143157,0.000042619504],"category_scores_gemma":[0.000047370657,0.00014225843,0.00007862036,0.00069497625,0.000036204998,0.00060808344,0.00051059405,0.00012694075,0.0002909127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020121915,0.001509897,0.010240629,0.0007834075,0.00029151456,0.0016030096,0.0022863995,0.0010541715,0.00041769145,0.6877806,0.24640389,0.04760863],"study_design_scores_gemma":[0.0007158813,0.000048916718,0.0019754851,0.00015031146,0.000007782263,0.00017833963,0.00060747727,0.9502691,0.000013432288,0.000018515595,0.0457017,0.00031306528],"about_ca_topic_score_codex":0.00018184553,"about_ca_topic_score_gemma":0.00009838569,"teacher_disagreement_score":0.98502964,"about_ca_system_score_codex":0.00012689958,"about_ca_system_score_gemma":0.00003004055,"threshold_uncertainty_score":0.58011305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013749587,0.00046836658,0.97569066,0.00006836658,0.000089906636,0.0013282589,0.000094888615,0.00021818039,0.021903858],"genre_scores_gemma":[0.8808814,0.00002740379,0.08686945,0.0003617242,0.00014028324,0.01128179,0.000012683688,0.000012731635,0.020412493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991256,0.000011866691,0.00018686097,0.00033012882,0.00012274527,0.00022280758],"domain_scores_gemma":[0.9991936,0.000057011384,0.00005496414,0.0005066244,0.000110529545,0.00007727266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008841658,0.00009651012,0.00013096233,0.000028608889,0.00013009443,0.00010375526,0.00057007914,0.000045323755,0.00007145936],"category_scores_gemma":[0.0000037551586,0.0000843155,0.000071575945,0.00025602104,0.000022837585,0.0002562387,0.00006385666,0.000046159446,0.00030413448],"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.000005215751,0.0004663727,0.00004260884,0.000036134592,0.000039257884,0.000002524401,0.0010654643,0.0015641857,0.0004001632,0.5481294,0.14965372,0.29859495],"study_design_scores_gemma":[0.00022714755,0.00014729184,0.00001026447,0.0000046411687,0.000002274255,0.0000050447525,0.00006564898,0.25059408,0.00022034581,0.0008339626,0.7477659,0.00012337732],"about_ca_topic_score_codex":0.000010374831,"about_ca_topic_score_gemma":0.000007003004,"teacher_disagreement_score":0.88882124,"about_ca_system_score_codex":0.000027794009,"about_ca_system_score_gemma":0.000011687676,"threshold_uncertainty_score":0.3909135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007063434,0.0003873089,0.993669,0.00035934598,0.0011598425,0.00043621054,0.000080141064,0.0001737609,0.003028057],"genre_scores_gemma":[0.756108,0.000012431475,0.24308631,0.00024382146,0.0002565009,0.000012673114,0.00005378548,0.00004101921,0.00018546586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546456,0.000039867853,0.000911932,0.0015194206,0.0013462403,0.00071798987],"domain_scores_gemma":[0.995913,0.0003988185,0.0007729599,0.0020878587,0.00059424253,0.00023306612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071222614,0.0006675236,0.0011125193,0.0005890014,0.00021986155,0.0003866596,0.0040419986,0.0005024389,0.000014510297],"category_scores_gemma":[0.00007279213,0.0005317654,0.00015860735,0.001025991,0.001260409,0.00053612085,0.0008012218,0.0012478022,0.00001859898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007574263,0.0003147659,0.0012757813,0.00030564543,0.000094314404,0.00024864663,0.0016972602,0.049458306,0.0036753404,0.026360247,0.000120133125,0.9163738],"study_design_scores_gemma":[0.0020547826,0.0010129806,0.00326391,0.0025041068,0.000055882523,0.0002784065,0.0000019224258,0.92489,0.029239489,0.025450645,0.00860113,0.0026467452],"about_ca_topic_score_codex":0.00005980322,"about_ca_topic_score_gemma":0.00033599327,"teacher_disagreement_score":0.91372705,"about_ca_system_score_codex":0.00014925016,"about_ca_system_score_gemma":0.00056613324,"threshold_uncertainty_score":0.99971336},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03042679,0.000085978325,0.96735114,0.00019901001,0.00008084149,0.00004993055,0.000009732662,0.00006893329,0.0017276402],"genre_scores_gemma":[0.9461055,0.00000444293,0.053105187,0.0000732743,0.000010142411,0.00000566031,0.00001005582,0.0000024720798,0.0006833123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913615,0.00002381391,0.00026586492,0.00021670932,0.000213606,0.0001438704],"domain_scores_gemma":[0.99936646,0.00002931475,0.00010990377,0.00034890632,0.00010659576,0.00003882349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015076532,0.000077437355,0.00018929811,0.00017276374,0.00006964507,0.000051136107,0.0003502568,0.000031398933,0.00006728617],"category_scores_gemma":[0.000007732559,0.00006683413,0.0000946375,0.0015270263,0.000016287133,0.00020845905,0.000025808944,0.000039467413,0.000018369963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015004624,0.00027564916,0.011934363,0.00005386135,0.00044894655,0.0000075368557,0.00042622353,0.27043897,0.001322464,0.0077607324,0.0013775015,0.7059523],"study_design_scores_gemma":[0.00011309602,0.000020387279,0.0041132383,0.000009265274,0.000028334505,6.5382727e-7,0.000003877674,0.9947694,0.00055630115,0.0000016140934,0.0003007079,0.0000831145],"about_ca_topic_score_codex":0.0000306688,"about_ca_topic_score_gemma":0.000024155235,"teacher_disagreement_score":0.9156787,"about_ca_system_score_codex":0.000023073902,"about_ca_system_score_gemma":0.000011670145,"threshold_uncertainty_score":0.27254167},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4464624,0.00006650518,0.55140424,0.00019675585,0.000085570275,0.0001642554,0.000004276969,0.000057064684,0.0015589595],"genre_scores_gemma":[0.97830325,0.000008425729,0.021275345,0.00023281106,0.000013224751,0.0000025130246,0.000010358169,0.0000024631029,0.00015158237],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99892294,0.0000370252,0.00024690453,0.00047181643,0.0001383346,0.00018294902],"domain_scores_gemma":[0.9990868,0.000091783724,0.00006329194,0.00065084256,0.000057528614,0.000049774204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011160974,0.00007736722,0.00011436389,0.000030634677,0.000058367266,0.000057205387,0.00023365715,0.000045670007,0.000005762386],"category_scores_gemma":[0.00007281681,0.00006867522,0.000017840195,0.00024696608,0.000032864238,0.0007624458,0.00016673948,0.00007571582,0.000014875259],"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.00028170098,0.0011596015,0.42211297,0.0004667204,0.00004365933,0.00019585245,0.013539252,0.0004288477,0.02132689,0.1089235,0.008769358,0.42275164],"study_design_scores_gemma":[0.0051969895,0.00014220855,0.533283,0.0004008816,0.000010412191,0.000068708265,0.0025041653,0.38515794,0.019099293,0.0011893366,0.05184215,0.0011049247],"about_ca_topic_score_codex":0.0008604723,"about_ca_topic_score_gemma":0.00021181031,"teacher_disagreement_score":0.53184086,"about_ca_system_score_codex":0.000050794977,"about_ca_system_score_gemma":0.00001116463,"threshold_uncertainty_score":0.2800494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03375377,0.0013515953,0.96124977,0.0000917459,0.00040243485,0.00013068103,0.000015394153,0.00012596704,0.0028786596],"genre_scores_gemma":[0.99572283,0.0000066375032,0.0039112032,0.000054836604,0.00017721772,0.00001191595,0.00004538858,0.000008411528,0.00006155461],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987708,0.00006339496,0.0003126902,0.00019730428,0.0002433597,0.00041250174],"domain_scores_gemma":[0.9989502,0.00007906761,0.00020424854,0.000527564,0.00009915785,0.00013976307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024985743,0.00014558951,0.00030485654,0.000033504475,0.00006712192,0.000049299546,0.00051365985,0.00009232192,0.0000067912483],"category_scores_gemma":[0.000010267644,0.00011159734,0.000054589047,0.0005375801,0.000058250105,0.00035322245,0.0000891613,0.00015544273,0.000009885122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022708497,0.0018782918,0.45186615,0.00016766624,0.00036694587,0.000026285832,0.0026024817,0.14926855,0.00045665642,0.052350994,0.0811118,0.25967708],"study_design_scores_gemma":[0.001106475,0.00016092855,0.16342707,0.00017830919,0.000028621538,0.000026649106,0.00013042288,0.81624466,0.00073178957,0.00003390234,0.01749825,0.0004329126],"about_ca_topic_score_codex":0.000030287,"about_ca_topic_score_gemma":0.000015355554,"teacher_disagreement_score":0.9619691,"about_ca_system_score_codex":0.000023880551,"about_ca_system_score_gemma":0.000018686202,"threshold_uncertainty_score":0.45508075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07494391,0.00075018813,0.8975486,0.0004122005,0.0015567659,0.00030203015,0.000005653553,0.00026890874,0.02421175],"genre_scores_gemma":[0.98968697,0.0000016786997,0.009812753,0.000059012746,0.00031953506,0.00000448729,0.0000033111999,0.000009478269,0.00010279362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817044,0.000087710316,0.00052084395,0.00025785208,0.00047333463,0.0004898012],"domain_scores_gemma":[0.9985336,0.00021152855,0.00036480676,0.0006696848,0.00017660295,0.000043760643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062609743,0.00017198201,0.00022899896,0.000028233322,0.0011069995,0.00039956166,0.0014292279,0.000054691627,8.556625e-7],"category_scores_gemma":[0.000034247947,0.00010171537,0.00013300368,0.00035457918,0.000110605884,0.00037321585,0.00045180783,0.00022614891,0.000008485493],"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.000044550026,0.00013693834,0.0016154302,0.00012942,0.00009910777,0.000061300285,0.0014267894,0.014065928,0.00059625815,0.81404364,0.007913179,0.15986747],"study_design_scores_gemma":[0.0016123353,0.00031283338,0.120192066,0.0004454539,0.000028430675,0.00029500047,0.0005647014,0.7607975,0.008436101,0.005461129,0.101033084,0.0008213483],"about_ca_topic_score_codex":0.00029203523,"about_ca_topic_score_gemma":0.00001713734,"teacher_disagreement_score":0.91474307,"about_ca_system_score_codex":0.00004329126,"about_ca_system_score_gemma":0.00009330008,"threshold_uncertainty_score":0.8514257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062509143,0.00013467675,0.98475015,0.0006710154,0.00033163195,0.00021818817,0.000013684726,0.00022590949,0.0130296545],"genre_scores_gemma":[0.8227556,0.0000010246908,0.1709886,0.0012221647,0.00020136553,0.00012280275,0.00004310065,0.000013806231,0.0046515614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907094,0.000017450653,0.00025074542,0.00028216882,0.00013587048,0.00024281924],"domain_scores_gemma":[0.9993697,0.000062175226,0.00007018232,0.00037120155,0.000083821644,0.000042939057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023206293,0.000100595906,0.00014812475,0.000020907031,0.000076636614,0.00014985529,0.0003790729,0.000051811698,0.000024264302],"category_scores_gemma":[0.000015730911,0.00008431323,0.00011510499,0.00014131563,0.000014826615,0.00023849274,0.000030653995,0.00003134661,0.000032537293],"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.000067928755,0.0003292572,0.00020227653,0.00011664173,0.000021344367,0.000013978947,0.000029257028,0.008057377,0.0022263338,0.80975217,0.15454306,0.02464036],"study_design_scores_gemma":[0.0013323583,0.000117366246,0.0003532235,0.000024249175,0.000003384525,0.00000414218,0.0000049795403,0.6707406,0.011920561,0.0061453697,0.3090986,0.0002551644],"about_ca_topic_score_codex":0.0007573963,"about_ca_topic_score_gemma":0.0001513501,"teacher_disagreement_score":0.8221305,"about_ca_system_score_codex":0.000051189636,"about_ca_system_score_gemma":0.000059449627,"threshold_uncertainty_score":0.34381935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091066375,0.00072101137,0.90643615,0.0006487423,0.0006420357,0.0001981979,0.000008316441,0.00010475244,0.00017441524],"genre_scores_gemma":[0.9680474,0.00020125772,0.03104943,0.00046517054,0.00008975574,0.000088736946,0.00001881105,0.0000051392512,0.000034331293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877596,0.00007323791,0.00027336503,0.0004172954,0.00017778412,0.00028238815],"domain_scores_gemma":[0.9988157,0.0005002021,0.00017469589,0.00018076017,0.0002199481,0.00010868694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040897782,0.00014400351,0.00016968105,0.000045258697,0.00072546967,0.00024864674,0.00020759623,0.000061644336,0.0000019501326],"category_scores_gemma":[0.00031320428,0.00013493455,0.000023359715,0.00019030366,0.00010191271,0.0019291156,0.00016518541,0.000095205556,0.000008421293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033341243,0.00008783022,0.00029169294,0.000087657776,0.0000112500475,0.0000014882248,0.006318867,0.00056592136,0.00015606829,0.15013196,0.0010581472,0.8412558],"study_design_scores_gemma":[0.0021400377,0.0008507814,0.0034034017,0.00019516838,0.000032670745,0.00018502295,0.0015543012,0.831328,0.00043360653,0.008248956,0.15088674,0.00074135454],"about_ca_topic_score_codex":0.000021012704,"about_ca_topic_score_gemma":0.0000013000182,"teacher_disagreement_score":0.87698096,"about_ca_system_score_codex":0.000012156111,"about_ca_system_score_gemma":0.000041025596,"threshold_uncertainty_score":0.55797994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020784106,0.000044455086,0.94673824,0.0010624301,0.002546081,0.0003777058,0.000020275991,0.0019974578,0.026429236],"genre_scores_gemma":[0.9298748,5.917805e-7,0.06725371,0.0003090999,0.00006890154,0.000041103296,0.000004355707,0.000005268253,0.0024422118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915385,0.000010237036,0.00015677052,0.00029262202,0.00013800377,0.00024848795],"domain_scores_gemma":[0.99921215,0.000041002906,0.00004427719,0.00049058784,0.00012855243,0.000083414925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022034686,0.00009298339,0.00011917135,0.00003264617,0.00011979987,0.00018436337,0.0007185305,0.000062052844,0.00001954847],"category_scores_gemma":[0.00005070344,0.00007527954,0.00008246384,0.00019803512,0.000026310146,0.00031996463,0.00006082966,0.00008344031,0.00007882232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010483785,0.00017987793,0.0008694642,0.00008134672,0.00005335012,0.000014528487,0.0009322443,0.000055236364,0.07613637,0.62771356,0.23259676,0.06135677],"study_design_scores_gemma":[0.0004064811,0.000060162634,0.0018056876,0.000009849788,0.0000032656578,0.000036012076,0.000046906844,0.78374314,0.0038417722,0.00052128156,0.20930143,0.00022398452],"about_ca_topic_score_codex":0.00003126488,"about_ca_topic_score_gemma":0.000039637485,"teacher_disagreement_score":0.90909064,"about_ca_system_score_codex":0.0000089412115,"about_ca_system_score_gemma":0.000049566755,"threshold_uncertainty_score":0.30698106},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013013859,0.00012644035,0.97829145,0.004726223,0.00034245872,0.00020612204,0.000213013,0.0004126092,0.014380305],"genre_scores_gemma":[0.97488314,0.000007743685,0.021407494,0.0012620268,0.00018324822,0.000009426346,0.00028792376,0.000008991865,0.0019499963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796516,0.0000306211,0.00037387872,0.0010004566,0.00025935145,0.00037055768],"domain_scores_gemma":[0.99293077,0.000043514214,0.000099359706,0.0067057787,0.00005730282,0.00016325743],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00051439734,0.00011001109,0.00015785107,0.000033496115,0.0001072396,0.00047045297,0.007648756,0.000036003126,0.00018556844],"category_scores_gemma":[0.00024716134,0.000092311224,0.000012301182,0.000559654,0.000013304285,0.0017984896,0.004100049,0.000071102695,0.0005782377],"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.0000016292528,0.00009116185,0.00096312346,0.000013465209,0.000016428248,0.000042077743,0.00013621956,0.000057057197,0.00035632585,0.0041055293,0.8920522,0.10216479],"study_design_scores_gemma":[0.0000933725,0.000012702013,0.00034240418,0.000012465871,0.0000025018633,0.000013545714,0.000012559195,0.44048217,0.0003567776,0.000026615397,0.5585052,0.00013972278],"about_ca_topic_score_codex":0.00012000356,"about_ca_topic_score_gemma":0.00002005941,"teacher_disagreement_score":0.9735818,"about_ca_system_score_codex":0.00000847773,"about_ca_system_score_gemma":0.00001964887,"threshold_uncertainty_score":0.99772036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026495233,0.00007370987,0.9621381,0.0006063157,0.00028561507,0.00064082554,0.000053749907,0.00034970746,0.033202443],"genre_scores_gemma":[0.74700564,0.0000017415275,0.24960957,0.0009722901,0.000031985546,0.0000958675,0.0002511609,0.000018148048,0.0020135695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731034,0.00012493679,0.0003933309,0.0014239098,0.00036184644,0.0003856262],"domain_scores_gemma":[0.9945093,0.0000242246,0.000101332655,0.004999963,0.00010611238,0.0002590803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093888486,0.00019489699,0.00023126276,0.00007731116,0.00019786262,0.00048666546,0.0028761015,0.00007169379,0.000011077488],"category_scores_gemma":[0.000088397384,0.00017102377,0.000035343244,0.00061483326,0.000020303605,0.0015376116,0.0004046654,0.00011529342,0.00007974702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008375342,0.0032343718,0.0007676094,0.0006802779,0.0002688326,0.00008218427,0.014734704,0.041420907,0.009594997,0.45242652,0.13866925,0.3380366],"study_design_scores_gemma":[0.00032008882,0.000035701694,0.00030782743,0.000024529272,0.0000042847587,0.0000615776,0.00033262259,0.9596005,0.00014625468,0.00009446049,0.03874674,0.0003253968],"about_ca_topic_score_codex":0.00006413003,"about_ca_topic_score_gemma":0.000021268883,"teacher_disagreement_score":0.91817963,"about_ca_system_score_codex":0.00007441627,"about_ca_system_score_gemma":0.000104758816,"threshold_uncertainty_score":0.6974147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006411735,0.00027184223,0.99596757,0.00077402213,0.00073813513,0.00034720913,0.00026408373,0.00023297365,0.0007629871],"genre_scores_gemma":[0.90845233,0.0000040381306,0.08880187,0.000045693232,0.00041413665,0.00006052525,0.0010492784,0.000011623552,0.0011605229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849397,0.000032969623,0.00034703867,0.0005551436,0.00027589605,0.000294992],"domain_scores_gemma":[0.99859273,0.00011372461,0.00009137241,0.0009998918,0.00013477403,0.00006749265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047375675,0.00013000483,0.00018260143,0.000053123378,0.00015797674,0.0004717063,0.0014015286,0.000076490185,0.0000033482997],"category_scores_gemma":[0.000024267969,0.00010920346,0.00003870666,0.00025062167,0.000021546874,0.00078929734,0.0002718813,0.000080435486,0.000028847719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011690674,0.00028502793,0.00042517617,0.00023979033,0.0000398191,0.00002255489,0.00009223276,0.0050972337,0.0007036473,0.7774227,0.11576197,0.09989814],"study_design_scores_gemma":[0.00020358176,0.000016096123,0.0002626578,0.00005100483,0.0000035427472,0.000013646773,0.00002420599,0.958537,0.00009507544,0.000681706,0.039950203,0.00016128607],"about_ca_topic_score_codex":0.00017117642,"about_ca_topic_score_gemma":0.000017668486,"teacher_disagreement_score":0.9534398,"about_ca_system_score_codex":0.000030539857,"about_ca_system_score_gemma":0.000040311264,"threshold_uncertainty_score":0.45486745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00774948,0.00021199869,0.9891084,0.0002595372,0.0006410247,0.00058232836,0.00009999583,0.00020632599,0.0011409123],"genre_scores_gemma":[0.9573996,0.000002576364,0.041934572,0.000073001036,0.000080369915,0.00010603141,0.000035249635,0.0000095334135,0.00035905134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981658,0.00015220909,0.00043956045,0.00053815736,0.0002865577,0.00041770792],"domain_scores_gemma":[0.99889046,0.00013346538,0.00009694776,0.00062810705,0.00010500296,0.00014604125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007347598,0.00016466095,0.00029017145,0.00009981658,0.00012297998,0.00024754353,0.0007706418,0.000100071615,0.00001571092],"category_scores_gemma":[0.00003770013,0.0001391332,0.00007119247,0.0005586619,0.000014962688,0.0002652328,0.000088637025,0.00008783312,0.000042629945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005612993,0.002191198,0.000772958,0.0002661495,0.000033077296,0.0000939575,0.0034413484,0.3644973,0.0039072847,0.49104452,0.030706218,0.10298987],"study_design_scores_gemma":[0.0007602268,0.000118349446,0.00049253396,0.000035432404,0.0000020945797,0.000018785788,0.00010025547,0.9812055,0.00012466141,0.00007644536,0.016866412,0.00019927177],"about_ca_topic_score_codex":0.00017271884,"about_ca_topic_score_gemma":0.000022884351,"teacher_disagreement_score":0.9496501,"about_ca_system_score_codex":0.00009235905,"about_ca_system_score_gemma":0.000015777756,"threshold_uncertainty_score":0.56736875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014101153,0.0002511139,0.9627959,0.0013709776,0.00042546308,0.00016267043,0.000009765337,0.00006188129,0.020821046],"genre_scores_gemma":[0.9983086,0.000017392927,0.0007782418,0.00002738344,0.000006749126,0.000008736445,1.2715213e-7,0.0000010622044,0.0008517257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994613,0.00005200426,0.00018008023,0.00011034428,0.00009530978,0.000100959056],"domain_scores_gemma":[0.9995172,0.00008842795,0.000027722535,0.00031926148,0.000028701019,0.00001867412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020919897,0.000039709827,0.00007556663,0.000014237646,0.000056012806,0.00003665797,0.00030262838,0.000017934288,0.00009639349],"category_scores_gemma":[0.000014989679,0.000024898376,0.00003530871,0.00027697123,0.000030769927,0.00014308952,0.000008162097,0.000034957575,0.000009674498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024098583,0.0013029414,0.0060061947,0.00011870035,0.000050828472,0.0000153511,0.004581369,0.0042474857,0.0025280267,0.28110126,0.011375357,0.6886484],"study_design_scores_gemma":[0.0011709387,0.00015750843,0.020282522,0.00006213682,0.0000049512046,0.000020798541,0.00038419533,0.7675789,0.009283751,0.0026810854,0.1979955,0.00037772782],"about_ca_topic_score_codex":0.0002466779,"about_ca_topic_score_gemma":0.0003341866,"teacher_disagreement_score":0.98420745,"about_ca_system_score_codex":0.00001131113,"about_ca_system_score_gemma":0.000009817243,"threshold_uncertainty_score":0.105544105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006188183,0.00024481333,0.9970671,0.000011593125,0.0008691617,0.00058317225,0.00034422008,0.0002602479,8.8142497e-7],"genre_scores_gemma":[0.66885155,0.000033424094,0.33088213,0.0000070747565,0.000028214725,0.00013494508,0.0000150067535,0.00002219012,0.000025453257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985599,0.00002700177,0.00043177154,0.00047181794,0.00020413678,0.0003054072],"domain_scores_gemma":[0.9986274,0.00030432345,0.00009984558,0.00078197074,0.00011492006,0.00007153752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026419546,0.0002079691,0.00031221038,0.0002107704,0.00007119061,0.00013391773,0.0011554023,0.00010517949,0.0000029542848],"category_scores_gemma":[0.000067243374,0.00020346619,0.00004532131,0.0005602295,0.0000119163215,0.00080255454,0.000007295697,0.00015589427,0.0000017252344],"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.000018881676,0.000081779166,0.000030046418,0.0002201067,0.00002925001,0.000009690186,0.00014791008,0.99486154,0.0005909451,0.00004878347,0.000036784128,0.0039242506],"study_design_scores_gemma":[0.0008085303,0.00003812344,0.0002657204,0.00023159831,0.00000950235,0.000020615935,0.000023894507,0.996413,0.0016675553,0.0000026222392,0.00029989955,0.00021897088],"about_ca_topic_score_codex":0.00009294103,"about_ca_topic_score_gemma":0.000016992191,"teacher_disagreement_score":0.66823274,"about_ca_system_score_codex":0.000052422703,"about_ca_system_score_gemma":0.000062543855,"threshold_uncertainty_score":0.8297111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22805686,0.00010723185,0.7630026,0.000035236855,0.0001148914,0.00011414213,0.000012090637,0.000057940717,0.008499031],"genre_scores_gemma":[0.99708164,0.00004148601,0.0019319804,0.000013492903,0.000009490407,0.000014055639,0.0000039044703,0.0000031079078,0.0009008627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916536,0.000026226875,0.00031091238,0.0001858577,0.00015415644,0.00015748198],"domain_scores_gemma":[0.9995046,0.000012178585,0.000027382295,0.00037704693,0.000038301223,0.000040447663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018114694,0.00007206307,0.00014569848,0.00006009837,0.000035622088,0.000034787383,0.00034974594,0.00003151509,0.00006165565],"category_scores_gemma":[0.0000011697196,0.00006345574,0.000025299154,0.00043119534,0.0000098924675,0.0006111325,0.0000066737693,0.000068105204,0.0000274447],"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.000006318428,0.00008558753,0.0002883574,0.00008073624,0.0000047476774,0.000004334334,0.00026836921,0.970297,0.0002079063,0.0021553633,0.00003013518,0.026571194],"study_design_scores_gemma":[0.0002083278,0.000014228698,0.00016549893,0.00009166695,0.0000010760014,0.00001208662,0.000036760186,0.99867564,0.00007037453,0.0000030551905,0.00064525387,0.00007601175],"about_ca_topic_score_codex":0.0007189211,"about_ca_topic_score_gemma":0.000034203822,"teacher_disagreement_score":0.7690247,"about_ca_system_score_codex":0.000015948444,"about_ca_system_score_gemma":0.000035179615,"threshold_uncertainty_score":0.25876498},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00972019,0.00002413112,0.9854948,0.00014896684,0.00014654621,0.0002190237,0.000021539781,0.0001678035,0.0040570335],"genre_scores_gemma":[0.9561001,0.0000014302332,0.042365633,0.00007645999,0.000013683488,0.000042405576,0.0000017239634,0.0000034277703,0.0013951407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.000009639713,0.00019152698,0.00022169806,0.00011254829,0.00024312049],"domain_scores_gemma":[0.99948657,0.000027578468,0.000035503854,0.0003229987,0.000058071993,0.00006925589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013790283,0.00007889881,0.000115079645,0.0000222141,0.00019931291,0.00009349486,0.0003220396,0.00003984506,0.00003288404],"category_scores_gemma":[0.000004162874,0.00006963538,0.00008373962,0.00012213105,0.000021474814,0.00092248153,0.000012826876,0.000058098292,0.000014146592],"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.000021780692,0.0010037628,0.0025674542,0.00029697447,0.0000939947,0.000004898887,0.008679636,0.39699966,0.00046698924,0.18205021,0.017572617,0.390242],"study_design_scores_gemma":[0.00026156692,0.00001661714,0.0005268795,0.0000058027704,0.0000020183354,0.0000016286799,0.000016355072,0.9977411,0.00010147755,0.00036386424,0.00086655904,0.00009611933],"about_ca_topic_score_codex":0.000032968408,"about_ca_topic_score_gemma":0.00006236617,"teacher_disagreement_score":0.9463799,"about_ca_system_score_codex":0.000023197821,"about_ca_system_score_gemma":0.0000076017964,"threshold_uncertainty_score":0.28396484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009205299,0.00028980843,0.991373,0.0010864228,0.0002000409,0.00025677364,0.000035276065,0.00008380474,0.0057543544],"genre_scores_gemma":[0.8180869,0.000023905279,0.18044598,0.00037963732,0.00013147465,0.00004223851,0.00005316116,0.000007883927,0.00082878885],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889904,0.000018932447,0.00020637922,0.00040711457,0.000115569004,0.00035293322],"domain_scores_gemma":[0.9990019,0.00011782223,0.000061300714,0.000715696,0.000039105616,0.000064173524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040679928,0.00007177995,0.00009174896,0.000021004318,0.00029961512,0.00020869703,0.00059813017,0.000019784577,0.000023286475],"category_scores_gemma":[0.000036245303,0.00006459841,0.000020916896,0.00018888604,0.000019303749,0.0002517445,0.00041553235,0.000031218202,0.000007824177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034158688,0.0001138802,0.0035331903,0.000056435143,0.000081126316,0.000006169613,0.0014946256,0.024442425,0.00007270804,0.279267,0.5359173,0.15501173],"study_design_scores_gemma":[0.00024543417,0.000009728106,0.00022840055,0.000007340879,0.000003764714,0.000004828669,0.00013225619,0.92935574,0.000009332707,0.00030504653,0.069613986,0.00008411921],"about_ca_topic_score_codex":0.000046730907,"about_ca_topic_score_gemma":0.000078362646,"teacher_disagreement_score":0.90491337,"about_ca_system_score_codex":0.0000075574503,"about_ca_system_score_gemma":0.0000072060034,"threshold_uncertainty_score":0.26342466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037473624,0.000071571856,0.9675725,0.005105112,0.00017496427,0.000536009,0.000030183208,0.00026090487,0.022501357],"genre_scores_gemma":[0.98973966,6.987666e-7,0.0045572664,0.005355661,0.00010232919,0.00005045121,0.000026666816,0.0000113940805,0.00015584943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980731,0.0001134794,0.0004023029,0.00057749194,0.00043780252,0.0003958267],"domain_scores_gemma":[0.9984007,0.00022642771,0.00020536952,0.0008203775,0.00018902848,0.00015810736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040438146,0.00023682833,0.0003377464,0.00008493626,0.00017704704,0.00023530982,0.00055761664,0.000081934915,0.00011099227],"category_scores_gemma":[0.00003627714,0.00017743341,0.00007882181,0.00030519575,0.00004377376,0.00046315728,0.00001794456,0.00018569715,0.000096325515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022094003,0.0026890887,0.056002088,0.0001340431,0.00041951967,0.00018060526,0.0012397661,0.15655135,0.006903751,0.53422093,0.085967325,0.15348214],"study_design_scores_gemma":[0.0060179858,0.0005643038,0.003311059,0.00007656481,0.000010533975,0.000012579291,0.0000095228415,0.9711002,0.00020914063,0.000041100157,0.01835899,0.0002879834],"about_ca_topic_score_codex":0.00003388362,"about_ca_topic_score_gemma":0.000018973531,"teacher_disagreement_score":0.9859923,"about_ca_system_score_codex":0.000061905936,"about_ca_system_score_gemma":0.00010288364,"threshold_uncertainty_score":0.7235524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43127862,0.000042361782,0.5619724,0.00009105325,0.00037358116,0.0003644554,0.0000029610785,0.0000742947,0.005800315],"genre_scores_gemma":[0.9614799,0.0000014091173,0.03822231,0.000018032517,0.00008832896,0.000019566158,0.0000022695535,0.0000087109165,0.00015946622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984742,0.000027977037,0.0004908022,0.00039807346,0.00029057526,0.00031839308],"domain_scores_gemma":[0.9987058,0.00009276286,0.00034398065,0.0006013745,0.00017475655,0.00008129179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059418945,0.00015152835,0.00026999947,0.0001083893,0.00007068149,0.00012432653,0.00051148084,0.00013848039,0.000004337855],"category_scores_gemma":[0.000042061216,0.000115284565,0.00003236868,0.00053515175,0.000040970706,0.00091262726,0.00006784394,0.00039911296,0.000010625866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027488376,0.00067660597,0.039118517,0.00040711096,0.000042115367,0.000044417815,0.0076184548,0.007888514,0.12529397,0.7797008,0.00016434495,0.03877024],"study_design_scores_gemma":[0.0023857641,0.0004966678,0.13906685,0.0018598633,0.000010395464,0.00019221667,0.0020741913,0.77621686,0.065211795,0.0014958163,0.009936638,0.0010529361],"about_ca_topic_score_codex":0.00014850171,"about_ca_topic_score_gemma":0.000077184915,"teacher_disagreement_score":0.77820504,"about_ca_system_score_codex":0.000055572826,"about_ca_system_score_gemma":0.00007422735,"threshold_uncertainty_score":0.47011682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19339992,0.00018274525,0.8037513,0.00032563508,0.0012429896,0.00044105758,0.00041803473,0.00012941398,0.00010893245],"genre_scores_gemma":[0.99932677,0.000046213176,0.0002614976,0.000045568027,0.00004575273,0.00013205892,0.000020589134,0.000011431105,0.00011014924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.00010456039,0.00047698722,0.0006009632,0.00026122847,0.00040020334],"domain_scores_gemma":[0.99889266,0.00020083977,0.00012173728,0.0004486487,0.00008715433,0.0002489781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000328858,0.00026988046,0.0003832708,0.00016830156,0.00032788012,0.0004255706,0.00040342627,0.00021890852,0.0000036027275],"category_scores_gemma":[0.000015198583,0.0002410275,0.000057079338,0.0004447382,0.0001181162,0.00035756582,0.0000140731645,0.00042632618,0.000014028778],"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.0017456542,0.0051343464,0.014681325,0.0018996337,0.00053848844,0.0013572513,0.00756092,0.8342838,0.03234079,0.027038816,0.010737373,0.06268159],"study_design_scores_gemma":[0.003277511,0.00013905796,0.006704671,0.00016763179,0.000013263814,0.00037862838,0.00028498285,0.9844724,0.00020436382,0.0002216104,0.0035648705,0.00057099835],"about_ca_topic_score_codex":0.0008330481,"about_ca_topic_score_gemma":0.00063414284,"teacher_disagreement_score":0.8059268,"about_ca_system_score_codex":0.00002970551,"about_ca_system_score_gemma":0.000050232342,"threshold_uncertainty_score":0.9828816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01605328,0.000037947597,0.9823125,0.00043931542,0.00016307435,0.0002777166,0.000008627927,0.0003035377,0.000403995],"genre_scores_gemma":[0.5033603,0.0000016227852,0.49625453,0.0001663173,0.000033875367,0.000025706893,0.0000060481143,0.000005704494,0.00014591835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989875,0.000022288028,0.00024482806,0.00030699384,0.00019998637,0.00023840056],"domain_scores_gemma":[0.9992678,0.00004511358,0.00008289178,0.00033348572,0.0001652848,0.000105399755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016914528,0.00011723714,0.0001447575,0.000056325724,0.0003624066,0.00008489256,0.0003191565,0.000064331456,0.0000015313321],"category_scores_gemma":[0.000025360507,0.00010324349,0.000083268074,0.00024390008,0.000011427554,0.00068937236,0.000036683654,0.00005770826,0.000008165124],"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.0000066122243,0.00013677862,0.000075052114,0.000038465652,0.0000114323,0.0000057254633,0.0009745599,0.9823398,0.0025054608,0.012295188,0.0010154364,0.000595497],"study_design_scores_gemma":[0.00041148046,0.000019156858,0.000008377373,0.000023705818,0.0000035212852,0.0000068504105,0.000024066305,0.9960488,0.0015972938,0.00040751204,0.0013005652,0.00014864051],"about_ca_topic_score_codex":0.000015255408,"about_ca_topic_score_gemma":0.000003365813,"teacher_disagreement_score":0.48730698,"about_ca_system_score_codex":0.000055625864,"about_ca_system_score_gemma":0.00024957614,"threshold_uncertainty_score":0.42101473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016651288,0.00007038539,0.97415817,0.0009184913,0.000054597167,0.0000936045,0.00000413705,0.00021758757,0.00783175],"genre_scores_gemma":[0.9335762,0.00000454683,0.06578675,0.00021128794,0.00002472037,0.000015420916,0.000009642103,0.000003952662,0.00036742908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929553,0.0000065820022,0.000109687724,0.00031479792,0.00014069548,0.0001326894],"domain_scores_gemma":[0.99897814,0.0000068130403,0.000038714694,0.00088705093,0.000051026902,0.000038236703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011432214,0.000067045745,0.000071564195,0.000022756018,0.00006554279,0.000096090895,0.00037871033,0.000016098602,0.000005091814],"category_scores_gemma":[0.000008261134,0.000048165006,0.00001278659,0.0002602212,0.000014305423,0.0004828575,0.00005776998,0.000042166925,0.000058326947],"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.000010302275,0.00012575777,0.00071940763,0.000037528232,0.000018481303,0.000045601108,0.00041148678,0.0027727429,0.005260784,0.95682704,0.0009956752,0.032775216],"study_design_scores_gemma":[0.011408646,0.00108113,0.033783853,0.001504439,0.000034650053,0.0013430339,0.000666888,0.14524601,0.113652185,0.014027716,0.6738882,0.0033632591],"about_ca_topic_score_codex":0.00019156249,"about_ca_topic_score_gemma":0.00009382282,"teacher_disagreement_score":0.9427993,"about_ca_system_score_codex":0.000019698544,"about_ca_system_score_gemma":0.00003721467,"threshold_uncertainty_score":0.19641119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059346494,0.0003778371,0.9807423,0.0011638503,0.0032555189,0.00046746843,0.0000107900405,0.00018281041,0.013740103],"genre_scores_gemma":[0.21561356,0.000029581415,0.76215345,0.016964432,0.0011367963,0.000040009712,0.000013368741,0.00010928827,0.0039395397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517477,0.00003294256,0.00079197425,0.0018873643,0.0011763679,0.00093659584],"domain_scores_gemma":[0.9969597,0.00019326215,0.00038326875,0.0017707974,0.00032655598,0.00036642406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011220332,0.0005843918,0.0006763155,0.0006283811,0.00028224505,0.0007813313,0.0036487067,0.00031030035,0.000021155074],"category_scores_gemma":[0.00014539441,0.00054889097,0.00014808445,0.0010023889,0.00025031925,0.0005083314,0.0009889875,0.0006896272,0.0001843939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042465676,0.000038929178,0.0001129113,0.00005907614,0.000014740926,0.00034321853,0.0008349427,0.031014534,0.00020654978,0.05811308,0.00095041865,0.9083074],"study_design_scores_gemma":[0.0011232728,0.00077221205,0.0006299874,0.0032493437,0.000022973902,0.00078025495,8.634413e-7,0.52863055,0.0031598955,0.19002382,0.26665226,0.004954544],"about_ca_topic_score_codex":0.000023641156,"about_ca_topic_score_gemma":0.000045343648,"teacher_disagreement_score":0.9033528,"about_ca_system_score_codex":0.0003170357,"about_ca_system_score_gemma":0.00040351925,"threshold_uncertainty_score":0.99969625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009106852,0.0001770935,0.9669587,0.001080737,0.0000821489,0.00020586787,0.0000046380505,0.000115254334,0.030464847],"genre_scores_gemma":[0.99186486,0.000016105483,0.0027232808,0.0001855269,0.000058832367,0.000042020834,0.000006128873,0.000003748326,0.005099498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.000011335957,0.00015394148,0.00018303754,0.00009445379,0.00032968246],"domain_scores_gemma":[0.99953306,0.000024023459,0.00004445867,0.00030293126,0.000053712607,0.00004181387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012948514,0.00006894445,0.000081925005,0.000022613218,0.000094773706,0.00011950759,0.00040718226,0.000032207576,0.000053590833],"category_scores_gemma":[0.0000040883183,0.00005967288,0.00004370042,0.00015204998,0.000008779269,0.00051765615,0.000023952985,0.00005142258,0.000114210896],"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.0000015592348,0.000043506763,0.000017921473,0.0000063258203,0.0000048481043,2.769214e-7,0.000067204375,0.0000880088,0.00013740249,0.8879637,0.024001256,0.087668],"study_design_scores_gemma":[0.00040478606,0.00013504278,0.0006349488,0.00000431286,0.0000015954034,0.000011220815,0.00003056073,0.6330183,0.00026263745,0.0022294864,0.36312762,0.00013945825],"about_ca_topic_score_codex":0.0000074027425,"about_ca_topic_score_gemma":0.000011217869,"teacher_disagreement_score":0.99095416,"about_ca_system_score_codex":0.000031891268,"about_ca_system_score_gemma":0.000011381,"threshold_uncertainty_score":0.24333894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017243248,0.00008634059,0.95726275,0.0011365646,0.0001479264,0.00019502408,0.0000036673991,0.00014711806,0.03929626],"genre_scores_gemma":[0.8541885,0.0000065174945,0.10262982,0.0013448456,0.000044750417,0.0000427281,0.0000028244297,0.000011043709,0.041728996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988544,0.00002456802,0.00019349807,0.00037320124,0.00025854819,0.00029578834],"domain_scores_gemma":[0.9990883,0.000009092171,0.00006699416,0.00068514614,0.000054546235,0.00009591091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009705551,0.00014244387,0.0001438251,0.00003982515,0.00006976928,0.00024517617,0.0005532338,0.000034063127,0.00012931092],"category_scores_gemma":[0.0000021609494,0.00009495253,0.000039561226,0.00020098976,0.000032958003,0.00041341418,0.00009395866,0.00006759819,0.00038750743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006706776,0.0029930095,0.019406794,0.00053264375,0.0004792947,0.0009909018,0.016144402,0.0013293818,0.0022915686,0.17722769,0.36879617,0.40974107],"study_design_scores_gemma":[0.0022925802,0.00020002939,0.0019713214,0.0001192111,0.0000073714455,0.00011143966,0.0001661659,0.8097386,0.00048447266,0.000036049743,0.18424967,0.000623112],"about_ca_topic_score_codex":0.000022220589,"about_ca_topic_score_gemma":0.000017374921,"teacher_disagreement_score":0.854633,"about_ca_system_score_codex":0.000023657582,"about_ca_system_score_gemma":0.0000042968177,"threshold_uncertainty_score":0.49807534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024221,0.00047329388,0.09427904,0.00062949676,0.00070754666,0.00015931178,0.000017501501,0.000043688462,0.0012680495],"genre_scores_gemma":[0.99565494,0.00002332106,0.004099907,0.00009033846,0.00007703335,0.000001833157,2.8923665e-7,0.0000046613936,0.00004767807],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99898744,0.000108853914,0.00029889133,0.0001672533,0.00023089927,0.00020664434],"domain_scores_gemma":[0.99914086,0.00007659063,0.00018467885,0.00039285488,0.00010640821,0.000098581666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007591964,0.00010391051,0.00017864777,0.000042500913,0.00020710568,0.0000772237,0.0006168469,0.000041919022,0.000017589866],"category_scores_gemma":[0.000056414487,0.000063039515,0.00006470856,0.00011672758,0.00010652143,0.00021501441,0.000113243244,0.00026956058,0.000010461357],"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.00033798348,0.0013510663,0.22637214,0.0003046164,0.00027144293,0.00023996754,0.0394766,0.00041939577,0.0061981184,0.032421097,0.008517948,0.68408966],"study_design_scores_gemma":[0.0028323052,0.00070947735,0.8804856,0.0007618115,0.000038040966,0.0011935431,0.0010865428,0.08644866,0.008117363,0.010284371,0.007429834,0.0006124443],"about_ca_topic_score_codex":0.000053406326,"about_ca_topic_score_gemma":0.0000054649236,"teacher_disagreement_score":0.68347716,"about_ca_system_score_codex":0.000020766689,"about_ca_system_score_gemma":0.000027805956,"threshold_uncertainty_score":0.25706768},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019306263,0.000010021213,0.955411,0.0007125642,0.00001939779,0.020176843,0.000007749451,0.00010076839,0.023368573],"genre_scores_gemma":[0.91049874,0.0000013257252,0.010376576,0.00021569154,0.000035951576,0.07660797,0.0000018246193,0.000003883201,0.0022580188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933594,0.000007147569,0.0001610867,0.00023093769,0.000113340706,0.000151534],"domain_scores_gemma":[0.99950725,0.000006763276,0.00003675576,0.0002770598,0.000074855845,0.00009734403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007190446,0.00006592265,0.00006759168,0.00003033234,0.000095481126,0.000081361926,0.00029904323,0.000025201245,0.000017181797],"category_scores_gemma":[0.000005460354,0.00005702717,0.0000136734225,0.00021148917,0.0000062076224,0.00047711763,0.000073689705,0.000037047415,0.00024031391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.474985e-7,0.00006344491,0.00003252315,0.0000136854605,0.0000017108165,2.1828302e-7,0.0003082971,0.00081009034,0.00097492174,0.9212975,0.0073039755,0.06919279],"study_design_scores_gemma":[0.00015720967,0.000018496761,0.00027208446,0.0000049050745,4.4077024e-7,0.0000032241796,0.000003962209,0.9383236,0.00024122346,0.00047443734,0.060415465,0.00008496151],"about_ca_topic_score_codex":0.000002471672,"about_ca_topic_score_gemma":0.0000024820724,"teacher_disagreement_score":0.94503444,"about_ca_system_score_codex":0.000012170464,"about_ca_system_score_gemma":0.0000073476135,"threshold_uncertainty_score":0.30888292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.341027,0.0005932584,0.6419279,0.000425705,0.0013105611,0.00023632021,0.000017431286,0.00024170004,0.014220162],"genre_scores_gemma":[0.9927888,0.0000074421073,0.006216132,0.0002510174,0.00011504956,0.000018210721,0.0000071402574,0.0000051782454,0.0005910364],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987684,0.000071037844,0.00026232123,0.00031659513,0.0002359611,0.00034566756],"domain_scores_gemma":[0.99899995,0.00008641236,0.000084976156,0.0005775412,0.000076091324,0.00017502155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055837765,0.00013959526,0.00019495378,0.000036918642,0.00013684576,0.00020138531,0.00044698856,0.00006362851,0.00005027449],"category_scores_gemma":[0.000040940635,0.00011735544,0.000038786136,0.00029109692,0.000042891774,0.0011921354,0.0001634342,0.00010417814,0.00010842437],"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.00001345632,0.00061722996,0.65444213,0.0001498658,0.000050862975,0.000008185479,0.0047539533,0.000097885204,0.0006845128,0.17370717,0.02523129,0.14024346],"study_design_scores_gemma":[0.0011450899,0.000084601925,0.86772835,0.00009499088,0.000013091659,0.000108367676,0.00023284047,0.03375794,0.0050840494,0.0022747512,0.08853017,0.0009457667],"about_ca_topic_score_codex":0.00010308268,"about_ca_topic_score_gemma":0.000008469679,"teacher_disagreement_score":0.65176183,"about_ca_system_score_codex":0.000024973378,"about_ca_system_score_gemma":0.000023135293,"threshold_uncertainty_score":0.4785616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004431596,0.0018006741,0.6299712,0.00007939693,0.0064557274,0.000645151,0.000048367914,0.00028824134,0.35627964],"genre_scores_gemma":[0.9783177,0.000026298581,0.00091117556,0.000107433065,0.00008260472,0.00009317049,0.0001515465,0.000015800588,0.020294273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984973,0.000043248896,0.00046303542,0.00045951025,0.00027769548,0.00025919272],"domain_scores_gemma":[0.99929696,0.000037001682,0.00016587466,0.0003265316,0.000104057646,0.00006958965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021765356,0.00021946015,0.0003475977,0.00014778317,0.000054147917,0.00007533661,0.0006523443,0.0002533846,0.00018671522],"category_scores_gemma":[0.000008181533,0.00020725315,0.0001168471,0.00024223348,0.000010741285,0.00036987782,0.00000576544,0.00035956688,0.00011516806],"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.00027380962,0.00094868045,0.0015467103,0.0010766779,0.00032932239,0.00036404174,0.013173688,0.0003191695,0.0016244468,0.50862443,0.016562337,0.45515668],"study_design_scores_gemma":[0.043816186,0.0013715101,0.25643572,0.010012158,0.0003602303,0.00040878373,0.006958103,0.38063073,0.009616798,0.048234366,0.22588164,0.01627379],"about_ca_topic_score_codex":0.00034083237,"about_ca_topic_score_gemma":0.00070548436,"teacher_disagreement_score":0.9738861,"about_ca_system_score_codex":0.000044000597,"about_ca_system_score_gemma":0.00018339804,"threshold_uncertainty_score":0.8451538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005068553,0.00022617579,0.99588615,0.00051386195,0.0007983299,0.0004519961,0.000029204837,0.00017809028,0.0018654927],"genre_scores_gemma":[0.20903789,0.0000208478,0.7844263,0.0031163883,0.0007850601,0.000047491434,0.00010731637,0.00007543811,0.0023832864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587953,0.0000658799,0.0006382952,0.0014938908,0.0013359208,0.0005864712],"domain_scores_gemma":[0.9979505,0.00036509932,0.00029579343,0.0009850044,0.0002556785,0.00014792844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000981835,0.00050965056,0.00057711254,0.00080730283,0.00017014646,0.00042891141,0.0025432622,0.0003926334,0.00004802043],"category_scores_gemma":[0.000048526857,0.00050051394,0.00015046126,0.0008082418,0.00030431108,0.00072947954,0.00015140318,0.00078476296,0.00008360656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017669521,0.000060520473,0.000023775054,0.000021286702,0.0000055083005,0.00010173277,0.00021627425,0.21238184,0.000046982375,0.0012455097,0.0000349003,0.785844],"study_design_scores_gemma":[0.0009339138,0.0003278586,0.00063860096,0.0012696189,0.000008320571,0.00006213683,1.6459371e-7,0.94358736,0.0013061815,0.048721313,0.0020231912,0.0011213624],"about_ca_topic_score_codex":0.00003883865,"about_ca_topic_score_gemma":0.00005049215,"teacher_disagreement_score":0.7847226,"about_ca_system_score_codex":0.00052282796,"about_ca_system_score_gemma":0.00078581093,"threshold_uncertainty_score":0.99974465},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007184624,0.00097514654,0.60304457,0.00025420552,0.00041486567,0.00018965616,0.00012729176,0.0006640309,0.39432302],"genre_scores_gemma":[0.010940957,0.0012439557,0.03594498,0.0006644746,0.0006206456,0.000019111245,0.00027930373,0.00026946873,0.9500171],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866676,0.000039395392,0.0002175126,0.0005394122,0.00024360802,0.00029333346],"domain_scores_gemma":[0.999111,0.000028560808,0.00016337157,0.000560642,0.000025462956,0.00011095881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006324023,0.00029467687,0.00038366293,0.0000836604,0.00010328904,0.00014867488,0.0005263684,0.00020170596,0.00006329289],"category_scores_gemma":[0.000010429255,0.00024306575,0.00005376798,0.00019172057,0.00007499163,0.00009521739,0.00018523967,0.00016496648,0.00012600103],"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.000002280463,0.000026051312,0.00006846363,0.00003523897,0.000027564045,0.0000522161,0.000042833224,0.000063948915,8.468063e-7,0.028548805,0.9662454,0.0048863245],"study_design_scores_gemma":[0.00026700407,0.000057757923,0.000252373,0.00033090336,0.0000025526222,0.00008543098,0.000009166077,0.0052260216,0.000002080127,0.00007666399,0.99334586,0.00034420233],"about_ca_topic_score_codex":0.00014560224,"about_ca_topic_score_gemma":0.00003425202,"teacher_disagreement_score":0.56709963,"about_ca_system_score_codex":0.00001967003,"about_ca_system_score_gemma":0.00003370229,"threshold_uncertainty_score":0.99119335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019066054,0.00024083698,0.96468353,0.0022106336,0.0001566642,0.00037047506,0.000008150701,0.000256333,0.013007347],"genre_scores_gemma":[0.9699956,0.000017777655,0.012618791,0.00052253215,0.00015321384,0.00022327363,0.0000016934722,0.000012810203,0.01645427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889064,0.000033994493,0.00015503472,0.00039430513,0.00022729486,0.0002987455],"domain_scores_gemma":[0.99897486,0.000054641514,0.000070629096,0.0006671733,0.00008988294,0.00014281503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014229998,0.00012952706,0.00016844392,0.000059590777,0.00021633234,0.00007093443,0.00072840735,0.00003822583,0.000025364834],"category_scores_gemma":[0.000018813518,0.00012616301,0.000047600282,0.0006866642,0.00003166313,0.00017285344,0.00013210974,0.00008450343,0.0005811894],"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.000055642333,0.0013659288,0.03988545,0.00040191345,0.0002592464,0.0002988462,0.12801021,0.005961522,0.039701313,0.38046002,0.2245656,0.1790343],"study_design_scores_gemma":[0.00035361806,0.000057427704,0.0276104,0.00008566643,0.0000031020654,0.00007102386,0.0003609444,0.011126747,0.0023027584,0.00042157396,0.9570422,0.00056449056],"about_ca_topic_score_codex":0.00035059985,"about_ca_topic_score_gemma":0.00011712046,"teacher_disagreement_score":0.9520647,"about_ca_system_score_codex":0.000040570692,"about_ca_system_score_gemma":0.00004874266,"threshold_uncertainty_score":0.7470208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05917849,0.005488824,0.89674336,0.012478216,0.0027303628,0.0016101118,0.00018408673,0.0011227428,0.020463837],"genre_scores_gemma":[0.99876803,0.000006428726,0.00033607436,0.0001472552,0.0000650855,0.000052559608,0.00004736498,0.000013450188,0.00056376285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730814,0.00028582316,0.00071420596,0.0006075073,0.0005052495,0.00057905784],"domain_scores_gemma":[0.9979731,0.00014987952,0.00020954631,0.0012758215,0.00014590785,0.00024574052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381048,0.00026993788,0.0004164257,0.000089941306,0.00016982993,0.00040511866,0.0014982198,0.00013588359,0.000005850372],"category_scores_gemma":[0.00015356638,0.00018011146,0.00008655976,0.0012636168,0.00009171019,0.00048763072,0.00021736893,0.0003090734,0.00009035208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007894938,0.00088935666,0.021017972,0.00018545617,0.00020308793,0.0008186168,0.0068067196,0.034190543,0.0016841568,0.6965208,0.21783723,0.019767106],"study_design_scores_gemma":[0.0018167662,0.0001326558,0.011924424,0.00019378695,0.000012781963,0.00022415182,0.0014219182,0.886869,0.00009775628,0.00061730755,0.09600342,0.0006860131],"about_ca_topic_score_codex":0.0007547144,"about_ca_topic_score_gemma":0.00017156547,"teacher_disagreement_score":0.9395895,"about_ca_system_score_codex":0.00015957114,"about_ca_system_score_gemma":0.00023019896,"threshold_uncertainty_score":0.7344732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076659824,0.0012048995,0.9841063,0.0018673479,0.0045884806,0.000662187,0.00009452605,0.0003089574,0.0070906593],"genre_scores_gemma":[0.4935501,0.00006639119,0.49020913,0.003126784,0.0040297937,0.000055468077,0.00008355783,0.00020349472,0.0086752875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924818,0.000085759726,0.0010417822,0.0028401152,0.0022870717,0.0012634647],"domain_scores_gemma":[0.9938306,0.00032144552,0.0005144492,0.0037994054,0.0009969072,0.0005371524],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018647483,0.000989393,0.0011039097,0.00055824936,0.00037026856,0.0012731162,0.006773195,0.0007092499,0.0000844782],"category_scores_gemma":[0.00013231504,0.0008781955,0.0003096988,0.0009443965,0.0013429149,0.0010385839,0.0026575134,0.001416683,0.00025269375],"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.000048191687,0.00033612712,0.0006354649,0.00030314812,0.0001511564,0.00028548023,0.002924707,0.4183378,0.0001576339,0.15149818,0.007203858,0.41811824],"study_design_scores_gemma":[0.000810049,0.00024863714,0.00026998608,0.0005604217,0.000017845608,0.00009151736,9.543633e-7,0.8778501,0.00013961871,0.09465954,0.023950608,0.0014006768],"about_ca_topic_score_codex":0.00027694958,"about_ca_topic_score_gemma":0.00028586143,"teacher_disagreement_score":0.49389717,"about_ca_system_score_codex":0.0007094428,"about_ca_system_score_gemma":0.0014274825,"threshold_uncertainty_score":0.99976367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049676634,0.0033060971,0.88981235,0.04045263,0.0034198752,0.0031064253,0.000050144346,0.0016440614,0.008531786],"genre_scores_gemma":[0.94863486,0.0013756665,0.019303938,0.017335352,0.00025826713,0.0011874528,0.0000062325557,0.000047089186,0.011851119],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996113,0.00014853018,0.00073919835,0.0008629849,0.00075955736,0.0013767267],"domain_scores_gemma":[0.99669313,0.0002600617,0.00038869155,0.0019204927,0.0003230261,0.00041460406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012701527,0.00040074965,0.00036373132,0.00017076364,0.0010379432,0.0034744155,0.0043335315,0.00026741633,0.00010551483],"category_scores_gemma":[0.00011312986,0.0003123475,0.0001991912,0.0012818663,0.000594616,0.0056124534,0.0007568322,0.0004806484,0.00064210215],"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.000026218862,0.0005344925,0.0060154423,0.00013266956,0.00008364484,0.00014193245,0.0042066076,0.00030582095,0.031149128,0.16605702,0.47372544,0.3176216],"study_design_scores_gemma":[0.0008313148,0.00053520454,0.0051801233,0.000916059,0.000017723798,0.00044800935,0.0015967265,0.172679,0.053484824,0.01955072,0.7428708,0.0018895048],"about_ca_topic_score_codex":0.00100604,"about_ca_topic_score_gemma":0.00013212534,"teacher_disagreement_score":0.89895827,"about_ca_system_score_codex":0.00021461435,"about_ca_system_score_gemma":0.00038762522,"threshold_uncertainty_score":0.9999329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014761662,0.00017054095,0.98449683,0.0025613257,0.0021360675,0.0006363353,0.000048119855,0.00026226314,0.00967375],"genre_scores_gemma":[0.42258564,0.000102237595,0.54653007,0.01780611,0.002599873,0.000057592308,0.000040506606,0.00014719473,0.010130779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940367,0.000072924166,0.00097301975,0.0025236094,0.001465487,0.0009282662],"domain_scores_gemma":[0.9955051,0.00034805623,0.00042160836,0.0029193622,0.0004990276,0.00030687012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018799367,0.00074169016,0.00094483956,0.00038434775,0.00040064508,0.0008168823,0.004973256,0.00052142184,0.000048644306],"category_scores_gemma":[0.00014950715,0.00052411616,0.0002560292,0.00068247184,0.00082370534,0.000509458,0.0016698367,0.0010767806,0.00021406659],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001721457,0.000043299482,0.00006147462,0.0001158393,0.000016098202,0.00004784273,0.0007072027,0.005807068,0.00011342422,0.020083195,0.00037360756,0.97261375],"study_design_scores_gemma":[0.00045054677,0.00021457748,0.00018060289,0.0005646734,0.000008150069,0.00007927046,7.601392e-8,0.7989511,0.0010496181,0.023975166,0.17342517,0.0011010416],"about_ca_topic_score_codex":0.0000893013,"about_ca_topic_score_gemma":0.000057041634,"teacher_disagreement_score":0.9715127,"about_ca_system_score_codex":0.0003937498,"about_ca_system_score_gemma":0.00072770525,"threshold_uncertainty_score":0.99972105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5702118,0.0016147485,0.29740322,0.023540141,0.0023633186,0.0042490778,0.000014737311,0.00088776136,0.099715166],"genre_scores_gemma":[0.9951335,0.000008227393,0.004052568,0.00010811009,0.000037161204,0.00009701479,1.9743572e-7,0.0000062205777,0.0005569688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989096,0.000003852284,0.00025939336,0.00024028328,0.0003503049,0.00023655721],"domain_scores_gemma":[0.9993712,0.000006653544,0.00018735287,0.00012521388,0.00025210084,0.000057505134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017249398,0.00011445215,0.00014992186,0.000036563222,0.00011392385,0.00022287204,0.0008297125,0.00004028045,0.000016329828],"category_scores_gemma":[0.0000122931815,0.00007476407,0.00007795153,0.00036708612,0.00003520244,0.00089659996,0.00009336272,0.00009408954,0.000028255903],"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.000023272729,0.0007013252,0.00489278,0.001644358,0.00011229727,9.517532e-7,0.008857253,0.00023842466,0.40818477,0.08125832,0.03135312,0.46273315],"study_design_scores_gemma":[0.0021056987,0.00027014365,0.017647756,0.001171491,0.00005137732,0.000111361085,0.0014267473,0.10843143,0.8074706,0.024663689,0.035718985,0.0009306829],"about_ca_topic_score_codex":0.00011402819,"about_ca_topic_score_gemma":4.937992e-7,"teacher_disagreement_score":0.46180245,"about_ca_system_score_codex":0.000052938063,"about_ca_system_score_gemma":0.00002527022,"threshold_uncertainty_score":0.30487907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7789754,0.0010230201,0.19508718,0.0035606227,0.00083882315,0.0010976708,0.00003617458,0.0007011133,0.018679982],"genre_scores_gemma":[0.9862143,0.000026143598,0.012226511,0.0006046599,0.000059939128,0.00007921476,0.000009849439,0.0000073478936,0.0007720757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873024,0.000022876582,0.00029459302,0.00045278604,0.00018501366,0.00031451776],"domain_scores_gemma":[0.9988994,0.00004454508,0.00009112349,0.00051414256,0.00023220989,0.000218586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046938928,0.00013939741,0.00021745828,0.00004955154,0.0001424767,0.00021039518,0.00053041277,0.00008560603,0.0000023714204],"category_scores_gemma":[0.0000147199435,0.00011212478,0.000046692156,0.00034325296,0.00005774234,0.0004652011,0.00010843672,0.000067922076,0.000013273227],"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.00033259753,0.00082183734,0.11212452,0.0017893477,0.00029408984,0.00003823472,0.003824071,0.00042007767,0.0026394834,0.74449164,0.06808322,0.06514087],"study_design_scores_gemma":[0.0028050065,0.0007994008,0.023268264,0.000115635485,0.00002293336,0.00012375102,0.00030893742,0.611819,0.00068379706,0.0042851055,0.3550629,0.0007052242],"about_ca_topic_score_codex":0.00009692133,"about_ca_topic_score_gemma":0.000024665724,"teacher_disagreement_score":0.74020654,"about_ca_system_score_codex":0.000013831065,"about_ca_system_score_gemma":0.00006478175,"threshold_uncertainty_score":0.45723158},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021638641,0.000032838685,0.9732293,0.00041988023,0.0010650624,0.00036600707,0.000013975808,0.00011694004,0.024539603],"genre_scores_gemma":[0.71304625,0.000013204869,0.22314502,0.0010426511,0.00055015844,0.0006203133,0.00018209901,0.00002838113,0.06137194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992632,0.0000075960565,0.00015638795,0.0002170202,0.00021475894,0.00014099223],"domain_scores_gemma":[0.99952877,0.0000052185824,0.00003473866,0.00021768209,0.00013003626,0.0000835382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019637447,0.00007537568,0.000088870554,0.000033678338,0.00005932745,0.000106771986,0.00028465595,0.00003281223,0.000018342429],"category_scores_gemma":[0.0000023963412,0.000066989356,0.000044194632,0.00013681765,0.00000778532,0.000373977,0.000021577216,0.000019244482,0.000048173697],"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.000060002832,0.00029508123,0.00017550758,0.00019510272,0.00011541019,0.000015943013,0.0007305407,0.014019901,0.00007690984,0.68532395,0.16489139,0.13410027],"study_design_scores_gemma":[0.0019089152,0.00012963667,0.0002777315,0.00003350648,0.000016093132,0.000017191274,0.00029116432,0.20355976,0.0009009993,0.0045168307,0.7880495,0.00029868208],"about_ca_topic_score_codex":0.0000158793,"about_ca_topic_score_gemma":0.0000071192107,"teacher_disagreement_score":0.7500843,"about_ca_system_score_codex":0.000040004765,"about_ca_system_score_gemma":0.000032133285,"threshold_uncertainty_score":0.27317467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08898484,0.0005813564,0.9022774,0.00070881133,0.0014634194,0.00032707842,0.0000045661045,0.0002609355,0.005391576],"genre_scores_gemma":[0.98309714,0.00006111519,0.015874492,0.0003224731,0.00013713054,0.00004030026,0.000008861333,0.000010924068,0.000447564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984064,0.00003586892,0.000341732,0.00071678404,0.00016821317,0.00033099268],"domain_scores_gemma":[0.99893206,0.000041282543,0.00013258902,0.00073804206,0.00004969258,0.00010633358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004349833,0.00023558634,0.00034814532,0.0000941556,0.000044321707,0.0004209198,0.000935572,0.00044699106,0.0000076362985],"category_scores_gemma":[0.000015919099,0.00021460428,0.0000561389,0.00017028744,0.00004408129,0.00018979183,0.0015570462,0.0010231076,0.000008123057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031812422,0.00056201295,0.10183779,0.0012531432,0.00013575847,0.0007947738,0.0048704515,0.020130215,0.00045868376,0.3954206,0.026014987,0.44848976],"study_design_scores_gemma":[0.00039721892,0.000025693716,0.055530593,0.0002969175,0.0000036159709,0.00004795353,0.000016337823,0.924704,0.000024705503,0.004067417,0.014240348,0.000645157],"about_ca_topic_score_codex":0.0008399055,"about_ca_topic_score_gemma":0.0003748376,"teacher_disagreement_score":0.9045738,"about_ca_system_score_codex":0.000026307445,"about_ca_system_score_gemma":0.000045934237,"threshold_uncertainty_score":0.87513083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8653115,0.003044976,0.019166606,0.011774501,0.0017947934,0.002054431,0.000047399495,0.00014213842,0.096663654],"genre_scores_gemma":[0.9993048,0.000012662087,0.0004775117,0.00005554218,0.000017560737,0.00001985673,1.514533e-7,0.000004251075,0.000107716754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988748,0.000014553171,0.00034615077,0.00017498662,0.00039593448,0.00019362074],"domain_scores_gemma":[0.9992649,0.00005274781,0.00028711025,0.00019217886,0.00016083363,0.00004220811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066032895,0.00010784038,0.00021014606,0.000053302243,0.00006912688,0.00006481237,0.0008749725,0.00003420985,0.0000011048649],"category_scores_gemma":[0.000114740804,0.00005948293,0.00006552324,0.0004451088,0.00015497458,0.0002416839,0.00028798514,0.00009277092,0.0000011466794],"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.000030431616,0.00018648447,0.056550216,0.00021306882,0.000075760865,0.0000022856973,0.016343338,0.00020418473,0.008386954,0.91182774,0.005701622,0.00047790396],"study_design_scores_gemma":[0.013280998,0.0015838705,0.0772793,0.004579651,0.00025712012,0.0005222766,0.15836132,0.04074893,0.341222,0.33482084,0.024872161,0.0024715618],"about_ca_topic_score_codex":0.00016733493,"about_ca_topic_score_gemma":0.00002747058,"teacher_disagreement_score":0.57700694,"about_ca_system_score_codex":0.00013674996,"about_ca_system_score_gemma":0.00006999453,"threshold_uncertainty_score":0.24256435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08886988,0.00003170696,0.90785325,0.0020677382,0.00047551453,0.00011202623,0.0000012288681,0.0000805113,0.00050817424],"genre_scores_gemma":[0.9902238,0.000010966436,0.009308135,0.00032544378,0.00010986953,0.000009973044,4.9198917e-7,0.00000318847,0.000008094823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984732,0.00010836795,0.00021911759,0.0005452871,0.00021424606,0.00043972995],"domain_scores_gemma":[0.9992616,0.00017625913,0.0000471444,0.00029019613,0.00009729823,0.00012749642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009187108,0.00010861438,0.00015476637,0.00012686537,0.00014055637,0.00015259451,0.00060388417,0.00006883666,0.000013806088],"category_scores_gemma":[0.000042688436,0.00007257113,0.000020007823,0.00075490965,0.0014306034,0.0005936018,0.00026280084,0.00010102401,0.000033199707],"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.000011320272,0.000028383554,0.00025396512,0.000002530279,0.0000013069734,0.000008740482,0.000117350195,0.000026677117,0.0010366893,0.7060021,0.000062126346,0.29244876],"study_design_scores_gemma":[0.0009904321,0.00044004983,0.013099472,0.00013281436,0.0000025610498,0.00017275692,0.000009542069,0.7286216,0.0026761836,0.25307906,0.00038776456,0.0003877714],"about_ca_topic_score_codex":0.000008519034,"about_ca_topic_score_gemma":0.0000041289727,"teacher_disagreement_score":0.90135396,"about_ca_system_score_codex":0.000058797326,"about_ca_system_score_gemma":0.000040099643,"threshold_uncertainty_score":0.5271118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011054125,0.0011516903,0.99368995,0.00036024337,0.0013062061,0.00043031332,0.000032900112,0.000073175375,0.0018500976],"genre_scores_gemma":[0.8594082,0.00003501554,0.13986278,0.0002991878,0.00025732166,0.0000051250845,0.0000069308953,0.00001986919,0.0001055428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672055,0.00003965699,0.0005330542,0.001428356,0.0006722158,0.00060614105],"domain_scores_gemma":[0.99787927,0.00011747759,0.00041293883,0.0012242959,0.0002109581,0.00015507331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067639304,0.000452894,0.0005831084,0.00032793725,0.00032962882,0.00094685087,0.0019827865,0.00034483214,0.0000033401636],"category_scores_gemma":[0.00010733962,0.00044121037,0.000059034213,0.00035055663,0.00075910747,0.0004540546,0.00104014,0.00039916238,0.000007758766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010683662,0.00003867318,0.0018100636,0.00013217279,0.000014744193,0.0004988804,0.0005462699,0.07835525,0.000065652974,0.023654286,0.000025593941,0.89484775],"study_design_scores_gemma":[0.00045412596,0.000060252623,0.001143189,0.0009075808,0.000005429456,0.00028086515,2.2421945e-7,0.9622025,0.00002880724,0.033712246,0.00066167733,0.0005430934],"about_ca_topic_score_codex":0.00026944754,"about_ca_topic_score_gemma":0.00061555096,"teacher_disagreement_score":0.89430463,"about_ca_system_score_codex":0.0005313448,"about_ca_system_score_gemma":0.000594749,"threshold_uncertainty_score":0.99980396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043186317,0.00051558384,0.99142975,0.0007703131,0.00015210014,0.0002053676,0.000017467095,0.00003000956,0.0025607909],"genre_scores_gemma":[0.91253734,0.0006434136,0.0862219,0.00018439355,0.00027314964,0.00006890511,0.000013838845,0.000008404627,0.00004864877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899095,0.00003664323,0.00041156655,0.00017163984,0.00026793565,0.00012128769],"domain_scores_gemma":[0.9988112,0.000133857,0.00032453405,0.00010489088,0.00050783815,0.00011766681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025231548,0.00010148067,0.00015130817,0.00012910148,0.00014084377,0.00023653873,0.00037472913,0.000040056482,0.0000038308667],"category_scores_gemma":[0.000009531103,0.000096370284,0.000051162784,0.00017199885,0.00003432056,0.0006134363,0.00007052564,0.00009242508,0.00001272998],"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.00000538854,0.00010422666,0.00008077206,0.000014327708,0.00006662081,0.000006164564,0.00013444887,0.0003489662,0.0007589799,0.93351054,0.00062248646,0.06434707],"study_design_scores_gemma":[0.005029356,0.00040313267,0.0073727868,0.00036438854,0.00008794476,0.005762611,0.00021744511,0.19037272,0.0010714177,0.15285732,0.6353947,0.0010661883],"about_ca_topic_score_codex":0.0000018553364,"about_ca_topic_score_gemma":2.9470624e-7,"teacher_disagreement_score":0.9082187,"about_ca_system_score_codex":0.000030377312,"about_ca_system_score_gemma":0.00005929533,"threshold_uncertainty_score":0.39298663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016945468,0.00002899321,0.92277443,0.006451403,0.00067476224,0.000041171257,0.0000051412712,0.00019368046,0.068135865],"genre_scores_gemma":[0.9807436,0.0000041503963,0.0040009,0.00061222975,0.00012789316,0.0000058609626,4.137218e-7,0.000002492078,0.014502461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947137,0.000011630315,0.000093030445,0.00016859228,0.000114616014,0.00014077184],"domain_scores_gemma":[0.9995085,0.000024887506,0.000021057704,0.00035696747,0.00003369312,0.00005491492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008871108,0.00004932035,0.000060898496,0.000014752113,0.00003166043,0.00005335615,0.00043885835,0.000022073671,0.000048760026],"category_scores_gemma":[0.000010989791,0.000026073085,0.000024687572,0.00009915386,0.000014865763,0.0002900188,0.00007424124,0.000015302572,0.0004644483],"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":[9.752911e-7,0.0000320971,0.0008734074,0.0000036600602,0.0000066802854,0.000013974122,0.00007474286,4.2063164e-7,0.0038494621,0.73208255,0.18767047,0.07539154],"study_design_scores_gemma":[0.00024542175,0.00002147085,0.0017265022,0.000018777293,4.721986e-7,0.000011230984,0.0000048546594,0.0005111561,0.0031487145,0.0007943142,0.993403,0.000114038325],"about_ca_topic_score_codex":0.000017195713,"about_ca_topic_score_gemma":0.000006332644,"teacher_disagreement_score":0.979049,"about_ca_system_score_codex":0.000011073228,"about_ca_system_score_gemma":0.00001492782,"threshold_uncertainty_score":0.5969698},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44343433,0.006688325,0.48800275,0.0075499155,0.0010670455,0.001685692,0.00035103675,0.00041256237,0.050808337],"genre_scores_gemma":[0.9764371,0.00012378943,0.020492109,0.00003191454,0.000022273733,0.00008073965,0.00015660406,0.000023577848,0.0026318904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99297315,0.00424436,0.0010163562,0.0009676149,0.00044770195,0.00035079877],"domain_scores_gemma":[0.99365497,0.0012240172,0.00092486327,0.00245112,0.0015852387,0.00015976884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0060386513,0.00034276122,0.0006650284,0.0002833009,0.00014111846,0.0005195538,0.0013421916,0.00035393483,0.000007070053],"category_scores_gemma":[0.0008011872,0.00037092523,0.00012665142,0.00043887433,0.00020268196,0.00010552003,0.0011667656,0.0005160234,0.000012445814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094098614,0.0018625134,0.012943202,0.005837689,0.00036846608,0.00013134893,0.04880251,0.011756552,0.010603666,0.7475401,0.012399834,0.14766002],"study_design_scores_gemma":[0.0014870971,0.0000017647723,0.012913758,0.008770825,0.00003384743,0.00010350296,0.00024358487,0.95687765,0.004351644,0.0029005632,0.011369284,0.00094650773],"about_ca_topic_score_codex":0.0029330573,"about_ca_topic_score_gemma":0.0011450208,"teacher_disagreement_score":0.94512105,"about_ca_system_score_codex":0.0000950561,"about_ca_system_score_gemma":0.00026989903,"threshold_uncertainty_score":0.9998743},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39358214,0.0005977657,0.105470434,0.01625444,0.004042369,0.0019498118,0.000031421634,0.00069155137,0.47738007],"genre_scores_gemma":[0.9970141,0.000003400866,0.0020877253,0.00024217482,0.000054551674,0.000020090862,2.0333833e-7,0.000004155981,0.0005736062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910986,0.000005035731,0.00020820857,0.00019998886,0.00029521008,0.00018170298],"domain_scores_gemma":[0.99943274,0.000017513383,0.00017047462,0.00019262185,0.00013858668,0.00004804056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032216855,0.000090956615,0.00014067983,0.000024739033,0.00007528951,0.00008007339,0.0011417078,0.00002811797,0.0000042869688],"category_scores_gemma":[0.000049456572,0.000058012032,0.00007456373,0.00021246349,0.00003827459,0.00018955077,0.00027654832,0.000067272755,0.00001902585],"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.0000034857817,0.00006306741,0.002331287,0.000068272144,0.0000194934,1.0122881e-7,0.00042296553,0.000014523986,0.02573156,0.94629186,0.012127362,0.012926041],"study_design_scores_gemma":[0.0015149168,0.00022381188,0.0144500295,0.00032605918,0.000022488966,0.00003966877,0.00013481657,0.023443405,0.3328744,0.029658213,0.5968274,0.0004848332],"about_ca_topic_score_codex":0.000020451296,"about_ca_topic_score_gemma":4.6227726e-7,"teacher_disagreement_score":0.9166336,"about_ca_system_score_codex":0.000022004037,"about_ca_system_score_gemma":0.000010834772,"threshold_uncertainty_score":0.2365662},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006087731,0.8588279,0.13868122,0.000031648367,0.0007581447,0.00039708486,0.00002839027,0.00039544972,0.0008741013],"genre_scores_gemma":[0.0002874965,0.99654543,0.0022023618,0.000032114753,0.00036195866,0.000023192315,0.00022181768,0.000039248167,0.00028638836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99606997,0.0012917481,0.00087214855,0.0008781143,0.0004089113,0.00047910275],"domain_scores_gemma":[0.99700487,0.00047760239,0.0005183536,0.0017586902,0.00012797704,0.000112531816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022190236,0.00047869358,0.001378692,0.00015460225,0.00020712898,0.0004217849,0.0035354765,0.00028846718,0.0000108448085],"category_scores_gemma":[0.00017422749,0.0004064941,0.00034116264,0.0011687474,0.000029169509,0.00026504422,0.00035173743,0.00041367745,0.0004232716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5826124e-8,0.000026054095,0.000009735648,0.00247549,0.000030029392,0.000013480928,0.00007620804,0.000033507076,6.1605294e-9,0.00017148111,0.0011621319,0.9960018],"study_design_scores_gemma":[0.000071220325,0.000019910081,0.000047373836,0.0062425025,0.000030268557,0.00006605625,0.0000016223564,0.0032406626,1.7963914e-7,0.00013894388,0.9896556,0.0004856276],"about_ca_topic_score_codex":0.00007178944,"about_ca_topic_score_gemma":0.000014711278,"teacher_disagreement_score":0.9955162,"about_ca_system_score_codex":0.000069028574,"about_ca_system_score_gemma":0.0003143147,"threshold_uncertainty_score":0.9998387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019608273,0.00046115433,0.9927154,0.0006243758,0.00073797384,0.0004002519,0.000020436426,0.000083972416,0.002995594],"genre_scores_gemma":[0.87589306,0.0000027983015,0.12353443,0.00031736717,0.00013954846,0.0000071983786,0.000004934911,0.000018625358,0.000082053986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968257,0.000041307456,0.0005814516,0.0011563791,0.00099274,0.0004024467],"domain_scores_gemma":[0.9974823,0.00037483333,0.00044222476,0.00092780555,0.00059782603,0.0001750085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010740227,0.00040912075,0.00056816044,0.00053221604,0.0001303524,0.00024109065,0.0011733583,0.0002735545,0.000002443289],"category_scores_gemma":[0.000170279,0.000366757,0.00006970869,0.00051989034,0.0005461221,0.00013282831,0.00023109872,0.00045977012,0.000007457918],"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.000044921093,0.00006513454,0.00012553732,0.00023528081,0.000013528522,0.000108223314,0.00080921577,0.77634656,0.00019921733,0.015635734,0.0000485366,0.20636809],"study_design_scores_gemma":[0.00045283747,0.00024318244,0.00005030743,0.00080702495,0.000005770369,0.000052627085,4.179803e-7,0.97138494,0.00083646487,0.02543276,0.00032937474,0.00040430203],"about_ca_topic_score_codex":0.000015566202,"about_ca_topic_score_gemma":0.000022188886,"teacher_disagreement_score":0.87393224,"about_ca_system_score_codex":0.0001326234,"about_ca_system_score_gemma":0.00092681317,"threshold_uncertainty_score":0.99987847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006543941,0.00007382801,0.9900847,0.00017224449,0.00033099818,0.0003701114,0.000008000585,0.000226238,0.008079483],"genre_scores_gemma":[0.85541564,2.4301525e-7,0.14373158,0.00014129013,0.0000987801,0.000079567944,0.000038865026,0.0000067775445,0.000487267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990704,0.00003295129,0.00016784896,0.0002915556,0.00021958404,0.00021765793],"domain_scores_gemma":[0.9991469,0.000028947808,0.000063214065,0.00038157363,0.00024860862,0.00013076296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026917,0.000104330924,0.00013398517,0.000041349373,0.00006296027,0.00016993852,0.00040628263,0.000060464958,0.0000014138307],"category_scores_gemma":[0.000053189433,0.0000865141,0.000045333767,0.000304147,0.000016000284,0.0002802627,0.000036163878,0.00003601186,0.000020427333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014228637,0.0017339494,0.0046782093,0.00064712885,0.00013875341,0.000022770482,0.0040360796,0.065642,0.0009043671,0.44867724,0.2707462,0.20263101],"study_design_scores_gemma":[0.00089637,0.00008642062,0.00006727692,0.000009937944,0.0000026385226,0.0000027349918,0.000091746966,0.99294007,0.0007005101,0.0004188389,0.0046381787,0.00014528041],"about_ca_topic_score_codex":0.000029383096,"about_ca_topic_score_gemma":0.0000024843753,"teacher_disagreement_score":0.92729807,"about_ca_system_score_codex":0.000065283675,"about_ca_system_score_gemma":0.00014219331,"threshold_uncertainty_score":0.35279426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40184623,0.0011635273,0.57142395,0.002885837,0.0015665239,0.00061975693,0.000028424693,0.0007315847,0.019734185],"genre_scores_gemma":[0.94446474,0.0000147093815,0.055160195,0.00014308446,0.0001327703,0.000009632678,0.0000011002227,0.000005803263,0.00006798389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990739,0.000036226433,0.00018300279,0.00032712804,0.00012868481,0.00025104772],"domain_scores_gemma":[0.9994764,0.000048861522,0.000040482813,0.00031070792,0.000050909595,0.00007264429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316085,0.00009823392,0.00014112492,0.00005956106,0.00007029897,0.00011754147,0.0003575993,0.00005294233,0.000005463214],"category_scores_gemma":[0.000017354387,0.0000900961,0.000020367974,0.00033590628,0.000052649077,0.00030791687,0.00014906489,0.00007836488,0.000058139565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017730552,0.00069501897,0.028599923,0.00022525783,0.00010997491,0.00021157136,0.018929116,0.000011253399,0.0048231143,0.14679053,0.00694369,0.79264283],"study_design_scores_gemma":[0.0019800146,0.0004046865,0.058002733,0.00021548914,0.00001092947,0.0001351901,0.00043456722,0.6269609,0.0080698915,0.0069708987,0.2957463,0.001068411],"about_ca_topic_score_codex":0.00007740691,"about_ca_topic_score_gemma":0.000040249528,"teacher_disagreement_score":0.7915744,"about_ca_system_score_codex":0.000023023711,"about_ca_system_score_gemma":0.0000352214,"threshold_uncertainty_score":0.36740124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2939174,0.0018192483,0.702538,0.0006464357,0.0004180415,0.0003014671,0.00002820362,0.00009545119,0.00023575529],"genre_scores_gemma":[0.9875392,0.00028977945,0.011871025,0.00015856823,0.00007084337,0.000049352973,0.0000074085497,0.000006681993,0.00000717559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974468,0.00036275096,0.0003907931,0.00075871893,0.0006070421,0.00043390653],"domain_scores_gemma":[0.997765,0.00064887886,0.00025465805,0.0004243131,0.0006130615,0.0002940851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011800921,0.00020525862,0.00023105348,0.0001288343,0.00090703723,0.0005366998,0.0005381806,0.00009023588,0.0000044197727],"category_scores_gemma":[0.0007425745,0.0001898604,0.00003400587,0.0005777206,0.00038468288,0.002166943,0.00023492615,0.0003818063,0.000023108396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086495354,0.000765281,0.00068053795,0.00004469861,0.000034026863,0.00008482301,0.053199887,0.0043789595,0.0008477554,0.047863543,0.0002176836,0.8917963],"study_design_scores_gemma":[0.0073261987,0.0011863357,0.006615203,0.00020876157,0.000036651778,0.00021792809,0.02189077,0.94446766,0.00097304926,0.0082434425,0.008063271,0.000770739],"about_ca_topic_score_codex":0.00033114137,"about_ca_topic_score_gemma":0.0000054394345,"teacher_disagreement_score":0.9400887,"about_ca_system_score_codex":0.000052862117,"about_ca_system_score_gemma":0.00013358524,"threshold_uncertainty_score":0.7742282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92224,0.00037195173,0.022418737,0.05116952,0.0020759508,0.00013890138,0.000006918746,0.000018048215,0.0015599689],"genre_scores_gemma":[0.9964904,0.000006614415,0.0019823667,0.00013364547,0.00019935284,6.4193256e-7,3.6440564e-8,0.000002547273,0.001184363],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99913687,0.000066178945,0.00033041358,0.00007864789,0.00024949192,0.00013842023],"domain_scores_gemma":[0.99880594,0.000054765824,0.0002844056,0.00074282393,0.000069995804,0.00004209327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037646815,0.000059433867,0.00014150463,0.00004972004,0.000028105223,0.00003796775,0.0025022132,0.00002478559,0.000027989854],"category_scores_gemma":[0.0002933529,0.000026752252,0.00008394693,0.00018880535,0.00001625961,0.00024318817,0.0004312232,0.00007641063,0.000054216933],"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.00016028468,0.00047385553,0.025285967,0.000015571843,0.00012877163,0.00021723608,0.0014260677,0.0001022519,0.3314344,0.0021669783,0.53710747,0.10148112],"study_design_scores_gemma":[0.012560792,0.0006817709,0.48183137,0.0021841966,0.000031366802,0.0012205046,0.00009842794,0.0030525425,0.05279157,0.0049631326,0.43975815,0.00082617014],"about_ca_topic_score_codex":0.000006998934,"about_ca_topic_score_gemma":0.0000029887553,"teacher_disagreement_score":0.4565454,"about_ca_system_score_codex":0.000036273632,"about_ca_system_score_gemma":0.000051894185,"threshold_uncertainty_score":0.46497765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28528756,0.000864076,0.71169424,0.00011442633,0.0011593935,0.00039374048,0.00012860126,0.00021666224,0.00014130099],"genre_scores_gemma":[0.97330564,0.000076269986,0.025246833,0.00011941253,0.00055998197,0.000032841184,0.00059501076,0.00002620244,0.000037783648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969183,0.000101975056,0.0007388643,0.0009946513,0.0003060839,0.00094013236],"domain_scores_gemma":[0.9979992,0.00048357892,0.00040553385,0.00051068416,0.00022075335,0.00038024905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009322646,0.0005050887,0.00070388307,0.00008534094,0.0011357832,0.0008671766,0.000604206,0.00037784118,0.0000050614804],"category_scores_gemma":[0.00006673186,0.0004641304,0.0001396451,0.00046897432,0.00024929934,0.00037455643,0.0006477597,0.0005278066,0.00000342381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007548152,0.00055863976,0.01005123,0.00051953207,0.00036715658,0.00015419471,0.002930404,0.008670057,0.006295787,0.19220811,0.017130263,0.7603598],"study_design_scores_gemma":[0.0027283037,0.00023023144,0.005306326,0.00023019499,0.00003425806,0.0002472124,0.00033600695,0.9763285,0.000026306545,0.0008586351,0.012972178,0.0007018303],"about_ca_topic_score_codex":0.000027440317,"about_ca_topic_score_gemma":0.00012642777,"teacher_disagreement_score":0.96765846,"about_ca_system_score_codex":0.000032563104,"about_ca_system_score_gemma":0.0000347113,"threshold_uncertainty_score":0.999781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21462525,0.00020386721,0.6990618,0.0059874514,0.0017982279,0.0015329837,0.00000931081,0.0008679469,0.07591314],"genre_scores_gemma":[0.9964286,0.00002031622,0.0027528862,0.00011298471,0.00011183826,0.0000078184985,0.000009445941,0.0000027731978,0.0005533504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988958,0.00010422513,0.00032827505,0.0002371559,0.0002301898,0.00020433174],"domain_scores_gemma":[0.9992285,0.0000330192,0.00026979708,0.00033804876,0.00008929461,0.000041346186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005941979,0.000094113566,0.000079622565,0.00003104668,0.00039923412,0.00036461212,0.00026439634,0.00010346237,0.0000025283794],"category_scores_gemma":[0.00006020111,0.00006408695,0.000029862014,0.0004322155,0.000027089456,0.0010772031,0.000026663873,0.0002063477,0.000018421717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010910491,0.00010859853,0.0038350504,0.0000061789983,0.000023177121,0.0000046419686,0.0015038913,0.0013061302,0.0015019872,0.11430222,0.03217606,0.84522116],"study_design_scores_gemma":[0.0021845943,0.0008901093,0.038720336,0.00019358433,0.000044576485,0.00025294034,0.0049301665,0.7090781,0.022451604,0.08113132,0.13871486,0.0014078561],"about_ca_topic_score_codex":0.000050573002,"about_ca_topic_score_gemma":0.0000023252264,"teacher_disagreement_score":0.8438133,"about_ca_system_score_codex":0.000043492895,"about_ca_system_score_gemma":0.00008667518,"threshold_uncertainty_score":0.35159633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002271427,0.0008132553,0.9905474,0.0006161823,0.0009163408,0.00037032962,0.0038783613,0.00015955481,0.00042714766],"genre_scores_gemma":[0.9970429,0.00042539267,0.0010521226,0.00002484164,0.000034733708,0.00008163571,0.00007313472,0.000012563535,0.0012526676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976891,0.00015918227,0.000686839,0.0006813769,0.0004226653,0.00036078083],"domain_scores_gemma":[0.99737775,0.00043906958,0.00025329887,0.0015022872,0.00021396803,0.00021360519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003819767,0.0002521564,0.0004307251,0.00012064572,0.00023464757,0.0001319785,0.00094983965,0.00012823792,0.000013152716],"category_scores_gemma":[0.000030123198,0.00017730809,0.00009536859,0.00039299272,0.00012538042,0.0007209007,0.000016871707,0.00010989419,0.000107617576],"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.0009818875,0.0075375712,0.001758465,0.0016849269,0.003532445,0.00023411677,0.0021102515,0.26403576,0.042160567,0.17856486,0.27222684,0.2251723],"study_design_scores_gemma":[0.013650145,0.0018169746,0.0030213194,0.002840752,0.00043129825,0.00046486722,0.0013719676,0.45483893,0.0034645468,0.0011231942,0.51368934,0.003286674],"about_ca_topic_score_codex":0.00020112851,"about_ca_topic_score_gemma":0.000052362528,"teacher_disagreement_score":0.9947715,"about_ca_system_score_codex":0.00005978379,"about_ca_system_score_gemma":0.00011370248,"threshold_uncertainty_score":0.7230414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015216552,0.000015921058,0.94723254,0.0026066797,0.0001990739,0.000024465517,0.0000013448345,0.00015176384,0.048246525],"genre_scores_gemma":[0.98529774,0.0000018758413,0.0048240735,0.00020986983,0.000027487897,0.0000034135173,8.820871e-8,0.0000013000855,0.009634127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996193,0.000009203866,0.000066351415,0.000120556026,0.00007852167,0.00010605036],"domain_scores_gemma":[0.9996396,0.000019539095,0.000014392561,0.00026419997,0.000022919648,0.000039403498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006457041,0.000034043096,0.000043447137,0.000011225716,0.000021774727,0.000034188415,0.0003064202,0.000014741017,0.000049517814],"category_scores_gemma":[0.000008250545,0.000016655178,0.000018896983,0.00008010668,0.0000080878635,0.00022002865,0.000045443237,0.000009352522,0.00058747665],"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":[5.243982e-7,0.000011772924,0.0005316602,0.0000012087327,0.000003110689,0.0000053280173,0.000023740138,2.1532475e-7,0.0050292467,0.7621209,0.03059693,0.20167534],"study_design_scores_gemma":[0.0007815181,0.000050544833,0.010500239,0.000043504195,8.5303174e-7,0.000023282812,0.000008377539,0.0023633186,0.01034145,0.01099377,0.9646155,0.0002776338],"about_ca_topic_score_codex":0.0000056253984,"about_ca_topic_score_gemma":0.000001778129,"teacher_disagreement_score":0.9837761,"about_ca_system_score_codex":0.000007740729,"about_ca_system_score_gemma":0.000009955529,"threshold_uncertainty_score":0.755102},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015786162,0.0016921852,0.072916485,0.00027307554,0.00053433253,0.00028948425,0.00007366017,0.0003570622,0.9237059],"genre_scores_gemma":[0.032258354,0.000012097935,0.0070525645,0.0001570568,0.0001884222,0.000014784879,0.00006348379,0.000033729775,0.9602195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998783,0.000009332778,0.00026545368,0.000466415,0.0003019052,0.0001738946],"domain_scores_gemma":[0.99902093,0.000020019721,0.00013319378,0.00054318353,0.00011460043,0.00016805202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014377388,0.00025515916,0.00028927828,0.00007214897,0.00006452338,0.00018918588,0.00050692563,0.0002063678,0.000041476298],"category_scores_gemma":[0.0000038033868,0.00021305482,0.0000619503,0.000025600011,0.00006765987,0.000080593076,0.00020904285,0.00023854486,0.00010769052],"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.0000013915279,0.0000073179735,0.000008363845,0.000025656349,0.000018349592,0.000057325462,0.00022802036,0.000032270225,0.000007229245,0.90570146,0.012068261,0.08184438],"study_design_scores_gemma":[0.00021392643,0.00006695807,0.00006660401,0.00014857117,0.000014397915,0.00018801518,0.0000045904353,0.0016647731,0.000011835163,0.05728747,0.93983924,0.0004936414],"about_ca_topic_score_codex":0.000040193037,"about_ca_topic_score_gemma":0.000011113839,"teacher_disagreement_score":0.927771,"about_ca_system_score_codex":0.00004676014,"about_ca_system_score_gemma":0.00010838832,"threshold_uncertainty_score":0.8688124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03328049,0.00010798992,0.9635756,0.001147196,0.00004085913,0.0011989814,0.00008486211,0.00025928312,0.0003047603],"genre_scores_gemma":[0.9092728,0.000007615052,0.08911706,0.00040942236,0.0003552688,0.0005497292,0.000051241477,0.0000144923115,0.00022239656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985101,0.000042401098,0.00031785606,0.0006600472,0.0001981604,0.00027140955],"domain_scores_gemma":[0.9990041,0.0000550473,0.00009676755,0.000626068,0.00008599197,0.000131992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017347698,0.0001967361,0.00019617449,0.00007524464,0.00030785907,0.0002594259,0.00069578993,0.00006107088,0.00000299478],"category_scores_gemma":[6.2349267e-7,0.0001797585,0.00004576567,0.00036590718,0.000033821652,0.00025683187,0.00038825048,0.00014831837,0.00019134165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057788197,0.0012151928,0.0002850702,0.0000143649995,0.000035709592,0.00000635659,0.0010839894,0.0001853469,0.0031099152,0.0141626885,0.0064450246,0.97345054],"study_design_scores_gemma":[0.0015034811,0.00028489993,0.008737843,0.000024307055,0.000013051822,0.000047282767,0.0000990196,0.04393484,0.0018133326,0.00041913716,0.9426301,0.00049271435],"about_ca_topic_score_codex":0.000013896457,"about_ca_topic_score_gemma":0.0000074131867,"teacher_disagreement_score":0.97295785,"about_ca_system_score_codex":0.000060820563,"about_ca_system_score_gemma":0.000024011377,"threshold_uncertainty_score":0.7330339},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007802269,0.00021863676,0.9953759,0.0019431075,0.000053760083,0.00069044746,0.0006109525,0.00049252424,0.0005366958],"genre_scores_gemma":[0.22592485,0.0000064256888,0.770245,0.0007869711,0.00021407161,0.00008658191,0.0026935858,0.000016693548,0.000025784668],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979788,0.000019102697,0.00042869142,0.0010363647,0.00018021675,0.0003568062],"domain_scores_gemma":[0.99502456,0.00007407601,0.00017009558,0.0044673686,0.00016567689,0.00009822664],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000593889,0.00016488593,0.00017735164,0.00022068311,0.00022091671,0.00039698093,0.009747705,0.00011936668,0.000008412653],"category_scores_gemma":[0.0000032863525,0.00016912627,0.00002040044,0.0014291272,0.000108759166,0.00094099157,0.0031541719,0.00016032525,0.00010006551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014441409,0.00019024406,0.0005538304,0.00003432525,0.000023759394,0.000008665744,0.00001934336,0.0001893765,0.00077818765,0.032720007,0.015880637,0.94960016],"study_design_scores_gemma":[0.0002459268,0.0000068943286,0.0004627017,0.000021189111,0.000006342215,0.000037275113,0.000006206851,0.29359758,0.00035587017,0.0005082406,0.70457375,0.0001780299],"about_ca_topic_score_codex":0.000018369505,"about_ca_topic_score_gemma":0.00004205853,"teacher_disagreement_score":0.9494221,"about_ca_system_score_codex":0.000051807776,"about_ca_system_score_gemma":0.00017579894,"threshold_uncertainty_score":0.99561006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017818784,0.000633671,0.966586,0.0029835464,0.006035461,0.00021572513,0.000021091859,0.000070578244,0.005635147],"genre_scores_gemma":[0.9978463,0.000023116852,0.00082132994,0.0003065338,0.00058160594,0.000005489957,3.732341e-7,0.00000903691,0.00040618188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983852,0.00015154887,0.00035325967,0.00022442266,0.00042208904,0.0004634875],"domain_scores_gemma":[0.99806243,0.00004835814,0.00059474196,0.0009960841,0.00017852247,0.00011984779],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015280124,0.00016028417,0.00024741137,0.000039654777,0.002172553,0.0023311467,0.0029551117,0.000058901667,0.00004634498],"category_scores_gemma":[0.000112885435,0.00010217879,0.00012233756,0.00008670208,0.00007901518,0.00068263896,0.00022326328,0.0003287914,0.00010686469],"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.0000862743,0.0002266769,0.0012703473,0.000049152775,0.00024426542,0.0005133927,0.002697316,0.0015117129,0.0132036265,0.9047236,0.02325962,0.052214038],"study_design_scores_gemma":[0.013261551,0.00088589865,0.012271766,0.0015370887,0.00015831688,0.0077986657,0.00047566363,0.58479494,0.0047131325,0.102216855,0.26995108,0.0019350688],"about_ca_topic_score_codex":0.000019693678,"about_ca_topic_score_gemma":0.0000030922508,"teacher_disagreement_score":0.98002756,"about_ca_system_score_codex":0.000045228964,"about_ca_system_score_gemma":0.000117655,"threshold_uncertainty_score":0.9991265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025051668,0.000055251872,0.97296673,0.0003005488,0.00065308536,0.00036548218,0.000019417155,0.00034450876,0.00024327809],"genre_scores_gemma":[0.94826406,0.000017881986,0.05121492,0.000048175567,0.00009571635,0.00008655859,0.00012412963,0.000019413308,0.00012913998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982806,0.000023357647,0.00033560424,0.00053652446,0.00047653232,0.0003473833],"domain_scores_gemma":[0.998744,0.00005789618,0.00013106955,0.0006191852,0.00034340218,0.00010444497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019302696,0.00022103882,0.00018787077,0.00019819791,0.000049563983,0.0005253761,0.001464616,0.00008280637,0.00006202964],"category_scores_gemma":[0.0001494308,0.00019681315,0.000023357607,0.00043737039,0.000017546521,0.001104719,0.00023334523,0.00026757762,0.00016804226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041560503,0.0007470961,0.09902462,0.00031586934,0.0002967576,0.0001684555,0.0012099225,0.14806832,0.00032096944,0.1742719,0.0037417195,0.57179284],"study_design_scores_gemma":[0.00041066072,0.000070863935,0.008629842,0.00034055102,0.0000024463395,0.00002336395,0.000021808679,0.98762435,0.000039848135,0.000092898605,0.00246012,0.0002832618],"about_ca_topic_score_codex":0.00032858356,"about_ca_topic_score_gemma":0.000052427476,"teacher_disagreement_score":0.9232124,"about_ca_system_score_codex":0.0001548123,"about_ca_system_score_gemma":0.00008962606,"threshold_uncertainty_score":0.8025808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13891034,0.000120836085,0.84962374,0.0007583674,0.00019868251,0.00028742323,0.0000032960875,0.00015569347,0.009941592],"genre_scores_gemma":[0.9241231,0.0000019910708,0.07394636,0.000465257,0.000011929452,0.00003551486,0.0000012545307,0.000002754196,0.0014118216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989928,0.000058318503,0.00026175406,0.00026645028,0.00013820195,0.0002824696],"domain_scores_gemma":[0.999412,0.000089607354,0.00004562047,0.00031453487,0.00005355689,0.00008469995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002828086,0.00008315598,0.000127537,0.000047039262,0.000048813003,0.0001343977,0.0004525741,0.00003559861,0.00005034651],"category_scores_gemma":[0.00004925398,0.00006870785,0.000023813041,0.00032955216,0.000011700213,0.00060516555,0.00008604902,0.00009358697,0.0007317545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027288627,0.00058928534,0.05233681,0.00033773368,0.000019686717,0.000050845072,0.014916443,0.0014617337,0.0047293967,0.09565708,0.015894916,0.81400335],"study_design_scores_gemma":[0.00071209687,0.000036623125,0.093975425,0.00006298666,4.6409826e-7,0.0000067252513,0.0008556626,0.89468294,0.00012934774,0.0004187755,0.0088504385,0.00026849165],"about_ca_topic_score_codex":0.0023432313,"about_ca_topic_score_gemma":0.0002253399,"teacher_disagreement_score":0.89322126,"about_ca_system_score_codex":0.000033068045,"about_ca_system_score_gemma":0.000030080917,"threshold_uncertainty_score":0.9405468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034351354,0.0021866509,0.9875183,0.0017223182,0.0010493282,0.0007568942,0.0026019532,0.000142328,0.00058706297],"genre_scores_gemma":[0.9936885,0.0001848714,0.0010956366,0.0029616177,0.00036436945,0.00015241613,0.0013801806,0.000020403677,0.00015197712],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971336,0.0004977112,0.0004988267,0.0008759934,0.00043303284,0.0005608531],"domain_scores_gemma":[0.9959404,0.0006230848,0.00023303562,0.0030127573,0.000074298914,0.00011644264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024586488,0.00026043085,0.00036608434,0.00008964975,0.0002385793,0.0005458048,0.0030139207,0.00010597264,0.00003525372],"category_scores_gemma":[0.00025367973,0.00019926316,0.00006261361,0.0005065601,0.00010116453,0.0024445353,0.0005519386,0.000291854,0.00014923139],"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.00013352181,0.0015226528,0.003580573,0.0004599122,0.00016151778,0.00018345109,0.0015532465,0.0048868195,0.0022038103,0.09917124,0.48194388,0.40419936],"study_design_scores_gemma":[0.0023307248,0.000054878707,0.0024819055,0.00024607303,0.000022539523,0.00003807161,0.00068608567,0.6262369,0.00012710805,0.0004552014,0.3668339,0.00048662088],"about_ca_topic_score_codex":0.00027445797,"about_ca_topic_score_gemma":0.0005256052,"teacher_disagreement_score":0.9902534,"about_ca_system_score_codex":0.000064857,"about_ca_system_score_gemma":0.00014268386,"threshold_uncertainty_score":0.8125716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00733198,0.000011958467,0.9881329,0.00025772201,0.00044411342,0.00038158268,0.000003761848,0.00012679152,0.0033091833],"genre_scores_gemma":[0.59929943,1.2309258e-7,0.39887872,0.00033089786,0.0001245956,0.000116783965,0.0000015316369,0.000006564451,0.0012413749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880755,0.000057462123,0.00025310626,0.00036545817,0.00017366142,0.0003427917],"domain_scores_gemma":[0.99925953,0.000076657045,0.00008098875,0.00043107735,0.00006671814,0.00008504775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058987417,0.00012718566,0.00017805431,0.00004068687,0.00011175919,0.00015643264,0.00047666728,0.00004730131,0.000017993329],"category_scores_gemma":[0.000017913262,0.00010471057,0.00009923627,0.00012788357,0.00000810016,0.00017235169,0.00008731674,0.000062690946,0.0000487478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009785569,0.00014313449,0.0009534275,0.0000480622,0.000028886294,0.000007721693,0.00058255333,0.00014040396,0.020066358,0.057012226,0.0017662151,0.91924125],"study_design_scores_gemma":[0.0012529993,0.00044640046,0.00393581,0.000029667939,0.000026161542,0.00009565529,0.00006233188,0.91811025,0.026472619,0.0018298305,0.047211856,0.0005263874],"about_ca_topic_score_codex":0.00010663573,"about_ca_topic_score_gemma":0.000060714305,"teacher_disagreement_score":0.9187148,"about_ca_system_score_codex":0.000031559815,"about_ca_system_score_gemma":0.000010705946,"threshold_uncertainty_score":0.4269973},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93224114,0.00018250868,0.034828063,0.00009744661,0.0023176444,0.00019628841,0.000003855787,0.00036682305,0.029766198],"genre_scores_gemma":[0.99579984,0.0000013359988,0.00371899,0.000044822114,0.000008690582,0.000019654444,0.0000022215168,0.000010816345,0.0003936171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882865,0.000039506314,0.00018940757,0.00035059644,0.0002700758,0.00032176738],"domain_scores_gemma":[0.99909794,0.000022804863,0.000101404745,0.000567518,0.00009469986,0.00011564066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016081033,0.00015628045,0.00019891282,0.000046678146,0.0001469559,0.0001669891,0.000687979,0.00005622178,0.000015111548],"category_scores_gemma":[0.00000964451,0.00012803795,0.000042915242,0.0003659982,0.000054087304,0.0005981004,0.0001213788,0.000118274926,0.0000633875],"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.000013280801,0.000117113734,0.005228028,0.00000910805,0.000027336047,0.00008019448,0.0014250469,0.000005244121,0.00007002657,0.9896863,0.00078191294,0.002556415],"study_design_scores_gemma":[0.007393424,0.0018299759,0.31734273,0.0005248262,0.000051062016,0.0004899297,0.0007042962,0.01993096,0.0081728585,0.6265927,0.014545696,0.0024215318],"about_ca_topic_score_codex":0.00015341041,"about_ca_topic_score_gemma":0.000012217674,"teacher_disagreement_score":0.36309355,"about_ca_system_score_codex":0.000030566032,"about_ca_system_score_gemma":0.00005748946,"threshold_uncertainty_score":0.52212363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11137091,0.0000594918,0.88504946,0.0016227085,0.00032739466,0.0004269669,0.00046883101,0.0001602462,0.00051396276],"genre_scores_gemma":[0.9825026,4.77858e-7,0.017092861,0.0001622817,0.00015287175,0.000012144119,0.000052825224,0.000010131089,0.000013811219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831307,0.00008479077,0.00042473897,0.00043702757,0.0002929863,0.0004473657],"domain_scores_gemma":[0.9971914,0.00087798666,0.00035775916,0.0006601948,0.00083474786,0.00007786909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052953116,0.00020676071,0.00030993565,0.00004051517,0.00046873887,0.00015492666,0.0011147881,0.000068514804,0.0000061232668],"category_scores_gemma":[0.0005251959,0.00015250241,0.000096517295,0.0007444936,0.00041681406,0.000061077604,0.00016064163,0.00012690536,0.000014970715],"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.000104179206,0.00030429015,0.00032191558,0.00023748676,0.00010404198,0.000009240917,0.0009112885,0.00466941,0.0010363881,0.9580921,0.029046858,0.0051628123],"study_design_scores_gemma":[0.0013989452,0.00092151016,0.0017565404,0.00041651097,0.000022980386,0.00005200588,0.00039417317,0.9419716,0.026663726,0.0088575715,0.016932154,0.00061226025],"about_ca_topic_score_codex":0.000029289551,"about_ca_topic_score_gemma":0.0000058826026,"teacher_disagreement_score":0.94923455,"about_ca_system_score_codex":0.000038780294,"about_ca_system_score_gemma":0.00014857911,"threshold_uncertainty_score":0.6218868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073435276,0.00047359703,0.98885477,0.0006388381,0.0027228883,0.0006152308,0.000024668945,0.00018300992,0.0064796456],"genre_scores_gemma":[0.2250589,0.00002004165,0.7686858,0.001432092,0.0014886844,0.000058539455,0.000017329496,0.00007153949,0.0031670383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958892,0.00003083541,0.0005721991,0.001800392,0.0008571157,0.0008502846],"domain_scores_gemma":[0.99681383,0.0005925978,0.0004195248,0.0015536131,0.00041468375,0.00020575081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012047746,0.00058261177,0.00072075817,0.0004946353,0.0003865529,0.00080255955,0.0034337023,0.00037257624,0.000005035386],"category_scores_gemma":[0.00011153403,0.0005360697,0.00021177091,0.0004815736,0.0005045546,0.0004436594,0.0007982555,0.000568548,0.0000363487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011300462,0.000017048727,0.000008255843,0.00007627879,0.000017988457,0.000030674717,0.0006189634,0.015684457,0.00008886237,0.30202714,0.0002976687,0.68112135],"study_design_scores_gemma":[0.00040327024,0.00032843815,0.00002046972,0.00070589076,0.000008187753,0.000052231153,2.2128003e-7,0.8260751,0.00042091933,0.12548858,0.04566032,0.0008363716],"about_ca_topic_score_codex":0.00002506839,"about_ca_topic_score_gemma":0.00006979184,"teacher_disagreement_score":0.81039065,"about_ca_system_score_codex":0.00033462085,"about_ca_system_score_gemma":0.00048178426,"threshold_uncertainty_score":0.99970907},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014110498,0.02782097,0.08491773,0.00008917689,0.003390736,0.001029023,0.0050804787,0.00016081276,0.87749696],"genre_scores_gemma":[0.021500085,0.022174379,0.0036974305,0.0002934066,0.0027318096,0.00012291285,0.0016945627,0.00016328727,0.9476221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706537,0.00007175265,0.0010656221,0.00084222254,0.0006031479,0.00035188496],"domain_scores_gemma":[0.997045,0.00019614295,0.00087099336,0.0014447079,0.00021653988,0.0002266518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054189033,0.0005089288,0.0010947495,0.0001965922,0.000077583056,0.00012475414,0.00092037575,0.00031062253,0.000018133158],"category_scores_gemma":[0.000055216482,0.00047508982,0.00015752237,0.00007323784,0.000092865404,0.00061018084,0.00018794261,0.00037081193,0.00008799366],"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.000026380287,0.000062958374,0.00005105441,0.001096349,0.00022570169,0.00022181722,0.0001418575,0.000023395545,0.00005041915,0.8037191,0.09196528,0.10241566],"study_design_scores_gemma":[0.0007957102,0.00016815374,0.000043144406,0.001602569,0.00005525981,0.00009039318,0.00000752706,0.0012492033,0.000002089614,0.0009785694,0.99441755,0.00058983767],"about_ca_topic_score_codex":0.0001106894,"about_ca_topic_score_gemma":0.000009011869,"teacher_disagreement_score":0.9024523,"about_ca_system_score_codex":0.00004783519,"about_ca_system_score_gemma":0.00020680463,"threshold_uncertainty_score":0.9997701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8591373,0.0005964011,0.024739604,0.0021812227,0.0020170163,0.0017127431,0.0011718146,0.0014539146,0.10699],"genre_scores_gemma":[0.963871,0.00003840944,0.03492641,0.000723027,0.000029875378,0.0000242835,0.000036670095,0.00002174092,0.00032855166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707705,0.00015985138,0.0006028342,0.0010780927,0.00053185975,0.00055030175],"domain_scores_gemma":[0.99707264,0.00033557366,0.0002617597,0.0016545826,0.00025202832,0.00042343987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002641677,0.0002624027,0.0002830671,0.000117619966,0.00062693964,0.00017397766,0.00054609386,0.00016197028,0.000013774925],"category_scores_gemma":[0.00089276547,0.00025783363,0.00008006485,0.00051080156,0.00008817983,0.0016590891,0.00043918463,0.0004727204,0.00015346981],"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.000021876904,0.00012813881,0.0000984738,0.000033043492,0.00002505854,0.00012890848,0.0000024043477,0.0000016298123,0.018318139,0.8653822,0.000052332278,0.11580781],"study_design_scores_gemma":[0.0022275785,0.0002891991,0.009415223,0.00024937568,0.00006535403,0.0016833645,0.000114604736,0.0032393495,0.08064514,0.022136148,0.8784982,0.0014364682],"about_ca_topic_score_codex":0.00009660184,"about_ca_topic_score_gemma":0.00008869685,"teacher_disagreement_score":0.87844586,"about_ca_system_score_codex":0.00018159591,"about_ca_system_score_gemma":0.000036556103,"threshold_uncertainty_score":0.99998736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032892518,0.000059027785,0.97259444,0.009210877,0.00040137343,0.0001598827,0.00001898744,0.00013631149,0.01412986],"genre_scores_gemma":[0.9349229,0.0000024487704,0.032538217,0.0003198385,0.000094330564,0.000035190413,6.827043e-7,0.000005633037,0.03208078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993631,0.000012126422,0.00011607365,0.00021761263,0.000092944545,0.00019813125],"domain_scores_gemma":[0.9993654,0.00012434111,0.000037589765,0.00033195363,0.00007628033,0.00006443695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013155953,0.000066799395,0.00009365483,0.000018665962,0.000061531326,0.000081562874,0.0003065278,0.000031162657,0.000019320603],"category_scores_gemma":[0.000033291115,0.000037274862,0.000044590975,0.000084271946,0.000028132437,0.00009696593,0.000042576612,0.000013891145,0.00013830616],"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.000004915702,0.00001860417,0.00011411382,0.000007851418,0.000009364255,0.000004788136,0.000043893844,6.316069e-7,0.004277104,0.8309265,0.14247192,0.022120334],"study_design_scores_gemma":[0.0008125561,0.00005759942,0.0003929777,0.00003264692,0.0000016544162,0.000020964411,0.000007642545,0.0035850753,0.005013543,0.0077047436,0.9822066,0.00016400618],"about_ca_topic_score_codex":0.000013356427,"about_ca_topic_score_gemma":0.000011681517,"teacher_disagreement_score":0.9400562,"about_ca_system_score_codex":0.000018100682,"about_ca_system_score_gemma":0.000040754225,"threshold_uncertainty_score":0.1777692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020495278,0.000017861958,0.93670225,0.0021424305,0.00020346449,0.000022532022,0.0000012416053,0.00014410917,0.058716558],"genre_scores_gemma":[0.98462313,0.000001747804,0.0047044326,0.00020214336,0.000020264019,0.0000030695946,7.6896285e-8,0.0000012570918,0.010443846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996353,0.000007482251,0.000063885236,0.00011781839,0.00007505053,0.000100511934],"domain_scores_gemma":[0.99964863,0.000016895265,0.000013279928,0.00026296618,0.000021077258,0.00003715443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056147943,0.000032469572,0.000040444804,0.000010886087,0.000020127845,0.000032430868,0.00032756347,0.000014280676,0.00005031442],"category_scores_gemma":[0.0000068120326,0.000016063992,0.00001771385,0.000076076096,0.000008113236,0.00022643217,0.000047883095,0.000009333206,0.000704681],"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":[2.7886094e-7,0.0000068978306,0.0003979025,8.9218526e-7,0.000001802299,0.0000045081106,0.00001384595,1.975644e-7,0.0023222642,0.7759175,0.023288604,0.19804536],"study_design_scores_gemma":[0.0005567264,0.00003715759,0.010793499,0.000038677263,6.897706e-7,0.000029191526,0.0000049624086,0.0021747614,0.007213538,0.013885341,0.96502686,0.0002385811],"about_ca_topic_score_codex":0.0000053034046,"about_ca_topic_score_gemma":0.0000017067905,"teacher_disagreement_score":0.9825736,"about_ca_system_score_codex":0.000007913205,"about_ca_system_score_gemma":0.000010471635,"threshold_uncertainty_score":0.9057483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01098984,0.006034689,0.97567004,0.0025598968,0.0025060407,0.0015843785,0.000102170874,0.00030575163,0.00024720322],"genre_scores_gemma":[0.9918857,0.00039153252,0.00013323718,0.000087891385,0.00046890022,0.0005834514,0.00000490629,0.00003402755,0.0064103534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715877,0.00015532687,0.00048601045,0.00078859954,0.0003694548,0.0010418583],"domain_scores_gemma":[0.99775505,0.00028940217,0.0005922145,0.0006879277,0.0004542839,0.00022111092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007122962,0.00037922378,0.0006404251,0.00009653335,0.00022618985,0.0003882724,0.0005132973,0.00021235662,0.0000013225093],"category_scores_gemma":[0.00009982612,0.00026268343,0.00010664202,0.00024353105,0.00006165002,0.0005967242,0.0000392709,0.0001360476,0.00009284368],"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.00008770367,0.000056983325,0.00014986661,0.0002551547,0.00018281925,0.000024494224,0.000111398855,0.00032228834,0.059820466,0.91783154,0.018684797,0.0024725157],"study_design_scores_gemma":[0.047452398,0.0071544666,0.0012450955,0.0076244297,0.00048165987,0.0039376905,0.0005027868,0.48743677,0.015665447,0.01545785,0.40704042,0.006001012],"about_ca_topic_score_codex":0.00010911096,"about_ca_topic_score_gemma":0.000042789023,"teacher_disagreement_score":0.9808959,"about_ca_system_score_codex":0.00023261571,"about_ca_system_score_gemma":0.00017616095,"threshold_uncertainty_score":0.99998254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019710993,0.00016747424,0.8998092,0.02990791,0.00069737516,0.00015696535,0.000008290023,0.0002611699,0.049280617],"genre_scores_gemma":[0.97831565,0.000008086089,0.0011586788,0.0005760006,0.000051078146,0.0000107315345,3.4394492e-7,0.0000029077673,0.019876506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920505,0.000033080225,0.00016652113,0.00021794059,0.00016468625,0.00021273347],"domain_scores_gemma":[0.999136,0.000065824424,0.000036404745,0.00064123014,0.00006843469,0.00005215481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022376892,0.000078692894,0.00009582415,0.000016455051,0.00011150815,0.00010529804,0.0007425618,0.000027701053,0.00006808249],"category_scores_gemma":[0.000015344373,0.0000277281,0.00005876819,0.00015657106,0.00005657635,0.0002620735,0.00011474539,0.000031494208,0.00060656323],"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.0000024659173,0.000041686337,0.0018866183,0.0000054781,0.000039105114,0.000020796166,0.0003676873,0.0000034131683,0.0034197436,0.7998247,0.078159176,0.11622911],"study_design_scores_gemma":[0.0011039118,0.00008866923,0.013665531,0.00008436955,0.000012146438,0.00010532575,0.0001315612,0.0047174846,0.010553865,0.013237221,0.9557444,0.00055554055],"about_ca_topic_score_codex":0.00006730618,"about_ca_topic_score_gemma":0.000025953357,"teacher_disagreement_score":0.9586047,"about_ca_system_score_codex":0.00001362499,"about_ca_system_score_gemma":0.000024317245,"threshold_uncertainty_score":0.77963454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06537768,0.000028688837,0.9319241,0.0016548923,0.00014785373,0.00010440709,0.000027800983,0.00007374439,0.0006608027],"genre_scores_gemma":[0.9900988,0.000007491671,0.0078019113,0.0002009124,0.000011670031,0.000013666022,3.8489995e-7,0.0000036568854,0.0018615121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930245,0.000036380276,0.00018839193,0.00016439271,0.0001693671,0.00013899703],"domain_scores_gemma":[0.9993586,0.00007886095,0.000072730225,0.00039137198,0.000054156648,0.00004431538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018476654,0.0000799141,0.00009901963,0.000023186993,0.00012341492,0.000026568146,0.0004923733,0.000026105206,0.000026148491],"category_scores_gemma":[0.0000135831815,0.000036052093,0.000047211055,0.00018431898,0.000055149634,0.00022253649,0.000013903181,0.00006401127,0.000036339676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012393324,0.00032791778,0.008932202,0.00012533405,0.00008368685,0.0000032108985,0.003223475,0.001871616,0.02740839,0.024409804,0.0022137074,0.93138826],"study_design_scores_gemma":[0.0017624913,0.0003275002,0.018965224,0.0005964004,0.000009304278,0.000026948723,0.00009621925,0.8662422,0.0977062,0.000140687,0.01372515,0.00040169348],"about_ca_topic_score_codex":0.000045156423,"about_ca_topic_score_gemma":0.000024637022,"teacher_disagreement_score":0.9309866,"about_ca_system_score_codex":0.000014533607,"about_ca_system_score_gemma":0.000026071972,"threshold_uncertainty_score":0.14701618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97652906,0.00013183929,0.0016521161,0.0011374754,0.00026363446,0.00028598864,0.000012197241,0.00012491376,0.019862797],"genre_scores_gemma":[0.99502903,0.0000016599885,0.004459622,0.00010540611,0.00006265523,0.000020990541,9.219183e-7,0.000011127764,0.00030861137],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872804,0.00000761052,0.00023472685,0.00035453806,0.00037727715,0.00029783137],"domain_scores_gemma":[0.9988793,0.0000920162,0.00024769705,0.00033523617,0.0003664446,0.00007931696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000536412,0.00016646361,0.00021222178,0.000045372904,0.00016686971,0.00018151203,0.00097861,0.00005602544,0.000009995017],"category_scores_gemma":[0.00005504044,0.000100278914,0.000046691523,0.00047556945,0.00020693017,0.00027847008,0.0001555845,0.00028685274,0.000010680362],"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.00007098279,0.00032218226,0.02988703,0.00025725414,0.00012445457,0.000029460913,0.021953244,0.00001552402,0.46466538,0.43499172,0.038525153,0.009157595],"study_design_scores_gemma":[0.004593393,0.0015783496,0.025752325,0.0008285373,0.000100943755,0.0012832006,0.009883541,0.014653998,0.17920835,0.0033007825,0.75659364,0.0022229562],"about_ca_topic_score_codex":0.00005279991,"about_ca_topic_score_gemma":0.000026914422,"teacher_disagreement_score":0.7180685,"about_ca_system_score_codex":0.000010727546,"about_ca_system_score_gemma":0.0000486129,"threshold_uncertainty_score":0.40892556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013444462,0.00031331758,0.98395133,0.001250515,0.00023026638,0.00008891238,0.0000028803702,0.000014751137,0.00070358627],"genre_scores_gemma":[0.95216346,0.000003817119,0.04737245,0.000264122,0.00013462543,0.0000019666538,0.0000070298925,0.000002381368,0.00005014456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.00004710361,0.0002844643,0.00009694719,0.00017875686,0.000089860674],"domain_scores_gemma":[0.9991717,0.00005540482,0.00031296123,0.000056955716,0.00032337185,0.00007960285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013269,0.000063783715,0.00014416673,0.000053655807,0.000053940345,0.00011508929,0.00014733229,0.000044108216,1.6668753e-7],"category_scores_gemma":[0.00004129561,0.000049187147,0.00004252272,0.00011277517,0.000015264739,0.0003121811,0.000023944582,0.00006199239,0.0000011978666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021274024,0.00020803233,0.0006719015,0.00006550247,0.000059191934,0.000042374475,0.0021717811,0.18582314,0.00009463001,0.59835637,0.027114058,0.1851803],"study_design_scores_gemma":[0.00071983313,0.0004721729,0.0004260074,0.000018312747,0.000006544878,0.00015261187,0.00024198598,0.90358394,0.0000059772833,0.091724075,0.0025801938,0.00006834682],"about_ca_topic_score_codex":0.0000019055319,"about_ca_topic_score_gemma":0.0000012966138,"teacher_disagreement_score":0.938719,"about_ca_system_score_codex":0.000053539825,"about_ca_system_score_gemma":0.000056658337,"threshold_uncertainty_score":0.20057936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033721536,0.00010667181,0.94528675,0.0019371663,0.0006658102,0.0002019782,0.0000496707,0.0006582101,0.017372182],"genre_scores_gemma":[0.9922961,0.0000030142705,0.0037964717,0.0008363134,0.00006508003,0.000010236425,0.000003938944,0.000008455684,0.0029804083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986991,0.000051794443,0.00020017588,0.0004374285,0.00026546133,0.00034598794],"domain_scores_gemma":[0.998797,0.000050369723,0.00012169978,0.0007481239,0.000105754545,0.00017702304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014434067,0.00014666557,0.00019548512,0.00004853725,0.00010330279,0.00018377189,0.00086274423,0.00006398757,0.00012413954],"category_scores_gemma":[0.000011815542,0.000088594075,0.00005456692,0.0002491886,0.00003107276,0.0011128635,0.00014606284,0.00004802507,0.00049732224],"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.00008906954,0.0016968917,0.035910368,0.0001463293,0.0002499489,0.0005844424,0.0021266832,0.0011843072,0.024403479,0.52486724,0.26580864,0.14293256],"study_design_scores_gemma":[0.013943582,0.0012745569,0.5139888,0.0014946928,0.00004561489,0.0005070449,0.0030076932,0.20528507,0.017249092,0.048395924,0.18922773,0.005580219],"about_ca_topic_score_codex":0.000094455536,"about_ca_topic_score_gemma":0.00014814302,"teacher_disagreement_score":0.95857453,"about_ca_system_score_codex":0.00005347892,"about_ca_system_score_gemma":0.000036224174,"threshold_uncertainty_score":0.63922375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004936197,0.000032114975,0.9310748,0.0018287383,0.00043832287,0.000045273468,0.0000030518104,0.00016305978,0.061478436],"genre_scores_gemma":[0.9600738,0.000012422165,0.0072978036,0.00029792497,0.000065383705,0.000005275073,4.594869e-7,0.0000030721856,0.03224385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993769,0.000018440942,0.00011076613,0.00019906329,0.00013401642,0.00016079583],"domain_scores_gemma":[0.999501,0.000036550537,0.00002660099,0.00034449634,0.00003652903,0.000054818072],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013546168,0.000055563516,0.00006998915,0.000020459935,0.000058674625,0.000055562585,0.00039446956,0.000029387485,0.00013471882],"category_scores_gemma":[0.000016703949,0.00002985714,0.000028858045,0.00011863486,0.000009710832,0.00045278005,0.00012560302,0.000019679635,0.0009023928],"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.000004829901,0.00004615764,0.00064210076,0.0000050593007,0.000006750767,0.000015569405,0.000093054674,0.000004014179,0.014818657,0.3663195,0.11781352,0.5002308],"study_design_scores_gemma":[0.0007153509,0.00007983382,0.0017909,0.00006822661,8.883312e-7,0.000028060675,0.0000079981655,0.0063056764,0.007941713,0.007294891,0.9755113,0.00025513014],"about_ca_topic_score_codex":0.000018974908,"about_ca_topic_score_gemma":0.0000053144317,"teacher_disagreement_score":0.9551376,"about_ca_system_score_codex":0.000023535273,"about_ca_system_score_gemma":0.000020660924,"threshold_uncertainty_score":0.99987555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44075105,0.00034117693,0.55355495,0.00009495527,0.000084447885,0.00047580033,0.000034027926,0.00016734451,0.004496255],"genre_scores_gemma":[0.9817212,0.000084705505,0.017306248,0.000055043598,0.000021103333,0.00005638345,0.0005852193,0.000012145146,0.00015793103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827874,0.000038035014,0.0006157113,0.0005721163,0.00026621044,0.00022916714],"domain_scores_gemma":[0.99862957,0.00003959529,0.00027476618,0.000754236,0.00025007542,0.00005178157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058095186,0.0002219262,0.00035987826,0.00021930136,0.000048321424,0.00005246667,0.0005754657,0.00025690193,0.0000016704694],"category_scores_gemma":[0.000032012827,0.00020332974,0.000039253435,0.00059033826,0.000010252517,0.00014897746,0.000055645643,0.00024022823,0.000001225706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012722209,0.00082429475,0.013583536,0.010232616,0.00020631088,0.0000347459,0.012052335,0.24879286,0.015311752,0.027243253,0.00074168365,0.6697044],"study_design_scores_gemma":[0.00019990555,0.00003891095,0.012746778,0.00052507775,0.000004867313,0.0000072608996,0.00013444255,0.9825744,0.0028681594,0.00041470103,0.00020815978,0.00027730808],"about_ca_topic_score_codex":0.0006078801,"about_ca_topic_score_gemma":0.00082051515,"teacher_disagreement_score":0.7337816,"about_ca_system_score_codex":0.000035309284,"about_ca_system_score_gemma":0.00006647349,"threshold_uncertainty_score":0.82915455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035219472,0.0061953,0.9569074,0.00017040122,0.00029555915,0.0009572917,0.000052183193,0.000028967026,0.00017343256],"genre_scores_gemma":[0.99940753,0.00018527641,0.00008274644,0.000029898989,0.000035020003,0.00015669566,0.0000016833438,0.000005587916,0.000095540025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985362,0.000121014506,0.00059723057,0.00030093515,0.00020709394,0.0002375],"domain_scores_gemma":[0.99924475,0.00009001296,0.00024634882,0.00028476544,0.000033122225,0.00010101126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038201307,0.00016354502,0.0003993618,0.000078539,0.000043420456,0.00007303279,0.00020863909,0.00008171642,0.000004080413],"category_scores_gemma":[0.000010148118,0.00010675185,0.000041621086,0.000055368946,0.000055282846,0.00033405662,0.000043212378,0.00004953504,0.000009345263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026831654,0.00040647187,0.020340871,0.0005590584,0.00028426052,0.000030013402,0.0039969007,0.025205282,0.189923,0.06843895,0.00051549496,0.6900314],"study_design_scores_gemma":[0.010173031,0.0010050646,0.018925903,0.000918485,0.00004552058,0.00012940858,0.0007918425,0.910913,0.006886677,0.0012240182,0.04814846,0.00083858165],"about_ca_topic_score_codex":0.000086823326,"about_ca_topic_score_gemma":0.0000046071154,"teacher_disagreement_score":0.9641881,"about_ca_system_score_codex":0.000092026356,"about_ca_system_score_gemma":0.000016796743,"threshold_uncertainty_score":0.43532142},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006778126,0.34916964,0.015756559,0.0030592468,0.0025777314,0.0068775197,0.028998619,0.0006282455,0.5928647],"genre_scores_gemma":[0.0018710492,0.6504192,0.031015525,0.00023468408,0.0020791374,0.0030932918,0.017007343,0.00065439875,0.2936254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9703486,0.0031902683,0.0047500166,0.006315369,0.009346734,0.0060489876],"domain_scores_gemma":[0.980346,0.0038963119,0.0011285441,0.0108310385,0.002591904,0.0012061613],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"category_scores_codex":[0.023357049,0.002225342,0.0034052825,0.0048503494,0.0014333458,0.0017677424,0.012411998,0.000949448,0.00092622015],"category_scores_gemma":[0.003291371,0.0021955166,0.00051328284,0.0032896737,0.0057357242,0.055093337,0.011269589,0.0096337935,0.0013294909],"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.001252528,0.00055637414,0.00023264153,0.0035034323,0.000099251134,0.009096713,0.00039874195,0.0013034592,0.00034790998,0.8894032,0.061406564,0.03239916],"study_design_scores_gemma":[0.0015261794,0.00063640904,0.000037845013,0.0050358027,0.000009449459,0.00027135492,0.00041757146,0.0010635788,0.0009635547,0.030289652,0.9577218,0.002026758],"about_ca_topic_score_codex":0.0009951364,"about_ca_topic_score_gemma":0.009590591,"teacher_disagreement_score":0.8963153,"about_ca_system_score_codex":0.0032495735,"about_ca_system_score_gemma":0.003555671,"threshold_uncertainty_score":0.99998707},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006010612,0.0015936365,0.9946396,0.0002839754,0.0016803971,0.00049990887,0.00029297065,0.000101067984,0.0008483628],"genre_scores_gemma":[0.9706709,0.00037334516,0.026954213,0.00025062644,0.00082369015,0.000030486337,0.00011708468,0.000058525144,0.0007211399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962695,0.00010978298,0.00087468856,0.0012566709,0.00093181466,0.00055751204],"domain_scores_gemma":[0.99687105,0.0005047444,0.0005520871,0.0013166548,0.0005739216,0.00018154945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118403,0.00041984406,0.0007848768,0.00037447416,0.00017238574,0.00037647743,0.0023186232,0.00031522685,0.00000363969],"category_scores_gemma":[0.00015969985,0.00032665342,0.00007657239,0.0010861912,0.0007813177,0.0006221318,0.0010199228,0.00033169877,0.000006024657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007857122,0.0003345606,0.0027411908,0.0028307792,0.00012277374,0.00018095186,0.004859437,0.09322177,0.00053979136,0.25546148,0.0024271242,0.63720155],"study_design_scores_gemma":[0.0010800664,0.0002703087,0.0007020514,0.0031163539,0.000014881511,0.00014156532,9.138252e-7,0.88575613,0.00042953048,0.07915586,0.028094446,0.0012379022],"about_ca_topic_score_codex":0.00003575559,"about_ca_topic_score_gemma":0.0000281948,"teacher_disagreement_score":0.9706108,"about_ca_system_score_codex":0.00037241954,"about_ca_system_score_gemma":0.0009647511,"threshold_uncertainty_score":0.9999186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008205961,0.000029926303,0.9426707,0.003039612,0.000251681,0.000040741044,0.0000037734524,0.0001254812,0.05301746],"genre_scores_gemma":[0.98157525,0.000005371549,0.005421192,0.00051936344,0.0000461411,0.000008146347,3.8402493e-7,0.0000018677565,0.0124222925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994589,0.00000986062,0.00009502007,0.00016516472,0.00013282252,0.00013823109],"domain_scores_gemma":[0.99955577,0.000014491485,0.000020825617,0.00032416132,0.00003829559,0.00004646709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009745994,0.000045611072,0.00005334168,0.000012747631,0.00003038479,0.00005143637,0.0003620352,0.000015056076,0.00006087553],"category_scores_gemma":[0.0000064819324,0.00002390557,0.000021101147,0.000092643895,0.000011417754,0.0002632128,0.00006873601,0.00001121142,0.00035539872],"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":[7.8972704e-7,0.000023731087,0.00051814964,0.0000019232025,0.0000048464444,0.0000062783834,0.000032944834,7.724955e-7,0.0032118475,0.75877666,0.057790305,0.17963175],"study_design_scores_gemma":[0.00030809682,0.000030765077,0.0020959391,0.000019535542,3.7862566e-7,0.0000073881324,0.0000031757124,0.0007511963,0.0017102008,0.0017835111,0.99318695,0.00010283384],"about_ca_topic_score_codex":0.000014018935,"about_ca_topic_score_gemma":0.0000028955878,"teacher_disagreement_score":0.9807547,"about_ca_system_score_codex":0.000018213243,"about_ca_system_score_gemma":0.000016875558,"threshold_uncertainty_score":0.456805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029932177,0.000014183521,0.9937254,0.00043728715,0.00011683261,0.00028645233,0.000023336243,0.00030444787,0.0020988337],"genre_scores_gemma":[0.8311371,9.41777e-7,0.16702992,0.0001709082,0.000059472113,0.000091637085,0.0000050423764,0.00000974172,0.0014952188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989474,0.000019723993,0.0001497452,0.00045574177,0.00016676965,0.0002606567],"domain_scores_gemma":[0.99881124,0.000045322595,0.00005889683,0.00081082433,0.00015910514,0.00011460449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021083343,0.00010278551,0.00012607536,0.000031708165,0.000077809644,0.000088641296,0.00051423203,0.00003886922,0.000005714652],"category_scores_gemma":[0.000008468495,0.000051730196,0.000029117724,0.00021970973,0.00002703281,0.00019165564,0.00003224875,0.000021584161,0.000031424475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001727483,0.00022142564,0.00010129213,0.00001007954,0.000022228713,0.00001225376,0.00019251519,0.000087386376,0.007941171,0.05602099,0.003304022,0.93206936],"study_design_scores_gemma":[0.0028805083,0.0012622308,0.0019100445,0.0001381405,0.000008467423,0.000085052634,0.000057640882,0.9103935,0.041486986,0.00057924207,0.040542107,0.00065608305],"about_ca_topic_score_codex":0.000023603696,"about_ca_topic_score_gemma":0.000006827868,"teacher_disagreement_score":0.9314133,"about_ca_system_score_codex":0.000027322185,"about_ca_system_score_gemma":0.00004549685,"threshold_uncertainty_score":0.21094963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007733387,0.002502114,0.99369687,0.00016569694,0.0017090811,0.0005221771,0.00023082567,0.00010302136,0.0009928744],"genre_scores_gemma":[0.95588833,0.00021014838,0.042027004,0.00025214007,0.0007735488,0.000028986848,0.00027889945,0.0000618776,0.00047907975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609834,0.000120254794,0.000876846,0.001202832,0.001175545,0.0005261582],"domain_scores_gemma":[0.9966731,0.0003155185,0.0005390825,0.0012932541,0.00093751476,0.00024154372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017207502,0.00042083487,0.0008372534,0.0003769637,0.0001440799,0.00045735986,0.0023327703,0.00032597606,0.0000017601307],"category_scores_gemma":[0.00021084995,0.0003768591,0.000065155196,0.001471619,0.0006962862,0.0006065472,0.0010967621,0.00043918646,0.00000452112],"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.00008081978,0.00041663638,0.0020584748,0.0027684572,0.0001105601,0.0002086761,0.0093326885,0.56696063,0.0001371774,0.13946761,0.0060947337,0.27236354],"study_design_scores_gemma":[0.00052256766,0.00016486332,0.0001909233,0.0008318828,0.000008805577,0.0000833985,0.0000011487714,0.9407997,0.00007504138,0.04173601,0.014988598,0.0005970321],"about_ca_topic_score_codex":0.000072835996,"about_ca_topic_score_gemma":0.00004791095,"teacher_disagreement_score":0.95581096,"about_ca_system_score_codex":0.00046961382,"about_ca_system_score_gemma":0.0015904574,"threshold_uncertainty_score":0.99986833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007220128,0.00011516382,0.991364,0.0013632502,0.00065917545,0.000043173746,0.000053848755,0.000120697536,0.005558654],"genre_scores_gemma":[0.9959007,0.000006394118,0.002881114,0.00013807438,0.0000633952,0.000001535919,0.0000050181834,0.0000018244023,0.0010019366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934083,0.000015341726,0.000105392755,0.00027419833,0.00013214198,0.00013208485],"domain_scores_gemma":[0.9988135,0.000029107834,0.000028854794,0.001048541,0.000027684284,0.000052314343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093534065,0.00005532618,0.00006781324,0.000012558362,0.000030240924,0.000070894916,0.0015557474,0.000018601986,0.00006681412],"category_scores_gemma":[0.000019472194,0.000027436206,0.000012009507,0.000071501636,0.000018859619,0.00046751258,0.0004253181,0.000019062405,0.00014113284],"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":[1.6178237e-7,0.000006368499,0.00029363637,0.000002085153,0.0000045065954,0.0000027653175,0.000011955962,3.0019856e-7,0.00046253327,0.47822136,0.062380288,0.45861402],"study_design_scores_gemma":[0.00046981146,0.000021493042,0.006593116,0.000026769692,0.0000015144004,0.000018788343,0.000005688645,0.0059586735,0.0012116622,0.0040765884,0.98141867,0.00019725371],"about_ca_topic_score_codex":0.000012583629,"about_ca_topic_score_gemma":0.0000058261135,"teacher_disagreement_score":0.9951787,"about_ca_system_score_codex":0.000007892331,"about_ca_system_score_gemma":0.000022918375,"threshold_uncertainty_score":0.28909916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05463315,0.009839202,0.9307159,0.0005785866,0.00052867515,0.0011174319,0.00000794384,0.000494943,0.002084136],"genre_scores_gemma":[0.9716475,0.00026629888,0.026531829,0.001290491,0.0001867339,0.000024197616,0.0000055853816,0.000024403516,0.000022965743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971411,0.00012668461,0.0008008179,0.0008513949,0.000550647,0.000529361],"domain_scores_gemma":[0.99713147,0.0005003482,0.00055533735,0.0015577909,0.00011674328,0.00013831427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011079279,0.0003411239,0.0006025066,0.00008181077,0.0002953867,0.00016006701,0.001612881,0.0000834763,0.000010721856],"category_scores_gemma":[0.0001503786,0.00023745351,0.00014155656,0.00069065666,0.000040637224,0.00009885951,0.00052371644,0.0001571958,0.00019764996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014835269,0.00018684404,0.00036821177,0.0021620048,0.00007161927,0.000013487696,0.0005406885,0.020358028,0.0077672563,0.055886716,0.001472167,0.91115814],"study_design_scores_gemma":[0.0030097498,0.0002244525,0.0077099903,0.07312626,0.00017621824,0.00014172457,0.00005551142,0.84462696,0.0031921528,0.0022105002,0.062343296,0.0031831833],"about_ca_topic_score_codex":0.000007094761,"about_ca_topic_score_gemma":4.7159475e-7,"teacher_disagreement_score":0.91701436,"about_ca_system_score_codex":0.00013411936,"about_ca_system_score_gemma":0.00006972361,"threshold_uncertainty_score":0.9683073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006686997,0.0025357686,0.90847313,0.014721269,0.0013251503,0.0012355852,0.0006333541,0.00052171986,0.063866995],"genre_scores_gemma":[0.7495773,0.0002123984,0.20340921,0.00037412098,0.00016358691,0.0005305212,0.0016297312,0.00010671665,0.043996464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938451,0.0025669334,0.00078569434,0.001395324,0.0007473171,0.0006596544],"domain_scores_gemma":[0.98872495,0.00091054285,0.00084656646,0.0038414958,0.005304229,0.0003722249],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007295079,0.0005110629,0.0006709079,0.00017833558,0.0004903508,0.0015210155,0.0032807286,0.00040032578,0.000019664305],"category_scores_gemma":[0.0009878024,0.0005454762,0.0002891474,0.00050953584,0.00027212314,0.00020401011,0.0020461082,0.0005561551,0.000042169664],"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.000048905942,0.0013888369,0.0004592979,0.0008783051,0.00031799037,0.00004631301,0.019543612,0.0006553209,0.0017470667,0.7735418,0.14278463,0.058587886],"study_design_scores_gemma":[0.0025232695,0.000002712677,0.00037560912,0.002536866,0.0000733006,0.000064554595,0.00019717721,0.21876347,0.012399678,0.021593494,0.7399345,0.0015353725],"about_ca_topic_score_codex":0.000985994,"about_ca_topic_score_gemma":0.00079668866,"teacher_disagreement_score":0.75194836,"about_ca_system_score_codex":0.0002846433,"about_ca_system_score_gemma":0.0010566695,"threshold_uncertainty_score":0.99969965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076764496,0.00048152223,0.98735094,0.00093029323,0.0023488598,0.00083751295,0.00004546847,0.00024969853,0.007678963],"genre_scores_gemma":[0.4277043,0.000042741965,0.5605527,0.0039377245,0.002009386,0.00016568323,0.00002511815,0.0001700875,0.00539225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489003,0.000027977338,0.000621566,0.0021111055,0.0011578053,0.0011914934],"domain_scores_gemma":[0.99648136,0.00048451236,0.00045256253,0.0018054799,0.00051474967,0.00026133077],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009279809,0.00075397495,0.00081486674,0.00060627883,0.00062852213,0.0017747532,0.003638633,0.00037464718,0.000009298088],"category_scores_gemma":[0.000058148387,0.0005423842,0.00019670268,0.0005415625,0.00093129603,0.0010606134,0.0006854129,0.0005067664,0.000036108442],"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.00005379525,0.00006650346,0.000091352675,0.0002711392,0.000066750115,0.0001530795,0.0015225471,0.0025211049,0.00028853142,0.390841,0.00016927996,0.6039549],"study_design_scores_gemma":[0.0040153493,0.0015161926,0.00015301722,0.0068382854,0.00006285568,0.0007033518,0.0000019779577,0.34359398,0.0031098987,0.4869078,0.1482511,0.0048461915],"about_ca_topic_score_codex":0.000016118305,"about_ca_topic_score_gemma":0.00012149449,"teacher_disagreement_score":0.5991087,"about_ca_system_score_codex":0.0005115093,"about_ca_system_score_gemma":0.0011969451,"threshold_uncertainty_score":0.99970275},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020407948,0.00079791265,0.60183746,0.00002289055,0.0029700284,0.00026983564,0.000018150075,0.00035824766,0.39168465],"genre_scores_gemma":[0.5427782,0.00013175399,0.009550881,0.00031962252,0.00025806765,0.00011866283,0.0013550852,0.00006706951,0.44542068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981305,0.00003398019,0.0004335684,0.0006338643,0.00040206907,0.00036598835],"domain_scores_gemma":[0.99859965,0.000015910151,0.00022672603,0.0008190702,0.00020579435,0.000132833],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017783068,0.00030068183,0.0003642366,0.000107339176,0.00015308222,0.00017439628,0.0012315925,0.0003424555,0.0003431249],"category_scores_gemma":[0.000010001579,0.00026042087,0.00012394685,0.00036235197,0.000018285536,0.00038599703,0.00009485564,0.00024643325,0.00095062767],"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.0000618816,0.00036435178,0.00006506072,0.0005312568,0.00010394608,0.00012996685,0.0034186633,0.000047008467,0.0009251921,0.5172909,0.1872709,0.28979093],"study_design_scores_gemma":[0.0014310364,0.00039152204,0.008188979,0.0012736503,0.000062016494,0.000052484225,0.0017443986,0.057761777,0.015175969,0.00836333,0.90240955,0.0031452929],"about_ca_topic_score_codex":0.00082791765,"about_ca_topic_score_gemma":0.0006468072,"teacher_disagreement_score":0.7151387,"about_ca_system_score_codex":0.00004705017,"about_ca_system_score_gemma":0.0001897334,"threshold_uncertainty_score":0.9999848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126856,0.0047981716,0.22627518,0.0627931,0.03380881,0.008136282,0.0006005889,0.00069852074,0.15020373],"genre_scores_gemma":[0.9960575,0.00013480462,0.0005457924,0.0006857683,0.0005823482,0.00010251423,0.000019918785,0.000034478402,0.0018368354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324906,0.000042799893,0.0009646778,0.0022465459,0.0018230168,0.0016739061],"domain_scores_gemma":[0.997664,0.00040581267,0.00045044508,0.0003777655,0.0007352925,0.0003667387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012486652,0.0007920719,0.00084105146,0.00064301945,0.00040913525,0.0014843295,0.0045138267,0.0003506618,0.00015144939],"category_scores_gemma":[0.00033819536,0.00062617485,0.000081071805,0.0013376572,0.0014561085,0.0012298187,0.0013102964,0.0015605361,0.00004182684],"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.00011913602,0.00010911131,0.00054797134,0.000080037324,0.000024907087,0.000015977419,0.00042983892,0.000115662755,0.00010505777,0.9652021,0.023249058,0.010001134],"study_design_scores_gemma":[0.013787876,0.0032082004,0.013351678,0.031638544,0.000051561274,0.00049685355,0.0003108762,0.7387328,0.0051795044,0.09108718,0.09274608,0.009408839],"about_ca_topic_score_codex":0.004429782,"about_ca_topic_score_gemma":0.005222503,"teacher_disagreement_score":0.87411493,"about_ca_system_score_codex":0.002456871,"about_ca_system_score_gemma":0.004428948,"threshold_uncertainty_score":0.99961895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09082888,0.00000932108,0.8948683,0.00007879259,0.000098684824,0.007544374,0.000023438997,0.00017223039,0.0063759857],"genre_scores_gemma":[0.97573364,2.504129e-7,0.022458049,0.000054484033,0.000018709043,0.00019110029,0.0000067638302,0.000011071956,0.0015259476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833286,0.0001514421,0.00017578433,0.0005026739,0.00046933896,0.00036788604],"domain_scores_gemma":[0.9986711,0.00005420716,0.00027445174,0.0004922272,0.00036186236,0.00014615014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441493,0.0002087505,0.0002867345,0.0001348442,0.000430995,0.00012485257,0.00070582365,0.00011664696,0.000086299144],"category_scores_gemma":[0.000030896263,0.00022076533,0.000101245845,0.0009077494,0.00017284737,0.00071907596,0.000057210935,0.00018471794,0.000066796674],"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.0001288581,0.00035490672,0.017747303,0.00020762066,0.00009617992,0.000047645855,0.0013122832,0.0019633486,0.0001025616,0.9750737,0.0026678892,0.000297721],"study_design_scores_gemma":[0.0055167605,0.00090448646,0.0131321745,0.00020726338,0.00004374021,0.00008791713,0.0013588384,0.016764466,0.0001358938,0.9419185,0.018954601,0.00097536255],"about_ca_topic_score_codex":0.0003870199,"about_ca_topic_score_gemma":0.000694198,"teacher_disagreement_score":0.88490474,"about_ca_system_score_codex":0.00014020024,"about_ca_system_score_gemma":0.00038558792,"threshold_uncertainty_score":0.9002549},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063252546,0.00035457706,0.88353646,0.0004176352,0.0002770277,0.00023878599,0.000007012713,0.00034215263,0.051573783],"genre_scores_gemma":[0.9914113,6.384342e-7,0.008419046,0.0000530533,0.000027384709,0.0000024029405,6.35693e-7,0.0000016315316,0.000083855215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00007654025,0.00028136722,0.00020495759,0.00037974326,0.00015628542],"domain_scores_gemma":[0.9992187,0.000024469215,0.00011007143,0.00041945188,0.00017625894,0.000051043306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006419175,0.00007781811,0.00018314284,0.000032584874,0.000047569265,0.00005503989,0.0004768229,0.000037563957,0.0000030976157],"category_scores_gemma":[0.00003477991,0.00006230078,0.000056247944,0.0002585126,0.000008763502,0.00018449698,0.000035035595,0.000049024267,0.000014326931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010500828,0.000119438424,0.00026835364,0.00011188799,0.00002385636,0.000012092164,0.0012388215,0.00083003996,0.012774679,0.88131976,0.0022660696,0.10102447],"study_design_scores_gemma":[0.000997077,0.00041200427,0.00514561,0.00032632498,0.000008794274,0.000056206605,0.00032249233,0.9732672,0.013322797,0.0033665986,0.0024207942,0.00035410913],"about_ca_topic_score_codex":0.000058460922,"about_ca_topic_score_gemma":0.000006096751,"teacher_disagreement_score":0.97243714,"about_ca_system_score_codex":0.000025476154,"about_ca_system_score_gemma":0.000055530552,"threshold_uncertainty_score":0.2540552},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025004525,0.000016091157,0.9076324,0.00007041245,0.00013342219,0.06634319,0.0000033244403,0.00014231996,0.025633834],"genre_scores_gemma":[0.13383211,0.0000038432363,0.24543889,0.00071263395,0.00015351248,0.6056101,0.000011979566,0.000038992875,0.014197948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874973,0.000021857491,0.00031333286,0.00038258027,0.0001461398,0.00038633292],"domain_scores_gemma":[0.999226,0.00003697371,0.000064471715,0.00044997127,0.0001060525,0.00011656656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033713263,0.00014450928,0.00018759067,0.000025363432,0.00011318016,0.00010576657,0.00036212467,0.000080471764,0.000025000672],"category_scores_gemma":[0.0000116375895,0.00011458605,0.000089354064,0.00025836943,0.000021221707,0.00028344349,0.000011286095,0.00007402892,0.000014340331],"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.00014865119,0.0011027912,0.00735458,0.00045638028,0.000080443846,0.000049632978,0.00058838713,0.016330365,0.0002459139,0.875494,0.031802323,0.06634651],"study_design_scores_gemma":[0.0018491661,0.00007761026,0.0004535998,0.000047260768,0.0000023280575,0.00001306577,0.000008642058,0.17042443,0.0003851081,0.00028724843,0.82624364,0.00020788434],"about_ca_topic_score_codex":0.000018989105,"about_ca_topic_score_gemma":0.000013716826,"teacher_disagreement_score":0.87520677,"about_ca_system_score_codex":0.000017938331,"about_ca_system_score_gemma":0.00004866609,"threshold_uncertainty_score":0.46726835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055010434,0.0013856532,0.8870919,0.0005724922,0.004165485,0.03551148,0.00049420283,0.0013815211,0.014386864],"genre_scores_gemma":[0.9079793,0.000052252955,0.016960772,0.000656858,0.00047423443,0.0075911046,0.0011885385,0.0001821281,0.06491481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99125034,0.0005455174,0.002165347,0.0023626545,0.0016346314,0.0020415045],"domain_scores_gemma":[0.9946858,0.00026467146,0.0012474662,0.0019980434,0.00088393776,0.000920026],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00081043685,0.0015600212,0.0018964189,0.00039329295,0.000812996,0.0020171301,0.0032078559,0.0010783679,0.0008510445],"category_scores_gemma":[0.000061711,0.0015215017,0.0006866774,0.0013384591,0.0001451117,0.00080306915,0.00037009775,0.0012368764,0.0038667163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001780325,0.024027959,0.013296691,0.013543125,0.0050315913,0.0037476933,0.1899946,0.019141017,0.010288044,0.05828679,0.23268664,0.42817554],"study_design_scores_gemma":[0.002750591,0.00046788185,0.005271785,0.0015728658,0.00011547985,0.00013993359,0.0029538006,0.9559407,0.0011394314,0.000107289445,0.027458802,0.0020814429],"about_ca_topic_score_codex":0.0008002047,"about_ca_topic_score_gemma":0.00040097826,"teacher_disagreement_score":0.9367997,"about_ca_system_score_codex":0.00064272684,"about_ca_system_score_gemma":0.0004616154,"threshold_uncertainty_score":0.9997148},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.217718e-7,0.000054831857,0.87021065,0.000118896474,0.00020700526,0.029575184,0.005897869,0.00029535088,0.09363927],"genre_scores_gemma":[0.00030330062,0.000008630296,0.045618482,0.00013051378,0.00020231241,0.056859344,0.0011515316,0.00023735674,0.8954885],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977838,0.00004552555,0.00042981823,0.00081120053,0.00036777018,0.0005618772],"domain_scores_gemma":[0.99849766,0.00002964869,0.00030933417,0.0009141582,0.000055743785,0.0001934409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014608778,0.00043257786,0.000599034,0.000078171535,0.00009184382,0.00013589048,0.0010345083,0.00037473842,0.00067587395],"category_scores_gemma":[0.000008581416,0.00035723115,0.00014505249,0.00028238448,0.000045201472,0.00019441523,0.000078101926,0.00013777376,0.00044540453],"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.000009027165,0.00038128422,0.000111294474,0.0001662537,0.000100038116,0.000007496434,0.00019669157,0.0000073337737,0.00005281489,0.011074524,0.9868384,0.0010548346],"study_design_scores_gemma":[0.0013637564,0.00008577621,0.00015073233,0.00019523618,0.000010861953,0.0000016266582,0.000055891072,0.006856174,0.00011485034,0.000034127585,0.990678,0.0004529444],"about_ca_topic_score_codex":0.000043471424,"about_ca_topic_score_gemma":0.00008416689,"teacher_disagreement_score":0.8245922,"about_ca_system_score_codex":0.00006241223,"about_ca_system_score_gemma":0.00008290995,"threshold_uncertainty_score":0.99988794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05545069,0.00006055721,0.9434693,0.00019578138,0.0004738361,0.00022151835,0.000007534989,0.00009400384,0.000026794232],"genre_scores_gemma":[0.8568904,0.000003803554,0.14289768,0.000056509227,0.00004532559,0.000018195391,0.0000053031854,0.000006849838,0.00007597046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990096,0.0000102860695,0.00025753712,0.00022481779,0.00033188038,0.00016587858],"domain_scores_gemma":[0.9987705,0.0005909999,0.00010581972,0.00020356312,0.00027537308,0.000053787426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006219742,0.000116013056,0.00012097995,0.00007350438,0.000065144595,0.00008969677,0.0004110188,0.00004570385,0.0000019508213],"category_scores_gemma":[0.0007210172,0.00009507695,0.000048152677,0.00009726083,0.000013800196,0.0002809403,0.000080524616,0.000116379044,6.9909333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053895936,0.00006163468,0.0026045442,0.00046452784,0.00012013762,0.0000028956977,0.0033717104,0.2402025,0.0043368516,0.4863353,0.0001969442,0.26224905],"study_design_scores_gemma":[0.00035784463,0.000055083303,0.004685194,0.00022927744,0.000004410861,0.0000040520786,0.00002912745,0.99118924,0.0010824413,0.0021992025,0.000057000136,0.000107152424],"about_ca_topic_score_codex":0.000016593991,"about_ca_topic_score_gemma":0.0000052476403,"teacher_disagreement_score":0.80143964,"about_ca_system_score_codex":0.000070462156,"about_ca_system_score_gemma":0.00007819581,"threshold_uncertainty_score":0.38771257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0557839,0.000108772285,0.92178446,0.010095302,0.002019608,0.0010116871,0.00023313709,0.0016859694,0.007277187],"genre_scores_gemma":[0.97774893,0.00011483021,0.01277203,0.0023226226,0.00006691449,0.00017292949,0.000020818488,0.000051351406,0.0067295576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976145,0.00009411644,0.00040519118,0.0007404267,0.00061020866,0.0005355519],"domain_scores_gemma":[0.9983001,0.00026076194,0.00009420226,0.0011007398,0.00007859439,0.00016559786],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043014192,0.0002693539,0.00029724892,0.00043829085,0.00029793775,0.00021149621,0.0013313375,0.00013777034,0.00011651345],"category_scores_gemma":[0.000051540414,0.00027023826,0.00014605549,0.0015985322,0.0000672582,0.0004053755,0.000029628505,0.0003991511,0.0037315867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010759602,0.00119334,0.00019114786,0.00011418634,0.00016872385,0.0007877452,0.013410511,0.016044015,0.0025931252,0.0064470386,0.019533778,0.9394088],"study_design_scores_gemma":[0.005766362,0.0020315354,0.003959815,0.003192503,0.000059082464,0.00033125366,0.0017011488,0.79645807,0.024660379,0.12399901,0.03464962,0.003191223],"about_ca_topic_score_codex":0.00047418458,"about_ca_topic_score_gemma":0.000045906952,"teacher_disagreement_score":0.93621755,"about_ca_system_score_codex":0.00009344468,"about_ca_system_score_gemma":0.00008726741,"threshold_uncertainty_score":0.99997497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012192145,0.0000058098785,0.97786295,0.0023767091,0.000115408686,0.00007152012,0.000014695483,0.00019448818,0.0071662553],"genre_scores_gemma":[0.978684,0.0000030357385,0.020204922,0.0006924542,0.000025475845,0.000009146266,0.000008516623,0.000003867935,0.0003685902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934304,0.000054821296,0.00014518874,0.00018223531,0.0001470608,0.000127662],"domain_scores_gemma":[0.9985736,0.000058350553,0.000059771803,0.0011569997,0.00008145594,0.00006981178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019730718,0.00007076958,0.0000840906,0.00002807307,0.00007098587,0.000109190114,0.0007904131,0.000036495658,0.00004030812],"category_scores_gemma":[0.000021941501,0.00004383391,0.000022298958,0.00009754372,0.00002132153,0.00035347047,0.00003730993,0.000037686626,0.00021449241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021223508,0.0005012136,0.012344001,0.000015956002,0.000009702377,0.0000077756995,0.00009827358,0.000015446993,0.013957295,0.6576318,0.007593702,0.30780357],"study_design_scores_gemma":[0.0013497918,0.0003303221,0.13218087,0.00026200493,0.000002528911,0.000004673583,0.000009796744,0.7153896,0.0050434005,0.0010139565,0.14386159,0.0005514837],"about_ca_topic_score_codex":0.000010073631,"about_ca_topic_score_gemma":0.0000026186613,"teacher_disagreement_score":0.9664918,"about_ca_system_score_codex":0.00002366618,"about_ca_system_score_gemma":0.000025083633,"threshold_uncertainty_score":0.27569374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20797922,0.000005116346,0.78861815,0.0003142045,0.00011674535,0.0015869294,0.000003670778,0.00018044072,0.0011955043],"genre_scores_gemma":[0.99118865,9.3774355e-7,0.008537802,0.00006866765,0.000011344185,0.00018147349,0.000007474339,0.0000015384858,0.0000020888451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999254,0.000033626795,0.00035977483,0.00009714875,0.00014658486,0.00010885207],"domain_scores_gemma":[0.99959844,0.000044222124,0.00016735193,0.00008254169,0.000073114694,0.000034301855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024699196,0.00006651701,0.00008670265,0.00011947629,0.00005968124,0.00017600835,0.00008415095,0.000038500202,0.0000012353288],"category_scores_gemma":[0.000030631734,0.00005044078,0.000013185174,0.00023291714,0.000009734851,0.002640803,0.000033562912,0.000032040727,0.000013813953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048139964,0.000011755471,0.12218329,0.000055266875,0.0000030918484,4.826063e-7,0.0012650965,0.00031937234,0.000024582185,0.097733505,0.00006872574,0.77833],"study_design_scores_gemma":[0.0026816356,0.00008345417,0.29644138,0.00045625598,0.0000020130074,0.00005316341,0.0005091414,0.68323666,0.00019244608,0.008047464,0.007874188,0.00042222213],"about_ca_topic_score_codex":0.00002355751,"about_ca_topic_score_gemma":0.000009198323,"teacher_disagreement_score":0.78320944,"about_ca_system_score_codex":0.00008397837,"about_ca_system_score_gemma":0.000022478158,"threshold_uncertainty_score":0.20569153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0631775,0.00015544135,0.93468463,0.00031691545,0.00039261588,0.00045037968,0.000118897915,0.000048930124,0.000654658],"genre_scores_gemma":[0.9952032,0.000009407702,0.0042414274,0.000008732409,0.000032519616,0.00008760656,0.000012330659,0.0000043023524,0.00040046798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998537,0.000028893724,0.0006012521,0.00029142183,0.00024151981,0.00029989402],"domain_scores_gemma":[0.99908006,0.00009384652,0.0001959794,0.00041827888,0.00015419317,0.00005764389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039043784,0.00012414056,0.00035205862,0.000068687186,0.000036613135,0.000036105626,0.0005580661,0.000052078973,0.0000048459037],"category_scores_gemma":[0.00002452248,0.000077426674,0.000052904183,0.0003125679,0.000028754486,0.000286776,0.00008677872,0.0000337589,0.00001411677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015218931,0.0015675589,0.27656204,0.0011426333,0.00012838306,0.0000087534245,0.000894202,0.003988858,0.014489255,0.19491124,0.022346253,0.48380864],"study_design_scores_gemma":[0.002189304,0.00027212422,0.014864958,0.000423133,0.000003609932,0.000004227815,0.00007520887,0.94910467,0.0048261723,0.00002791669,0.027969614,0.00023906077],"about_ca_topic_score_codex":0.000072197094,"about_ca_topic_score_gemma":0.000013967124,"teacher_disagreement_score":0.9451158,"about_ca_system_score_codex":0.00003470725,"about_ca_system_score_gemma":0.00003502139,"threshold_uncertainty_score":0.3157368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062849484,0.000034373126,0.93058467,0.0019387533,0.0009056824,0.0015817228,0.0009841952,0.0003192966,0.0008018476],"genre_scores_gemma":[0.9931113,0.00000998799,0.003970047,0.001925791,0.00017344291,0.00014349038,0.00033767265,0.000037618116,0.00029064793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670017,0.000059039463,0.0011771645,0.0004559635,0.00047855795,0.0011291124],"domain_scores_gemma":[0.99789274,0.00023185264,0.0003740975,0.0009858345,0.00020276493,0.00031268637],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073331175,0.0004471569,0.00057525065,0.00029033277,0.00021696281,0.00033593678,0.0015300346,0.00023883788,0.000023160126],"category_scores_gemma":[0.00009980441,0.00033599915,0.00018348206,0.00076419214,0.00006689278,0.001236287,0.00051682635,0.00029305747,0.0009222329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006728851,0.0017158422,0.008201058,0.00079439563,0.0003357171,0.00010802278,0.015761234,0.018020837,0.00028482714,0.018368756,0.054296132,0.8814403],"study_design_scores_gemma":[0.0034483061,0.00037471575,0.006972604,0.0011718734,0.000007734096,0.00003200717,0.000102891856,0.89926577,0.00006844432,0.00011865581,0.08764305,0.00079392345],"about_ca_topic_score_codex":0.000012468223,"about_ca_topic_score_gemma":0.000019539752,"teacher_disagreement_score":0.93026185,"about_ca_system_score_codex":0.0003533118,"about_ca_system_score_gemma":0.000041078107,"threshold_uncertainty_score":0.9999092},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010061828,0.000103312,0.9360521,0.0051597217,0.0005070447,0.00033838244,0.000012839664,0.00019921653,0.047565565],"genre_scores_gemma":[0.9034825,0.000005712933,0.09418988,0.000088394205,0.000079958554,0.00003705375,0.000012673169,0.000006242255,0.0020975939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992975,0.000023016713,0.00018820178,0.00021936305,0.0001071653,0.00016477477],"domain_scores_gemma":[0.9984766,0.00005121419,0.00018882382,0.0011877451,0.00004638821,0.000049225946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024434447,0.000085153304,0.0001324302,0.000026257614,0.0005861719,0.0004371582,0.0011435205,0.000057133293,0.000008337785],"category_scores_gemma":[0.000047867972,0.00007717475,0.000062971114,0.00003933595,0.00008614366,0.00072751584,0.00010788266,0.000053442356,0.000039449536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019962756,0.00008351252,0.0010646435,0.000042355696,0.000048494938,0.0000022975973,0.0008382371,0.000054770873,0.004640268,0.30106297,0.042376,0.6497665],"study_design_scores_gemma":[0.0021021396,0.00013228039,0.018567473,0.00015202186,0.00001733846,0.00006109423,0.00020299158,0.76826364,0.005033973,0.007878434,0.19700791,0.0005807127],"about_ca_topic_score_codex":0.000024851983,"about_ca_topic_score_gemma":0.000010872015,"teacher_disagreement_score":0.89342064,"about_ca_system_score_codex":0.000019221532,"about_ca_system_score_gemma":0.000026189402,"threshold_uncertainty_score":0.45084196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01683943,0.00005564568,0.95334005,0.0018245704,0.017102065,0.0013674855,0.0010711454,0.0005636676,0.007835952],"genre_scores_gemma":[0.96947473,0.00005645414,0.02380077,0.00072207244,0.001668042,0.00038355897,0.0003268654,0.00006166602,0.0035058116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967806,0.000051021918,0.0013396398,0.00040901097,0.00061288546,0.0008068818],"domain_scores_gemma":[0.9973784,0.00018140754,0.0005621686,0.0011642119,0.0004551055,0.00025867994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068638305,0.00041434047,0.000506069,0.00016276746,0.00035459248,0.0006842188,0.0015101429,0.00029050282,0.00004464397],"category_scores_gemma":[0.00016308698,0.00029501642,0.00028358283,0.0003529423,0.00009357893,0.0030666476,0.00024174317,0.00021110047,0.0005494402],"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.000594797,0.000967505,0.0018428004,0.0010555234,0.00071224384,0.000045857018,0.014432016,0.000116828676,0.0035546662,0.45406145,0.13773382,0.38488248],"study_design_scores_gemma":[0.0056724763,0.00031563517,0.00034012776,0.0003137239,0.000020759053,0.0000922498,0.00016111355,0.031421028,0.00079126586,0.002429976,0.95764023,0.0008014305],"about_ca_topic_score_codex":0.000013498299,"about_ca_topic_score_gemma":0.000019521036,"teacher_disagreement_score":0.95263535,"about_ca_system_score_codex":0.0002738173,"about_ca_system_score_gemma":0.00017514998,"threshold_uncertainty_score":0.9999502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20233181,0.001689224,0.72948194,0.03651856,0.005851727,0.009331218,0.001171501,0.0008308275,0.0127932085],"genre_scores_gemma":[0.9975842,0.000016408529,0.0011596283,0.00021572433,0.00004757536,0.00027765188,7.779945e-7,0.000013415753,0.0006845674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983288,0.00001097251,0.00043175175,0.00043769856,0.00039121488,0.0003995704],"domain_scores_gemma":[0.99865997,0.00021087931,0.0004082284,0.00027062235,0.0003541246,0.00009616707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034535863,0.00022914725,0.00036107254,0.000054674532,0.00013870845,0.00010269337,0.0011903711,0.000064897125,0.0000040731225],"category_scores_gemma":[0.00017508176,0.00012070175,0.00017936804,0.00019094943,0.00011022103,0.000213188,0.00012757434,0.00007953036,0.000006892104],"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.00036627313,0.0003741017,0.0015734758,0.0002322303,0.00020226571,0.0000014994145,0.00039364307,0.000047234204,0.098462045,0.8396074,0.009755659,0.04898416],"study_design_scores_gemma":[0.08865922,0.010681211,0.02884931,0.011101881,0.00075039564,0.0001987048,0.0007438637,0.17689422,0.3712588,0.1887504,0.11678544,0.0053265747],"about_ca_topic_score_codex":0.000006334392,"about_ca_topic_score_gemma":0.0000013369787,"teacher_disagreement_score":0.79525244,"about_ca_system_score_codex":0.000115007235,"about_ca_system_score_gemma":0.00004643147,"threshold_uncertainty_score":0.49220744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15057367,0.0012912116,0.7977292,0.029700516,0.003656313,0.0033104182,0.0012091738,0.0003608616,0.012168616],"genre_scores_gemma":[0.9943507,0.000014855571,0.004203239,0.000110252935,0.00007436444,0.0001191191,0.0000010792475,0.0000062154318,0.0011202102],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989791,0.0000033077158,0.0002248218,0.00026990127,0.00031383068,0.00020907093],"domain_scores_gemma":[0.99939555,0.000047750516,0.00015129616,0.0001679085,0.00018342973,0.000054065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024131288,0.00010661881,0.00013963837,0.00003131873,0.00010922325,0.00003612321,0.0007537318,0.000013408455,0.00001031529],"category_scores_gemma":[0.00003529374,0.00005627878,0.00020286284,0.00009472694,0.000049142178,0.00037770075,0.0000956777,0.00003302552,0.0000050592753],"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.00016962683,0.00069292105,0.001151408,0.0006251415,0.00040053052,0.0000012569974,0.00084906945,0.0000613037,0.39546382,0.30755365,0.086603634,0.20642762],"study_design_scores_gemma":[0.0029422648,0.00027535637,0.001032585,0.00062925916,0.0000672767,0.000102050275,0.00021649437,0.003491095,0.7889556,0.004159562,0.19766821,0.00046020217],"about_ca_topic_score_codex":0.000009918944,"about_ca_topic_score_gemma":6.5016644e-7,"teacher_disagreement_score":0.843777,"about_ca_system_score_codex":0.00006505225,"about_ca_system_score_gemma":0.000030310357,"threshold_uncertainty_score":0.2294982},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032764334,0.00043744163,0.95976675,0.0037572852,0.00023195143,0.0003072369,0.0001764969,0.0002024266,0.0023560904],"genre_scores_gemma":[0.9888507,0.00002370583,0.0103517985,0.0002226013,0.000031989162,0.000021215836,0.000011399761,0.0000045194306,0.00048208222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917555,0.00003378041,0.00016455738,0.00031912458,0.00012896667,0.00017799644],"domain_scores_gemma":[0.9994168,0.000086200555,0.00005816119,0.0002692144,0.000072959345,0.00009664539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001247399,0.00010967722,0.00012749864,0.000037267004,0.000096684846,0.00023067261,0.0001594545,0.000043963206,0.00027589203],"category_scores_gemma":[0.000014519208,0.00007019764,0.000012526533,0.00014433668,0.000046550584,0.0005115293,0.00007516395,0.000022851096,0.000048680256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034426794,0.00019360363,0.0026910673,0.00013560626,0.00006548576,0.000052116302,0.0005866255,0.000055184988,0.033038843,0.058357634,0.1651859,0.7396035],"study_design_scores_gemma":[0.007460637,0.0011524078,0.020116353,0.00047489264,0.000028486178,0.00014050998,0.00020198464,0.4436807,0.020739352,0.0047317124,0.49953526,0.0017377042],"about_ca_topic_score_codex":0.000037749975,"about_ca_topic_score_gemma":0.00005925132,"teacher_disagreement_score":0.95608634,"about_ca_system_score_codex":0.000042582444,"about_ca_system_score_gemma":0.00008022025,"threshold_uncertainty_score":0.30208242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004639109,0.0004085722,0.9919944,0.0029439225,0.0003524385,0.0013126091,0.00006370925,0.00050739624,0.0019530745],"genre_scores_gemma":[0.3299251,0.000052827832,0.66781664,0.0003479668,0.00015697001,0.00063955894,0.000009368923,0.000018822351,0.0010327412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798876,0.00004168095,0.00052397576,0.0007102811,0.00023082928,0.00050445297],"domain_scores_gemma":[0.998436,0.00012231384,0.00017354196,0.00086672674,0.00026160627,0.00013984369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462385,0.0002151826,0.0002806583,0.000040198734,0.00041962654,0.00023584401,0.0010176867,0.00009711207,0.00000497458],"category_scores_gemma":[0.000027043134,0.000149122,0.0001369826,0.00030081745,0.000037042497,0.0008057782,0.00017777587,0.00007497801,0.00014865596],"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.000015358497,0.0006878454,0.00014676938,0.0002533988,0.0001286367,0.0000070277165,0.0014679778,0.001100746,0.011812777,0.9067653,0.0040693395,0.07354483],"study_design_scores_gemma":[0.0026065158,0.00005718918,0.00008706805,0.00018323424,0.00001271117,0.00002017894,0.00015171363,0.23764488,0.0042168614,0.0025400138,0.75191605,0.000563563],"about_ca_topic_score_codex":0.000063887106,"about_ca_topic_score_gemma":0.000017863355,"teacher_disagreement_score":0.9042253,"about_ca_system_score_codex":0.00008678255,"about_ca_system_score_gemma":0.0001716506,"threshold_uncertainty_score":0.6081019},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049683484,0.0000203876,0.47794333,0.0034079638,0.0005776359,0.000041669075,0.0000013473567,0.00009854893,0.51294076],"genre_scores_gemma":[0.99076587,5.538931e-7,0.0022276565,0.00025291022,0.000034043966,0.0000017601088,2.0013131e-7,0.0000010885425,0.006715923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967295,0.000004039297,0.000052585805,0.0001114758,0.00006962444,0.00008935035],"domain_scores_gemma":[0.99908566,0.0000036504514,0.000035190173,0.0008195371,0.000023245735,0.00003271209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006190268,0.000032424658,0.000043832468,0.0000066433035,0.00018386118,0.0004956397,0.0009575732,0.000015023856,0.000017562284],"category_scores_gemma":[0.000010095287,0.00002410497,0.000019462572,0.0000114601935,0.000013133982,0.0004609779,0.00015521863,0.000021443457,0.0003285287],"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.0000011417807,0.000029191355,0.00919608,0.0000059858544,0.00000860803,0.0000356618,0.00013038267,0.0000011826585,0.00045105012,0.8394848,0.039480463,0.111175425],"study_design_scores_gemma":[0.00066515733,0.000050417766,0.33689526,0.000030380497,0.0000016170832,0.000048667338,0.000008721869,0.015853057,0.0034019728,0.0062567517,0.63641375,0.00037425602],"about_ca_topic_score_codex":0.000038545782,"about_ca_topic_score_gemma":0.0000062721533,"teacher_disagreement_score":0.9857975,"about_ca_system_score_codex":0.000003324479,"about_ca_system_score_gemma":0.000007375285,"threshold_uncertainty_score":0.47794652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049683484,0.0000203876,0.47794333,0.0034079638,0.0005776359,0.000041669075,0.0000013473567,0.00009854893,0.51294076],"genre_scores_gemma":[0.99076587,5.538931e-7,0.0022276565,0.00025291022,0.000034043966,0.0000017601088,2.0013131e-7,0.0000010885425,0.006715923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967295,0.000004039297,0.000052585805,0.0001114758,0.00006962444,0.00008935035],"domain_scores_gemma":[0.99908566,0.0000036504514,0.000035190173,0.0008195371,0.000023245735,0.00003271209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006190268,0.000032424658,0.000043832468,0.0000066433035,0.00018386118,0.0004956397,0.0009575732,0.000015023856,0.000017562284],"category_scores_gemma":[0.000010095287,0.00002410497,0.000019462572,0.0000114601935,0.000013133982,0.0004609779,0.00015521863,0.000021443457,0.0003285287],"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.0000011417807,0.000029191355,0.00919608,0.0000059858544,0.00000860803,0.0000356618,0.00013038267,0.0000011826585,0.00045105012,0.8394848,0.039480463,0.111175425],"study_design_scores_gemma":[0.00066515733,0.000050417766,0.33689526,0.000030380497,0.0000016170832,0.000048667338,0.000008721869,0.015853057,0.0034019728,0.0062567517,0.63641375,0.00037425602],"about_ca_topic_score_codex":0.000038545782,"about_ca_topic_score_gemma":0.0000062721533,"teacher_disagreement_score":0.9857975,"about_ca_system_score_codex":0.000003324479,"about_ca_system_score_gemma":0.000007375285,"threshold_uncertainty_score":0.47794652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37971878,0.00005483366,0.61962897,0.00006786153,0.0003093785,0.00006419341,6.6898014e-7,0.00015211517,0.0000032023997],"genre_scores_gemma":[0.9695452,0.00001453544,0.030301446,0.000023014449,0.000069481524,0.000015373995,2.6092764e-7,0.0000056298586,0.00002504715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.000012223087,0.00020141438,0.00046156472,0.00028092845,0.00031895464],"domain_scores_gemma":[0.999381,0.00008436466,0.000042265106,0.0002992209,0.00009062178,0.00010252285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994373,0.00012383348,0.00012903569,0.00027969707,0.00016775851,0.00022574664,0.0005230774,0.000036273825,7.1758143e-7],"category_scores_gemma":[0.00013400642,0.00009770577,0.000018882123,0.0010197079,0.00005008521,0.001206311,0.0002575284,0.00007039218,0.0000044623857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009818157,0.00008311266,0.05598118,0.0001156008,0.00001364359,0.00005817676,0.0017953081,0.021982925,0.053816367,0.033004627,0.00014335108,0.8329959],"study_design_scores_gemma":[0.00053092046,0.000046523895,0.2369383,0.00024107126,9.87233e-7,0.00006196745,0.0000037960622,0.75806886,0.003403346,0.00008411196,0.00032047497,0.00029964198],"about_ca_topic_score_codex":0.000012777324,"about_ca_topic_score_gemma":0.0000037285336,"teacher_disagreement_score":0.83269626,"about_ca_system_score_codex":0.00013732126,"about_ca_system_score_gemma":0.00005985242,"threshold_uncertainty_score":0.39843258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006191589,0.00007707957,0.98950046,0.0014536863,0.0007735888,0.0001293555,0.000004985342,0.00012426006,0.0017450037],"genre_scores_gemma":[0.99544954,0.0000037944508,0.0035314409,0.0002008973,0.00008192516,0.000007903499,2.3368025e-7,0.0000050270705,0.0007192415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990153,0.000054222284,0.00018680864,0.0002634933,0.0002230852,0.00025713257],"domain_scores_gemma":[0.9992588,0.00007878487,0.000075368014,0.0004622965,0.000065831024,0.00005889089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002586261,0.00010716602,0.00011600663,0.000023448112,0.00014890566,0.00013264563,0.00072542735,0.00003568606,0.000026510805],"category_scores_gemma":[0.000019438612,0.000047524376,0.00006052487,0.00016196714,0.00003062552,0.00027737077,0.00018315772,0.00004920585,0.00006280594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6472205e-7,0.000027431426,0.00009682543,0.0000049658906,0.000014764355,0.000008784528,0.00028317442,0.000018295801,0.016163569,0.7713137,0.0007110291,0.21135677],"study_design_scores_gemma":[0.0025342032,0.00010892392,0.00077456824,0.0004661952,0.000017803506,0.00014359731,0.00024679277,0.8297877,0.039026804,0.014664646,0.11133236,0.00089645747],"about_ca_topic_score_codex":0.00006176211,"about_ca_topic_score_gemma":0.000033388485,"teacher_disagreement_score":0.98925793,"about_ca_system_score_codex":0.000042043306,"about_ca_system_score_gemma":0.000035160116,"threshold_uncertainty_score":0.19379878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005145224,0.00003345226,0.97039056,0.0002839549,0.0006768945,0.009883149,0.000042520882,0.00014702023,0.013397246],"genre_scores_gemma":[0.9806745,0.0000013817261,0.015400295,0.000009564946,0.00006316098,0.0034979233,0.00007129648,0.00000628052,0.00027560687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985443,0.00004589421,0.00042617065,0.00045882168,0.00038698228,0.00013786064],"domain_scores_gemma":[0.9970985,0.000007819151,0.00068179355,0.0019366394,0.0002285485,0.00004672221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040959855,0.00015076586,0.00030064504,0.00006199912,0.0000792472,0.00026662258,0.0015433755,0.00018247026,0.0000064969786],"category_scores_gemma":[0.000051152787,0.00013017611,0.000106045496,0.00006193198,0.00002320167,0.00010134668,0.00060903886,0.00015354237,0.000015233452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029532672,0.00063965365,0.00288162,0.0022204043,0.0000871105,0.0000071328936,0.0010315817,0.051832926,0.0010174911,0.6027551,0.0036296754,0.33386773],"study_design_scores_gemma":[0.00049658434,0.00006883246,0.15524903,0.0012131353,0.000010503553,0.0000040609884,0.000008888851,0.81867707,0.0034505,0.00772233,0.012523511,0.00057555566],"about_ca_topic_score_codex":0.00070593547,"about_ca_topic_score_gemma":0.0000060740686,"teacher_disagreement_score":0.97552925,"about_ca_system_score_codex":0.00005808919,"about_ca_system_score_gemma":0.00011575496,"threshold_uncertainty_score":0.5308428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24616909,0.00006276606,0.7520703,0.00045748168,0.0010612662,0.00011420217,0.0000031007644,0.000009571984,0.000052185613],"genre_scores_gemma":[0.9458627,0.000011720492,0.053738464,0.00009737053,0.00025418887,7.550809e-7,5.0487864e-7,0.0000069112825,0.000027401558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822134,0.00021465377,0.0008625642,0.00016676167,0.00028058683,0.00025412146],"domain_scores_gemma":[0.99788725,0.00047354956,0.000701976,0.0007203346,0.000119077355,0.00009778178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065662754,0.00012174929,0.0003277379,0.000026255466,0.00072612136,0.00026235453,0.0022272868,0.00006828631,0.0000029969128],"category_scores_gemma":[0.0005676388,0.00007470131,0.00019942957,0.00004005365,0.00008048934,0.0006004765,0.00029811697,0.0003271951,0.0000067034525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032532748,0.00087236374,0.01657632,0.0001485795,0.0005999242,0.00009388069,0.00533592,0.0025028267,0.06984696,0.03720122,0.0020644837,0.8644322],"study_design_scores_gemma":[0.0087752715,0.0024358318,0.13016343,0.0016907798,0.00026393784,0.0014662164,0.0026040485,0.7110507,0.054598562,0.053491432,0.03201306,0.0014467388],"about_ca_topic_score_codex":0.000031660566,"about_ca_topic_score_gemma":0.000009707045,"teacher_disagreement_score":0.8629855,"about_ca_system_score_codex":0.000050368668,"about_ca_system_score_gemma":0.00007486068,"threshold_uncertainty_score":0.5584812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06062041,0.0026074923,0.9295916,0.0011498265,0.00080974295,0.0020043612,0.00028746278,0.00018870493,0.0027403913],"genre_scores_gemma":[0.96415,0.00018289006,0.02499252,0.000033767577,0.00004379308,0.0014494822,0.002029208,0.00004010526,0.0070782388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497145,0.002223513,0.0008614247,0.0010466952,0.00045638002,0.00044051855],"domain_scores_gemma":[0.9955355,0.00034088606,0.00042819223,0.002607064,0.0008586922,0.00022964721],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046345335,0.00037389455,0.00052647956,0.00019865383,0.00024584055,0.001087507,0.002335347,0.0003283821,0.0000124203925],"category_scores_gemma":[0.0002701531,0.00040763646,0.00016620674,0.00030230143,0.00010492099,0.00038646467,0.0013387201,0.0004267375,0.000044707118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007880277,0.008456634,0.08993166,0.0028912579,0.0005989969,0.00012613193,0.062340934,0.23146139,0.0011878987,0.4438105,0.017432727,0.14168307],"study_design_scores_gemma":[0.0015553229,0.000002297481,0.007601779,0.002314025,0.000026596668,0.000019791973,0.00008613989,0.9385449,0.0014102607,0.00090347667,0.046580043,0.00095534587],"about_ca_topic_score_codex":0.0019383214,"about_ca_topic_score_gemma":0.0026311497,"teacher_disagreement_score":0.9045991,"about_ca_system_score_codex":0.00041558684,"about_ca_system_score_gemma":0.0005275295,"threshold_uncertainty_score":0.99994946},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014983084,0.0011628405,0.29632246,0.0007063677,0.0006353649,0.0005952547,0.00005996262,0.0007335918,0.6996343],"genre_scores_gemma":[0.9423421,0.0002134932,0.0022834607,0.0010778997,0.0028451725,0.00020902214,0.0001727279,0.00022585476,0.050630294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99668276,0.000005134146,0.00063416205,0.0013297853,0.0007005281,0.0006476142],"domain_scores_gemma":[0.9976341,0.00010757558,0.0005542879,0.00067463657,0.0007832097,0.00024619253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002718458,0.0007129536,0.00077836274,0.00024346489,0.00051782094,0.0006384347,0.0013901449,0.000742784,0.00015514577],"category_scores_gemma":[0.00016235538,0.00064720743,0.000325465,0.00027681055,0.00016110764,0.00059112924,0.00033755822,0.0010374443,0.00034009494],"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.000018489283,0.000046195426,0.0006263773,0.00025000965,0.00018770041,0.00005971516,0.0005714253,0.00018270742,0.00046349186,0.96807295,0.0073916437,0.022129307],"study_design_scores_gemma":[0.00026172685,0.00015992072,0.00022655619,0.0005415114,0.00007303818,0.00022634717,0.00001388258,0.0047084335,0.00037184666,0.14699635,0.8454011,0.0010192783],"about_ca_topic_score_codex":0.00007191012,"about_ca_topic_score_gemma":0.00004472693,"teacher_disagreement_score":0.94219226,"about_ca_system_score_codex":0.00013910745,"about_ca_system_score_gemma":0.00012612788,"threshold_uncertainty_score":0.9995979},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079113305,0.000115961135,0.9164649,0.00085305993,0.00022877724,0.00034289644,0.00003263989,0.00039152201,0.0024569214],"genre_scores_gemma":[0.98510987,0.0000017247382,0.014368592,0.00020573295,0.00009823576,0.000023288141,0.000110758,0.0000115561015,0.00007024795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979389,0.00005677414,0.0004033334,0.0005540263,0.00041987826,0.0006271153],"domain_scores_gemma":[0.9984581,0.00006257334,0.00020669111,0.0007914367,0.00028986373,0.0001913716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020955475,0.00025784937,0.00029364892,0.00005938529,0.00027030404,0.0005760252,0.0010708327,0.00006384786,0.00004364187],"category_scores_gemma":[0.000017596858,0.00020428406,0.00007082203,0.0008044865,0.00004801396,0.00046103934,0.0002209401,0.00018833844,0.0003865002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331099,0.0014650886,0.077622555,0.00030696904,0.0006080826,0.00046524426,0.0020303843,0.02831868,0.006820683,0.26093954,0.1065666,0.51482284],"study_design_scores_gemma":[0.001859575,0.00029422864,0.07667773,0.00030039722,0.00001703896,0.00015409611,0.00027942582,0.8809845,0.002021864,0.0005365425,0.035807427,0.0010671825],"about_ca_topic_score_codex":0.00018244171,"about_ca_topic_score_gemma":0.0000034903514,"teacher_disagreement_score":0.90599656,"about_ca_system_score_codex":0.00004066075,"about_ca_system_score_gemma":0.000048303544,"threshold_uncertainty_score":0.8330462},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004767742,0.00091541273,0.98172057,0.0049124234,0.00083945424,0.0017823934,0.00072731124,0.0004002678,0.003934448],"genre_scores_gemma":[0.89871645,0.000017655619,0.095688984,0.00006938045,0.000051748182,0.0012014087,0.0015651993,0.00005033222,0.002638868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937679,0.0024440521,0.0010317301,0.0013451314,0.00076239655,0.0006487955],"domain_scores_gemma":[0.9921956,0.0009584711,0.0008901145,0.002889902,0.0027755362,0.00029036592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058517167,0.000506402,0.00058235053,0.00018340292,0.00054313435,0.0010256779,0.0030714856,0.00034777814,0.000011531333],"category_scores_gemma":[0.0006517952,0.000456941,0.00025162706,0.00035422717,0.0001349711,0.00022296139,0.0016539064,0.00035760005,0.00003311413],"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.000116330135,0.0035322208,0.0028251088,0.0038015442,0.0006539733,0.00003554684,0.008088197,0.0029329213,0.0064959372,0.7463164,0.038932487,0.18626936],"study_design_scores_gemma":[0.0037356408,0.000002910937,0.0026763969,0.014064641,0.000060804283,0.000019048048,0.0000968125,0.39786464,0.15535222,0.0037670825,0.42010468,0.002255101],"about_ca_topic_score_codex":0.00020972207,"about_ca_topic_score_gemma":0.0001909262,"teacher_disagreement_score":0.8939487,"about_ca_system_score_codex":0.0005175306,"about_ca_system_score_gemma":0.0010501433,"threshold_uncertainty_score":0.9997882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05874442,0.000037805497,0.93045986,0.0004236827,0.00007059812,0.00011368621,0.0000013600874,0.000084255975,0.010064338],"genre_scores_gemma":[0.9909173,0.000013531671,0.008480264,0.00019776984,0.000025997158,0.000009026682,0.0000070253427,0.0000016887481,0.00034737444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942017,0.000009440681,0.0001421961,0.00011827048,0.00016921373,0.00014069873],"domain_scores_gemma":[0.9996612,0.0000052403143,0.000058009347,0.0001558576,0.00007540994,0.000044299537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006240267,0.00007603624,0.0000808482,0.000041466035,0.00012481585,0.00007929488,0.00010773049,0.000025341624,0.000010586052],"category_scores_gemma":[0.0000024017345,0.00005482175,0.000010588411,0.00018606466,0.000024993013,0.0010238359,0.000029813466,0.000046844478,0.00006384758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012521508,0.00034109096,0.01715687,0.00019471823,0.00013292437,0.0000590328,0.008916833,0.0013895959,0.002258429,0.073690064,0.037139878,0.8585954],"study_design_scores_gemma":[0.0066358447,0.0029004517,0.17950743,0.00018072834,0.000021490785,0.0041789827,0.000955103,0.47439903,0.011112265,0.00016765397,0.31827134,0.0016696926],"about_ca_topic_score_codex":0.00007286072,"about_ca_topic_score_gemma":0.00002990641,"teacher_disagreement_score":0.9321729,"about_ca_system_score_codex":0.0000123089385,"about_ca_system_score_gemma":0.000028047414,"threshold_uncertainty_score":0.22355662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023940373,0.0015894822,0.9609011,0.0023606336,0.00077330414,0.00049411104,0.00069350214,0.00016300363,0.009084486],"genre_scores_gemma":[0.8741148,0.000092116825,0.122650474,0.0001464457,0.00007609462,0.00004304829,0.0018185382,0.000042955206,0.0010155381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944084,0.0022547636,0.0007349888,0.0013395204,0.0008197226,0.00044259318],"domain_scores_gemma":[0.99278414,0.00030121097,0.00050181383,0.0047334977,0.0014837853,0.00019555731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005641239,0.0003841298,0.00046891635,0.00020382981,0.00021412282,0.0008798265,0.0047697313,0.00030218242,0.00004382586],"category_scores_gemma":[0.00028971166,0.0004029797,0.00011130379,0.0004925147,0.00015178055,0.0007003931,0.0026916487,0.0007461238,0.000012329526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095019925,0.0029785023,0.010396277,0.0015046396,0.00061932433,0.00019819435,0.046921488,0.028597169,0.004708877,0.31035978,0.014922258,0.57869846],"study_design_scores_gemma":[0.0012938626,5.750452e-7,0.005307838,0.0020514652,0.00003238138,0.000048703027,0.00012227798,0.9453915,0.0013476775,0.016806144,0.02668092,0.00091670005],"about_ca_topic_score_codex":0.0030064196,"about_ca_topic_score_gemma":0.004357507,"teacher_disagreement_score":0.9167943,"about_ca_system_score_codex":0.00023112627,"about_ca_system_score_gemma":0.0007829626,"threshold_uncertainty_score":0.9998422},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051642,0.000105409665,0.94443524,0.0005021867,0.0006464913,0.00013138926,0.00021954856,0.00011769102,0.002200017],"genre_scores_gemma":[0.9949242,0.0000057489474,0.0048443703,0.000028999391,0.00007724905,0.000005447305,0.00008360586,0.000006626061,0.000023767887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985982,0.000047228623,0.0004209957,0.00033373825,0.00031660727,0.0002831826],"domain_scores_gemma":[0.99813205,0.0001439139,0.00044320428,0.00094130065,0.00024078996,0.000098726734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721007,0.00014877749,0.00025050284,0.000047283247,0.0006445524,0.00029866138,0.0014128505,0.00003613676,0.0000058540036],"category_scores_gemma":[0.0001242239,0.00015101438,0.00013452428,0.00012202078,0.00009047197,0.00040867637,0.000121085526,0.00015041103,0.000017784054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027046575,0.000714974,0.004433198,0.00015081225,0.00027127258,0.00012518825,0.0008192226,0.040274434,0.0043703504,0.118610494,0.0070033832,0.8231996],"study_design_scores_gemma":[0.0016972848,0.00011353048,0.07619636,0.0002729244,0.000027999986,0.00010480947,0.00013450484,0.8882801,0.015006933,0.0030970783,0.0144326715,0.00063582964],"about_ca_topic_score_codex":0.000041627714,"about_ca_topic_score_gemma":0.0000040992413,"teacher_disagreement_score":0.9432822,"about_ca_system_score_codex":0.000043786527,"about_ca_system_score_gemma":0.00008273719,"threshold_uncertainty_score":0.6158188},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75414884,0.00019886691,0.24401784,0.00010604204,0.00010941035,0.00029099113,0.0000047584012,0.00006765288,0.0010556148],"genre_scores_gemma":[0.9839711,0.000015713806,0.014996236,0.00014883491,0.000061242165,0.000020276786,0.0000016829073,0.000009285107,0.00077559496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872947,0.00003230284,0.0002453069,0.00040854514,0.00020695764,0.00037740052],"domain_scores_gemma":[0.9994071,0.000023092103,0.000040911185,0.0003629448,0.000039970873,0.00012599037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020786328,0.00012409985,0.00022958175,0.000060770308,0.00008904613,0.00016060998,0.00039230756,0.00006577306,0.000020439724],"category_scores_gemma":[0.000013245604,0.0001254101,0.000018588411,0.00052563794,0.000017913824,0.0002585485,0.00009959122,0.00011403682,0.000021250033],"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.000028799563,0.0019371174,0.0037531785,0.00012255908,0.000051811592,0.00009002682,0.00077420525,0.94248515,0.002968361,0.00089167885,0.00036323763,0.046533868],"study_design_scores_gemma":[0.00031619653,0.00005197563,0.0016853894,0.00019933745,0.0000058311734,0.0000030127574,0.0000058904043,0.9970733,0.00026927714,0.000018912777,0.00020346281,0.00016739272],"about_ca_topic_score_codex":0.00019825554,"about_ca_topic_score_gemma":0.000013548644,"teacher_disagreement_score":0.22982231,"about_ca_system_score_codex":0.000065273976,"about_ca_system_score_gemma":0.00003463662,"threshold_uncertainty_score":0.5114075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011035017,0.00015241932,0.97990763,0.0004833049,0.0012963298,0.00024814968,0.0000044745884,0.00024613808,0.016558068],"genre_scores_gemma":[0.70898056,7.308741e-7,0.29011592,0.000042413416,0.00018579054,0.00005321704,5.1175977e-7,0.00000840903,0.00061246584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988846,0.000018186814,0.00024334234,0.00035529345,0.00016868082,0.0003298684],"domain_scores_gemma":[0.99817026,0.00023819068,0.00025094027,0.0011177536,0.00014267479,0.000080168764],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045318194,0.00012076944,0.00019893044,0.000026862792,0.0010044135,0.0023059843,0.0012755601,0.00007945782,0.0000014607817],"category_scores_gemma":[0.0007446448,0.00010522859,0.000051993695,0.00008364011,0.000029554558,0.00070470455,0.00022123667,0.000098991666,0.00001355148],"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.0000024033889,0.000022514436,0.0018836135,0.00014653783,0.000020693346,0.000014433034,0.000157353,0.0004717575,0.00053379626,0.9325247,0.0012368417,0.062985376],"study_design_scores_gemma":[0.00046671947,0.00006235004,0.0039101704,0.0010333499,0.0000072743414,0.00004235253,0.00010891222,0.93796015,0.00042228829,0.018036315,0.037470482,0.00047961978],"about_ca_topic_score_codex":0.00015759822,"about_ca_topic_score_gemma":0.000003950984,"teacher_disagreement_score":0.9374884,"about_ca_system_score_codex":0.000026797019,"about_ca_system_score_gemma":0.000042037245,"threshold_uncertainty_score":0.9987297},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085960975,0.000182241,0.9243412,0.0005431993,0.0074827326,0.0008135985,0.000096881886,0.00041266836,0.06526789],"genre_scores_gemma":[0.85730183,0.000025689274,0.024709437,0.00038055223,0.0007574587,0.0004106515,0.000044584067,0.0000498729,0.1163199],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802905,0.000024412879,0.00037673983,0.00065783417,0.00034794604,0.0005640112],"domain_scores_gemma":[0.9972077,0.00009441456,0.00030575236,0.0019121086,0.00030016937,0.00017983156],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042427614,0.00024122145,0.00036537246,0.000060111433,0.0009883966,0.0018608859,0.001929971,0.00013182286,0.000011513078],"category_scores_gemma":[0.00011765071,0.00019654287,0.00010875321,0.00013591412,0.000053601227,0.0007311973,0.0001987272,0.00013426936,0.0002818153],"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.000073803014,0.00041186874,0.00080402836,0.00024036365,0.00010021497,0.000051184714,0.00029417864,0.005118036,0.00071312644,0.28311324,0.60486096,0.104219],"study_design_scores_gemma":[0.0010063952,0.00022284315,0.00066123606,0.00022087591,0.000005378515,0.000022388167,0.0000570204,0.600942,0.00067627744,0.00020214659,0.39563876,0.00034466333],"about_ca_topic_score_codex":0.0009894045,"about_ca_topic_score_gemma":0.000013192775,"teacher_disagreement_score":0.89963174,"about_ca_system_score_codex":0.00007375863,"about_ca_system_score_gemma":0.0000849834,"threshold_uncertainty_score":0.99917525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015066598,0.00066788273,0.9806493,0.00089632627,0.0018325102,0.0005691872,0.000015691754,0.00024179873,0.00006073155],"genre_scores_gemma":[0.7503271,0.000008140781,0.24914716,0.00017535868,0.00027170754,0.000045712364,0.0000068257236,0.000015509055,0.0000024484743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513257,0.000070557515,0.0005074713,0.002126908,0.0012369066,0.00092558976],"domain_scores_gemma":[0.99567854,0.00014539632,0.0006160292,0.0029032268,0.00043052144,0.00022626261],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010197756,0.0005727304,0.0006429542,0.00035790872,0.00064595114,0.002983183,0.0069638924,0.00027969904,0.0000012393077],"category_scores_gemma":[0.00013966837,0.00043873425,0.00010644058,0.00087545766,0.0006203135,0.0010014267,0.0034059307,0.0010292988,0.000010285675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007002363,0.000096214964,0.0061063725,0.0001368528,0.000007916736,0.000093976356,0.0009874873,0.26163214,0.00006236152,0.00017725003,0.000008473258,0.7306839],"study_design_scores_gemma":[0.00040676442,0.00010705888,0.0077476124,0.0014434024,0.00000512017,0.000066335655,6.0411236e-7,0.97856617,0.0015261376,0.009317538,0.00017295779,0.0006403194],"about_ca_topic_score_codex":0.0002968568,"about_ca_topic_score_gemma":0.00040092142,"teacher_disagreement_score":0.73526055,"about_ca_system_score_codex":0.00027996133,"about_ca_system_score_gemma":0.0014445848,"threshold_uncertainty_score":0.99980646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844896,0.00014087587,0.8783923,0.0029511086,0.0005680123,0.0021438522,0.0001524535,0.00032271678,0.10687976],"genre_scores_gemma":[0.97518456,0.00006617353,0.019601105,0.00065584417,0.00009462179,0.0003448975,0.000055663902,0.000025979885,0.0039711324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962492,0.0004066049,0.0007436185,0.0011006834,0.0009648894,0.00053499785],"domain_scores_gemma":[0.9947542,0.00038678714,0.0009463061,0.003373172,0.00036749363,0.00017201866],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022123794,0.0005727458,0.0015106281,0.00007273147,0.0008115844,0.0012247771,0.0033684184,0.0002629288,0.00005613252],"category_scores_gemma":[0.00010769013,0.00028998568,0.0003480584,0.00010784715,0.00068118336,0.0002313376,0.0019042472,0.0008278173,0.00006914521],"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.010141931,0.0005243758,0.000011868246,0.00009748118,0.00026015146,0.00004627733,0.0006688199,0.009675349,0.000021774333,0.96378314,0.013667968,0.0011008731],"study_design_scores_gemma":[0.07874423,0.000029780265,0.000009691089,0.00043307658,0.00003281882,0.000010779298,0.000027181779,0.8883817,0.000081835664,0.030952016,0.0008524848,0.00044441444],"about_ca_topic_score_codex":0.0007935221,"about_ca_topic_score_gemma":0.0001711462,"teacher_disagreement_score":0.9667356,"about_ca_system_score_codex":0.000092307426,"about_ca_system_score_gemma":0.000579102,"threshold_uncertainty_score":0.99995524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059241145,0.00008392879,0.64979124,0.008768432,0.0010870337,0.00012783485,0.000012050025,0.00011655598,0.33408877],"genre_scores_gemma":[0.9880523,0.000003476737,0.0042790975,0.0010606422,0.00008517639,0.0000072085236,0.0000017977582,0.0000021172978,0.006508187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930775,0.000010361023,0.00012321759,0.00020912856,0.00018117567,0.0001683741],"domain_scores_gemma":[0.99857473,0.000007770293,0.00008515355,0.0011315069,0.000042499047,0.00015835192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636496,0.000067859655,0.00009383671,0.000013345174,0.00030633525,0.00057099655,0.0012971985,0.000026553334,0.00006260593],"category_scores_gemma":[0.000052648946,0.000053265467,0.000035508256,0.000027518305,0.000023780804,0.00044961728,0.00027892212,0.000040590236,0.00050402083],"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.0000018757833,0.000052004878,0.0042030015,0.0000142584595,0.00002672441,0.000029418148,0.00028407408,0.000020476824,0.00017591541,0.58831817,0.3646644,0.04220966],"study_design_scores_gemma":[0.0008769693,0.000077279285,0.048070155,0.00003127091,0.0000039601805,0.000012528702,0.000057050187,0.04776273,0.00087335135,0.004831066,0.8969737,0.00042992985],"about_ca_topic_score_codex":0.00010854991,"about_ca_topic_score_gemma":0.000020961357,"teacher_disagreement_score":0.9821282,"about_ca_system_score_codex":0.000009977272,"about_ca_system_score_gemma":0.00004484244,"threshold_uncertainty_score":0.6478336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9395644,0.00030088564,0.007743416,0.00025601624,0.00071199914,0.0012110032,0.00048732624,0.0014361298,0.048288804],"genre_scores_gemma":[0.991382,0.00007453891,0.0057585216,0.00042172385,0.00003584257,0.00021307143,0.00007762552,0.000040076993,0.0019966061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965262,0.00018451565,0.00068129733,0.0012950446,0.0006968048,0.0006161426],"domain_scores_gemma":[0.99635017,0.00007668268,0.00036000108,0.0025091867,0.0004039571,0.0003000261],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008966519,0.00034149154,0.00035798896,0.0001294901,0.0011754239,0.00010410107,0.0014310302,0.00020769937,0.000026144475],"category_scores_gemma":[0.00014518933,0.00035407717,0.0001484386,0.0010588616,0.00006218252,0.0021777665,0.00031744217,0.0004188032,0.0008979619],"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.000026329213,0.00030391797,0.00037852337,0.000059279042,0.000054392967,0.00005204414,0.00001393426,0.0005321992,0.031992096,0.7610358,0.00014645795,0.20540506],"study_design_scores_gemma":[0.0012642025,0.00014759894,0.008883658,0.0000773128,0.000019867455,0.00033352373,0.00002492529,0.012125002,0.052610256,0.025189003,0.89821774,0.001106933],"about_ca_topic_score_codex":0.00040422415,"about_ca_topic_score_gemma":0.00007085755,"teacher_disagreement_score":0.8980712,"about_ca_system_score_codex":0.0003574685,"about_ca_system_score_gemma":0.000045343135,"threshold_uncertainty_score":0.9998911},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26287216,0.0004371127,0.7218475,0.0033826358,0.007924198,0.00005941434,0.0000014916277,0.0000115385765,0.0034639616],"genre_scores_gemma":[0.99832714,0.000021182997,0.0007772946,0.00013177352,0.0007223703,1.6314294e-7,1.224513e-7,0.0000024993685,0.000017472183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00004277684,0.00029645473,0.00008116239,0.0003194307,0.00009415811],"domain_scores_gemma":[0.9983408,0.00035264308,0.0008589838,0.00017993418,0.00023960524,0.000028039522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018879,0.000058901707,0.00011996952,0.000037261245,0.00022327343,0.00038616682,0.0012627689,0.00002203248,9.851871e-7],"category_scores_gemma":[0.00010997048,0.000039004688,0.000059359954,0.000027982078,0.000041795047,0.00014864941,0.00020613268,0.00016489787,6.104847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003239617,0.000038382077,0.00658328,0.0000064061633,0.00016763876,0.00006989693,0.00096942706,0.008107618,0.0001472069,0.16497509,0.0020235304,0.81687915],"study_design_scores_gemma":[0.0013062368,0.0001617216,0.039304346,0.003071023,0.0000132276145,0.00064483186,0.00015128539,0.91188896,0.0003213852,0.013879005,0.029018577,0.00023938972],"about_ca_topic_score_codex":0.000009639689,"about_ca_topic_score_gemma":8.6450854e-7,"teacher_disagreement_score":0.90378135,"about_ca_system_score_codex":0.000017602135,"about_ca_system_score_gemma":0.000021983005,"threshold_uncertainty_score":0.37238157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059958976,0.00010311883,0.5437794,0.0028939385,0.0006848284,0.000066766705,0.0000032198416,0.00018189872,0.44629097],"genre_scores_gemma":[0.9879837,0.0000029998273,0.008397502,0.00015789164,0.00003289913,0.0000032343794,3.3159978e-7,0.0000016362361,0.0034198158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953175,0.0000078167395,0.00009014348,0.00015670946,0.00009631185,0.00011727624],"domain_scores_gemma":[0.9988476,0.000010197327,0.000066976696,0.0009827684,0.00004516433,0.00004729568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010126716,0.00004797394,0.00007511353,0.000010196223,0.00036474495,0.00054663105,0.0010661543,0.000021684958,0.000020103844],"category_scores_gemma":[0.00003590317,0.00003703369,0.000029453395,0.000020894464,0.000040659615,0.00048629064,0.0001629113,0.000030243385,0.00026119538],"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":[4.986278e-7,0.00001961097,0.0039499034,0.0000061494434,0.0000057087086,0.000021750075,0.000048262966,0.0000012027077,0.0001791519,0.92484885,0.012207654,0.058711264],"study_design_scores_gemma":[0.00082676054,0.00006122989,0.24046314,0.0000618835,0.0000041289154,0.00007128837,0.000055349596,0.03470757,0.0022406322,0.020577524,0.7003821,0.00054840936],"about_ca_topic_score_codex":0.00009556774,"about_ca_topic_score_gemma":0.000015034757,"teacher_disagreement_score":0.9819878,"about_ca_system_score_codex":0.0000049772225,"about_ca_system_score_gemma":0.00002255314,"threshold_uncertainty_score":0.52711755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07898038,0.0000079606325,0.91975,0.00024247778,0.00030566414,0.00013484305,0.000021433149,0.00004554984,0.00051169586],"genre_scores_gemma":[0.9603858,3.1611552e-7,0.039485093,0.0000337829,0.00003121533,0.000011188885,0.000009103059,0.000003810202,0.00003969506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991002,0.000022746619,0.00023764199,0.00023657468,0.00023006898,0.00017277607],"domain_scores_gemma":[0.9989388,0.000016014006,0.00019600563,0.0006790065,0.00010139166,0.00006879917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233953,0.000086126805,0.00012630742,0.000044231398,0.00025557503,0.00021425023,0.0006469515,0.000031890246,0.000028658465],"category_scores_gemma":[0.0000033439162,0.00007644821,0.00005397613,0.00006315279,0.00004183955,0.0003415056,0.000015679396,0.00003904086,0.000008463819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001483326,0.00047827396,0.016366722,0.00008546055,0.00004717441,0.000020699363,0.0017496845,0.053609673,0.008948108,0.020118019,0.00067795353,0.8978834],"study_design_scores_gemma":[0.00066186214,0.00010472214,0.045120995,0.000019262347,0.0000041110666,0.0000016791902,0.00019646306,0.94014305,0.013125655,0.000050485956,0.00045648398,0.0001152394],"about_ca_topic_score_codex":0.0006555864,"about_ca_topic_score_gemma":0.00013319675,"teacher_disagreement_score":0.89776814,"about_ca_system_score_codex":0.000019502928,"about_ca_system_score_gemma":0.00005195771,"threshold_uncertainty_score":0.31174678},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0201359,0.0031707003,0.96913403,0.0038809257,0.00079431094,0.00018828968,0.000013946784,0.000052044463,0.002629875],"genre_scores_gemma":[0.9953845,0.0003172406,0.0035385885,0.00045732703,0.000070009904,0.000030699666,0.0000060457396,0.0000035129817,0.00019207502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894553,0.00010020523,0.000212073,0.00035440468,0.00021564803,0.00017211276],"domain_scores_gemma":[0.9989001,0.0002498773,0.00029773914,0.00034795882,0.00011688128,0.00008743251],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003508824,0.000121642086,0.00013756045,0.00001726343,0.0014578113,0.0011045187,0.000513589,0.000045691093,0.0000034579034],"category_scores_gemma":[0.00024583982,0.00008882799,0.000022463188,0.00007624146,0.0002142791,0.0023595053,0.00028200334,0.00012828707,0.000010906968],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006641858,0.000036628775,0.00006651634,0.0000058531564,0.000006178409,0.0000079661295,0.007592412,0.000004226408,0.000087356,0.0066169733,0.002509504,0.98305976],"study_design_scores_gemma":[0.002093468,0.0003168814,0.0031995003,0.00011149697,0.000024897734,0.00045333864,0.008676841,0.5794738,0.00045803815,0.001976276,0.40258467,0.0006307636],"about_ca_topic_score_codex":0.000089591515,"about_ca_topic_score_gemma":0.000001468881,"teacher_disagreement_score":0.98242897,"about_ca_system_score_codex":0.000007999383,"about_ca_system_score_gemma":0.000033678185,"threshold_uncertainty_score":0.9999324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024783427,0.000030840092,0.6912841,0.0019825422,0.0005653877,0.000041889925,0.0000015975842,0.00011488118,0.30350038],"genre_scores_gemma":[0.98562366,0.0000018216067,0.006625899,0.00018055497,0.000054202646,0.0000032841501,3.746566e-7,0.000001658524,0.0075085186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954027,0.0000059509807,0.00007457052,0.0001540591,0.00010083722,0.0001243086],"domain_scores_gemma":[0.998854,0.00000607136,0.000051791092,0.0010093404,0.000030362848,0.000048436763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009720095,0.00004543139,0.00006434242,0.000008912364,0.00026035926,0.00051654933,0.0012514674,0.000021117015,0.000021521566],"category_scores_gemma":[0.000019239054,0.000035147095,0.000026837679,0.000020597787,0.000020189676,0.0004867615,0.00017532839,0.00003174126,0.00036377457],"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":[5.867457e-7,0.000022362696,0.0025541645,0.0000046560317,0.000006522617,0.000023996019,0.0000705886,0.000004414012,0.00024225113,0.8759928,0.03845483,0.08262286],"study_design_scores_gemma":[0.0004946494,0.000033887947,0.086757585,0.00002507188,0.0000015297246,0.000026084166,0.000012077818,0.0462059,0.0016801354,0.006829908,0.8576351,0.00029807916],"about_ca_topic_score_codex":0.00008821138,"about_ca_topic_score_gemma":0.000013740795,"teacher_disagreement_score":0.98314536,"about_ca_system_score_codex":0.000005519359,"about_ca_system_score_gemma":0.000013502777,"threshold_uncertainty_score":0.49810973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24467807,0.0005918057,0.656847,0.03753402,0.0035163735,0.0076933056,0.0007960179,0.00065125787,0.047692128],"genre_scores_gemma":[0.9834422,0.0000041086214,0.015488738,0.00012962907,0.00006320594,0.00021035486,0.00000457793,0.0000072212197,0.00064995233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988692,0.0000027278822,0.0002519469,0.0004162361,0.0002592013,0.00020070445],"domain_scores_gemma":[0.99800247,0.000025491587,0.00055560534,0.001094027,0.00027564765,0.000046762838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181615,0.00010504189,0.00015428792,0.000025888745,0.00046122295,0.00025295065,0.0018628689,0.000024390789,0.0000017959794],"category_scores_gemma":[0.00029503735,0.00007337558,0.00009099236,0.000080008715,0.000061344785,0.0005290757,0.00032579157,0.000049706654,0.0000039769748],"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.00011905559,0.0004735369,0.02515779,0.00091532496,0.00009456426,5.87232e-7,0.0005217963,0.000124895,0.15986037,0.6541004,0.10076403,0.057867657],"study_design_scores_gemma":[0.001622547,0.00013684676,0.011423581,0.00049502746,0.000029405315,0.000008906101,0.000070427166,0.053854417,0.76596445,0.0033082247,0.1627605,0.0003256461],"about_ca_topic_score_codex":0.00008411734,"about_ca_topic_score_gemma":0.0000028813247,"teacher_disagreement_score":0.73876417,"about_ca_system_score_codex":0.000039899707,"about_ca_system_score_gemma":0.00003668753,"threshold_uncertainty_score":0.35474008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028167374,0.00004716446,0.98815495,0.00017345803,0.0015111679,0.0055448464,0.000065999964,0.0013010198,0.0003846422],"genre_scores_gemma":[0.10011224,0.000004230708,0.8970812,0.00006942101,0.00014314707,0.0025704508,0.0000039681345,0.000013966548,0.0000013701607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99217945,0.0015518743,0.0016512319,0.002366311,0.0012119384,0.0010392066],"domain_scores_gemma":[0.99370015,0.0014228229,0.00097345206,0.0027927489,0.0007912607,0.00031954062],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.009663428,0.0005901433,0.0014061199,0.0004811847,0.00022347351,0.0007591104,0.00827292,0.0005072672,0.000009470324],"category_scores_gemma":[0.0013076273,0.00048233775,0.00026554515,0.0033687584,0.0010558406,0.0005718092,0.00776829,0.0008125947,0.00001228119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090543654,0.004081894,0.007998783,0.003866244,0.00019068149,0.0003223276,0.0034034795,0.05142085,0.009219136,0.055994794,0.0014483494,0.8619629],"study_design_scores_gemma":[0.00021770824,0.00016915415,0.009463785,0.0011539285,0.0000077983605,0.000022367001,0.0000039764286,0.9666253,0.009374866,0.011830205,0.00055044045,0.00058047025],"about_ca_topic_score_codex":0.000041515763,"about_ca_topic_score_gemma":0.0000017980478,"teacher_disagreement_score":0.91520447,"about_ca_system_score_codex":0.00036532764,"about_ca_system_score_gemma":0.0007715753,"threshold_uncertainty_score":0.99976283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011345412,0.0001610415,0.9904814,0.0008971845,0.0028152145,0.00027749233,0.000586703,0.00023899565,0.0034074332],"genre_scores_gemma":[0.9933432,0.000034987053,0.004463505,0.000064683816,0.00011943703,0.000094982744,0.000021968306,0.000012761537,0.0018444876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848974,0.00006487535,0.0002932953,0.00049458834,0.00035418762,0.00030334268],"domain_scores_gemma":[0.9941479,0.00007443516,0.00018343874,0.0053713005,0.000073533396,0.00014939772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034400498,0.00018011744,0.0002295065,0.00008164046,0.0010273645,0.0009159747,0.0030497336,0.00006728541,0.00001710329],"category_scores_gemma":[0.000058707286,0.00015964718,0.00009152583,0.000108092994,0.000062263716,0.0011771882,0.00004545047,0.00018743597,0.00051200524],"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.00014766573,0.0023737405,0.0012409749,0.0011764874,0.00091993756,0.000967527,0.001696343,0.0103409905,0.010644764,0.34876516,0.06897842,0.552748],"study_design_scores_gemma":[0.0028140636,0.00028906585,0.0028763313,0.0011936749,0.000058608977,0.0003626321,0.00030914307,0.1048558,0.005530099,0.0005801246,0.8795756,0.0015548627],"about_ca_topic_score_codex":0.00076923723,"about_ca_topic_score_gemma":0.00005450941,"teacher_disagreement_score":0.99220866,"about_ca_system_score_codex":0.000038888087,"about_ca_system_score_gemma":0.00004956889,"threshold_uncertainty_score":0.8832765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007400062,0.00010312893,0.96651155,0.0003614354,0.00091655325,0.0006768043,0.00004114637,0.00023109865,0.023758233],"genre_scores_gemma":[0.9665045,0.00002070233,0.008701161,0.00009113315,0.0002046447,0.0000014114498,0.000026555905,0.000019462412,0.024430392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752396,0.000089026136,0.00025335955,0.00154671,0.0001671182,0.00041982564],"domain_scores_gemma":[0.9959224,0.00005274954,0.00039806144,0.0030195022,0.00022430136,0.0003829855],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002907604,0.00036123683,0.00045334874,0.0001846944,0.0005755539,0.001267627,0.0032755565,0.0002848307,0.000013600723],"category_scores_gemma":[0.00013597556,0.00040327554,0.00022041125,0.00043865395,0.00006716862,0.00062150235,0.002446249,0.00047892585,0.00022179984],"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.00003229422,0.0002094885,0.00069744943,0.00021763613,0.00009163939,0.00017885743,0.0004567325,0.67344046,0.00001990826,0.30593133,0.016206473,0.0025177216],"study_design_scores_gemma":[0.0004899286,0.000040136747,0.00059075287,0.0005322076,0.00004304332,0.0000067309775,0.000029080387,0.8947843,0.000008978623,0.011786865,0.09092003,0.0007679973],"about_ca_topic_score_codex":0.0005648223,"about_ca_topic_score_gemma":0.00003941506,"teacher_disagreement_score":0.9591045,"about_ca_system_score_codex":0.00026031744,"about_ca_system_score_gemma":0.00055028836,"threshold_uncertainty_score":0.9998419},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004070784,0.000029679106,0.6319426,0.0019702578,0.00070035475,0.000038194048,0.000001630143,0.000106565414,0.36113995],"genre_scores_gemma":[0.98808885,0.0000010448632,0.0042074323,0.00012782906,0.00003657724,0.0000025891848,2.0524216e-7,0.000001109622,0.007534361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964976,0.0000040393898,0.000054027158,0.000117041855,0.00007589294,0.00009924887],"domain_scores_gemma":[0.9990504,0.0000037152904,0.000039484952,0.0008432576,0.00002324463,0.00003989237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064623506,0.000033782366,0.000048145128,0.00000707564,0.00023403647,0.00042983989,0.0010460748,0.000015040059,0.000013065667],"category_scores_gemma":[0.000014623564,0.000026111758,0.00001775819,0.000015432799,0.000014735612,0.000363689,0.00012795576,0.00002291577,0.00018474829],"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":[3.9054865e-7,0.000013460688,0.0029870572,0.0000030788485,0.0000044611274,0.000022774544,0.000053550335,0.0000034343204,0.00027483449,0.88642615,0.025990417,0.08422039],"study_design_scores_gemma":[0.00048264957,0.000031062584,0.103565745,0.000020622701,0.000001319371,0.00003178188,0.000010686712,0.038678885,0.0027803164,0.006198327,0.8479023,0.00029628654],"about_ca_topic_score_codex":0.00025130928,"about_ca_topic_score_gemma":0.000038372425,"teacher_disagreement_score":0.9840181,"about_ca_system_score_codex":0.0000057972597,"about_ca_system_score_gemma":0.000015798192,"threshold_uncertainty_score":0.4144956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44208878,0.0035453048,0.5017806,0.0069916393,0.0025305892,0.003998839,0.0012314278,0.00088629674,0.036946505],"genre_scores_gemma":[0.9992793,0.000041020143,0.000099644625,0.0000062619015,0.000032841177,0.00006812131,0.000019605062,0.0000044563594,0.00044874277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981352,0.00019205987,0.00023042684,0.00025810566,0.0007936897,0.0003905222],"domain_scores_gemma":[0.99908566,0.00024013304,0.000027780088,0.00032698154,0.00023454083,0.00008489386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013972784,0.00006275757,0.0001425505,0.0003222338,0.00006945804,0.000046272482,0.0005769687,0.000032325886,0.000044144857],"category_scores_gemma":[0.000082235376,0.00005951703,0.000050138366,0.0016948921,0.00007517046,0.00023457073,0.000075990116,0.00025476632,0.00019790874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084131854,0.0009212007,0.019621493,0.0018567643,0.0000632278,0.0010510427,0.005659363,0.007216909,0.006391109,0.11394455,0.091593415,0.7515968],"study_design_scores_gemma":[0.0052570174,0.00072923873,0.3584725,0.0019354281,0.0000032437545,0.000076588316,0.00209108,0.48775685,0.018784318,0.012637368,0.11133175,0.0009246217],"about_ca_topic_score_codex":0.000113775925,"about_ca_topic_score_gemma":0.000027488453,"teacher_disagreement_score":0.75067216,"about_ca_system_score_codex":0.000057695648,"about_ca_system_score_gemma":0.00018487587,"threshold_uncertainty_score":0.25437823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35621506,0.0017299033,0.6391692,0.00038295335,0.00038219002,0.00009216888,0.0000036532242,0.00003727416,0.0019875474],"genre_scores_gemma":[0.9934565,0.0003698076,0.006016431,0.00006677115,0.000025104262,0.000011308392,0.0000025967076,0.0000029116002,0.000048585876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991268,0.00005153305,0.00023056926,0.00028132004,0.00018016009,0.00012961241],"domain_scores_gemma":[0.99910164,0.0001357723,0.0003905715,0.00018429043,0.000139315,0.000048407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022586063,0.000102378566,0.00014354945,0.000021605607,0.0007013955,0.00025923926,0.00025973452,0.000037995804,0.0000036332863],"category_scores_gemma":[0.00015645586,0.000096511896,0.000020143012,0.000058803358,0.00016022172,0.0035869027,0.00008126891,0.0001485858,0.0000017711263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056885416,0.00008798417,0.0035380092,0.00018764829,0.000022490422,0.000010056098,0.023087367,0.00066490157,0.0015375204,0.014585323,0.000020894871,0.9562009],"study_design_scores_gemma":[0.0009806551,0.0003171789,0.0076878937,0.00012689033,0.00001668907,0.00018469988,0.0022961956,0.979193,0.0019084557,0.0002646295,0.0066948924,0.0003288243],"about_ca_topic_score_codex":0.00019224553,"about_ca_topic_score_gemma":0.0000015268015,"teacher_disagreement_score":0.9785281,"about_ca_system_score_codex":0.0000060491934,"about_ca_system_score_gemma":0.000039765055,"threshold_uncertainty_score":0.5394638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15845124,0.000035665398,0.8353823,0.00020843232,0.0001400733,0.00021219191,0.000024167839,0.00007089219,0.0054750303],"genre_scores_gemma":[0.9976995,0.000024374838,0.0017595554,0.000009753414,0.000018974655,0.00001312907,0.0000046882888,0.0000032163673,0.00046678042],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99916065,0.000041111933,0.00016087525,0.00030699524,0.00013802917,0.00019233786],"domain_scores_gemma":[0.9992855,0.00001659476,0.0001121276,0.00051207014,0.00001119495,0.00006249321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019497695,0.000092805414,0.000121577315,0.000032452303,0.00025097892,0.00018653611,0.00035010275,0.00006545388,0.000003558028],"category_scores_gemma":[0.00002518145,0.0000859199,0.000019117546,0.000055395813,0.000049365066,0.0006091367,0.00018145221,0.00006713827,0.00004284416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037574169,0.000904907,0.047529157,0.000070703514,0.00014959007,0.0003103937,0.0015783308,0.0025481812,0.16758406,0.08443967,0.0038375051,0.69067174],"study_design_scores_gemma":[0.0007337326,0.00009164137,0.5434115,0.00003598793,0.0000027604137,0.000014166764,0.00003268021,0.45027936,0.0018072526,0.0008736538,0.0025089113,0.00020833731],"about_ca_topic_score_codex":0.00075765303,"about_ca_topic_score_gemma":0.00016096572,"teacher_disagreement_score":0.8392483,"about_ca_system_score_codex":0.00007768659,"about_ca_system_score_gemma":0.000009146762,"threshold_uncertainty_score":0.35037118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15014303,0.0014442499,0.8459554,0.0008056207,0.0009253421,0.00013981713,0.000009981447,0.000091638554,0.00048493984],"genre_scores_gemma":[0.99182886,0.00019183656,0.0071981023,0.000525147,0.00011778891,0.000023836965,0.000016333002,0.000004380366,0.000093698094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870324,0.00010121062,0.00028102216,0.00046988303,0.00024102633,0.00020363776],"domain_scores_gemma":[0.9990924,0.00014635842,0.00019610973,0.00016292476,0.00027963752,0.0001225688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025680722,0.00014314159,0.00014912097,0.000039674786,0.0004144218,0.0003357235,0.0002022535,0.0000634245,0.000009265088],"category_scores_gemma":[0.00013123802,0.00013340214,0.00001889056,0.00025046457,0.00017560186,0.002205939,0.00014171703,0.00010187564,0.000027297012],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000442013,0.00016668154,0.00024643328,0.000030844007,0.000021327913,0.000014732861,0.014643589,0.000004785849,0.0037467277,0.053497642,0.007132148,0.92045087],"study_design_scores_gemma":[0.0038933589,0.0019138737,0.0037983942,0.00028571664,0.000049063146,0.0005760054,0.009797693,0.54886156,0.00613768,0.0052800616,0.41786802,0.0015385675],"about_ca_topic_score_codex":0.00007630607,"about_ca_topic_score_gemma":0.0000013609742,"teacher_disagreement_score":0.9189123,"about_ca_system_score_codex":0.0000138482455,"about_ca_system_score_gemma":0.000031978132,"threshold_uncertainty_score":0.5439981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124526545,0.00032417057,0.85227096,0.0007926432,0.0026216088,0.00081654656,0.017258823,0.00037247673,0.0010162118],"genre_scores_gemma":[0.9879359,0.000020032538,0.008479698,0.0008682191,0.0007962204,0.00007301836,0.0011674601,0.000022428496,0.0006370048],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979687,0.000037294383,0.0003432321,0.0007421113,0.00034854806,0.00056014274],"domain_scores_gemma":[0.99586236,0.000139189,0.00014478806,0.0035615044,0.00017052585,0.000121650024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993028,0.00022845512,0.0003046284,0.00008971951,0.0003263243,0.00022340087,0.003571236,0.00009652421,0.000078312],"category_scores_gemma":[0.00013534001,0.00020381068,0.000049388404,0.00044256385,0.00007553284,0.0022110443,0.0013712551,0.00011259369,0.00021832745],"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.00009532101,0.00024390117,0.004907455,0.00018061041,0.0000575126,0.000020218293,0.00015716293,0.000015808706,0.00020700574,0.0020835819,0.97506046,0.016970964],"study_design_scores_gemma":[0.002511477,0.0002331773,0.01231917,0.00016522262,0.00001825344,0.000013773644,0.000024274434,0.45546916,0.001265264,0.00020729404,0.5273058,0.00046713435],"about_ca_topic_score_codex":0.00017711424,"about_ca_topic_score_gemma":0.00022524425,"teacher_disagreement_score":0.86340934,"about_ca_system_score_codex":0.00002979019,"about_ca_system_score_gemma":0.00013458892,"threshold_uncertainty_score":0.83111584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11670006,0.000019892195,0.8748833,0.00018163715,0.0016377299,0.00009557087,0.0000029761636,0.00023569021,0.0062431297],"genre_scores_gemma":[0.992789,0.0000041250373,0.0041635884,0.00033522263,0.00035174674,0.000016596612,0.0000020472874,0.000006209518,0.0023315016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989375,0.000027625732,0.0002224725,0.00031383242,0.00026326842,0.000235328],"domain_scores_gemma":[0.99934,0.00002120193,0.000059115377,0.00035745418,0.00014523517,0.00007702178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020081783,0.00012003866,0.00012949553,0.000055324163,0.00020996187,0.00009493934,0.0003781607,0.00007151165,0.00018388571],"category_scores_gemma":[0.0000033874571,0.00010234651,0.000043624084,0.00029080402,0.00006601058,0.00066041225,0.000023557397,0.00009989935,0.0006323158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000745338,0.00020437104,0.00026628005,0.00006447563,0.00009572172,0.000013875446,0.00094711623,0.00080508506,0.07602193,0.01221917,0.0057591954,0.9035282],"study_design_scores_gemma":[0.0011995176,0.00047487966,0.02484337,0.000038618986,0.000009367842,0.00015397441,0.000025793957,0.4604886,0.41924354,0.00024652702,0.09267539,0.0006004215],"about_ca_topic_score_codex":0.00013102789,"about_ca_topic_score_gemma":0.0000335905,"teacher_disagreement_score":0.9029278,"about_ca_system_score_codex":0.000035754438,"about_ca_system_score_gemma":0.00002670932,"threshold_uncertainty_score":0.8127351},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009982435,0.000027378022,0.9069628,0.00012025408,0.00020062995,0.00019455758,0.0000074846193,0.000253353,0.08225112],"genre_scores_gemma":[0.6616728,0.0000021126584,0.33766824,0.00013774128,0.00019985376,0.000034866178,0.0000049413375,0.00001581384,0.00026367366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986697,0.000007499423,0.0003343759,0.00033179412,0.00029873656,0.0003579289],"domain_scores_gemma":[0.99885696,0.0000430138,0.00014544849,0.00078029884,0.00006931714,0.00010496828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474968,0.00017710004,0.00024163506,0.000043363212,0.00018732165,0.00025382158,0.0008746537,0.00007003667,0.000027233089],"category_scores_gemma":[0.000016644603,0.00014930236,0.00006119508,0.00031227854,0.00009865155,0.00019176053,0.00024136066,0.00009804553,0.0006119172],"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.0000026205869,0.000052544245,0.0000054055754,0.0000725129,0.000023188399,0.0000049269615,0.0024885647,0.000044629076,0.0034246622,0.98598254,0.002817555,0.005080836],"study_design_scores_gemma":[0.0020447462,0.0002827395,0.00038600113,0.00044518,0.000055736713,0.00012289501,0.0020278017,0.7757985,0.035544906,0.078302726,0.102823466,0.00216532],"about_ca_topic_score_codex":0.0000025728768,"about_ca_topic_score_gemma":0.0000012515313,"teacher_disagreement_score":0.90767986,"about_ca_system_score_codex":0.000024907695,"about_ca_system_score_gemma":0.000031600903,"threshold_uncertainty_score":0.78651613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030407493,0.000015982927,0.8407084,0.0003285779,0.00035638694,0.000024788831,6.2084e-7,0.00016916884,0.15535532],"genre_scores_gemma":[0.9833912,4.3532975e-7,0.012098999,0.00044103363,0.00012483224,0.0000020581374,2.5041302e-7,0.0000014974358,0.003939649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996171,0.0000074657128,0.00006384274,0.00012584879,0.00007741967,0.000108330925],"domain_scores_gemma":[0.9996038,0.000005575115,0.000012996266,0.00028851337,0.00005286019,0.000036251142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000062754574,0.000034719913,0.00004293916,0.000012557871,0.000048290072,0.000067050656,0.00036435208,0.000015960113,0.000025493979],"category_scores_gemma":[0.0000042563315,0.000026656107,0.0000152381,0.00014310019,0.000019977902,0.00016112202,0.00005601407,0.000018139108,0.00078313815],"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":[7.8586373e-7,0.0000252327,0.00063671503,0.0000028961695,0.000006277497,0.00000619537,0.0003618208,0.0000013737314,0.0007895859,0.81051046,0.14249438,0.04516428],"study_design_scores_gemma":[0.00022453068,0.000091929454,0.0044014184,0.000008598598,8.22845e-7,0.00002605273,0.00002028636,0.040597193,0.0046987147,0.0031309263,0.9466144,0.00018516237],"about_ca_topic_score_codex":0.000036500896,"about_ca_topic_score_gemma":0.000007939359,"teacher_disagreement_score":0.9803505,"about_ca_system_score_codex":0.000005809885,"about_ca_system_score_gemma":0.000016641992,"threshold_uncertainty_score":0.9999949},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7524685,0.0018722817,0.022514325,0.16567615,0.018506132,0.0007421762,0.00015287612,0.000052190713,0.03801535],"genre_scores_gemma":[0.99657255,0.000013140097,0.000106629406,0.0017071078,0.0012239564,0.0000026133407,4.3795822e-7,0.000008873886,0.000364672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987197,0.00010739876,0.00030219223,0.00013540967,0.00034985648,0.0003854469],"domain_scores_gemma":[0.99853736,0.00008520274,0.0002510784,0.00038730082,0.00033544435,0.00040359946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074058265,0.00013912831,0.00014367829,0.00007247913,0.000586575,0.00039334985,0.0020892476,0.000021713548,0.000115720824],"category_scores_gemma":[0.000082013255,0.00007353648,0.00011800789,0.00032377522,0.00020288877,0.00035677088,0.000038534577,0.0003627738,0.00020827248],"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.00004129807,0.00010708529,0.0014090844,0.000008956397,0.00023548814,0.00047204117,0.005515679,0.000058094145,0.00040022674,0.119718306,0.7731287,0.09890503],"study_design_scores_gemma":[0.0013293865,0.0013273646,0.00309029,0.00012955099,0.000031751588,0.0002688798,0.00019778007,0.0027943312,0.0063625504,0.0039992593,0.9800965,0.00037231424],"about_ca_topic_score_codex":0.002731357,"about_ca_topic_score_gemma":0.0021545955,"teacher_disagreement_score":0.24410406,"about_ca_system_score_codex":0.00013075625,"about_ca_system_score_gemma":0.0007551055,"threshold_uncertainty_score":0.451152},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03228239,0.0010721239,0.9639654,0.001004413,0.00070390495,0.00008043635,0.0000043521713,0.00003355219,0.0008534181],"genre_scores_gemma":[0.94286233,0.00013446857,0.056344707,0.00007228277,0.00055392017,4.1786345e-7,9.895355e-7,0.0000054158013,0.000025446325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985384,0.00004834043,0.0007756935,0.00009451003,0.00033502007,0.00020806615],"domain_scores_gemma":[0.99883777,0.00006730083,0.00049855694,0.00021497515,0.00027715275,0.00010422211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053225685,0.000102639,0.00030241173,0.0000993895,0.00006579497,0.00006752588,0.00058288604,0.0000723685,0.000012585311],"category_scores_gemma":[0.000008177375,0.00008291926,0.00015150158,0.00038565515,0.000020427795,0.0008632992,0.00002738005,0.00024323887,0.000004139359],"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.00003994217,0.0006441655,0.0005330987,0.000068518464,0.00027879333,0.00006373571,0.0029646752,0.7142466,0.00058419566,0.031592518,0.01641846,0.23256533],"study_design_scores_gemma":[0.0012358492,0.00021496727,0.0028677143,0.0001721629,0.000032848973,0.00032732153,0.00007654799,0.9604035,0.00073271664,0.00040784734,0.033324912,0.00020359457],"about_ca_topic_score_codex":0.0000066620255,"about_ca_topic_score_gemma":0.0000034331806,"teacher_disagreement_score":0.91058,"about_ca_system_score_codex":0.00005329272,"about_ca_system_score_gemma":0.000060382292,"threshold_uncertainty_score":0.3381349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07600279,0.0003616108,0.8839514,0.0005781122,0.008427931,0.005818084,0.019449525,0.0007453536,0.004665184],"genre_scores_gemma":[0.85066235,0.00018932743,0.12854873,0.003064475,0.0023574987,0.0024471015,0.0099645825,0.0002842454,0.0024816976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948712,0.000046791254,0.0019767112,0.0009893919,0.0007317061,0.0013841715],"domain_scores_gemma":[0.99424773,0.00026699493,0.0011938231,0.0026530754,0.0010910545,0.0005473053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012447111,0.0009675015,0.00118314,0.0002862541,0.0007286788,0.0028643608,0.0031913645,0.0008616342,0.000029190427],"category_scores_gemma":[0.00017343783,0.00088199927,0.0004387415,0.00031137277,0.00026505112,0.0024016572,0.0014105488,0.000761313,0.00012325161],"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.0010485429,0.0059444574,0.028233387,0.026253896,0.0029648938,0.000083941704,0.056825668,0.0017648744,0.0004232559,0.089396544,0.7295418,0.05751875],"study_design_scores_gemma":[0.003178247,0.0009923875,0.0009051847,0.00088127627,0.00010144135,0.00008774491,0.0003293293,0.3367929,0.00038441044,0.004257454,0.65035796,0.0017316823],"about_ca_topic_score_codex":0.00006693677,"about_ca_topic_score_gemma":0.00005038997,"teacher_disagreement_score":0.7746596,"about_ca_system_score_codex":0.00019661336,"about_ca_system_score_gemma":0.00037867212,"threshold_uncertainty_score":0.99936306},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009860386,0.0018775539,0.11495158,0.003496658,0.0032454953,0.0027853742,0.002584418,0.0047652433,0.8564333],"genre_scores_gemma":[0.94592595,0.001038788,0.0034414881,0.00023607089,0.0035148438,8.860187e-7,0.007256302,0.005447954,0.033137724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944099,0.00046581458,0.0008296282,0.0012569609,0.0020149413,0.0010227562],"domain_scores_gemma":[0.99385446,0.00004402723,0.0005122243,0.0022298824,0.002994053,0.00036537263],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0032702484,0.00044494504,0.0005768819,0.00050569454,0.003390859,0.002939578,0.005817186,0.00028746386,0.002730215],"category_scores_gemma":[0.0011747766,0.00045177867,0.00031589819,0.0010840553,0.0003229176,0.0006570558,0.0065032113,0.00075877574,0.003580681],"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.00003573242,0.00017810945,0.000019947476,0.0006253132,0.00021723034,0.00023046286,0.0037328086,0.00010054043,0.00053058146,0.00088197074,0.9120471,0.081400186],"study_design_scores_gemma":[0.00047708483,0.00044540118,0.0004944324,0.00042374467,0.000029777206,0.0005481063,0.000525996,0.005421241,0.00007499007,0.000037856582,0.99100083,0.0005205281],"about_ca_topic_score_codex":0.00018826131,"about_ca_topic_score_gemma":0.0000028480488,"teacher_disagreement_score":0.93606555,"about_ca_system_score_codex":0.0006541872,"about_ca_system_score_gemma":0.00009489639,"threshold_uncertainty_score":0.9997934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015396516,0.0010871674,0.87608874,0.00055056345,0.004132759,0.004997991,0.0008553994,0.0010117945,0.09587907],"genre_scores_gemma":[0.5142722,0.0033286999,0.07529745,0.0005263115,0.0015465962,0.0003655946,0.013545605,0.0003495365,0.390768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971865,0.00036257203,0.0005646639,0.0008939625,0.0004522934,0.0005400492],"domain_scores_gemma":[0.99609596,0.00054089096,0.00078929984,0.0016130152,0.00077556306,0.0001852614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068379595,0.00052789296,0.0011126142,0.0005418551,0.0005849717,0.0003514246,0.0029706126,0.0005069151,0.00006610775],"category_scores_gemma":[0.00016185525,0.0005427228,0.00065190333,0.0006761306,0.00013645686,0.0007785088,0.00022621454,0.00033202197,0.00008706082],"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.03640586,0.0018272736,0.00023800852,0.003254418,0.0034990322,0.00033742588,0.02479433,0.00011623254,0.00041385365,0.7354474,0.04926058,0.14440559],"study_design_scores_gemma":[0.0867338,0.0002962979,0.00046164915,0.0019338971,0.00053090707,0.000027202599,0.0041167303,0.030585928,0.0014250149,0.003930528,0.86744285,0.0025152187],"about_ca_topic_score_codex":0.00037265947,"about_ca_topic_score_gemma":0.00043884543,"teacher_disagreement_score":0.81818223,"about_ca_system_score_codex":0.00020946335,"about_ca_system_score_gemma":0.00024721268,"threshold_uncertainty_score":0.99970245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014019261,0.000106747764,0.97057825,0.00022774878,0.010505375,0.0007945497,0.0008957583,0.0007137892,0.0021585238],"genre_scores_gemma":[0.99190074,0.000014025925,0.004428941,0.00012675664,0.0006982944,0.0001393217,0.00007763652,0.00003915367,0.0025751048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573666,0.0003744675,0.0010318574,0.0012684034,0.0008696721,0.0007189166],"domain_scores_gemma":[0.99623644,0.00014930924,0.0003477266,0.0022299297,0.0007456804,0.00029090905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091237575,0.0004779918,0.000568248,0.00032935786,0.0009447936,0.0009168149,0.0015269466,0.00035032598,0.000057236604],"category_scores_gemma":[0.00003278331,0.0004391493,0.00020626787,0.0012024436,0.00016822803,0.002548551,0.000018655406,0.00053549255,0.0007224141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015735386,0.015639694,0.002859657,0.0016718274,0.0019352809,0.00020974173,0.021438306,0.044887774,0.08141788,0.039149202,0.11078619,0.6784309],"study_design_scores_gemma":[0.002023114,0.0004788289,0.0001901415,0.000597446,0.000045685065,0.00022926608,0.0011278631,0.9124147,0.02397262,0.00009285887,0.058001306,0.0008261723],"about_ca_topic_score_codex":0.0007641384,"about_ca_topic_score_gemma":0.0023837762,"teacher_disagreement_score":0.9778815,"about_ca_system_score_codex":0.0003694119,"about_ca_system_score_gemma":0.00019601182,"threshold_uncertainty_score":0.99980605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028274363,0.000044161636,0.9601379,0.00008617328,0.00040557847,0.000053299966,6.582759e-7,0.00017500605,0.010822838],"genre_scores_gemma":[0.97307485,4.0295498e-7,0.025950117,0.000113671915,0.00013014433,0.0000017551794,4.339018e-7,0.0000040246587,0.0007246266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993026,0.000014561458,0.00013102955,0.00021648829,0.00014921774,0.00018609528],"domain_scores_gemma":[0.9995992,0.000004813744,0.000039536288,0.00019616037,0.000108121414,0.000052152278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013040616,0.0000705724,0.000080730126,0.00003457375,0.00018146368,0.00019301947,0.00023760177,0.000036971836,0.00004343957],"category_scores_gemma":[0.0000030381261,0.000057661742,0.000025552048,0.00036995046,0.000031926134,0.00072320626,0.000016590053,0.00003988035,0.00006926694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025711784,0.00024509427,0.0024909482,0.00015713384,0.00003782574,0.000015619422,0.0026403673,0.0007956648,0.061729684,0.029282032,0.006299743,0.89628017],"study_design_scores_gemma":[0.00021055136,0.00005231664,0.000697328,0.000051711915,0.000003521799,0.000026020749,0.00004920381,0.9599764,0.011173179,0.00030428736,0.027271183,0.00018434774],"about_ca_topic_score_codex":0.000080864855,"about_ca_topic_score_gemma":0.000012115828,"teacher_disagreement_score":0.9591807,"about_ca_system_score_codex":0.00002905891,"about_ca_system_score_gemma":0.00004732085,"threshold_uncertainty_score":0.23513776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0766145,0.000008933226,0.8409768,0.00093242264,0.0005187746,0.00021570982,0.000007683067,0.000047318557,0.08067789],"genre_scores_gemma":[0.99861825,3.2583299e-7,0.00052598584,0.00035216723,0.000025350586,0.000009405614,0.0000012288115,0.0000020295674,0.00046527505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992847,0.000041246094,0.00017332003,0.00017358872,0.00021049951,0.00011663626],"domain_scores_gemma":[0.9991278,0.000077998106,0.00009203565,0.000570894,0.00010228927,0.000028962306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022021141,0.000064802996,0.00007640995,0.00002156928,0.00007188502,0.00004379478,0.0004838897,0.00002505749,0.000093874594],"category_scores_gemma":[0.000028183236,0.000037979677,0.000028778984,0.0001656288,0.000057331366,0.00006794652,0.000052086125,0.000034739776,0.00028393275],"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.000013541178,0.00015102816,0.00016986414,0.000016119553,0.000025928995,0.000003777177,0.001893693,0.000007967526,0.014919728,0.9386979,0.029957633,0.014142837],"study_design_scores_gemma":[0.0013899298,0.0032988135,0.14851701,0.00031619795,0.000022427077,0.000043920925,0.0008632131,0.7023834,0.05421434,0.031221166,0.056735467,0.0009941251],"about_ca_topic_score_codex":0.000013928931,"about_ca_topic_score_gemma":0.000014430446,"teacher_disagreement_score":0.92200375,"about_ca_system_score_codex":0.000015674374,"about_ca_system_score_gemma":0.000022436361,"threshold_uncertainty_score":0.36494756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062665357,0.00006504845,0.8769327,0.00092296285,0.00096158695,0.00012871767,0.0000032218081,0.00041248364,0.11430676],"genre_scores_gemma":[0.98297465,0.0000019392799,0.0077864463,0.0005792033,0.00024100319,0.000009061723,0.000002972389,0.000007314268,0.008397389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870986,0.000058267757,0.00024933464,0.00038618597,0.00028721773,0.00030910925],"domain_scores_gemma":[0.99900097,0.000060509596,0.00007245107,0.000615285,0.00014869179,0.00010210621],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029203627,0.00012975681,0.00016827259,0.00005235871,0.0002543881,0.00026108898,0.0006905398,0.00007601914,0.00008421381],"category_scores_gemma":[0.00002031216,0.00010114638,0.00005504178,0.00031363074,0.000042318756,0.0005307497,0.00023952383,0.000070603994,0.0012537518],"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.000012353465,0.0000607591,0.0004350155,0.000056651308,0.000028103404,0.000021736802,0.00037892506,0.00012428814,0.0011531443,0.76148236,0.22807136,0.008175317],"study_design_scores_gemma":[0.0010146601,0.0003441714,0.0025928945,0.0002742801,0.000008009536,0.00011810891,0.0005984297,0.18530947,0.005999313,0.0032367988,0.79979074,0.0007131162],"about_ca_topic_score_codex":0.00033226277,"about_ca_topic_score_gemma":0.000108229426,"teacher_disagreement_score":0.9767081,"about_ca_system_score_codex":0.00007948061,"about_ca_system_score_gemma":0.000054655757,"threshold_uncertainty_score":0.9995239},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09901052,0.000014289349,0.86455846,0.00008435658,0.00080273446,0.029442528,0.005031343,0.0004465568,0.0006091838],"genre_scores_gemma":[0.7885363,0.0000034676602,0.15690601,0.00020560595,0.00038017676,0.033478573,0.019856302,0.000099260644,0.00053428736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953669,0.00007600259,0.0026123347,0.00055480027,0.0007760862,0.00061389635],"domain_scores_gemma":[0.9939209,0.00017330442,0.002730403,0.0017590373,0.001264357,0.00015194826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010428159,0.0005780295,0.0014376591,0.0010011131,0.00023849968,0.0006497825,0.0019503315,0.00059525657,0.000035690427],"category_scores_gemma":[0.00020027366,0.00054164283,0.00087594346,0.0010064961,0.00008133345,0.0011825631,0.0007381495,0.00029769808,0.00003113983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014165904,0.009398299,0.07123213,0.09757529,0.03796397,0.000019168021,0.112806335,0.0361665,0.0010729063,0.054858066,0.09887523,0.4786155],"study_design_scores_gemma":[0.0014003033,0.00023177182,0.008527592,0.0008373899,0.00040688025,0.000004053128,0.00006571079,0.98211193,0.00025698688,0.0009007123,0.0046624867,0.0005941791],"about_ca_topic_score_codex":0.000037035312,"about_ca_topic_score_gemma":0.000014702059,"teacher_disagreement_score":0.94594544,"about_ca_system_score_codex":0.00024059594,"about_ca_system_score_gemma":0.00015232564,"threshold_uncertainty_score":0.9997035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1953654,0.00096246833,0.80245584,0.0006844204,0.0002859677,0.00010140645,0.00005026073,0.000023905424,0.000070334645],"genre_scores_gemma":[0.974778,0.000053776876,0.024596548,0.00007887272,0.0004646775,5.457494e-7,0.0000049796295,0.000006039354,0.000016570057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987639,0.000052402564,0.0004449493,0.00024592946,0.00018895742,0.0003038719],"domain_scores_gemma":[0.99868155,0.00019058833,0.00039638337,0.00017868027,0.0003508747,0.00020192904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615097,0.00016093142,0.00035316515,0.00007787572,0.00033873113,0.0003229668,0.00038019416,0.000076889555,7.838517e-7],"category_scores_gemma":[0.00013422093,0.00013630715,0.000058428184,0.00015360121,0.00013016575,0.00042630613,0.00031129672,0.00014364476,3.4781758e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021283338,0.0007928656,0.058816165,0.0012476416,0.0014985569,0.00071432383,0.014243083,0.004323242,0.005121209,0.41447064,0.05848247,0.43816146],"study_design_scores_gemma":[0.01177899,0.0021580153,0.036563765,0.00079924386,0.000105023326,0.0015373093,0.0013018358,0.8942156,0.00021820377,0.013837441,0.036606207,0.0008783714],"about_ca_topic_score_codex":0.000023974422,"about_ca_topic_score_gemma":0.000009576118,"teacher_disagreement_score":0.88989234,"about_ca_system_score_codex":0.0000293009,"about_ca_system_score_gemma":0.000061748826,"threshold_uncertainty_score":0.5558444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2203232,0.00018930272,0.7564837,0.018289562,0.0016486031,0.00023025868,0.000011515587,0.00040829115,0.002415583],"genre_scores_gemma":[0.97444874,0.000002058708,0.014033243,0.010841612,0.0005169249,0.000017270833,0.0000036948543,0.000012562401,0.00012387252],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984092,0.000057623216,0.00026705654,0.00046262675,0.00035721672,0.0004462901],"domain_scores_gemma":[0.9982533,0.00011477274,0.00010425979,0.0013206868,0.000080510916,0.00012649194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022061118,0.00017692627,0.00019906352,0.000058690366,0.00018299608,0.0002280101,0.0019781815,0.000054877597,0.00005895329],"category_scores_gemma":[0.00008530767,0.00016199412,0.00007564522,0.00036733836,0.00011329607,0.00047616093,0.0003362457,0.00011671783,0.0006661675],"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.000021068077,0.00014461373,0.002001098,0.00006657089,0.00014597645,0.00042166185,0.0019019902,0.0002290916,0.20634216,0.013404942,0.706465,0.068855844],"study_design_scores_gemma":[0.0020836522,0.00062917534,0.011455615,0.00038490785,0.000032724012,0.000280434,0.00012877997,0.019719852,0.06471232,0.003483435,0.89484906,0.0022400133],"about_ca_topic_score_codex":0.000110434565,"about_ca_topic_score_gemma":0.000013216974,"teacher_disagreement_score":0.75412554,"about_ca_system_score_codex":0.000054004307,"about_ca_system_score_gemma":0.000046219197,"threshold_uncertainty_score":0.8562458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053995093,0.00003878482,0.9102887,0.00030631616,0.00070188905,0.0772612,0.0047120964,0.00015087964,0.0011405998],"genre_scores_gemma":[0.648883,0.000007200707,0.1328948,0.0011381999,0.00061833474,0.21294975,0.0026480258,0.00014651765,0.00071417884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946342,0.0001096084,0.0026021022,0.00075921044,0.00092929456,0.00096555054],"domain_scores_gemma":[0.99267477,0.00037737162,0.0022836453,0.0031021908,0.001348596,0.00021342341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019647642,0.0008101938,0.0016264267,0.00059089414,0.00044657814,0.0007599372,0.0037878118,0.0006719683,0.000010637095],"category_scores_gemma":[0.00011945998,0.0005829137,0.0014088332,0.0010163678,0.00036350059,0.0002300382,0.0018072153,0.0006723136,0.000010437178],"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.0024387687,0.0060730106,0.005043887,0.042367276,0.058967624,0.000015816611,0.062428482,0.6540467,0.00025795028,0.07826328,0.05320869,0.036888488],"study_design_scores_gemma":[0.0024749958,0.00019293813,0.00056229543,0.00026385422,0.0006940164,0.000016677326,0.0005808628,0.97372574,0.00021776951,0.0008214021,0.019760868,0.0006885634],"about_ca_topic_score_codex":0.00006621909,"about_ca_topic_score_gemma":0.000021590977,"teacher_disagreement_score":0.77739394,"about_ca_system_score_codex":0.00017660994,"about_ca_system_score_gemma":0.0003074133,"threshold_uncertainty_score":0.9996622},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034969956,0.00014234084,0.9532083,0.00038660326,0.00046540715,0.00014099578,0.0000054455595,0.00018824216,0.01049271],"genre_scores_gemma":[0.9790158,0.0000117280915,0.016914243,0.0006874412,0.00032804132,0.000007959258,0.000006064696,0.000007987879,0.0030207066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989158,0.000039594383,0.0002069333,0.00038583725,0.00021338729,0.00023842852],"domain_scores_gemma":[0.9991998,0.00001636434,0.000057302215,0.00043070747,0.00015853222,0.00013729441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017436272,0.00012985694,0.00015357262,0.000039377905,0.0002692101,0.00023179527,0.0003567398,0.00007103978,0.0001369155],"category_scores_gemma":[0.000019866433,0.0001037887,0.00002600189,0.00023229129,0.000094791394,0.00041255634,0.0002714581,0.000050709823,0.00014689592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008592937,0.00019305316,0.021826737,0.00010818075,0.000115252806,0.000054455202,0.005063419,0.00013763618,0.015628345,0.6146649,0.1195788,0.22254325],"study_design_scores_gemma":[0.0017237162,0.0002296471,0.0028735457,0.000053868032,0.000009341714,0.00010923623,0.000078754994,0.7874307,0.00342838,0.002171428,0.20130515,0.00058623543],"about_ca_topic_score_codex":0.00005287281,"about_ca_topic_score_gemma":0.00004404887,"teacher_disagreement_score":0.94404584,"about_ca_system_score_codex":0.000021620195,"about_ca_system_score_gemma":0.00004834308,"threshold_uncertainty_score":0.42323804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02818145,0.000055629847,0.96210843,0.00052105275,0.00042746868,0.000539498,0.000043765416,0.00007491466,0.008047794],"genre_scores_gemma":[0.89160204,0.00000275286,0.107908845,0.00007401015,0.000105442676,0.00004390672,0.00002900314,0.000006925204,0.00022709239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985536,0.00009768556,0.00036731473,0.00034105114,0.00045039473,0.0001899566],"domain_scores_gemma":[0.9972412,0.00009434987,0.00021540439,0.00061924884,0.0017646388,0.00006514145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046827,0.00010234173,0.00017070498,0.00007291736,0.00014522983,0.000101692945,0.00056662766,0.000053298663,0.000031532036],"category_scores_gemma":[0.00015778914,0.00009348297,0.00005897887,0.0003665261,0.000089507455,0.00053293875,0.000049095146,0.00003838047,0.000048461436],"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.000011072145,0.00019507368,0.00018407762,0.000027823638,0.000033223478,2.1782799e-7,0.0021015713,0.000330231,0.0056104334,0.97527283,0.003372425,0.0128610125],"study_design_scores_gemma":[0.00060147507,0.0004433886,0.006843929,0.000043754757,0.000025516865,0.0000027745396,0.00039570988,0.96783787,0.005949476,0.0096234605,0.008035844,0.00019678171],"about_ca_topic_score_codex":0.00004408127,"about_ca_topic_score_gemma":0.00014367225,"teacher_disagreement_score":0.96750766,"about_ca_system_score_codex":0.000037579655,"about_ca_system_score_gemma":0.00013845468,"threshold_uncertainty_score":0.3812125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4511607,0.00013695718,0.5477327,0.00027729967,0.00020713473,0.00020035087,0.0000062052063,0.00005463887,0.00022399181],"genre_scores_gemma":[0.99813557,8.9679764e-7,0.0016144215,0.00004167164,0.00009143695,0.000023676123,0.0000013162323,0.000005561703,0.000085429834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983668,0.00016082877,0.00035692315,0.00033146536,0.00052528305,0.00025871026],"domain_scores_gemma":[0.9983688,0.00018220833,0.00019290844,0.0009130776,0.00028402772,0.00005897015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006350299,0.000107606145,0.00023981706,0.000022187902,0.0001874436,0.00024022478,0.00090675865,0.00005124063,0.0000046150594],"category_scores_gemma":[0.00013212727,0.000075987904,0.000039000923,0.00037422628,0.00024323275,0.00047958922,0.00015710658,0.00011082492,0.000032504016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014862865,0.014016562,0.028893966,0.0035587223,0.0016529555,0.000036615875,0.01127347,0.04242713,0.43896404,0.44039315,0.0013269308,0.017307818],"study_design_scores_gemma":[0.0001749287,0.00010366966,0.022607347,0.00041641586,0.000025272328,0.0000035502585,0.00019396354,0.97397953,0.0015841019,0.00074050296,0.00002102145,0.00014972084],"about_ca_topic_score_codex":0.000098250515,"about_ca_topic_score_gemma":0.000016572862,"teacher_disagreement_score":0.93155235,"about_ca_system_score_codex":0.00005314101,"about_ca_system_score_gemma":0.000094311756,"threshold_uncertainty_score":0.30986968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2167273,0.000011301284,0.7829853,0.000020938369,0.00005385988,0.00005761804,0.000013513646,0.000022710026,0.00010743229],"genre_scores_gemma":[0.88363117,0.0000010082725,0.1162789,0.00003373047,0.000032116517,7.536006e-7,0.000010673777,0.0000019661538,0.000009647957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.000023103477,0.00019941617,0.00011665721,0.00012597968,0.000071207745],"domain_scores_gemma":[0.99965847,0.000012992736,0.000030477151,0.0000995655,0.00016859804,0.00002989711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016186172,0.0000527576,0.00007055691,0.000040286846,0.0000889141,0.000084515996,0.0000897089,0.000019700756,0.000004136568],"category_scores_gemma":[0.000004308617,0.000044759694,0.000010893536,0.000107828244,0.000016403908,0.001214121,0.000014240342,0.000021058864,0.0000011213223],"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.0000019123997,0.000009478528,0.000008459776,0.0000057353736,0.0000023469793,1.9736811e-7,0.0008051399,0.925959,0.00019156389,0.0011289306,3.005506e-7,0.07188694],"study_design_scores_gemma":[0.00016800097,0.00003821338,0.00005189904,0.000012991341,0.0000011917452,0.0000036818562,0.000014915936,0.9986196,0.00027977506,0.00072797865,0.000023898923,0.000057839854],"about_ca_topic_score_codex":0.0001543526,"about_ca_topic_score_gemma":0.000020201827,"teacher_disagreement_score":0.6669039,"about_ca_system_score_codex":0.00000679761,"about_ca_system_score_gemma":0.000019530044,"threshold_uncertainty_score":0.18252474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06642616,0.0000028651516,0.9297787,0.00033960902,0.00013731467,0.0016721055,0.0000033158794,0.00007448779,0.0015654674],"genre_scores_gemma":[0.9790789,9.544749e-8,0.020515416,0.000072100236,0.00013645917,0.00018338072,7.104701e-7,0.000004346338,0.000008608344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832803,0.00009796159,0.0002733256,0.00041452548,0.0005407073,0.00034545918],"domain_scores_gemma":[0.99831414,0.00011027069,0.00014442808,0.00087394164,0.00044849238,0.000108723376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086404174,0.00013990045,0.00018550477,0.0000828956,0.0003576825,0.00033317893,0.0017616637,0.000025322426,0.000027168322],"category_scores_gemma":[0.000044141998,0.00006889399,0.000069214184,0.0013019784,0.002428814,0.0007795112,0.000300838,0.00013568468,0.000030199799],"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.00003651529,0.00009122577,0.0013740291,0.000007133405,0.000010977723,0.0000018913714,0.0008014615,0.0003490652,0.00052827236,0.9756486,0.00015551115,0.02099534],"study_design_scores_gemma":[0.00038083785,0.0013278935,0.056483146,0.00019680754,0.0000038001203,0.00011575842,0.000017182727,0.91363543,0.0023996672,0.025001833,0.00020618715,0.00023144374],"about_ca_topic_score_codex":0.00006708158,"about_ca_topic_score_gemma":0.0000038764183,"teacher_disagreement_score":0.95064676,"about_ca_system_score_codex":0.00006454273,"about_ca_system_score_gemma":0.00011965369,"threshold_uncertainty_score":0.8949067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03058196,0.00069361884,0.96634406,0.00075674755,0.00068358774,0.0004514934,0.000017129183,0.000104989274,0.0003664262],"genre_scores_gemma":[0.95299006,0.000030182238,0.045944657,0.00080006366,0.000081095925,0.00011490342,0.000014324986,0.000007287059,0.000017440983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830425,0.00012533556,0.00033598547,0.0006703108,0.0002572368,0.00030685807],"domain_scores_gemma":[0.99830997,0.0005986291,0.00025457234,0.00024398572,0.00043204374,0.00016081598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040615865,0.00022141763,0.00022981426,0.00007520768,0.00053102075,0.00040907465,0.00025123704,0.00008151253,0.0000037581144],"category_scores_gemma":[0.00052113674,0.00020591024,0.000046592817,0.00027534494,0.00023389043,0.0011517722,0.00007987686,0.00014542423,0.000008627149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024289178,0.0008842883,0.0017682905,0.00026327537,0.00005162141,0.000030138071,0.034823444,0.00019404538,0.0014933172,0.0515571,0.0017604413,0.90693116],"study_design_scores_gemma":[0.0020444237,0.00047637566,0.001172571,0.0001770864,0.000011198281,0.000024725123,0.0010162216,0.9726981,0.0005928398,0.00023316576,0.02121936,0.00033395799],"about_ca_topic_score_codex":0.00003166282,"about_ca_topic_score_gemma":0.000008625891,"teacher_disagreement_score":0.972504,"about_ca_system_score_codex":0.000021414216,"about_ca_system_score_gemma":0.000087997876,"threshold_uncertainty_score":0.83967763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15462692,0.0046687364,0.7126225,0.0148276845,0.0066731824,0.063706614,0.00006797726,0.0019090648,0.040897302],"genre_scores_gemma":[0.95507234,0.0002569931,0.037113164,0.0009035137,0.0008913978,0.0053575477,0.000027655007,0.000024497775,0.00035288176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988318,0.0000626045,0.0002975037,0.00033552054,0.0002147491,0.000257824],"domain_scores_gemma":[0.9989384,0.000036166854,0.00011802748,0.00077123224,0.00007563573,0.000060536997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020884465,0.0001129904,0.0001625121,0.000064647094,0.00006722471,0.00011405806,0.0008726115,0.000055596996,0.000021839618],"category_scores_gemma":[0.00012570141,0.00009871793,0.000028538849,0.0005092294,0.000021274393,0.00095301756,0.0001418136,0.000086997024,0.0001297823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009544259,0.000055854765,0.011831086,0.000012131418,0.000002052269,0.0000066202606,0.00022568711,0.000018357778,0.00024575714,0.0025226974,0.0013419093,0.9837283],"study_design_scores_gemma":[0.0006420218,0.00018026083,0.04291657,0.0001403416,9.089796e-7,0.000008791265,0.00002064886,0.0075157178,0.0008798569,0.005527375,0.9419156,0.0002519311],"about_ca_topic_score_codex":0.00014197154,"about_ca_topic_score_gemma":0.00028988998,"teacher_disagreement_score":0.9834764,"about_ca_system_score_codex":0.000066187975,"about_ca_system_score_gemma":0.000033975677,"threshold_uncertainty_score":0.40256003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009659381,0.00057621906,0.98573995,0.0032346803,0.000562726,0.000087089065,0.0000031809732,0.000028980912,0.00010778285],"genre_scores_gemma":[0.5670658,0.000008113642,0.43215623,0.00035415168,0.00039722922,0.0000014951073,3.2447122e-7,0.000005796476,0.000010897037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989102,0.000019161285,0.00050502206,0.0001499347,0.00021701922,0.0001986891],"domain_scores_gemma":[0.99895674,0.00006998849,0.0003931536,0.000111078116,0.00030013753,0.00016889727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004663342,0.000093539544,0.00024284898,0.000050742314,0.00007792489,0.00019756722,0.0006729005,0.000043250868,0.00000259105],"category_scores_gemma":[0.0001712826,0.00007830585,0.00015884497,0.00020621045,0.000011069697,0.0006882395,0.00008003521,0.00019212498,0.000008279857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003309016,0.0005048689,0.0030946718,0.0011418167,0.0007089193,0.00044771357,0.022436086,0.15967788,0.18643093,0.05135383,0.010538846,0.5633335],"study_design_scores_gemma":[0.0010770134,0.00030492534,0.00007365213,0.00023698754,0.000010162724,0.00009253677,0.0003036528,0.98010606,0.0038007947,0.00043103247,0.013407423,0.00015577237],"about_ca_topic_score_codex":0.0000019970462,"about_ca_topic_score_gemma":2.6784642e-7,"teacher_disagreement_score":0.8204282,"about_ca_system_score_codex":0.000027119986,"about_ca_system_score_gemma":0.00007551057,"threshold_uncertainty_score":0.319322},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016138324,0.000011861126,0.72751445,0.00043464272,0.00035387606,0.000021653776,4.6368467e-7,0.0001228257,0.2699264],"genre_scores_gemma":[0.97622204,4.9811297e-7,0.017598616,0.00045512288,0.00019063687,0.0000015064908,2.8877847e-7,0.0000014095676,0.005529895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996054,0.000006775925,0.00006669017,0.00012909812,0.00008327456,0.000108768974],"domain_scores_gemma":[0.99960333,0.0000054674133,0.000013805619,0.00029233773,0.000046935253,0.000038129878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000067475994,0.00003486811,0.000042728585,0.000013152837,0.000045047436,0.00007521377,0.00037669585,0.000014588339,0.00010184532],"category_scores_gemma":[0.0000046821656,0.000026624884,0.000015777996,0.00015062357,0.000021948092,0.00016909468,0.000060836952,0.000018540348,0.0015372634],"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":[4.8493206e-7,0.000014322556,0.0002692536,0.0000013552603,0.0000028575332,0.0000041952862,0.000110594854,3.7235986e-7,0.0003825612,0.89946425,0.06856758,0.031182181],"study_design_scores_gemma":[0.00015475243,0.00006495394,0.004129713,0.0000069078023,4.6991607e-7,0.000018277036,0.000011790605,0.024810866,0.0041069244,0.0043601277,0.96220565,0.00012955134],"about_ca_topic_score_codex":0.000016759743,"about_ca_topic_score_gemma":0.0000075806884,"teacher_disagreement_score":0.9746082,"about_ca_system_score_codex":0.0000057173543,"about_ca_system_score_gemma":0.00001082028,"threshold_uncertainty_score":0.99924016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010648152,0.06074658,0.66166687,0.05317003,0.009135554,0.0020788491,0.00006255408,0.0018406586,0.20065077],"genre_scores_gemma":[0.8843875,0.0067908126,0.044196267,0.050614912,0.003007049,0.00011841259,0.000033046053,0.0000603312,0.010791647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987315,0.000055009372,0.0002887481,0.00037381632,0.00024514066,0.0003058211],"domain_scores_gemma":[0.9978651,0.000057858295,0.00011876767,0.001727402,0.00010745251,0.00012342847],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002484304,0.00014247102,0.0002430286,0.00002779905,0.000113563525,0.0001095662,0.0018145627,0.000052125095,0.00010855002],"category_scores_gemma":[0.0002157854,0.00011553302,0.00008419446,0.00041946836,0.00005135605,0.0004354299,0.0003399799,0.000091282855,0.0024249477],"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.0000020142104,0.00003955219,0.00031079346,0.00013083435,0.000014747297,0.000014647869,0.00012773144,2.710396e-7,0.0007687555,0.005984868,0.85508776,0.13751803],"study_design_scores_gemma":[0.0001464451,0.00008403251,0.00065573206,0.00046860502,0.0000055476276,0.000022678483,0.000004824821,0.00026845868,0.00058193645,0.00090743386,0.99666613,0.00018819794],"about_ca_topic_score_codex":0.000082763145,"about_ca_topic_score_gemma":0.000024160725,"teacher_disagreement_score":0.87373936,"about_ca_system_score_codex":0.000025940393,"about_ca_system_score_gemma":0.00005402728,"threshold_uncertainty_score":0.99835175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035758026,0.00013247215,0.96151304,0.0009839515,0.0005734579,0.00018490772,0.000009900579,0.0002685195,0.00057573477],"genre_scores_gemma":[0.94067377,0.000018967437,0.058521774,0.00049390015,0.00010909004,0.000008461006,0.000005801303,0.000011826533,0.00015640125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983056,0.00008625173,0.0003406924,0.00055522606,0.00032878877,0.00038344896],"domain_scores_gemma":[0.99885243,0.00012299603,0.000100484656,0.000710166,0.0000748741,0.00013904957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549285,0.00020551683,0.00020984444,0.00007888233,0.0007394955,0.0001889369,0.00081099663,0.00008398108,0.000023598961],"category_scores_gemma":[0.000012794646,0.000195679,0.000072656214,0.00032231165,0.00007923653,0.00027865823,0.00006968318,0.00020717269,0.00012401107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449432,0.0004817835,0.00018033363,0.000044088072,0.00009642755,0.000017165503,0.0024909195,0.0021507407,0.004152562,0.0073313676,0.007555657,0.9754345],"study_design_scores_gemma":[0.0034450316,0.0014646638,0.0028695406,0.00035704597,0.000036725793,0.00015220963,0.0003921084,0.87193704,0.0023695077,0.0031189027,0.11254043,0.0013168185],"about_ca_topic_score_codex":0.00012298889,"about_ca_topic_score_gemma":0.000028222063,"teacher_disagreement_score":0.97411764,"about_ca_system_score_codex":0.000057055357,"about_ca_system_score_gemma":0.00001975108,"threshold_uncertainty_score":0.79795575},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000288401,0.0063719344,0.30540776,0.000045379573,0.0014334352,0.0004968582,0.00062943646,0.00018395188,0.6854284],"genre_scores_gemma":[0.012745752,0.0031836652,0.0071189995,0.00007302753,0.0017420028,0.00006717292,0.0011223214,0.0001252515,0.9738218],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711585,0.0000411191,0.0009940305,0.00074603,0.0007794324,0.00032351393],"domain_scores_gemma":[0.99749255,0.00004305388,0.00081658975,0.0012509541,0.00023884249,0.00015798913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004250331,0.0004530754,0.0007846317,0.00021702459,0.00009826699,0.00012740321,0.001043896,0.00031007366,0.000022270377],"category_scores_gemma":[0.000012855683,0.0004296776,0.00017833419,0.000119072836,0.00005001092,0.00084533973,0.00006862851,0.00038311208,0.00010543367],"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.00002629893,0.00014867917,0.000008829457,0.0033688922,0.00014741994,0.00025848488,0.0006480809,0.00025039117,0.00017757187,0.38479117,0.041287206,0.568887],"study_design_scores_gemma":[0.00026898235,0.00007470199,0.000009415462,0.0022285597,0.0000389066,0.000071969516,0.000013437515,0.0038411824,0.000017082575,0.00036967715,0.9925505,0.0005155881],"about_ca_topic_score_codex":0.000079624624,"about_ca_topic_score_gemma":0.000010177148,"teacher_disagreement_score":0.9512633,"about_ca_system_score_codex":0.000077985766,"about_ca_system_score_gemma":0.00026041103,"threshold_uncertainty_score":0.9998155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387629,0.000038948743,0.15505031,0.00079349865,0.00012910487,0.00042275846,0.00000565629,0.00009098244,0.004705867],"genre_scores_gemma":[0.99016756,3.742884e-7,0.009366939,0.000031862328,0.00004502015,0.000022336151,7.6755704e-8,0.0000042227916,0.00036159094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920964,0.0000013981874,0.00015890357,0.00024217524,0.00017216976,0.00021568449],"domain_scores_gemma":[0.99956024,0.00018039564,0.00007512157,0.00007557966,0.000052415,0.00005626454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027000316,0.00010996071,0.00022353957,0.000009213929,0.000107690634,0.0001308153,0.00053523347,0.000033080047,0.0000010694222],"category_scores_gemma":[0.00006744567,0.000067899935,0.00016089312,0.00020732953,0.0001254841,0.00025702384,0.00017421845,0.00008716774,0.000004481096],"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.000001074345,0.00004773077,0.00009693253,0.00031607694,0.000016365922,1.1639136e-8,0.00093073933,0.0015912732,0.0009130252,0.9955414,0.00036075275,0.00018461212],"study_design_scores_gemma":[0.0001267837,0.000094471914,0.00034427116,0.000106042964,0.000007014585,0.0000011178765,0.00008188684,0.9336385,0.0004914922,0.06475853,0.00024438652,0.0001054948],"about_ca_topic_score_codex":0.0000010498081,"about_ca_topic_score_gemma":6.8959247e-9,"teacher_disagreement_score":0.93204725,"about_ca_system_score_codex":0.00001471847,"about_ca_system_score_gemma":0.000013733167,"threshold_uncertainty_score":0.2768879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044408245,0.00013503882,0.96158606,0.0012837695,0.00030809492,0.0001108893,0.00000200613,0.00043257626,0.031700768],"genre_scores_gemma":[0.9458236,0.0000017046183,0.05249123,0.00023938392,0.00008682376,0.000012378245,0.0000041999137,0.000006146534,0.0013345187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988334,0.0000666084,0.00019684166,0.00032019315,0.00035451353,0.0002284225],"domain_scores_gemma":[0.9990712,0.0000287715,0.000054611417,0.0005306234,0.00009594396,0.00021884078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031593425,0.00011807594,0.0001456064,0.00004699286,0.00008045611,0.0001240151,0.0006839143,0.00011075955,0.000016760187],"category_scores_gemma":[0.000053528736,0.00007776324,0.000049481936,0.0003315863,0.000024971376,0.00025680749,0.0002604822,0.00018067182,0.00012664702],"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.000038299037,0.00037751131,0.0038174465,0.000052676147,0.00001711829,0.00014362941,0.00074065436,0.0014000143,0.013894923,0.12882021,0.21540825,0.63528925],"study_design_scores_gemma":[0.002250445,0.00041197895,0.0065939357,0.00036162013,0.000010062508,0.0005796392,0.00026648882,0.07350272,0.007302623,0.016233925,0.89137167,0.0011148711],"about_ca_topic_score_codex":0.000034266704,"about_ca_topic_score_gemma":0.000013616632,"teacher_disagreement_score":0.94138277,"about_ca_system_score_codex":0.00003995832,"about_ca_system_score_gemma":0.0000740984,"threshold_uncertainty_score":0.3171093},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013053753,0.012134863,0.24792337,0.0002246763,0.0041107526,0.0038918727,0.012076304,0.00022853103,0.7192791],"genre_scores_gemma":[0.018703684,0.004927498,0.0148919895,0.00006929234,0.0021174676,0.00081519375,0.0027948297,0.00015013729,0.9555299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969571,0.00003659243,0.0009535593,0.0013263414,0.0004394911,0.00028686385],"domain_scores_gemma":[0.9928319,0.00019333881,0.0013375921,0.0050545763,0.0004228519,0.00015972892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010913553,0.00040490608,0.00085292064,0.00009144746,0.00021197935,0.00017516225,0.0014334866,0.00028950628,0.000006753479],"category_scores_gemma":[0.000269647,0.00038455226,0.00014442956,0.000023730172,0.00014916636,0.0006673468,0.00034342555,0.00021893939,0.000031428204],"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.000048967817,0.00008332818,0.00020105559,0.0052143387,0.00015609535,0.000021157572,0.00036415877,0.000035023342,0.00017414994,0.8378547,0.10831283,0.04753421],"study_design_scores_gemma":[0.00039785076,0.00006399507,0.00007533081,0.0010204539,0.000029995728,0.000023362727,0.000005610889,0.0047814827,0.0000222778,0.0009949572,0.99216497,0.00041971938],"about_ca_topic_score_codex":0.00017365179,"about_ca_topic_score_gemma":0.000029150315,"teacher_disagreement_score":0.8838521,"about_ca_system_score_codex":0.000053161217,"about_ca_system_score_gemma":0.0001725715,"threshold_uncertainty_score":0.99986064},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000063351677,0.0063641625,0.6514999,0.00006088156,0.0048866887,0.0026583273,0.04693952,0.0002816355,0.28730252],"genre_scores_gemma":[0.011129842,0.0040020216,0.019855985,0.0002992901,0.008564178,0.0017795004,0.026595578,0.00048786413,0.92728573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99546003,0.00007737247,0.0016876562,0.0014604268,0.0007463596,0.0005681781],"domain_scores_gemma":[0.9930714,0.0005011962,0.0016137147,0.0036664165,0.0008690128,0.00027830285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009966275,0.00070162234,0.001432989,0.00024189429,0.00014929005,0.00010919731,0.0020248806,0.0002892587,0.00010600358],"category_scores_gemma":[0.00023844346,0.00064885564,0.00032338285,0.00012840836,0.00020474399,0.000685892,0.00036993853,0.00030010246,0.00028543183],"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.000039365852,0.00006647749,0.000021418595,0.001316708,0.00025250964,0.000031394633,0.000089940135,0.000006227764,0.000068128866,0.56646556,0.42920443,0.0024378684],"study_design_scores_gemma":[0.0012140514,0.0001731775,0.0000038036983,0.0015878722,0.00010469549,0.0000398048,0.000012215583,0.0040119574,0.000036603087,0.00038988318,0.99172485,0.00070106704],"about_ca_topic_score_codex":0.00016195774,"about_ca_topic_score_gemma":0.000020164316,"teacher_disagreement_score":0.6399832,"about_ca_system_score_codex":0.00007510563,"about_ca_system_score_gemma":0.00041226766,"threshold_uncertainty_score":0.9995963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11147093,0.0011199368,0.87810326,0.0032261834,0.00019304056,0.00041054093,0.000065129374,0.00015540206,0.0052555953],"genre_scores_gemma":[0.9075318,0.000017855908,0.09174912,0.00039883016,0.000022166969,0.000028564882,0.00018081558,0.000006800817,0.00006405622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976573,0.00075373874,0.0005665838,0.0004532688,0.00032502718,0.0002441043],"domain_scores_gemma":[0.99812865,0.00084196817,0.00016042276,0.0005192513,0.0002439247,0.00010576604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074221916,0.0001822391,0.0005500379,0.00010870125,0.00025942994,0.00029030556,0.00054155645,0.000051725867,0.000022888004],"category_scores_gemma":[0.00019336893,0.0001874339,0.00009215385,0.00044419148,0.00062933646,0.0003378831,0.00046725434,0.00022599423,0.000017994866],"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.0002590223,0.00012887557,0.000774685,0.000046145,0.000020445179,0.000034791952,0.000630277,0.0019475359,0.000014056713,0.9922927,0.00024481717,0.0036066435],"study_design_scores_gemma":[0.012137919,0.000011485972,0.038877793,0.000059773425,0.0000041858093,0.00007593848,0.00003487631,0.4607395,0.000011035496,0.487313,0.0005516874,0.00018280449],"about_ca_topic_score_codex":0.0000955202,"about_ca_topic_score_gemma":0.00015939007,"teacher_disagreement_score":0.79606086,"about_ca_system_score_codex":0.000054548345,"about_ca_system_score_gemma":0.00014604522,"threshold_uncertainty_score":0.7643333},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079895527,0.0005170551,0.9951889,0.00042109253,0.00088055845,0.00083543075,0.000038016704,0.000023588329,0.0012964001],"genre_scores_gemma":[0.9161403,0.00003186578,0.08258548,0.0009396205,0.00015123733,0.000011054719,0.000035125875,0.00001786921,0.000087409804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971273,0.00003925933,0.0005769213,0.0012170513,0.00064564886,0.0003938343],"domain_scores_gemma":[0.99691665,0.00047859634,0.0003432118,0.0020805737,0.00013038455,0.000050601047],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002082937,0.00030565236,0.00048341916,0.00025037574,0.000069149144,0.00039634877,0.006492958,0.00017041925,0.00000270834],"category_scores_gemma":[0.000115428054,0.0002275264,0.00005225886,0.00026208992,0.00025943806,0.001000163,0.0021649355,0.00043329358,0.000002860177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048414488,0.00016588467,0.0009415491,0.0013320534,0.000062287894,0.00007713733,0.032482903,0.0026929257,0.0003986375,0.1555896,0.00049133395,0.8057173],"study_design_scores_gemma":[0.00048216528,0.00012652797,0.00014237735,0.0010195557,0.0000058038972,0.000029955363,0.0000013592633,0.9517166,0.00020597974,0.039860144,0.0060707224,0.0003387956],"about_ca_topic_score_codex":0.00008900479,"about_ca_topic_score_gemma":0.00006107723,"teacher_disagreement_score":0.94902366,"about_ca_system_score_codex":0.000059095528,"about_ca_system_score_gemma":0.0002394648,"threshold_uncertainty_score":0.9988824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10082339,0.00025623248,0.8970634,0.00030596484,0.0007151585,0.00025637454,0.000016487342,0.00009504627,0.00046800578],"genre_scores_gemma":[0.9987308,0.00000445357,0.001088643,0.00004609433,0.000062274725,0.0000040473033,0.000042197185,0.0000072742127,0.000014218132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.00017181107,0.0005413213,0.00036760292,0.00025596315,0.00048065797],"domain_scores_gemma":[0.9986483,0.00025688915,0.0002802607,0.0006305468,0.00013075543,0.000053282198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070309226,0.00016032418,0.00029321463,0.0000503577,0.00016870152,0.0001666886,0.00092551694,0.00006614732,0.0000028465904],"category_scores_gemma":[0.000037829406,0.00012773628,0.00009482711,0.0010099573,0.0001165498,0.00018016755,0.00017439526,0.00028521733,0.000016741942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006710992,0.0004004088,0.11846131,0.00012142476,0.00012546018,0.000020922278,0.0007938811,0.3296097,0.0025915492,0.39528486,0.0035244538,0.1489989],"study_design_scores_gemma":[0.000556505,0.000044868466,0.038524766,0.000082066545,0.0000020360037,0.000008380523,0.00007739733,0.957866,0.00038781491,0.0008558197,0.0014353513,0.0001589616],"about_ca_topic_score_codex":0.00017943516,"about_ca_topic_score_gemma":0.000044101842,"teacher_disagreement_score":0.89790744,"about_ca_system_score_codex":0.000083084626,"about_ca_system_score_gemma":0.000038437276,"threshold_uncertainty_score":0.5208934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116927214,0.0005304635,0.8682037,0.00007036893,0.0024398346,0.0007663288,0.00004831899,0.0003539935,0.0106597915],"genre_scores_gemma":[0.99570006,0.000114092014,0.0008939864,0.00006635278,0.00018772972,0.0000046761206,0.00004070386,0.00001971693,0.0029726832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971366,0.0003857229,0.0004228077,0.0011874842,0.00021254757,0.0006548287],"domain_scores_gemma":[0.9971317,0.0001840565,0.0004787524,0.0016444182,0.00024306503,0.0003179904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010885637,0.00044376234,0.0009255219,0.00021068576,0.00025900162,0.00020650355,0.0021171577,0.0003992791,0.00008268543],"category_scores_gemma":[0.00005778878,0.0004385353,0.0004832511,0.00063919806,0.00016138055,0.00032500678,0.002561747,0.0005898305,0.00039946754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016755228,0.00042282505,0.00031416392,0.0001724403,0.00021323567,0.0002448703,0.0009467458,0.41629347,0.00006231005,0.5763682,0.0025284863,0.00075775135],"study_design_scores_gemma":[0.020083241,0.000014180765,0.00016905725,0.00018318946,0.00010095931,0.000008858121,0.000059825095,0.9692276,0.0000631499,0.0045036618,0.0049061007,0.0006801494],"about_ca_topic_score_codex":0.00031111704,"about_ca_topic_score_gemma":0.000011842904,"teacher_disagreement_score":0.87877285,"about_ca_system_score_codex":0.00023694271,"about_ca_system_score_gemma":0.00021303752,"threshold_uncertainty_score":0.99980664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006069455,0.00010690553,0.9832933,0.00020850498,0.0011916124,0.00044931122,0.00016596749,0.00024974978,0.008265219],"genre_scores_gemma":[0.98913515,0.000030917305,0.0031821157,0.000045530254,0.00017927072,0.0000046620034,0.000014293156,0.000018523115,0.0073895385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979794,0.00007598978,0.00020051227,0.00119804,0.000089919944,0.00045615577],"domain_scores_gemma":[0.9978679,0.00014325627,0.00031779523,0.0012340422,0.0002708494,0.00016619453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002690335,0.00031603253,0.00038469516,0.00014398727,0.00021008098,0.00017518627,0.0017941104,0.0002945017,0.0000061087835],"category_scores_gemma":[0.000033269946,0.00030933574,0.00027782298,0.00030495427,0.00008795123,0.00040944174,0.0011518974,0.00026663457,0.0000585489],"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.000046595855,0.000050102408,0.00020324162,0.00009222298,0.00011646174,0.00011775157,0.00021866738,0.008130602,0.00006643058,0.9856921,0.0035639643,0.001701885],"study_design_scores_gemma":[0.0015028035,0.00017076549,0.00035679256,0.0007773142,0.00007324416,0.000009316428,0.00013357261,0.7365923,0.00029191523,0.22000042,0.038886838,0.001204749],"about_ca_topic_score_codex":0.00006150818,"about_ca_topic_score_gemma":0.00002408146,"teacher_disagreement_score":0.98306566,"about_ca_system_score_codex":0.0002724361,"about_ca_system_score_gemma":0.00023068853,"threshold_uncertainty_score":0.99993587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011117975,0.00022509853,0.98305595,0.0008179825,0.0017790957,0.0012378735,0.00017999338,0.0003008231,0.001285217],"genre_scores_gemma":[0.81883204,0.0000081180415,0.17880857,0.00025977698,0.00089025655,0.00071789895,0.00011901585,0.000029404653,0.0003349153],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976813,0.000071914634,0.00049791083,0.0009384685,0.0003202796,0.0004900805],"domain_scores_gemma":[0.9967716,0.00035303185,0.00048347298,0.0021044933,0.00016461928,0.00012279124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062815857,0.00039913645,0.00059354794,0.00013529678,0.00016892409,0.00060483627,0.0040235603,0.00040531752,0.0000040624805],"category_scores_gemma":[0.00020480991,0.00036159364,0.00022617252,0.0001378296,0.000040520496,0.00019656663,0.0016482337,0.00039020178,0.000023004286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032628418,0.0014474026,0.013238046,0.014585262,0.0020779918,0.0004356213,0.010972245,0.13271487,0.07630387,0.154684,0.30321926,0.28999513],"study_design_scores_gemma":[0.0014492866,0.00040799176,0.0038660595,0.0024155378,0.0001353277,0.000049319086,0.000052872187,0.78412503,0.022591105,0.028497396,0.15358712,0.0028229745],"about_ca_topic_score_codex":0.00021499657,"about_ca_topic_score_gemma":0.000072552386,"teacher_disagreement_score":0.80771405,"about_ca_system_score_codex":0.00005038332,"about_ca_system_score_gemma":0.00012856661,"threshold_uncertainty_score":0.9998836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039987275,0.000119046126,0.9798713,0.0017119367,0.0011213231,0.0011182975,0.000075058604,0.00034181622,0.011642534],"genre_scores_gemma":[0.96753603,0.000018938754,0.022251867,0.0008533115,0.00042223322,0.0006918202,0.0008399828,0.000026252326,0.0073595475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985912,0.000040915515,0.0005023858,0.00032200062,0.00026017032,0.0002833513],"domain_scores_gemma":[0.9990238,0.000029914741,0.00020949493,0.00046534347,0.00019969777,0.000071753166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049179926,0.00020886946,0.00032923374,0.00019955191,0.000039639177,0.0003451504,0.0006640265,0.00030006573,0.000008261231],"category_scores_gemma":[0.00003906326,0.00019026734,0.00009498965,0.00024443676,0.000018560346,0.0009680751,0.00017845648,0.0002508455,0.00012456987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018837627,0.00044951143,0.00028843,0.0009904021,0.00012602404,0.000008873943,0.010848989,0.057109088,0.00033122947,0.034069814,0.63108885,0.26450038],"study_design_scores_gemma":[0.0008305721,0.00011471779,0.00076822925,0.00010812124,0.0000056336967,0.000011629778,0.000058840105,0.8685022,0.00027003698,0.0027160896,0.12619697,0.00041693787],"about_ca_topic_score_codex":0.00020154096,"about_ca_topic_score_gemma":0.00011529421,"teacher_disagreement_score":0.96353734,"about_ca_system_score_codex":0.00018404536,"about_ca_system_score_gemma":0.00024340235,"threshold_uncertainty_score":0.77588767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3630007,0.0006994181,0.63486874,0.00013022154,0.00031213323,0.00026048423,0.000010330557,0.00028078415,0.0004371851],"genre_scores_gemma":[0.99158037,0.000006622165,0.008027453,0.00015215365,0.00013712389,0.0000059958766,0.000029458492,0.000019147274,0.000041680432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779254,0.00008218723,0.00038975856,0.00067540683,0.00036411016,0.00069600536],"domain_scores_gemma":[0.9987991,0.00009424815,0.00020914242,0.0005603639,0.0001754375,0.00016171856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042653907,0.00029092512,0.0003990689,0.0000499801,0.00036245357,0.0006345265,0.00069116085,0.00009377105,0.000002229562],"category_scores_gemma":[0.00002511173,0.00023288018,0.000052484404,0.00071906403,0.000053594296,0.00042913636,0.0003388066,0.00025527287,0.000039775776],"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.00016292912,0.00023454624,0.3182998,0.00086474256,0.0004439377,0.0002774393,0.0025468888,0.41496527,0.0022663933,0.059227735,0.0041408245,0.1965695],"study_design_scores_gemma":[0.0012081516,0.00020497122,0.029496543,0.001369235,0.00001536717,0.0001550477,0.00020279229,0.9577413,0.00034885894,0.00014215948,0.008391565,0.0007240054],"about_ca_topic_score_codex":0.000035768146,"about_ca_topic_score_gemma":0.0000039702454,"teacher_disagreement_score":0.6285797,"about_ca_system_score_codex":0.00006425806,"about_ca_system_score_gemma":0.000086174856,"threshold_uncertainty_score":0.9496578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27460966,0.0000066641032,0.71791273,0.00016612085,0.0004645774,0.0043714093,0.00006647969,0.00007768605,0.00232467],"genre_scores_gemma":[0.9995123,0.0000017610362,0.00006218385,0.00002701702,0.000031105992,0.000034581644,0.0000113107035,0.000009746978,0.00031000192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984811,0.00020965895,0.00040389778,0.00055825553,0.00017721452,0.00016985102],"domain_scores_gemma":[0.9972885,0.0002796139,0.0008152016,0.0012285656,0.0003349467,0.0000531276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032476344,0.00022055865,0.0003450991,0.0001363025,0.00007680259,0.00004355965,0.0009421605,0.00019260558,0.00004011458],"category_scores_gemma":[0.000064064356,0.00016039675,0.00021951327,0.00032758733,0.00006290705,0.0003276511,0.00038316398,0.00025285085,0.000021594993],"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.000115892304,0.00014638007,0.0013341547,0.00010484077,0.000060036255,0.000011261947,0.0002557952,0.7459957,0.00006528786,0.2510839,0.00020989652,0.00061683916],"study_design_scores_gemma":[0.0006339393,0.00014289991,0.005817065,0.0014192191,0.00002079702,0.0000012511392,0.000058794703,0.9633257,0.00030387577,0.02670352,0.0012686208,0.00030433014],"about_ca_topic_score_codex":0.000075025586,"about_ca_topic_score_gemma":0.000007375512,"teacher_disagreement_score":0.72490263,"about_ca_system_score_codex":0.00012051029,"about_ca_system_score_gemma":0.000060802977,"threshold_uncertainty_score":0.65407896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025819808,0.00044948084,0.96664256,0.00025240085,0.0009520622,0.0004062988,0.0015721291,0.00059468334,0.0033105505],"genre_scores_gemma":[0.99648553,0.000054823577,0.0013315455,0.0001019099,0.00015102477,0.0000015295715,0.0012053892,0.000023867307,0.0006443651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967285,0.00017382203,0.00033593894,0.0019986755,0.0002512374,0.00051182194],"domain_scores_gemma":[0.99472284,0.000044487413,0.00045765942,0.0040877233,0.00038166478,0.0003056103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005560829,0.0004745578,0.00055216084,0.00014196092,0.00023585348,0.0005125806,0.0053511946,0.0003880162,0.000005402595],"category_scores_gemma":[0.00008579066,0.0005027314,0.000121012,0.0007719291,0.00015498599,0.0010205874,0.00396537,0.0007595367,0.00007618699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003031931,0.00094584073,0.0018632081,0.0010899687,0.00041753554,0.003965248,0.0009941782,0.2406358,0.000044007487,0.66105884,0.07719697,0.011485184],"study_design_scores_gemma":[0.0007258978,0.00008464599,0.00056184875,0.00068803027,0.00006547104,0.0000145018585,0.00014630008,0.92847425,0.000033253502,0.029974611,0.0382873,0.0009438749],"about_ca_topic_score_codex":0.00017527878,"about_ca_topic_score_gemma":0.000028986991,"teacher_disagreement_score":0.97066575,"about_ca_system_score_codex":0.0002820431,"about_ca_system_score_gemma":0.0007626875,"threshold_uncertainty_score":0.99974245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7364823,0.00006125471,0.26148355,0.00012561385,0.00013692098,0.00023647505,0.000024090275,0.000045185494,0.0014045456],"genre_scores_gemma":[0.9991742,0.000024577534,0.0001339913,0.000012050519,0.000014961105,4.003723e-7,0.000004166187,0.0000037624222,0.0006319193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916255,0.0001369485,0.000105204446,0.00042152643,0.00006747995,0.00010627369],"domain_scores_gemma":[0.9990897,0.000058592635,0.00020030013,0.00047874244,0.00010865979,0.00006396196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003258266,0.00012922529,0.00018693916,0.000059842383,0.00008533211,0.000058780744,0.00037064037,0.00010906154,0.000003866213],"category_scores_gemma":[0.000023427247,0.00011230225,0.00004815557,0.00017670679,0.00015489747,0.00013446542,0.00054543506,0.00019724156,0.000009946499],"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.00010004253,0.00017499719,0.00056686345,0.00020733126,0.00014782701,0.00003787474,0.00064610055,0.02016619,0.00057989394,0.97205275,0.0010194933,0.004300605],"study_design_scores_gemma":[0.00043484257,0.00015850748,0.0043230564,0.00020055717,0.000033803866,0.000007762959,0.000052466436,0.7944345,0.0003409483,0.19944727,0.00032182268,0.00024445372],"about_ca_topic_score_codex":0.00014456591,"about_ca_topic_score_gemma":0.000044843622,"teacher_disagreement_score":0.7742683,"about_ca_system_score_codex":0.000047882986,"about_ca_system_score_gemma":0.00004236659,"threshold_uncertainty_score":0.4579553},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3036724e-7,0.00041236824,0.34093955,0.000988412,0.0014753607,0.00084533193,0.0030155794,0.0001641721,0.6521588],"genre_scores_gemma":[0.21867159,0.0010637938,0.003107587,0.008970582,0.0010505838,0.0003018002,0.0024046744,0.000289289,0.76414007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657494,0.000058647336,0.00046346334,0.001523816,0.0010002363,0.00037888752],"domain_scores_gemma":[0.99516064,0.00045155914,0.00028779657,0.0039493386,0.00004793592,0.000102729806],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003828409,0.0005699154,0.0006085011,0.0002562417,0.0001320028,0.00031483502,0.003967274,0.0002321455,0.0005940811],"category_scores_gemma":[0.000029501172,0.0004861186,0.00018722612,0.000055728953,0.00004759153,0.00026561818,0.00027170763,0.0004270043,0.0019261491],"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.000040479175,0.00005516498,1.9622959e-7,0.00012809443,0.00042751824,0.000057538786,0.000006863259,0.00044797992,0.000001156124,0.75125825,0.102964416,0.14461231],"study_design_scores_gemma":[0.00050706265,0.000109149565,0.000033696226,0.000704776,0.00012252964,0.000005240372,0.0000013661717,0.0043230243,0.000015226289,0.007447569,0.98611474,0.00061562017],"about_ca_topic_score_codex":0.0000068650293,"about_ca_topic_score_gemma":0.0000077002915,"teacher_disagreement_score":0.88315034,"about_ca_system_score_codex":0.00014196093,"about_ca_system_score_gemma":0.00006452659,"threshold_uncertainty_score":0.999759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5745684,0.0008561602,0.42133778,0.0001233806,0.00090031547,0.0004750758,0.000055198554,0.0002705157,0.0014131644],"genre_scores_gemma":[0.99841666,0.00015782124,0.00067474047,0.000033614066,0.000026477832,0.0000017406549,0.000040005638,0.000012072111,0.00063688523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978564,0.00021216403,0.00029606078,0.0010906003,0.00010008286,0.00044471002],"domain_scores_gemma":[0.9983802,0.000087078144,0.0002684458,0.0008612327,0.0001718967,0.00023118676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004889626,0.00033481178,0.00046345475,0.00023724008,0.000094120194,0.00017043341,0.0009653857,0.00029720002,0.0000034674536],"category_scores_gemma":[0.000033203207,0.00038335854,0.00008628107,0.0006861845,0.000102846534,0.00014417086,0.0012600775,0.00056700123,0.000013017913],"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.00008958496,0.00018429935,0.027121112,0.00019958965,0.0001945743,0.002830212,0.00080558594,0.90409917,0.000020086474,0.056563787,0.003432272,0.0044597513],"study_design_scores_gemma":[0.0007101087,0.000030358686,0.0052073277,0.00023052946,0.000021149486,0.000014892878,0.000087082306,0.9872605,0.0000015210343,0.0054588784,0.00055610394,0.0004215319],"about_ca_topic_score_codex":0.0005156983,"about_ca_topic_score_gemma":0.0006775462,"teacher_disagreement_score":0.42384824,"about_ca_system_score_codex":0.00037402727,"about_ca_system_score_gemma":0.0001649548,"threshold_uncertainty_score":0.99986184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4892403,0.0015658372,0.5067218,0.00071089994,0.0007460819,0.0005068762,0.00007674583,0.00017191102,0.00025955148],"genre_scores_gemma":[0.98767585,0.00018110867,0.011191584,0.0001395333,0.0002546897,0.00017149297,0.000041789182,0.000020344909,0.00032361402],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983537,0.000033823126,0.00031199536,0.0007683631,0.00020838965,0.0003237193],"domain_scores_gemma":[0.9987242,0.00006222482,0.00022795124,0.00069839496,0.00016584687,0.0001213607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020110204,0.0002899394,0.00037958386,0.000057098234,0.0002613119,0.00031345114,0.00050251756,0.0001862119,0.0000046125306],"category_scores_gemma":[0.000013082561,0.0002494703,0.00003532196,0.0002516566,0.000096011805,0.00021206363,0.0006970466,0.00037853676,0.000014172595],"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.00004354071,0.00038436407,0.80809504,0.0008625695,0.0005227118,0.00022276066,0.006222385,0.1275723,0.00009126044,0.01770244,0.003173112,0.03510753],"study_design_scores_gemma":[0.0031941666,0.00029035646,0.84605736,0.0033652738,0.00012279116,0.00015529334,0.00016211391,0.0678151,0.00011557244,0.002465051,0.074108824,0.0021480895],"about_ca_topic_score_codex":0.00054910564,"about_ca_topic_score_gemma":0.00064832,"teacher_disagreement_score":0.49843556,"about_ca_system_score_codex":0.00005259393,"about_ca_system_score_gemma":0.00014280163,"threshold_uncertainty_score":0.99999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17514203,0.001613172,0.7927684,0.00048762932,0.0002981969,0.001080953,0.000025587242,0.00016021174,0.028423827],"genre_scores_gemma":[0.9364038,0.000006448538,0.06337826,0.000051310075,0.000013930342,0.000021209435,0.0000035245946,0.0000046660757,0.00011682236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935174,0.00003166695,0.0002155072,0.00016323949,0.0001028914,0.00013493445],"domain_scores_gemma":[0.9983621,0.00013596343,0.000109765184,0.0012801568,0.00008115613,0.000030842417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515426,0.00006352646,0.00014199014,0.000038227256,0.00007321256,0.000039880542,0.0012502266,0.000034801076,0.0000054522684],"category_scores_gemma":[0.000010293095,0.000057598354,0.000056540866,0.00013383328,0.00002377898,0.0002220461,0.00030361113,0.0000447139,0.000007841977],"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.000029138171,0.00045260767,0.0068074055,0.0010130025,0.00020301354,0.000001232777,0.011498452,0.021849675,0.016526073,0.91229296,0.0030475974,0.026278855],"study_design_scores_gemma":[0.0007444935,0.0001148816,0.00043404257,0.0001944073,0.000008312691,0.0000056270646,0.0021860565,0.79649764,0.0021928716,0.0007147762,0.19664933,0.00025758424],"about_ca_topic_score_codex":0.00005516765,"about_ca_topic_score_gemma":0.000029928364,"teacher_disagreement_score":0.9115782,"about_ca_system_score_codex":0.000016084283,"about_ca_system_score_gemma":0.00002594175,"threshold_uncertainty_score":0.23487927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006511104,0.00033626112,0.9781265,0.003726155,0.0028510562,0.0006648949,0.00003679955,0.0005123232,0.0130948555],"genre_scores_gemma":[0.94439775,0.000007582941,0.040686063,0.008208253,0.00024329423,0.00014783377,0.00010084445,0.00003556273,0.0061728065],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975906,0.00007674666,0.00039942178,0.0010622703,0.0005070529,0.0003639331],"domain_scores_gemma":[0.9969095,0.000065767075,0.00022057485,0.0023951086,0.00028549987,0.00012357126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000317879,0.00032628875,0.00045448585,0.000098439246,0.000063631975,0.0005191122,0.0019329941,0.00031712189,0.000062553554],"category_scores_gemma":[0.000031436164,0.0002647456,0.00020952376,0.00019917924,0.000027312257,0.00016441582,0.0010947657,0.0004578296,0.0005075464],"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.000016149228,0.0002796728,0.0007461467,0.0010504638,0.00009259967,0.000118912954,0.00030282311,0.06151444,0.000285891,0.05920642,0.84702593,0.029360572],"study_design_scores_gemma":[0.00033992165,0.000038875813,0.0006018435,0.00038261653,0.000006618455,0.0000054683856,0.000009066742,0.72953486,0.00040838076,0.001790744,0.26630583,0.0005757532],"about_ca_topic_score_codex":0.00024337061,"about_ca_topic_score_gemma":0.000018471379,"teacher_disagreement_score":0.9437466,"about_ca_system_score_codex":0.00006466553,"about_ca_system_score_gemma":0.00037094564,"threshold_uncertainty_score":0.99998045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35846812,0.00023815913,0.52297014,0.000443624,0.0003947123,0.00040218973,0.00008159703,0.00009336934,0.116908096],"genre_scores_gemma":[0.9886885,0.0000011162001,0.009248119,0.000073919386,0.000009496718,0.0000024114365,0.0000023228167,0.0000021520104,0.001971934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996103,0.0000088913275,0.000110656,0.000111286536,0.00007460272,0.00008426522],"domain_scores_gemma":[0.9997143,0.0000164432,0.00003624987,0.0001780842,0.00003145538,0.000023479422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007117421,0.000038636426,0.00007460005,0.00001952745,0.000017023214,0.000035594887,0.00014086795,0.000014470485,0.00018566012],"category_scores_gemma":[0.0000020535513,0.000030893232,0.000013258157,0.00009535683,0.000009038463,0.00013783893,0.00004647857,0.00001922577,0.000038054648],"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.0000043017303,0.00008067319,0.10317369,0.00005947944,0.000046278936,7.985387e-7,0.00064744387,0.00040768352,0.0055309488,0.8769365,0.005612776,0.007499428],"study_design_scores_gemma":[0.0034771557,0.00062837993,0.08721045,0.00011903195,0.0000211393,0.000025649133,0.0009639228,0.32524598,0.017236425,0.0035674914,0.56070566,0.0007987184],"about_ca_topic_score_codex":0.00015272656,"about_ca_topic_score_gemma":0.000020255398,"teacher_disagreement_score":0.873369,"about_ca_system_score_codex":0.000003254777,"about_ca_system_score_gemma":0.000016301554,"threshold_uncertainty_score":0.2032848},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013515137,0.00007355072,0.9799425,0.00048839883,0.00056605635,0.00010145647,0.000030481964,0.00054133986,0.004741074],"genre_scores_gemma":[0.99282503,0.0000011238019,0.0066106557,0.00027105445,0.00015006497,0.0000050411254,0.000114416864,0.000007340387,0.000015290358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983744,0.00012470286,0.00038397583,0.0004333366,0.00025992686,0.00042364965],"domain_scores_gemma":[0.9987751,0.00012511379,0.00016713461,0.00064061483,0.00015571172,0.00013627404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004866463,0.0001667556,0.00023346384,0.00004561505,0.0003041806,0.0002842159,0.000720347,0.00007194776,0.0000073964225],"category_scores_gemma":[0.00010876786,0.00016440528,0.00009251501,0.0005081592,0.000041928313,0.00024801638,0.00013247914,0.0001417803,0.00014428815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037894902,0.00013186519,0.0044129696,0.000046676552,0.000033080345,0.000018393903,0.00020156297,0.004339879,0.00092592515,0.8521822,0.009272,0.12843165],"study_design_scores_gemma":[0.0005457289,0.000066592205,0.011562652,0.000089178495,0.0000067551323,0.000041606203,0.000033088054,0.9203886,0.00079608726,0.004548011,0.061542377,0.0003793641],"about_ca_topic_score_codex":0.000017447008,"about_ca_topic_score_gemma":0.0000013864438,"teacher_disagreement_score":0.97930986,"about_ca_system_score_codex":0.000044150504,"about_ca_system_score_gemma":0.000033354892,"threshold_uncertainty_score":0.67042524},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04558579,0.00068636547,0.18197271,0.010896922,0.0036168175,0.0005001165,0.000007327364,0.00038685053,0.7563471],"genre_scores_gemma":[0.927074,0.000014670246,0.0031867027,0.0005271927,0.00003607656,0.000007721645,7.784214e-7,0.000003746818,0.06914908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932295,0.000035315556,0.00012529948,0.0001746952,0.00014208679,0.00019962936],"domain_scores_gemma":[0.9991691,0.00015078374,0.000034231995,0.00055769,0.00004827582,0.00003989566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026784744,0.00005638206,0.0000721845,0.000010625868,0.00012731556,0.0002302035,0.0005717178,0.000023480798,0.000033037624],"category_scores_gemma":[0.000015050755,0.0000326138,0.000034522327,0.00015522861,0.000017912731,0.000094570525,0.00008213905,0.00006605588,0.0011258143],"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.0000046757596,0.000014252666,0.0010650564,0.0000067777337,0.000012752,0.0000051625852,0.00007187366,0.000098340875,0.00038324652,0.88031214,0.07990093,0.038124785],"study_design_scores_gemma":[0.00022458816,0.000033696422,0.0009341053,0.000009175696,4.0678142e-7,0.000017714821,0.0000286959,0.042584118,0.00032310653,0.0042841583,0.9514578,0.00010245615],"about_ca_topic_score_codex":0.000045762474,"about_ca_topic_score_gemma":0.000009704076,"teacher_disagreement_score":0.88148826,"about_ca_system_score_codex":0.000014411624,"about_ca_system_score_gemma":0.000039003786,"threshold_uncertainty_score":0.9996519},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091578394,0.000047765683,0.90020984,0.0000399362,0.0007295043,0.0006309842,0.00012180017,0.00027199488,0.0063697966],"genre_scores_gemma":[0.98141056,0.000019078141,0.001642853,0.0000123731525,0.00007334303,0.000004989698,0.000010136052,0.000011152903,0.016815534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862444,0.000038192426,0.00017632644,0.00067086774,0.0000815868,0.00040857517],"domain_scores_gemma":[0.9977299,0.000061450555,0.0002990023,0.0015138958,0.00021752637,0.00017819891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030558216,0.00018380108,0.0002734112,0.000052543015,0.0007146617,0.00037317388,0.001972884,0.00012208965,0.0000069712537],"category_scores_gemma":[0.00006171827,0.00019009432,0.00010662209,0.00016064967,0.000104831764,0.0009927141,0.0002921801,0.00009706032,0.00013431851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014811491,0.0005889455,0.047502548,0.00043490625,0.0003041481,0.000645649,0.00068016205,0.07387791,0.0046656015,0.8456615,0.023557413,0.0019330668],"study_design_scores_gemma":[0.0011271446,0.000067538946,0.004083877,0.000083874445,0.000018499502,0.000007160084,0.000045403598,0.98891914,0.000083145314,0.00044779136,0.0048577045,0.00025871675],"about_ca_topic_score_codex":0.00084122224,"about_ca_topic_score_gemma":0.000038010035,"teacher_disagreement_score":0.91504127,"about_ca_system_score_codex":0.00008996247,"about_ca_system_score_gemma":0.00009448622,"threshold_uncertainty_score":0.7751821},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061324917,0.00009178236,0.9241144,0.0004288453,0.00090196927,0.00034507533,0.00018394899,0.00014927328,0.012459757],"genre_scores_gemma":[0.99524075,0.00003146053,0.0017048483,0.000027282362,0.00006580821,8.8148016e-7,0.000034507713,0.0000117164855,0.0028827419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981571,0.00011517093,0.00031581082,0.00094958773,0.00014598589,0.00031637153],"domain_scores_gemma":[0.99578774,0.000049259914,0.0007856338,0.0028651382,0.00035892922,0.00015329373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023534277,0.00030047158,0.00055749266,0.000143171,0.00027872785,0.00019148977,0.0027935815,0.00027401728,0.00001777777],"category_scores_gemma":[0.000037594225,0.000334022,0.00030125282,0.00023180891,0.00034738885,0.0004158906,0.0016837203,0.00042441554,0.00005003504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022482538,0.00014358056,0.00217344,0.00020597958,0.00011134166,0.00017676559,0.00036418843,0.16628669,0.000043902473,0.8281582,0.001975169,0.0003382617],"study_design_scores_gemma":[0.0006500794,0.0000365157,0.009192614,0.0003861726,0.00005045606,0.000007882898,0.000042068583,0.914821,0.00008748523,0.06655537,0.0076170773,0.0005532521],"about_ca_topic_score_codex":0.00074395153,"about_ca_topic_score_gemma":0.00015375506,"teacher_disagreement_score":0.93391585,"about_ca_system_score_codex":0.00011268722,"about_ca_system_score_gemma":0.0001834091,"threshold_uncertainty_score":0.9999112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017416603,0.000018667566,0.9281523,0.00069202675,0.0002465601,0.000041082043,0.0000024805724,0.0001292525,0.06897596],"genre_scores_gemma":[0.98135567,4.1593933e-7,0.01578104,0.00033484033,0.00010714369,9.049374e-7,0.0000012041222,0.0000014201667,0.0024173623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995786,0.000010574509,0.00009408896,0.00013403148,0.00009016811,0.00009256279],"domain_scores_gemma":[0.9995013,0.000016192502,0.000020462096,0.00033676863,0.00008786827,0.00003742049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060337537,0.00003657533,0.00004718219,0.0000156104,0.00013475257,0.00013126737,0.00030367152,0.000016154767,0.000104330866],"category_scores_gemma":[0.0000154977,0.000028390685,0.000017225007,0.00021507594,0.000023580204,0.00020119899,0.000058120328,0.000019789182,0.00059189583],"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":[6.5952685e-7,0.000027539698,0.00048881304,0.0000034505374,0.00000442745,0.000002311333,0.00014827216,0.00004662901,0.00048446478,0.92137617,0.04276098,0.034656286],"study_design_scores_gemma":[0.0001152293,0.000038566723,0.0021118117,0.000013359151,7.0044007e-7,0.0000051204006,0.0000042532524,0.2567815,0.0005574309,0.002641854,0.7376302,0.00009998287],"about_ca_topic_score_codex":0.000015400918,"about_ca_topic_score_gemma":0.000010517694,"teacher_disagreement_score":0.979614,"about_ca_system_score_codex":0.000008810479,"about_ca_system_score_gemma":0.000013928189,"threshold_uncertainty_score":0.76078206},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019650827,0.00006124529,0.19236894,0.0002631131,0.00086350064,0.07088566,0.0006965511,0.0005674649,0.7323285],"genre_scores_gemma":[0.015631378,0.000012869862,0.47303855,0.00038818733,0.0051688473,0.031335995,0.00040057985,0.00042031065,0.47360328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981385,0.000004405369,0.0006497151,0.0005466234,0.00032651718,0.00033423514],"domain_scores_gemma":[0.99879014,0.00008966867,0.00048114505,0.00046829967,0.00007025733,0.00010045981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060392596,0.00038729317,0.0006577024,0.000044880624,0.00017432461,0.00023734507,0.00043108506,0.00087339163,0.000011489012],"category_scores_gemma":[0.000011662348,0.0003571782,0.00030338,0.000031534913,0.00010739933,0.00006603199,0.00020687758,0.00043315525,0.000010466676],"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.00001604713,0.000028614988,0.000001234617,0.00027244817,0.00005728397,6.702824e-7,0.0012182266,0.000002642561,0.000038911807,0.9868592,0.0061449213,0.0053598066],"study_design_scores_gemma":[0.0046477118,0.00031990116,0.0000046419727,0.0016018905,0.00007719134,0.000013193774,0.00021506443,0.0050241267,0.00033999892,0.6965898,0.28977725,0.0013892173],"about_ca_topic_score_codex":0.0000064814117,"about_ca_topic_score_gemma":0.000005102816,"teacher_disagreement_score":0.29026937,"about_ca_system_score_codex":0.00009381562,"about_ca_system_score_gemma":0.00009592346,"threshold_uncertainty_score":0.999888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042366316,0.00014672331,0.9862783,0.00006404754,0.0017916684,0.00066968385,0.000061265084,0.00013271024,0.0066189812],"genre_scores_gemma":[0.89848554,0.00003372757,0.074096516,0.00014891419,0.0004775028,0.0005899569,0.008722197,0.000048137314,0.017397474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982353,0.00003314949,0.00057810056,0.0006677839,0.00027436737,0.00021130007],"domain_scores_gemma":[0.99747324,0.000060160288,0.00068537385,0.0011293965,0.00059250736,0.000059339287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039166858,0.00019208332,0.00034538735,0.000089177986,0.00009416749,0.00006433565,0.0006998585,0.00022111333,0.000005376035],"category_scores_gemma":[0.000047880556,0.00017991435,0.000138519,0.0002506585,0.000010787948,0.00016553208,0.000030454794,0.00007800788,0.000014459421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024513694,0.00042175793,0.00013168399,0.0072968267,0.00017617365,9.4049284e-7,0.0022302836,0.00035786052,0.00704528,0.8354079,0.01623484,0.1304513],"study_design_scores_gemma":[0.0010814477,0.00030726046,0.0016935865,0.0009182347,0.00008154402,0.0000037146767,0.00024171568,0.85128736,0.0045373556,0.002247305,0.1369491,0.0006513729],"about_ca_topic_score_codex":0.00013550531,"about_ca_topic_score_gemma":0.00012128944,"teacher_disagreement_score":0.9121818,"about_ca_system_score_codex":0.000038115777,"about_ca_system_score_gemma":0.00006676967,"threshold_uncertainty_score":0.73366946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016639542,0.0011083683,0.977442,0.0025521836,0.0039739227,0.0007321163,0.000020950401,0.00022623538,0.0139275715],"genre_scores_gemma":[0.4771527,0.0007241017,0.49715233,0.008444222,0.0037178602,0.0004521738,0.00007558553,0.00034098708,0.011940056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943842,0.00009681353,0.000863652,0.0018004713,0.0017652619,0.001089576],"domain_scores_gemma":[0.9961538,0.000776549,0.0005142531,0.002137568,0.0002164947,0.00020139125],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002146777,0.0006350722,0.0006012891,0.00040580163,0.0016316114,0.0016144252,0.006850468,0.00023266267,0.00003133088],"category_scores_gemma":[0.00005928939,0.00046964793,0.00022159725,0.00091220834,0.00064501615,0.00072588003,0.0029417207,0.001408407,0.000054071657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000832735,0.000026200521,0.000017510385,0.00004398425,0.00002023859,0.0001329382,0.0008860069,0.06992212,0.000026076219,0.1500652,0.00031253227,0.7785389],"study_design_scores_gemma":[0.00038274567,0.00016578565,0.000028504843,0.00034242327,0.0000071390164,0.00023855867,7.9916305e-7,0.6568815,0.00009263142,0.070787646,0.27018917,0.000883048],"about_ca_topic_score_codex":0.000056751513,"about_ca_topic_score_gemma":0.00011356052,"teacher_disagreement_score":0.77765584,"about_ca_system_score_codex":0.00056888926,"about_ca_system_score_gemma":0.0006058281,"threshold_uncertainty_score":0.9997755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013732598,0.000058451264,0.97350234,0.00052929367,0.00012311486,0.00088485575,0.00009469549,0.00007270103,0.011001982],"genre_scores_gemma":[0.99064946,0.0000028101033,0.008263034,0.000043794586,0.000068344154,0.00014399037,0.000009671835,0.000005504305,0.0008134142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999195,0.000018441982,0.00023396894,0.00021754776,0.00014870091,0.00018637544],"domain_scores_gemma":[0.9989704,0.00010244665,0.00013315013,0.00061376,0.00013843237,0.000041795985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028797938,0.00009014431,0.00016166095,0.000027576112,0.00007276674,0.00008809213,0.0007209592,0.000048682792,0.000020803842],"category_scores_gemma":[0.000019281779,0.000051575393,0.00019325184,0.0002712406,0.0000148176805,0.00027430826,0.00008675967,0.000060933166,0.000028481021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010069867,0.00048530052,0.03528742,0.00048453422,0.0007839966,9.575168e-7,0.0028601962,0.04522231,0.010587831,0.4011684,0.12687153,0.3761468],"study_design_scores_gemma":[0.0020069282,0.0009821636,0.026036428,0.00013118058,0.000031568205,0.00003219603,0.00068425183,0.8391838,0.0034247662,0.014777035,0.11207593,0.00063373125],"about_ca_topic_score_codex":0.00017845212,"about_ca_topic_score_gemma":0.000008591703,"teacher_disagreement_score":0.97691685,"about_ca_system_score_codex":0.000033390606,"about_ca_system_score_gemma":0.00008805715,"threshold_uncertainty_score":0.21031834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23921877,0.00015386751,0.7524205,0.000046570818,0.00045214422,0.00033888468,0.00029911273,0.00006803787,0.0070021385],"genre_scores_gemma":[0.9973542,0.00002561151,0.0011375386,0.00002696441,0.000024556117,5.3249266e-7,0.000020668502,0.0000075093403,0.0014023886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990518,0.000047569123,0.00016850187,0.000495581,0.000059780723,0.0001767337],"domain_scores_gemma":[0.9989421,0.000039823895,0.00020948172,0.0006393057,0.00010535514,0.00006394921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012288394,0.00014764936,0.000243566,0.000094477786,0.00005214908,0.00006467593,0.00064603024,0.000114456074,0.00003814751],"category_scores_gemma":[0.000006301959,0.0001611705,0.000072885574,0.00022645235,0.000049179198,0.000174823,0.0006634342,0.00016336724,0.000024199879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023630662,0.00015587317,0.05514081,0.00036490298,0.00026970354,0.000035521844,0.0006097139,0.28683475,0.00015283673,0.65388244,0.0018632233,0.0006665627],"study_design_scores_gemma":[0.0012180238,0.00012415538,0.008176133,0.0002402895,0.0000936466,0.0000049740956,0.00026397084,0.96231854,0.00030854813,0.009498055,0.017114038,0.0006395961],"about_ca_topic_score_codex":0.0004126361,"about_ca_topic_score_gemma":0.000048756534,"teacher_disagreement_score":0.75813544,"about_ca_system_score_codex":0.000035388002,"about_ca_system_score_gemma":0.00011299328,"threshold_uncertainty_score":0.65723425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5051309,0.00013202122,0.38092166,0.00057263405,0.003270608,0.050986752,0.0035523796,0.0006575171,0.05477554],"genre_scores_gemma":[0.9807557,0.000002342004,0.01576178,0.00039991268,0.00005571383,0.0020880091,0.00010683604,0.00003292918,0.0007968146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698037,0.00004337497,0.0013660112,0.00032676553,0.0006094213,0.0006740527],"domain_scores_gemma":[0.9969021,0.0001321821,0.0008808398,0.0013394151,0.00055942556,0.00018605376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047154614,0.00036285812,0.0006467296,0.00016503212,0.00012561132,0.00029216168,0.001503679,0.00021333888,0.000052625623],"category_scores_gemma":[0.00006739585,0.00031164306,0.00027649445,0.00034750008,0.00010911718,0.0009818944,0.00040823087,0.00027856528,0.0003128594],"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.0020705624,0.005621121,0.085999906,0.016572496,0.0021259207,0.000114349365,0.13141923,0.0034711899,0.014168037,0.449979,0.20067343,0.08778477],"study_design_scores_gemma":[0.0142767355,0.0017060046,0.003214282,0.0022103183,0.00003132065,0.00026189775,0.0036032859,0.101921014,0.016089775,0.0011334355,0.8536893,0.0018626365],"about_ca_topic_score_codex":0.0000124428725,"about_ca_topic_score_gemma":0.0000013884021,"teacher_disagreement_score":0.65301585,"about_ca_system_score_codex":0.00006605134,"about_ca_system_score_gemma":0.00013038937,"threshold_uncertainty_score":0.99993354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88689107,0.0001657234,0.0047544846,0.0068647466,0.0018607783,0.0015435073,0.000011847213,0.00017110574,0.09773674],"genre_scores_gemma":[0.9949233,0.0000023834114,0.0025548765,0.00038716616,0.000036776593,0.00003113554,1.4361933e-7,0.000005573039,0.0020586255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989311,0.0000029412627,0.00021023398,0.00026767407,0.00036472094,0.00022330505],"domain_scores_gemma":[0.99942124,0.000010762766,0.000119633594,0.00024095125,0.0001365907,0.00007082805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021488089,0.00010372165,0.00015842692,0.00003777588,0.000044165015,0.0000900356,0.001339107,0.000028268909,0.000012777512],"category_scores_gemma":[0.000019485553,0.00006836665,0.00007728317,0.000381958,0.000012384014,0.00023216405,0.00045742164,0.000067958135,0.00015455727],"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.000032243388,0.00027657708,0.028263656,0.0003302663,0.00008371922,9.42801e-7,0.0034463909,0.00020838174,0.27475414,0.60883945,0.059591945,0.024172263],"study_design_scores_gemma":[0.0019809487,0.0005614014,0.04001458,0.0008979381,0.000022360035,0.000044899538,0.00051154516,0.007158541,0.4832112,0.009037692,0.4556716,0.00088731793],"about_ca_topic_score_codex":0.00002759643,"about_ca_topic_score_gemma":6.343724e-7,"teacher_disagreement_score":0.5998018,"about_ca_system_score_codex":0.000047565125,"about_ca_system_score_gemma":0.000017262573,"threshold_uncertainty_score":0.2787911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9005635,0.0002414818,0.0017336773,0.0030905595,0.0014345988,0.00096144853,0.0000134196,0.00017944547,0.091781914],"genre_scores_gemma":[0.9970585,0.0000043666296,0.0007876948,0.00014710483,0.000030805175,0.0000033650056,2.682273e-7,0.0000053275953,0.001962574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989882,0.0000031907798,0.00021680494,0.00024200573,0.00034787218,0.00020194321],"domain_scores_gemma":[0.9993966,0.000011371941,0.00018166754,0.00023752329,0.00012830303,0.000044509412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022060613,0.00010147729,0.00015202115,0.000029593986,0.00005070336,0.00009668509,0.0012930895,0.000028971124,0.000010896719],"category_scores_gemma":[0.00001550226,0.00006572293,0.00008881922,0.00027956403,0.000023034348,0.00027131432,0.00036865188,0.000079088,0.000054660068],"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.000016593374,0.00021634257,0.037235066,0.00031122973,0.00006929421,6.999347e-7,0.0014338058,0.00007890212,0.06313338,0.85302246,0.039503165,0.0049790614],"study_design_scores_gemma":[0.0039430447,0.00061087916,0.04235111,0.001093614,0.00004579095,0.000103757695,0.0009123377,0.031204296,0.43653375,0.02554924,0.45633855,0.001313642],"about_ca_topic_score_codex":0.000018721064,"about_ca_topic_score_gemma":1.6979106e-7,"teacher_disagreement_score":0.8274732,"about_ca_system_score_codex":0.000039887887,"about_ca_system_score_gemma":0.000018633233,"threshold_uncertainty_score":0.26801035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018610349,0.000052566225,0.97862846,0.00056760974,0.0005007547,0.00074578787,0.00021995118,0.00045912524,0.00021541891],"genre_scores_gemma":[0.9614253,3.38324e-7,0.03706672,0.00019448235,0.0000831121,0.000032016716,0.0011676735,0.000014808095,0.000015572221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982123,0.000058069923,0.00043593178,0.00059604907,0.00027376204,0.0004239218],"domain_scores_gemma":[0.998354,0.00019110336,0.0003075304,0.0006189909,0.00043544476,0.00009290477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003691428,0.00020032813,0.00027227122,0.00007544866,0.00025175355,0.00031278143,0.0008298416,0.000101039186,0.0000069574444],"category_scores_gemma":[0.00007775322,0.0002056312,0.00010829954,0.0006979856,0.000033769524,0.00028686377,0.00006489749,0.00011475866,0.00007651371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010545707,0.0008916548,0.03558107,0.0014348337,0.00013664401,0.000008386465,0.0006777611,0.19149798,0.010430371,0.61146665,0.0065303,0.1412389],"study_design_scores_gemma":[0.0011021153,0.00006264209,0.006632967,0.00009505087,0.000005337704,0.0000028408633,0.000041998148,0.9839385,0.0005969207,0.00053478894,0.006729087,0.00025773665],"about_ca_topic_score_codex":0.0000104839955,"about_ca_topic_score_gemma":0.0000014965786,"teacher_disagreement_score":0.94281495,"about_ca_system_score_codex":0.00013667044,"about_ca_system_score_gemma":0.00012520545,"threshold_uncertainty_score":0.8385397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013935237,0.00012760151,0.96145916,0.0008391682,0.0008793894,0.00029124378,8.706878e-7,0.00017330484,0.022294043],"genre_scores_gemma":[0.9719777,0.0000031843897,0.021449836,0.00095517794,0.00009228229,0.00001225495,0.000007860912,0.000008637397,0.0054930327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860907,0.000058156125,0.00035769862,0.00040004557,0.00014937385,0.00042566503],"domain_scores_gemma":[0.99905837,0.00019433846,0.00010226573,0.0005281356,0.000047953898,0.000068945315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038671697,0.00015901237,0.00024285431,0.000048508653,0.000046086465,0.00012593935,0.0005479002,0.000073759904,0.000065677916],"category_scores_gemma":[0.000015103236,0.00013357055,0.000047239402,0.0009920119,0.000012710333,0.00034950097,0.00014121225,0.00016647554,0.00022048912],"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.0000070524097,0.000039913684,0.008821953,0.000011094863,0.0000072217053,0.00000799039,0.00003114457,0.7715756,0.000010738824,0.20828353,0.003419832,0.0077838744],"study_design_scores_gemma":[0.0005101591,0.00002138659,0.037272234,0.000079934136,0.0000011924802,0.000006124992,0.0000065300505,0.9552983,0.0000072538237,0.0017458904,0.004861514,0.00018945306],"about_ca_topic_score_codex":0.00015281622,"about_ca_topic_score_gemma":0.000513903,"teacher_disagreement_score":0.9580425,"about_ca_system_score_codex":0.000025689771,"about_ca_system_score_gemma":0.000029801557,"threshold_uncertainty_score":0.5446849},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39541873,0.00004224967,0.6032764,0.00019792495,0.00040896804,0.00023562048,0.00000567262,0.00006012078,0.0003543078],"genre_scores_gemma":[0.9782651,0.0000020230277,0.021476742,0.00019750479,0.000046231205,0.0000040316086,0.0000011483525,0.000004904222,0.0000023068267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774736,0.00009594556,0.0003140257,0.00080293644,0.0004901031,0.0005496282],"domain_scores_gemma":[0.9988878,0.00011755782,0.000088797715,0.00055064895,0.00016372837,0.00019150479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008441861,0.00017981936,0.000261062,0.00011863521,0.0001777996,0.0006896088,0.001490174,0.00006802298,0.0000061891365],"category_scores_gemma":[0.000070429334,0.00015925083,0.000027618076,0.0016803534,0.000943368,0.00075111625,0.0011423829,0.00011169609,0.000019859985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001780173,0.000091679736,0.013771501,0.000046470934,0.000004504365,0.0000314131,0.00038295012,0.019750424,0.00031391354,0.9471617,0.000015483509,0.018412191],"study_design_scores_gemma":[0.0005516168,0.00006580951,0.012862538,0.000094907606,0.0000015925606,0.00007857531,0.000010103335,0.9716826,0.00012467848,0.0143002765,0.000015908852,0.00021140813],"about_ca_topic_score_codex":0.00006446635,"about_ca_topic_score_gemma":0.000009379602,"teacher_disagreement_score":0.95193213,"about_ca_system_score_codex":0.00014738705,"about_ca_system_score_gemma":0.00014488814,"threshold_uncertainty_score":0.6649913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78471476,0.000072405775,0.21365109,0.0000406397,0.00021887933,0.00072102965,0.000011034223,0.000046958336,0.0005232019],"genre_scores_gemma":[0.9996677,0.00011263077,0.00009105661,0.000043672735,0.000006298065,0.0000034399282,0.0000059328218,0.0000064143424,0.00006285533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998327,0.00038411948,0.00032566098,0.00062178087,0.0001014585,0.00023998604],"domain_scores_gemma":[0.99740404,0.00025406663,0.00040967006,0.001723888,0.00015022549,0.00005812637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044836797,0.00021145339,0.00052683393,0.00016586545,0.000055736215,0.000054993252,0.0017867928,0.00019024544,0.000007514268],"category_scores_gemma":[0.000032794887,0.00023946134,0.00010057529,0.00043715074,0.000035203113,0.0003746826,0.00072985265,0.00045824025,0.000013831924],"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.00028750979,0.0013925809,0.45421278,0.00024020449,0.00016407804,0.000054704873,0.0024692619,0.5240397,0.000028878409,0.015561271,0.00014356781,0.0014054603],"study_design_scores_gemma":[0.003969192,0.00028029547,0.054688483,0.0003241997,0.000031683725,0.00000126636,0.00046955288,0.93915623,0.000047455545,0.00059278536,0.0001104011,0.00032847666],"about_ca_topic_score_codex":0.0015747701,"about_ca_topic_score_gemma":0.00048489304,"teacher_disagreement_score":0.41511652,"about_ca_system_score_codex":0.00013495157,"about_ca_system_score_gemma":0.00011194692,"threshold_uncertainty_score":0.97649497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39364234,0.000048482143,0.6035488,0.0000712835,0.00004930468,0.0003907676,0.000014579984,0.00013236892,0.0021020588],"genre_scores_gemma":[0.9968924,0.00001847521,0.00211787,0.00012180547,0.000023723438,0.0000031434474,0.0000040771774,0.0000070314522,0.0008114888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989373,0.000034007036,0.000096495474,0.00060844905,0.00007790741,0.00024580795],"domain_scores_gemma":[0.9988431,0.000042030795,0.00006412988,0.00063308707,0.00011832987,0.00029936078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011997158,0.00014307264,0.00017134362,0.00010876894,0.00012942003,0.000099058794,0.00054991856,0.000056489956,0.0000073197884],"category_scores_gemma":[0.0000055312603,0.00013692504,0.000037486785,0.0009295406,0.000048716192,0.0004056489,0.00016392159,0.00009750724,0.00011187073],"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.00004965121,0.00019285698,0.06204143,0.0000689411,0.00009310274,0.00015476016,0.0006168935,0.008627695,0.00027779053,0.9190835,0.00046475034,0.008328636],"study_design_scores_gemma":[0.008529936,0.0019323973,0.14353272,0.00049053895,0.00023281708,0.00033919845,0.0019097709,0.6341229,0.0012361066,0.04092168,0.16228658,0.004465352],"about_ca_topic_score_codex":0.00035450706,"about_ca_topic_score_gemma":0.00012281242,"teacher_disagreement_score":0.8781618,"about_ca_system_score_codex":0.000045709574,"about_ca_system_score_gemma":0.00007039329,"threshold_uncertainty_score":0.55836415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99100786,0.0002397503,0.001567498,0.0020132342,0.00022670646,0.001248617,0.000035190573,0.0003550024,0.0033061232],"genre_scores_gemma":[0.98636454,0.0000016835489,0.012834058,0.00006398015,0.00004468348,0.000070608396,0.000005429519,0.000017479604,0.00059753755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998329,0.0000095081095,0.0002674481,0.00045009286,0.0005355319,0.00040843122],"domain_scores_gemma":[0.9984663,0.000045646833,0.0003325861,0.0008431523,0.00025546347,0.000056838457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998181,0.00022232239,0.0002852264,0.00005727434,0.00010350919,0.00024711664,0.003140857,0.00007147983,0.000007292163],"category_scores_gemma":[0.00019528241,0.00012792699,0.00009885911,0.0006152549,0.00007691483,0.00041064876,0.00062423496,0.00021983396,0.00002303531],"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.00040239838,0.0012012012,0.35046875,0.0021777337,0.00053777924,0.000020673078,0.0060144337,0.00017631153,0.03875613,0.39285743,0.011071536,0.19631563],"study_design_scores_gemma":[0.012263714,0.007175409,0.24200845,0.010984023,0.000302979,0.00048399408,0.020498289,0.009910212,0.54636186,0.0072152126,0.13743557,0.0053602927],"about_ca_topic_score_codex":0.000028153752,"about_ca_topic_score_gemma":0.0000016958465,"teacher_disagreement_score":0.50760573,"about_ca_system_score_codex":0.000037343587,"about_ca_system_score_gemma":0.000033648234,"threshold_uncertainty_score":0.5836546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030452026,0.001992412,0.9644836,0.0005371438,0.0014309208,0.000067475885,0.0000010002917,0.00002385931,0.0010115393],"genre_scores_gemma":[0.96286505,0.00021708886,0.035514038,0.00017841606,0.0009181234,0.0000019564739,6.9955024e-7,0.000011481346,0.0002931667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829656,0.000071214134,0.00073180295,0.00017316088,0.0003800655,0.00034722287],"domain_scores_gemma":[0.9989467,0.00007357087,0.00041933733,0.00023742307,0.00018096736,0.00014198458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552914,0.0001342309,0.00034671108,0.00016029413,0.00006146056,0.00016855149,0.00076526706,0.000078151636,0.000010915096],"category_scores_gemma":[0.000041018775,0.00011020897,0.00012239788,0.000663971,0.000021417987,0.0006671751,0.000066711626,0.00039285934,0.0000062309514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050322644,0.00033875817,0.009234882,0.000017269913,0.000072042436,0.0046659606,0.0013055502,0.16193236,0.0001971418,0.0012681535,0.0069854693,0.81393206],"study_design_scores_gemma":[0.0011844102,0.0001425717,0.009000627,0.00024455183,0.000004578829,0.002750073,0.000077221644,0.9537213,0.000026201282,0.00020026235,0.032457426,0.00019077884],"about_ca_topic_score_codex":0.00003259725,"about_ca_topic_score_gemma":0.0000057388947,"teacher_disagreement_score":0.932413,"about_ca_system_score_codex":0.00008427303,"about_ca_system_score_gemma":0.000069422575,"threshold_uncertainty_score":0.44941917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15753046,0.00013317874,0.83449686,0.00024618575,0.001282796,0.00022539102,0.000056564302,0.0004543937,0.005574199],"genre_scores_gemma":[0.9946917,0.0000030347148,0.0045864806,0.00020029715,0.0001132247,0.0000028776021,0.00014331084,0.000011617501,0.00024744292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799323,0.000082192455,0.00040285997,0.000600575,0.00037325456,0.0005478711],"domain_scores_gemma":[0.99858916,0.00011628872,0.00018226643,0.00083970145,0.00014090426,0.00013170532],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042141226,0.0002117359,0.0002992387,0.0000645227,0.00022514146,0.00033384623,0.0011284316,0.00010475283,0.00005061366],"category_scores_gemma":[0.000035585126,0.00020584176,0.00011537119,0.0007278445,0.000016956592,0.00044124314,0.00038322128,0.00022813812,0.00093255745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084481166,0.00087179453,0.070120014,0.00039786153,0.00025226697,0.00027987675,0.0021546527,0.08303803,0.023491276,0.39290664,0.080480486,0.34592262],"study_design_scores_gemma":[0.00089542224,0.000102525526,0.007024153,0.00015158016,0.000004180744,0.00005144571,0.00007208163,0.9083718,0.0011815164,0.0008634601,0.080790885,0.0004909195],"about_ca_topic_score_codex":0.000032814016,"about_ca_topic_score_gemma":9.4524495e-7,"teacher_disagreement_score":0.83716124,"about_ca_system_score_codex":0.0001068917,"about_ca_system_score_gemma":0.00006711119,"threshold_uncertainty_score":0.9998453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13904782,0.00006279045,0.8579416,0.000057086974,0.0008600198,0.0005991964,0.000042958167,0.00020342434,0.0011850635],"genre_scores_gemma":[0.9884093,0.00000532685,0.0087248385,0.0001096453,0.000080226506,0.0000048630236,0.000043296906,0.000017791117,0.0026047146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811864,0.00005116025,0.00027877113,0.0010434794,0.00008659761,0.00042137565],"domain_scores_gemma":[0.9983199,0.000077356824,0.0003263245,0.00091665384,0.00022897933,0.00013075162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024890713,0.0003148821,0.0004076469,0.000114831615,0.0001726637,0.00017962464,0.001553698,0.00030502837,0.000008578964],"category_scores_gemma":[0.00002225668,0.00034343943,0.00017286836,0.00024707124,0.00003254706,0.0002571434,0.0011931028,0.00037289932,0.000052880805],"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.000052732106,0.00007465495,0.0041155457,0.00039685264,0.00022992966,0.00011961114,0.0010027301,0.7785588,0.00009299511,0.20452651,0.0027286147,0.008101049],"study_design_scores_gemma":[0.00091743947,0.000040401646,0.0032700382,0.00017088847,0.000022539347,0.0000043094838,0.00009124004,0.9436924,0.00011545405,0.004254343,0.046835203,0.0005857499],"about_ca_topic_score_codex":0.000048754217,"about_ca_topic_score_gemma":0.000019765761,"teacher_disagreement_score":0.8493615,"about_ca_system_score_codex":0.00035862878,"about_ca_system_score_gemma":0.00059718156,"threshold_uncertainty_score":0.9999018},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03941114,0.00042988054,0.9278607,0.0022075432,0.0064517455,0.0036985124,0.008107217,0.0012989505,0.010534308],"genre_scores_gemma":[0.95605195,0.00012889014,0.035180036,0.0028393003,0.00080771814,0.00045448338,0.004066121,0.00012788732,0.00034364275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99339235,0.00010051405,0.0028090803,0.001086162,0.0011497914,0.0014620778],"domain_scores_gemma":[0.99457705,0.00016196372,0.001577528,0.0022763393,0.00075764145,0.0006494824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007528017,0.0012442087,0.0016401979,0.0003431648,0.0004692986,0.0019716641,0.0044107176,0.0009188413,0.000023184159],"category_scores_gemma":[0.00011804228,0.001190473,0.0009682736,0.00054325745,0.00021914682,0.0015755001,0.003330688,0.001814515,0.00034834418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013468018,0.0035511015,0.007515792,0.04064166,0.0070761587,0.0010752634,0.13899735,0.017914327,0.0012799164,0.20724548,0.26086366,0.3124925],"study_design_scores_gemma":[0.004165834,0.0002520491,0.0003624894,0.0013860093,0.00010546335,0.00020862631,0.0009317861,0.63280624,0.00047056476,0.0008408719,0.35641086,0.00205921],"about_ca_topic_score_codex":0.00007248882,"about_ca_topic_score_gemma":0.000012439316,"teacher_disagreement_score":0.91664076,"about_ca_system_score_codex":0.00016145568,"about_ca_system_score_gemma":0.000570798,"threshold_uncertainty_score":0.9990644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021612057,0.0000367246,0.6341596,0.0005007173,0.00053721963,0.00007199083,7.436114e-7,0.00016981467,0.34291112],"genre_scores_gemma":[0.9833447,4.8963574e-7,0.0042711394,0.00031815542,0.000015106185,0.0000015135545,4.5610477e-7,0.0000012468913,0.012047239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996314,0.000006174391,0.00006023237,0.0001242878,0.00008469725,0.0000931924],"domain_scores_gemma":[0.9996286,0.000008988304,0.000013123562,0.0003040222,0.000018016051,0.000027260989],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005718043,0.00003259091,0.000049941293,0.000011129909,0.000012416891,0.000059090147,0.00033356002,0.000015068259,0.000103986786],"category_scores_gemma":[0.0000017895368,0.000024851784,0.00001932707,0.00010477011,0.0000027298233,0.00018982991,0.000051704836,0.000023476736,0.0028321538],"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":[3.9033802e-7,0.0000147572755,0.0023852123,0.0000055579894,0.000003241092,0.0000028281318,0.00006070229,0.000045276567,0.000740777,0.9712512,0.010084598,0.015405495],"study_design_scores_gemma":[0.00037466292,0.000049885708,0.009874329,0.0000143378,5.2464367e-7,0.000015012238,0.000024345742,0.12084034,0.0012517325,0.0022230002,0.86511505,0.00021677939],"about_ca_topic_score_codex":0.000013613687,"about_ca_topic_score_gemma":0.0000011049659,"teacher_disagreement_score":0.9690282,"about_ca_system_score_codex":0.000004592657,"about_ca_system_score_gemma":0.000009727683,"threshold_uncertainty_score":0.99794424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9580981,0.002960375,0.00037405195,0.028866671,0.0011638749,0.002132726,0.000008869103,0.00026754508,0.006127788],"genre_scores_gemma":[0.99187213,0.000023057672,0.0067185857,0.00025188227,0.0001208964,0.00006519483,8.628038e-7,0.000009047913,0.0009383539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988001,0.000013890869,0.00024437107,0.00030532735,0.00034980415,0.0002864871],"domain_scores_gemma":[0.99890995,0.000058116042,0.00025758703,0.00060200243,0.00014462149,0.000027697579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060085545,0.00013869189,0.00016569487,0.000041228068,0.0001273302,0.00032975365,0.0026464544,0.000078059165,0.0000025331046],"category_scores_gemma":[0.00020352943,0.000072380644,0.000073375806,0.0005487605,0.000038350503,0.00030612177,0.00044091785,0.00018994542,0.000016402795],"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.00009455621,0.0004131252,0.06807125,0.00060867664,0.00009084085,0.0000042235365,0.010963132,0.000064902044,0.014114214,0.53371257,0.014826006,0.35703653],"study_design_scores_gemma":[0.0051061944,0.0022597306,0.08775471,0.0038741261,0.00008640006,0.00015009734,0.033166736,0.01277656,0.12255526,0.105799444,0.6238384,0.002632316],"about_ca_topic_score_codex":0.000025018326,"about_ca_topic_score_gemma":0.000005489262,"teacher_disagreement_score":0.6090124,"about_ca_system_score_codex":0.000034277822,"about_ca_system_score_gemma":0.00002657851,"threshold_uncertainty_score":0.49178147},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053461462,0.00682018,0.31413665,0.5887631,0.0061721955,0.008419158,0.0010335973,0.009850449,0.011343205],"genre_scores_gemma":[0.98198026,0.00003646108,0.008873872,0.0072476356,0.00054747134,0.00047669382,0.00016134321,0.000055843877,0.0006204118],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966456,0.00008501499,0.0005348228,0.0010613203,0.000749261,0.0009239607],"domain_scores_gemma":[0.9983235,0.000029502275,0.00023790385,0.00078307564,0.00012171455,0.000504281],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021062052,0.00038101096,0.0004063473,0.000043162774,0.00023118738,0.0006377368,0.0017475173,0.00016371865,0.000050049508],"category_scores_gemma":[0.000053487274,0.0003439498,0.00016221992,0.0014047632,0.00010998814,0.00062592677,0.00051272596,0.0003810441,0.00091559486],"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.000043543212,0.00021331593,0.0010442404,0.000047156365,0.000034254495,0.00011864988,0.00023554357,0.000021797005,0.0004871027,0.0030395926,0.86999696,0.12471784],"study_design_scores_gemma":[0.00076170155,0.0007383871,0.00015599058,0.00007855226,0.000007467536,0.000015767162,0.000082586586,0.05436031,0.002685677,0.00027890957,0.9403185,0.00051610736],"about_ca_topic_score_codex":0.000008716336,"about_ca_topic_score_gemma":0.0000036924803,"teacher_disagreement_score":0.92851883,"about_ca_system_score_codex":0.000046443678,"about_ca_system_score_gemma":0.00006913992,"threshold_uncertainty_score":0.99990124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033981176,0.00030692414,0.9547446,0.040116977,0.00006952785,0.00035724574,0.000089393056,0.00013916998,0.0007780438],"genre_scores_gemma":[0.99194336,0.00010709208,0.007243973,0.00052107096,0.000046081936,0.000057282952,0.000037340167,0.0000075203384,0.000036275746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987194,0.0000278316,0.00028959996,0.00046431492,0.00024001762,0.000258817],"domain_scores_gemma":[0.9992306,0.00001966425,0.00010880163,0.0003566866,0.000087262604,0.00019694587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012356264,0.00013417947,0.0002203133,0.000047307025,0.000065134474,0.000055893437,0.0004775321,0.000053787917,0.0000017685522],"category_scores_gemma":[0.000014926746,0.00012788411,0.000045333094,0.00060646486,0.000028874623,0.00028500898,0.0002668807,0.000086679815,0.000027273887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019287696,0.00024603278,0.007818163,0.00036015525,0.000093199444,0.00001946237,0.0027734754,0.005425624,0.0101874,0.69094366,0.0420009,0.23993902],"study_design_scores_gemma":[0.0010217724,0.0004325238,0.014422375,0.000109343906,0.000013890998,0.000008020262,0.00029900068,0.8417267,0.0012694095,0.0061246585,0.13403681,0.0005354519],"about_ca_topic_score_codex":0.00007135084,"about_ca_topic_score_gemma":0.00006610419,"teacher_disagreement_score":0.98854524,"about_ca_system_score_codex":0.000025002211,"about_ca_system_score_gemma":0.000018581704,"threshold_uncertainty_score":0.5214963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014052763,0.00060911145,0.8913287,0.000453662,0.0011941541,0.000114967515,0.000003629999,0.0003596967,0.09188333],"genre_scores_gemma":[0.9848543,0.0000019998947,0.011480288,0.00030865107,0.0001250526,0.000009056859,0.000002931422,0.0000034969999,0.003214257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992655,0.000021965865,0.00013044468,0.0001451714,0.00016643837,0.00027048448],"domain_scores_gemma":[0.99940914,0.000015867294,0.00003663918,0.0003743607,0.00003428418,0.0001297001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211904,0.00007334767,0.00009029241,0.000024298033,0.000067703615,0.00009416059,0.00042180778,0.00003930037,0.00012125335],"category_scores_gemma":[0.000009811172,0.000054201802,0.000036838785,0.0001752761,0.000008503497,0.0010154132,0.0001211403,0.00005090074,0.0005960597],"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.00000829117,0.000533465,0.02908222,0.00008522853,0.000044964465,0.000021715487,0.003328388,0.000060465485,0.0077962177,0.3141645,0.31153515,0.3333394],"study_design_scores_gemma":[0.0014180334,0.00008467696,0.11476538,0.00015834169,0.0000113159995,0.00014294797,0.00048104697,0.07572023,0.01913766,0.0011148755,0.78575903,0.0012064836],"about_ca_topic_score_codex":0.000018998768,"about_ca_topic_score_gemma":0.0000017281042,"teacher_disagreement_score":0.97080153,"about_ca_system_score_codex":0.00001692884,"about_ca_system_score_gemma":0.000014928072,"threshold_uncertainty_score":0.766134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015856767,0.00012809431,0.9954665,0.0006173626,0.0014794841,0.00021585586,0.000020499687,0.00017934204,0.00030723124],"genre_scores_gemma":[0.9908214,0.000017416443,0.00758066,0.00030438037,0.000063923064,0.00024834534,0.000007182738,0.000015030349,0.00094163895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984599,0.00013107949,0.00029326184,0.00044434756,0.00031057658,0.00036086683],"domain_scores_gemma":[0.99903995,0.00009278026,0.0000654729,0.0006984461,0.000028281138,0.00007508294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026179658,0.00015579528,0.00018804784,0.00019956427,0.00043574805,0.00009379638,0.0008447984,0.000058056256,0.00010640668],"category_scores_gemma":[0.0000081358085,0.00017161954,0.00008784239,0.0010777861,0.000025920166,0.00023799173,0.000020259638,0.00051666977,0.000019963798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026718715,0.00045715424,0.000041553856,0.000007753714,0.000026530366,0.0001317597,0.00054049713,0.29970634,0.000091395705,0.00040919814,0.0006761458,0.697885],"study_design_scores_gemma":[0.0009400753,0.0003958805,0.0014753505,0.000016537575,0.000009367015,0.0003023529,0.00015903114,0.9770865,0.00017028619,0.00048187212,0.018598456,0.0003642884],"about_ca_topic_score_codex":0.000118504635,"about_ca_topic_score_gemma":0.0000441344,"teacher_disagreement_score":0.98923576,"about_ca_system_score_codex":0.00021941,"about_ca_system_score_gemma":0.00006123986,"threshold_uncertainty_score":0.6998442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027819755,0.1290494,0.862761,0.0023296922,0.0002612835,0.0042321896,0.00023380137,0.00027363523,0.00058076903],"genre_scores_gemma":[0.8053547,0.013067829,0.1294239,0.0042832205,0.0013695208,0.034670677,0.003226987,0.00014466722,0.008458466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976015,0.00012902265,0.0009707851,0.00070995383,0.0002620418,0.00032666244],"domain_scores_gemma":[0.9958992,0.00018967477,0.00039337834,0.0030059442,0.00043721244,0.00007456019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011617563,0.000221681,0.0004941054,0.000045004374,0.00034994254,0.000372642,0.0014440519,0.00005597421,0.0000016761395],"category_scores_gemma":[0.000366878,0.00018570512,0.00012023134,0.00046802755,0.000027052667,0.0004537694,0.00019077715,0.00008901433,0.000060347204],"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.0000026475107,0.00032482613,0.0007940497,0.02050434,0.0000950542,0.0000055216738,0.00014431436,0.000839588,0.025301643,0.7807132,0.09461252,0.07666229],"study_design_scores_gemma":[0.00058741425,0.000072846626,0.0005554376,0.008341359,0.00006072635,0.00014726406,0.00006941827,0.067641795,0.00026922813,0.0002480658,0.9212731,0.00073330785],"about_ca_topic_score_codex":0.00072836375,"about_ca_topic_score_gemma":0.00002802472,"teacher_disagreement_score":0.82666063,"about_ca_system_score_codex":0.00009670246,"about_ca_system_score_gemma":0.00007683018,"threshold_uncertainty_score":0.7572835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106011756,0.0018657604,0.8803733,0.010232469,0.00009378926,0.00042333463,0.000025045956,0.00028219758,0.0006923334],"genre_scores_gemma":[0.9585064,0.000061245606,0.03991593,0.0013113313,0.00006488274,0.000020056665,0.000033422486,0.000009737112,0.00007697949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985638,0.00010861972,0.000417029,0.00045886284,0.0001479808,0.0003036972],"domain_scores_gemma":[0.9986901,0.000229732,0.00020482224,0.00038980585,0.00025674448,0.00022875305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032515705,0.0002126298,0.00030199028,0.000027359256,0.0005985969,0.000447107,0.0007391461,0.00010338788,0.0000041427315],"category_scores_gemma":[0.00009475106,0.00020222705,0.000038546947,0.0002373654,0.00007610415,0.00029144416,0.00061204337,0.0002822204,0.0000037016073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059846887,0.000048719023,0.0015765871,0.00013665698,0.00007715416,0.0000042960296,0.033479806,0.0009558838,0.00017981432,0.07677161,0.004352408,0.88235724],"study_design_scores_gemma":[0.0010846595,0.000113764756,0.0059754793,0.00021711913,0.000013061931,0.000017415652,0.0049544857,0.8977758,0.00006758905,0.0007554851,0.088542104,0.0004829992],"about_ca_topic_score_codex":0.000016340053,"about_ca_topic_score_gemma":0.000012912415,"teacher_disagreement_score":0.89681995,"about_ca_system_score_codex":0.00002016821,"about_ca_system_score_gemma":0.00014647478,"threshold_uncertainty_score":0.824658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076085906,0.0005827115,0.9528425,0.033799157,0.000773222,0.0004475524,0.00005497386,0.00086247956,0.0030288578],"genre_scores_gemma":[0.99597377,0.000029053872,0.0022432674,0.00085652404,0.000030390522,0.00014855016,0.0000012269315,0.000011476664,0.0007057151],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985768,0.000046272005,0.00035253968,0.0005682655,0.00014127378,0.00031484576],"domain_scores_gemma":[0.9984439,0.00006317875,0.000072942355,0.0011461619,0.00007593845,0.0001979017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001619116,0.00019046974,0.00033523914,0.00029542038,0.00022839408,0.00015299875,0.0015653948,0.00023721548,0.000022445543],"category_scores_gemma":[0.00007661169,0.00017656856,0.000053840147,0.0010841212,0.00005358302,0.00022928724,0.000024203582,0.00033950983,0.00023380878],"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.00014059621,0.00035250458,0.00055483665,0.00050686253,0.00045345206,0.000178004,0.0030927632,0.0047019147,0.012595422,0.25289065,0.026061138,0.69847184],"study_design_scores_gemma":[0.0049102083,0.0039645634,0.0006575656,0.0012567701,0.00008190557,0.0011742115,0.005219131,0.104315825,0.037658684,0.014823328,0.8231931,0.0027447517],"about_ca_topic_score_codex":0.00004760146,"about_ca_topic_score_gemma":0.000012986205,"teacher_disagreement_score":0.98836523,"about_ca_system_score_codex":0.000027021655,"about_ca_system_score_gemma":0.000029453126,"threshold_uncertainty_score":0.72002566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761398,0.0025127865,0.35650808,0.015784856,0.008079054,0.0023671759,0.00091005146,0.001838871,0.03585933],"genre_scores_gemma":[0.9602218,0.00000665787,0.039013773,0.0003484785,0.00011945817,0.000021621498,0.00008352811,0.000007504321,0.00017716688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866134,0.00005458185,0.00020933623,0.0005197296,0.00026153083,0.00029348806],"domain_scores_gemma":[0.99696445,0.00016276819,0.00010997485,0.002561674,0.000091091715,0.00011001365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018961649,0.00013969332,0.00017030668,0.000055606968,0.000113812544,0.00041525028,0.004416896,0.00006577851,0.000060289844],"category_scores_gemma":[0.00015854384,0.00011345786,0.000022483886,0.00032558193,0.00004425907,0.002135928,0.0010299855,0.0001328913,0.00084281864],"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.000014186789,0.0003716293,0.015542833,0.00014195463,0.0002846631,0.000108468994,0.0037683747,0.00043484825,0.0026472674,0.06992273,0.40524665,0.5015164],"study_design_scores_gemma":[0.0020694395,0.0003855864,0.12647663,0.00027005305,0.000060165603,0.00007180996,0.0009111066,0.54931545,0.0010861479,0.050111298,0.26714954,0.0020927843],"about_ca_topic_score_codex":0.0006003892,"about_ca_topic_score_gemma":0.000049909337,"teacher_disagreement_score":0.5488806,"about_ca_system_score_codex":0.000010024669,"about_ca_system_score_gemma":0.0000330165,"threshold_uncertainty_score":0.99993515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063907134,0.0021576574,0.9948345,0.00014888383,0.00018562784,0.0017642307,0.000097715485,0.00008155063,0.00009077758],"genre_scores_gemma":[0.97703785,0.00028874664,0.017636608,0.00015843923,0.00030882872,0.004181871,0.0003115033,0.000018834136,0.00005730715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843544,0.00003141442,0.00039419558,0.00064654154,0.00014458597,0.00034780067],"domain_scores_gemma":[0.99870306,0.000088737674,0.00014002025,0.0009070903,0.000049423787,0.000111685265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058551616,0.00013986915,0.00020772671,0.00004451113,0.00023958739,0.00038958722,0.0008962105,0.000091496986,3.3662468e-7],"category_scores_gemma":[0.000005848171,0.00013696485,0.000033913784,0.00030393072,0.00002831,0.00051670376,0.00029992635,0.00013942423,0.000003212395],"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.0000027814535,0.00017291727,0.000310126,0.000047731348,0.000018980787,0.0000035503015,0.00008745576,0.76347965,0.000009463042,0.041590564,0.00044200773,0.19383475],"study_design_scores_gemma":[0.00090318173,0.000029884985,0.0002165304,0.00008055045,0.0000070401843,0.000011393518,0.00020948946,0.95302296,0.0000014122623,0.0005290576,0.044802915,0.00018560408],"about_ca_topic_score_codex":0.00040347996,"about_ca_topic_score_gemma":0.00013563094,"teacher_disagreement_score":0.9771979,"about_ca_system_score_codex":0.00006794027,"about_ca_system_score_gemma":0.000039980678,"threshold_uncertainty_score":0.55852646},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024385842,0.00021445703,0.97244865,0.0010403323,0.00049252185,0.00023938177,0.000016575003,0.00059139443,0.00057086395],"genre_scores_gemma":[0.9717587,0.000018997469,0.027465096,0.00062418345,0.00009567499,0.0000047577455,0.0000033437739,0.000016979682,0.000012266494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828476,0.00009492787,0.0003629737,0.00060821197,0.00029480614,0.00035431067],"domain_scores_gemma":[0.9992047,0.00013311283,0.00011669477,0.00021005904,0.00010150276,0.0002339424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958609,0.00023732042,0.00028598786,0.0000718606,0.0005030364,0.0003221741,0.00034626442,0.00011059767,0.000007152832],"category_scores_gemma":[0.0000046907826,0.00023607978,0.00009440886,0.00054586836,0.000022735414,0.0004496778,0.000009624118,0.00038801355,0.00003638214],"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.00010060833,0.00074867497,0.00026582513,0.0012852746,0.00041594493,0.00032452468,0.037125867,0.53162295,0.0033253178,0.014418021,0.0022858826,0.4080811],"study_design_scores_gemma":[0.0005746607,0.00014818892,0.000033647477,0.00006516492,0.000015770369,0.000058081136,0.00022232583,0.9925128,0.0018402218,0.00012882991,0.0041064215,0.0002938925],"about_ca_topic_score_codex":0.000018492034,"about_ca_topic_score_gemma":0.000008259645,"teacher_disagreement_score":0.94737285,"about_ca_system_score_codex":0.00003713612,"about_ca_system_score_gemma":0.00005585903,"threshold_uncertainty_score":0.9627054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1281696,0.0001527792,0.8672358,0.0015966294,0.0013182614,0.00032435908,0.000035730576,0.00021400531,0.0009528346],"genre_scores_gemma":[0.9496452,4.269514e-7,0.04962245,0.00028766043,0.00027007487,0.0000423468,0.00002255228,0.000008506814,0.00010076083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.000050448838,0.00024477844,0.00033358595,0.00021941421,0.00026920994],"domain_scores_gemma":[0.9986327,0.00029111907,0.00017853986,0.0006409702,0.00019598978,0.000060677143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038886262,0.0001292874,0.00016662592,0.000062626284,0.00030753488,0.00035198234,0.0007938082,0.000064080916,0.000009774035],"category_scores_gemma":[0.00030095875,0.00011110449,0.000053377084,0.00023708995,0.00008282484,0.00030931755,0.000075120144,0.00004854836,0.00006262695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010104504,0.0015124156,0.017990503,0.0029448883,0.0003092928,0.000078595906,0.027949236,0.026988914,0.03715086,0.3994363,0.07455565,0.41007292],"study_design_scores_gemma":[0.0017113794,0.00038941798,0.007887671,0.00038737446,0.000028561777,0.0000076051783,0.00018828787,0.861808,0.01606373,0.00216501,0.10871011,0.00065283943],"about_ca_topic_score_codex":0.00004139633,"about_ca_topic_score_gemma":0.000037194426,"teacher_disagreement_score":0.8348191,"about_ca_system_score_codex":0.000028137945,"about_ca_system_score_gemma":0.00006207257,"threshold_uncertainty_score":0.45307097},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010497472,0.00025492656,0.97811383,0.008158016,0.000422927,0.0002025028,0.0002202555,0.00052250724,0.0016075508],"genre_scores_gemma":[0.99021244,0.0000024541705,0.0048615993,0.004370318,0.0002994316,0.000004848719,0.0002300457,0.000010691209,0.000008191987],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775565,0.00008811084,0.0005178376,0.0006468264,0.000444864,0.0005467417],"domain_scores_gemma":[0.99834853,0.00007337255,0.00021300571,0.0005413062,0.00014796654,0.00067578675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025609587,0.0002479645,0.00033713487,0.00003222398,0.00025948216,0.00038149112,0.0013751889,0.000080401966,0.000025602087],"category_scores_gemma":[0.0002037278,0.0002468718,0.00012702476,0.00089417835,0.00003221435,0.0002701182,0.00041569665,0.00023873436,0.00029604815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050569335,0.0003874312,0.013709667,0.0003676348,0.00043042982,0.0004915656,0.0068418467,0.05235963,0.0034449107,0.2675298,0.54458714,0.109799385],"study_design_scores_gemma":[0.00081925583,0.00011067911,0.002489358,0.000047235757,0.000010208346,0.00001334397,0.00021328253,0.89862555,0.00056761253,0.00030963146,0.09629667,0.0004971496],"about_ca_topic_score_codex":0.000016046131,"about_ca_topic_score_gemma":4.7903745e-7,"teacher_disagreement_score":0.97971493,"about_ca_system_score_codex":0.00005151992,"about_ca_system_score_gemma":0.0001317116,"threshold_uncertainty_score":0.99999833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6150765,0.000053377455,0.35537514,0.00047473994,0.0019441553,0.0011885202,0.000029219416,0.0004936986,0.02536466],"genre_scores_gemma":[0.9970855,0.0000022980635,0.00047378396,0.000073067946,0.000030730942,0.00007657682,0.00004238152,0.000007863104,0.0022078017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979321,0.000103365186,0.0004719385,0.0007075321,0.00041184286,0.00037322272],"domain_scores_gemma":[0.9984261,0.000036887657,0.00014440082,0.0012305528,0.00007518134,0.00008687899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004030964,0.00017577027,0.00026860775,0.00010145676,0.000047011767,0.00030341465,0.000787004,0.000072955656,0.000005053384],"category_scores_gemma":[0.000027523967,0.00014048489,0.000042244785,0.0007136916,0.000020004742,0.0007465163,0.00009377462,0.00012988421,0.00013914044],"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.00006386385,0.0010867371,0.10403475,0.000183995,0.00003682714,0.002311469,0.0025818744,0.015586124,0.0018253485,0.8585573,0.009337755,0.0043939836],"study_design_scores_gemma":[0.0020764908,0.0007976439,0.043198727,0.00047629888,0.0000031349632,0.00088618515,0.001642992,0.8419647,0.0008581451,0.0008401768,0.10586106,0.00139444],"about_ca_topic_score_codex":0.0009899848,"about_ca_topic_score_gemma":0.00004674126,"teacher_disagreement_score":0.8577171,"about_ca_system_score_codex":0.00010000938,"about_ca_system_score_gemma":0.000097869495,"threshold_uncertainty_score":0.57288074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059457235,0.0013443809,0.93646497,0.00054995297,0.0011424411,0.0008277682,0.000013596607,0.00019392815,0.0000057446377],"genre_scores_gemma":[0.86348313,0.000003223604,0.13618192,0.000088345696,0.00014208432,0.00007824353,0.0000042965653,0.000018426274,3.4217288e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952269,0.0002925107,0.0008490555,0.001885886,0.0011305682,0.0006150767],"domain_scores_gemma":[0.99646455,0.0002599335,0.000774156,0.0015576442,0.00077136816,0.00017235335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016031719,0.0004932666,0.0009479751,0.0003559142,0.00018293607,0.00078436814,0.003778685,0.00022169361,3.5727797e-7],"category_scores_gemma":[0.0003129898,0.000377133,0.00009312413,0.0024012371,0.00063445617,0.00048159147,0.0022507673,0.00089466956,0.0000037462369],"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.000021575563,0.00005246815,0.00004814361,0.00069374143,0.000027436612,0.000021645381,0.018894153,0.96712095,0.0031881076,0.0008055972,5.5624395e-7,0.009125633],"study_design_scores_gemma":[0.0002632059,0.0001361397,0.000104791085,0.004324468,0.00000840405,0.00003109516,0.000036865607,0.9858253,0.007317433,0.0014610293,0.0000023160949,0.0004889469],"about_ca_topic_score_codex":0.0004202055,"about_ca_topic_score_gemma":0.000017267157,"teacher_disagreement_score":0.8040259,"about_ca_system_score_codex":0.0002166496,"about_ca_system_score_gemma":0.0010875874,"threshold_uncertainty_score":0.99986804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007027609,0.00015226344,0.9925911,0.0016734037,0.0003193184,0.00051682995,0.00004040578,0.00042694254,0.0035769672],"genre_scores_gemma":[0.98363334,0.0000017260703,0.015154228,0.0003262012,0.00005437941,0.000113015565,0.000010902579,0.000012024098,0.00069415726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987551,0.000024646188,0.0002904319,0.0005044331,0.00015451042,0.00027087695],"domain_scores_gemma":[0.9991909,0.000039919323,0.00009854294,0.00040883708,0.00010841952,0.00015336627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012895296,0.00013633705,0.00022216918,0.000024004497,0.000081109414,0.00020900478,0.0006590269,0.000052707746,0.000003895208],"category_scores_gemma":[0.000022637352,0.00011869177,0.00006991524,0.0003005026,0.00001366565,0.0002919337,0.00014035894,0.000065910564,0.00006629074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017408532,0.00014236977,0.00019825328,0.000693935,0.00024822773,0.000073390656,0.0023925789,0.018075451,0.01530219,0.8785918,0.020903684,0.06320406],"study_design_scores_gemma":[0.0003167077,0.0001249225,0.00008467397,0.000028977123,0.0000027681965,0.0000106149355,0.00011478652,0.98058295,0.0001042865,0.00007539022,0.018392554,0.00016134947],"about_ca_topic_score_codex":0.000026787822,"about_ca_topic_score_gemma":0.0000034931516,"teacher_disagreement_score":0.9829306,"about_ca_system_score_codex":0.000039373594,"about_ca_system_score_gemma":0.000028292077,"threshold_uncertainty_score":0.484011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026209394,0.00015079818,0.9590656,0.0014098434,0.0005713466,0.0008453192,0.000040987197,0.0004726602,0.0112340255],"genre_scores_gemma":[0.9947229,0.0000471054,0.0027098195,0.00022202494,0.000067959954,0.0000030654228,0.000023695427,0.000020367137,0.0021830432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739635,0.00038714719,0.00031163334,0.0013896655,0.0001550368,0.00036019325],"domain_scores_gemma":[0.99726194,0.00017373411,0.00049863727,0.0015866695,0.00021121882,0.00026779438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040419534,0.0004034375,0.0009701915,0.000116562085,0.00012726997,0.00021229831,0.0018208367,0.00024740482,0.000007867421],"category_scores_gemma":[0.00006065345,0.00037340992,0.00033869702,0.0005754672,0.00033698525,0.00014325707,0.0009966332,0.0005393125,0.00007330465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010618177,0.000075717115,0.00015147253,0.00027301826,0.0005871674,0.0038335503,0.00047917434,0.09003654,0.000019266605,0.8882334,0.0054365224,0.00025597008],"study_design_scores_gemma":[0.09042772,0.00008511639,0.00005164999,0.00051464303,0.0002336868,0.00005551482,0.00013563622,0.85641736,0.000056281082,0.04391164,0.006960807,0.0011499263],"about_ca_topic_score_codex":0.00018800618,"about_ca_topic_score_gemma":0.000018015891,"teacher_disagreement_score":0.96851355,"about_ca_system_score_codex":0.00012217292,"about_ca_system_score_gemma":0.0002805543,"threshold_uncertainty_score":0.9998718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051391786,0.000024306522,0.96431404,0.023081005,0.00045283316,0.00009571218,0.00007542445,0.00023277549,0.006584712],"genre_scores_gemma":[0.98061395,0.000007081333,0.015348213,0.0031803153,0.00020393009,0.000006762962,0.00020428874,0.000013990317,0.00042149116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982869,0.00012231055,0.00032606683,0.00045308837,0.0005814493,0.00023018297],"domain_scores_gemma":[0.99919903,0.00008115226,0.0001785055,0.00020409773,0.00017116829,0.00016605695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019479869,0.00019905948,0.00019865354,0.00007664971,0.00014828364,0.000354957,0.0009810022,0.00005290034,0.00027123],"category_scores_gemma":[0.000115886774,0.00018721187,0.00008065841,0.00016364749,0.00002197266,0.00022502661,0.00017666467,0.00063200016,0.00015998847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016814009,0.0006527342,0.010056496,0.00010539836,0.00018437473,0.0003698648,0.0028274294,0.20520464,0.005150482,0.66806203,0.0020421606,0.10517624],"study_design_scores_gemma":[0.000463553,0.00012213975,0.0009941634,0.00008060345,0.0000029714843,0.0000042655365,0.000051264593,0.9685887,0.00006563722,0.0007229689,0.028699962,0.00020374882],"about_ca_topic_score_codex":0.00008479983,"about_ca_topic_score_gemma":0.000013238453,"teacher_disagreement_score":0.9754748,"about_ca_system_score_codex":0.00006316257,"about_ca_system_score_gemma":0.00007604018,"threshold_uncertainty_score":0.76342785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030299008,0.000022458136,0.98527193,0.013349316,0.00009220435,0.00035053078,0.0000867227,0.000114529874,0.0006819924],"genre_scores_gemma":[0.7427048,4.4036398e-7,0.24511574,0.0117827775,0.00013503163,0.00012983663,0.00006320118,0.0000049467467,0.00006320406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994159,0.000014537222,0.00016882533,0.00015141064,0.00013644923,0.000112931244],"domain_scores_gemma":[0.9996966,0.000032901473,0.000025494472,0.00008522764,0.00008562317,0.00007416837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094228526,0.00006298745,0.00009469841,0.000012562019,0.0000695499,0.0001274726,0.00022828982,0.000027650185,0.000016011787],"category_scores_gemma":[0.000006135699,0.000052532512,0.00005363987,0.00009854554,0.0000069863568,0.00036247584,0.0000042499996,0.000029141114,0.00003793937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023725917,0.00008742327,0.000021599295,0.00006344608,0.000031347194,0.0000028059071,0.00054008944,0.0063041104,0.0005803032,0.31384984,0.012977446,0.66551787],"study_design_scores_gemma":[0.0013692734,0.00007242033,0.000022617114,0.000003665033,0.000001788663,8.324438e-7,0.0000072720745,0.95714676,0.0007076042,0.00006878924,0.040525984,0.00007301374],"about_ca_topic_score_codex":0.00000589693,"about_ca_topic_score_gemma":9.457213e-7,"teacher_disagreement_score":0.9508426,"about_ca_system_score_codex":0.000009837252,"about_ca_system_score_gemma":0.0000634348,"threshold_uncertainty_score":0.21422136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032029176,0.00048556525,0.95478714,0.006154424,0.0035102074,0.0016533276,0.000034982455,0.0006131898,0.03244088],"genre_scores_gemma":[0.93994915,0.000028160384,0.04850413,0.0020214606,0.0008993319,0.0007198144,0.000028749626,0.00004551315,0.007803706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655896,0.00017741924,0.0006596219,0.0012695354,0.00076029287,0.00057413685],"domain_scores_gemma":[0.9970174,0.000095886564,0.00025193862,0.002242056,0.00012167224,0.0002710381],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007982965,0.00043036471,0.0005213322,0.000088611756,0.00025841888,0.0014295955,0.0039497856,0.000164979,0.000011976981],"category_scores_gemma":[0.000020253396,0.00030341293,0.00019059627,0.00060625013,0.00002197028,0.00008214376,0.0046980022,0.00052623183,0.00032626712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010116228,0.00008709553,0.00007801063,0.0008576646,0.00041126876,0.00023216342,0.0028051676,0.1472247,0.000028444874,0.6489404,0.1436641,0.05566088],"study_design_scores_gemma":[0.0002107697,0.000038580845,0.00032638013,0.0007813894,0.000027213275,0.000014840863,0.00048202553,0.5196459,0.000014150483,0.0012380541,0.47653535,0.00068532355],"about_ca_topic_score_codex":0.0012384733,"about_ca_topic_score_gemma":0.000056519435,"teacher_disagreement_score":0.93962884,"about_ca_system_score_codex":0.000117798096,"about_ca_system_score_gemma":0.00006830713,"threshold_uncertainty_score":0.9999418},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1030829,0.000952254,0.8432946,0.038668554,0.0021526245,0.0036845298,0.0051508583,0.00045178458,0.0025618814],"genre_scores_gemma":[0.9873709,0.000016565133,0.011559863,0.0006270666,0.000116860974,0.0000795079,0.000057573972,0.000016701257,0.00015492745],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982187,0.000007837443,0.00041303213,0.0005910806,0.0004179991,0.00035135465],"domain_scores_gemma":[0.9987673,0.000054228225,0.0003165043,0.00050835323,0.00021750678,0.00013611563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031902775,0.00019347729,0.00029766042,0.000016367381,0.00018013935,0.00032925358,0.003231648,0.00005620358,0.000004975122],"category_scores_gemma":[0.00022714538,0.00013404392,0.00011847201,0.00042507655,0.00008869632,0.0008268354,0.0014606233,0.000114551105,0.000010491246],"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.0005133031,0.0006616146,0.012949405,0.0018854141,0.0005164725,0.000004527071,0.0038485462,0.0009054827,0.017452039,0.08340915,0.83825266,0.03960135],"study_design_scores_gemma":[0.004387758,0.00078644906,0.0045539793,0.0006815166,0.00014369699,0.000035293586,0.00044611804,0.27306998,0.031229625,0.01031868,0.67319393,0.0011529578],"about_ca_topic_score_codex":0.000026173442,"about_ca_topic_score_gemma":0.000001377912,"teacher_disagreement_score":0.884288,"about_ca_system_score_codex":0.00005099909,"about_ca_system_score_gemma":0.000053514585,"threshold_uncertainty_score":0.600526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011460928,0.0017390676,0.98155946,0.0008298668,0.003398707,0.00054017943,0.00007923898,0.00019488644,0.0001976666],"genre_scores_gemma":[0.9902757,0.0001818876,0.00865885,0.00015806721,0.000179557,0.00006702874,0.0000104820965,0.000024920659,0.00044353292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978255,0.000110616515,0.00046103392,0.000821984,0.00029070073,0.00049016933],"domain_scores_gemma":[0.9981628,0.0004892866,0.00020442609,0.0007919214,0.00022630252,0.00012523207],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005059566,0.00034592696,0.0004130115,0.000070187976,0.0013493742,0.0012766639,0.00084581616,0.00027100998,0.00000267716],"category_scores_gemma":[0.000009601222,0.00027757513,0.000272398,0.00020941753,0.000043425513,0.000116756266,0.00003845559,0.0007514781,0.0000026621392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005512296,0.00038945847,0.000017089847,0.00095488306,0.0007271517,0.00010951043,0.0052051567,0.34965968,0.00032741163,0.010560275,0.00245212,0.6295421],"study_design_scores_gemma":[0.00049435673,0.000075950964,0.00002162026,0.00048258083,0.00004277388,0.000078632664,0.0003758454,0.98178583,0.0019695817,0.0006976169,0.0134886,0.00048660993],"about_ca_topic_score_codex":0.00007361905,"about_ca_topic_score_gemma":0.00019012198,"teacher_disagreement_score":0.9788147,"about_ca_system_score_codex":0.000052819756,"about_ca_system_score_gemma":0.00019636609,"threshold_uncertainty_score":0.99996763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012227542,0.00008048883,0.9046107,0.0034892892,0.00031926064,0.00006714655,0.0000026869468,0.00021288957,0.08999481],"genre_scores_gemma":[0.97122353,0.000006691794,0.023418551,0.0038859884,0.00025800808,0.0000054492257,0.000003710765,0.0000049362566,0.0011931184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991922,0.00001885732,0.00015495053,0.00028725664,0.00015558551,0.00019116476],"domain_scores_gemma":[0.99954057,0.000020900423,0.00003905099,0.00024383343,0.000035791832,0.00011983669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009203731,0.0000787316,0.000113795686,0.000012838391,0.0000695449,0.00017446918,0.0005312852,0.00003357109,0.0001280204],"category_scores_gemma":[0.000014977095,0.00006829201,0.000043748256,0.00029531182,0.0000072752914,0.0003634605,0.00012596046,0.00007730079,0.00026433376],"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.000010683454,0.00007355273,0.0019474088,0.00007197454,0.000045826284,0.00011551953,0.001579111,0.0020870885,0.0026450083,0.24197662,0.4759549,0.2734923],"study_design_scores_gemma":[0.00026401784,0.00007785046,0.00041558236,0.0000175429,0.0000014792731,0.0000095392925,0.000023806351,0.37999102,0.001075109,0.0005268887,0.6173805,0.00021666697],"about_ca_topic_score_codex":0.000041768864,"about_ca_topic_score_gemma":0.0000032932833,"teacher_disagreement_score":0.9700008,"about_ca_system_score_codex":0.000013035546,"about_ca_system_score_gemma":0.000027498012,"threshold_uncertainty_score":0.3397564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005662937,0.00006559802,0.9458897,0.0068353484,0.000088646935,0.000030927957,9.832573e-7,0.00022542741,0.04629707],"genre_scores_gemma":[0.9863687,0.0000014647818,0.009326449,0.0037844393,0.00006208223,0.0000022111687,6.00041e-7,0.0000016684768,0.0004523916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959904,0.0000075862154,0.00007297457,0.0001426809,0.000087767454,0.00008994741],"domain_scores_gemma":[0.99973214,0.000006225543,0.000013804401,0.00014322836,0.000018455781,0.00008615262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026603995,0.0000377558,0.000054817112,0.000004946067,0.000022195825,0.00005321702,0.0003966351,0.000013822049,0.00003303268],"category_scores_gemma":[0.0000091000475,0.000030157245,0.000021663134,0.00017130173,0.0000037635275,0.00017259712,0.00007281135,0.000030514197,0.0005403941],"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.000002207844,0.000025115538,0.0004991214,0.000016996724,0.000010612957,0.000033664466,0.00073833636,0.000099291836,0.0020317382,0.6551876,0.18894184,0.15241346],"study_design_scores_gemma":[0.0002913686,0.00006161164,0.0014920688,0.000005433867,9.1478387e-7,0.000008158692,0.000031691212,0.25728112,0.003393059,0.0007869537,0.73644763,0.00019995439],"about_ca_topic_score_codex":0.0000053868234,"about_ca_topic_score_gemma":4.920566e-7,"teacher_disagreement_score":0.9858024,"about_ca_system_score_codex":0.0000029450423,"about_ca_system_score_gemma":0.000010737653,"threshold_uncertainty_score":0.6945853},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047847904,0.000098477285,0.9141992,0.00298778,0.000146055,0.00027640394,0.00027167486,0.00034225703,0.03383027],"genre_scores_gemma":[0.9391321,0.00001145973,0.05926683,0.0012887013,0.00006807795,0.0000085065985,0.000035753925,0.00000888118,0.00017967408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983566,0.00008444867,0.0002974918,0.0005433625,0.00043999313,0.00027814115],"domain_scores_gemma":[0.9990626,0.000083258274,0.00012578338,0.00037183068,0.00013709639,0.00021943104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001322781,0.00017979366,0.0003577067,0.000018548772,0.00017418539,0.00025029006,0.00054461206,0.000049562528,0.00021166916],"category_scores_gemma":[0.00003376529,0.0001302632,0.000054263706,0.00029739828,0.0001102858,0.00046984814,0.00023447946,0.0001394073,0.00007535923],"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.002903156,0.0004670104,0.013657467,0.00016676885,0.00045531697,0.00073466037,0.012224648,0.0007221895,0.017774036,0.8254665,0.07928424,0.046144016],"study_design_scores_gemma":[0.021261355,0.004145308,0.01811335,0.0008349013,0.00007935888,0.00008105687,0.0030061044,0.51453424,0.031419992,0.032602448,0.37038213,0.0035397748],"about_ca_topic_score_codex":0.00023867156,"about_ca_topic_score_gemma":0.00008213426,"teacher_disagreement_score":0.8912842,"about_ca_system_score_codex":0.000047326586,"about_ca_system_score_gemma":0.00014559664,"threshold_uncertainty_score":0.5311979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005012398,0.0011095188,0.99259526,0.00061694905,0.000871175,0.00045916074,0.000017948523,0.00016625242,0.003662479],"genre_scores_gemma":[0.91182905,0.0000768378,0.08443333,0.0012868465,0.00055342104,0.000016258316,0.000012036642,0.000054908774,0.0017372783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601156,0.000044859502,0.00050566025,0.0018388629,0.00087095745,0.0007281143],"domain_scores_gemma":[0.9971509,0.000748078,0.00031568203,0.0012436922,0.00022461495,0.0003170284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010143783,0.0006127329,0.0007265414,0.0004726625,0.0003126016,0.0009025573,0.001800978,0.0003397423,0.000010772506],"category_scores_gemma":[0.00016720498,0.000535328,0.00008521066,0.0004488181,0.0008321241,0.00022063062,0.00139584,0.000614222,0.00008061649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016380314,0.00010856641,0.0007690082,0.00038668796,0.00004662596,0.00042917865,0.0039451197,0.033788648,0.00078460743,0.0668666,0.00042744726,0.89243114],"study_design_scores_gemma":[0.0004657868,0.00028963469,0.00084041373,0.0007687606,0.0000114679515,0.00027784592,2.7964467e-7,0.9798187,0.00034861162,0.013448787,0.0027950509,0.00093464414],"about_ca_topic_score_codex":0.00002478861,"about_ca_topic_score_gemma":0.000018972121,"teacher_disagreement_score":0.9460301,"about_ca_system_score_codex":0.00013497513,"about_ca_system_score_gemma":0.00025603504,"threshold_uncertainty_score":0.99970984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9369302,0.00037608587,0.03504179,0.016349215,0.00022143427,0.0003809218,0.000015629821,0.0003355147,0.010349238],"genre_scores_gemma":[0.9953515,0.000041429947,0.0024518496,0.0017933791,0.000062026345,0.00001539818,0.0000026840185,0.000007168751,0.00027454278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861664,0.00003600199,0.00030860858,0.000499337,0.00023428985,0.0003051262],"domain_scores_gemma":[0.9993838,0.000024956735,0.000055336834,0.0002907475,0.000022046008,0.0002231263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001322721,0.00016648183,0.00025838532,0.00003981754,0.0000923206,0.000115580755,0.00054298335,0.00007028345,0.000022031967],"category_scores_gemma":[0.000024075094,0.00014065554,0.00003632071,0.00047629658,0.000030425417,0.000367296,0.00013481219,0.00016632721,0.000026931346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003675613,0.0010114601,0.13885367,0.0016793936,0.00011059583,0.000724113,0.04866325,0.021444421,0.04446033,0.07196,0.07599638,0.5947288],"study_design_scores_gemma":[0.00086350605,0.00008735113,0.032735355,0.00006626585,0.0000013276788,0.000019595956,0.000086032946,0.93566096,0.00068624964,0.000022180997,0.02950995,0.00026121605],"about_ca_topic_score_codex":0.000017593236,"about_ca_topic_score_gemma":0.000007401245,"teacher_disagreement_score":0.9142165,"about_ca_system_score_codex":0.000017669781,"about_ca_system_score_gemma":0.00004001979,"threshold_uncertainty_score":0.5735766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02484973,0.00005449751,0.96378475,0.007902928,0.000039171755,0.00012523004,0.0000048123857,0.000025137186,0.003213753],"genre_scores_gemma":[0.9941105,0.000004829387,0.003245024,0.0026189317,0.000009111023,0.0000031365232,0.0000066386483,4.4572545e-7,0.0000013817165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.0000316695,0.00016543733,0.000059621227,0.00010794587,0.00005640665],"domain_scores_gemma":[0.99979335,0.000018610692,0.000045854595,0.000098140816,0.00002516047,0.000018867166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013377322,0.00003772961,0.00006870677,0.000018586858,0.000019084202,0.00006365002,0.00022999807,0.000019599453,0.0000015568595],"category_scores_gemma":[0.0000073321517,0.000023883682,0.00001133295,0.00020879548,0.0000096105405,0.0004950183,0.00004420403,0.000042395535,0.000009908832],"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.000013339631,0.000055513963,0.0023805278,0.00014172183,0.0000070204005,0.000004833008,0.014562735,0.0006190705,0.0017135976,0.93506444,0.004509185,0.040928002],"study_design_scores_gemma":[0.001450707,0.00031838924,0.054991055,0.000075245116,0.0000046684327,0.000031316165,0.0007113763,0.9001145,0.0023744483,0.0031252743,0.03650268,0.00030036015],"about_ca_topic_score_codex":0.000021899417,"about_ca_topic_score_gemma":0.000003550265,"teacher_disagreement_score":0.96926075,"about_ca_system_score_codex":0.0000037129353,"about_ca_system_score_gemma":0.000007590468,"threshold_uncertainty_score":0.097394824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06929772,0.0007205541,0.9270892,0.0009735705,0.0008957309,0.00064711034,0.00015746601,0.00011035432,0.00010825671],"genre_scores_gemma":[0.58048433,0.0000072418784,0.41870198,0.00041837068,0.00019769034,0.00005332671,0.000051487354,0.000024461366,0.00006111961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751705,0.00015011555,0.00064049585,0.00071367034,0.0005450373,0.00043362714],"domain_scores_gemma":[0.9974883,0.0006840121,0.00025880506,0.00087248546,0.00041112286,0.0002852486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041497752,0.0003352618,0.00064892875,0.0002069228,0.00012415435,0.0001322941,0.0014745926,0.000119360455,0.0000037573698],"category_scores_gemma":[0.00013246915,0.0002919968,0.0001883892,0.00030627882,0.0001771825,0.0002496992,0.000405786,0.00033643463,0.000006201181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012960952,0.0009922548,0.004086256,0.00053894665,0.000583941,0.000047288086,0.05871559,0.05680345,0.0047117295,0.011042942,0.04996613,0.8112154],"study_design_scores_gemma":[0.0075508193,0.0049036494,0.0035996211,0.0004968942,0.00007743531,0.0003070883,0.00089466164,0.85812014,0.009186383,0.018154733,0.095212616,0.0014959362],"about_ca_topic_score_codex":0.00009383082,"about_ca_topic_score_gemma":0.000081127466,"teacher_disagreement_score":0.80971944,"about_ca_system_score_codex":0.000049733753,"about_ca_system_score_gemma":0.00017386295,"threshold_uncertainty_score":0.9999532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022706885,0.0018248488,0.9711284,0.0027457261,0.0004080497,0.00015202655,0.0000051636116,0.000162909,0.0008659592],"genre_scores_gemma":[0.8483838,0.0000117921445,0.14966896,0.0016811772,0.00020710906,0.0000018182861,0.0000016285798,0.000005846525,0.000037906335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889237,0.00008308885,0.00025034838,0.00036163753,0.00011870156,0.0002938452],"domain_scores_gemma":[0.9994662,0.00007655124,0.00007433797,0.00017521958,0.00006200483,0.00014571229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021024242,0.00013227551,0.0002831917,0.000017326913,0.00013835034,0.00012477142,0.00028051072,0.00008805775,0.000011435305],"category_scores_gemma":[0.00006773907,0.000107477375,0.000045444463,0.00025221644,0.0000679843,0.000081741644,0.00019365802,0.00013329588,0.000005348712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007239992,0.00030622733,0.011765092,0.0005019752,0.00057344045,0.0011906903,0.007351973,0.14587277,0.02998534,0.52978414,0.049643695,0.22230065],"study_design_scores_gemma":[0.0016899478,0.000024010558,0.00050029875,0.000022171715,0.0000062561094,0.000038179634,0.000043560627,0.98990756,0.00033113704,0.00010761535,0.0071643423,0.00016489056],"about_ca_topic_score_codex":0.00012219627,"about_ca_topic_score_gemma":0.000008166616,"teacher_disagreement_score":0.8440348,"about_ca_system_score_codex":0.0000045067645,"about_ca_system_score_gemma":0.000039801387,"threshold_uncertainty_score":0.43828002},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019815309,0.000042365948,0.93699205,0.0006131269,0.00057538,0.032685813,0.00013453724,0.0006194821,0.008521921],"genre_scores_gemma":[0.99590284,0.000017210548,0.0011464269,0.00018282092,0.0001346826,0.0008699678,0.000016493696,0.000026759326,0.0017028244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697924,0.00017987806,0.00034510184,0.0018274613,0.00018952496,0.00047877655],"domain_scores_gemma":[0.9976328,0.0000479472,0.00036902426,0.001370136,0.00018610632,0.00039400542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022040686,0.0004754909,0.0005631775,0.00015977224,0.00021567314,0.00037025704,0.0019722343,0.00031739436,0.000017877079],"category_scores_gemma":[0.000028875513,0.0005124989,0.00020137233,0.00068260805,0.00014075605,0.0003813062,0.0030538486,0.0007230428,0.000114095485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069369335,0.0012054585,0.015983278,0.003799894,0.000832944,0.006695984,0.0061548227,0.13993888,0.00056814967,0.7708397,0.030267868,0.023019327],"study_design_scores_gemma":[0.0029722054,0.00039134707,0.008749366,0.0007417701,0.00008440785,0.000039884068,0.0004284092,0.91381943,0.00018939965,0.021326484,0.04941031,0.001846965],"about_ca_topic_score_codex":0.0001481979,"about_ca_topic_score_gemma":0.00003695696,"teacher_disagreement_score":0.9760875,"about_ca_system_score_codex":0.00014937657,"about_ca_system_score_gemma":0.00024135035,"threshold_uncertainty_score":0.9997327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53519475,0.00029626337,0.39698502,0.004818989,0.0002100763,0.058642242,0.0014972369,0.00020365152,0.0021517866],"genre_scores_gemma":[0.9938208,0.0000011184061,0.003013824,0.0001337078,0.000021148897,0.0029939816,0.000004578199,0.000004851145,0.0000059758077],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873674,0.00000958649,0.00040298828,0.0003348114,0.0003275088,0.00018834275],"domain_scores_gemma":[0.9989888,0.000040369738,0.00040632623,0.00021585562,0.00027508684,0.00007357791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029321603,0.00012520843,0.00041829204,0.00008116704,0.0000380895,0.000042973057,0.0009991409,0.000020382495,0.0000033207468],"category_scores_gemma":[0.00006103514,0.000079374164,0.000106215884,0.00097164215,0.000051589363,0.00038232483,0.00008829139,0.00006305654,2.838569e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012784016,0.0028099034,0.446074,0.0036528956,0.0022768783,0.0000041757503,0.012904868,0.009489482,0.24458598,0.25129613,0.0032803894,0.02234687],"study_design_scores_gemma":[0.012206458,0.0029470504,0.060233228,0.0010924971,0.0007917311,0.000005627863,0.001683421,0.65723807,0.25668922,0.0004587746,0.005798484,0.00085545547],"about_ca_topic_score_codex":0.00006654613,"about_ca_topic_score_gemma":0.00001030129,"teacher_disagreement_score":0.6477486,"about_ca_system_score_codex":0.000023912124,"about_ca_system_score_gemma":0.000051139043,"threshold_uncertainty_score":0.32367846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52674955,0.0017861458,0.093542024,0.15635428,0.0033091386,0.0037143049,0.00009422595,0.0013191297,0.2131312],"genre_scores_gemma":[0.99663997,0.0000056811746,0.0022213976,0.00093902386,0.00005573336,0.000015433436,2.0277547e-7,0.000004066959,0.0001185126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991526,0.0000029773473,0.00019695461,0.00021023334,0.00028236213,0.00015484357],"domain_scores_gemma":[0.9995367,0.000008621962,0.00014960943,0.00011426645,0.00010742606,0.000083381645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010827522,0.000086789034,0.0001298423,0.000011832146,0.000058812595,0.000066337045,0.0011029061,0.000021499329,0.0000060385505],"category_scores_gemma":[0.00004551254,0.0000568854,0.00007715941,0.00032075692,0.000027472914,0.00020678712,0.00034770934,0.000073924806,0.000021151283],"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.000033670913,0.00020451784,0.011123498,0.0003745813,0.00007969673,0.0000032521684,0.0041294633,0.00010258592,0.11786035,0.7482157,0.09986975,0.01800296],"study_design_scores_gemma":[0.0027996323,0.0005353163,0.011660825,0.00039968317,0.000045680423,0.00005084011,0.0005476307,0.053686135,0.6175923,0.008398377,0.30344492,0.00083864346],"about_ca_topic_score_codex":0.000011683012,"about_ca_topic_score_gemma":1.9631604e-7,"teacher_disagreement_score":0.7398173,"about_ca_system_score_codex":0.00001964322,"about_ca_system_score_gemma":0.00001739129,"threshold_uncertainty_score":0.23197193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012318724,0.00004840893,0.86558753,0.0030633279,0.0017366679,0.00032988857,0.0000141657,0.00058434077,0.12740381],"genre_scores_gemma":[0.106720544,0.0000071253935,0.8875043,0.0015787958,0.0015920601,0.000020887781,0.0000075924327,0.00009450338,0.0024742247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949423,0.0010286025,0.0008170123,0.001376461,0.0008099027,0.0010257205],"domain_scores_gemma":[0.9970486,0.00026774613,0.00042038932,0.0013369886,0.00033946373,0.00058680156],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032650968,0.00050063484,0.00049000076,0.00018260952,0.0005738501,0.0009485209,0.0015260531,0.00009041795,0.00004793292],"category_scores_gemma":[0.00030867223,0.00046275495,0.00018645648,0.0007614041,0.00013375843,0.0008184049,0.0008590441,0.000494956,0.0013111066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002363794,0.0009986813,0.00021527731,0.00008328574,0.00034306812,0.0020861544,0.014152416,0.0067800405,0.0456804,0.042381562,0.057653986,0.82938874],"study_design_scores_gemma":[0.001212645,0.002134018,0.0017183756,0.00043266578,0.000046377427,0.00050643727,0.00045967512,0.40970525,0.015641695,0.00005306323,0.5662604,0.0018294248],"about_ca_topic_score_codex":0.000032144933,"about_ca_topic_score_gemma":0.0000018090514,"teacher_disagreement_score":0.82755935,"about_ca_system_score_codex":0.00010393933,"about_ca_system_score_gemma":0.000106602594,"threshold_uncertainty_score":0.99978244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007691728,0.000033321747,0.92536867,0.006786653,0.00009378863,0.00003111749,9.0584655e-7,0.00016909126,0.06674731],"genre_scores_gemma":[0.9852665,7.5986014e-7,0.0110970745,0.0031916238,0.0000558995,0.000001991173,4.3436702e-7,0.0000012729791,0.00038445814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964017,0.0000070421515,0.00006789543,0.00012862406,0.00007616111,0.0000800981],"domain_scores_gemma":[0.9997544,0.00000672876,0.000012763445,0.00013466123,0.000015419144,0.00007599592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000028590772,0.00003354294,0.000052255677,0.000004317012,0.000020405365,0.000063857435,0.000358974,0.000012321189,0.000033038585],"category_scores_gemma":[0.000007815267,0.000026215574,0.000020368816,0.00013875587,0.000004629541,0.00015059269,0.000062249695,0.000026091822,0.00051343424],"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.000001876363,0.000014566018,0.00033629782,0.00000984025,0.0000062930285,0.000023180399,0.0005058387,0.000038951228,0.0013713886,0.83528006,0.11687846,0.045533266],"study_design_scores_gemma":[0.00035867505,0.000049157243,0.0011406008,0.0000042427914,8.0674624e-7,0.00000725818,0.000025125148,0.17539065,0.0022364655,0.0006714235,0.8199547,0.00016088082],"about_ca_topic_score_codex":0.000004870411,"about_ca_topic_score_gemma":3.421267e-7,"teacher_disagreement_score":0.9844973,"about_ca_system_score_codex":0.0000025961951,"about_ca_system_score_gemma":0.000009636199,"threshold_uncertainty_score":0.659933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022405718,0.000018240788,0.9632522,0.001586683,0.000031088544,0.01237782,0.000116380645,0.00020281022,0.000009086827],"genre_scores_gemma":[0.97418123,0.000007512574,0.010216413,0.00009420484,0.0000131087245,0.015444712,0.000020468528,0.0000079506135,0.000014385239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.000018475297,0.00028722364,0.00043814117,0.00013024072,0.00019066127],"domain_scores_gemma":[0.9989243,0.000027387448,0.00013500018,0.00074960536,0.000096804724,0.00006689663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012770313,0.00012048847,0.0002791314,0.0002794274,0.000114958624,0.000029772273,0.0007470041,0.000150982,0.0000053862545],"category_scores_gemma":[0.000010387614,0.00011401794,0.000059391612,0.0016421062,0.000060846516,0.00041137772,0.000011986233,0.00012918118,0.0000027515978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004430447,0.00042002142,0.00055417273,0.0007564243,0.0013696556,0.0000062949593,0.0011884256,0.012315531,0.022487957,0.0048652454,0.00088245986,0.9547108],"study_design_scores_gemma":[0.0011615914,0.00046011835,0.00063235627,0.000030064848,0.00013331186,0.000004838411,0.000045011526,0.9566807,0.029928034,0.000036152145,0.010736193,0.00015163764],"about_ca_topic_score_codex":0.000013174412,"about_ca_topic_score_gemma":0.000017892231,"teacher_disagreement_score":0.95455915,"about_ca_system_score_codex":0.000013421835,"about_ca_system_score_gemma":0.00004989384,"threshold_uncertainty_score":0.46495163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78063285,0.0021612262,0.008569099,0.19793428,0.0010785409,0.0043492373,0.00006389122,0.002570499,0.002640384],"genre_scores_gemma":[0.9525996,0.000009419075,0.046312824,0.0005876691,0.0001233656,0.00006221883,0.0000016701518,0.000021398258,0.0002818738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982486,0.000012382304,0.00025388092,0.0005079155,0.0005456659,0.00043159036],"domain_scores_gemma":[0.9985871,0.00005738787,0.00033630672,0.0006230148,0.00023588282,0.00016036083],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024467852,0.00023263397,0.00027926342,0.00004716796,0.00013917216,0.0012178136,0.0038087156,0.000086932916,0.0000015146941],"category_scores_gemma":[0.001582997,0.00015585941,0.00017577296,0.000872867,0.00010157471,0.0007666022,0.0009656895,0.0002534578,0.000007001512],"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.00006648613,0.00028982075,0.016576877,0.00061493646,0.00014644903,0.000015495985,0.007044231,0.000011439436,0.008397151,0.08677371,0.0151572,0.8649062],"study_design_scores_gemma":[0.0020359408,0.0013919733,0.0071609854,0.0010411321,0.00010032503,0.00006450422,0.009104584,0.001581724,0.06904337,0.0014773567,0.9054982,0.0014998948],"about_ca_topic_score_codex":0.000022983031,"about_ca_topic_score_gemma":7.142733e-7,"teacher_disagreement_score":0.890341,"about_ca_system_score_codex":0.00002579696,"about_ca_system_score_gemma":0.000024887604,"threshold_uncertainty_score":0.99981904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04111006,0.00031548287,0.95580024,0.000498613,0.00024868976,0.00024258005,0.000010843214,0.00016672772,0.001606794],"genre_scores_gemma":[0.9953339,0.0000015787018,0.0042027193,0.00032793396,0.000055494133,0.000009621787,9.2491746e-7,0.0000059621325,0.00006188263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988349,0.000072682415,0.00031791462,0.00032554465,0.00018054775,0.00026841921],"domain_scores_gemma":[0.9994942,0.0000265733,0.000071422124,0.00023835359,0.00005366205,0.000115775736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001586553,0.00012224576,0.0002457467,0.000032921573,0.000052388597,0.00045092352,0.0005103499,0.00005783091,0.000006522094],"category_scores_gemma":[0.00001489974,0.00010469845,0.000040992498,0.00038747047,0.000019742994,0.0006868917,0.00005827141,0.000105970576,0.000046852907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057109606,0.00038664095,0.031236608,0.00044235855,0.00009552744,0.00047994117,0.0053226077,0.37583277,0.0426912,0.53607213,0.0024532871,0.0049298187],"study_design_scores_gemma":[0.0010511942,0.00002589318,0.0016294239,0.000028755303,0.0000015296736,0.0000058492815,0.0006587368,0.9948382,0.00007299208,0.000022139635,0.0015243074,0.00014097452],"about_ca_topic_score_codex":0.00067739456,"about_ca_topic_score_gemma":0.000031455475,"teacher_disagreement_score":0.9542238,"about_ca_system_score_codex":0.000033423115,"about_ca_system_score_gemma":0.00008152849,"threshold_uncertainty_score":0.43482658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020741725,0.000013137699,0.9924699,0.0031481956,0.0008297041,0.00023228585,0.000043454358,0.00037199332,0.0008171639],"genre_scores_gemma":[0.9774548,0.0000032882192,0.020128042,0.0022188236,0.00007843931,0.000024371364,0.0000019757138,0.000016795659,0.00007350041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839723,0.000069768736,0.00024144955,0.00056615693,0.00043327612,0.00029212233],"domain_scores_gemma":[0.9990282,0.000077088844,0.00006967483,0.0003280806,0.00008069943,0.00041627415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006941721,0.00024086371,0.00024542928,0.00008018022,0.00025391753,0.00014055114,0.0005691603,0.00006501935,0.00006486164],"category_scores_gemma":[0.0000010930415,0.00021293927,0.00013989041,0.0006188404,0.00007949967,0.0004984939,0.0000014683959,0.00030003724,0.00010009124],"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.00020095987,0.00014648726,0.000011381699,0.00004081007,0.00029821193,0.00014519009,0.004507168,0.913652,0.00057954766,0.0020341359,0.002561394,0.07582273],"study_design_scores_gemma":[0.0025908567,0.00093803066,0.00016042181,0.000120843964,0.00003827346,0.000110551664,0.0003162853,0.97319967,0.012772352,0.00006607461,0.008848267,0.00083837134],"about_ca_topic_score_codex":0.000016469876,"about_ca_topic_score_gemma":0.000006495849,"teacher_disagreement_score":0.9753806,"about_ca_system_score_codex":0.00006396901,"about_ca_system_score_gemma":0.00012064161,"threshold_uncertainty_score":0.8683411},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008582206,0.0002934228,0.9876905,0.0005464623,0.0017567587,0.000603392,0.000045894565,0.00005720616,0.00042412808],"genre_scores_gemma":[0.89785326,0.000048922127,0.10081582,0.00015738739,0.00053066364,0.00025432484,0.000042158168,0.000034481905,0.0002629863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968457,0.00013255168,0.0014335115,0.0006728027,0.000489938,0.00042544905],"domain_scores_gemma":[0.9970184,0.00019597037,0.0011664596,0.0007638742,0.0006953889,0.00015990977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011871206,0.00033668056,0.00070856686,0.00031341953,0.00007203159,0.0008534434,0.0025054535,0.00033131996,0.000041662206],"category_scores_gemma":[0.00008728469,0.00033599822,0.00043849685,0.00030621365,0.00009292407,0.00039443994,0.0003939101,0.0010635415,0.000019617766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045422697,0.003421355,0.00034162798,0.0036272614,0.0009480006,0.0005768705,0.020272106,0.19985162,0.044172794,0.031191772,0.019111987,0.6760304],"study_design_scores_gemma":[0.00032403722,0.0001628166,0.0000597362,0.0034565986,0.000041004267,0.00018068965,0.00016199048,0.95468,0.025717411,0.012818199,0.0017391077,0.000658362],"about_ca_topic_score_codex":0.00028354212,"about_ca_topic_score_gemma":0.0000248691,"teacher_disagreement_score":0.8892711,"about_ca_system_score_codex":0.00030821835,"about_ca_system_score_gemma":0.0007253091,"threshold_uncertainty_score":0.9999092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011430381,0.000026233089,0.9838604,0.00064632134,0.0007127776,0.00028362314,0.000036607024,0.0004046306,0.0025990796],"genre_scores_gemma":[0.99752736,0.000021124199,0.0016398355,0.0002475407,0.00008073247,0.0000013224336,0.00012968505,0.000012089991,0.00034031758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984237,0.00014687724,0.00021577763,0.0008953274,0.00010030506,0.00021802801],"domain_scores_gemma":[0.99850404,0.00003754884,0.0002812696,0.0008637527,0.00016831311,0.00014508558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001499248,0.00023185232,0.00026670707,0.000117602656,0.00011349247,0.00019875763,0.00126495,0.00024443303,0.000016912682],"category_scores_gemma":[0.000025723717,0.00027901385,0.00015785097,0.00069381215,0.000033104832,0.0003861533,0.0004865192,0.0003204398,0.00012685925],"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.000019172909,0.00006160847,0.0008054112,0.00018992642,0.000037108126,0.00015095265,0.00015208457,0.5779982,0.000091646805,0.4167832,0.00298434,0.00072631246],"study_design_scores_gemma":[0.00035547878,0.000024290166,0.0009251526,0.00010205005,0.000021419097,0.0000010122122,0.000012085298,0.981262,0.00014349974,0.012778984,0.0040699937,0.00030402286],"about_ca_topic_score_codex":0.00008025313,"about_ca_topic_score_gemma":0.000013858142,"teacher_disagreement_score":0.986097,"about_ca_system_score_codex":0.0001452637,"about_ca_system_score_gemma":0.00018977061,"threshold_uncertainty_score":0.9999662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.946673,0.002675939,0.036734637,0.005844742,0.00025916277,0.00013094694,0.000018878145,0.000044639735,0.007618093],"genre_scores_gemma":[0.99611425,0.00009641698,0.0028439844,0.00020212102,0.0006454689,8.9110426e-7,5.7073174e-7,0.0000068584022,0.0000894611],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985092,0.00004762964,0.0006300246,0.00015393647,0.00034449893,0.00031465993],"domain_scores_gemma":[0.9982945,0.00012950135,0.00090036326,0.00015547124,0.00039565648,0.00012453289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011918372,0.00013251218,0.00036450123,0.00027357743,0.00013135685,0.00087800325,0.00040048058,0.00006982515,0.0000048675947],"category_scores_gemma":[0.00024453521,0.00011123183,0.000056437755,0.00028623207,0.00006943708,0.0020450677,0.0001265412,0.00018965264,0.000002691063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049007816,0.00036045775,0.030491149,0.00037090984,0.00035180114,0.00006647169,0.0049080793,0.0007075177,0.014079438,0.117355615,0.008903053,0.8223565],"study_design_scores_gemma":[0.013822956,0.0012687846,0.12788256,0.0031698213,0.00021628007,0.011768378,0.010006619,0.2072728,0.0033980242,0.008358929,0.609838,0.0029968284],"about_ca_topic_score_codex":0.00019712815,"about_ca_topic_score_gemma":0.000012613605,"teacher_disagreement_score":0.81935966,"about_ca_system_score_codex":0.00003937393,"about_ca_system_score_gemma":0.0003772515,"threshold_uncertainty_score":0.84666055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014118404,0.00022724851,0.98928046,0.004196359,0.0006561151,0.0004338199,0.000037908478,0.0002941304,0.003462097],"genre_scores_gemma":[0.9842452,0.0000013681382,0.013514022,0.0011797774,0.00024220273,0.00006310961,0.000006173584,0.0000075280873,0.00074061635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998992,0.000022678392,0.00024480824,0.0003377549,0.00016052272,0.00024221896],"domain_scores_gemma":[0.9993184,0.00007871299,0.000063914464,0.00029400954,0.00008048348,0.00016448578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012534265,0.00010638303,0.00018262852,0.00001488418,0.00007323262,0.00019626578,0.0005681383,0.00004749039,0.000006661034],"category_scores_gemma":[0.00006385391,0.000087027256,0.00007709934,0.0001709009,0.000010013848,0.000103145205,0.00009735907,0.000052811567,0.00012191491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133961,0.0001443986,0.0017694099,0.0004865173,0.00007990309,0.00003075946,0.0016506895,0.005161521,0.0044713276,0.63192123,0.3395143,0.014728601],"study_design_scores_gemma":[0.0006042954,0.00007256085,0.00011009739,0.0000203968,0.0000019972924,0.000006406577,0.00010506681,0.79895455,0.00063405285,0.000110905115,0.1992275,0.00015215288],"about_ca_topic_score_codex":0.00005321795,"about_ca_topic_score_gemma":0.0000038020908,"teacher_disagreement_score":0.9828334,"about_ca_system_score_codex":0.000017552187,"about_ca_system_score_gemma":0.00003971265,"threshold_uncertainty_score":0.35488686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14522594,0.00034911383,0.7659653,0.00745374,0.0031410605,0.0005459188,0.0000120853365,0.00091148226,0.07639541],"genre_scores_gemma":[0.9853931,0.0000033183037,0.012045633,0.00074339664,0.00042119194,0.0000113911865,0.0000017573121,0.000007730437,0.0013724818],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899155,0.000034462417,0.0001767347,0.00031733984,0.00019127471,0.00028863747],"domain_scores_gemma":[0.9985323,0.000052118554,0.00007857628,0.0011611795,0.00007972605,0.000096099444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015739433,0.00010897585,0.00013133703,0.000034385503,0.00013097834,0.00021294868,0.001285644,0.00005093209,0.000031040523],"category_scores_gemma":[0.00014800014,0.00009135954,0.000048259768,0.0002870509,0.000039833252,0.0004615646,0.00031669342,0.000080836726,0.0007139651],"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.000016431233,0.00017138766,0.010659192,0.000050151513,0.000052143954,0.00007869535,0.0036021154,0.000009263024,0.022391772,0.06391148,0.25387132,0.64518607],"study_design_scores_gemma":[0.00048999075,0.00023175964,0.006460761,0.00006714066,0.0000044040653,0.00003570665,0.00008987289,0.0066608135,0.009552594,0.0036676847,0.9723206,0.00041866564],"about_ca_topic_score_codex":0.00014374466,"about_ca_topic_score_gemma":0.000054493914,"teacher_disagreement_score":0.84016716,"about_ca_system_score_codex":0.00002471214,"about_ca_system_score_gemma":0.00005577147,"threshold_uncertainty_score":0.9176815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050603086,0.000077330245,0.98234,0.00087427674,0.00037549215,0.000026777323,0.000037347996,0.00004851329,0.011159955],"genre_scores_gemma":[0.9540484,0.0000044685353,0.04354002,0.000090081674,0.000026217314,0.000006440306,0.0000019187216,0.0000024032975,0.0022800367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993248,0.000023739563,0.00017327841,0.0001783464,0.00019980338,0.00010003617],"domain_scores_gemma":[0.9994536,0.00006789828,0.000037136397,0.000284599,0.000117884505,0.00003887259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098752804,0.000055770888,0.00013535956,0.000020658026,0.000030795298,0.0000278163,0.0002547871,0.000032438096,0.0002069021],"category_scores_gemma":[0.000015942143,0.00004914239,0.000062462925,0.00021263263,0.00001569416,0.0001686129,0.000022326967,0.000036936515,0.0000305952],"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.000009315227,0.00042955676,0.00019509681,0.00013397356,0.00013981991,0.000099233206,0.00028910916,0.0014109577,0.025751991,0.68007,0.01161593,0.279855],"study_design_scores_gemma":[0.0006046586,0.000030744573,0.017906416,0.00010852195,0.000016715281,0.00012833222,0.00018470148,0.01808961,0.9455101,0.0028014132,0.014216198,0.00040260603],"about_ca_topic_score_codex":0.00006145181,"about_ca_topic_score_gemma":0.000015716065,"teacher_disagreement_score":0.9489881,"about_ca_system_score_codex":0.000010451716,"about_ca_system_score_gemma":0.00008277029,"threshold_uncertainty_score":0.22654328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7130531,0.050539814,0.1672841,0.03667563,0.0031875852,0.00032409027,0.00003740442,0.00032604364,0.028572198],"genre_scores_gemma":[0.9949885,0.00016447075,0.0008784742,0.0022590545,0.00014507213,0.000004994543,0.000012444674,0.0000044387875,0.0015425595],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990744,0.00004810098,0.00016749962,0.00031575555,0.0002267083,0.00016754464],"domain_scores_gemma":[0.9992996,0.00008326182,0.00001595972,0.0004294468,0.0000616262,0.00011011061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001950879,0.000094006085,0.00018076284,0.000029347531,0.000060582646,0.0000065171466,0.0001774728,0.000034354664,0.000057741883],"category_scores_gemma":[0.00010718807,0.00006971745,0.000018068184,0.00020886547,0.000058164667,0.000102091355,0.00007209059,0.00008896657,0.00003821651],"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.00006582686,0.0004762,0.004232536,0.00035775517,0.00015907073,0.0043540373,0.008840331,0.00021671265,0.008900613,0.23083636,0.4391573,0.30240324],"study_design_scores_gemma":[0.009263892,0.0021736904,0.22116815,0.0025067464,0.000060244354,0.0015037924,0.0017157184,0.12901455,0.0028294453,0.036110118,0.5921807,0.0014729387],"about_ca_topic_score_codex":0.00010799073,"about_ca_topic_score_gemma":0.000022691554,"teacher_disagreement_score":0.3009303,"about_ca_system_score_codex":0.000012508568,"about_ca_system_score_gemma":0.000025071366,"threshold_uncertainty_score":0.2842995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025112152,0.011966963,0.7899411,0.097284555,0.0011869617,0.00085522834,0.000064089145,0.0008735576,0.07271545],"genre_scores_gemma":[0.9982959,0.00031106552,0.0005012621,0.0007428838,0.00007409171,0.0000079281435,0.00001028173,0.0000022495335,0.000054315027],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994929,0.000019559267,0.00013536867,0.00011682203,0.00012200429,0.000113351256],"domain_scores_gemma":[0.999643,0.000013988314,0.00006249996,0.00019146173,0.000025037247,0.00006397135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012418604,0.00005535199,0.000058526723,0.0000064888154,0.00027063338,0.00016573335,0.00023722328,0.000020415759,0.0000010370086],"category_scores_gemma":[0.000018870856,0.000030227198,0.000015943735,0.00014226839,0.000028486455,0.00068879797,0.00006741597,0.0000615032,0.000036569825],"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.000035688565,0.000039195875,0.0004058079,0.00022704143,0.000034704753,0.000014169952,0.0048111877,0.00011034963,0.007288425,0.33888474,0.117638394,0.5305103],"study_design_scores_gemma":[0.00022218689,0.000042815456,0.0014101602,0.00003499371,0.000001634535,0.000010637866,0.00009857916,0.05904833,0.0009585443,0.00014575679,0.93792427,0.00010210005],"about_ca_topic_score_codex":0.0000041665867,"about_ca_topic_score_gemma":0.0000017726386,"teacher_disagreement_score":0.97318375,"about_ca_system_score_codex":0.000006493447,"about_ca_system_score_gemma":0.000011003994,"threshold_uncertainty_score":0.20815204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022814725,0.000103321014,0.94146407,0.00058181747,0.003153305,0.02480604,0.003045922,0.00065171183,0.0033790946],"genre_scores_gemma":[0.88460964,0.00005507033,0.06398312,0.0020063615,0.000937736,0.029114172,0.018535146,0.0001524179,0.00060630596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412715,0.00011226481,0.002455553,0.00089128216,0.0013089248,0.0011048486],"domain_scores_gemma":[0.99486846,0.00007084455,0.00139821,0.002409932,0.0008925144,0.00036003676],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095554226,0.00086450175,0.0011714868,0.0003376609,0.00046360452,0.0030693403,0.0027744346,0.00087649096,0.000023687484],"category_scores_gemma":[0.00009893164,0.00083663774,0.00071178615,0.00062019046,0.00010411145,0.0020927873,0.0023464737,0.0013130377,0.00004611664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000901628,0.009339636,0.10113009,0.05354018,0.0046549127,0.00037181305,0.072417706,0.019656407,0.00031054238,0.37519506,0.09542126,0.26706076],"study_design_scores_gemma":[0.008066329,0.0006212641,0.014511866,0.0065089427,0.00012629462,0.0002417709,0.0011737671,0.5289197,0.00034346833,0.0048348596,0.4306926,0.0039591244],"about_ca_topic_score_codex":0.00012556241,"about_ca_topic_score_gemma":0.00005043813,"teacher_disagreement_score":0.8774809,"about_ca_system_score_codex":0.00030138082,"about_ca_system_score_gemma":0.00029429063,"threshold_uncertainty_score":0.9994084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000966605,0.00014442632,0.85280526,0.0011485766,0.00027634084,0.000012166918,8.007681e-7,0.000094359,0.14455147],"genre_scores_gemma":[0.95210636,0.000004515221,0.031169428,0.0009098641,0.000046379417,0.0000029986531,0.0000020277746,0.0000017949087,0.015756646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996312,0.000011554969,0.00006267924,0.00012936401,0.0000797693,0.00008542631],"domain_scores_gemma":[0.9996181,0.000009116551,0.000009575479,0.00027964925,0.000050790255,0.00003277479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004312082,0.00002886104,0.000046449084,0.0000060864177,0.000026489326,0.00008926524,0.00020016404,0.00001388613,0.000064338616],"category_scores_gemma":[0.000008643761,0.000024222849,0.000022082466,0.00017398954,0.0000039186034,0.00013248801,0.0000691843,0.000023022389,0.00024598307],"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":[1.3792736e-7,0.000022810518,0.00020715516,0.0000032883897,0.0000039548286,0.00007406255,0.000050578114,0.000011132462,0.0010102399,0.9390984,0.027869573,0.031648636],"study_design_scores_gemma":[0.00023185092,0.00000912132,0.002985159,0.000010563517,7.7765793e-7,0.000089880305,0.000032806453,0.02111251,0.011379636,0.0039163837,0.9600855,0.00014577195],"about_ca_topic_score_codex":0.0000057542247,"about_ca_topic_score_gemma":0.000004341296,"teacher_disagreement_score":0.95113975,"about_ca_system_score_codex":0.000004697359,"about_ca_system_score_gemma":0.000031242147,"threshold_uncertainty_score":0.31616968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46003205,0.0000492817,0.5359954,0.0001538822,0.0004840655,0.00017113696,0.000017543363,0.00010569913,0.0029909273],"genre_scores_gemma":[0.99777067,0.00003412077,0.0005457631,0.000103519604,0.000038282287,7.6312983e-7,0.000025040872,0.000006360401,0.001475467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984657,0.00012570915,0.00015490213,0.000997462,0.0000783244,0.00017787333],"domain_scores_gemma":[0.99841493,0.00007377355,0.00015864792,0.0010992421,0.00015169302,0.00010173559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021347479,0.00019389782,0.00024857535,0.00008012282,0.00009464539,0.00026012835,0.0006479539,0.0002206954,0.000008694319],"category_scores_gemma":[0.000048044527,0.00021519084,0.00009920086,0.00025519292,0.000068085064,0.0002741656,0.00092392904,0.00035108742,0.000013981559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008090948,0.00074198603,0.01028756,0.0009602329,0.00019772713,0.0021798138,0.0015400512,0.07990307,0.00018972294,0.88239604,0.0022256193,0.019297266],"study_design_scores_gemma":[0.00063673523,0.00008387346,0.017586224,0.00038233303,0.000032260068,0.0000150402275,0.000075717755,0.9551475,0.00013212532,0.023174576,0.0020965675,0.0006370191],"about_ca_topic_score_codex":0.000076504984,"about_ca_topic_score_gemma":0.000021565897,"teacher_disagreement_score":0.87524444,"about_ca_system_score_codex":0.00010621439,"about_ca_system_score_gemma":0.00009235893,"threshold_uncertainty_score":0.87752277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05525582,0.0013970274,0.8953875,0.0064542256,0.005783783,0.00042966343,0.000018586725,0.0008053727,0.034468073],"genre_scores_gemma":[0.99529445,0.000016884169,0.001983017,0.0010885284,0.00018125802,0.000017926432,0.0000051120237,0.000009089436,0.0014037238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986864,0.000087971974,0.0002599737,0.00039040676,0.00028948858,0.0002858076],"domain_scores_gemma":[0.99895364,0.00007080171,0.000111780464,0.00066275796,0.00008910804,0.00011188879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038861745,0.00013602951,0.00020106003,0.000037787246,0.00012770733,0.00056241977,0.00073321536,0.000068768175,0.000023933893],"category_scores_gemma":[0.00006046041,0.00012362607,0.00008776307,0.00015746166,0.00003061954,0.000737231,0.00020305194,0.00011386106,0.00029343367],"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.00001756851,0.00025638042,0.0006813345,0.00009744133,0.000070456714,0.000056279718,0.004273076,0.00027963097,0.0037482237,0.61810654,0.025462698,0.34695038],"study_design_scores_gemma":[0.0016066876,0.00029368215,0.0030941754,0.0005705844,0.000015381047,0.0001611185,0.0011786064,0.09610566,0.009912772,0.005151222,0.8808238,0.0010863495],"about_ca_topic_score_codex":0.000066612185,"about_ca_topic_score_gemma":0.00003189114,"teacher_disagreement_score":0.9400386,"about_ca_system_score_codex":0.000031439195,"about_ca_system_score_gemma":0.000036017642,"threshold_uncertainty_score":0.54234266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024058728,0.000014124587,0.9146007,0.00066076923,0.00018120973,0.000036482827,5.6155017e-7,0.0001564723,0.08194384],"genre_scores_gemma":[0.9689136,8.4787683e-7,0.029768132,0.00024081543,0.00003795571,0.0000053775484,0.000001418518,0.0000016325099,0.0010302035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994913,0.000030701918,0.00011101642,0.00014926425,0.00010535346,0.000112373666],"domain_scores_gemma":[0.9995557,0.00002865809,0.00002659888,0.0002977102,0.000036626647,0.000054701108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014452069,0.000048408212,0.00006085493,0.000019345587,0.00009123069,0.00011640166,0.0003070376,0.000026680027,0.00001781831],"category_scores_gemma":[0.000018539731,0.00003669678,0.000024681005,0.00015045746,0.000010315301,0.0002976602,0.00004186922,0.000036682562,0.00020135236],"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":[2.5324752e-7,0.000023430914,0.0009206363,0.0000034782347,0.0000023719272,8.645381e-7,0.00004258403,0.00006926656,0.00082655175,0.90104574,0.007619944,0.08944489],"study_design_scores_gemma":[0.00033089708,0.000053459877,0.010015559,0.000031835923,0.0000024439817,0.000025738604,0.000031299453,0.697645,0.0023240482,0.009253408,0.28002656,0.00025974284],"about_ca_topic_score_codex":0.00001160672,"about_ca_topic_score_gemma":0.0000122187685,"teacher_disagreement_score":0.96650773,"about_ca_system_score_codex":0.0000060201073,"about_ca_system_score_gemma":0.00001638008,"threshold_uncertainty_score":0.25880444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013048701,0.0004837393,0.9954659,0.0005028536,0.00040814647,0.0002765223,0.000048960344,0.00015755014,0.0013515055],"genre_scores_gemma":[0.8352164,0.00000522279,0.15979987,0.00068640354,0.000055656885,0.00009832596,0.00006449126,0.000011986562,0.0040616267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989252,0.0000596801,0.00021344052,0.00035202707,0.0001893843,0.00026028464],"domain_scores_gemma":[0.99906623,0.00006381214,0.00006216266,0.000597819,0.000112216,0.00009776604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032682848,0.00012238057,0.00014710291,0.00003807206,0.00013150739,0.00013788535,0.000431593,0.000046229557,0.000046024772],"category_scores_gemma":[0.000080257574,0.00009563016,0.0000720414,0.00021720178,0.000013350906,0.0003998623,0.000033690674,0.00004604523,0.000058443748],"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.00003372225,0.0007111765,0.0025074247,0.00045623846,0.00004506783,0.00004568912,0.00029957475,0.0018890769,0.007918439,0.73929566,0.20989853,0.036899425],"study_design_scores_gemma":[0.0012441792,0.00010199457,0.0001208583,0.00015473546,0.000006326054,0.000007939783,0.000110759516,0.2007722,0.040658902,0.0009595065,0.75548404,0.00037855917],"about_ca_topic_score_codex":0.00002530289,"about_ca_topic_score_gemma":0.0000194187,"teacher_disagreement_score":0.835666,"about_ca_system_score_codex":0.000020400335,"about_ca_system_score_gemma":0.00008345095,"threshold_uncertainty_score":0.38996845},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05937404,0.0069286656,0.15540959,0.00069361494,0.009756068,0.0022718115,0.00023945258,0.0007296363,0.7645971],"genre_scores_gemma":[0.9099844,0.000037738435,0.0029652205,0.00003298183,0.00008460698,0.00006135368,0.0007185453,0.000029441831,0.086085714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855137,0.000046147037,0.00034432372,0.0004655093,0.0003593752,0.00023330458],"domain_scores_gemma":[0.99804115,0.00005762552,0.00047508068,0.0010942564,0.0002623356,0.00006955911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013369716,0.00021810099,0.00040411158,0.00012257944,0.000063538515,0.00009540562,0.0010368375,0.00024448053,0.00006275063],"category_scores_gemma":[0.000039463364,0.00021921973,0.00013320701,0.00038425738,0.000017124907,0.00018422476,0.000043888645,0.00021294388,0.00031001781],"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.0002081368,0.0018539866,0.00055501796,0.009913811,0.0011584612,0.00011472474,0.23042396,0.002013348,0.09676607,0.26134095,0.19328676,0.20236479],"study_design_scores_gemma":[0.010995567,0.0021892437,0.17044511,0.014411255,0.00080578105,0.00016998635,0.115745544,0.23745447,0.157863,0.0037261648,0.27297047,0.013223398],"about_ca_topic_score_codex":0.00017588517,"about_ca_topic_score_gemma":0.000081025704,"teacher_disagreement_score":0.8506104,"about_ca_system_score_codex":0.000062941996,"about_ca_system_score_gemma":0.00040226412,"threshold_uncertainty_score":0.89395213},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028218064,0.00004118317,0.85539687,0.000054646793,0.00006449085,0.00008068166,8.7886457e-7,0.00015639814,0.14392269],"genre_scores_gemma":[0.9362424,0.0000028747606,0.06189293,0.0001582822,0.00002390389,0.00006159752,0.000001213737,0.0000022726463,0.001614507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956536,0.0000100878615,0.000095782874,0.00015285723,0.000075469805,0.00010043993],"domain_scores_gemma":[0.9995155,0.0000063376247,0.000026664027,0.0003653765,0.00003635821,0.000049809878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006764315,0.000043280834,0.00004968556,0.000018033219,0.000058487658,0.00003374688,0.00042625453,0.00002291183,0.000058263246],"category_scores_gemma":[0.0000017459254,0.000032800624,0.000021484906,0.0001764815,0.000009532883,0.00023140816,0.000063596024,0.000029660005,0.0004221231],"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":[5.9482966e-7,0.00006796844,0.00093574496,0.000005726415,0.000003928139,0.000002361895,0.0002583906,0.0000011816234,0.0003154209,0.88474953,0.0039042544,0.10975489],"study_design_scores_gemma":[0.00052201236,0.00007550281,0.026264211,0.000037230766,0.000006000898,0.000048267375,0.00018087596,0.032162808,0.011781605,0.032556973,0.8957797,0.0005848003],"about_ca_topic_score_codex":0.000028501387,"about_ca_topic_score_gemma":0.000003928424,"teacher_disagreement_score":0.93596023,"about_ca_system_score_codex":0.000006129114,"about_ca_system_score_gemma":0.000013622881,"threshold_uncertainty_score":0.5425679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030638962,0.0003511239,0.99142903,0.001246806,0.00091275864,0.00011562121,0.000069029426,0.00041106844,0.0024006625],"genre_scores_gemma":[0.9982976,0.000006896344,0.0005535765,0.000059715363,0.00011243605,0.000026828677,0.0000050747176,0.000006448585,0.00093144976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892336,0.00005366887,0.00022196192,0.00029996323,0.00020036161,0.00030071283],"domain_scores_gemma":[0.99911165,0.000068606096,0.00007910378,0.0005540812,0.00007995688,0.000106622516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020911136,0.000111381654,0.00015614832,0.00003453743,0.00008527094,0.00015762747,0.0006265015,0.00005463744,0.000008778589],"category_scores_gemma":[0.000041230312,0.00006938789,0.000047313333,0.00023081081,0.000023932771,0.00040294894,0.000096404525,0.000044584736,0.0003297833],"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.0000075560465,0.000088540546,0.0045554712,0.00006509083,0.00006290037,0.00013196153,0.00018695321,0.00022115957,0.008233011,0.8356843,0.06991265,0.0808504],"study_design_scores_gemma":[0.0016392703,0.00010634093,0.010240169,0.00075130997,0.000011093114,0.00020696555,0.000047317048,0.06573665,0.0026855874,0.0029477738,0.91468155,0.00094596547],"about_ca_topic_score_codex":0.0000702595,"about_ca_topic_score_gemma":0.0000043021305,"teacher_disagreement_score":0.99523365,"about_ca_system_score_codex":0.000066724235,"about_ca_system_score_gemma":0.0000453048,"threshold_uncertainty_score":0.42388073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030293325,0.00015121305,0.96541923,0.0013066154,0.0001783697,0.00020913324,0.000035503585,0.0002381034,0.002168493],"genre_scores_gemma":[0.98383945,0.000007613005,0.015572318,0.00022790763,0.000036059915,0.00002551042,0.00002507662,0.000004494071,0.0002615428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00004824255,0.00020253917,0.00032417744,0.0001251657,0.00025863835],"domain_scores_gemma":[0.9992331,0.000045002882,0.000058122416,0.00040609625,0.00010688651,0.00015074508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312667,0.00014201875,0.0001828593,0.000025420772,0.00015051194,0.00035151906,0.0004315155,0.000055004275,0.00007099803],"category_scores_gemma":[0.000012561027,0.00009134791,0.000036778758,0.00022295545,0.000068082554,0.00066220027,0.00023260819,0.00008597183,0.00012505557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046772107,0.0003159798,0.0070201927,0.00008339718,0.00007269399,0.000015477633,0.0010264585,0.000035706467,0.0047438834,0.2400904,0.06878904,0.6778021],"study_design_scores_gemma":[0.0007215828,0.000080122445,0.08459812,0.000058551967,0.0000025195802,0.000069696434,0.00034186715,0.8494184,0.002056593,0.022789724,0.03935445,0.00050834764],"about_ca_topic_score_codex":0.00029817462,"about_ca_topic_score_gemma":0.000012330979,"teacher_disagreement_score":0.95354617,"about_ca_system_score_codex":0.000017705443,"about_ca_system_score_gemma":0.00001693491,"threshold_uncertainty_score":0.37250593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035523793,0.00023379373,0.950992,0.0004062873,0.00008803096,0.00014412412,0.000005459058,0.00028778226,0.04429015],"genre_scores_gemma":[0.95307994,0.000004365173,0.039524067,0.00028842874,0.00014576166,0.00009229529,0.000035789,0.0000055221426,0.006823809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992228,0.000016738635,0.00017817147,0.00025439187,0.00016202318,0.00016584892],"domain_scores_gemma":[0.99931127,0.000017571405,0.00005762279,0.00050243887,0.000065988825,0.000045112236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009025119,0.00008123414,0.00008829202,0.000030624076,0.0001266109,0.00018674738,0.0005660664,0.000041782776,0.000026055588],"category_scores_gemma":[6.170442e-7,0.0000642347,0.000035095367,0.00031597956,0.0000108982695,0.00034891363,0.00009019508,0.000044084583,0.00060048373],"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.0000014891015,0.00020873584,0.005171219,0.000087282955,0.000008749946,0.0000030521096,0.00010617055,0.0004981743,0.003980756,0.91785467,0.018368248,0.05371147],"study_design_scores_gemma":[0.00013630453,0.0000048094757,0.0052583944,0.00001885865,0.0000018626555,0.000009183109,0.0000169623,0.011610164,0.0004607553,0.005135527,0.97719675,0.00015043265],"about_ca_topic_score_codex":0.00035214057,"about_ca_topic_score_gemma":0.0002760335,"teacher_disagreement_score":0.9588285,"about_ca_system_score_codex":0.000014265714,"about_ca_system_score_gemma":0.000016110416,"threshold_uncertainty_score":0.77182037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24864922,0.00019429803,0.73831475,0.00074922876,0.00022754559,0.00014409138,6.219968e-7,0.00016570401,0.01155457],"genre_scores_gemma":[0.9855889,0.000008799906,0.012444812,0.00017477939,0.000031659314,0.00000952057,0.0000011052235,0.0000027964281,0.0017376477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993358,0.000024335572,0.00013091136,0.00022089393,0.00013387861,0.00015416698],"domain_scores_gemma":[0.99957377,0.000027372816,0.00003479144,0.00023749722,0.000046164507,0.00008039877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010887458,0.00007143849,0.000086425745,0.000028027034,0.000113910646,0.00021168622,0.00022754804,0.0000393496,0.000034910052],"category_scores_gemma":[0.000012384255,0.000050662547,0.000016127904,0.00012370355,0.000015349771,0.0006757793,0.00023616884,0.00004927781,0.00016759831],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021886524,0.00006477973,0.0037925215,0.00004526248,0.000009730098,0.000016729973,0.0011289406,0.000019828982,0.022388432,0.059325248,0.031910855,0.8812955],"study_design_scores_gemma":[0.00090315554,0.00013095287,0.049722094,0.00021530305,0.0000037823922,0.00011002572,0.0003950777,0.8793249,0.003807626,0.0049000923,0.059887256,0.0005997223],"about_ca_topic_score_codex":0.00011815583,"about_ca_topic_score_gemma":0.0000064386313,"teacher_disagreement_score":0.88069576,"about_ca_system_score_codex":0.000010148081,"about_ca_system_score_gemma":0.000010385632,"threshold_uncertainty_score":0.21541929},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43194064,0.00022720113,0.516243,0.0069605997,0.00021393363,0.005055419,0.0002561634,0.0013992066,0.037703857],"genre_scores_gemma":[0.88939756,0.00007125198,0.10943042,0.0005881346,0.00006919786,0.00020630006,0.000011352134,0.000046304263,0.00017949038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953744,0.0000456503,0.0013068366,0.0012598236,0.0012642922,0.00074904406],"domain_scores_gemma":[0.9967814,0.00017526199,0.0012586247,0.0004926982,0.0010044809,0.000287501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012097021,0.00083745917,0.00094353844,0.0006763596,0.0008860381,0.00041167173,0.0023648776,0.00037236305,0.000007506204],"category_scores_gemma":[0.00011749869,0.00058563723,0.00034582597,0.0009969162,0.0006153108,0.00027929773,0.000741905,0.001105217,0.0000010355598],"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.0016243248,0.0007998516,0.0050423983,0.0011366836,0.00018276616,0.0000011911055,0.0050674337,0.002087233,0.12435065,0.6951065,0.0008371166,0.16376384],"study_design_scores_gemma":[0.003345949,0.0046127015,0.18969518,0.0076066307,0.00024723486,0.0005593183,0.0025544425,0.104197055,0.26689962,0.41326013,0.002456993,0.004564759],"about_ca_topic_score_codex":0.00006019317,"about_ca_topic_score_gemma":0.000012891927,"teacher_disagreement_score":0.4574569,"about_ca_system_score_codex":0.000093723516,"about_ca_system_score_gemma":0.00009908986,"threshold_uncertainty_score":0.9996595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005894607,0.0026668382,0.9886083,0.00010273191,0.004090688,0.0005204887,0.00012578131,0.00015043328,0.003675805],"genre_scores_gemma":[0.85013056,0.00006650865,0.14454938,0.00025498393,0.0019037875,0.00007076124,0.00015820541,0.00007811763,0.002787677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534297,0.00009797502,0.0010586181,0.0012019691,0.0013444822,0.0009540083],"domain_scores_gemma":[0.996089,0.00039235264,0.0007927364,0.0020159078,0.00045456024,0.00025547258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015500896,0.00054016826,0.0009482695,0.00053142046,0.00015824476,0.00044063793,0.0047107455,0.00041240558,0.000004568879],"category_scores_gemma":[0.0001233408,0.0004685281,0.00016647964,0.0015650718,0.000612059,0.00075713295,0.0013190364,0.00063239137,0.000033749824],"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.000017671347,0.000427791,0.0016232562,0.001560644,0.000100083904,0.00015974397,0.0021241277,0.44261044,0.00044984615,0.21005064,0.0011244139,0.33975133],"study_design_scores_gemma":[0.00049777405,0.00017103068,0.00098106,0.0019374304,0.000018236156,0.00015516585,5.1125494e-7,0.91547394,0.00077220844,0.0047357352,0.074064575,0.001192325],"about_ca_topic_score_codex":0.0000539628,"about_ca_topic_score_gemma":0.000016251202,"teacher_disagreement_score":0.8500716,"about_ca_system_score_codex":0.00051572983,"about_ca_system_score_gemma":0.0012954817,"threshold_uncertainty_score":0.99977666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009854045,0.000082193474,0.9935697,0.000018566729,0.00035277245,0.00349953,0.0000052319397,0.00007737333,0.0014092608],"genre_scores_gemma":[0.39158556,2.980345e-7,0.6068929,0.000005015437,0.000019448004,0.0014677192,0.000004296327,0.0000047874446,0.00001996715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971805,0.0012389949,0.0007129444,0.0003118051,0.00031135994,0.00024435992],"domain_scores_gemma":[0.99871534,0.00011592316,0.00029613177,0.0006164607,0.00020656452,0.00004957796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038690418,0.00011703379,0.0003314426,0.00009573185,0.000055494722,0.00007210909,0.00042173424,0.00009613262,0.000002520691],"category_scores_gemma":[0.0001600022,0.00010744442,0.00006847297,0.0008102437,0.000012126176,0.00030482488,0.00008582392,0.0000836631,0.0000063117845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007650846,0.00032321515,0.0013109738,0.001795425,0.00003176597,0.000044237688,0.0020203853,0.06326457,0.030210247,0.50495625,0.00009770655,0.39586872],"study_design_scores_gemma":[0.00069654465,0.00010915392,0.018135414,0.00085687626,0.000005149831,0.00006792344,0.00024771973,0.8888981,0.08916956,0.00042399426,0.0011388792,0.00025070368],"about_ca_topic_score_codex":0.00005220045,"about_ca_topic_score_gemma":8.95826e-7,"teacher_disagreement_score":0.8256335,"about_ca_system_score_codex":0.00014086712,"about_ca_system_score_gemma":0.00010760447,"threshold_uncertainty_score":0.43814564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10753734,0.00026943896,0.88526255,0.002103472,0.0005235214,0.00017747057,0.0000053124722,0.0002611986,0.0038596843],"genre_scores_gemma":[0.9971064,0.000022293087,0.002272343,0.0002581473,0.000085544794,0.000002784838,0.0000021337046,0.0000029511277,0.00024744653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989819,0.00006328514,0.00021878065,0.00030784807,0.00022093441,0.00020723029],"domain_scores_gemma":[0.9994988,0.000031975836,0.000057967012,0.00025011197,0.000038457347,0.00012271502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025399213,0.00011797995,0.00015208828,0.00005539474,0.00020648031,0.00029585062,0.00026646873,0.00012662772,0.000021569558],"category_scores_gemma":[0.000011097805,0.00009281999,0.000037349902,0.0002641047,0.000013497334,0.0009066121,0.000024769286,0.00019851436,0.000010444972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001746587,0.00015635775,0.00047158884,0.000015342852,0.00001075573,0.000044089207,0.0013965667,0.00008580153,0.0026616368,0.009905186,0.005149511,0.9800857],"study_design_scores_gemma":[0.011168592,0.0013699614,0.010994581,0.0016474279,0.00006977619,0.0011464506,0.002498235,0.64967567,0.033120662,0.026529152,0.25861135,0.0031681363],"about_ca_topic_score_codex":0.000045003246,"about_ca_topic_score_gemma":0.00001079584,"teacher_disagreement_score":0.97691756,"about_ca_system_score_codex":0.00002469982,"about_ca_system_score_gemma":0.00003920338,"threshold_uncertainty_score":0.37850893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006362566,0.00041253946,0.8853221,0.00078536494,0.0006735142,0.07241356,0.000013927776,0.00064729253,0.033369154],"genre_scores_gemma":[0.9448081,0.000007649143,0.0059932233,0.00004747004,0.000019154957,0.048777185,0.00001210073,0.000015940139,0.0003191665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997092,0.0008332038,0.0008921586,0.00043330088,0.00040096114,0.0003483544],"domain_scores_gemma":[0.99688953,0.00010122876,0.00038109222,0.0023051286,0.00021754994,0.00010548211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862284,0.00019882031,0.00030379737,0.00018286008,0.00014274317,0.00026146715,0.0013781199,0.00014429208,0.000007309829],"category_scores_gemma":[0.00013476785,0.00019336549,0.000053370888,0.00070123805,0.000031011576,0.0006344082,0.00014739322,0.0003021761,0.00015074822],"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.000065938155,0.0020293365,0.008266799,0.00053344993,0.0000775043,0.00003553387,0.008491004,0.0452399,0.0039055557,0.8948225,0.0046297624,0.03190275],"study_design_scores_gemma":[0.0047379076,0.00017567477,0.009433272,0.0006409917,0.0000073561496,0.00027944834,0.0011841389,0.74334925,0.0016175129,0.0017782763,0.23568156,0.0011145715],"about_ca_topic_score_codex":0.00065890286,"about_ca_topic_score_gemma":0.00016753901,"teacher_disagreement_score":0.93844557,"about_ca_system_score_codex":0.00029349758,"about_ca_system_score_gemma":0.00013968648,"threshold_uncertainty_score":0.7885216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3500902,0.000019794652,0.6491033,0.00016693544,0.000107780725,0.00012544983,0.000004927389,0.00007485557,0.00030674468],"genre_scores_gemma":[0.99811447,0.000033629618,0.0015183802,0.00021595562,0.000014559487,0.000017758299,0.00007026542,0.0000018442659,0.000013166102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994562,0.000028284838,0.00021544786,0.000098663964,0.00008660464,0.000114754985],"domain_scores_gemma":[0.9997123,0.000098449644,0.000058160054,0.000059145805,0.000040474482,0.00003150073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016699033,0.00006691307,0.00009400341,0.000090216214,0.00006391924,0.00024903595,0.000054978053,0.000041792297,5.5203384e-7],"category_scores_gemma":[0.000017172573,0.00005903398,0.0000070773185,0.00033545136,0.000026691925,0.0016287015,0.000031975345,0.000055535864,0.000007766217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004288539,0.000019857558,0.006884346,0.00009329331,0.000013074211,0.000018669383,0.0028202564,0.037736937,0.000014510231,0.0052003083,0.0005546851,0.94660115],"study_design_scores_gemma":[0.00043662958,0.00007604827,0.11944546,0.000046099838,0.0000021558494,0.00004799348,0.0001594868,0.87837887,0.0000061239775,0.0008817783,0.00041353304,0.00010583555],"about_ca_topic_score_codex":0.000018631834,"about_ca_topic_score_gemma":0.000017069286,"teacher_disagreement_score":0.94649535,"about_ca_system_score_codex":0.000013935028,"about_ca_system_score_gemma":0.000017326338,"threshold_uncertainty_score":0.24073358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059690927,0.0014738826,0.95189524,0.0007604425,0.003129262,0.0005615674,0.00000905018,0.00033206295,0.03586938],"genre_scores_gemma":[0.9511016,0.000031519074,0.045542903,0.00035457476,0.00014810025,0.00017267099,0.00003932174,0.000012613674,0.0025966887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976153,0.0002772431,0.0005492886,0.00081667746,0.00044640174,0.00029513816],"domain_scores_gemma":[0.99783033,0.00015113763,0.00021776567,0.0014543952,0.00022863077,0.00011773383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093657186,0.00027327688,0.0009600265,0.000068011825,0.00006464328,0.00083762035,0.001338906,0.00022581169,0.000078051235],"category_scores_gemma":[0.000104855346,0.00021267623,0.00049166085,0.00021151923,0.00005289747,0.000038766135,0.0019971784,0.00038822324,0.00008742479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014000669,0.00077346666,0.000024269399,0.0008117715,0.0007809984,0.0007265788,0.004053193,0.22269036,0.00017277725,0.7188599,0.018317698,0.03138889],"study_design_scores_gemma":[0.024188744,0.000004142626,0.000022078724,0.00021881942,0.000017013941,0.000021174184,0.00003333908,0.9712361,0.00017071418,0.00085617625,0.0028349208,0.00039675954],"about_ca_topic_score_codex":0.00017894253,"about_ca_topic_score_gemma":0.0000066160783,"teacher_disagreement_score":0.9451325,"about_ca_system_score_codex":0.000053383657,"about_ca_system_score_gemma":0.000245816,"threshold_uncertainty_score":0.8672685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017549552,0.00063875935,0.8069681,0.0005749579,0.00034529468,0.0001475066,0.000040193558,0.0003400783,0.17339553],"genre_scores_gemma":[0.9917276,0.000010591686,0.0051967767,0.00029206078,0.000027018401,0.000008660739,0.000020869857,0.0000063156185,0.002710102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861676,0.00004873257,0.00024010982,0.00044253215,0.0003424005,0.00030945003],"domain_scores_gemma":[0.99894285,0.00006831739,0.00009051458,0.00049033354,0.0003061061,0.00010188488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015074397,0.00014366805,0.00022526179,0.000022082027,0.000107825734,0.00032266267,0.0003947179,0.000048053113,0.00014143783],"category_scores_gemma":[0.000024711464,0.0001115486,0.000033480686,0.0003817719,0.00004791023,0.00035672475,0.00013575677,0.00012014159,0.00025619075],"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.000009460374,0.00023151025,0.0037129074,0.00008732194,0.00009696126,0.00048187358,0.0004485965,0.00010978402,0.007177626,0.91422457,0.020888727,0.05253065],"study_design_scores_gemma":[0.005474082,0.00041773668,0.0077872924,0.0013720795,0.000047137164,0.001459544,0.0007382511,0.25549477,0.018437887,0.0014524371,0.7048043,0.002514507],"about_ca_topic_score_codex":0.00003079138,"about_ca_topic_score_gemma":0.000034191045,"teacher_disagreement_score":0.9741781,"about_ca_system_score_codex":0.000045699275,"about_ca_system_score_gemma":0.0003445112,"threshold_uncertainty_score":0.454882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133578265,0.0002700843,0.98028946,0.00042962504,0.0014313726,0.0006167688,0.0030805196,0.00038016125,0.00014418295],"genre_scores_gemma":[0.9915909,0.0000047789167,0.0043155886,0.000106882755,0.00019684908,0.00012639425,0.0026086334,0.000018197003,0.0010317317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729323,0.000113123075,0.0006304915,0.0007488705,0.00064188713,0.0005724234],"domain_scores_gemma":[0.9978057,0.0002684815,0.00016637926,0.0007520359,0.00076994975,0.00023744539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029749502,0.00027168685,0.00042616783,0.00005765014,0.00035279646,0.001010645,0.0009637101,0.00013622215,0.000022728253],"category_scores_gemma":[0.00015083936,0.00025376573,0.00017232198,0.001005447,0.000032290565,0.0005402823,0.00031936326,0.00012333688,0.000047252186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109158434,0.007272103,0.040255796,0.0010297231,0.0018599039,0.0007162991,0.00096464803,0.24992916,0.006062551,0.499699,0.15875119,0.03335047],"study_design_scores_gemma":[0.001747349,0.000085866166,0.0069203535,0.000073360825,0.000026252614,0.000038772043,0.00016281281,0.9067456,0.00066888484,0.00035094036,0.08271227,0.0004675545],"about_ca_topic_score_codex":0.000049574828,"about_ca_topic_score_gemma":0.000020683732,"teacher_disagreement_score":0.9782331,"about_ca_system_score_codex":0.00013774297,"about_ca_system_score_gemma":0.00017073906,"threshold_uncertainty_score":0.9999915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733549,0.0008247986,0.25493434,0.0027472656,0.0010840931,0.0003499057,0.00002084523,0.0006128336,0.0058769602],"genre_scores_gemma":[0.9830572,0.0000021077635,0.016254073,0.0005077809,0.00006426416,0.0000041490985,0.0000065167096,0.000004139514,0.00009979199],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988259,0.000046566423,0.00027840366,0.0003400358,0.00020043674,0.0003086559],"domain_scores_gemma":[0.998989,0.00013790993,0.000095143725,0.00067119993,0.000033064167,0.00007368603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022185572,0.00013496136,0.00020056442,0.00009455324,0.000056272045,0.00020278888,0.0013227197,0.00006659447,0.000009963034],"category_scores_gemma":[0.00021277554,0.00012177354,0.0000424697,0.00033923658,0.000013935851,0.0006491826,0.000098543285,0.00014839538,0.00007497222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005814128,0.00054200116,0.01783798,0.00013759971,0.000038396236,0.0008103021,0.017366268,0.0047856234,0.0019057003,0.016687732,0.008326505,0.9315038],"study_design_scores_gemma":[0.0070422487,0.0016885771,0.69196874,0.0030185957,0.00004611084,0.00029605473,0.0022743058,0.20378815,0.011828935,0.03830187,0.035505217,0.004241174],"about_ca_topic_score_codex":0.000046387253,"about_ca_topic_score_gemma":0.00007938207,"teacher_disagreement_score":0.9272626,"about_ca_system_score_codex":0.000028059643,"about_ca_system_score_gemma":0.000025979973,"threshold_uncertainty_score":0.4965781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009237931,0.000465319,0.9738147,0.006343447,0.00040404062,0.00006648853,0.000003309926,0.00015788618,0.009506825],"genre_scores_gemma":[0.95644695,0.000004055202,0.040022556,0.00049803214,0.000035852903,0.000008805559,0.000003193229,0.0000024513292,0.0029781093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.000019468076,0.00008509161,0.00022685034,0.00008640767,0.000094200725],"domain_scores_gemma":[0.9994922,0.000018215957,0.000016271104,0.00031412978,0.000105949606,0.000053219643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000640141,0.000044535656,0.00006414994,0.000015456859,0.000080604965,0.000106737636,0.00009590674,0.000021140428,0.00002117591],"category_scores_gemma":[0.00002382759,0.000037435548,0.000018624458,0.00021485277,0.000016454342,0.00012526936,0.000045141383,0.000036505546,0.000018455885],"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.000003989941,0.00035087942,0.0011989886,0.000070971066,0.000029577617,0.00026114815,0.00030722815,0.00064242043,0.023342129,0.70218974,0.07413148,0.19747145],"study_design_scores_gemma":[0.0012072575,0.0000898897,0.024447896,0.00014541842,0.000011219716,0.0005205992,0.00022285346,0.4979442,0.037102744,0.0077456576,0.42989948,0.00066278304],"about_ca_topic_score_codex":0.000010409488,"about_ca_topic_score_gemma":0.0000060656216,"teacher_disagreement_score":0.947209,"about_ca_system_score_codex":0.0000062732483,"about_ca_system_score_gemma":0.000074239244,"threshold_uncertainty_score":0.15265773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007135973,0.00038118102,0.9762845,0.002318063,0.0010569702,0.00018539619,0.000039358485,0.000040665836,0.012557906],"genre_scores_gemma":[0.96616197,0.000022613245,0.020066055,0.0005911228,0.00011206694,0.000020245683,0.000015056652,0.0000063387747,0.0130045535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917156,0.000033397617,0.00021166679,0.00022689716,0.00018668066,0.00016981651],"domain_scores_gemma":[0.9989906,0.00016277982,0.00006970441,0.0005313514,0.00020971036,0.000035861125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026747843,0.00007470355,0.00014874095,0.000011410871,0.00019205843,0.00011559224,0.000469535,0.000037327125,0.00012546679],"category_scores_gemma":[0.00003850929,0.00004800807,0.00009233184,0.00021342092,0.00005871414,0.0001877161,0.00019213752,0.000051981813,0.000019323981],"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.000035987876,0.00029254798,0.00018184716,0.000084543506,0.0000643227,0.000014679929,0.000499477,0.0002683209,0.005589273,0.833216,0.13745844,0.022294566],"study_design_scores_gemma":[0.00086865586,0.00012502773,0.0018998524,0.000058997783,0.000009822426,0.000028545694,0.00010910976,0.2153956,0.015199936,0.01780157,0.7482689,0.00023400322],"about_ca_topic_score_codex":0.00007904405,"about_ca_topic_score_gemma":0.000107904416,"teacher_disagreement_score":0.959026,"about_ca_system_score_codex":0.00001889823,"about_ca_system_score_gemma":0.00008880803,"threshold_uncertainty_score":0.19577123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037391465,0.0039518676,0.58640397,0.019533174,0.002600956,0.00031157443,0.000028644608,0.0003027043,0.34947565],"genre_scores_gemma":[0.9839525,0.000019117297,0.007273806,0.00012172032,0.00002502347,0.000003880124,0.000001967565,0.0000025459262,0.00859942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925214,0.000056153698,0.00015121115,0.00017533237,0.0001867051,0.00017845619],"domain_scores_gemma":[0.99909276,0.00005220016,0.0000574333,0.0005828937,0.00017024743,0.00004449097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019741463,0.000060216218,0.00011320267,0.0000102032545,0.00015342659,0.00010417313,0.00049381313,0.000022293127,0.000017636074],"category_scores_gemma":[0.000030510048,0.000039360795,0.00004910023,0.00039910997,0.000085402484,0.00014477756,0.0002118386,0.000051876617,0.00002749913],"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.0000022169168,0.000054335247,0.00024980863,0.000020094325,0.000013949387,0.000025531957,0.000169613,0.00008390371,0.002659629,0.95599604,0.038196314,0.0025285697],"study_design_scores_gemma":[0.0012026983,0.00020315257,0.03305629,0.00018299902,0.0000102916665,0.00016659824,0.0017458096,0.2097347,0.1251041,0.04254207,0.58537364,0.00067768194],"about_ca_topic_score_codex":0.00012498308,"about_ca_topic_score_gemma":0.000101203055,"teacher_disagreement_score":0.94656104,"about_ca_system_score_codex":0.000012252292,"about_ca_system_score_gemma":0.000113780756,"threshold_uncertainty_score":0.16050866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014501,0.00025286354,0.8635341,0.0031825786,0.00017570723,0.0005204343,0.000036971436,0.00014179402,0.0020105692],"genre_scores_gemma":[0.8678822,0.00000277403,0.13181579,0.000054923446,0.00007865088,0.000019227786,0.000013413906,0.00000720366,0.00012584293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.000021357348,0.00014080039,0.00032588962,0.00016672774,0.00021753756],"domain_scores_gemma":[0.99926716,0.00014057767,0.000126458,0.000325297,0.00007165696,0.00006882714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016761813,0.00012357614,0.00015456253,0.000038686758,0.00015230753,0.0002302092,0.00035828387,0.000042887412,0.000002822527],"category_scores_gemma":[0.00007650716,0.00010033727,0.000022634771,0.00014697552,0.000045087836,0.0006099988,0.00007958752,0.000054663957,0.000014756681],"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.00048232128,0.0004725542,0.0014551803,0.0004709152,0.00031188448,0.00022778066,0.031898,0.079982474,0.01497124,0.8230082,0.0015065487,0.045212913],"study_design_scores_gemma":[0.02246559,0.0063214926,0.043088797,0.0028794617,0.000366309,0.0003427119,0.0021728647,0.727223,0.089723974,0.043200225,0.05741659,0.00479899],"about_ca_topic_score_codex":0.000034345623,"about_ca_topic_score_gemma":0.000013441944,"teacher_disagreement_score":0.779808,"about_ca_system_score_codex":0.000027894692,"about_ca_system_score_gemma":0.000037497208,"threshold_uncertainty_score":0.4091635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06700449,0.0000704271,0.8687858,0.0037445289,0.00030375645,0.000074582924,0.0000037097898,0.00010690835,0.059905794],"genre_scores_gemma":[0.99052906,0.0000019074955,0.0049831737,0.00051395054,0.000017847458,0.0000027030696,0.000002379873,0.0000012464361,0.00394774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953103,0.000026522635,0.0000831401,0.00020480611,0.000087714456,0.000066783476],"domain_scores_gemma":[0.99956375,0.00003570272,0.000018139961,0.00029252432,0.00005861235,0.000031239408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010287534,0.00003941609,0.000056847304,0.000009760827,0.000035065103,0.00011674917,0.00009182091,0.000023831704,0.000012661099],"category_scores_gemma":[0.00004389309,0.000032159845,0.000014236798,0.000097878816,0.000011814909,0.00014057737,0.000055709104,0.000034861852,0.000019075322],"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.000003283202,0.00013717018,0.0015863389,0.000039077368,0.000006422636,0.000058760732,0.00026489003,0.000017771656,0.0015182015,0.8093557,0.007822591,0.1791898],"study_design_scores_gemma":[0.0019150786,0.0003019563,0.21449617,0.0001749952,0.0000076153838,0.00026816563,0.00010387231,0.40658376,0.02536808,0.054372426,0.295529,0.00087888545],"about_ca_topic_score_codex":0.000005917525,"about_ca_topic_score_gemma":0.0000049859436,"teacher_disagreement_score":0.92352456,"about_ca_system_score_codex":0.000008819648,"about_ca_system_score_gemma":0.000016904383,"threshold_uncertainty_score":0.13114405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040685284,0.00027529872,0.9618049,0.0008176733,0.0007415204,0.0002635374,0.00015734535,0.00015511697,0.03537773],"genre_scores_gemma":[0.73006463,0.00005296282,0.20544887,0.0012883064,0.00047716833,0.00037682918,0.00044614082,0.000027585269,0.061817534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875534,0.0000214587,0.00025464638,0.00045962393,0.00019016756,0.00031874768],"domain_scores_gemma":[0.99883085,0.000058596957,0.000069302296,0.0006220758,0.00033635768,0.00008282195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017557858,0.000107261505,0.00015442826,0.000030290068,0.00023152803,0.00051663467,0.0004377258,0.000050602503,0.00020345197],"category_scores_gemma":[0.000059071703,0.00010810419,0.00008702582,0.00044155715,0.000011686646,0.0005939572,0.00009724373,0.00005642065,0.000076308184],"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.000027536886,0.00051153864,0.000234888,0.00016704315,0.00014975759,0.000059487105,0.0008732753,0.0011868138,0.09575221,0.61251366,0.25811595,0.030407839],"study_design_scores_gemma":[0.0009869644,0.00006687885,0.00022648668,0.00003852141,0.000008393161,0.000038688497,0.00010368329,0.06622171,0.05280591,0.004563759,0.8745967,0.00034227097],"about_ca_topic_score_codex":0.000053550993,"about_ca_topic_score_gemma":0.00009175264,"teacher_disagreement_score":0.75635606,"about_ca_system_score_codex":0.00006494075,"about_ca_system_score_gemma":0.00018543258,"threshold_uncertainty_score":0.498192},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031367566,0.0004242948,0.94967073,0.0008510854,0.00969667,0.0034191161,0.0021513412,0.000521931,0.001897282],"genre_scores_gemma":[0.93439215,0.000119389995,0.039377958,0.003333957,0.0012297096,0.0024528007,0.013752568,0.00020107771,0.0051403693],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944145,0.000066466935,0.002265389,0.0010079594,0.0009250712,0.0013205804],"domain_scores_gemma":[0.9946031,0.0001480199,0.0013725727,0.001925203,0.0016352771,0.0003158209],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010425511,0.00094894523,0.0012120226,0.00038777108,0.0007367493,0.0043664007,0.002018034,0.0010774989,0.000041746538],"category_scores_gemma":[0.00012088011,0.00096228725,0.0011404863,0.00045468364,0.00015233752,0.0028509581,0.0011620084,0.0011655374,0.000069051974],"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.002992347,0.010619757,0.0029576407,0.05815821,0.011938995,0.00017350966,0.07818507,0.021152385,0.0032475104,0.22093226,0.4278991,0.16174324],"study_design_scores_gemma":[0.01245829,0.00090104504,0.0014818279,0.0037801869,0.000349814,0.0002954764,0.0051576854,0.66120017,0.0019565462,0.007860858,0.30042276,0.004135364],"about_ca_topic_score_codex":0.00007961051,"about_ca_topic_score_gemma":0.00012086772,"teacher_disagreement_score":0.91029274,"about_ca_system_score_codex":0.00064704317,"about_ca_system_score_gemma":0.00052738073,"threshold_uncertainty_score":0.9992828},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17452905,0.00051450223,0.8045453,0.00073869905,0.004289814,0.0031669324,0.0014253748,0.00062776724,0.010162567],"genre_scores_gemma":[0.8930405,0.00038253344,0.09634009,0.0008184018,0.00038378814,0.00038392076,0.0033941471,0.000107955144,0.00514866],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682015,0.00008783764,0.0010800437,0.00067476573,0.000632064,0.00070511753],"domain_scores_gemma":[0.99702793,0.00011873515,0.00079740374,0.0012129628,0.00056646264,0.00027651986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063336233,0.0006203854,0.00083935395,0.00027850544,0.0005499415,0.0020229318,0.0011496923,0.00064792554,0.000023377936],"category_scores_gemma":[0.00009431782,0.0006190576,0.0003393328,0.00039615177,0.00011765231,0.0014754027,0.0021456517,0.0008376623,0.00008379855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018621393,0.0069568744,0.01738632,0.045395613,0.0074507413,0.000637303,0.28625098,0.0078294845,0.004522302,0.10976053,0.40702543,0.104922295],"study_design_scores_gemma":[0.004518513,0.00026577347,0.0014096627,0.0016563211,0.000093897,0.000175986,0.0015721092,0.8773536,0.0012668548,0.00091151666,0.10918037,0.001595406],"about_ca_topic_score_codex":0.00009206945,"about_ca_topic_score_gemma":0.000018230277,"teacher_disagreement_score":0.8695241,"about_ca_system_score_codex":0.00033139807,"about_ca_system_score_gemma":0.00026096613,"threshold_uncertainty_score":0.9996261},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010140891,0.00011787332,0.9669602,0.016060354,0.00018440722,0.0001684719,0.0000030428455,0.00021023753,0.006154544],"genre_scores_gemma":[0.9273975,0.00000374815,0.056578275,0.0156234205,0.000044947978,0.000054145134,0.000046929414,0.00000812714,0.00024291512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988329,0.000074591604,0.00040265825,0.00015286393,0.000338006,0.0001990221],"domain_scores_gemma":[0.99898696,0.000048933118,0.00030235777,0.0003344131,0.00026841398,0.000058895956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888772,0.00012051609,0.00024805483,0.00006753075,0.0001526076,0.0007188692,0.0002632389,0.00003685844,0.0000030801496],"category_scores_gemma":[0.000076984914,0.00009441617,0.000054203872,0.00042290532,0.00010579161,0.0015810532,0.00004042352,0.000093190145,0.000034114786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013910804,0.0002065607,0.00045205583,0.0029924307,0.00056974386,0.000930924,0.042472806,0.028001765,0.0060260897,0.21112525,0.15138409,0.54192746],"study_design_scores_gemma":[0.2738134,0.00005552504,0.00027088437,0.001706622,0.00008210174,0.002155109,0.0014441629,0.3899382,0.008120983,0.0013468799,0.31926095,0.0018051966],"about_ca_topic_score_codex":0.000007364818,"about_ca_topic_score_gemma":7.927611e-7,"teacher_disagreement_score":0.9172566,"about_ca_system_score_codex":0.000035402427,"about_ca_system_score_gemma":0.00014849727,"threshold_uncertainty_score":0.6932072},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097894795,0.0014705807,0.88721925,0.011727604,0.00011268869,0.000516105,0.000025485335,0.00016861413,0.0008648959],"genre_scores_gemma":[0.9866814,0.000085012696,0.009717303,0.0030623556,0.000013392013,0.00031103074,0.000007781011,0.000011523341,0.000110214474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980292,0.00046030115,0.00043189203,0.00032581334,0.00038990262,0.0003629129],"domain_scores_gemma":[0.9970341,0.00058785925,0.000273248,0.0017887397,0.00020643666,0.00010965218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007677499,0.00018429513,0.00030737312,0.000067683184,0.0002173839,0.00016733166,0.001038298,0.000119271324,0.00004052728],"category_scores_gemma":[0.0004234026,0.00014795428,0.00014496608,0.00044221405,0.000049778315,0.0002523699,0.00023360555,0.00022923478,0.000006368573],"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.00008737512,0.0005831482,0.00262817,0.000021067184,0.000098260214,0.000034304703,0.0005926012,0.0005671777,0.024563761,0.9536624,0.0077803275,0.009381429],"study_design_scores_gemma":[0.0035992688,0.00048739545,0.012761765,0.00047306894,0.000040529412,0.00010565179,0.0004096333,0.33747727,0.60851085,0.027803123,0.0075770356,0.00075442577],"about_ca_topic_score_codex":0.0016815524,"about_ca_topic_score_gemma":0.0003538041,"teacher_disagreement_score":0.9258593,"about_ca_system_score_codex":0.00016936434,"about_ca_system_score_gemma":0.00016325574,"threshold_uncertainty_score":0.60334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007915715,0.00030276104,0.98499155,0.00051779934,0.00031572682,0.000068974136,0.0000018443554,0.00012261985,0.0057630083],"genre_scores_gemma":[0.9691212,0.000002017528,0.029238073,0.00041548687,0.000020569269,0.000009173376,0.000014599799,0.0000056146187,0.0011732492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988299,0.00007756702,0.0002560862,0.0003567496,0.0001540225,0.00032565036],"domain_scores_gemma":[0.99927855,0.000061558734,0.000051819206,0.00047346106,0.000073141644,0.000061497725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030387126,0.00010406688,0.00018256727,0.000040488867,0.000060009337,0.00019613815,0.00038709506,0.000065687076,0.00005335792],"category_scores_gemma":[0.000032761833,0.00009845482,0.000054119602,0.0008138359,0.0000111498375,0.00024055238,0.000112319765,0.00014165076,0.00004914153],"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.00001977547,0.0008080007,0.030334158,0.00010051238,0.000073267576,0.0009868717,0.00028848345,0.51043606,0.0045007947,0.28463492,0.0037500032,0.16406716],"study_design_scores_gemma":[0.00043071638,0.0000071066643,0.0036054477,0.000048088415,0.0000011929818,0.000006507076,0.00001706415,0.99380183,0.0006974178,0.00007000288,0.0011830038,0.00013162734],"about_ca_topic_score_codex":0.000050592873,"about_ca_topic_score_gemma":0.00014832181,"teacher_disagreement_score":0.9612055,"about_ca_system_score_codex":0.000049419952,"about_ca_system_score_gemma":0.0001214346,"threshold_uncertainty_score":0.4014871},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007742043,0.0007236085,0.9910867,0.0014708253,0.002856582,0.0003871599,0.00003411383,0.000155032,0.0032085578],"genre_scores_gemma":[0.84414566,0.00036507912,0.15033522,0.0010757911,0.00064905087,0.000042329615,0.000023539673,0.000103003935,0.0032603282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606603,0.00004793742,0.00070149807,0.0011631238,0.0013397228,0.0006816603],"domain_scores_gemma":[0.9965121,0.00061386963,0.00045776882,0.0018740967,0.00039507815,0.000147048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014020727,0.00041947557,0.0005531634,0.0002807036,0.000498389,0.00048066862,0.0052871276,0.00021166218,0.0000041750354],"category_scores_gemma":[0.00011044015,0.00030381567,0.00034122128,0.0008278103,0.0020558147,0.00030356576,0.0015475451,0.0006112957,0.00006452093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009872105,0.000038326205,0.000060083876,0.00012315382,0.000058415724,0.0000892441,0.0010309727,0.039089352,0.00005975433,0.2846588,0.00023479424,0.67454726],"study_design_scores_gemma":[0.00023126711,0.00018952046,0.00039823735,0.00069753954,0.00001038657,0.00006407317,8.937867e-7,0.8353648,0.00019482493,0.15701443,0.0052273404,0.00060667715],"about_ca_topic_score_codex":0.000049077684,"about_ca_topic_score_gemma":0.00012644344,"teacher_disagreement_score":0.8440682,"about_ca_system_score_codex":0.00018901432,"about_ca_system_score_gemma":0.0004510336,"threshold_uncertainty_score":0.9999414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842556,0.004987186,0.0030771203,0.0021512734,0.0024287202,0.0014706267,0.000051235562,0.00048120608,0.0010969932],"genre_scores_gemma":[0.9588973,0.000037155798,0.040556557,0.00008400819,0.00019117055,0.00008576667,0.000011711122,0.000027210457,0.00010914147],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99728954,0.000030775638,0.00047646806,0.00083861925,0.00086902577,0.00049556704],"domain_scores_gemma":[0.9974246,0.000087123146,0.0005019073,0.0013462569,0.0005384853,0.00010163549],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004988341,0.0003836089,0.00053310196,0.00010374895,0.00017817154,0.0010255232,0.006575328,0.00025618979,0.0000055115343],"category_scores_gemma":[0.0008967198,0.000273457,0.0003051837,0.00040177378,0.00012608562,0.00020040854,0.0072420677,0.0009852384,0.0000026645837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039767412,0.00061981333,0.007832097,0.007531489,0.000575582,0.000031768657,0.025092324,0.0008094481,0.015534801,0.07122286,0.003177,0.867533],"study_design_scores_gemma":[0.0047658253,0.0009921455,0.047685254,0.02501114,0.00047597196,0.00028818374,0.027765559,0.026346881,0.81653,0.010563138,0.03349094,0.0060849534],"about_ca_topic_score_codex":0.00012795963,"about_ca_topic_score_gemma":0.000002959096,"teacher_disagreement_score":0.8614481,"about_ca_system_score_codex":0.000088281915,"about_ca_system_score_gemma":0.00011474592,"threshold_uncertainty_score":0.99997175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029321983,0.00007079575,0.8437439,0.0019605672,0.0002526597,0.000097580494,0.000006533839,0.00011870654,0.150817],"genre_scores_gemma":[0.8678128,0.000002164419,0.123287484,0.001192401,0.00006422062,0.00002955495,0.000011129496,0.000003905638,0.0075963396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992074,0.00003551321,0.00013658442,0.00029269353,0.0001794381,0.00014838134],"domain_scores_gemma":[0.9992729,0.00001133949,0.000022400363,0.00039314918,0.00020822123,0.00009198637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011563145,0.0000652856,0.00009871415,0.00002509278,0.00006187056,0.0002844033,0.00029193974,0.00003526166,0.000010190923],"category_scores_gemma":[0.000027583561,0.000058371068,0.000023526407,0.0009780425,0.0000046732152,0.00025026646,0.00010246792,0.000037165428,0.00016267107],"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.000002609092,0.00020815613,0.00027364586,0.000026054611,0.000017571365,0.00002669275,0.000831332,0.0009519487,0.008651747,0.81606984,0.15416002,0.01878038],"study_design_scores_gemma":[0.00043232113,0.000034182194,0.0010889567,0.000019936942,0.0000028079553,0.00005163819,0.00039391755,0.28193304,0.0049425256,0.0006284466,0.71016175,0.00031047192],"about_ca_topic_score_codex":0.0000078043395,"about_ca_topic_score_gemma":0.000023103537,"teacher_disagreement_score":0.8648806,"about_ca_system_score_codex":0.000024674924,"about_ca_system_score_gemma":0.00015300646,"threshold_uncertainty_score":0.27425075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020401157,0.00015057894,0.89396113,0.001148033,0.00033843078,0.000028387469,0.0000014777547,0.00014516442,0.10218668],"genre_scores_gemma":[0.944661,0.0000027074534,0.035356455,0.00074514677,0.000054036038,0.000007195241,0.0000025311444,0.0000022424251,0.019168667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959147,0.000011568037,0.00006829259,0.00014640426,0.000087990426,0.000094256284],"domain_scores_gemma":[0.999599,0.0000070345227,0.000011335212,0.00028458593,0.00006242357,0.000035621193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043373264,0.000032467073,0.00004934408,0.000006309895,0.0000283597,0.00011054128,0.00020218654,0.000015371286,0.00004668036],"category_scores_gemma":[0.000009857321,0.000026779026,0.000021980119,0.00017806428,0.000004238032,0.00015047914,0.000070695816,0.000024808309,0.0001896039],"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":[2.2244822e-7,0.000037019356,0.00030269357,0.000006655966,0.0000049420796,0.00008410318,0.000089553716,0.0000056066624,0.002369446,0.94734085,0.024267843,0.025491051],"study_design_scores_gemma":[0.00025156207,0.000015280482,0.0033892028,0.000013853611,8.811323e-7,0.00010070385,0.000035537916,0.018405028,0.022251299,0.0027878643,0.9525736,0.00017517565],"about_ca_topic_score_codex":0.000003914794,"about_ca_topic_score_gemma":0.0000030612825,"teacher_disagreement_score":0.944553,"about_ca_system_score_codex":0.00000611249,"about_ca_system_score_gemma":0.00004340894,"threshold_uncertainty_score":0.24370377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024497942,0.00014651791,0.88229656,0.0010939353,0.00030055636,0.000012837328,0.0000010976555,0.000094821546,0.11360387],"genre_scores_gemma":[0.97430325,0.0000023236023,0.017138138,0.0006041347,0.00004129126,0.000002162767,0.0000018158644,0.0000013535914,0.007905544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996136,0.000012839527,0.00006445221,0.00013344894,0.000086400665,0.0000892624],"domain_scores_gemma":[0.9996376,0.000009136051,0.000008847418,0.00025657724,0.00005142783,0.000036422014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040408722,0.000029606403,0.000048368303,0.0000058158557,0.000026285212,0.000082643346,0.0001891302,0.00001660202,0.00004581765],"category_scores_gemma":[0.000008418705,0.000024974699,0.000023413479,0.00015946517,0.000004334998,0.00012721075,0.00006901826,0.000028342723,0.00018231804],"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":[1.7596761e-7,0.000024865512,0.0004249843,0.000003602252,0.0000044122853,0.00011935919,0.00006181759,0.000014926152,0.0009349956,0.944087,0.019822178,0.03450167],"study_design_scores_gemma":[0.00031642706,0.000015228246,0.008628673,0.0000135416885,0.0000013686365,0.00019636238,0.000052787072,0.044695757,0.014730991,0.003645505,0.92747533,0.00022804497],"about_ca_topic_score_codex":0.000008553821,"about_ca_topic_score_gemma":0.000005303016,"teacher_disagreement_score":0.97185344,"about_ca_system_score_codex":0.0000058300384,"about_ca_system_score_gemma":0.000036289213,"threshold_uncertainty_score":0.23433904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066137575,0.00016744396,0.9777655,0.0005375107,0.0022614156,0.0014017326,0.0027797925,0.00029348794,0.0081793815],"genre_scores_gemma":[0.7359905,0.000078499346,0.24927229,0.0017846765,0.00072932715,0.0012946579,0.0039710216,0.000099866345,0.0067791375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715793,0.000029015815,0.0010945251,0.00044686877,0.0004126938,0.0008589721],"domain_scores_gemma":[0.9971737,0.00018304418,0.00041316045,0.0011868401,0.000816877,0.00022636908],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004776861,0.0003391412,0.00047613482,0.00013444804,0.0005957697,0.0012104253,0.0011524764,0.00021190378,0.000058796548],"category_scores_gemma":[0.00019636453,0.00034221774,0.00035079775,0.0005689584,0.000045293116,0.0022810868,0.0002939959,0.0002461939,0.00015880135],"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.000610447,0.0035990493,0.0035626374,0.0071258764,0.0019774034,0.000103147395,0.037417926,0.0056045833,0.01518121,0.4126262,0.4052207,0.10697085],"study_design_scores_gemma":[0.004420276,0.00021832026,0.00025591973,0.00023966172,0.000044315235,0.00015217192,0.0010063214,0.2277308,0.01856115,0.0032203475,0.7432404,0.00091027445],"about_ca_topic_score_codex":0.000016060165,"about_ca_topic_score_gemma":0.000048198595,"teacher_disagreement_score":0.7293768,"about_ca_system_score_codex":0.00017940224,"about_ca_system_score_gemma":0.00027123356,"threshold_uncertainty_score":0.99990296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39132044,0.0012733026,0.6042603,0.00087111385,0.00080157234,0.00034570348,0.00007760785,0.0001918412,0.0008580949],"genre_scores_gemma":[0.99799144,0.000017658069,0.0015846124,0.00016969118,0.00004675695,0.000013097843,0.000111495734,0.000011187144,0.000054042957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727094,0.0005536141,0.00070888526,0.00069533166,0.00029730168,0.00047394677],"domain_scores_gemma":[0.99773544,0.0010182458,0.0002605335,0.0006849466,0.0001599992,0.00014084754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010392921,0.00025121105,0.0007678253,0.000097863776,0.00014888117,0.00046771686,0.00041054285,0.00011363798,0.0000018826091],"category_scores_gemma":[0.00041829314,0.00024060867,0.00011368147,0.00069862086,0.00010021084,0.00008025909,0.00018354577,0.00026296295,0.000022531123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018742844,0.00035438593,0.0036519747,0.0003513465,0.00021384157,0.001384867,0.0012994466,0.04206176,0.0008194871,0.9309898,0.0083080055,0.008690803],"study_design_scores_gemma":[0.04680243,0.000024868139,0.0012329186,0.0008087719,0.000015206049,0.0003866161,0.00021277931,0.94163954,0.00014005852,0.0021711905,0.0059929667,0.0005726708],"about_ca_topic_score_codex":0.00015409275,"about_ca_topic_score_gemma":0.000017570694,"teacher_disagreement_score":0.9288186,"about_ca_system_score_codex":0.00011486929,"about_ca_system_score_gemma":0.00010459449,"threshold_uncertainty_score":0.9811737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023493031,0.000056399764,0.9548397,0.0009566156,0.0013043423,0.010325377,0.0011915197,0.00048140239,0.0073515787],"genre_scores_gemma":[0.9469112,0.00001662383,0.03900338,0.0025477787,0.0004183064,0.006828457,0.003182979,0.000061773426,0.0010295142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673676,0.000059574035,0.0012811477,0.0004169813,0.0007542063,0.00075129914],"domain_scores_gemma":[0.9975798,0.0000549057,0.00045003902,0.0011037025,0.0005710972,0.00024041481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052255066,0.00036288457,0.00048626933,0.00014472673,0.00040653208,0.0010161283,0.0010367404,0.00023127341,0.000024641373],"category_scores_gemma":[0.0000817535,0.00034022675,0.00028073642,0.00074280985,0.00006138911,0.0021687436,0.0003895063,0.00033930133,0.000084906],"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.0002683831,0.0029251897,0.075717665,0.0039926236,0.0006659052,0.00014472155,0.013909812,0.0011293894,0.0007024187,0.71056986,0.051268704,0.13870536],"study_design_scores_gemma":[0.0059392937,0.00037690255,0.014108972,0.00073194737,0.000028038023,0.00026873345,0.0005701932,0.15142843,0.0010414275,0.0033069185,0.82098925,0.0012098792],"about_ca_topic_score_codex":0.000024971298,"about_ca_topic_score_gemma":0.00002566667,"teacher_disagreement_score":0.92341816,"about_ca_system_score_codex":0.000117527205,"about_ca_system_score_gemma":0.000118459924,"threshold_uncertainty_score":0.999905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057818126,0.00021851403,0.9762802,0.015919438,0.00034311984,0.00031188925,0.00007375955,0.0002350439,0.00083618186],"genre_scores_gemma":[0.7442374,0.0000010555302,0.23694903,0.01586468,0.00021192883,0.00014795343,0.000065652384,0.000025048497,0.0024972355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839264,0.00009971169,0.00028409777,0.00055436493,0.00025979223,0.00040936604],"domain_scores_gemma":[0.99860966,0.00028606987,0.0000647705,0.0007262804,0.00018270696,0.00013048953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026269673,0.00018902466,0.00024476642,0.000056147164,0.00015152506,0.00017112336,0.0005114602,0.00011506631,0.000048481048],"category_scores_gemma":[0.00014870088,0.00015623432,0.00015904396,0.00046791803,0.000034063327,0.00006233263,0.00009590903,0.00013678963,0.000020825286],"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.00019873491,0.0021714086,0.0018496104,0.0010300011,0.0004784136,0.00059725344,0.011439506,0.07089022,0.23052904,0.16987315,0.30821332,0.20272934],"study_design_scores_gemma":[0.0025108682,0.000064400716,0.00028257418,0.0000736335,0.0000081715325,0.00003231163,0.00030721142,0.44505033,0.014985968,0.0018818206,0.53433853,0.00046416893],"about_ca_topic_score_codex":0.000033120334,"about_ca_topic_score_gemma":0.0002594883,"teacher_disagreement_score":0.73933125,"about_ca_system_score_codex":0.000027302809,"about_ca_system_score_gemma":0.00010374252,"threshold_uncertainty_score":0.63710505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10707882,0.000043898748,0.88895065,0.00014893133,0.0012525517,0.00083473616,0.00008758649,0.0002694519,0.0013333904],"genre_scores_gemma":[0.99099344,0.000017380107,0.0020236946,0.00015828159,0.00008592729,0.000010978198,0.000117562326,0.000014085602,0.006578642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978136,0.00012440378,0.00023403563,0.0013009734,0.00011706435,0.000409942],"domain_scores_gemma":[0.9979661,0.000052635354,0.0002801581,0.0010965794,0.00047391007,0.00013057799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028138538,0.00033803133,0.00038449359,0.00021891753,0.00034614134,0.00041488043,0.0012058826,0.00034619775,0.0000054615293],"category_scores_gemma":[0.000014136902,0.00035575792,0.00019676115,0.00056990294,0.00010840141,0.0006954714,0.00025643653,0.00039224746,0.000011190203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070270046,0.00088555936,0.0017550224,0.00056617014,0.00063012075,0.00024191583,0.000455571,0.15592942,0.0005163285,0.83113664,0.003295366,0.0038851541],"study_design_scores_gemma":[0.0020533144,0.00050851435,0.0009511574,0.00038613868,0.0001463326,0.000013218109,0.00014598932,0.9560732,0.00037156625,0.027124384,0.011426204,0.00079995353],"about_ca_topic_score_codex":0.00046583326,"about_ca_topic_score_gemma":0.0002788466,"teacher_disagreement_score":0.88692695,"about_ca_system_score_codex":0.0003386426,"about_ca_system_score_gemma":0.00041057705,"threshold_uncertainty_score":0.99988943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839176,0.001890829,0.97798014,0.00030275853,0.00049060816,0.00067137997,0.00009640895,0.00012464158,0.00005146854],"genre_scores_gemma":[0.95975584,0.0000135443215,0.039467998,0.000013878019,0.000052259078,0.00029939017,0.00011322473,0.000009864356,0.00027398416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876946,0.00007317997,0.00035124007,0.0003432251,0.00023971773,0.00022317744],"domain_scores_gemma":[0.9989791,0.00014624985,0.0001560241,0.00036655055,0.00027563958,0.00007647145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026392285,0.00014381937,0.00026100763,0.00005810983,0.00019293657,0.00025428977,0.00024932888,0.000074287425,0.0000026069106],"category_scores_gemma":[0.000034656314,0.00013145834,0.00010797056,0.0002419681,0.00004222218,0.00018362908,0.000011971299,0.00009425705,0.0000012676253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012451167,0.00036355024,0.00014463984,0.0005214451,0.000092215945,0.000023370476,0.0012694794,0.00022060961,0.0016349634,0.014754425,0.000060930935,0.9809019],"study_design_scores_gemma":[0.018175548,0.0065760906,0.0060249288,0.012892882,0.00064775476,0.0030583574,0.030687844,0.6343908,0.03547736,0.001214645,0.24632935,0.0045244945],"about_ca_topic_score_codex":0.000096362404,"about_ca_topic_score_gemma":0.00003814367,"teacher_disagreement_score":0.9763774,"about_ca_system_score_codex":0.000027166388,"about_ca_system_score_gemma":0.000051123618,"threshold_uncertainty_score":0.5360715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01445742,0.00021689909,0.9282922,0.0030400823,0.00054112164,0.00011057598,0.000001235838,0.0003608837,0.052979544],"genre_scores_gemma":[0.9504385,0.0000034980685,0.036908112,0.0019966885,0.0005696961,0.000008606754,0.00000177395,0.000004398672,0.0100687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924064,0.00001723889,0.00015426685,0.00020039396,0.00014619772,0.00024126263],"domain_scores_gemma":[0.99943745,0.000015504605,0.00003042149,0.00042909247,0.000036433918,0.00005106666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016235489,0.00007454234,0.000091707276,0.00001050018,0.000067478686,0.00014243068,0.0005007034,0.000035526646,0.00008902609],"category_scores_gemma":[0.000004048881,0.00006008209,0.0000409436,0.00023724558,0.00000808474,0.00047544576,0.00009584052,0.000051621617,0.00075600966],"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.0000015485731,0.00004210813,0.0019646606,0.000005829274,0.000009752275,0.000010111616,0.000102173624,0.0072753187,0.000023185514,0.63763344,0.21038519,0.14254671],"study_design_scores_gemma":[0.00019083588,0.00001407197,0.007694462,0.000011817451,0.0000010280668,0.000017301267,0.0000034587451,0.11704586,0.00006769712,0.0007623909,0.8740273,0.00016376977],"about_ca_topic_score_codex":0.000021199523,"about_ca_topic_score_gemma":0.000032972755,"teacher_disagreement_score":0.9359811,"about_ca_system_score_codex":0.000016649676,"about_ca_system_score_gemma":0.000020044925,"threshold_uncertainty_score":0.97172266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005249228,0.0005336345,0.9959064,0.00046095747,0.00059136824,0.000559233,0.000026959617,0.000042186904,0.0013542953],"genre_scores_gemma":[0.8990348,0.000079936275,0.09973579,0.00084925944,0.00006310014,0.000016251495,0.00001332992,0.000024770085,0.00018274998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684507,0.0000647233,0.0009615137,0.0007989419,0.0007677205,0.0005620047],"domain_scores_gemma":[0.99681574,0.00029013222,0.000552138,0.0019888824,0.00026819317,0.00008492695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014030045,0.00036448755,0.00047976073,0.00040299003,0.00023167935,0.00021837652,0.00409833,0.00021171704,0.0000043655195],"category_scores_gemma":[0.000024547035,0.00028816014,0.0001425071,0.00094822416,0.0005386093,0.00044150627,0.0012551814,0.00080511114,0.000004069363],"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.0000041201106,0.000027160644,0.00022929603,0.000017347587,0.000006479902,0.000005134884,0.0010315899,0.87139744,0.000019580013,0.025483595,0.000026226178,0.10175206],"study_design_scores_gemma":[0.0003012791,0.000018961357,0.0007062107,0.00044762663,0.0000035475725,0.000012664704,4.979045e-7,0.9523796,0.00012790237,0.045264445,0.0004474298,0.000289833],"about_ca_topic_score_codex":0.00016492677,"about_ca_topic_score_gemma":0.0015814048,"teacher_disagreement_score":0.8985099,"about_ca_system_score_codex":0.0002922069,"about_ca_system_score_gemma":0.0004124418,"threshold_uncertainty_score":0.999957},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006705468,0.0069209994,0.39265174,0.000047084366,0.00057320594,0.00038498337,0.00087098655,0.00050434243,0.5980399],"genre_scores_gemma":[0.31089526,0.004842825,0.01999484,0.00041452577,0.00097130175,0.000088429304,0.001969068,0.00026198925,0.66056174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978892,0.000028133949,0.0007107072,0.00059285417,0.00053034694,0.00024874357],"domain_scores_gemma":[0.9974493,0.00002947728,0.0004675699,0.0016076325,0.00027586176,0.00017016662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001599987,0.00035956476,0.00078656024,0.00009433814,0.000071399954,0.00006777708,0.0014691879,0.00031835248,0.000046771966],"category_scores_gemma":[0.000003554853,0.00030823707,0.00024636948,0.00009327529,0.000063377796,0.00027766926,0.00015675377,0.00018933335,0.00014046882],"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.0000022595705,0.00002279192,0.0000030899087,0.00034409453,0.00004573079,0.000078306155,0.000041891733,0.000019541834,0.0000088979805,0.9841647,0.011289439,0.003979226],"study_design_scores_gemma":[0.00041430324,0.00019578954,0.000095400224,0.0017348109,0.000029882585,0.00031230424,0.000012618244,0.015194639,0.00006586636,0.00090069283,0.98024845,0.0007952129],"about_ca_topic_score_codex":0.000060990333,"about_ca_topic_score_gemma":0.000008033415,"teacher_disagreement_score":0.983264,"about_ca_system_score_codex":0.0000968544,"about_ca_system_score_gemma":0.00013971933,"threshold_uncertainty_score":0.999937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026738623,0.00045371542,0.992658,0.0004263817,0.0005170928,0.0009867419,0.000058197158,0.00013909927,0.0020869018],"genre_scores_gemma":[0.6133872,0.000007525382,0.3848727,0.00009593273,0.00007363999,0.0003942564,0.00013698213,0.000023531273,0.0010081832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757373,0.00004759195,0.00050842616,0.000988578,0.00049652637,0.00038514048],"domain_scores_gemma":[0.9979603,0.000040552193,0.00030451338,0.0012967468,0.0002778877,0.00011996562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824221,0.00034867547,0.00069954724,0.00006555073,0.000050056187,0.00029250633,0.0012615477,0.0002148249,0.0000068673235],"category_scores_gemma":[0.000011788331,0.00025484242,0.00027786876,0.00022387305,0.000054748794,0.0001701216,0.0007293646,0.0002692226,0.0000015876358],"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.00082371884,0.013406556,0.012164362,0.01991565,0.0064877383,0.00036036593,0.024079831,0.5097637,0.0053274734,0.26232708,0.046900418,0.0984431],"study_design_scores_gemma":[0.00422717,0.00076436147,0.0031284783,0.0016229906,0.00019961147,0.000097786855,0.0020481087,0.9680178,0.00909061,0.0006500401,0.007607356,0.002545675],"about_ca_topic_score_codex":0.0001782581,"about_ca_topic_score_gemma":0.00003868319,"teacher_disagreement_score":0.61071336,"about_ca_system_score_codex":0.000056131743,"about_ca_system_score_gemma":0.0003260205,"threshold_uncertainty_score":0.9999904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026738623,0.00045371542,0.992658,0.0004263817,0.0005170928,0.0009867419,0.000058197158,0.00013909927,0.0020869018],"genre_scores_gemma":[0.6133872,0.000007525382,0.3848727,0.00009593273,0.00007363999,0.0003942564,0.00013698213,0.000023531273,0.0010081832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757373,0.00004759195,0.00050842616,0.000988578,0.00049652637,0.00038514048],"domain_scores_gemma":[0.9979603,0.000040552193,0.00030451338,0.0012967468,0.0002778877,0.00011996562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824221,0.00034867547,0.00069954724,0.00006555073,0.000050056187,0.00029250633,0.0012615477,0.0002148249,0.0000068673235],"category_scores_gemma":[0.000011788331,0.00025484242,0.00027786876,0.00022387305,0.000054748794,0.0001701216,0.0007293646,0.0002692226,0.0000015876358],"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.00082371884,0.013406556,0.012164362,0.01991565,0.0064877383,0.00036036593,0.024079831,0.5097637,0.0053274734,0.26232708,0.046900418,0.0984431],"study_design_scores_gemma":[0.00422717,0.00076436147,0.0031284783,0.0016229906,0.00019961147,0.000097786855,0.0020481087,0.9680178,0.00909061,0.0006500401,0.007607356,0.002545675],"about_ca_topic_score_codex":0.0001782581,"about_ca_topic_score_gemma":0.00003868319,"teacher_disagreement_score":0.61071336,"about_ca_system_score_codex":0.000056131743,"about_ca_system_score_gemma":0.0003260205,"threshold_uncertainty_score":0.9999904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057185944,0.0008748871,0.9867891,0.00048164872,0.002214405,0.00019949095,0.000007364632,0.00025734198,0.0034571888],"genre_scores_gemma":[0.9764537,0.000070315786,0.022203002,0.00046807827,0.0004384676,0.000055927583,0.000005437901,0.000027072092,0.00027800436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973562,0.00016419984,0.0005219193,0.0007486729,0.0004935965,0.00071543327],"domain_scores_gemma":[0.9981362,0.00028981522,0.00015388368,0.0010676794,0.00021901887,0.00013340992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045883987,0.00029163048,0.00040904776,0.000071569804,0.00059188675,0.00038185556,0.0006379336,0.00013908738,0.000020217032],"category_scores_gemma":[0.000010848407,0.00028217278,0.00011062139,0.001609996,0.00004233194,0.00042397084,0.000017852246,0.0005642866,0.000020229805],"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.000061530605,0.0002942878,0.004049154,0.00010506193,0.00015707882,0.0011707605,0.0017702837,0.669935,0.00030894476,0.001731598,0.0010861058,0.3193302],"study_design_scores_gemma":[0.0051038093,0.00048544962,0.0043352926,0.008217673,0.00011077437,0.0013481501,0.0013102329,0.9220738,0.0037893762,0.0024978402,0.047776584,0.0029510113],"about_ca_topic_score_codex":0.000085781794,"about_ca_topic_score_gemma":0.0013222502,"teacher_disagreement_score":0.9707351,"about_ca_system_score_codex":0.00022945258,"about_ca_system_score_gemma":0.0003927366,"threshold_uncertainty_score":0.99996305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005901255,0.015161295,0.97466373,0.0010125693,0.00010498829,0.00011941583,0.0000036477609,0.00041306103,0.0026200279],"genre_scores_gemma":[0.9645847,0.0033653183,0.031858716,0.000014698358,0.0000067206765,0.00003528515,0.00000945922,0.000003596663,0.000121515804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.000047561705,0.00023593154,0.00018564491,0.00013054538,0.00014510135],"domain_scores_gemma":[0.9985664,0.00003287563,0.00012276802,0.0011681278,0.000095301424,0.000014516127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015161661,0.000085381216,0.00016280486,0.000019462981,0.00013308306,0.000082912185,0.0008231247,0.00009370158,4.1144318e-7],"category_scores_gemma":[0.000004420281,0.00008034057,0.000022676633,0.00031179906,0.00009368494,0.000112114736,0.0008209153,0.00010987096,0.0000014891626],"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.0000018954156,0.000030909156,0.00016353755,0.0000441483,0.000028217233,0.0000029624605,0.000034768786,0.027411614,0.000034105837,0.8971052,0.0006652939,0.074477315],"study_design_scores_gemma":[0.0003819292,0.000033905617,0.0013793063,0.00035358683,0.000016601722,0.000017952776,0.0011352549,0.89463496,0.00050093926,0.09584374,0.005476409,0.00022541036],"about_ca_topic_score_codex":0.00003153123,"about_ca_topic_score_gemma":0.00001249986,"teacher_disagreement_score":0.95868343,"about_ca_system_score_codex":0.000013970856,"about_ca_system_score_gemma":0.000019239598,"threshold_uncertainty_score":0.32761934},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028427674,0.003947211,0.25291106,0.0058039124,0.0027103345,0.0061357277,0.00018459235,0.0005520803,0.7249123],"genre_scores_gemma":[0.97625375,0.000799892,0.013525164,0.00047266282,0.000036897876,0.00014932733,0.000014324827,0.00007966748,0.008668324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978287,0.000027772021,0.0006690707,0.0005107315,0.00063943455,0.00032426018],"domain_scores_gemma":[0.99775606,0.00029812608,0.0008740218,0.00075931224,0.00025594456,0.000056541194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078702054,0.00033027542,0.00056492724,0.00014476586,0.00018496918,0.00007601432,0.0017520146,0.00014933757,0.00005085998],"category_scores_gemma":[0.0001972863,0.00028423112,0.0001344322,0.00017842624,0.000111919304,0.00033550934,0.00044891034,0.0007563423,0.000008117239],"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.00003902923,0.000056619243,0.00008617055,0.000065276814,0.00003976261,0.0000025379106,0.00019154321,0.00477615,0.000108498694,0.9921506,0.00019304719,0.0022907467],"study_design_scores_gemma":[0.009004386,0.00093350536,0.0010411479,0.0052340794,0.00014458553,0.000029707724,0.0002263727,0.05548664,0.0011073039,0.6821944,0.24177328,0.0028245857],"about_ca_topic_score_codex":0.0000086978225,"about_ca_topic_score_gemma":0.00000681209,"teacher_disagreement_score":0.97341096,"about_ca_system_score_codex":0.0003092578,"about_ca_system_score_gemma":0.000063729254,"threshold_uncertainty_score":0.99996096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002963995,0.00013839317,0.9748798,0.00012041726,0.0005270394,0.0032786482,0.000014176773,0.00010781517,0.020637298],"genre_scores_gemma":[0.7228566,0.00009807136,0.2728902,0.0008424146,0.0007557501,0.00081333664,0.00001302728,0.000078923345,0.0016516818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965215,0.000021566402,0.00073095446,0.0011420281,0.0010290201,0.0005549658],"domain_scores_gemma":[0.9974944,0.00011755748,0.00038525322,0.0016401113,0.00023225223,0.00013041221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006479767,0.00043653973,0.0006493757,0.00046982663,0.00013597777,0.0002340019,0.0038221052,0.0002758694,0.000040355364],"category_scores_gemma":[0.000019019122,0.00038528972,0.00013011778,0.00062300696,0.00055171334,0.00060693297,0.00055264164,0.0005265202,0.000061651386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012204239,0.00003972067,0.00015764347,0.00016652324,0.000007945865,0.000030941108,0.0002777272,0.021501483,0.000113411625,0.011107982,0.000030735133,0.9665537],"study_design_scores_gemma":[0.0006284097,0.0007020532,0.00058372004,0.0034620191,0.0000062456284,0.00012497975,5.8122332e-8,0.9331673,0.0038352357,0.034040038,0.022277951,0.001172012],"about_ca_topic_score_codex":0.0000132159075,"about_ca_topic_score_gemma":0.000008816583,"teacher_disagreement_score":0.9653817,"about_ca_system_score_codex":0.00013360445,"about_ca_system_score_gemma":0.00053932104,"threshold_uncertainty_score":0.9998599},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019851408,0.82505184,0.13989508,0.0035465534,0.002503891,0.0020947293,0.000035796013,0.0009769907,0.02390995],"genre_scores_gemma":[0.9671771,0.0066097965,0.0156242205,0.0018695565,0.0009878619,0.00058815524,0.000065810964,0.000051185078,0.007026304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976139,0.00023683462,0.00086102565,0.000506505,0.00040249812,0.00037924334],"domain_scores_gemma":[0.9977646,0.00012085533,0.0002426634,0.0015927346,0.00020352833,0.000075612545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091789383,0.000249658,0.0006010324,0.000034690034,0.00025354404,0.0005441997,0.0016681722,0.00006706298,0.000011793553],"category_scores_gemma":[0.0002681256,0.00019459488,0.00012045667,0.00052982767,0.000024247278,0.00054286077,0.00027809993,0.00013782023,0.0003557164],"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.0000010943102,0.00021800565,0.004149933,0.017610705,0.00009763351,0.00020454804,0.0002511979,0.0018837728,0.002134196,0.37770185,0.5328202,0.062926866],"study_design_scores_gemma":[0.00034567594,0.00006253025,0.00080936804,0.015759977,0.000024650994,0.00032089828,0.000026202602,0.016043743,0.00012069029,0.0001931876,0.96553516,0.00075791776],"about_ca_topic_score_codex":0.0005455845,"about_ca_topic_score_gemma":0.000008018525,"teacher_disagreement_score":0.96519196,"about_ca_system_score_codex":0.000051102408,"about_ca_system_score_gemma":0.00006624732,"threshold_uncertainty_score":0.7935348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008293317,0.00014968547,0.92790914,0.010899734,0.0018235873,0.00034921852,0.000046513764,0.00015443811,0.05037436],"genre_scores_gemma":[0.9916065,7.774047e-7,0.0032678295,0.003215166,0.000046017492,0.000074117605,0.0000021062538,0.00000428899,0.0017832211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998934,0.0000984489,0.00018277194,0.00028973102,0.0002831464,0.00021195809],"domain_scores_gemma":[0.99918664,0.00008598477,0.000094778676,0.00051713677,0.000061827384,0.000053652147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003240372,0.00008671738,0.00011130026,0.00004295032,0.00049192715,0.00024900195,0.0011520112,0.000010704563,0.00018866015],"category_scores_gemma":[0.000043819826,0.000060276474,0.000055655404,0.0005080373,0.000014469519,0.00030707344,0.0007202723,0.00015834325,0.00012912117],"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.0000343709,0.00022450405,0.00086044474,0.00001304325,0.00008252578,0.00010184187,0.011262831,0.0032727155,0.0012850078,0.5795117,0.15175557,0.2515954],"study_design_scores_gemma":[0.00028688624,0.00018985066,0.0071548466,0.00002122562,0.0000038722933,0.00014338378,0.003880184,0.055010617,0.00023594877,0.0005709825,0.9321975,0.00030468908],"about_ca_topic_score_codex":0.0002338382,"about_ca_topic_score_gemma":0.000038128303,"teacher_disagreement_score":0.98331314,"about_ca_system_score_codex":0.000057657366,"about_ca_system_score_gemma":0.000056671728,"threshold_uncertainty_score":0.37835556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13027535,0.000011556481,0.8612466,0.00068110175,0.00043412717,0.00012249868,0.0000039968104,0.00020534194,0.0070194323],"genre_scores_gemma":[0.96236783,0.0000024336266,0.036805667,0.00070455717,0.000062014034,0.00000913327,0.0000015887515,0.0000072624125,0.000039526316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719656,0.000050250026,0.0002253034,0.0008086088,0.0011672155,0.00055207906],"domain_scores_gemma":[0.9983879,0.00017646886,0.00007223501,0.0008755447,0.00021160702,0.0002762904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957466,0.00020670678,0.00020743418,0.00013943952,0.00071513484,0.0001698785,0.0019602966,0.000052024865,0.000029816465],"category_scores_gemma":[0.000027610882,0.00014416402,0.000051829014,0.0011376437,0.0023262466,0.0007233916,0.00030928812,0.00025155285,0.00021711442],"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.00001985427,0.00009223989,0.00014212994,0.0000025391473,0.00000380586,0.00008566483,0.00015422713,0.0015302973,0.000060868897,0.99460405,0.00016088216,0.0031434563],"study_design_scores_gemma":[0.0005802783,0.0007040114,0.011898413,0.00006671137,0.000002206017,0.00089929404,0.0000035673638,0.9324473,0.0004030183,0.052051056,0.00053758954,0.0004065547],"about_ca_topic_score_codex":0.0000032499795,"about_ca_topic_score_gemma":7.509228e-7,"teacher_disagreement_score":0.942553,"about_ca_system_score_codex":0.00009121506,"about_ca_system_score_gemma":0.00018965139,"threshold_uncertainty_score":0.85711527},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.8338945e-7,0.00037938048,0.36844873,0.00017718866,0.00045556625,0.00009328194,0.00001407856,0.00021371059,0.6302177],"genre_scores_gemma":[0.0009656723,0.00008001224,0.0025425865,0.00035852863,0.0002491734,0.000006937846,0.000021411715,0.000024369247,0.9957513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847686,0.000007158135,0.00032383387,0.0005520021,0.00037170178,0.000268461],"domain_scores_gemma":[0.9984535,0.000026256264,0.00014338402,0.0011280962,0.00012448613,0.00012429312],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011345116,0.00030150675,0.0003616523,0.00008045052,0.00007369913,0.0001877049,0.0014089912,0.00029042843,0.00041929106],"category_scores_gemma":[0.0000035570026,0.0002615732,0.0001533321,0.000051767205,0.00003267117,0.00019134677,0.000270287,0.00021295634,0.0014982265],"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":[6.6615837e-7,0.000005423347,0.0000033527347,0.000012476552,0.000018663704,0.00008423752,0.000008746313,0.000006616782,0.0000011912335,0.9292706,0.03454395,0.036044076],"study_design_scores_gemma":[0.000118710384,0.00001900859,0.000011589448,0.000092445654,0.000005064772,0.0000635116,7.343469e-7,0.001042512,0.000006575152,0.029618891,0.9686718,0.0003491531],"about_ca_topic_score_codex":0.000040211213,"about_ca_topic_score_gemma":0.000030906584,"teacher_disagreement_score":0.93412787,"about_ca_system_score_codex":0.000051265903,"about_ca_system_score_gemma":0.00007577393,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023054327,0.000760765,0.9768306,0.0010637426,0.00086373236,0.00026267872,0.000031989846,0.0005183641,0.017362712],"genre_scores_gemma":[0.9714566,0.00007627514,0.021780211,0.0010394929,0.0003645078,0.000041120213,0.000022696328,0.000017795663,0.0052013183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788713,0.000076271484,0.00040525416,0.0006035257,0.00053202896,0.00049579696],"domain_scores_gemma":[0.9988743,0.00005691479,0.000092930204,0.0006562506,0.00009621279,0.00022340385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022187771,0.00024138796,0.00027877488,0.00007635779,0.00021046471,0.0002707473,0.0010198123,0.00010319621,0.00022597476],"category_scores_gemma":[0.000013368599,0.0001983657,0.00012314632,0.0005060213,0.000052249085,0.0006215035,0.0003741826,0.00017989155,0.0012043195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017356272,0.00039374924,0.00009111168,0.000022722505,0.000027189824,0.00009101135,0.0012989712,0.0002076774,0.00015614746,0.09609801,0.16143125,0.74018043],"study_design_scores_gemma":[0.0005736253,0.000096644755,0.00007439903,0.000027167436,0.0000030571991,0.000042841773,0.00003512169,0.6858755,0.00008196137,0.00012625687,0.31282267,0.00024077223],"about_ca_topic_score_codex":0.00006983189,"about_ca_topic_score_gemma":0.000004179634,"teacher_disagreement_score":0.96915114,"about_ca_system_score_codex":0.00006056285,"about_ca_system_score_gemma":0.000013608312,"threshold_uncertainty_score":0.99957335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64699376,0.0002960323,0.07125458,0.005958988,0.0023840826,0.0007251288,0.00016055637,0.0006655301,0.27156138],"genre_scores_gemma":[0.9961549,0.000031626547,0.0031459704,0.00019482819,0.00015377051,0.00003973255,0.000033892833,0.000011178507,0.00023412057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977274,0.000008428094,0.0006186168,0.00066151074,0.00072984444,0.00025420278],"domain_scores_gemma":[0.9976324,0.000013049999,0.00065097853,0.00045725083,0.0011463873,0.000099968536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025793395,0.00023015127,0.00030636645,0.00014355172,0.00009071802,0.00052130944,0.0019716136,0.00013165984,0.000030275056],"category_scores_gemma":[0.000019722964,0.00022325301,0.000077325036,0.00035048582,0.00006125866,0.0011605838,0.000093769006,0.0002380603,0.00008118502],"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.00004134932,0.00033161583,0.0033145347,0.00019838092,0.000051466308,0.0000028527313,0.0011529209,0.0007495479,0.0336268,0.9571883,0.000919504,0.0024227372],"study_design_scores_gemma":[0.005352815,0.0011994126,0.013799277,0.004556885,0.00005378381,0.00014269543,0.008367056,0.682092,0.14507888,0.10265301,0.034467872,0.0022362776],"about_ca_topic_score_codex":0.00017188201,"about_ca_topic_score_gemma":0.000044562585,"teacher_disagreement_score":0.8545353,"about_ca_system_score_codex":0.00013672475,"about_ca_system_score_gemma":0.00026670386,"threshold_uncertainty_score":0.9103994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033712722,0.00011993968,0.91891366,0.0046973093,0.00033286514,0.00020885332,0.000020895666,0.0003972319,0.041596502],"genre_scores_gemma":[0.9901899,0.0000013291989,0.0044427216,0.00024832189,0.00001650868,0.000030392404,0.000013130733,0.000003987505,0.005053679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919343,0.00003499862,0.000107098036,0.00022211952,0.0002844225,0.0001579046],"domain_scores_gemma":[0.99956083,0.000015968097,0.000049104525,0.00029131823,0.000046549463,0.000036223802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015098881,0.000068872476,0.00007989231,0.000041477222,0.00025050907,0.00010184268,0.00048801204,0.000009591323,0.00015067837],"category_scores_gemma":[0.0000026912485,0.000053428943,0.000018842198,0.00037661172,0.000011426536,0.00035235292,0.0001576124,0.00006905066,0.000033461507],"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.000027096476,0.0003222063,0.003931113,0.000021190308,0.000045482062,0.00008670389,0.0015339003,0.016879579,0.0019168053,0.85295284,0.06413481,0.058148272],"study_design_scores_gemma":[0.0015461509,0.0008006566,0.023871252,0.000024793095,0.000010509649,0.00027886662,0.0027417783,0.41285527,0.0047038044,0.002221615,0.55011666,0.00082866644],"about_ca_topic_score_codex":0.000068223126,"about_ca_topic_score_gemma":0.00002854853,"teacher_disagreement_score":0.9564772,"about_ca_system_score_codex":0.000033076623,"about_ca_system_score_gemma":0.000030973315,"threshold_uncertainty_score":0.21787691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035264637,0.0017890253,0.98530334,0.00046894982,0.0030246773,0.0024056544,0.0056809084,0.0007997862,0.0001750336],"genre_scores_gemma":[0.98323953,0.00006737756,0.008194763,0.000030848587,0.00058751163,0.0008871281,0.004497161,0.00010759376,0.002388112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496317,0.00021969374,0.0013923004,0.0017741793,0.00070045557,0.00095017586],"domain_scores_gemma":[0.9957289,0.00028108014,0.001046169,0.0019101299,0.00063150394,0.00040220504],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010400641,0.0008481127,0.0022137149,0.000399268,0.00046877775,0.0029419023,0.0014799412,0.0009191167,0.0000014164624],"category_scores_gemma":[0.00003296237,0.0007173669,0.00041558247,0.0009775545,0.000104588216,0.0001555421,0.000916788,0.00079008745,0.000017590572],"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.000011169045,0.000068263325,0.0006682881,0.0015625719,0.0016642999,0.00005863732,0.00017185608,0.97403663,0.0000071162162,0.017431451,0.004007929,0.00031176282],"study_design_scores_gemma":[0.00067967625,0.00013010587,0.00083627953,0.00061593944,0.00069843413,0.000042568314,0.00014330568,0.98215234,0.0000024662854,0.00011786018,0.013659977,0.00092102523],"about_ca_topic_score_codex":0.0020382036,"about_ca_topic_score_gemma":0.00027699934,"teacher_disagreement_score":0.98288685,"about_ca_system_score_codex":0.00038686275,"about_ca_system_score_gemma":0.00035861184,"threshold_uncertainty_score":0.99952775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4027858,0.0020178757,0.59285146,0.00012274369,0.0006831966,0.0011360949,0.0002139439,0.00007966045,0.00010919945],"genre_scores_gemma":[0.9983378,0.0012165679,0.00012186048,0.000024592606,0.0000147463,0.000031160595,0.000030527175,0.0000107225615,0.00021199968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977387,0.00033859327,0.00049153384,0.00091246516,0.00017608883,0.00034258384],"domain_scores_gemma":[0.9981774,0.00015556435,0.0005513173,0.0008527846,0.0001396242,0.00012327745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055330835,0.00026568744,0.0005729076,0.00016941717,0.00009036856,0.0001023659,0.001347269,0.00015284904,0.000014265467],"category_scores_gemma":[0.00004331495,0.00029705555,0.00012072238,0.00064864894,0.00008462412,0.00035347333,0.001044155,0.00036675998,0.0000019676054],"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.000019158586,0.00014036133,0.24504282,0.000598007,0.00006383293,0.00008278855,0.00029508115,0.63534147,0.00002320788,0.11816285,0.000112458096,0.00011795525],"study_design_scores_gemma":[0.0023782577,0.00010962517,0.06357312,0.0010149856,0.0000587269,0.000005252402,0.00022447912,0.92284214,0.000018556704,0.005463287,0.0036831605,0.0006284157],"about_ca_topic_score_codex":0.0014655153,"about_ca_topic_score_gemma":0.00007919021,"teacher_disagreement_score":0.595552,"about_ca_system_score_codex":0.00022224891,"about_ca_system_score_gemma":0.00015534913,"threshold_uncertainty_score":0.99994814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034597444,0.000050445124,0.99318177,0.0017367481,0.0006051173,0.00036934027,0.0003939372,0.00011684239,0.00008604652],"genre_scores_gemma":[0.6586533,0.000017489441,0.3395458,0.0011632487,0.00008885902,0.00015376227,0.0000574619,0.000023888955,0.0002961946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.00012606817,0.00026559885,0.0005264826,0.00039579414,0.00022003375],"domain_scores_gemma":[0.99918157,0.000045381268,0.00007063845,0.00049255654,0.000073935356,0.00013591624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019556015,0.00017888105,0.00015554237,0.0002249457,0.0010042401,0.00015101938,0.00039381915,0.000057416848,0.00010883972],"category_scores_gemma":[0.000011551025,0.00018213392,0.000072021016,0.000549318,0.000019267756,0.0002660671,0.000022486553,0.00027775194,0.000002775038],"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.000032875523,0.000058692814,0.0000018515601,0.0000050327026,0.000015013653,0.0000023075079,0.00049136864,0.9129716,0.0064879805,0.00023265347,0.00006985423,0.07963073],"study_design_scores_gemma":[0.00044473895,0.00020758245,0.000013833972,0.000009704345,0.000017082428,0.00007193079,0.0000509613,0.9885141,0.002154943,0.00022010546,0.008062908,0.00023207619],"about_ca_topic_score_codex":0.000024663017,"about_ca_topic_score_gemma":0.00003994076,"teacher_disagreement_score":0.65519357,"about_ca_system_score_codex":0.000097176875,"about_ca_system_score_gemma":0.00007107751,"threshold_uncertainty_score":0.7723905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075481854,0.0040627797,0.8352585,0.07610678,0.00208087,0.0017831414,0.0001917957,0.00013730796,0.0048969924],"genre_scores_gemma":[0.97894573,0.0000605715,0.019546889,0.0008939728,0.00003962917,0.000046795736,0.000012113453,0.000013169367,0.00044113616],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977623,0.000783031,0.00056286366,0.0001858258,0.00048528684,0.0002206631],"domain_scores_gemma":[0.9964178,0.00014463524,0.0009639117,0.00211254,0.00027726762,0.00008385362],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021646742,0.00013693646,0.0002406335,0.000031228807,0.0015513025,0.0004037324,0.011233307,0.0000466704,0.000007728502],"category_scores_gemma":[0.000058785325,0.00011418366,0.0002808166,0.00069627573,0.00009151635,0.00086962414,0.0029304908,0.0008253739,0.000005247883],"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.000053284984,0.0034475136,0.0012728471,0.00003961622,0.0008242206,0.0000039333027,0.076072544,0.028530763,0.16817945,0.026967535,0.6371801,0.05742821],"study_design_scores_gemma":[0.002996704,0.00024907792,0.0021019944,0.00018468477,0.000077003526,0.00026948482,0.0075738695,0.6207115,0.00193552,0.001664918,0.36163566,0.0005995856],"about_ca_topic_score_codex":0.00012577423,"about_ca_topic_score_gemma":0.00001366372,"teacher_disagreement_score":0.9034639,"about_ca_system_score_codex":0.00038698007,"about_ca_system_score_gemma":0.0003249398,"threshold_uncertainty_score":0.9997485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5963607,0.0023843427,0.3989664,0.0007446792,0.0003533257,0.0001818543,0.000005005317,0.00006239627,0.0009413032],"genre_scores_gemma":[0.9927738,0.00034777052,0.006125135,0.000640119,0.000045612782,0.000025428548,0.000003040793,0.0000063424504,0.000032752414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983817,0.00011734488,0.0003543235,0.0005980052,0.0002576258,0.00029100486],"domain_scores_gemma":[0.9987909,0.0005121502,0.00020015085,0.00016872211,0.00012097627,0.000207051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035415284,0.0001936059,0.00024073536,0.00008592555,0.0006098719,0.00030682934,0.00017288578,0.000057948393,0.0000023689447],"category_scores_gemma":[0.0002786084,0.00019314256,0.000025682892,0.00033539187,0.00011222935,0.0014519013,0.000165674,0.00016675795,0.000005341206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018243221,0.00028380755,0.0022383924,0.00016336195,0.000047509828,0.00016847365,0.12754297,0.004956338,0.0013936822,0.020739395,0.00147955,0.8408041],"study_design_scores_gemma":[0.0014807956,0.00073339953,0.007132021,0.00035007796,0.00001928594,0.0013841435,0.008760869,0.96219575,0.00026257552,0.00056600256,0.016292341,0.0008227079],"about_ca_topic_score_codex":0.000048506095,"about_ca_topic_score_gemma":0.0000011501496,"teacher_disagreement_score":0.95723945,"about_ca_system_score_codex":0.000026613365,"about_ca_system_score_gemma":0.000055891272,"threshold_uncertainty_score":0.7876125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37142912,0.00003028529,0.61980104,0.00008031177,0.0001673046,0.0001021516,1.8549139e-7,0.00016034927,0.008229262],"genre_scores_gemma":[0.97862935,3.9877804e-7,0.021118322,0.00008201711,0.00002857423,0.00000426404,6.3858414e-7,0.0000045742972,0.00013188139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880785,0.000028897173,0.0002952071,0.00028772018,0.00018437787,0.00039592708],"domain_scores_gemma":[0.99949867,0.00004004819,0.00007147006,0.0002820603,0.00003265913,0.00007511003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274512,0.000097173936,0.00013639295,0.00007225079,0.00007967778,0.00015253178,0.00041563695,0.00005951536,0.000003302663],"category_scores_gemma":[0.00002293503,0.00008445826,0.000040167055,0.0006076517,0.000019495588,0.0003591373,0.000101506586,0.00013750774,0.000017607661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062208665,0.00012606297,0.061812606,0.000026769329,0.0000073820815,0.00013988584,0.0010892807,0.00006934518,0.0020840296,0.021792356,0.00007890272,0.9127672],"study_design_scores_gemma":[0.003397273,0.0002464484,0.34097874,0.0007391972,0.000008144109,0.00023340879,0.0026978643,0.5537343,0.049941193,0.0045295116,0.04137845,0.0021154387],"about_ca_topic_score_codex":0.00032921202,"about_ca_topic_score_gemma":0.0007811078,"teacher_disagreement_score":0.91065174,"about_ca_system_score_codex":0.000069219124,"about_ca_system_score_gemma":0.00002310895,"threshold_uncertainty_score":0.3444108},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021564838,0.0005822821,0.9914877,0.0005655548,0.002279619,0.0009997862,0.00019033479,0.00021157096,0.003661578],"genre_scores_gemma":[0.083422154,0.000021696975,0.90765005,0.0025492976,0.0015442177,0.00012597896,0.00018544398,0.00009304415,0.0044081104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954698,0.000027805496,0.00072574714,0.0019545322,0.0008695168,0.0009525882],"domain_scores_gemma":[0.9964538,0.0007598692,0.00035880264,0.0018643307,0.00037857945,0.00018458244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009208706,0.00062585936,0.0007097903,0.00051570765,0.00036757192,0.00072341575,0.0032868637,0.00026857806,0.000008968921],"category_scores_gemma":[0.00012657503,0.00056005636,0.00021295433,0.0005338727,0.00045417223,0.00088822417,0.0011336001,0.0004939458,0.000050158575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003928914,0.00018160783,0.0003137637,0.0004117819,0.000039040613,0.000117382624,0.00033278498,0.14427373,0.000248779,0.050780796,0.009636038,0.793625],"study_design_scores_gemma":[0.0007245398,0.000104017665,0.00005580983,0.00050345634,0.000008527973,0.000052260704,7.748918e-8,0.8662693,0.00060561096,0.016152114,0.11472757,0.00079670455],"about_ca_topic_score_codex":0.00014916103,"about_ca_topic_score_gemma":0.00027126106,"teacher_disagreement_score":0.7928283,"about_ca_system_score_codex":0.0002540644,"about_ca_system_score_gemma":0.00043709003,"threshold_uncertainty_score":0.9996851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012497753,0.0008640302,0.520365,0.00003205672,0.0011277171,0.00064766256,0.0010260801,0.00020093472,0.475724],"genre_scores_gemma":[0.98163706,0.0000043507803,0.0003616949,0.0001538752,0.00015135735,0.00011475005,0.000059400405,0.000043657838,0.017473867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961999,0.00007454314,0.0011227456,0.0010933245,0.0008031952,0.000706276],"domain_scores_gemma":[0.99731225,0.000032340362,0.00055100734,0.00156327,0.00022438212,0.00031673687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003915601,0.0007120018,0.0009513667,0.000121347504,0.000089621855,0.0002514371,0.0017577797,0.0006197393,0.000009707993],"category_scores_gemma":[0.000008785327,0.00069190393,0.000367946,0.00007721623,0.00006685034,0.00018801683,0.00034066776,0.00042502076,0.00017919618],"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.000017665561,0.000039928935,0.000009602322,0.000100653335,0.000046341385,0.00024226282,0.00003727861,0.0055226292,0.000001824136,0.9902781,0.0019603504,0.0017433505],"study_design_scores_gemma":[0.0020497926,0.00025883372,0.00011674909,0.0036873864,0.00006648399,0.0001344022,0.00001107216,0.30315647,0.000023122699,0.57415813,0.11405609,0.0022814912],"about_ca_topic_score_codex":0.0007433038,"about_ca_topic_score_gemma":0.00013793286,"teacher_disagreement_score":0.98162454,"about_ca_system_score_codex":0.0007934722,"about_ca_system_score_gemma":0.00048631986,"threshold_uncertainty_score":0.9995532},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02786967,0.0020678972,0.965752,0.001567007,0.0003027164,0.000062038234,4.788398e-7,0.00007624522,0.0023019675],"genre_scores_gemma":[0.9984252,0.00018950686,0.00055749156,0.00016877723,0.00013657036,8.885205e-7,0.0000011537528,0.0000035107503,0.0005168877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980566,0.000047029385,0.00021170494,0.00017205757,0.0002566421,0.0012559557],"domain_scores_gemma":[0.99951357,0.000007952304,0.000111313064,0.00021454136,0.00008673852,0.00006591752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008986267,0.00009134655,0.000102949394,0.000064473155,0.00016772535,0.00017795352,0.0005244968,0.000040562394,0.0000028076026],"category_scores_gemma":[0.000019790477,0.00007731225,0.00006405297,0.000306688,0.000008141936,0.00016666402,0.000017664028,0.0005006121,0.00004401594],"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.0000027557978,0.00004619976,0.000030944928,6.284479e-7,0.000009223701,0.000003535043,0.00009848454,0.0019460584,0.00018628522,0.9257217,0.00023118927,0.07172301],"study_design_scores_gemma":[0.0013450064,0.0009528079,0.0028349767,0.00006448491,0.0000126150335,0.0021604772,0.0003489787,0.20700842,0.0002371877,0.770288,0.014185193,0.00056183577],"about_ca_topic_score_codex":0.0000040888617,"about_ca_topic_score_gemma":0.000008637238,"teacher_disagreement_score":0.97055554,"about_ca_system_score_codex":0.00035554238,"about_ca_system_score_gemma":0.0005477547,"threshold_uncertainty_score":0.31527022},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196656,0.0009075153,0.06399364,0.028848695,0.0077224392,0.0006076558,0.00011499986,0.0008506778,0.2772888],"genre_scores_gemma":[0.9959289,0.0000024044268,0.0027626678,0.00031082914,0.0001367628,0.0000044229328,0.0000030472206,0.0000042788697,0.0008466942],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992111,0.000018576076,0.0001292739,0.00025515855,0.0001746069,0.00021132827],"domain_scores_gemma":[0.9975924,0.000064186235,0.00015637859,0.0020708274,0.000044100518,0.00007209999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281684,0.0000924505,0.0001206993,0.000021564523,0.00037023687,0.00093135855,0.0033353672,0.00004461581,0.000016459313],"category_scores_gemma":[0.00018349609,0.00007552884,0.000037278314,0.000031407573,0.000040453313,0.00091705756,0.00051627465,0.00006994956,0.00042090306],"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.000054885295,0.00036954388,0.23898104,0.00025411727,0.00022161027,0.0009291481,0.0047349925,0.000101851336,0.004169667,0.2432155,0.11139129,0.39557636],"study_design_scores_gemma":[0.001220115,0.00016885501,0.6257795,0.00017460914,0.000018324761,0.00005787433,0.000054869735,0.008401728,0.003249151,0.0056434167,0.35436815,0.00086340477],"about_ca_topic_score_codex":0.00011689161,"about_ca_topic_score_gemma":0.00003925686,"teacher_disagreement_score":0.39471295,"about_ca_system_score_codex":0.0000075019193,"about_ca_system_score_gemma":0.00001797797,"threshold_uncertainty_score":0.8981112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002891644,0.0005109376,0.9425148,0.0016802793,0.0006300584,0.00019290273,0.00003736674,0.000116005416,0.05142602],"genre_scores_gemma":[0.9779064,0.0000091680395,0.008427331,0.00042078065,0.000073615556,0.0000069577554,0.0000010793809,0.000004009992,0.013150659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912953,0.000037741425,0.0002033171,0.00018455616,0.0002712697,0.00017355761],"domain_scores_gemma":[0.9992541,0.0000147594465,0.000075687,0.00054998073,0.000056490626,0.00004898752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105739644,0.00008151306,0.00012092227,0.000008165388,0.00005558706,0.000059660557,0.0008566503,0.000037465572,0.00019562038],"category_scores_gemma":[0.0000085031415,0.00005058632,0.00008809601,0.0003793782,0.00003037665,0.00019797056,0.0001797858,0.00004842502,0.00033766244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013816577,0.00040291296,0.0009878622,0.000029021146,0.0000496338,0.00001602057,0.00055904227,0.0005858628,0.00090338173,0.06274672,0.31619555,0.6175226],"study_design_scores_gemma":[0.00026564687,0.00003249083,0.002403609,0.000038090264,0.000003598841,0.000042411633,0.000017341285,0.9319533,0.00081775757,0.0005903935,0.06368752,0.00014781002],"about_ca_topic_score_codex":0.00004805684,"about_ca_topic_score_gemma":0.0000023660646,"teacher_disagreement_score":0.97501475,"about_ca_system_score_codex":0.000030296636,"about_ca_system_score_gemma":0.000013776959,"threshold_uncertainty_score":0.434008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8222895,0.0003890896,0.16380095,0.0021151735,0.0012484269,0.0003059423,0.00005686682,0.00055182446,0.009242217],"genre_scores_gemma":[0.9929731,0.0000075997327,0.006296459,0.00024101735,0.00023261043,0.00000824905,0.000032014403,0.00000549612,0.0002034845],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990099,0.000030430023,0.00021810111,0.00026226623,0.00024433425,0.0002349733],"domain_scores_gemma":[0.9991828,0.00006629296,0.00013367705,0.0005102932,0.0000505626,0.00005633166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024607763,0.0001027847,0.00010435729,0.00002784765,0.00016836805,0.00028993224,0.0007374141,0.000056166904,0.00002523315],"category_scores_gemma":[0.0000617843,0.000095201496,0.000032185442,0.00019832494,0.000017627419,0.0011359748,0.000131919,0.00007322081,0.00032125623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008228451,0.0008666221,0.05235801,0.00026046156,0.00020443066,0.00008853912,0.015806498,0.039763335,0.024823796,0.041505005,0.04689382,0.7773472],"study_design_scores_gemma":[0.001981889,0.00022165921,0.20446348,0.00017358559,0.000025029663,0.000084756786,0.0009157725,0.20459472,0.026687924,0.00073564606,0.55891544,0.0012000701],"about_ca_topic_score_codex":0.00014512725,"about_ca_topic_score_gemma":0.00022409347,"teacher_disagreement_score":0.7761471,"about_ca_system_score_codex":0.000047560006,"about_ca_system_score_gemma":0.000017256058,"threshold_uncertainty_score":0.4129206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1295363,0.0015061805,0.8641065,0.0003466922,0.0036484865,0.00026083615,0.00020775292,0.00010908077,0.00027820645],"genre_scores_gemma":[0.99084985,0.0002377202,0.0047578933,0.00013970723,0.0013949791,0.00008929039,0.0010089143,0.0000131149245,0.0015085428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997796,0.000030852305,0.0004791074,0.00065202225,0.00051456684,0.0005274266],"domain_scores_gemma":[0.9983625,0.00009015724,0.0003658426,0.00047450018,0.00048675123,0.00022029055],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049685145,0.00027460168,0.00038522555,0.00030750668,0.000746789,0.0013736475,0.00096465927,0.00010817832,0.00015995486],"category_scores_gemma":[0.000003991942,0.00026939987,0.00018849561,0.0007428735,0.00011083221,0.0020849921,0.00011927114,0.0001891176,0.000017768565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007539762,0.0006622041,0.06562316,0.00012865044,0.0037305595,0.0000041501366,0.005795533,0.04285387,0.0004995406,0.13167445,0.004791245,0.74416125],"study_design_scores_gemma":[0.00047262295,0.000031653097,0.021642892,0.00011291486,0.00022985271,0.0000054355496,0.0001597052,0.8911222,0.00017290429,0.00072564767,0.08484271,0.0004814311],"about_ca_topic_score_codex":0.00011566621,"about_ca_topic_score_gemma":0.00010723276,"teacher_disagreement_score":0.8613135,"about_ca_system_score_codex":0.00009195264,"about_ca_system_score_gemma":0.00005982624,"threshold_uncertainty_score":0.9999758},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103364915,0.000055617376,0.07233548,0.0004216685,0.00033411453,0.0001794526,0.000008003235,0.00009437246,0.82320637],"genre_scores_gemma":[0.9809432,0.0000011076817,0.0038991377,0.000093269584,0.000010580469,0.0000021495453,0.0000014973523,0.0000018219008,0.015047214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995334,0.0000084201965,0.00009237515,0.0001375885,0.00013452415,0.00009367906],"domain_scores_gemma":[0.999562,0.000018235887,0.000042005075,0.00031127135,0.000037927788,0.000028552935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053873122,0.000049246573,0.00009738312,0.000014824744,0.00001265153,0.000030615192,0.00030936056,0.000017829878,0.0005823075],"category_scores_gemma":[0.0000021477165,0.00003189748,0.000021362637,0.00014422914,0.000015355557,0.00013187654,0.000035939112,0.00002602123,0.00028250262],"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.000033956578,0.00024094946,0.064811744,0.0002533102,0.00009869312,0.000025192976,0.0009964759,0.0007304426,0.020262666,0.8319473,0.04644046,0.034158796],"study_design_scores_gemma":[0.0019943502,0.0007642624,0.087906264,0.00033234165,0.00000799105,0.000052508487,0.000459031,0.03495351,0.011974856,0.00041430473,0.86039734,0.0007432594],"about_ca_topic_score_codex":0.000067616,"about_ca_topic_score_gemma":0.00001752519,"teacher_disagreement_score":0.8775783,"about_ca_system_score_codex":0.000004735984,"about_ca_system_score_gemma":0.000024696477,"threshold_uncertainty_score":0.6375859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023623406,0.00013553828,0.7819822,0.00010368795,0.0020678488,0.00028579414,0.000008546679,0.0004003011,0.21499248],"genre_scores_gemma":[0.49911168,0.00006101435,0.40772703,0.0012635529,0.0017183702,0.00007323285,0.000010398623,0.00017538364,0.08985933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946953,0.000026475544,0.00090362335,0.0020174277,0.0014442146,0.00091292564],"domain_scores_gemma":[0.99619544,0.00007016126,0.00045148877,0.0026279422,0.00031956402,0.00033541798],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018212658,0.00061079615,0.00081713754,0.00066121726,0.00028917176,0.0008777555,0.0058899797,0.00030925282,0.0000058932837],"category_scores_gemma":[0.000015807946,0.00061410095,0.00019273152,0.00045618336,0.0004929121,0.00067038793,0.0020126256,0.00064180454,0.0003092534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001355136,0.000008916897,0.000006434844,0.0001105677,0.0000059433532,0.000064601394,0.00010731768,0.016351895,0.000017141163,0.93218654,0.00033665315,0.05080263],"study_design_scores_gemma":[0.00023149085,0.000046233552,0.0000369622,0.0008573834,0.0000040165496,0.00006607699,5.492726e-7,0.9674463,0.000039643455,0.0059092967,0.024664775,0.0006972465],"about_ca_topic_score_codex":0.000025581616,"about_ca_topic_score_gemma":0.000012324047,"teacher_disagreement_score":0.95109445,"about_ca_system_score_codex":0.0006357269,"about_ca_system_score_gemma":0.00064191065,"threshold_uncertainty_score":0.99963105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045368914,0.0009163407,0.92022544,0.05186467,0.00017543098,0.020023325,0.0000023195882,0.00009888883,0.00215672],"genre_scores_gemma":[0.9926958,0.00011435912,0.00055593636,0.0017583246,0.00045230825,0.0035811572,4.9308375e-7,0.000012345709,0.00082926976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984114,0.00011773033,0.00021830048,0.00017847728,0.00023330768,0.0008407695],"domain_scores_gemma":[0.9995461,0.000033270113,0.00012429178,0.00015129911,0.000055412685,0.00008959188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010960189,0.00009849789,0.00014581908,0.000018217224,0.00024133798,0.00021260692,0.00057152484,0.00003366253,0.0000038140718],"category_scores_gemma":[0.00004695645,0.000055384622,0.000057713565,0.00025673586,0.00005133218,0.00023383672,0.00012424219,0.0007318468,0.000017157165],"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.0001486292,0.0000264892,0.00026358818,0.000015050326,0.00004901966,0.000010535238,0.00076913467,0.00004039327,0.00033723237,0.9424978,0.0027988395,0.053043284],"study_design_scores_gemma":[0.019210428,0.0013309882,0.0011318108,0.00010828924,0.00003175536,0.003054947,0.0012336603,0.13328804,0.00026647112,0.2550849,0.58450514,0.00075355277],"about_ca_topic_score_codex":0.000016347454,"about_ca_topic_score_gemma":0.00003353882,"teacher_disagreement_score":0.98815894,"about_ca_system_score_codex":0.00008479459,"about_ca_system_score_gemma":0.00058825297,"threshold_uncertainty_score":0.31795508},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048584516,0.00021776566,0.31087917,0.00014075651,0.0010569652,0.00013983581,0.00002379284,0.00021447617,0.6873224],"genre_scores_gemma":[0.0073020197,0.00003046639,0.0094244685,0.00032030756,0.00025547345,0.000009672402,0.000024745103,0.000033644144,0.9825992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815404,0.0000064494598,0.0003847355,0.0006424924,0.0005190352,0.00029325846],"domain_scores_gemma":[0.99826014,0.000030513602,0.00019198196,0.001212273,0.00014664745,0.00015841823],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017601007,0.00033786707,0.00036696522,0.00009154939,0.000102634505,0.0002625799,0.0014401947,0.0005754311,0.0005781178],"category_scores_gemma":[0.000005025009,0.00028905328,0.00019400196,0.00003002529,0.000038108126,0.00018450721,0.0003294091,0.00067126524,0.0024784962],"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":[8.1672437e-7,0.0000072547723,0.0000025479967,0.00001148029,0.000021357893,0.000084269624,0.000015093526,0.0000019121785,0.00003888664,0.98328876,0.0039107003,0.0126169305],"study_design_scores_gemma":[0.00014117607,0.0000267598,0.0000142486515,0.000056792418,0.000008213242,0.00012327293,9.956822e-7,0.00071094744,0.000054925786,0.022899395,0.97553134,0.00043192174],"about_ca_topic_score_codex":0.000034087956,"about_ca_topic_score_gemma":0.00010095264,"teacher_disagreement_score":0.9716207,"about_ca_system_score_codex":0.000041843792,"about_ca_system_score_gemma":0.00010722636,"threshold_uncertainty_score":0.9999562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196656,0.0009075153,0.06399364,0.028848695,0.0077224392,0.0006076558,0.00011499986,0.0008506778,0.2772888],"genre_scores_gemma":[0.9959289,0.0000024044268,0.0027626678,0.00031082914,0.0001367628,0.0000044229328,0.0000030472206,0.0000042788697,0.0008466942],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992111,0.000018576076,0.0001292739,0.00025515855,0.0001746069,0.00021132827],"domain_scores_gemma":[0.9975924,0.000064186235,0.00015637859,0.0020708274,0.000044100518,0.00007209999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281684,0.0000924505,0.0001206993,0.000021564523,0.00037023687,0.00093135855,0.0033353672,0.00004461581,0.000016459313],"category_scores_gemma":[0.00018349609,0.00007552884,0.000037278314,0.000031407573,0.000040453313,0.00091705756,0.00051627465,0.00006994956,0.00042090306],"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.000054885295,0.00036954388,0.23898104,0.00025411727,0.00022161027,0.0009291481,0.0047349925,0.000101851336,0.004169667,0.2432155,0.11139129,0.39557636],"study_design_scores_gemma":[0.001220115,0.00016885501,0.6257795,0.00017460914,0.000018324761,0.00005787433,0.000054869735,0.008401728,0.003249151,0.0056434167,0.35436815,0.00086340477],"about_ca_topic_score_codex":0.00011689161,"about_ca_topic_score_gemma":0.00003925686,"teacher_disagreement_score":0.39471295,"about_ca_system_score_codex":0.0000075019193,"about_ca_system_score_gemma":0.00001797797,"threshold_uncertainty_score":0.8981112},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.2651478e-8,0.00009902498,0.3715761,0.0025401476,0.0010490307,0.00005184679,0.0000076268693,0.00014021715,0.624536],"genre_scores_gemma":[0.00014356489,0.000028693625,0.0014566313,0.00011445372,0.0018420646,0.0000030518725,0.0000052619407,0.000010840554,0.9963954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990706,0.000004151759,0.00018997383,0.00040875096,0.00019624141,0.00013030514],"domain_scores_gemma":[0.999045,0.000010874502,0.00010117294,0.00070618937,0.00008401556,0.000052721487],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008845109,0.00015477565,0.00017743718,0.00005202592,0.00003765845,0.00008001663,0.0005006855,0.00014807777,0.0007300712],"category_scores_gemma":[0.000003882697,0.00010554643,0.00007693056,0.000015232706,0.000022297116,0.00019933308,0.000105009894,0.00009453628,0.0036380414],"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":[3.324691e-7,0.0000012123636,8.428905e-8,0.0000039092856,0.000007721645,0.0000033163633,0.000003238135,1.6440084e-7,0.000009839929,0.78072995,0.16604418,0.053196084],"study_design_scores_gemma":[0.000055972392,0.000013475902,0.0000015204339,0.00003420581,0.0000018777625,0.000017537643,1.4518717e-7,0.00006742808,0.000021884402,0.03906937,0.9605578,0.0001587702],"about_ca_topic_score_codex":0.000001159314,"about_ca_topic_score_gemma":0.0000013857388,"teacher_disagreement_score":0.79451364,"about_ca_system_score_codex":0.000042483152,"about_ca_system_score_gemma":0.00003228233,"threshold_uncertainty_score":0.9971377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013238028,0.0005139734,0.98184645,0.00034557952,0.0007355361,0.00025892945,0.000018527746,0.00014301496,0.0028999783],"genre_scores_gemma":[0.9840607,0.00005883572,0.015615516,0.00008851505,0.00003567955,0.000020100058,0.000020926183,0.000005164126,0.00009454262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859804,0.00006266823,0.00023722576,0.00065983576,0.00024049693,0.00020173895],"domain_scores_gemma":[0.99919355,0.00002988048,0.00012603485,0.00040842727,0.00013825248,0.000103827675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018568912,0.00021382661,0.00032763882,0.0000342921,0.0000759407,0.00050806144,0.00031715335,0.00015885083,0.000031536332],"category_scores_gemma":[0.000005740536,0.00016863595,0.000053372984,0.00009994602,0.00010563858,0.00018905273,0.00018883953,0.00038962683,0.0000030495205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000730052,0.00026229533,0.0011560995,0.0011729368,0.00024031078,0.000319565,0.0027333666,0.0013512962,0.00034593666,0.057101224,0.0003117525,0.9349979],"study_design_scores_gemma":[0.007502396,0.0008361445,0.04193967,0.008012049,0.0003340053,0.002809727,0.0032292975,0.9013942,0.005327867,0.003896798,0.017933264,0.0067845746],"about_ca_topic_score_codex":0.000076456156,"about_ca_topic_score_gemma":0.000044570763,"teacher_disagreement_score":0.9708227,"about_ca_system_score_codex":0.000042837684,"about_ca_system_score_gemma":0.00020072663,"threshold_uncertainty_score":0.6876774},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14412862,0.0017727052,0.03095939,0.00065430696,0.005256594,0.0009963792,0.000020065543,0.000651419,0.8155605],"genre_scores_gemma":[0.80129737,0.000042764357,0.003116446,0.00047927638,0.00023445078,0.000066657485,0.000280523,0.000033906002,0.19444859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828655,0.000017447524,0.0004061388,0.0005871745,0.0003910763,0.00031163968],"domain_scores_gemma":[0.99909806,0.000013789189,0.0001259626,0.00059181184,0.0000977329,0.00007266021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023845021,0.0002200925,0.0002857899,0.00010552554,0.000038246664,0.00023204071,0.0011902574,0.00023686871,0.000041617604],"category_scores_gemma":[0.000011502122,0.00020855102,0.000085674896,0.0003307455,0.0000047220997,0.00042364164,0.000085537926,0.00026637927,0.00020601069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021782781,0.0012648518,0.0129061015,0.0032830543,0.00035256313,0.00097543356,0.033535592,0.012257267,0.00070404226,0.35168046,0.14137644,0.44144636],"study_design_scores_gemma":[0.004729245,0.00015153857,0.13675208,0.0040169023,0.000039225404,0.00005677539,0.0017735659,0.5439266,0.001035169,0.0016849664,0.301019,0.004814879],"about_ca_topic_score_codex":0.00077789935,"about_ca_topic_score_gemma":0.015248417,"teacher_disagreement_score":0.65716875,"about_ca_system_score_codex":0.00022021378,"about_ca_system_score_gemma":0.00014304076,"threshold_uncertainty_score":0.85089743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011528507,0.0012318179,0.9947802,0.00046007967,0.00050046796,0.0013873331,0.000039010112,0.00012537773,0.0014641784],"genre_scores_gemma":[0.029438453,0.000060401293,0.96700037,0.0013188455,0.00039050507,0.00023208595,0.00003690968,0.000037547445,0.0014848879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664295,0.000014991476,0.00056774885,0.0017578366,0.0004884883,0.00052799686],"domain_scores_gemma":[0.9969489,0.00030669355,0.0003230181,0.0017930756,0.0004400065,0.0001883243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012555275,0.00037320887,0.00043514272,0.00036831587,0.00035586613,0.00045383483,0.0015658134,0.0003104873,0.000002750062],"category_scores_gemma":[0.000070809205,0.00034783946,0.0000992284,0.000433011,0.0005131262,0.00034343355,0.00048551767,0.00035668293,0.000015255742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044040207,0.00004348359,0.00006786672,0.00009463316,0.000012289507,0.0000054609936,0.00020666834,0.0016746996,0.00013637236,0.071113855,0.00008420904,0.92655605],"study_design_scores_gemma":[0.0006470285,0.000121303914,0.00029925405,0.00030070503,0.000015678614,0.00009583513,4.5424278e-7,0.8662304,0.0008088353,0.031005893,0.09968589,0.0007886816],"about_ca_topic_score_codex":0.0000250147,"about_ca_topic_score_gemma":0.000069220965,"teacher_disagreement_score":0.92576736,"about_ca_system_score_codex":0.00021387875,"about_ca_system_score_gemma":0.00027512107,"threshold_uncertainty_score":0.99989736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014409442,0.00015831944,0.8293087,0.0012739053,0.00029562743,0.000053506716,8.016213e-7,0.00039494963,0.16707326],"genre_scores_gemma":[0.8504488,0.0000034860827,0.13890602,0.0005117566,0.000044983128,0.00002112722,0.000003442708,0.0000022562133,0.010058138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999609,0.000010960645,0.0000633888,0.0001368223,0.00008213419,0.00009772395],"domain_scores_gemma":[0.9996202,0.0000059586478,0.000009855319,0.0002699382,0.00005860665,0.000035471447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003866486,0.00003060818,0.0000454195,0.000005686563,0.00002583432,0.00013094931,0.0001969626,0.000014670376,0.000033973884],"category_scores_gemma":[0.0000049049586,0.000025211328,0.000023228868,0.00020999723,0.000004715627,0.00012692116,0.00006573034,0.000024408788,0.00014193694],"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":[1.401187e-7,0.00009304423,0.00032580734,0.0000053063113,0.0000050032927,0.00007810883,0.000042795164,0.0000054123884,0.0003088898,0.6008825,0.017142994,0.38111],"study_design_scores_gemma":[0.00014843114,0.000021370213,0.002827101,0.000008365196,6.284802e-7,0.000061897284,0.000018862265,0.025244234,0.004128453,0.0015564346,0.9658746,0.000109638655],"about_ca_topic_score_codex":0.0000039894453,"about_ca_topic_score_gemma":0.0000034267075,"teacher_disagreement_score":0.9487316,"about_ca_system_score_codex":0.0000044808385,"about_ca_system_score_gemma":0.000032462194,"threshold_uncertainty_score":0.18243594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6260232,0.00072342716,0.010066876,0.020488463,0.0046637533,0.0015030081,0.00004520342,0.00033950948,0.33614656],"genre_scores_gemma":[0.9971766,0.000011277769,0.0017279338,0.00009820669,0.00007256407,0.00002410429,1.2269605e-7,0.0000045495376,0.0008846442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905866,0.000002558724,0.000198715,0.00022353829,0.00031713012,0.00019941901],"domain_scores_gemma":[0.99895513,0.000008551289,0.00037031423,0.00047453077,0.00014109998,0.00005036345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025997596,0.000098681,0.00014647924,0.000020875632,0.00034736225,0.0003283055,0.0026964615,0.000033729295,0.000004692379],"category_scores_gemma":[0.000080091675,0.00006398971,0.00009330434,0.00006586633,0.00007378044,0.0005007933,0.00072832033,0.00008320481,0.000014640412],"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.000012834736,0.00020006785,0.03225876,0.00018169089,0.000077298515,0.000002275655,0.0010331582,0.000010417579,0.05285279,0.8273743,0.06282776,0.023168653],"study_design_scores_gemma":[0.0024081762,0.00021092322,0.18318936,0.0009568191,0.00004174661,0.00007211641,0.0003586124,0.0071238233,0.54443085,0.046432216,0.21389253,0.0008828112],"about_ca_topic_score_codex":0.00010820428,"about_ca_topic_score_gemma":0.0000037571765,"teacher_disagreement_score":0.7809421,"about_ca_system_score_codex":0.000030413392,"about_ca_system_score_gemma":0.000019882795,"threshold_uncertainty_score":0.5010741},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2895088,0.0009646172,0.70785517,0.00006497573,0.000756394,0.0005103504,0.00012882543,0.00008567119,0.00012519564],"genre_scores_gemma":[0.9970287,0.000036968,0.002699464,0.0000106401585,0.000024293562,0.00004059063,0.00012359016,0.0000074189634,0.000028329025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979381,0.00019962271,0.0006524506,0.00058010523,0.00044184402,0.00018785532],"domain_scores_gemma":[0.9977911,0.00030477517,0.0005312207,0.00084755337,0.00045202914,0.000073322204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246851,0.00023196761,0.0006711571,0.0000825712,0.000048907354,0.00014785833,0.00053708727,0.00022410463,0.0000015905865],"category_scores_gemma":[0.00024840306,0.0002044444,0.00012276112,0.00024042817,0.000049401,0.00018374533,0.0007134411,0.00027887747,5.850734e-7],"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.0003058733,0.0055283736,0.09317703,0.25755203,0.0025134555,0.00031973032,0.015842281,0.26820397,0.019973984,0.15011966,0.005232239,0.18123138],"study_design_scores_gemma":[0.002576495,0.00045884456,0.13826099,0.013824175,0.00010124434,0.00003709385,0.0006374149,0.79214555,0.049092192,0.00087906676,0.00058419106,0.0014027205],"about_ca_topic_score_codex":0.00033573693,"about_ca_topic_score_gemma":0.000006865112,"teacher_disagreement_score":0.7075199,"about_ca_system_score_codex":0.0000801017,"about_ca_system_score_gemma":0.00013697454,"threshold_uncertainty_score":0.83370006},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000042750944,0.0022142634,0.21625932,0.00010767078,0.0026920815,0.00058984227,0.0024702605,0.0001618481,0.7755004],"genre_scores_gemma":[0.0047860304,0.001866379,0.0016297213,0.00003780542,0.0021856704,0.00014431366,0.00079336227,0.00008628703,0.98847044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99685246,0.00005410329,0.0010480501,0.0010433119,0.0006914218,0.00031064378],"domain_scores_gemma":[0.9945629,0.00011703292,0.0010029874,0.003893224,0.0002522272,0.00017159125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065188215,0.0003844288,0.0006754704,0.00014769251,0.00006903094,0.00006829517,0.0013962259,0.0002726587,0.00005126546],"category_scores_gemma":[0.00007206871,0.000308119,0.00016546667,0.00006843608,0.000074422656,0.0005406755,0.0003504374,0.00020381047,0.000607355],"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.00000531344,0.000018394256,0.000014600757,0.0002702485,0.000054248692,0.00002804064,0.000046718236,0.0000028979612,0.00008942039,0.9340465,0.052652337,0.012771272],"study_design_scores_gemma":[0.00023864246,0.000039388022,0.00000762554,0.001166301,0.000020184336,0.000030275396,0.000002801135,0.00046261508,0.000042356416,0.00063805515,0.9969713,0.00038043677],"about_ca_topic_score_codex":0.00005395811,"about_ca_topic_score_gemma":0.0000043143655,"teacher_disagreement_score":0.944319,"about_ca_system_score_codex":0.00007279891,"about_ca_system_score_gemma":0.0002057136,"threshold_uncertainty_score":0.9999371},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010102386,0.0022628568,0.18040329,0.0001376477,0.002038327,0.00018696625,0.00020034118,0.00010782215,0.81466174],"genre_scores_gemma":[0.00014537502,0.00064173795,0.020622741,0.000046979916,0.00084308867,0.000016154818,0.000077400975,0.000043851287,0.97756267],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977146,0.000016735063,0.00059127045,0.0005419899,0.00087785407,0.0002575621],"domain_scores_gemma":[0.9983033,0.000055318495,0.00034952973,0.000743088,0.0003488508,0.00019989134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030930692,0.00035399586,0.000571433,0.00014272363,0.00004951927,0.00003680572,0.0010413874,0.00034536514,0.00028019914],"category_scores_gemma":[0.000011665526,0.00034148933,0.00023220024,0.000072009476,0.000092811286,0.0002998811,0.000091595946,0.00037288992,0.00020826534],"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.000012979685,0.000093364564,0.0000022634129,0.00013477754,0.00022229666,0.00016439863,0.00068577996,0.00020708503,0.000005880165,0.27840453,0.17146097,0.5486057],"study_design_scores_gemma":[0.0003294571,0.00008260473,0.000010522949,0.00012245127,0.000021547488,0.000042243722,0.0000065861022,0.0016542712,0.000010026125,0.016312787,0.98100984,0.0003976843],"about_ca_topic_score_codex":0.000024992254,"about_ca_topic_score_gemma":0.000004301024,"teacher_disagreement_score":0.80954885,"about_ca_system_score_codex":0.00008102304,"about_ca_system_score_gemma":0.00039003207,"threshold_uncertainty_score":0.99990374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051535554,0.0005996533,0.94472706,0.0010973956,0.00045294547,0.00081724714,0.00008979648,0.00023663211,0.00044372777],"genre_scores_gemma":[0.7877115,0.00014776441,0.208467,0.0015879329,0.00022124224,0.00078041956,0.00006908798,0.00002446732,0.0009905567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854267,0.00003194224,0.00030508978,0.00052603066,0.0002652996,0.000328948],"domain_scores_gemma":[0.9985427,0.0004926337,0.00024088756,0.00034258416,0.00031337678,0.000067786576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506527,0.00017136984,0.00016884712,0.00004726653,0.00031217243,0.0003900283,0.00032643924,0.00006465409,0.000006421805],"category_scores_gemma":[0.00054618786,0.00015630372,0.000034008022,0.00032256366,0.00003714734,0.0027803613,0.00006592455,0.00008443093,0.000019397485],"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.0028373955,0.0036048633,0.0412841,0.0021288905,0.00024611937,0.0002175087,0.051302593,0.006284082,0.0064402884,0.08887632,0.1715174,0.6252604],"study_design_scores_gemma":[0.0045661903,0.0013570037,0.0063539306,0.00032109354,0.00004422183,0.00015333534,0.009488473,0.0026571439,0.026040243,0.004400928,0.9432486,0.0013688292],"about_ca_topic_score_codex":0.00058965717,"about_ca_topic_score_gemma":0.00008989489,"teacher_disagreement_score":0.7717312,"about_ca_system_score_codex":0.000041239546,"about_ca_system_score_gemma":0.00012279977,"threshold_uncertainty_score":0.63738805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002569754,0.00011192341,0.99530256,0.0003124009,0.00037380608,0.0001751419,0.0000066777043,0.000166535,0.0009812234],"genre_scores_gemma":[0.7280956,0.0000018098057,0.26256442,0.0003676296,0.00010407043,0.00007530902,0.000005617601,0.000005737335,0.008779829],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992204,0.00000694629,0.0001785909,0.00023768486,0.00015932984,0.00019706608],"domain_scores_gemma":[0.9995873,0.000017864846,0.00003927481,0.0002322817,0.00008485946,0.000038394548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000845235,0.000076607575,0.00008519362,0.000026373611,0.00013135067,0.00010377436,0.00031781575,0.00003975655,0.00009940531],"category_scores_gemma":[0.0000146114335,0.0000670745,0.0000425422,0.0001349597,0.000008110413,0.0002705964,0.00005576487,0.000026718139,0.00021759176],"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.0000056843137,0.00024665752,0.0010912134,0.000099889825,0.00004646559,0.0000058274304,0.0018200957,0.00012650355,0.00042805256,0.13986142,0.47338298,0.3828852],"study_design_scores_gemma":[0.00084140827,0.000047637837,0.0028715397,0.000037279104,0.0000038386765,0.000014214482,0.00002336683,0.25636032,0.0042226594,0.0012767462,0.7338698,0.00043120142],"about_ca_topic_score_codex":0.000006933172,"about_ca_topic_score_gemma":0.00000361115,"teacher_disagreement_score":0.73273814,"about_ca_system_score_codex":0.000049444265,"about_ca_system_score_gemma":0.000024563818,"threshold_uncertainty_score":0.27967745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40744546,0.003731313,0.40044937,0.036874436,0.003659339,0.0006894187,0.00009669714,0.0020939584,0.14496002],"genre_scores_gemma":[0.9756184,0.0000046093614,0.022693364,0.00066520745,0.00026851112,0.0000056358003,0.0000049814143,0.0000046344094,0.0007346156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999119,0.00002512444,0.00016741836,0.00025428427,0.00019914753,0.00023505553],"domain_scores_gemma":[0.9989304,0.00010161812,0.00007067953,0.0007806229,0.000036233043,0.00008047585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015160738,0.00009712558,0.00011800322,0.000035091743,0.000084077175,0.00018889726,0.0014522698,0.00004420535,0.000036344874],"category_scores_gemma":[0.00006850418,0.000082571554,0.000036320114,0.00017708752,0.000018984523,0.00059230265,0.00018740592,0.000079111596,0.00084288296],"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.000016699638,0.0003075145,0.008827047,0.00008130776,0.00008021457,0.00011335548,0.0031953978,0.0028786631,0.002169182,0.20912631,0.13024294,0.6429614],"study_design_scores_gemma":[0.00041583856,0.00005572742,0.010038769,0.000038095972,0.0000061278683,0.000024463665,0.000043124008,0.03666357,0.0015726216,0.00089945534,0.94990015,0.00034205828],"about_ca_topic_score_codex":0.000034447286,"about_ca_topic_score_gemma":0.000043973552,"teacher_disagreement_score":0.8196572,"about_ca_system_score_codex":0.000015897622,"about_ca_system_score_gemma":0.000021446474,"threshold_uncertainty_score":0.9999351},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017490127,0.000035937617,0.9817858,0.0008404499,0.00031170435,0.00021399584,0.000004754678,0.0002019453,0.014856399],"genre_scores_gemma":[0.8609227,0.0000013131228,0.13734545,0.0005636646,0.00007634813,0.00004251402,0.0000036981805,0.000006582957,0.0010377341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925876,0.000007811123,0.00016284567,0.00023430864,0.0001058291,0.00023042259],"domain_scores_gemma":[0.999524,0.00002300788,0.00003668909,0.00030507115,0.000056439312,0.000054814096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013492267,0.00009271077,0.00010880152,0.000028177694,0.000084689585,0.00034068036,0.000431568,0.000040458915,0.0000052233913],"category_scores_gemma":[0.0000056447166,0.0000762626,0.000054522967,0.000117592164,0.000014558169,0.0006440879,0.00008544413,0.000038779766,0.00005362983],"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.000010461148,0.000065405824,0.00001912681,0.00007208264,0.00001897212,0.000005081535,0.0011258763,0.033451155,0.0006519181,0.9445103,0.0047930484,0.015276574],"study_design_scores_gemma":[0.006195401,0.0004835458,0.0006046346,0.00021258877,0.000011472313,0.0001415251,0.0013821298,0.66817284,0.0023975573,0.112695314,0.20645332,0.0012496497],"about_ca_topic_score_codex":0.00004369287,"about_ca_topic_score_gemma":0.0000448843,"teacher_disagreement_score":0.85917366,"about_ca_system_score_codex":0.000030340776,"about_ca_system_score_gemma":0.00008807708,"threshold_uncertainty_score":0.32851887},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.2267185e-8,0.0008457097,0.39830703,0.00022968595,0.0007849664,0.00013723344,0.000036956764,0.00011289623,0.5995455],"genre_scores_gemma":[0.0024419753,0.000046149984,0.0012252568,0.0015409896,0.00011750274,0.000009964565,0.000012144451,0.000019276764,0.99458677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986204,0.000013620274,0.0003491801,0.00048324623,0.00029499037,0.00023855157],"domain_scores_gemma":[0.9987775,0.000037348473,0.0001743946,0.0007598673,0.0001318705,0.00011900466],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013645474,0.00028346488,0.00040848082,0.000055375127,0.000057776062,0.00014456219,0.0007864921,0.00024158435,0.00041924487],"category_scores_gemma":[0.000007125484,0.00024213704,0.00016185618,0.000027446704,0.00003780608,0.00015004406,0.00005229357,0.00023415539,0.0011143821],"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":[4.0427167e-7,0.000004479727,0.0000013352652,0.0000097021375,0.000023222397,0.000020567555,0.0000069403713,0.0000013851952,0.0000015796844,0.9000889,0.090492286,0.009349166],"study_design_scores_gemma":[0.0003570006,0.000028260307,0.0000024565386,0.000059892827,0.000007749225,0.000023985365,4.0259576e-7,0.00083189266,0.000003924664,0.01821927,0.9801511,0.0003140461],"about_ca_topic_score_codex":0.000004771137,"about_ca_topic_score_gemma":0.0000023970467,"teacher_disagreement_score":0.8896588,"about_ca_system_score_codex":0.000036346046,"about_ca_system_score_gemma":0.00007166485,"threshold_uncertainty_score":0.99966335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034968273,0.00019950082,0.9788657,0.00046017172,0.00058538595,0.00008443783,0.0000011389361,0.00012790163,0.019326096],"genre_scores_gemma":[0.102520555,0.00001854008,0.8908835,0.00035128038,0.00014462337,0.000012157621,0.0000021138542,0.0000071457043,0.0060601057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901706,0.000086074775,0.00018669238,0.00032342743,0.00015344853,0.00023328858],"domain_scores_gemma":[0.99940103,0.000095388365,0.000053868887,0.00030223053,0.00003939313,0.00010807653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084785034,0.00010902565,0.00016608431,0.00003706593,0.00009906075,0.00022187059,0.00036170203,0.000043676442,0.000018721357],"category_scores_gemma":[0.000033447763,0.00008754966,0.000029685085,0.000154789,0.000022963317,0.00029674562,0.00017161701,0.000068801186,0.000033543198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003096936,0.000022551818,0.00020319846,0.000024287403,0.000020804318,0.0000025297545,0.0004977254,0.00015445697,0.0005209679,0.37795264,0.008875075,0.61172265],"study_design_scores_gemma":[0.00065301365,0.00006674691,0.0008116334,0.000024034474,0.0000037952825,0.000027317144,0.000071408285,0.7244018,0.0008380058,0.00337393,0.26947784,0.00025047408],"about_ca_topic_score_codex":0.000033091143,"about_ca_topic_score_gemma":0.0000019327358,"teacher_disagreement_score":0.72424734,"about_ca_system_score_codex":0.000011834557,"about_ca_system_score_gemma":0.000009075394,"threshold_uncertainty_score":0.35701716},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014131726,0.52136964,0.44974917,0.0016137463,0.0027107974,0.0018248011,0.000016176107,0.0006570991,0.020645393],"genre_scores_gemma":[0.9503049,0.009921823,0.029446453,0.0050264327,0.0011235144,0.00027578408,0.000042744356,0.00006926971,0.003789044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974646,0.00017875513,0.0009155338,0.00050061336,0.00045598284,0.00048454574],"domain_scores_gemma":[0.9974598,0.00020135255,0.00024544421,0.0016919822,0.00022930228,0.00017207538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183059,0.00023707618,0.0005770707,0.00004802411,0.00020838049,0.00032410226,0.0018374531,0.000080929705,0.000013284261],"category_scores_gemma":[0.00060899736,0.00018561819,0.00011568933,0.0006545951,0.00001998643,0.00048491862,0.00029934998,0.00018353923,0.0004298848],"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.0000037605653,0.00026659892,0.005016472,0.023612568,0.00024884866,0.0007990272,0.0014257553,0.00019019324,0.004571278,0.32252553,0.22469868,0.4166413],"study_design_scores_gemma":[0.00045972413,0.00013076178,0.00091786135,0.019275058,0.000031011656,0.00063773163,0.00009760393,0.004256119,0.00023538848,0.000051358475,0.97300273,0.000904674],"about_ca_topic_score_codex":0.0001597237,"about_ca_topic_score_gemma":0.000010271047,"teacher_disagreement_score":0.94889176,"about_ca_system_score_codex":0.000066909124,"about_ca_system_score_gemma":0.000058195605,"threshold_uncertainty_score":0.75692904},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003175816,0.013675053,0.13343431,0.0000837641,0.010391542,0.0010939201,0.0062006996,0.00028890005,0.8348286],"genre_scores_gemma":[0.0035860485,0.0027244021,0.00057792437,0.000024512796,0.0021025825,0.00013441098,0.0004723602,0.00013355176,0.9902442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947806,0.000122028876,0.0017998037,0.0012747822,0.0013360886,0.00068669964],"domain_scores_gemma":[0.9938509,0.00025923815,0.0015687299,0.0035128165,0.00044905988,0.00035923935],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000907563,0.00080644374,0.0015226951,0.0003553793,0.00012651735,0.00020571651,0.0025550204,0.0005325742,0.00005056814],"category_scores_gemma":[0.00005955642,0.000634133,0.0003130848,0.00012917169,0.00013733802,0.0008547804,0.00070675014,0.00041600072,0.0011869388],"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.000006328435,0.000027030304,0.000019022596,0.0010130177,0.0001449877,0.0001410919,0.000058079037,0.00001856532,0.00004202246,0.8929613,0.10321867,0.002349879],"study_design_scores_gemma":[0.00043201225,0.00007268484,0.000004615681,0.0042511066,0.000040044994,0.00011487803,0.000018607718,0.0008686055,0.0000059279805,0.00030306666,0.99310356,0.00078486046],"about_ca_topic_score_codex":0.00022376089,"about_ca_topic_score_gemma":0.000011053396,"teacher_disagreement_score":0.89265823,"about_ca_system_score_codex":0.00015900738,"about_ca_system_score_gemma":0.00039557056,"threshold_uncertainty_score":0.999611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24772897,0.044486154,0.6673247,0.0017521422,0.00356648,0.0036159763,0.0050521363,0.0014015493,0.025071839],"genre_scores_gemma":[0.9957765,0.00056691264,0.0024562743,0.000074439035,0.000026018444,0.00021024622,0.0006346234,0.000022165828,0.0002328241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525714,0.0015025762,0.0011657984,0.00096507184,0.0007836681,0.00032573252],"domain_scores_gemma":[0.99392337,0.0004026737,0.0004688677,0.0041419687,0.0008973964,0.00016575547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004478746,0.00037763803,0.0009961454,0.00016614923,0.00013675341,0.001639077,0.0023804337,0.00021775973,0.0000047828285],"category_scores_gemma":[0.0002610978,0.00036396677,0.0000900556,0.00033195948,0.00012757794,0.00047700448,0.0033653406,0.00072044553,0.0000042145716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00012971614,0.004655146,0.25697175,0.02839676,0.002443188,0.005623985,0.0191889,0.0027673177,0.00047539422,0.31203422,0.27355775,0.093755856],"study_design_scores_gemma":[0.00094086566,0.00004738436,0.024178892,0.005745975,0.00001162432,0.0001802658,0.0004191693,0.9592784,0.00003668562,0.0003128393,0.007784653,0.0010632447],"about_ca_topic_score_codex":0.01484278,"about_ca_topic_score_gemma":0.0022035125,"teacher_disagreement_score":0.9565111,"about_ca_system_score_codex":0.00038484889,"about_ca_system_score_gemma":0.0015639049,"threshold_uncertainty_score":0.9998812},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012579203,0.0036387392,0.0593032,0.00008467843,0.0071651316,0.0007127967,0.0034403238,0.0002585957,0.9253839],"genre_scores_gemma":[0.0010646244,0.0008170187,0.0034674378,0.00006324404,0.0025353886,0.000043533913,0.0014820177,0.000109258435,0.9904175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99578726,0.00007382156,0.0013444744,0.0011338014,0.0011436287,0.0005170169],"domain_scores_gemma":[0.9946225,0.00012499897,0.0011219943,0.0031795523,0.0006512289,0.00029968764],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00087034365,0.00062776206,0.0010796177,0.00031473956,0.00010541023,0.0002904595,0.002650065,0.0004418302,0.0003096412],"category_scores_gemma":[0.000095146715,0.0005819048,0.00026019302,0.00017216963,0.0001659281,0.0012586376,0.00076757144,0.0004350426,0.001300199],"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.000004698883,0.000031845877,0.000013729345,0.00050655374,0.00010373843,0.00008123268,0.00023036003,0.0000026804473,0.000011961416,0.4170224,0.58046675,0.001524047],"study_design_scores_gemma":[0.00027204253,0.00006252908,0.000005826456,0.0012626392,0.000033105003,0.000049153474,0.000026432675,0.0007330126,0.000010080782,0.00072937505,0.9962096,0.0006061596],"about_ca_topic_score_codex":0.0001866423,"about_ca_topic_score_gemma":0.00003768878,"teacher_disagreement_score":0.41629303,"about_ca_system_score_codex":0.000084898384,"about_ca_system_score_gemma":0.00034090018,"threshold_uncertainty_score":0.99966323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27143702,0.00011652376,0.7257906,0.00016607923,0.00010911506,0.00016267823,0.0000026646055,0.00004837367,0.0021669264],"genre_scores_gemma":[0.99250656,0.00001097709,0.006958408,0.0001319836,0.000014075724,0.00003792283,0.0000082023635,0.0000028445468,0.000329031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993027,0.000016086542,0.00016053894,0.00021781331,0.00015358106,0.00014928458],"domain_scores_gemma":[0.9996376,0.0000070631,0.00003487205,0.0002757954,0.0000053927474,0.000039273764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012722741,0.0000685573,0.00008237335,0.000037319005,0.000028839073,0.00006484586,0.00031649185,0.000022222774,0.000016764623],"category_scores_gemma":[0.000005797011,0.000061546474,0.000020675274,0.00011757272,0.000012787953,0.00041832906,0.00007375905,0.000053478143,0.00020494705],"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.000016868475,0.002011766,0.018006038,0.0000844194,0.000058334826,0.00031565476,0.0027360504,0.086893715,0.05041032,0.54779464,0.0038171336,0.28785506],"study_design_scores_gemma":[0.0058691762,0.00030220643,0.026143763,0.00019073448,0.0000059515214,0.00009250784,0.00023473085,0.03978694,0.37412244,0.01881025,0.53313524,0.0013060933],"about_ca_topic_score_codex":0.00008533667,"about_ca_topic_score_gemma":0.000010324084,"teacher_disagreement_score":0.7210695,"about_ca_system_score_codex":0.00007613832,"about_ca_system_score_gemma":0.000022515378,"threshold_uncertainty_score":0.2634248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070260815,0.000029649733,0.9255688,0.00019857666,0.00034374857,0.00027768078,0.0000068638024,0.0003633594,0.002950488],"genre_scores_gemma":[0.92908716,2.4877653e-7,0.070349775,0.00030645134,0.00009812866,0.000006069982,0.000012775935,0.000008724677,0.00013066626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983011,0.000016850798,0.00034754624,0.0004160451,0.00032285097,0.0005956475],"domain_scores_gemma":[0.9989654,0.000026535192,0.00007425201,0.00053060753,0.00013041432,0.00027278016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867461,0.00015724315,0.0001873232,0.00006829297,0.00014704227,0.00030602416,0.00071736827,0.00007488848,0.000006997619],"category_scores_gemma":[0.0000245103,0.00013669781,0.000068342146,0.0010667167,0.000019625893,0.0003203956,0.00022992448,0.00009971599,0.000075633696],"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.000029554898,0.00043722457,0.022318412,0.0000722276,0.00007718155,0.0002643821,0.001254801,0.0012794335,0.011096323,0.39605963,0.0034832451,0.5636276],"study_design_scores_gemma":[0.001641358,0.00034728931,0.033741266,0.0003751596,0.000020652426,0.00029729118,0.0006086379,0.32818508,0.01953497,0.0027688649,0.610352,0.0021274362],"about_ca_topic_score_codex":0.00014547758,"about_ca_topic_score_gemma":0.000040944393,"teacher_disagreement_score":0.85882634,"about_ca_system_score_codex":0.00009854372,"about_ca_system_score_gemma":0.000036816404,"threshold_uncertainty_score":0.5574375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008852267,0.05186998,0.77663916,0.014644139,0.037634484,0.0006937273,0.00031539533,0.00011042037,0.109240435],"genre_scores_gemma":[0.968642,0.00005503615,0.0032834965,0.0005088308,0.004368901,0.000008515247,0.000017070466,0.000089191446,0.023026988],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987658,0.000015859967,0.00042451746,0.00013120464,0.00025528372,0.0004072886],"domain_scores_gemma":[0.9986665,0.000062997315,0.00021967638,0.00037968697,0.00015383404,0.0005173053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027425142,0.00020353706,0.00036311973,0.00014462382,0.000056549397,0.000262123,0.0018599416,0.00019902346,0.0001409546],"category_scores_gemma":[0.000073902826,0.00014692395,0.00017362976,0.00031178902,0.000035834793,0.0001341438,0.00003300055,0.00083889323,0.0002757864],"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.0000044226567,0.0000123006175,0.0000037455204,0.00016147248,0.00023426051,0.00058584096,0.00056473946,0.04167141,0.0049694027,0.0064821444,0.9389454,0.006364829],"study_design_scores_gemma":[0.0001384818,0.000018235629,0.0000046260916,0.00059285486,0.000013341416,0.0011400363,0.000002335206,0.009114037,0.0016793353,0.000057140216,0.9869621,0.00027747074],"about_ca_topic_score_codex":0.0009479984,"about_ca_topic_score_gemma":0.00006169609,"teacher_disagreement_score":0.9597897,"about_ca_system_score_codex":0.00029935772,"about_ca_system_score_gemma":0.000962724,"threshold_uncertainty_score":0.59913844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070260815,0.000029649733,0.9255688,0.00019857666,0.00034374857,0.00027768078,0.0000068638024,0.0003633594,0.002950488],"genre_scores_gemma":[0.92908716,2.4877653e-7,0.070349775,0.00030645134,0.00009812866,0.000006069982,0.000012775935,0.000008724677,0.00013066626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983011,0.000016850798,0.00034754624,0.0004160451,0.00032285097,0.0005956475],"domain_scores_gemma":[0.9989654,0.000026535192,0.00007425201,0.00053060753,0.00013041432,0.00027278016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867461,0.00015724315,0.0001873232,0.00006829297,0.00014704227,0.00030602416,0.00071736827,0.00007488848,0.000006997619],"category_scores_gemma":[0.0000245103,0.00013669781,0.000068342146,0.0010667167,0.000019625893,0.0003203956,0.00022992448,0.00009971599,0.000075633696],"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.000029554898,0.00043722457,0.022318412,0.0000722276,0.00007718155,0.0002643821,0.001254801,0.0012794335,0.011096323,0.39605963,0.0034832451,0.5636276],"study_design_scores_gemma":[0.001641358,0.00034728931,0.033741266,0.0003751596,0.000020652426,0.00029729118,0.0006086379,0.32818508,0.01953497,0.0027688649,0.610352,0.0021274362],"about_ca_topic_score_codex":0.00014547758,"about_ca_topic_score_gemma":0.000040944393,"teacher_disagreement_score":0.85882634,"about_ca_system_score_codex":0.00009854372,"about_ca_system_score_gemma":0.000036816404,"threshold_uncertainty_score":0.5574375},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044558155,0.021250326,0.06088087,0.00007787967,0.0075827707,0.001302736,0.0032493426,0.00035281273,0.9052988],"genre_scores_gemma":[0.0036157991,0.0034769005,0.0013386937,0.000054088567,0.0020320849,0.00009161972,0.0013344086,0.00012482694,0.98793155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946423,0.00011808704,0.0018838501,0.0012710178,0.0014060593,0.0006786838],"domain_scores_gemma":[0.99412227,0.0001605688,0.0015352357,0.0034014795,0.0004212741,0.00035918006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008982129,0.00084424973,0.0016439479,0.00038265044,0.00013451022,0.00027235024,0.002547043,0.0005624579,0.00002660818],"category_scores_gemma":[0.000049134145,0.0007885519,0.00032791076,0.00018451325,0.00009713449,0.000789939,0.00045541397,0.00060232356,0.0005762365],"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.000007735244,0.00005808862,0.000012413452,0.0010784424,0.00014112124,0.00025219057,0.000100675534,0.00018159454,0.000024514342,0.8361247,0.15546471,0.006553818],"study_design_scores_gemma":[0.00036212002,0.000116685194,0.000009793093,0.0027377123,0.000049331735,0.00014277142,0.000025873318,0.0032635387,0.0000038979374,0.00026064925,0.99221015,0.0008174533],"about_ca_topic_score_codex":0.00042756845,"about_ca_topic_score_gemma":0.000014948931,"teacher_disagreement_score":0.83674544,"about_ca_system_score_codex":0.00014742673,"about_ca_system_score_gemma":0.0003769005,"threshold_uncertainty_score":0.9994565},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008423338,0.00051037734,0.057191767,0.000058579706,0.001718745,0.00027683974,0.00021293614,0.0004056546,0.9396167],"genre_scores_gemma":[0.48019844,0.000011759512,0.004393824,0.0012219306,0.00084939,0.00004828356,0.000013710982,0.00008833294,0.5131743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785566,0.000016050804,0.00051687006,0.0008142213,0.0003361295,0.00046106684],"domain_scores_gemma":[0.9980954,0.000012866306,0.00031965325,0.0012194923,0.000115074705,0.0002375027],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001313446,0.0004975428,0.0005880148,0.0000511565,0.00008757412,0.0002344615,0.001831354,0.00046180992,0.000039956685],"category_scores_gemma":[0.0000046561363,0.00048536508,0.00030449164,0.00001967333,0.00008121075,0.00012518498,0.0004595824,0.00028785362,0.0016770274],"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.000004528552,0.000005737619,0.0000028763368,0.000019949804,0.000054944743,0.00010540097,0.0000764396,0.0000017022668,0.0000020851146,0.97424614,0.0073758666,0.018104296],"study_design_scores_gemma":[0.0002675195,0.00006445729,0.00004512229,0.00020195755,0.000022001,0.00011385233,0.000001582298,0.00021088033,0.000018978722,0.52657497,0.47183642,0.00064226333],"about_ca_topic_score_codex":0.00014224452,"about_ca_topic_score_gemma":0.000022690816,"teacher_disagreement_score":0.48019004,"about_ca_system_score_codex":0.00028196117,"about_ca_system_score_gemma":0.00032497628,"threshold_uncertainty_score":0.9997598},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006419653,0.000067440094,0.9883115,0.00083144364,0.0011511229,0.00067184493,0.00005022417,0.0010254678,0.0014712886],"genre_scores_gemma":[0.19007212,0.0000013874312,0.8059688,0.0026604005,0.0008683978,0.000048951544,0.00010424906,0.000040836276,0.0002348603],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99596626,0.00021067615,0.0006327068,0.0012956259,0.0008982536,0.0009964713],"domain_scores_gemma":[0.9963726,0.0003063291,0.000113416885,0.0021774804,0.00026378073,0.0007663977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088154443,0.0004944768,0.00050460093,0.00045756102,0.00031032838,0.00043178827,0.003931089,0.00019163817,0.000023353188],"category_scores_gemma":[0.00006488785,0.00042397546,0.00021377587,0.0013787856,0.00008153918,0.00048883626,0.0003703035,0.00074529974,0.000076487886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009071776,0.00038054018,0.0002612565,0.000049017093,0.00006230013,0.00005067319,0.0037056014,0.05407462,0.00089175353,0.0013334095,0.0060567046,0.9330434],"study_design_scores_gemma":[0.0036609252,0.0020203001,0.028559778,0.0002603228,0.000039166767,0.0011754731,0.0003017117,0.104539715,0.010029712,0.006252347,0.83984995,0.0033106122],"about_ca_topic_score_codex":0.0002530822,"about_ca_topic_score_gemma":0.00010633027,"teacher_disagreement_score":0.9297328,"about_ca_system_score_codex":0.00012431761,"about_ca_system_score_gemma":0.00019133286,"threshold_uncertainty_score":0.9998212},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048611555,0.0047363723,0.08358793,0.00010244539,0.001758557,0.00077934103,0.0013451495,0.000265488,0.90741986],"genre_scores_gemma":[0.0027171741,0.001972313,0.005065427,0.000078943965,0.001153656,0.000076093056,0.0019200629,0.00007505548,0.9869413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667656,0.00004756893,0.0011709108,0.0011120742,0.0006735012,0.000319401],"domain_scores_gemma":[0.99420285,0.000078100995,0.0011054804,0.004173657,0.000263148,0.00017673506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064526737,0.00044889253,0.0008092936,0.00020839319,0.0000786161,0.000101387945,0.001627917,0.0003175608,0.000024842624],"category_scores_gemma":[0.00005327795,0.00043692504,0.00018481445,0.00010864393,0.00005302726,0.00052158977,0.00024861257,0.000331946,0.00031804695],"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.00000470012,0.000045229852,0.00000721898,0.0003671536,0.000061671904,0.000064091735,0.00010306963,0.00004234908,0.000043828397,0.86261994,0.07773116,0.05890957],"study_design_scores_gemma":[0.00019030686,0.00006826161,0.000024770185,0.0007779376,0.00002489778,0.000058735233,0.0000045249303,0.0018934341,0.000014186049,0.0007679496,0.99572843,0.00044658294],"about_ca_topic_score_codex":0.00013369211,"about_ca_topic_score_gemma":0.000007909929,"teacher_disagreement_score":0.91799724,"about_ca_system_score_codex":0.00011013583,"about_ca_system_score_gemma":0.0002712407,"threshold_uncertainty_score":0.99980825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010965181,0.00032949453,0.9830947,0.0021551035,0.00055429334,0.0016379015,0.00017401848,0.0003871514,0.0007021456],"genre_scores_gemma":[0.92215925,0.0005819094,0.07072188,0.0007216884,0.00021130343,0.00080920855,0.0007467926,0.00006663544,0.0039813314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967687,0.0004546762,0.0009205161,0.00080383074,0.00051668024,0.00053560414],"domain_scores_gemma":[0.9964606,0.0011278858,0.0004209789,0.0008264728,0.0009839757,0.00018007406],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001252912,0.0004115025,0.00041928585,0.00020912652,0.00055794616,0.0009815522,0.0007933857,0.00013372785,0.0005365133],"category_scores_gemma":[0.00037690037,0.00034759435,0.00008897173,0.0006326013,0.00017105052,0.0019429447,0.00009683716,0.0003082765,0.0013768983],"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.0005172548,0.0023255162,0.001337121,0.0017246179,0.00034828472,0.00003077126,0.013061866,0.063250676,0.15778555,0.07330975,0.22048777,0.46582082],"study_design_scores_gemma":[0.0029051648,0.00014582874,0.046620514,0.00079552585,0.000050565708,0.0002513013,0.00009521406,0.3525571,0.0013189961,0.0033036636,0.5904194,0.0015367385],"about_ca_topic_score_codex":0.00025846134,"about_ca_topic_score_gemma":0.00013058174,"teacher_disagreement_score":0.9123728,"about_ca_system_score_codex":0.00006976092,"about_ca_system_score_gemma":0.00022759303,"threshold_uncertainty_score":0.9998976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17428963,0.0001854769,0.8122897,0.0010384636,0.00044684974,0.00012122612,0.000049231934,0.00014289541,0.011436492],"genre_scores_gemma":[0.94512564,0.00006839807,0.04836647,0.0017462422,0.00008785203,0.000007658124,0.000045982884,0.000005301134,0.00454643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930155,0.000025243713,0.0001767954,0.00021600582,0.000121688965,0.00015869866],"domain_scores_gemma":[0.9994871,0.000036491456,0.000027115782,0.0003873181,0.000022362867,0.00003958466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000910271,0.00006493653,0.000104582374,0.00005017368,0.00003417423,0.000020407442,0.00034325715,0.000018834648,0.00002144819],"category_scores_gemma":[0.0000198947,0.000053172636,0.000024979961,0.00026122158,0.000015192194,0.000519442,0.00012098773,0.00005966186,0.00008480198],"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.000069484646,0.0034212535,0.08858759,0.00011309072,0.00005257327,0.0016262588,0.0016753628,0.0050306874,0.0008342964,0.1359828,0.60644394,0.15616265],"study_design_scores_gemma":[0.0024502003,0.00014286689,0.19109765,0.00016774544,0.0000021395183,0.0005449928,0.00009264215,0.24424495,0.0007533844,0.0006389905,0.559003,0.0008614601],"about_ca_topic_score_codex":0.00026864948,"about_ca_topic_score_gemma":0.00028015944,"teacher_disagreement_score":0.77083606,"about_ca_system_score_codex":0.00001772063,"about_ca_system_score_gemma":0.00003539669,"threshold_uncertainty_score":0.21683173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012900349,0.0007016331,0.9382669,0.00092803733,0.00035246176,0.0001898964,0.000011766933,0.00052346935,0.046125498],"genre_scores_gemma":[0.9760993,0.000012871484,0.014103262,0.0009263766,0.00006235421,0.000028667686,0.0000031330621,0.00000964742,0.008754395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985541,0.000028418297,0.00029863685,0.0005180459,0.00025510316,0.00034570045],"domain_scores_gemma":[0.9988341,0.000026606183,0.00012845742,0.00083929155,0.000059818187,0.000111749774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001668138,0.00013610696,0.00015500578,0.000024782155,0.00016461688,0.0002393098,0.0008979468,0.000054459353,0.00009006567],"category_scores_gemma":[0.000033792763,0.00012187978,0.000054719472,0.00032319303,0.00001908917,0.00051570626,0.0001425643,0.00010855732,0.00036146815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001433496,0.0002092905,0.0010153984,0.000056312074,0.000019978219,0.000025299796,0.000756831,0.00020162771,0.016083175,0.019342074,0.43010032,0.53218824],"study_design_scores_gemma":[0.00028635014,0.000022681474,0.00018817862,0.000022889486,0.0000013563445,0.000018409604,0.00001935325,0.86331004,0.0022944976,0.000056791232,0.13353151,0.00024793396],"about_ca_topic_score_codex":0.00010928742,"about_ca_topic_score_gemma":0.000002336496,"teacher_disagreement_score":0.96319896,"about_ca_system_score_codex":0.000030895924,"about_ca_system_score_gemma":0.000005604938,"threshold_uncertainty_score":0.4970113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008573662,0.00015379039,0.9795479,0.00020914308,0.0006607533,0.00042451697,0.000014106442,0.00032345965,0.010092634],"genre_scores_gemma":[0.8805871,0.0000011528052,0.11601143,0.00038363854,0.00013806582,0.0000296535,0.000010019167,0.000016035334,0.0028228776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979788,0.000023066837,0.00047834573,0.0005673005,0.00028324386,0.0006692073],"domain_scores_gemma":[0.9986597,0.00028493034,0.00017401692,0.0005730581,0.00014851712,0.00015978988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001394967,0.00020443057,0.0002673741,0.00010661711,0.00024550152,0.00027175085,0.00079250324,0.00009643515,0.000015865397],"category_scores_gemma":[0.00021667003,0.00017829203,0.00013936304,0.00040419662,0.00003666829,0.0004544927,0.00013805366,0.00011776496,0.000033399378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003105526,0.0009803867,0.0010760282,0.001326851,0.00013962427,0.00028660113,0.0015895566,0.001855184,0.06805922,0.31094688,0.01970205,0.59372705],"study_design_scores_gemma":[0.0017931269,0.00022230428,0.0004503818,0.000087586566,0.000012482907,0.000046543486,0.00018514266,0.9767957,0.0032896155,0.0013080909,0.015174368,0.0006347026],"about_ca_topic_score_codex":0.000048767477,"about_ca_topic_score_gemma":0.000022218772,"teacher_disagreement_score":0.9749405,"about_ca_system_score_codex":0.0000804321,"about_ca_system_score_gemma":0.00010061731,"threshold_uncertainty_score":0.72705376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24772897,0.044486154,0.6673247,0.0017521422,0.00356648,0.0036159763,0.0050521363,0.0014015493,0.025071839],"genre_scores_gemma":[0.9957765,0.00056691264,0.0024562743,0.000074439035,0.000026018444,0.00021024622,0.0006346234,0.000022165828,0.0002328241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525714,0.0015025762,0.0011657984,0.00096507184,0.0007836681,0.00032573252],"domain_scores_gemma":[0.99392337,0.0004026737,0.0004688677,0.0041419687,0.0008973964,0.00016575547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004478746,0.00037763803,0.0009961454,0.00016614923,0.00013675341,0.001639077,0.0023804337,0.00021775973,0.0000047828285],"category_scores_gemma":[0.0002610978,0.00036396677,0.0000900556,0.00033195948,0.00012757794,0.00047700448,0.0033653406,0.00072044553,0.0000042145716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00012971614,0.004655146,0.25697175,0.02839676,0.002443188,0.005623985,0.0191889,0.0027673177,0.00047539422,0.31203422,0.27355775,0.093755856],"study_design_scores_gemma":[0.00094086566,0.00004738436,0.024178892,0.005745975,0.00001162432,0.0001802658,0.0004191693,0.9592784,0.00003668562,0.0003128393,0.007784653,0.0010632447],"about_ca_topic_score_codex":0.01484278,"about_ca_topic_score_gemma":0.0022035125,"teacher_disagreement_score":0.9565111,"about_ca_system_score_codex":0.00038484889,"about_ca_system_score_gemma":0.0015639049,"threshold_uncertainty_score":0.9998812},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064775254,0.003752396,0.10844967,0.000106404856,0.0020572343,0.000753192,0.0013413092,0.00021226302,0.88332105],"genre_scores_gemma":[0.005487257,0.0027347067,0.0044344123,0.00009787592,0.002394422,0.000109955356,0.0026523175,0.00009136946,0.98199767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967715,0.00005228233,0.001099505,0.0010403317,0.00072942226,0.00030696165],"domain_scores_gemma":[0.99477893,0.00007108255,0.0009801686,0.0037624761,0.00023581227,0.00017150988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064435083,0.00040326224,0.00073154,0.00015959422,0.00007357985,0.000091404516,0.0013908524,0.00028856084,0.000026282873],"category_scores_gemma":[0.00005894455,0.0003866778,0.00017367056,0.00009933395,0.00005189841,0.0004978275,0.00022160655,0.00029951983,0.00028574368],"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.000007105594,0.000044260592,0.000010181096,0.00031288646,0.000057240228,0.0000558691,0.00008978748,0.000033912314,0.00005537715,0.87131506,0.088156015,0.03986231],"study_design_scores_gemma":[0.00019867432,0.000064428794,0.000016696398,0.00073695317,0.000025070078,0.00003804001,0.0000039465936,0.0018346215,0.000027394066,0.00054560736,0.9961116,0.00039702049],"about_ca_topic_score_codex":0.000105556624,"about_ca_topic_score_gemma":0.0000059044396,"teacher_disagreement_score":0.9079555,"about_ca_system_score_codex":0.00006735062,"about_ca_system_score_gemma":0.00019547994,"threshold_uncertainty_score":0.9998585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014912699,0.0005587992,0.97644854,0.000021701928,0.0023243465,0.0003297311,0.00008409116,0.00016515248,0.0051549324],"genre_scores_gemma":[0.9343027,0.00019959777,0.034851737,0.000054013635,0.00058747677,0.00007930759,0.0011226826,0.000062146406,0.028740326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.000047943286,0.0003216571,0.00061217666,0.00033621312,0.00030708962],"domain_scores_gemma":[0.9986089,0.000013710586,0.00041114967,0.0006736233,0.00017626912,0.00011633099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021038423,0.0002711905,0.00030850226,0.00009714529,0.00058720884,0.0006913187,0.0005737846,0.00031896972,0.00000573904],"category_scores_gemma":[0.00003426008,0.00026270555,0.000084739746,0.00013273054,0.000022176891,0.00060066296,0.00006548702,0.00021699759,0.000014439914],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001539666,0.00004411132,0.000039448278,0.00015289878,0.00006734236,0.000038363047,0.00025905806,0.00003535001,0.0011351907,0.0011766128,0.000928973,0.9961073],"study_design_scores_gemma":[0.0006030495,0.00007053766,0.010860032,0.00044004247,0.000053822063,0.000087887674,0.00016836637,0.9559274,0.0021005222,0.0007625217,0.028189229,0.0007365996],"about_ca_topic_score_codex":0.0007656942,"about_ca_topic_score_gemma":0.00038587372,"teacher_disagreement_score":0.9953706,"about_ca_system_score_codex":0.00011899692,"about_ca_system_score_gemma":0.00008517737,"threshold_uncertainty_score":0.99998254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00523771,0.000084083105,0.8784321,0.000085383675,0.00034624664,0.00008213918,0.000002838493,0.00005076388,0.11567875],"genre_scores_gemma":[0.9746743,0.000002328428,0.024505766,0.0000621633,0.00000906198,0.0000051817888,9.701025e-7,0.0000020279138,0.0007381974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992942,0.00004071619,0.00020821702,0.00016436068,0.00015808917,0.00013436587],"domain_scores_gemma":[0.999501,0.00001776306,0.000065014305,0.0002691437,0.000103316146,0.000043789263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019210171,0.000059274607,0.00012067878,0.000029687208,0.000033446086,0.00004155222,0.00022671798,0.0000353454,0.000049404727],"category_scores_gemma":[0.00003345018,0.000050409115,0.000050528728,0.00022792451,0.000022560915,0.00021180863,0.000026534359,0.000032158085,0.000041084062],"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.0000013292614,0.00005506419,0.00032068224,0.000019776537,0.0000094756615,0.0000060907805,0.00012321326,0.00006456355,0.0025355702,0.99229324,0.001405604,0.003165384],"study_design_scores_gemma":[0.0064734565,0.0008207201,0.009706725,0.00036295023,0.000053542743,0.0005890916,0.00077202346,0.09390522,0.36429647,0.06693891,0.45404154,0.0020393447],"about_ca_topic_score_codex":0.000063692234,"about_ca_topic_score_gemma":0.000007071868,"teacher_disagreement_score":0.9694366,"about_ca_system_score_codex":0.000015150537,"about_ca_system_score_gemma":0.00007642227,"threshold_uncertainty_score":0.20556241},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.459967e-8,0.00021450779,0.2748326,0.0014480058,0.00015844467,0.000089861045,0.000020679772,0.00025981947,0.72297597],"genre_scores_gemma":[0.002050879,0.000012348506,0.003356327,0.002497538,0.0003907393,0.0000047160925,0.00007188075,0.000023987275,0.9915916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988255,0.000008227155,0.00024521514,0.00047767363,0.00030573126,0.00013767785],"domain_scores_gemma":[0.9991092,0.000019243402,0.00012439405,0.0005788089,0.000051471525,0.00011685578],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007127279,0.00020421132,0.00025410025,0.000040866787,0.00005554963,0.00016219485,0.0007720323,0.00019076944,0.00021050272],"category_scores_gemma":[0.000002841797,0.00018553104,0.0001213496,0.00003557747,0.00002044252,0.0001359349,0.00021953724,0.00019083782,0.0017865266],"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.0000010718599,0.0000018797884,1.5835671e-7,0.000013375404,0.000011292429,0.00003664133,0.000021229103,0.000002773022,0.0000059354197,0.8747862,0.11637913,0.008740335],"study_design_scores_gemma":[0.00008118659,0.000030567426,0.0000034516795,0.000073250274,0.0000041611497,0.000014503738,0.0000013295113,0.001882556,0.000014604851,0.016538259,0.98113,0.00022613545],"about_ca_topic_score_codex":0.0000028158995,"about_ca_topic_score_gemma":8.281698e-7,"teacher_disagreement_score":0.86475086,"about_ca_system_score_codex":0.00003401428,"about_ca_system_score_gemma":0.000036670586,"threshold_uncertainty_score":0.9989907},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005078699,0.010744775,0.45461097,0.00017815539,0.0048023574,0.00462653,0.0130205015,0.00033791093,0.5111709],"genre_scores_gemma":[0.01449909,0.0042072823,0.034833714,0.0001607771,0.004388943,0.0010747632,0.004176199,0.00022649133,0.9364327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967915,0.000044175766,0.0010569998,0.0013615191,0.00045019452,0.00029565682],"domain_scores_gemma":[0.9947729,0.00021082001,0.000909882,0.0033969448,0.0005503741,0.00015908867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010902808,0.00040363436,0.0007789037,0.00010644268,0.000115768235,0.00009847338,0.0009893618,0.00028674252,0.000024054072],"category_scores_gemma":[0.00017859077,0.00038147,0.00013003184,0.00007228869,0.00016375842,0.00049922924,0.00029172242,0.00018089499,0.000065932174],"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.000070863796,0.000112870715,0.00015204643,0.005697388,0.00018716705,0.000013884865,0.0008028094,0.000025362115,0.00025944953,0.6374093,0.33400652,0.021262333],"study_design_scores_gemma":[0.00035964794,0.00010996351,0.000032881835,0.00084474386,0.000028546745,0.000022860982,0.00001210334,0.005730353,0.000037448393,0.0010872624,0.9913165,0.00041766404],"about_ca_topic_score_codex":0.00008837582,"about_ca_topic_score_gemma":0.000019645297,"teacher_disagreement_score":0.65731,"about_ca_system_score_codex":0.00005910383,"about_ca_system_score_gemma":0.00015169072,"threshold_uncertainty_score":0.99986374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061689977,0.000034847944,0.92863667,0.0010350618,0.0027733773,0.00043100727,0.0000542498,0.00018065171,0.005164182],"genre_scores_gemma":[0.91091865,0.0000019250194,0.08789027,0.00017926464,0.000143987,0.000055498665,0.000039523235,0.0000063310204,0.0007645747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904627,0.0000125953975,0.00021052768,0.00029958496,0.00021129893,0.0002197234],"domain_scores_gemma":[0.99919784,0.000101435915,0.000093003924,0.00046158975,0.00007726758,0.00006883699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032263526,0.000104156956,0.00012181006,0.000053552838,0.00014528705,0.00016883966,0.00079053646,0.00005938813,0.000042964013],"category_scores_gemma":[0.000028666534,0.00009661215,0.00007511684,0.00009911389,0.000023772878,0.00046759134,0.000046059955,0.00011032368,0.00005596018],"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.00022938444,0.0006680642,0.0019865532,0.0009843914,0.0005003483,0.00012248519,0.0017052799,0.0034975817,0.032291844,0.51466733,0.008627482,0.43471923],"study_design_scores_gemma":[0.009174037,0.00088836474,0.040150616,0.00028553823,0.0002422031,0.00016862844,0.0013966216,0.3664845,0.016007865,0.015580069,0.5472813,0.0023402541],"about_ca_topic_score_codex":0.000014461595,"about_ca_topic_score_gemma":0.000038158676,"teacher_disagreement_score":0.8492287,"about_ca_system_score_codex":0.000009275853,"about_ca_system_score_gemma":0.0000198741,"threshold_uncertainty_score":0.3939729},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027485514,0.0040904502,0.09138247,0.00018877386,0.005710857,0.00063114293,0.004719263,0.00023193346,0.8930423],"genre_scores_gemma":[0.001240791,0.0011556813,0.0014204395,0.000045598725,0.0014916207,0.000044116765,0.0005421925,0.000091657515,0.9939679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958804,0.00007376657,0.0013232429,0.0010875957,0.0011091012,0.00052584516],"domain_scores_gemma":[0.9949057,0.00018608323,0.0011091729,0.0030220933,0.0004723614,0.0003045791],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007613804,0.00061956083,0.001078218,0.00030887706,0.00008798668,0.00021392094,0.002495003,0.0004159683,0.00013835315],"category_scores_gemma":[0.000091929,0.00048772586,0.00027378043,0.00012238989,0.00011600102,0.0013872316,0.00068990316,0.0003708316,0.0009288044],"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.0000038312915,0.000021343589,0.000014807874,0.00037881715,0.000084356514,0.00008488005,0.00006828588,0.0000013889123,0.00002384125,0.79368144,0.20009579,0.0055412026],"study_design_scores_gemma":[0.0003535848,0.00003658945,0.000005885534,0.0019331768,0.000026226893,0.00004495265,0.0000096246295,0.00017455718,0.000009619176,0.0010355912,0.9957675,0.00060273666],"about_ca_topic_score_codex":0.000086657084,"about_ca_topic_score_gemma":0.000017819351,"teacher_disagreement_score":0.7956717,"about_ca_system_score_codex":0.0000986934,"about_ca_system_score_gemma":0.00033844015,"threshold_uncertainty_score":0.9998491},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032866422,0.00415086,0.30944422,0.056129795,0.024164004,0.0035705115,0.0033344256,0.0029159763,0.5634238],"genre_scores_gemma":[0.55924535,0.00016905711,0.13862665,0.011586474,0.00072428194,0.00072258594,0.00037302964,0.00015398841,0.28839862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963657,0.00025416547,0.0006901223,0.0013908595,0.00070882245,0.000590314],"domain_scores_gemma":[0.9966334,0.00017802283,0.00039271783,0.002356838,0.00023836237,0.0002006755],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066437665,0.0004631986,0.00067528157,0.00012992225,0.00029407354,0.00068815367,0.0021510776,0.00030031244,0.0025844474],"category_scores_gemma":[0.000056100598,0.0004496126,0.0003188319,0.00022028427,0.000074458316,0.00006504641,0.0030993542,0.0009694142,0.0003388892],"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.000013826948,0.00010036224,0.0005590229,0.0001830998,0.00017505606,0.00017234684,0.0014221672,0.00075754715,0.000045486944,0.016775364,0.9763614,0.0034343104],"study_design_scores_gemma":[0.0006226815,0.00006312185,0.00033395464,0.00013911877,0.0000205108,0.00010898749,0.0001957883,0.06059481,0.0002215929,0.035255842,0.9014072,0.001036418],"about_ca_topic_score_codex":0.0017481132,"about_ca_topic_score_gemma":0.000055956858,"teacher_disagreement_score":0.52637887,"about_ca_system_score_codex":0.00018600539,"about_ca_system_score_gemma":0.0005788581,"threshold_uncertainty_score":0.99979556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02421271,0.000078517,0.9536161,0.008746656,0.002747063,0.0020090244,0.0033478304,0.00011336655,0.0051287455],"genre_scores_gemma":[0.9953728,0.000025070247,0.00350166,0.00003480684,0.000028957453,0.00013737568,0.00041139487,0.000006511799,0.00048142322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983574,0.000012980611,0.00037355212,0.0003990243,0.00073044543,0.00012655572],"domain_scores_gemma":[0.9988031,0.000021529753,0.00047989268,0.00032196354,0.00035424464,0.000019269186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005920526,0.00010539723,0.00013985655,0.00009526395,0.00017709004,0.00011220959,0.0031896126,0.00002100517,0.00003335876],"category_scores_gemma":[0.000028522227,0.00009544691,0.000059243375,0.00037884386,0.000026498792,0.0008354929,0.00091993576,0.00011230375,5.5758926e-7],"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.000102673264,0.0002056395,0.0002658563,0.00020665325,0.00015273411,3.4841597e-7,0.00008062709,0.0003239882,0.0037905027,0.97326285,0.0037279825,0.017880166],"study_design_scores_gemma":[0.0049717207,0.000781646,0.010622644,0.0016226812,0.00023159412,0.00001262441,0.0054287515,0.8504345,0.012912813,0.07250894,0.039624047,0.00084802683],"about_ca_topic_score_codex":0.00001104189,"about_ca_topic_score_gemma":6.44126e-7,"teacher_disagreement_score":0.9711601,"about_ca_system_score_codex":0.00009324665,"about_ca_system_score_gemma":0.00002298212,"threshold_uncertainty_score":0.59271467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21662465,0.00009682531,0.66183,0.003099296,0.0044647334,0.07621,0.00009220715,0.0019823415,0.035599925],"genre_scores_gemma":[0.9626169,0.0000018048171,0.0078015015,0.00026807396,0.00008048032,0.027625082,0.00015690051,0.000021838703,0.0014274139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979027,0.00015903832,0.00043186927,0.00074991444,0.00047380343,0.00028265885],"domain_scores_gemma":[0.99893034,0.000021341246,0.00020125233,0.00075239106,0.000045603952,0.000049086997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040919954,0.0002251194,0.0002872414,0.00018332206,0.00013708275,0.0004161406,0.00077459257,0.00018340611,0.00008772157],"category_scores_gemma":[0.000015751892,0.00021838551,0.00011220922,0.000534433,0.000012928773,0.00020951426,0.0004746052,0.0007606891,0.00002743491],"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.00014595811,0.0010947863,0.037411742,0.00054991874,0.00006518638,0.00008203601,0.0016090481,0.6151502,0.00011617516,0.27554157,0.013062481,0.055170886],"study_design_scores_gemma":[0.0011362748,0.0004801604,0.17456032,0.00048881274,0.000005157012,0.000016931359,0.000057347763,0.75998706,0.00017833608,0.010168321,0.0517616,0.001159663],"about_ca_topic_score_codex":0.0011736462,"about_ca_topic_score_gemma":0.0000969552,"teacher_disagreement_score":0.74599224,"about_ca_system_score_codex":0.00023647869,"about_ca_system_score_gemma":0.00010064234,"threshold_uncertainty_score":0.89055026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58685094,0.00026423577,0.3958339,0.00044383446,0.0017821188,0.0012177562,0.00037877276,0.00044499617,0.012783423],"genre_scores_gemma":[0.9972629,0.00002653114,0.0003909675,0.00009857448,0.000069544556,0.000010377502,0.00015481783,0.000032312695,0.001953957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631697,0.00033397038,0.0004822605,0.0018777591,0.00030461408,0.00068441883],"domain_scores_gemma":[0.9966956,0.00017683458,0.0007645907,0.0021010037,0.00009631312,0.00016570685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005339815,0.00050043646,0.0006684888,0.00039289886,0.00026081633,0.000400961,0.002606087,0.00019168487,0.000034897563],"category_scores_gemma":[0.000023136285,0.0005276864,0.00017847329,0.0009268265,0.00008464897,0.00038277844,0.0019918552,0.0008962704,0.000023430865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00019660314,0.0001846423,0.015456408,0.00025846972,0.00024011932,0.0029761647,0.00078496314,0.6970302,0.000024339019,0.2793413,0.003248117,0.0002586694],"study_design_scores_gemma":[0.0050059003,0.00042974163,0.0063796137,0.0025298907,0.00013746449,0.000028793644,0.003334996,0.89174277,0.000031230735,0.003827908,0.083922744,0.0026289432],"about_ca_topic_score_codex":0.008266477,"about_ca_topic_score_gemma":0.0007827996,"teacher_disagreement_score":0.41041195,"about_ca_system_score_codex":0.00035492165,"about_ca_system_score_gemma":0.00019314546,"threshold_uncertainty_score":0.9997175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003930589,0.00017242476,0.9187239,0.001875453,0.001350144,0.00019554517,0.000043739783,0.00040292373,0.073305316],"genre_scores_gemma":[0.97330225,0.000002344965,0.0025864653,0.0010100927,0.00004437056,0.00006314333,0.00001017331,0.0000062739473,0.022974877],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989454,0.000057392117,0.00016521366,0.00030540602,0.00029212984,0.00023447102],"domain_scores_gemma":[0.9993184,0.000023062088,0.000049559647,0.00050909497,0.000036123427,0.00006372991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022011924,0.00008262271,0.00011809534,0.000036660473,0.00030621485,0.00012683544,0.00084465987,0.000017419545,0.0007105848],"category_scores_gemma":[0.000005364843,0.00007779796,0.000057038964,0.00041433322,0.000007055737,0.00026823874,0.0004080419,0.00012841064,0.0001790007],"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.000011797535,0.0002697232,0.0009968014,0.000026940506,0.000038647966,0.00015192632,0.0007684068,0.006561619,0.0002739384,0.25988817,0.6822841,0.04872793],"study_design_scores_gemma":[0.00032223022,0.00008429121,0.00028244423,0.0000045643274,0.0000012559824,0.000075254495,0.00013809757,0.11833964,0.00013220459,0.0018908601,0.87852496,0.00020420049],"about_ca_topic_score_codex":0.00015173334,"about_ca_topic_score_gemma":0.000009033677,"teacher_disagreement_score":0.9693717,"about_ca_system_score_codex":0.000071886876,"about_ca_system_score_gemma":0.00006213832,"threshold_uncertainty_score":0.7780405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11059281,0.0027857563,0.85998785,0.0015509721,0.0014760741,0.0006288791,0.0011713363,0.00016947501,0.02163686],"genre_scores_gemma":[0.99570054,0.0000049150817,0.0036680172,0.00020125783,0.000017191847,0.000008897827,0.00004419615,0.000003564113,0.00035141443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986465,0.00012459757,0.0002741353,0.00036347384,0.00040534866,0.00018597247],"domain_scores_gemma":[0.99890476,0.000025148343,0.0000830174,0.0009211979,0.0000327845,0.000033079144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009173767,0.00008249326,0.00015785208,0.00006702253,0.0000935249,0.000050482595,0.0018340179,0.000016895516,0.00014061909],"category_scores_gemma":[0.000023808185,0.000073442105,0.00004331218,0.00036405333,0.000024689261,0.00025712757,0.001414187,0.00011912462,0.0000015045489],"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.00005714112,0.00028882676,0.0016734796,0.00009897037,0.000107658656,0.00005349632,0.007697534,0.014731817,0.0018508254,0.8573117,0.0070011355,0.10912739],"study_design_scores_gemma":[0.0031615307,0.00071433454,0.015682448,0.00010748486,0.000027179583,0.00013953948,0.015281531,0.66340554,0.00080065103,0.019819869,0.2798119,0.0010479713],"about_ca_topic_score_codex":0.00032966916,"about_ca_topic_score_gemma":0.000018702509,"teacher_disagreement_score":0.88510776,"about_ca_system_score_codex":0.000052273197,"about_ca_system_score_gemma":0.00011189896,"threshold_uncertainty_score":0.34080923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25435954,0.0017021348,0.60214674,0.03482275,0.0047929804,0.00064078334,0.0006359726,0.00041893605,0.100480154],"genre_scores_gemma":[0.99445707,0.0000013694605,0.0043750578,0.00012758847,0.000017916316,0.000008831386,0.0000036307881,0.000001977073,0.0010065815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991986,0.000101724654,0.00016377207,0.00015476662,0.00025378814,0.00012731475],"domain_scores_gemma":[0.9991787,0.00016460638,0.00008715295,0.00049685966,0.000041752974,0.000030946725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024610496,0.000051817075,0.00010071294,0.0000096086715,0.000318805,0.00004703512,0.00077541725,0.0000091062875,0.00006845411],"category_scores_gemma":[0.000014050701,0.000035698107,0.000041964806,0.0001924684,0.000099370955,0.000027133708,0.00037304053,0.00008205735,0.000013235738],"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.000007574135,0.000041120038,0.00059650023,0.0000021252688,0.00001852463,0.00000728388,0.0002833528,0.00022187746,0.00050098496,0.93992645,0.054854233,0.0035399562],"study_design_scores_gemma":[0.0007562236,0.000118091324,0.020358825,0.000007909978,0.000004823529,0.000024278785,0.00121757,0.19409876,0.0015517678,0.05326651,0.72832584,0.0002694303],"about_ca_topic_score_codex":0.001088686,"about_ca_topic_score_gemma":0.00007456055,"teacher_disagreement_score":0.88666,"about_ca_system_score_codex":0.000018878482,"about_ca_system_score_gemma":0.00004042038,"threshold_uncertainty_score":0.24520224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35574642,0.0034303633,0.6373817,0.00003958386,0.002163439,0.00043785622,0.000012206284,0.00015356783,0.0006349035],"genre_scores_gemma":[0.99693865,0.0013297141,0.00013258198,0.000007242637,0.00010507517,0.000006133606,0.000043702916,0.000021643073,0.0014152828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974443,0.00014794807,0.00034117867,0.0014646312,0.00015301724,0.0004489259],"domain_scores_gemma":[0.9977597,0.00006418992,0.0003479053,0.0013669555,0.00028307585,0.00017820287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040697303,0.0003995896,0.0005635457,0.00025610183,0.00013887772,0.001146789,0.0013210629,0.0003314315,0.000006391464],"category_scores_gemma":[0.000011180508,0.00040915882,0.00016517255,0.0010343445,0.00006281541,0.0014340765,0.001094703,0.00069831405,0.00003638998],"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.000030322472,0.00018880633,0.0029863662,0.0004323083,0.00009894173,0.00074088736,0.00069085794,0.96032155,0.000019939214,0.03301353,0.00006204386,0.0014144415],"study_design_scores_gemma":[0.00068886776,0.00004969799,0.0012139996,0.0034162162,0.000038105503,0.000021228707,0.0029930528,0.98841786,0.000039053622,0.00021074219,0.0022788034,0.00063239795],"about_ca_topic_score_codex":0.0004561429,"about_ca_topic_score_gemma":0.00041293827,"teacher_disagreement_score":0.6411922,"about_ca_system_score_codex":0.0005736551,"about_ca_system_score_gemma":0.0003736352,"threshold_uncertainty_score":0.9998901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49079463,0.00016253103,0.50450176,0.00014117725,0.001594329,0.00069277466,0.00056707853,0.00015929327,0.0013863918],"genre_scores_gemma":[0.9968472,0.000015666958,0.00075283996,0.000073847536,0.00007937604,0.00000697837,0.00005328964,0.000013066701,0.0021577487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784833,0.00018063973,0.00026405402,0.0012045649,0.0001271146,0.00037527017],"domain_scores_gemma":[0.99822533,0.0002146115,0.0002964379,0.0009346607,0.00015163636,0.00017733595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004699221,0.00029338952,0.00041509062,0.0001297865,0.00022223998,0.0001293577,0.0010684823,0.00017306054,0.000015735108],"category_scores_gemma":[0.000047045367,0.00034782934,0.00022848153,0.00034169346,0.00012507716,0.000051955456,0.001953481,0.00035466888,0.0000074662125],"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.00024604556,0.00040429688,0.0027201157,0.0005004383,0.00027136508,0.0004362225,0.000835907,0.7117078,0.00006029848,0.27119514,0.009127237,0.002495156],"study_design_scores_gemma":[0.0012715565,0.00011292534,0.0015334551,0.000078528894,0.00006849117,0.000014839807,0.00041687352,0.9789607,0.00001330025,0.004315439,0.012565669,0.00064820476],"about_ca_topic_score_codex":0.00022204839,"about_ca_topic_score_gemma":0.00002311427,"teacher_disagreement_score":0.50605255,"about_ca_system_score_codex":0.00020863595,"about_ca_system_score_gemma":0.00022041296,"threshold_uncertainty_score":0.99989736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002135196,0.0016461979,0.97714204,0.010224021,0.0032321913,0.00073907076,0.0020284513,0.00038047598,0.002472367],"genre_scores_gemma":[0.98054326,0.000102267295,0.007875044,0.0011847857,0.0006992493,0.0014470752,0.0014832695,0.000062415056,0.0066026356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963647,0.00011793232,0.00067306287,0.0011129295,0.0010151907,0.00071617996],"domain_scores_gemma":[0.998355,0.00018245417,0.00040071298,0.0005175153,0.00030839894,0.00023597253],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006924085,0.00043205108,0.000449288,0.00021680353,0.0013240607,0.00080057577,0.0016351519,0.00013378813,0.00008763481],"category_scores_gemma":[0.000040576724,0.00042265985,0.00020153655,0.00073102914,0.000089912195,0.0006849424,0.0004582594,0.000490689,0.0000169714],"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.0017601216,0.0028786678,0.00094001036,0.000484818,0.00093304814,0.00036671464,0.0025379274,0.462291,0.0051270924,0.13584623,0.28473067,0.10210369],"study_design_scores_gemma":[0.0026102446,0.0002629563,0.00023615596,0.00015138806,0.000041152158,0.00015261215,0.00025305926,0.6824961,0.00028917726,0.0041926233,0.30852053,0.0007940729],"about_ca_topic_score_codex":0.000018382052,"about_ca_topic_score_gemma":0.0000032985904,"teacher_disagreement_score":0.97840804,"about_ca_system_score_codex":0.0003106054,"about_ca_system_score_gemma":0.00018580718,"threshold_uncertainty_score":0.9999761},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028734424,0.00033793665,0.9642816,0.015487065,0.0043769884,0.0011196908,0.0033937215,0.00030730144,0.007822217],"genre_scores_gemma":[0.8999912,0.000041385778,0.09548115,0.0005835265,0.0000791157,0.0012287783,0.00031754913,0.00001982201,0.0022574698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977635,0.0002608214,0.00052179926,0.0005078736,0.0006299554,0.0003160222],"domain_scores_gemma":[0.9966916,0.00057130936,0.00030815517,0.0018405207,0.00047167722,0.00011675112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052652665,0.00021237908,0.00022804507,0.00019495538,0.0009651313,0.00022677542,0.0046075447,0.000054490287,0.00014639636],"category_scores_gemma":[0.000107277345,0.00023645247,0.00016356543,0.00034145472,0.00012748598,0.000052741372,0.0010031945,0.00047361123,0.00006442241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071749724,0.0034483734,0.0002653653,0.00001804756,0.0003094053,0.000021364714,0.001953571,0.029002879,0.00394854,0.7688234,0.027303258,0.16483405],"study_design_scores_gemma":[0.0011211861,0.00008889646,0.00019361827,0.000024568764,0.000006215736,0.00002327042,0.00040771888,0.9066152,0.00012941074,0.0007611979,0.0903879,0.00024083712],"about_ca_topic_score_codex":0.00013154173,"about_ca_topic_score_gemma":0.000069422385,"teacher_disagreement_score":0.89711773,"about_ca_system_score_codex":0.00028690638,"about_ca_system_score_gemma":0.0002814504,"threshold_uncertainty_score":0.96422523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056253923,0.00012848304,0.9712328,0.010312638,0.0031385096,0.0021999863,0.0021001552,0.00014266264,0.0051193964],"genre_scores_gemma":[0.98170733,0.000019590365,0.012086385,0.00031928494,0.000052823223,0.004924681,0.00042252778,0.000012101648,0.00045526013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811685,0.00023783525,0.00055247144,0.00043524528,0.0004227852,0.0002348205],"domain_scores_gemma":[0.9972979,0.0006393192,0.00027013215,0.001365247,0.00036805935,0.00005938479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009202727,0.00015475017,0.00021213488,0.00017386687,0.0005069555,0.00022504391,0.0031574096,0.000055418674,0.000033790715],"category_scores_gemma":[0.00015397489,0.00017661591,0.00011390645,0.00026700247,0.000044156015,0.00017050449,0.00034761376,0.00030223027,0.000008466209],"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.000043734588,0.00040303453,0.00012823973,0.000019190753,0.000027589056,5.8427895e-7,0.00040629334,0.0056815366,0.003127224,0.98723686,0.0014801235,0.0014455754],"study_design_scores_gemma":[0.0009344986,0.00014685279,0.000248646,0.00004121668,0.000004298475,0.000006050841,0.00058432313,0.939465,0.00024004621,0.03156285,0.026562462,0.00020374294],"about_ca_topic_score_codex":0.00028406022,"about_ca_topic_score_gemma":0.00049479445,"teacher_disagreement_score":0.97608197,"about_ca_system_score_codex":0.0003897847,"about_ca_system_score_gemma":0.00024483414,"threshold_uncertainty_score":0.7202188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04267834,0.00011123987,0.927248,0.010346542,0.0003766043,0.009749577,0.000057908102,0.00023269624,0.009199065],"genre_scores_gemma":[0.9813389,0.000009015222,0.013983652,0.000051880303,0.000014741305,0.0035930742,0.000052004376,0.000022953223,0.00093374355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958087,0.0022513093,0.00062341965,0.0006401318,0.0003842862,0.00029211782],"domain_scores_gemma":[0.9947243,0.0013425878,0.00067334477,0.0019438232,0.0012592218,0.00005677557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051941075,0.00022888769,0.00032494037,0.00015557044,0.00019209586,0.0002783293,0.0014352037,0.00022106634,0.000010748121],"category_scores_gemma":[0.0010216372,0.00017307859,0.00016070077,0.00043151857,0.000057377678,0.00022381743,0.00047025233,0.00034899905,0.0000074826157],"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.00003201491,0.00085496716,0.0029896172,0.0003742556,0.000049022823,8.527629e-7,0.008287771,0.00013661265,0.0021556683,0.96127236,0.0016562698,0.02219056],"study_design_scores_gemma":[0.0053853416,0.000017998836,0.08414808,0.030535933,0.000055100387,0.000018428014,0.00038980806,0.387456,0.14639513,0.26491734,0.07795374,0.0027270792],"about_ca_topic_score_codex":0.00029024642,"about_ca_topic_score_gemma":0.00034732628,"teacher_disagreement_score":0.9386606,"about_ca_system_score_codex":0.0001858309,"about_ca_system_score_gemma":0.00016875312,"threshold_uncertainty_score":0.705794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5687093,0.00017061725,0.42496255,0.0028216606,0.00014995699,0.00070152304,0.000008105513,0.00018285449,0.0022934126],"genre_scores_gemma":[0.99351346,0.0000116635365,0.0060959514,0.00025338627,0.000012826002,0.000098980294,0.000001189632,0.0000070756464,0.000005474787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972374,0.00010380986,0.0004277767,0.00061063434,0.0009122463,0.00070814317],"domain_scores_gemma":[0.99843925,0.00026760943,0.0002540259,0.00074170716,0.00022180697,0.00007561664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045316964,0.00016542034,0.00024630423,0.00014490602,0.00064133434,0.00030141542,0.0045696395,0.000021042933,0.00000815758],"category_scores_gemma":[0.000100349476,0.000114689115,0.000041771542,0.0024309952,0.0015398881,0.000765151,0.0017433468,0.0005870388,0.0000016865812],"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.000031368294,0.00012567652,0.0007371063,0.000015121912,0.0000050460985,0.0000013748445,0.0023843686,0.0004293014,0.00053632,0.9844655,0.000025681515,0.011243162],"study_design_scores_gemma":[0.00048690234,0.0007200118,0.0046388656,0.000070558104,0.0000035425483,0.00011303799,0.00012993308,0.8988069,0.003114987,0.09018724,0.0014612874,0.0002667129],"about_ca_topic_score_codex":0.000012291827,"about_ca_topic_score_gemma":0.0000024167257,"teacher_disagreement_score":0.8983776,"about_ca_system_score_codex":0.0003095968,"about_ca_system_score_gemma":0.0003821812,"threshold_uncertainty_score":0.8491603},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.0332865e-7,0.00032676285,0.13863686,0.001887132,0.0007874443,0.0006759917,0.0006685744,0.00032662158,0.8566898],"genre_scores_gemma":[0.01232106,0.0013980814,0.051429763,0.00391658,0.0013187861,0.00039276964,0.0030849113,0.00024615516,0.9258919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967443,0.000029955205,0.00041923404,0.0018413982,0.00066242734,0.00030272434],"domain_scores_gemma":[0.9880705,0.00012776337,0.00033810438,0.011314986,0.000052033625,0.00009663627],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006154899,0.0004265977,0.0003911167,0.00021127274,0.000172629,0.0004184826,0.00582197,0.00029876814,0.00018296101],"category_scores_gemma":[0.000081482154,0.00037473126,0.00010189435,0.00006842146,0.00005217314,0.00029149058,0.0016180547,0.0004562641,0.0008854071],"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.0000058438163,0.000026495283,2.5930578e-7,0.00008499688,0.00014155277,0.000040446834,0.000008958426,0.000008072286,0.000017733908,0.5770084,0.08019924,0.34245795],"study_design_scores_gemma":[0.00006695223,0.000018946614,0.000040743147,0.00024160426,0.00005582264,0.0000058068445,8.861756e-7,0.00059242744,0.00020137899,0.011022836,0.9873511,0.00040145963],"about_ca_topic_score_codex":0.000013191634,"about_ca_topic_score_gemma":0.000032093027,"teacher_disagreement_score":0.9071519,"about_ca_system_score_codex":0.000067019646,"about_ca_system_score_gemma":0.000027150356,"threshold_uncertainty_score":0.99989253},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010032323,0.00036121623,0.26575744,0.0027578266,0.00075278437,0.00080790976,0.0008536968,0.00037134704,0.72833675],"genre_scores_gemma":[0.011990169,0.0012471993,0.11208875,0.005889995,0.0020771367,0.0005405009,0.0048083644,0.00037863932,0.86097926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99632096,0.00003696793,0.00043532145,0.0021305778,0.0007308503,0.00034534684],"domain_scores_gemma":[0.9861748,0.00015409435,0.00035681442,0.013152632,0.000048909806,0.00011272123],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005836935,0.0005123857,0.0004397642,0.0002661305,0.00019311748,0.0004240467,0.0066900915,0.0003558008,0.00014519822],"category_scores_gemma":[0.00009859148,0.0004312159,0.00012548195,0.00007874482,0.000064483786,0.00020608446,0.0017437255,0.0006900737,0.0005303399],"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.000009627115,0.00002851396,2.3680145e-7,0.00011608432,0.00018099733,0.00004436824,0.000016809377,0.000033965352,0.00003577207,0.49869692,0.039180905,0.4616558],"study_design_scores_gemma":[0.000073668954,0.000022444736,0.000038831655,0.00028308437,0.00006150653,0.000011525003,8.2829627e-7,0.00041694124,0.00019415561,0.02036793,0.97807753,0.00045153298],"about_ca_topic_score_codex":0.00001000476,"about_ca_topic_score_gemma":0.000036942893,"teacher_disagreement_score":0.93889666,"about_ca_system_score_codex":0.00006429462,"about_ca_system_score_gemma":0.00003134636,"threshold_uncertainty_score":0.999814},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.531257e-7,0.00044636737,0.42556512,0.0008452384,0.0019721845,0.0010369855,0.003831749,0.00019545814,0.56610644],"genre_scores_gemma":[0.049481936,0.00048325272,0.0021052558,0.006728267,0.00097500056,0.0004648926,0.003175344,0.00018137171,0.9364047],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99614227,0.00013435647,0.00048504263,0.0016547379,0.0011271148,0.00045646855],"domain_scores_gemma":[0.9944505,0.0006427402,0.00030579002,0.0044431696,0.000049365306,0.000108416265],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048524266,0.00058101333,0.0006647372,0.00027936068,0.00014235397,0.00039337142,0.0051673623,0.00025017752,0.00030139508],"category_scores_gemma":[0.000048483238,0.00049375696,0.00018782089,0.00012337719,0.00004715399,0.00030555265,0.00030468122,0.0004831517,0.0017563594],"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.000041699877,0.00010526174,2.4349967e-7,0.00023310143,0.00046387108,0.000059252925,0.00001007677,0.0007180537,8.709255e-7,0.25972322,0.6225956,0.11604873],"study_design_scores_gemma":[0.0005450656,0.00010617752,0.000037750888,0.00075290847,0.000118915705,0.0000044360327,0.00000166623,0.0059666405,0.000012579946,0.0036019837,0.9882671,0.0005847631],"about_ca_topic_score_codex":0.0000062265412,"about_ca_topic_score_gemma":0.000006003272,"teacher_disagreement_score":0.4234599,"about_ca_system_score_codex":0.00027564992,"about_ca_system_score_gemma":0.0001454368,"threshold_uncertainty_score":0.9997514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44289732,0.004239834,0.39057577,0.036629055,0.0046345554,0.0022590747,0.00055072544,0.001127821,0.11708584],"genre_scores_gemma":[0.9934343,0.0000062760414,0.0032625617,0.00019267733,0.000042946474,0.00011329497,0.000011071651,0.0000098323,0.0029270502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989107,0.00011111376,0.00012885238,0.00037558598,0.0002522866,0.00022144578],"domain_scores_gemma":[0.9993471,0.00007325888,0.00010279049,0.00033209138,0.00006252408,0.000082270184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017556614,0.000120100645,0.0001487391,0.000063029904,0.0006153469,0.00020980171,0.00032106708,0.000013433058,0.0000913303],"category_scores_gemma":[0.0000073150973,0.00011489282,0.00002263081,0.00079062814,0.000035967456,0.00050928094,0.0003409218,0.00024635583,0.000012472311],"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.0002878763,0.001050846,0.012122917,0.00012905833,0.0005907658,0.0009166647,0.04666792,0.011217218,0.011569421,0.77394056,0.076261304,0.06524543],"study_design_scores_gemma":[0.0012047137,0.00035621767,0.0063047856,0.000031751457,0.000017190623,0.00024629725,0.0032587864,0.0621253,0.0005525151,0.0006065725,0.9247994,0.0004964684],"about_ca_topic_score_codex":0.00016921251,"about_ca_topic_score_gemma":0.000027570743,"teacher_disagreement_score":0.8485381,"about_ca_system_score_codex":0.00015439007,"about_ca_system_score_gemma":0.0001790798,"threshold_uncertainty_score":0.4732813},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031743734,0.0013278725,0.021109965,0.005402387,0.0028886474,0.0012288893,0.00712572,0.001203303,0.95939577],"genre_scores_gemma":[0.02765034,0.0008227921,0.0039037971,0.003209239,0.0012681951,0.0000011552692,0.018722648,0.005971454,0.9384504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99565905,0.0008781681,0.000595626,0.0012094483,0.0009093324,0.0007483879],"domain_scores_gemma":[0.99672246,0.00006931131,0.0004215798,0.0016175444,0.00087514817,0.00029397674],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009917546,0.00039776033,0.0004943205,0.00032416126,0.0034377598,0.0026474795,0.0037965805,0.00021708134,0.12888171],"category_scores_gemma":[0.0002669375,0.0004409706,0.00017332529,0.000778206,0.00017927264,0.0001777006,0.0034702588,0.00092366454,0.10352239],"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.000025945003,0.00008550865,2.1964317e-7,0.00013360125,0.00009670822,0.00005042111,0.0010697551,0.000089396504,0.00015507918,0.0017269207,0.9791162,0.01745026],"study_design_scores_gemma":[0.0005454571,0.0001857734,0.000008050389,0.00008635663,0.0000121717585,0.0003417664,0.0001367452,0.0018446824,0.00007729228,0.00028097493,0.99599063,0.00049011037],"about_ca_topic_score_codex":0.000120583456,"about_ca_topic_score_gemma":4.3027427e-7,"teacher_disagreement_score":0.027332902,"about_ca_system_score_codex":0.0003742328,"about_ca_system_score_gemma":0.000039428167,"threshold_uncertainty_score":0.9998042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106387,0.00030247917,0.8381662,0.000077655546,0.00097640406,0.0012832978,0.00021470126,0.00024071062,0.0076747234],"genre_scores_gemma":[0.99813753,0.000027125003,0.0009975922,0.000054400796,0.000038804264,0.000022902312,0.00009484495,0.000017370343,0.00060940004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968441,0.00036289997,0.00043239447,0.0014700475,0.0002459849,0.0006445401],"domain_scores_gemma":[0.99769026,0.000060332062,0.00028047894,0.0015723897,0.00007767299,0.00031887833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042726265,0.00043698776,0.00069460477,0.00042578438,0.00018025402,0.00025451864,0.0032102007,0.00012328364,0.000012518139],"category_scores_gemma":[0.000018539677,0.0004703543,0.0002444027,0.0012837211,0.00004953326,0.00012781905,0.0022095095,0.00081329973,0.0000175917],"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.000040494295,0.00015905629,0.003191146,0.00017379051,0.00004895881,0.00018795002,0.00071252446,0.8689159,0.0000021502074,0.12608892,0.00033070392,0.00014836482],"study_design_scores_gemma":[0.000895804,0.000041089537,0.0071500065,0.00023628332,0.000022870476,0.000016236581,0.0006727966,0.9780924,0.0000034732175,0.0023391934,0.009776827,0.0007530243],"about_ca_topic_score_codex":0.0019958762,"about_ca_topic_score_gemma":0.00021864325,"teacher_disagreement_score":0.8470737,"about_ca_system_score_codex":0.00066141237,"about_ca_system_score_gemma":0.00021824492,"threshold_uncertainty_score":0.9997748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10008894,0.00088846055,0.8801081,0.0002888023,0.006977902,0.0021211265,0.0016330609,0.00041174173,0.0074818227],"genre_scores_gemma":[0.9936945,0.000020222482,0.0022106932,0.00012981807,0.00022769389,0.000443379,0.00009874492,0.000031338004,0.0031436197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966898,0.00028674115,0.0007281328,0.0009765876,0.0008582411,0.00046047347],"domain_scores_gemma":[0.99812347,0.000104300576,0.00040531953,0.00059688534,0.00056013186,0.0002099031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007064119,0.00037957716,0.00048467977,0.00021312525,0.0006016262,0.0007752297,0.0015561068,0.000100449266,0.000028965163],"category_scores_gemma":[0.00002695476,0.0003860659,0.000096930155,0.0002644661,0.00007816886,0.0004510489,0.00028806375,0.0003241212,0.000018345905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012963149,0.0005157578,0.00038892977,0.0002121612,0.00022577256,0.00007342114,0.0027421077,0.27215087,0.012551356,0.7053981,0.0011265913,0.0044853166],"study_design_scores_gemma":[0.0009810209,0.00041630195,0.0001674046,0.00013134841,0.000016492439,0.00015959174,0.00339609,0.9792496,0.00033549647,0.00006782732,0.014625445,0.00045336928],"about_ca_topic_score_codex":0.0006526691,"about_ca_topic_score_gemma":0.000075564305,"teacher_disagreement_score":0.89360553,"about_ca_system_score_codex":0.00042358713,"about_ca_system_score_gemma":0.00023316368,"threshold_uncertainty_score":0.99985915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262954,0.00006938584,0.47286358,0.00038687824,0.00011773194,0.000060701048,0.00008572841,0.000008696225,0.00011189221],"genre_scores_gemma":[0.99946994,0.0000073145266,0.0003533365,0.00008545567,0.000060253376,0.0000021482042,0.000012025047,0.0000044091744,0.0000050978915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985212,0.00016007705,0.00048809117,0.00014974487,0.0004901167,0.00019078267],"domain_scores_gemma":[0.9989517,0.0002226218,0.00045940347,0.0001682901,0.00011993611,0.000078093115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063056045,0.0001372486,0.00026440452,0.000085785745,0.00039107847,0.00005333108,0.00042865757,0.000027756005,0.000022645227],"category_scores_gemma":[0.000014893377,0.00009046271,0.00021441365,0.00030534595,0.00003604027,0.00016984665,0.000022913533,0.00038635347,7.085715e-7],"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.00027059426,0.000267458,0.000070092,0.000012931683,0.000072390896,0.000013597807,0.00056440255,0.98894054,0.0006398736,0.0028125418,0.0009935301,0.0053420393],"study_design_scores_gemma":[0.0018093456,0.0017311781,0.007084151,0.00010173126,0.000014219137,0.00032362668,0.0002319122,0.9872569,0.00025428046,0.0008858984,0.00014711144,0.0001596475],"about_ca_topic_score_codex":0.000019322079,"about_ca_topic_score_gemma":1.7824492e-7,"teacher_disagreement_score":0.47317457,"about_ca_system_score_codex":0.00009909139,"about_ca_system_score_gemma":0.00010597466,"threshold_uncertainty_score":0.36889622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023338448,0.0014490543,0.70185566,0.01613658,0.001878165,0.0006097621,0.00097463425,0.0014259157,0.2733364],"genre_scores_gemma":[0.89097565,0.000029821129,0.03614432,0.0048267995,0.00016079984,0.00009088239,0.00059556856,0.000025833813,0.067150325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887854,0.000049966446,0.00015885815,0.00046986336,0.0002669374,0.00017581745],"domain_scores_gemma":[0.99608105,0.000027609576,0.000058285685,0.0037403223,0.00003741305,0.000055340006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040731145,0.000068879126,0.00010714297,0.000033761444,0.00022158292,0.00008969551,0.0047422964,0.000016480211,0.00030895445],"category_scores_gemma":[0.000039435152,0.000064538566,0.000020442876,0.00048067226,0.000014450816,0.0003381108,0.0038532293,0.000108995824,0.000106114225],"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.0000035013466,0.00004288979,0.0001458852,0.0000048516663,0.000014825577,0.000018104152,0.00008174722,0.000088663604,0.00026259632,0.10526887,0.890892,0.0031760242],"study_design_scores_gemma":[0.00023663069,0.000027879883,0.00020464667,0.0000019689837,0.0000020422897,0.000028897168,0.00003403795,0.05335708,0.00010569345,0.00044621908,0.9454509,0.00010399045],"about_ca_topic_score_codex":0.00020520439,"about_ca_topic_score_gemma":0.000008255658,"teacher_disagreement_score":0.8886418,"about_ca_system_score_codex":0.000026939671,"about_ca_system_score_gemma":0.000055096116,"threshold_uncertainty_score":0.88124454},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68570304,0.00008868019,0.313487,0.00012824647,0.000052259697,0.00008933276,0.00004685065,0.000024379546,0.00038020118],"genre_scores_gemma":[0.99249935,0.0000015875697,0.0071970797,0.000057846104,0.0000050602375,0.0000323078,0.000004410969,0.0000021373598,0.00020019052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999317,0.00002149912,0.00019751837,0.0001965207,0.00014636667,0.00012111751],"domain_scores_gemma":[0.99957323,0.000045994588,0.000061995,0.00022574312,0.000062488565,0.00003057226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033666653,0.00005580594,0.00018732887,0.00012398888,0.00015203659,0.000018372999,0.00023521765,0.000011764272,0.000008100641],"category_scores_gemma":[0.000007071393,0.00005186279,0.00006228485,0.00063738116,0.000012841785,0.000016284905,0.00013546967,0.000037149588,1.703159e-7],"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.00001424383,0.000043100208,0.003451424,0.0000317444,0.00023931934,0.0000012419079,0.00056491944,0.9703727,0.0004213011,0.016939895,0.00026200226,0.00765816],"study_design_scores_gemma":[0.00015026153,0.000052888423,0.00038885215,0.0000018838224,0.000039779236,0.0000032116882,0.00012347137,0.9987179,0.000058791433,0.000051823707,0.00034339778,0.00006770861],"about_ca_topic_score_codex":0.0000467689,"about_ca_topic_score_gemma":0.0000059280264,"teacher_disagreement_score":0.3067963,"about_ca_system_score_codex":0.000012310027,"about_ca_system_score_gemma":0.000021693622,"threshold_uncertainty_score":0.21149032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047804356,0.00018539769,0.9101127,0.0070358776,0.016355602,0.001336778,0.0021726687,0.0009465859,0.01405005],"genre_scores_gemma":[0.9958283,0.000006836957,0.00046222712,0.00077520416,0.0004991236,0.00023832553,0.0007787037,0.000031705444,0.0013795764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945866,0.00050729956,0.0010275195,0.0012764438,0.0018469506,0.00075518497],"domain_scores_gemma":[0.99744886,0.00014361257,0.0005545338,0.0009768688,0.0005690114,0.00030709236],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010628024,0.00048631325,0.0005447843,0.0003966868,0.00084744545,0.001054781,0.0032575962,0.00011877218,0.00016415177],"category_scores_gemma":[0.00008173126,0.00052133447,0.000211871,0.001129892,0.000051493276,0.0004279408,0.0008282517,0.0007320234,0.000280915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099324425,0.0005407174,0.00042236483,0.000074566175,0.00029381234,0.000139852,0.0015749411,0.37021843,0.005638961,0.48247936,0.12721771,0.011299967],"study_design_scores_gemma":[0.00078358164,0.00029672292,0.00061475305,0.00023090618,0.000009451285,0.0000894714,0.001280659,0.84940475,0.00027865346,0.0002696486,0.14601934,0.00072205724],"about_ca_topic_score_codex":0.00026188395,"about_ca_topic_score_gemma":0.00001472455,"teacher_disagreement_score":0.9480239,"about_ca_system_score_codex":0.00091133825,"about_ca_system_score_gemma":0.0002367389,"threshold_uncertainty_score":0.99998224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73476917,0.0051922956,0.16741663,0.049876064,0.006757501,0.008816028,0.012966943,0.00068376405,0.0135216],"genre_scores_gemma":[0.984235,0.00000767776,0.014364483,0.00043495267,0.00010320108,0.00032276465,0.000038365062,0.000010877537,0.00048267673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852526,0.0000067744095,0.00031356854,0.00036092085,0.00052969635,0.00026379264],"domain_scores_gemma":[0.99905175,0.000030757787,0.0002903456,0.0003860047,0.00019193496,0.000049219878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037852017,0.00013296741,0.00018452776,0.000054373875,0.0003391559,0.0000497334,0.0018707587,0.000017039996,0.00003530133],"category_scores_gemma":[0.000091794565,0.000102873,0.00012976896,0.00043713296,0.00003474025,0.0003306294,0.0014289621,0.00011986656,0.0000012422772],"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.00007482882,0.0011514825,0.0031648828,0.0003739139,0.00011549989,8.124632e-7,0.0012675419,0.00015263693,0.05419257,0.5234749,0.4124197,0.0036112664],"study_design_scores_gemma":[0.00425622,0.00073128636,0.004584511,0.00029499375,0.00008674161,0.000107276355,0.002232638,0.066686705,0.16999047,0.024809372,0.72537136,0.00084841746],"about_ca_topic_score_codex":0.00009140312,"about_ca_topic_score_gemma":0.0000029877492,"teacher_disagreement_score":0.49866548,"about_ca_system_score_codex":0.00016255544,"about_ca_system_score_gemma":0.000053467465,"threshold_uncertainty_score":0.4195039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007767909,0.0001958001,0.98468554,0.0006270132,0.012539719,0.00031703326,0.000038520528,0.00046962727,0.00034998058],"genre_scores_gemma":[0.98549616,0.0000037745,0.012246761,0.00042706463,0.00091354735,0.00045260024,0.000013373013,0.000018390148,0.00042835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765635,0.0003383973,0.00045151028,0.0005491178,0.00053793704,0.00046667227],"domain_scores_gemma":[0.9982873,0.00013484122,0.00014072329,0.0012459455,0.00005967277,0.0001314884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049863895,0.0001959042,0.00027348092,0.00009179176,0.0012356195,0.0003748587,0.0014620229,0.000045914276,0.000052424846],"category_scores_gemma":[0.0000023686512,0.00020749184,0.00014609478,0.0007281661,0.000021711603,0.00033477103,0.00007790493,0.00035192128,0.00010909294],"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.000009579667,0.00013929886,0.000064564454,0.000016041236,0.00005684568,0.000038812,0.00028781674,0.94715893,0.0000076150104,0.015891813,0.014749122,0.021579586],"study_design_scores_gemma":[0.00049623835,0.00028873488,0.00017413823,0.000048185644,0.00000945004,0.00019906332,0.000049357906,0.66754586,0.000025172589,0.00027570094,0.3305589,0.00032918592],"about_ca_topic_score_codex":0.00009942775,"about_ca_topic_score_gemma":0.0000047513113,"teacher_disagreement_score":0.98471934,"about_ca_system_score_codex":0.00012367986,"about_ca_system_score_gemma":0.00006173299,"threshold_uncertainty_score":0.9503511},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025696088,0.000013032153,0.9543314,0.0029864335,0.0015508705,0.00028242136,0.000012535283,0.0008254467,0.0143017955],"genre_scores_gemma":[0.97779286,0.000005486549,0.021224009,0.00077917875,0.00010160607,0.00002395581,0.0000028953518,0.000008804595,0.00006120802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635637,0.00009149265,0.00034229542,0.0009909235,0.0013020125,0.0009168798],"domain_scores_gemma":[0.99719304,0.00016700882,0.000076442586,0.002064518,0.00015633313,0.00034265436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019919737,0.00023657996,0.00025059868,0.0003197267,0.0005260922,0.0006256133,0.005329793,0.0000545487,0.000025474337],"category_scores_gemma":[0.00009130709,0.00018411338,0.000099817036,0.0033594957,0.0013705427,0.0004887468,0.0019064937,0.00019915031,0.00091756374],"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.0000044902636,0.000049647228,0.000021265405,0.00000921571,0.000003855503,0.000035128764,0.00020130312,0.00033951475,0.00018672962,0.972512,0.0022816332,0.02435522],"study_design_scores_gemma":[0.00033685262,0.00024027943,0.0012349465,0.000055831686,0.0000019499746,0.000016267577,0.000007230689,0.65795356,0.0012782459,0.33749488,0.0011031011,0.00027683013],"about_ca_topic_score_codex":0.0000033930924,"about_ca_topic_score_gemma":3.6559553e-7,"teacher_disagreement_score":0.95209676,"about_ca_system_score_codex":0.000057474575,"about_ca_system_score_gemma":0.00007679136,"threshold_uncertainty_score":0.99986035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008341111,0.00021160851,0.97489196,0.0008892864,0.004748727,0.00055426254,0.017624354,0.00005791936,0.00018778669],"genre_scores_gemma":[0.8159575,0.00019856128,0.16408154,0.0009568996,0.0010752317,0.0003626232,0.0169262,0.000044894772,0.00039657968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967368,0.000057197558,0.0006089243,0.0012258644,0.0010334402,0.00033776098],"domain_scores_gemma":[0.9936808,0.001060703,0.0004698619,0.0044797775,0.00021719903,0.000091688744],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00223691,0.00023550494,0.00026495356,0.00012163881,0.00053369155,0.0004252514,0.013448981,0.000054793036,0.000025676563],"category_scores_gemma":[0.00088203244,0.00018787647,0.000018335324,0.00042658945,0.00008015796,0.0008957609,0.009114257,0.0003746318,0.000009023655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020306058,0.00040046073,0.0010269968,0.000087492735,0.0004081832,0.00003417974,0.0004117929,0.0009185487,0.0013199425,0.041912355,0.08913579,0.8641412],"study_design_scores_gemma":[0.00080265634,0.00016721898,0.0006854865,0.00028731162,0.000028459046,0.000047625053,0.00029630162,0.6729468,0.00066180376,0.005519288,0.31812146,0.00043557675],"about_ca_topic_score_codex":0.00020965097,"about_ca_topic_score_gemma":0.000073438125,"teacher_disagreement_score":0.86370564,"about_ca_system_score_codex":0.00007946143,"about_ca_system_score_gemma":0.0006364522,"threshold_uncertainty_score":0.9988998},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008807882,0.000043656626,0.9791621,0.00030367044,0.00019589801,0.00016695597,0.000040073242,0.0019276475,0.009352097],"genre_scores_gemma":[0.9949518,0.0000016765601,0.00434702,0.000041523526,0.000037356738,0.00002318156,0.000045979996,0.000008915014,0.0005425403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865377,0.000033890366,0.00023061574,0.0003797674,0.00033625666,0.00036570407],"domain_scores_gemma":[0.99909544,0.000029859983,0.000065974375,0.000580233,0.00011305793,0.00011542699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024581677,0.00014037993,0.00020918495,0.00006630846,0.00015708659,0.00022592639,0.000680365,0.000045880257,0.000001399548],"category_scores_gemma":[0.0000034343939,0.00010112893,0.00004314221,0.0011308445,0.000022342749,0.00047699743,0.000148448,0.000080961225,0.0002659614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055292944,0.000021316142,0.0002293184,0.000093491275,0.000027397295,0.00012382018,0.00016701483,0.056354493,0.0000919488,0.93815315,0.0034408108,0.0012917034],"study_design_scores_gemma":[0.00030044044,0.000029033508,0.0004830443,0.00010523528,0.0000026770342,0.000037314745,0.00019387192,0.99669963,0.00013177811,0.00042102474,0.0014221225,0.0001738243],"about_ca_topic_score_codex":0.00006735912,"about_ca_topic_score_gemma":0.000009847504,"teacher_disagreement_score":0.98614395,"about_ca_system_score_codex":0.00005097012,"about_ca_system_score_gemma":0.000043109285,"threshold_uncertainty_score":0.41239178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036554124,0.00014715659,0.94338757,0.000283226,0.0035716584,0.0005031852,0.00019265657,0.0013542767,0.014006178],"genre_scores_gemma":[0.9883382,0.0001246885,0.0004850661,0.00011258413,0.00010084742,0.0000036785946,0.00004538811,0.000035561992,0.010754011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686164,0.00022169715,0.00043299285,0.0016489254,0.00019824688,0.0006364753],"domain_scores_gemma":[0.99679834,0.0002700732,0.00042596555,0.001978552,0.00026422285,0.00026287118],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051105744,0.000470417,0.0006596759,0.00025970596,0.0002884308,0.00041450397,0.002452895,0.00043931036,0.00001967131],"category_scores_gemma":[0.000044241857,0.0005239124,0.00032961203,0.00089704973,0.000117262076,0.00046171053,0.0018780488,0.00064413174,0.0008703839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023093586,0.000079506244,0.0030232423,0.00052695133,0.00026527204,0.0014966046,0.00012594223,0.32985938,0.00002307567,0.6523562,0.012043391,0.00017734959],"study_design_scores_gemma":[0.0013383378,0.000083041414,0.0028790857,0.0017751005,0.00013312789,0.000041307456,0.0009008978,0.9272798,0.00009711455,0.050520387,0.013215705,0.0017361077],"about_ca_topic_score_codex":0.0009694281,"about_ca_topic_score_gemma":0.00018724211,"teacher_disagreement_score":0.9517841,"about_ca_system_score_codex":0.0005866809,"about_ca_system_score_gemma":0.00041932316,"threshold_uncertainty_score":0.99990755},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016881734,0.0049973177,0.46899927,0.003933859,0.017214108,0.0010706794,0.0001935399,0.000844924,0.48586458],"genre_scores_gemma":[0.81224984,0.000043697233,0.0021927976,0.00081000954,0.0006060353,0.000032430988,0.00003187258,0.000029510224,0.18400379],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964186,0.00015652837,0.0007880401,0.0008832389,0.00089919195,0.00085440365],"domain_scores_gemma":[0.99694306,0.000064955115,0.00024879887,0.0012911471,0.0006596554,0.000792375],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009108087,0.0004294499,0.00059486134,0.00008713794,0.00016003732,0.00070076814,0.0013530931,0.00023342205,0.00033537205],"category_scores_gemma":[0.00012459689,0.00036965657,0.00020060517,0.0006164543,0.00010633649,0.0009029131,0.00036283935,0.00027459982,0.008774064],"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.000046294823,0.00026525464,0.010113887,0.00006548805,0.00007676143,0.00023899133,0.0013212177,0.000116407915,0.00003735016,0.034137085,0.9490985,0.004482707],"study_design_scores_gemma":[0.0018145978,0.00035782275,0.0019977086,0.0001543425,0.000023653998,0.000099536985,0.00036298035,0.07396281,0.0001842687,0.00039364913,0.91988236,0.0007662617],"about_ca_topic_score_codex":0.0005244843,"about_ca_topic_score_gemma":0.0001449118,"teacher_disagreement_score":0.79536813,"about_ca_system_score_codex":0.0001078384,"about_ca_system_score_gemma":0.00045511138,"threshold_uncertainty_score":0.99987555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013112298,0.000039885406,0.97836965,0.0067801354,0.0003045959,0.00021981749,0.000012074929,0.0006177807,0.00054373196],"genre_scores_gemma":[0.9831998,0.0000074581176,0.015884891,0.00025274375,0.000037954233,0.000017514698,0.0000020273014,0.000014510208,0.00058309705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851894,0.0000833213,0.00022297367,0.00040776178,0.00037347592,0.00039353827],"domain_scores_gemma":[0.9985252,0.00023965747,0.00008513234,0.0009883882,0.0000871514,0.00007445823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036978032,0.00018077856,0.00019076442,0.00008842878,0.0006036359,0.0002571616,0.0013462392,0.0000474623,0.0000086640275],"category_scores_gemma":[0.000011133624,0.00011936027,0.00008084668,0.0011017311,0.00005705333,0.0001972539,0.000040390572,0.00031182193,0.00022394476],"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.00005264743,0.000048715454,0.000038122776,0.000022624978,0.00008721674,0.000033304404,0.002039314,0.87830955,0.000051599007,0.002169966,0.0047741947,0.11237274],"study_design_scores_gemma":[0.0017768815,0.00062629115,0.0020404935,0.00030584593,0.000026281237,0.00012540913,0.0010192731,0.9122485,0.0005063075,0.0010637393,0.07956933,0.0006916687],"about_ca_topic_score_codex":0.000028306911,"about_ca_topic_score_gemma":0.000025762782,"teacher_disagreement_score":0.9700875,"about_ca_system_score_codex":0.000046205547,"about_ca_system_score_gemma":0.000054963595,"threshold_uncertainty_score":0.48673707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12573363,0.00018496854,0.8588974,0.0010311814,0.0011567842,0.00017604476,0.0000020908687,0.0007684363,0.012049495],"genre_scores_gemma":[0.9966312,0.000030046462,0.0024084975,0.00012505158,0.00007271035,0.00001022142,0.0000020415805,0.0000041067537,0.0007161318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999249,0.000035512076,0.00015351831,0.0001933486,0.00012266429,0.0002459781],"domain_scores_gemma":[0.9996959,0.000040205734,0.000020702102,0.0001908712,0.000018962695,0.00003337609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031762035,0.000059841637,0.00009086832,0.000050047198,0.00005003095,0.000073415256,0.0002452604,0.000045306075,0.00000538412],"category_scores_gemma":[0.0000033346282,0.000056155688,0.000031026193,0.00089972245,0.0000062478634,0.00028906722,0.000025301173,0.00008204601,0.00017494199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023898167,0.0001193748,0.012145034,0.0001178305,0.000040724084,0.00042332115,0.003202427,0.04584117,0.0052662767,0.18092142,0.04483284,0.7070657],"study_design_scores_gemma":[0.0006682292,0.000044823697,0.06492986,0.00014971566,0.0000018434858,0.000018132941,0.00019337483,0.8624155,0.00018858298,0.0037019353,0.06732323,0.00036476317],"about_ca_topic_score_codex":0.00013112955,"about_ca_topic_score_gemma":0.00013214894,"teacher_disagreement_score":0.8708976,"about_ca_system_score_codex":0.000024405635,"about_ca_system_score_gemma":0.000019878828,"threshold_uncertainty_score":0.22899626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50923973,0.002085848,0.43448165,0.041272298,0.0030022308,0.0005162007,0.000030398414,0.0004118315,0.008959798],"genre_scores_gemma":[0.9982363,0.00016740423,0.0005381435,0.00021026166,0.00020193092,0.000006528924,0.0000012154284,0.000006426134,0.0006318039],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895334,0.000078286736,0.00024162677,0.0001391977,0.00029019418,0.00029733303],"domain_scores_gemma":[0.99951243,0.00004421161,0.000089194196,0.00028026692,0.000011330174,0.00006258153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655586,0.00007915767,0.0001179201,0.00008986397,0.00017319023,0.00021135302,0.0008244491,0.000024528259,0.00003719244],"category_scores_gemma":[0.000020011834,0.000050550672,0.000059492977,0.0004262603,0.000018545541,0.0002249213,0.00018962489,0.00025288344,0.0005210594],"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.00007269919,0.00043745796,0.02715839,0.000086269596,0.00026662453,0.0037946862,0.015204143,0.06339353,0.023755886,0.10228636,0.32150808,0.44203588],"study_design_scores_gemma":[0.0017506898,0.00009461881,0.10839242,0.00028701525,0.000008934044,0.0013157452,0.0003450863,0.2489909,0.0006327664,0.0054905335,0.6322161,0.00047522783],"about_ca_topic_score_codex":0.000009529307,"about_ca_topic_score_gemma":0.0000011117822,"teacher_disagreement_score":0.48899654,"about_ca_system_score_codex":0.000025970048,"about_ca_system_score_gemma":0.000022463237,"threshold_uncertainty_score":0.6697338},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092142494,0.0010598637,0.7893198,0.00061284,0.004472403,0.0008978185,0.0019346045,0.0037674594,0.19784303],"genre_scores_gemma":[0.11557174,0.00026368178,0.0031981163,0.0022454483,0.0042836145,0.00020474449,0.0034231937,0.0007948128,0.87001467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99367326,0.00086991134,0.0010710303,0.0019227612,0.0012151737,0.0012478636],"domain_scores_gemma":[0.9907748,0.0053547947,0.00084123254,0.0024557745,0.00025845531,0.00031493098],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002342366,0.0011288025,0.0013590603,0.00047373743,0.00083568576,0.00069964596,0.0036655,0.0010020905,0.00010860171],"category_scores_gemma":[0.0014806357,0.0010340203,0.0006793209,0.00076481426,0.00016330347,0.00018824877,0.0011285727,0.0014071884,0.0019368525],"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.00014003018,0.0001522077,0.0000024317528,0.00026213846,0.00044769744,0.00033304124,0.0002510104,0.0069961324,0.00004712138,0.31885096,0.52852434,0.14399293],"study_design_scores_gemma":[0.0007254211,0.00033596685,0.00012694442,0.004709594,0.0001674636,0.00010946812,0.000032315827,0.03582197,0.0010860784,0.36179468,0.59207964,0.0030104858],"about_ca_topic_score_codex":0.000009657729,"about_ca_topic_score_gemma":0.0000058017245,"teacher_disagreement_score":0.7861217,"about_ca_system_score_codex":0.00085679727,"about_ca_system_score_gemma":0.0006651071,"threshold_uncertainty_score":0.999211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046908786,0.0013948276,0.6914362,0.0039411034,0.0022646664,0.0027527967,0.0021829144,0.0027454642,0.29323518],"genre_scores_gemma":[0.56151265,0.0005692726,0.0050662267,0.0020857418,0.0017614618,0.000352714,0.0016985923,0.0009939221,0.4259594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958447,0.0003194568,0.00079219416,0.0016594038,0.00066102453,0.00072321284],"domain_scores_gemma":[0.9955275,0.0017150532,0.00065928354,0.0016719755,0.00014168936,0.00028446724],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017620238,0.0008865062,0.0011459921,0.00026060417,0.0006504072,0.0013156331,0.0036331778,0.00060176424,0.00004896422],"category_scores_gemma":[0.00046357748,0.0006082511,0.00026317057,0.00023323302,0.0001976649,0.0002196052,0.002410263,0.0008552113,0.000264053],"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.00004259769,0.000040108192,0.0000027765007,0.00013280429,0.00020388897,0.00006944775,0.00016028868,0.0007280511,0.0000184756,0.82225376,0.010454182,0.16589358],"study_design_scores_gemma":[0.0006056529,0.00023881465,0.00023472463,0.005595225,0.00012564116,0.00008532781,0.000031384192,0.010546432,0.00024852375,0.7471002,0.23313127,0.0020567912],"about_ca_topic_score_codex":0.000014658455,"about_ca_topic_score_gemma":0.00000926476,"teacher_disagreement_score":0.6863699,"about_ca_system_score_codex":0.0001605969,"about_ca_system_score_gemma":0.00014585379,"threshold_uncertainty_score":0.9997211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029536104,0.0008983846,0.7029294,0.0007763327,0.0025043534,0.0009021309,0.001349441,0.005802964,0.28480744],"genre_scores_gemma":[0.9118855,0.00005967253,0.0017962568,0.00076440064,0.0016699766,0.000121284625,0.00077482994,0.00060601,0.08232207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940075,0.0004606375,0.00121796,0.0019319877,0.0012437993,0.0011380807],"domain_scores_gemma":[0.9903883,0.0052881544,0.0009916432,0.0026779699,0.00030334748,0.0003506198],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0018395835,0.0013097265,0.0015448094,0.00050354324,0.00070755096,0.0007401829,0.003653653,0.00096536626,0.000052621563],"category_scores_gemma":[0.00089821225,0.0011820884,0.00079926586,0.0003690117,0.00017853329,0.00014526611,0.0007830871,0.0012408062,0.001694591],"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.00004795069,0.000028429367,0.0000016353127,0.00027208548,0.00041133253,0.0003233303,0.00007496569,0.0030481752,0.000008721814,0.94311506,0.0254099,0.027258398],"study_design_scores_gemma":[0.001051299,0.00039194024,0.00021982501,0.0149984835,0.00049664447,0.0003237892,0.0001561334,0.039054383,0.0015032873,0.32070878,0.6152214,0.005874071],"about_ca_topic_score_codex":0.000019199804,"about_ca_topic_score_gemma":0.00000985073,"teacher_disagreement_score":0.91185594,"about_ca_system_score_codex":0.0005493745,"about_ca_system_score_gemma":0.0002352152,"threshold_uncertainty_score":0.9999654},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009648411,0.0011829339,0.5851729,0.0006551038,0.0040265205,0.00095022214,0.002230737,0.0035100977,0.402175],"genre_scores_gemma":[0.33108243,0.00064378174,0.0045771166,0.002368519,0.0035443052,0.00016598534,0.0025886132,0.001062263,0.65396696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944113,0.0003587573,0.0010798165,0.0018583034,0.0011454815,0.0011463352],"domain_scores_gemma":[0.9928045,0.0034186186,0.0008387301,0.0023353249,0.00028881527,0.000313999],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019708697,0.0011358619,0.0013226537,0.0004325275,0.0008478165,0.0006343616,0.002907572,0.00093982904,0.00023657756],"category_scores_gemma":[0.00082260655,0.0010535687,0.0006267115,0.00041418802,0.00015555207,0.00020544276,0.00090334646,0.0012680164,0.0017874901],"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.00009772625,0.000068375964,0.000002121737,0.00012271697,0.0003263373,0.00019123161,0.00011689631,0.0050509977,0.00005397115,0.85486495,0.053208593,0.085896105],"study_design_scores_gemma":[0.000636383,0.00029142632,0.00010769311,0.003922519,0.00017196844,0.000094772964,0.000024740628,0.024689872,0.0013461146,0.45515442,0.5107117,0.002848355],"about_ca_topic_score_codex":0.000020609265,"about_ca_topic_score_gemma":0.000009836331,"teacher_disagreement_score":0.5805958,"about_ca_system_score_codex":0.00042491584,"about_ca_system_score_gemma":0.00029640622,"threshold_uncertainty_score":0.99919146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060251572,0.0011830827,0.7198936,0.0010365231,0.0035245966,0.0010015976,0.0012164044,0.004488643,0.26759532],"genre_scores_gemma":[0.5796927,0.00023133136,0.0055528153,0.0024812643,0.0037322685,0.0001912929,0.0013432999,0.0011411388,0.40563387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476856,0.00033294104,0.0010148112,0.0017682032,0.0010598534,0.0010556186],"domain_scores_gemma":[0.9921602,0.0040090387,0.0008041306,0.0024751602,0.0002363699,0.00031511803],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016212119,0.0011454576,0.0012778788,0.00040567206,0.00062466424,0.00060870737,0.0033824635,0.00089233863,0.00012435396],"category_scores_gemma":[0.00086235406,0.0010423479,0.0007141577,0.00048204308,0.00020620473,0.000112518675,0.0007788343,0.0012849764,0.0019780821],"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.00007005452,0.00004349248,0.0000023126997,0.00007897535,0.00033497097,0.00019622706,0.000095604526,0.0015195927,0.0000056659446,0.80468476,0.027498433,0.1654699],"study_design_scores_gemma":[0.0007339466,0.00024913423,0.00051155017,0.006814455,0.00026976378,0.000090445494,0.000024145022,0.0046923384,0.00069394434,0.5311378,0.45067573,0.0041067046],"about_ca_topic_score_codex":0.000004146145,"about_ca_topic_score_gemma":0.0000022386719,"teacher_disagreement_score":0.71434075,"about_ca_system_score_codex":0.000314922,"about_ca_system_score_gemma":0.00021240236,"threshold_uncertainty_score":0.99920267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006449965,0.0011829613,0.52243507,0.0010686226,0.0056405035,0.0008702663,0.0016563516,0.0038790852,0.46320263],"genre_scores_gemma":[0.58066857,0.0002128301,0.0021686538,0.0037579464,0.004908585,0.0001513341,0.0015366015,0.0011124782,0.40548298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947743,0.0002458024,0.0009920229,0.0018010894,0.0011153959,0.0010714318],"domain_scores_gemma":[0.99322516,0.0029317387,0.0007802647,0.002512017,0.00028349765,0.0002673379],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014653375,0.0011841654,0.0012625965,0.0004383625,0.00064535445,0.00083559786,0.0032814764,0.00091630546,0.00020888857],"category_scores_gemma":[0.00068567594,0.0010699255,0.00075221545,0.00035687978,0.00026388836,0.00016762136,0.0007545343,0.0012478337,0.002589434],"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.000060924922,0.000058482237,9.592114e-7,0.000086339765,0.00032583685,0.00030410956,0.000050161085,0.0008799156,0.000016367403,0.91680574,0.04173575,0.039675392],"study_design_scores_gemma":[0.0003832373,0.00017623283,0.0000922601,0.0023312825,0.00014433815,0.00007732384,0.000008280985,0.005966973,0.0004370647,0.48985684,0.49831587,0.0022102897],"about_ca_topic_score_codex":0.000007919866,"about_ca_topic_score_gemma":0.0000062281993,"teacher_disagreement_score":0.5806041,"about_ca_system_score_codex":0.0003322371,"about_ca_system_score_gemma":0.00024167699,"threshold_uncertainty_score":0.9991751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005169806,0.0016323654,0.9174779,0.00090723805,0.0017243177,0.00073366193,0.001972167,0.002399082,0.07310159],"genre_scores_gemma":[0.82214266,0.0003432247,0.016068596,0.004631578,0.0037174213,0.00023808276,0.001891613,0.0013645405,0.14960231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995438,0.0002965505,0.0007514198,0.0016330064,0.0010728925,0.00080815965],"domain_scores_gemma":[0.9937819,0.0033551264,0.00059128145,0.0016717659,0.00029097594,0.00030892505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016882948,0.0009964006,0.0010959062,0.0003006869,0.00052323245,0.0005132645,0.0018074061,0.0007350331,0.000054327385],"category_scores_gemma":[0.00070466194,0.0009082919,0.00039893572,0.00025001305,0.00025843133,0.00010032647,0.00050229864,0.0009733719,0.00027169858],"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.00007769268,0.000058878886,0.0000036819738,0.00019819633,0.00034093758,0.0002850075,0.00012645943,0.002533987,0.000018062588,0.7532778,0.013846713,0.22923262],"study_design_scores_gemma":[0.0017539823,0.0005806967,0.0005857044,0.007345405,0.00040870742,0.00016390179,0.000048283542,0.1976446,0.0012044222,0.39781833,0.3869047,0.0055412897],"about_ca_topic_score_codex":0.000013105633,"about_ca_topic_score_gemma":0.0000061275146,"teacher_disagreement_score":0.90140927,"about_ca_system_score_codex":0.00037089924,"about_ca_system_score_gemma":0.00035698124,"threshold_uncertainty_score":0.9993368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021719568,0.00033443706,0.74604964,0.00050203566,0.0011294626,0.00078682456,0.0008276517,0.0025478029,0.24780041],"genre_scores_gemma":[0.79795474,0.00012360128,0.0075727687,0.0011872661,0.0021294774,0.00016602258,0.0020714658,0.0007238402,0.18807083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569416,0.00023290727,0.00094172085,0.0013919208,0.00091853377,0.0008207594],"domain_scores_gemma":[0.9946009,0.00242736,0.00079814054,0.0017016773,0.0002550073,0.00021693339],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014399443,0.0009107196,0.0009621698,0.0003849974,0.0005234666,0.0004903726,0.002139551,0.0007432276,0.000067024615],"category_scores_gemma":[0.00041500764,0.0008297779,0.00052869646,0.00030192223,0.00009343913,0.00016636956,0.0005013473,0.0008932345,0.0009374692],"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.00003463819,0.000029174926,0.0000012614864,0.00009355197,0.00017979262,0.000057052217,0.000080691374,0.0033398217,0.000014985927,0.8783638,0.0090455115,0.1087597],"study_design_scores_gemma":[0.00036771322,0.00016390678,0.0001261966,0.0024018402,0.00011146465,0.000047003537,0.000009936965,0.020982001,0.0005501856,0.81723034,0.1562861,0.0017232907],"about_ca_topic_score_codex":0.000006355166,"about_ca_topic_score_gemma":0.0000044933063,"teacher_disagreement_score":0.797933,"about_ca_system_score_codex":0.00030861105,"about_ca_system_score_gemma":0.00016647676,"threshold_uncertainty_score":0.99984044},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020829508,0.00080266164,0.7948292,0.00077089,0.0030526365,0.0008014617,0.0020146202,0.0036843726,0.19402331],"genre_scores_gemma":[0.416097,0.00056621537,0.013462189,0.004007679,0.0070102643,0.0003574361,0.0039490145,0.0019753785,0.5525748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440855,0.00035120625,0.0010582746,0.0019188668,0.0011342502,0.0011288624],"domain_scores_gemma":[0.9927277,0.0034303053,0.0007996167,0.0024218245,0.00029028315,0.00033027053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001759442,0.0012230424,0.0013574866,0.00049995445,0.00061236374,0.0006175353,0.003512105,0.0009893049,0.00011908038],"category_scores_gemma":[0.0006936364,0.0011329101,0.00073613564,0.00037717394,0.00024328739,0.00013835351,0.0007983749,0.0014138381,0.0016566509],"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.000036374593,0.000048995083,0.0000010893128,0.00008189489,0.00037353174,0.00029162335,0.00007464169,0.0014048334,0.000012386847,0.8442473,0.017916726,0.13551064],"study_design_scores_gemma":[0.0007634566,0.0003058722,0.00018560833,0.00340778,0.00024469206,0.00020184646,0.000026604388,0.035037164,0.00093307334,0.65464497,0.30053464,0.003714316],"about_ca_topic_score_codex":0.00001223117,"about_ca_topic_score_gemma":0.0000049820796,"teacher_disagreement_score":0.781367,"about_ca_system_score_codex":0.00035801806,"about_ca_system_score_gemma":0.00024676087,"threshold_uncertainty_score":0.99912065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059213994,0.00064927695,0.7976982,0.0003865467,0.0019763424,0.00058829226,0.0017738263,0.002435561,0.19448604],"genre_scores_gemma":[0.5126136,0.00041836232,0.017866114,0.0033930829,0.006387855,0.00033288135,0.0024641987,0.0017689727,0.45475495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464625,0.00036258265,0.0009724073,0.0018562552,0.0011182382,0.0010442379],"domain_scores_gemma":[0.9926588,0.0037309127,0.0008131996,0.002170595,0.000306375,0.00032012846],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015282135,0.0011935089,0.0013165579,0.00043092648,0.0005788245,0.00047313923,0.003135434,0.0008819909,0.00009635769],"category_scores_gemma":[0.0005803194,0.0010934965,0.0007163181,0.00036040662,0.00023841481,0.00013706267,0.00076420844,0.0013146271,0.0015589485],"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.00005259784,0.000040978717,3.9286428e-7,0.000044705394,0.00039774954,0.0002301598,0.0000907343,0.0020877745,0.0000055612577,0.82526356,0.0151329925,0.1566528],"study_design_scores_gemma":[0.0006460039,0.0004302511,0.00011522081,0.003759858,0.00023837117,0.00012624318,0.00004856657,0.0563531,0.00073175103,0.7678054,0.16623178,0.0035134407],"about_ca_topic_score_codex":0.000010405909,"about_ca_topic_score_gemma":0.0000038957114,"teacher_disagreement_score":0.77983207,"about_ca_system_score_codex":0.00036115595,"about_ca_system_score_gemma":0.00023536343,"threshold_uncertainty_score":0.99921846},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020543584,0.0005620029,0.81224686,0.0030812519,0.0049356017,0.00066050724,0.00097235036,0.0036682785,0.17385261],"genre_scores_gemma":[0.3060545,0.00033880206,0.0048313504,0.0022355986,0.01955742,0.00018877411,0.0030482463,0.0011907835,0.6625545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955177,0.0002929019,0.0008489322,0.0016759913,0.000873826,0.0007906892],"domain_scores_gemma":[0.99471927,0.0019597788,0.0006853629,0.0021716063,0.00024633307,0.00021765218],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015328607,0.0009131327,0.0009977767,0.00040454045,0.0004966811,0.00046786442,0.0022386438,0.00070643343,0.00018168808],"category_scores_gemma":[0.0008578882,0.000847666,0.0005236988,0.00032204404,0.00016771909,0.00013294657,0.0005001073,0.001077114,0.0019939377],"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.000038215232,0.000030306872,3.806914e-7,0.0000614495,0.00023042459,0.000070536626,0.000050609404,0.0021862749,0.000020693724,0.83681273,0.078243405,0.08225496],"study_design_scores_gemma":[0.00027980606,0.00015387495,0.00006941687,0.0010714934,0.00012328754,0.00008557212,0.000013577287,0.0070667462,0.0008952401,0.38755578,0.6009821,0.001703087],"about_ca_topic_score_codex":0.0000044676904,"about_ca_topic_score_gemma":0.0000025130105,"teacher_disagreement_score":0.8074155,"about_ca_system_score_codex":0.0003150048,"about_ca_system_score_gemma":0.00014675212,"threshold_uncertainty_score":0.9993974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17209387,0.00021134874,0.82006246,0.0036866167,0.0028974644,0.00016045675,0.000008769203,0.0003723598,0.0005066581],"genre_scores_gemma":[0.9863265,0.000017865237,0.011749918,0.0004917335,0.0012565545,0.000004973364,0.0000065069316,0.000017086832,0.00012881946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797535,0.00027137576,0.00043868707,0.0003246615,0.00044160886,0.0005482934],"domain_scores_gemma":[0.9985105,0.00012488611,0.00021794718,0.0007441471,0.00018966178,0.0002129004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012334737,0.00019573803,0.00024664434,0.000119777935,0.0006569856,0.0007182159,0.0017251438,0.000053539356,0.000019003402],"category_scores_gemma":[0.000015336505,0.00012852684,0.00011213214,0.00073778495,0.000085731335,0.00014023352,0.0003464862,0.00037646914,0.00038208297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046798148,0.000501057,0.00051490136,0.000046398545,0.00024943045,0.0015725128,0.005634864,0.37641367,0.00087591883,0.05833282,0.14078766,0.41502398],"study_design_scores_gemma":[0.0007151435,0.00016702,0.0058113164,0.000045905836,0.000006290901,0.0017435038,0.000044063854,0.96972966,0.000058255428,0.00052042585,0.0209432,0.0002151891],"about_ca_topic_score_codex":0.00001302652,"about_ca_topic_score_gemma":0.0000029861699,"teacher_disagreement_score":0.8142327,"about_ca_system_score_codex":0.000037274756,"about_ca_system_score_gemma":0.00014632453,"threshold_uncertainty_score":0.69257724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11066327,0.000021919517,0.8612301,0.00035459702,0.0006429223,0.00028538145,0.00005122841,0.00043730697,0.026313277],"genre_scores_gemma":[0.9876986,0.0000018122785,0.0100851245,0.00014619576,0.000037977676,0.00003702632,0.000023466853,0.0000065058703,0.0019632613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888647,0.00003996025,0.00027439004,0.00032668636,0.00017378725,0.0002987152],"domain_scores_gemma":[0.999251,0.0001151118,0.000046322635,0.00049776863,0.000020870551,0.000068916714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047439837,0.000105946296,0.00015444221,0.00013028618,0.000058728932,0.00012908623,0.0005874853,0.000035288558,0.000021463029],"category_scores_gemma":[0.000081456776,0.00008980924,0.00003206537,0.00094271003,0.000016574542,0.00035021149,0.00024051733,0.00011742935,0.00035410412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003966301,0.00051244523,0.014526959,0.0006789672,0.000058383965,0.0065278457,0.013027646,0.002638698,0.044068366,0.20440677,0.20864294,0.5048713],"study_design_scores_gemma":[0.00028428677,0.000022464563,0.0038527395,0.00010787941,8.004716e-7,0.000016541375,0.00027496644,0.9929125,0.00026185173,0.0004492604,0.0016556206,0.0001610884],"about_ca_topic_score_codex":0.0002470285,"about_ca_topic_score_gemma":0.00034291536,"teacher_disagreement_score":0.9902738,"about_ca_system_score_codex":0.000032322412,"about_ca_system_score_gemma":0.00007409116,"threshold_uncertainty_score":0.455141},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14550127,0.00005696793,0.84959835,0.000088614805,0.0004437124,0.0006398871,0.00018140466,0.001108826,0.0023809483],"genre_scores_gemma":[0.9932768,0.000034507248,0.005610155,0.000024652369,0.000071770766,0.000006512942,0.00019789404,0.00003295311,0.000744805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734735,0.0004294594,0.00035374408,0.0012613495,0.00017649154,0.00043162762],"domain_scores_gemma":[0.9954688,0.00008240324,0.00047427963,0.0033793997,0.00030980166,0.00028534423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005244496,0.0004138508,0.0005224736,0.00017173417,0.00044455467,0.00026546413,0.0025112503,0.00027670665,0.0000054793604],"category_scores_gemma":[0.0000071177546,0.0004204009,0.00014564749,0.0006831628,0.0001821228,0.00050487916,0.0018457505,0.00063023163,0.0002591152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050741604,0.00031140723,0.0021105602,0.0005748828,0.00024828163,0.007191114,0.0007059894,0.3762667,0.000005853497,0.611637,0.00031278882,0.0005847064],"study_design_scores_gemma":[0.0006622715,0.00014201734,0.00094824034,0.00050970603,0.000059691312,0.0002723288,0.0004999136,0.9942287,0.000020546033,0.0013230215,0.0007389074,0.0005946576],"about_ca_topic_score_codex":0.0022517007,"about_ca_topic_score_gemma":0.0010509709,"teacher_disagreement_score":0.84777546,"about_ca_system_score_codex":0.00053839496,"about_ca_system_score_gemma":0.00022714629,"threshold_uncertainty_score":0.99982476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12362738,0.00008487814,0.8718084,0.00045215816,0.0014607693,0.00051759,0.00035147715,0.00015725016,0.001540074],"genre_scores_gemma":[0.9977005,0.00005243112,0.0008006078,0.000055701537,0.00007205886,9.1305395e-7,0.000043516022,0.000012179544,0.0012620973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801564,0.00018863768,0.00031967054,0.0008747038,0.00022364038,0.00037772526],"domain_scores_gemma":[0.99734193,0.000069847,0.0005186702,0.0017097031,0.00025787562,0.00010195193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054850045,0.00028821392,0.000409951,0.0001197182,0.00023636849,0.00013017647,0.0023838994,0.00015516019,0.000015933743],"category_scores_gemma":[0.00001881521,0.00026587362,0.0002271921,0.0008240918,0.00029252752,0.00020914133,0.0026147556,0.00038234898,0.000050270086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022314445,0.00011527289,0.0026279278,0.00027344452,0.00025312093,0.00019052094,0.0008485634,0.39994827,0.00012252702,0.591206,0.00425074,0.00014125477],"study_design_scores_gemma":[0.0004925368,0.00004543545,0.0030516188,0.00033358735,0.000067411675,0.0000049356017,0.00031180133,0.95946026,0.00012291539,0.029317275,0.00634334,0.00044886197],"about_ca_topic_score_codex":0.0020631335,"about_ca_topic_score_gemma":0.00017213714,"teacher_disagreement_score":0.8740731,"about_ca_system_score_codex":0.00021893771,"about_ca_system_score_gemma":0.0002083272,"threshold_uncertainty_score":0.9999793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016395347,0.000118406475,0.8398811,0.0038842815,0.0022660934,0.00049853977,0.00003069678,0.0022719777,0.13465354],"genre_scores_gemma":[0.98424053,0.00001357383,0.0010766373,0.000805814,0.00013160068,0.000030357825,0.000030370615,0.000014445744,0.013656667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980152,0.00007587665,0.00033700254,0.00054589857,0.0005444609,0.00048152034],"domain_scores_gemma":[0.9988811,0.00016225726,0.00009666126,0.0006585307,0.000091050744,0.00011039757],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056305825,0.00018421776,0.00022307954,0.00013063311,0.00036530208,0.0004143695,0.00069567695,0.00008293098,0.000034348883],"category_scores_gemma":[0.000038663413,0.00015373043,0.0000795302,0.0007921399,0.000018866733,0.00053238944,0.0003115319,0.00012392917,0.0012551203],"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.00001850985,0.00008170554,0.00034341923,0.00015374567,0.00004503087,0.00011262678,0.00054368796,0.011978071,0.0012964761,0.6020038,0.37547272,0.007950203],"study_design_scores_gemma":[0.0012108954,0.00028849332,0.0027307593,0.0007013516,0.0000074176955,0.0000335847,0.001048138,0.47440323,0.0012568671,0.001773129,0.5158008,0.0007453226],"about_ca_topic_score_codex":0.00032345904,"about_ca_topic_score_gemma":0.000050313007,"teacher_disagreement_score":0.9678452,"about_ca_system_score_codex":0.00015474694,"about_ca_system_score_gemma":0.00006414857,"threshold_uncertainty_score":0.9995225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07454263,0.00010592908,0.9185564,0.0011542398,0.0027112495,0.00022126612,0.000034557703,0.0009160537,0.0017576689],"genre_scores_gemma":[0.9903199,0.000015083158,0.0067937872,0.00014834756,0.00008537357,0.000043483855,0.000008715587,0.000014323993,0.0025709753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984889,0.000041288542,0.00032076647,0.00044870985,0.00027814816,0.00042217743],"domain_scores_gemma":[0.9985861,0.00016472352,0.00008272111,0.0009784476,0.00009833936,0.00008965893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200895,0.00015305572,0.00020237004,0.00013134064,0.00026495254,0.00028401232,0.0010680543,0.000077903765,0.000043677683],"category_scores_gemma":[0.00008024217,0.00014399822,0.00013705262,0.0010712545,0.000045183362,0.00029381557,0.00010906082,0.00016326574,0.00051531126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029777573,0.00025117208,0.0036019231,0.0001508291,0.0001441437,0.00028406738,0.00147777,0.025257623,0.0023778535,0.009261461,0.017648187,0.9395152],"study_design_scores_gemma":[0.00157991,0.00022231461,0.020166129,0.0002609461,0.000024682091,0.00012315575,0.00015556974,0.65037745,0.0013542258,0.002407763,0.32233986,0.000988024],"about_ca_topic_score_codex":0.000027746088,"about_ca_topic_score_gemma":0.000016721422,"teacher_disagreement_score":0.93852717,"about_ca_system_score_codex":0.00004571556,"about_ca_system_score_gemma":0.000048853308,"threshold_uncertainty_score":0.6623456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74686676,0.011778001,0.1940377,0.011312243,0.005464136,0.0040768078,0.00021138089,0.00041218445,0.025840782],"genre_scores_gemma":[0.9985481,0.00017830459,0.00025582392,0.000008948764,0.00015839223,0.000015094338,0.0000022822876,0.000010674612,0.0008223862],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618065,0.0007001979,0.00096961716,0.00027748346,0.0012150414,0.0006569843],"domain_scores_gemma":[0.99769855,0.00064825284,0.0003187479,0.000315697,0.0007726327,0.00024610473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007110584,0.00013244168,0.00047876523,0.0010033831,0.00019618757,0.00047964387,0.0006620156,0.00009915706,0.0000068013087],"category_scores_gemma":[0.00040403556,0.000103828344,0.000057983063,0.0022519976,0.00016039505,0.0005253053,0.0002908135,0.0005624666,0.00009590949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009934325,0.0011467466,0.047324054,0.0025869368,0.00073150994,0.019702064,0.015312062,0.0049943314,0.24794693,0.22539893,0.38463974,0.04922325],"study_design_scores_gemma":[0.008241971,0.0008883506,0.009367719,0.006420308,0.0000114260165,0.0064392644,0.006126916,0.856345,0.00092281454,0.0005142508,0.10390546,0.00081652583],"about_ca_topic_score_codex":0.00011097229,"about_ca_topic_score_gemma":0.000011301281,"teacher_disagreement_score":0.85135067,"about_ca_system_score_codex":0.00015576131,"about_ca_system_score_gemma":0.000306136,"threshold_uncertainty_score":0.4625217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014016828,0.000031749278,0.9460974,0.0043152557,0.0003254574,0.00026770515,0.00004792476,0.0014098888,0.03348783],"genre_scores_gemma":[0.954398,0.0000037273,0.03793568,0.00057105295,0.00008688077,0.000042156982,0.000022435403,0.000014396596,0.0069257035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873,0.000037761078,0.00017648883,0.00037357784,0.00032037732,0.0003618022],"domain_scores_gemma":[0.99868995,0.000037496888,0.00005142432,0.0010348115,0.00007658777,0.00010975741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021710922,0.00013256095,0.0001812,0.000076591416,0.00013024532,0.000181121,0.0013145398,0.000044944187,0.000028887205],"category_scores_gemma":[0.000015846857,0.000095661606,0.0000411408,0.00094842707,0.000067028814,0.0002846549,0.0003694609,0.0001019471,0.00048314425],"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.000011929026,0.000064501546,0.0015790437,0.000032628082,0.00003689977,0.00014845526,0.00027006317,0.00008455364,0.00014012604,0.8593181,0.12223535,0.016078388],"study_design_scores_gemma":[0.0030782137,0.0003974075,0.07044515,0.00012880798,0.000009807944,0.00020211971,0.0003305567,0.6682644,0.0004695831,0.015666708,0.239992,0.0010152439],"about_ca_topic_score_codex":0.0006647481,"about_ca_topic_score_gemma":0.00050857296,"teacher_disagreement_score":0.9403811,"about_ca_system_score_codex":0.00002648697,"about_ca_system_score_gemma":0.00006076852,"threshold_uncertainty_score":0.6210003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02205762,0.00008147505,0.9507783,0.003957264,0.0021772285,0.00057740294,0.000050009574,0.0012036834,0.019117003],"genre_scores_gemma":[0.8864298,0.0000354744,0.026393585,0.0008722472,0.00035275155,0.00015858754,0.000034911474,0.000024063002,0.08569858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998803,0.000024319772,0.00022593369,0.00036931437,0.00020940637,0.00036800987],"domain_scores_gemma":[0.9991594,0.00024049227,0.00004957684,0.00041002384,0.000053852713,0.000086636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039190988,0.00011229764,0.00016491726,0.00004859328,0.00018628368,0.00016815748,0.0005843628,0.00006762618,0.00004618356],"category_scores_gemma":[0.00007481079,0.000094514544,0.00009322169,0.00063282636,0.000012186513,0.00035882115,0.00013944847,0.00006256605,0.00040233086],"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.000029560993,0.00009658895,0.00018610529,0.000080522346,0.000028732666,0.000026566719,0.00088327803,0.00048063652,0.0032820185,0.115156904,0.7156676,0.16408151],"study_design_scores_gemma":[0.000942235,0.000113224785,0.0019871693,0.00004624232,0.0000032115356,0.000011725406,0.00009705875,0.24755949,0.0012979278,0.00728258,0.74033517,0.0003239851],"about_ca_topic_score_codex":0.000034526714,"about_ca_topic_score_gemma":0.000016194315,"teacher_disagreement_score":0.9243847,"about_ca_system_score_codex":0.000029278846,"about_ca_system_score_gemma":0.000045555207,"threshold_uncertainty_score":0.51712835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06693889,0.00005747913,0.9256414,0.00044396368,0.00039384508,0.00012914064,0.00003567566,0.0007166338,0.005642973],"genre_scores_gemma":[0.99206877,0.0000051506577,0.0070192274,0.000088776025,0.000056152683,0.0000100997195,0.00004339778,0.0000068127724,0.0007016181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.000038624024,0.00018160997,0.00032171272,0.00029682947,0.00023046305],"domain_scores_gemma":[0.99940246,0.00006386928,0.000053530814,0.00033312888,0.00008598623,0.000061024424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948896,0.00009255998,0.00012701318,0.00006209334,0.0001437792,0.00027574407,0.00034750748,0.000039126895,0.000033251996],"category_scores_gemma":[0.00003322252,0.000081314196,0.000036159778,0.00067675026,0.000023429036,0.00012531693,0.00013535292,0.000049423317,0.0003979209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003876253,0.00021322793,0.0032565387,0.000103065,0.00017004731,0.00019118705,0.007910306,0.08572123,0.0049967305,0.595325,0.053038504,0.2490354],"study_design_scores_gemma":[0.00031881756,0.000027684611,0.0055800425,0.00005986855,0.0000023330797,0.0000015341705,0.00010783904,0.9796913,0.0009428216,0.0014276305,0.011666143,0.0001739719],"about_ca_topic_score_codex":0.00005116588,"about_ca_topic_score_gemma":0.0000058325227,"teacher_disagreement_score":0.9251299,"about_ca_system_score_codex":0.00006720573,"about_ca_system_score_gemma":0.000082013474,"threshold_uncertainty_score":0.5114601},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021315923,0.00010644036,0.012749305,0.00029330922,0.0034777422,0.00014737074,0.000058548787,0.0007256382,0.9824395],"genre_scores_gemma":[0.001386527,0.000042673255,0.0003057915,0.000084678795,0.00028439824,0.0000022066272,0.00003814859,0.000029203158,0.9978264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985568,0.000007159368,0.0002716954,0.0005250898,0.00039596128,0.00024328798],"domain_scores_gemma":[0.99874884,0.00006941734,0.00011902955,0.0008601219,0.00009259245,0.000110003704],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014551346,0.0002517231,0.0003137116,0.00007849538,0.000061057006,0.00016990678,0.0010008274,0.00025682847,0.00014479624],"category_scores_gemma":[0.0000110469,0.00022956464,0.00016213575,0.000064582775,0.000030636016,0.0001409972,0.00033349113,0.00026039814,0.005540334],"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.0000037555767,0.0000031790642,3.2709335e-7,0.0000156365,0.000032362466,0.00006433429,0.000024683017,0.0000038844723,7.7838223e-7,0.9514083,0.0455548,0.00288794],"study_design_scores_gemma":[0.0003796999,0.000047095527,0.0000060359575,0.000077433324,0.0000076946635,0.0000053808426,0.0000027423503,0.004093943,0.000006695687,0.04089566,0.95410705,0.0003705668],"about_ca_topic_score_codex":0.00005980406,"about_ca_topic_score_gemma":0.00005383096,"teacher_disagreement_score":0.9105127,"about_ca_system_score_codex":0.00007191747,"about_ca_system_score_gemma":0.00006391824,"threshold_uncertainty_score":0.99523395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000786763,0.0004931384,0.98050386,0.00037254073,0.004906495,0.00043151155,0.000022466918,0.000530818,0.012660507],"genre_scores_gemma":[0.8965474,0.00013509787,0.09879192,0.00095967186,0.0006335214,0.000033479875,0.000024267356,0.00009451548,0.002780168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443907,0.00004355604,0.000924486,0.0021184932,0.0014326276,0.0010417555],"domain_scores_gemma":[0.99648464,0.0003975473,0.00041479894,0.0019829914,0.00041461634,0.00030538204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001107043,0.00070310215,0.00095870905,0.000701093,0.00040019336,0.00076030643,0.00454213,0.00039249018,0.00001306075],"category_scores_gemma":[0.00006814542,0.000681376,0.00020040039,0.0010602184,0.00082569296,0.001027531,0.0018339137,0.00095152116,0.0002908313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000788306,0.000045265737,0.00023233362,0.00015860445,0.00004225029,0.0005964892,0.0012782139,0.2858585,0.000089110144,0.57502335,0.0003015547,0.13636644],"study_design_scores_gemma":[0.00022920922,0.00006160027,0.00009698274,0.00056898716,0.00000634822,0.000077287004,3.2894266e-7,0.82009184,0.000104323546,0.17723452,0.00081905664,0.0007095154],"about_ca_topic_score_codex":0.000115295785,"about_ca_topic_score_gemma":0.0001626454,"teacher_disagreement_score":0.8964687,"about_ca_system_score_codex":0.00031522103,"about_ca_system_score_gemma":0.0008000342,"threshold_uncertainty_score":0.99956375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36198908,0.00039247933,0.63605356,0.00017257292,0.0002859803,0.00028930185,0.000019335968,0.00028561667,0.00051205256],"genre_scores_gemma":[0.9982507,0.0000120514715,0.0016079211,0.00002325305,0.000029776353,0.00003622165,0.000024558434,0.000004770931,0.000010750941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993789,0.0000047662606,0.00015591389,0.00018786608,0.00013083903,0.00014172295],"domain_scores_gemma":[0.9998013,0.000058541103,0.000026136358,0.000060495106,0.000012076868,0.00004145697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011974035,0.00007852144,0.000099610996,0.00010720411,0.000038491653,0.000111408095,0.000074506344,0.000024090208,5.760573e-7],"category_scores_gemma":[0.0000017548016,0.000082046674,0.000008519862,0.0003281804,0.000005929257,0.00013285186,0.000057597983,0.000046490863,0.0000066116404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012473704,0.0000056402505,0.00050814415,0.00005684618,0.000009334688,0.0000070545607,0.00034621396,0.31272534,0.000443424,0.6765723,0.00016030169,0.009164138],"study_design_scores_gemma":[0.0003942465,0.000007534785,0.053616676,0.000019994055,9.629863e-7,0.000009523207,0.0000932002,0.9427287,0.000015355054,0.0015320044,0.001468212,0.000113576956],"about_ca_topic_score_codex":0.000030144847,"about_ca_topic_score_gemma":0.0000012561218,"teacher_disagreement_score":0.6750403,"about_ca_system_score_codex":0.000016598839,"about_ca_system_score_gemma":0.000011790216,"threshold_uncertainty_score":0.3345766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019884443,0.000036353238,0.9195318,0.0024427406,0.00028881567,0.00024554148,0.0000061453206,0.0006252945,0.056938846],"genre_scores_gemma":[0.9970386,0.0000046263763,0.0017510286,0.00014496809,0.000015110634,0.000013538705,0.000003849407,0.000005433556,0.0010228516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904233,0.000027243683,0.000168808,0.00027616683,0.00021542152,0.00027002374],"domain_scores_gemma":[0.9995027,0.000050827904,0.000038073336,0.0003244398,0.000025720681,0.00005819448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023740726,0.00009346626,0.00013791071,0.00012142253,0.00007077157,0.00012366417,0.00037930245,0.000043072534,0.00000970368],"category_scores_gemma":[0.000010721496,0.0000702091,0.00002247428,0.0014183786,0.000025792338,0.00029427925,0.00009397264,0.00009166933,0.00011488863],"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.000008523255,0.00005045463,0.024323096,0.00004014025,0.000018644265,0.00036799835,0.0009834742,0.0009804587,0.00013005882,0.9502069,0.020804536,0.0020857563],"study_design_scores_gemma":[0.006825293,0.00067636784,0.101451695,0.0012738853,0.000016218835,0.00030586545,0.010058137,0.71928406,0.000691661,0.11285084,0.044078443,0.0024875363],"about_ca_topic_score_codex":0.00009303458,"about_ca_topic_score_gemma":0.00038085092,"teacher_disagreement_score":0.97715414,"about_ca_system_score_codex":0.000090950336,"about_ca_system_score_gemma":0.00006192491,"threshold_uncertainty_score":0.2863044},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005664561,0.000017874752,0.9896655,0.00023794353,0.000141986,0.00028648664,0.0000049837977,0.0012836241,0.0026970352],"genre_scores_gemma":[0.99624497,5.182579e-7,0.0033954892,0.000024669638,0.000034274028,0.00006252166,0.000011885674,0.000010153454,0.00021553716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988661,0.00003571473,0.00018996137,0.00035744757,0.0003089611,0.00024186091],"domain_scores_gemma":[0.99947554,0.000026399475,0.000092099195,0.00016680075,0.00017721651,0.00006192595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016031365,0.00012432135,0.00015287478,0.00010005766,0.00023777029,0.00027361864,0.00024101997,0.000042509684,8.810672e-7],"category_scores_gemma":[0.0000018838132,0.00009378815,0.000028403294,0.0012381726,0.0000173778,0.0006931411,0.000018566298,0.00008509526,0.00005055919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010905716,0.00025753194,0.0015899685,0.0025604405,0.00028970008,0.0004111364,0.021128057,0.19546121,0.00081811793,0.045747362,0.0028730652,0.72875434],"study_design_scores_gemma":[0.00034462818,0.000047017318,0.0012970781,0.0002544258,0.0000053160943,0.000060245107,0.0019596617,0.9951765,0.0003600033,0.000025253012,0.00029522332,0.00017467508],"about_ca_topic_score_codex":0.00010002225,"about_ca_topic_score_gemma":0.000025670057,"teacher_disagreement_score":0.9905804,"about_ca_system_score_codex":0.0000950964,"about_ca_system_score_gemma":0.000104179104,"threshold_uncertainty_score":0.38245696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20262547,0.00006768809,0.79388195,0.0020254164,0.00047232944,0.00013331405,0.000018985846,0.0007323583,0.000042465042],"genre_scores_gemma":[0.99551755,0.00000132338,0.0025660477,0.0015013977,0.00021770335,0.00002753566,0.00003298612,0.000023677294,0.00011174868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979284,0.00006434139,0.00035987192,0.00055012695,0.00048304058,0.00061423116],"domain_scores_gemma":[0.9992532,0.00007127076,0.00018404477,0.00023789637,0.00013083954,0.00012272705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036942674,0.00022174309,0.0002348818,0.00009601701,0.0004518898,0.0006410052,0.0006965165,0.000082218656,0.0000019158213],"category_scores_gemma":[0.000007188461,0.00021692198,0.00008790947,0.0012917506,0.00008444044,0.0005166873,0.00007830192,0.00018908374,0.00020537437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040822033,0.00008961198,0.001985066,0.0003852856,0.000070395625,0.0008698949,0.0045558256,0.36826873,0.08005652,0.000047143392,0.07552073,0.46810997],"study_design_scores_gemma":[0.00057872874,0.000035056033,0.001584954,0.00026105726,0.0000070028586,0.0000660145,0.00018409935,0.99157465,0.0029637462,0.0001353571,0.002129648,0.00047970068],"about_ca_topic_score_codex":0.000034926637,"about_ca_topic_score_gemma":0.000006106635,"teacher_disagreement_score":0.7928921,"about_ca_system_score_codex":0.000067081,"about_ca_system_score_gemma":0.00008177809,"threshold_uncertainty_score":0.88458216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087355607,0.000017793489,0.9917027,0.0032128291,0.00045455954,0.00034687686,0.000049427057,0.0005158708,0.0028264069],"genre_scores_gemma":[0.9105299,0.000031776093,0.057541892,0.0006582319,0.00048528414,0.00021983351,0.0011359304,0.00002160408,0.02937555],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897444,0.000030443236,0.00020194567,0.00038785845,0.00016547495,0.00023981612],"domain_scores_gemma":[0.9989489,0.00005534898,0.000047514965,0.0007723244,0.00011849744,0.000057448942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039283876,0.0000821619,0.000116752555,0.0001130491,0.00025205474,0.0004077153,0.00071333745,0.00005400468,0.0000068367585],"category_scores_gemma":[0.00011759228,0.00007160944,0.000027177563,0.0016178711,0.000009586817,0.0009196517,0.00020769566,0.000037593785,0.00013757752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012751511,0.000107165644,0.0005109439,0.00006398764,0.000038836803,0.0000047413264,0.00017120759,0.0018079815,0.004789332,0.09008748,0.72722656,0.175179],"study_design_scores_gemma":[0.0003404752,0.000037525497,0.004936995,0.00001123574,0.000002085046,0.0000070382125,0.000022965638,0.9014355,0.0005654671,0.00031363,0.092214964,0.000112124326],"about_ca_topic_score_codex":0.00042312307,"about_ca_topic_score_gemma":0.00014295615,"teacher_disagreement_score":0.93416077,"about_ca_system_score_codex":0.00004862916,"about_ca_system_score_gemma":0.00016177783,"threshold_uncertainty_score":0.39316082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053631242,0.0001342919,0.9340164,0.0071733287,0.002876264,0.00015650391,0.0000031095717,0.0006036189,0.0014052516],"genre_scores_gemma":[0.9908884,0.0000033814956,0.00548224,0.0029487098,0.0005282141,0.0000015971409,0.000002796505,0.000016058968,0.00012858836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799436,0.00013528748,0.0004313715,0.00035449883,0.00058387785,0.0005006188],"domain_scores_gemma":[0.9987045,0.00022169121,0.0002559997,0.00041312826,0.00020703657,0.00019766933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096175,0.00017363887,0.00023608454,0.00021719061,0.00052681036,0.0005384752,0.0008262205,0.000060765367,0.000008602512],"category_scores_gemma":[0.00011261975,0.00014308537,0.00014307044,0.0009983293,0.000022096567,0.00022639545,0.00013569994,0.00043034845,0.000296704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003783599,0.00022360038,0.0013855738,0.00010617467,0.000076159624,0.0025330016,0.0011351208,0.26728746,0.0017994936,0.023083689,0.33644977,0.36588213],"study_design_scores_gemma":[0.0005743488,0.00015201136,0.0029121991,0.00041457659,0.0000025062568,0.00018023692,0.000045375622,0.9120578,0.00027364533,0.00075982034,0.082384944,0.00024253431],"about_ca_topic_score_codex":0.000004506285,"about_ca_topic_score_gemma":8.4051135e-7,"teacher_disagreement_score":0.9372572,"about_ca_system_score_codex":0.000062577645,"about_ca_system_score_gemma":0.00011266796,"threshold_uncertainty_score":0.5834852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014920707,0.00020918463,0.9805153,0.0005737616,0.000668335,0.0003185211,0.000014619551,0.0006408012,0.0021387865],"genre_scores_gemma":[0.9926454,0.000023764474,0.00233158,0.00007750154,0.00008563372,0.00009893744,0.000007685941,0.000006639725,0.0047229035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989689,0.000023131382,0.00019908918,0.00032258764,0.00021223951,0.00027406262],"domain_scores_gemma":[0.99928486,0.000091069815,0.000048342838,0.00042076487,0.00008829303,0.00006665849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035956496,0.00008421233,0.00012744848,0.00006331499,0.00014421342,0.0002083876,0.0006393899,0.000047765076,0.0000010946834],"category_scores_gemma":[0.00003442628,0.0000674694,0.00004320624,0.00047880312,0.00001620788,0.00030600172,0.0001421077,0.00003808387,0.00015702295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015010846,0.00004879686,0.00044115153,0.00020167047,0.000016714544,0.000021166465,0.00078085717,0.022173028,0.010122632,0.6878933,0.16265295,0.11563273],"study_design_scores_gemma":[0.00016364052,0.000028501006,0.00073811796,0.000033391352,8.041645e-7,0.0000044798994,0.00004986849,0.9612868,0.00027923723,0.00276424,0.034544636,0.00010632919],"about_ca_topic_score_codex":0.000053680873,"about_ca_topic_score_gemma":0.000003971121,"teacher_disagreement_score":0.9781837,"about_ca_system_score_codex":0.000019366062,"about_ca_system_score_gemma":0.000029863682,"threshold_uncertainty_score":0.27513224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039240597,0.000011827713,0.9781887,0.00032224628,0.00030266424,0.016621795,0.00005310523,0.00039288882,0.00018272431],"genre_scores_gemma":[0.96515733,0.000005937027,0.014188867,0.0001954806,0.00016400305,0.01936973,0.000005817042,0.000040983432,0.0008718754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983443,0.000048678365,0.00032512634,0.0005989703,0.00021616819,0.00046673082],"domain_scores_gemma":[0.9991817,0.00017279724,0.00009679518,0.00029830562,0.000096970674,0.00015347061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356764,0.00023497391,0.0002784999,0.00016768528,0.000730994,0.0003297583,0.00029142483,0.00011281786,0.000004235181],"category_scores_gemma":[0.000004904276,0.00021758876,0.00008391387,0.00056033075,0.0000403157,0.00022678947,0.000012344815,0.00023048316,0.00001192714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001420502,0.00041679194,0.00012616804,0.0010739772,0.00019025672,0.000105725914,0.0059489277,0.43805707,0.0011242582,0.0052331323,0.004514282,0.54306734],"study_design_scores_gemma":[0.0014591207,0.00021585917,0.00009203055,0.00019283788,0.000009839338,0.00007388339,0.00023979595,0.9886672,0.0009486565,0.0001713534,0.0076321987,0.00029726294],"about_ca_topic_score_codex":0.000034154804,"about_ca_topic_score_gemma":0.000055115317,"teacher_disagreement_score":0.9639998,"about_ca_system_score_codex":0.000022578895,"about_ca_system_score_gemma":0.000048328926,"threshold_uncertainty_score":0.88730127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055243694,0.000039764345,0.75608605,0.00326269,0.0013021118,0.00009109233,0.000005220669,0.0017661289,0.2319226],"genre_scores_gemma":[0.98253816,0.000004785928,0.0017342278,0.00021879897,0.000060065428,0.000009628528,0.00000339161,0.0000031997047,0.015427753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994241,0.000012879822,0.000092860144,0.00016212038,0.00013765054,0.00017038487],"domain_scores_gemma":[0.9995666,0.00002036178,0.00001595271,0.00033074402,0.000019278248,0.00004706136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016007716,0.00004759064,0.000067690744,0.000041595522,0.00005058222,0.000092778835,0.00048055657,0.000021096052,0.000047463316],"category_scores_gemma":[0.0000071768272,0.000037774484,0.000029064964,0.00062843924,0.0000075020466,0.00019819142,0.00012102157,0.000033614535,0.0025846078],"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":[4.6372585e-7,0.000015312591,0.0005134068,0.000010492196,0.00000789493,0.00006520017,0.00016372204,0.000082501865,0.000401307,0.7262611,0.24000369,0.03247492],"study_design_scores_gemma":[0.0003242242,0.000026434815,0.026263976,0.000017196431,9.554155e-7,0.000015319514,0.000054695294,0.15337215,0.0007057418,0.005258845,0.81369644,0.00026398973],"about_ca_topic_score_codex":0.000013413688,"about_ca_topic_score_gemma":0.0000019058624,"teacher_disagreement_score":0.97701377,"about_ca_system_score_codex":0.0000064354117,"about_ca_system_score_gemma":0.000010865304,"threshold_uncertainty_score":0.998192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22891277,0.00015957499,0.60800046,0.008217063,0.0034837453,0.0005501736,0.00010485187,0.004492333,0.14607903],"genre_scores_gemma":[0.99029577,0.0000043452033,0.0027641705,0.00020425081,0.000060099217,0.000011536707,0.00000833613,0.0000056198755,0.006645899],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990186,0.00002789544,0.00017628074,0.00028387015,0.00019349394,0.00029984055],"domain_scores_gemma":[0.99928623,0.000095966534,0.000037722584,0.00043797697,0.000047318943,0.00009476956],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015605037,0.000091133945,0.00011866382,0.00005032291,0.00009772992,0.0001225707,0.00046112295,0.00004361026,0.000023002629],"category_scores_gemma":[0.00003851079,0.00007817595,0.00005054983,0.0005456069,0.000024904835,0.00009932925,0.0001671924,0.00006401298,0.002057525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013434803,0.00019496026,0.012458,0.00007466526,0.000070886075,0.00048777036,0.0015962974,0.0052834144,0.0056281695,0.2606297,0.5850534,0.12850933],"study_design_scores_gemma":[0.0009025831,0.00003403107,0.021228265,0.00003150508,0.000002133167,0.000040231775,0.00025899318,0.82468885,0.001638278,0.0012987255,0.14952926,0.00034711778],"about_ca_topic_score_codex":0.00009525618,"about_ca_topic_score_gemma":0.000025135634,"teacher_disagreement_score":0.81940544,"about_ca_system_score_codex":0.00001394091,"about_ca_system_score_gemma":0.000028381066,"threshold_uncertainty_score":0.9987195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00859613,0.00028334005,0.9880867,0.00023880562,0.00085895165,0.0005148057,0.00001381748,0.0005184416,0.00088903133],"genre_scores_gemma":[0.98623526,0.0000316169,0.012201022,0.00006628166,0.00007271773,0.00009465301,0.000058881258,0.000010781851,0.00122878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989153,0.000051679635,0.00024238588,0.00030841012,0.00014822016,0.0003340019],"domain_scores_gemma":[0.9993874,0.00016736916,0.000070933,0.00018982937,0.00008762302,0.00009683309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047480306,0.00010495193,0.00019095263,0.00005248484,0.00014433842,0.00034369386,0.0002352626,0.000054094442,0.000001907249],"category_scores_gemma":[0.000017211303,0.000090014255,0.000037483263,0.00045185522,0.000013397457,0.00027507023,0.000069899885,0.00003478227,0.000046605022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007229009,0.000102692415,0.0010987339,0.0005745406,0.00015694374,0.00005150364,0.0011787021,0.14759845,0.0013015723,0.3807796,0.34049112,0.12659386],"study_design_scores_gemma":[0.0007563103,0.000024918358,0.00027187832,0.000029079361,0.0000034157486,0.000011671745,0.000077327175,0.97255546,0.00004623435,0.00089086173,0.025207799,0.00012502368],"about_ca_topic_score_codex":0.000052046584,"about_ca_topic_score_gemma":0.000008202108,"teacher_disagreement_score":0.97763914,"about_ca_system_score_codex":0.000017041599,"about_ca_system_score_gemma":0.00002558032,"threshold_uncertainty_score":0.36706746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8896994,0.00078139844,0.0066910577,0.09688614,0.0048608324,0.00012182018,0.00005072241,0.00003367969,0.00087496475],"genre_scores_gemma":[0.9965717,0.000023426643,0.002860043,0.00008902613,0.00014534479,3.5761076e-7,2.0083445e-7,0.000003020657,0.0003068507],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9990085,0.00011960335,0.0003241227,0.00006844982,0.000349067,0.00013028669],"domain_scores_gemma":[0.99774975,0.00041540537,0.0004933455,0.0011375719,0.00016279316,0.000041160107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068417174,0.000057192865,0.000159833,0.000020733572,0.00014517631,0.000072186966,0.0034279553,0.0000241651,0.0000026219273],"category_scores_gemma":[0.000669977,0.000027524871,0.00013664282,0.00033902618,0.00012742686,0.000059499114,0.0006576889,0.00015589519,0.000019420628],"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.0000786095,0.000090138106,0.008501743,0.000024773744,0.0002868604,0.00009225604,0.0019510569,0.00142664,0.011303534,0.06545427,0.89944065,0.01134949],"study_design_scores_gemma":[0.0014906413,0.00015581338,0.40632161,0.00038455092,0.000038431634,0.00023006911,0.0007516188,0.027754253,0.007217023,0.35183313,0.20356956,0.00025325874],"about_ca_topic_score_codex":0.00006634912,"about_ca_topic_score_gemma":0.000018391205,"teacher_disagreement_score":0.69587106,"about_ca_system_score_codex":0.000017958422,"about_ca_system_score_gemma":0.00006797592,"threshold_uncertainty_score":0.6370051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51120436,0.00079087453,0.4757978,0.0015638375,0.00061252044,0.00059184356,0.0001814908,0.00058060826,0.008676683],"genre_scores_gemma":[0.99705297,0.0004662576,0.00041642974,0.000055758825,0.00002450231,0.0000020202392,0.000041225096,0.000008622689,0.0019321959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893457,0.00010294619,0.00013145605,0.0006125675,0.000060873335,0.00015759589],"domain_scores_gemma":[0.9985471,0.00016045693,0.00012444107,0.0009925909,0.00007157018,0.000103857456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018312363,0.000175663,0.00021670522,0.00011298224,0.00024048475,0.00021191263,0.0007462336,0.0001518809,0.0000051560087],"category_scores_gemma":[0.000018004326,0.00019268719,0.000047744266,0.0002531621,0.00007363761,0.00020580803,0.0012135245,0.0002903493,0.00005270377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017960296,0.00009035985,0.0019209275,0.00016405887,0.00013736913,0.00014899945,0.0010282332,0.08900265,0.000008348637,0.8971041,0.009002549,0.0013744861],"study_design_scores_gemma":[0.00069012423,0.00006883957,0.008092175,0.00030822065,0.00004206472,0.000012366026,0.00013942942,0.91630685,0.000014127381,0.06963555,0.0041639996,0.00052625744],"about_ca_topic_score_codex":0.0001389964,"about_ca_topic_score_gemma":0.00017800897,"teacher_disagreement_score":0.8274685,"about_ca_system_score_codex":0.00004191203,"about_ca_system_score_gemma":0.000056727964,"threshold_uncertainty_score":0.7857555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0816658,0.00085521914,0.8265824,0.03008797,0.0041977954,0.010613231,0.0021264395,0.0018902493,0.04198095],"genre_scores_gemma":[0.5243008,0.00012243274,0.47273642,0.00016579397,0.00010969408,0.00013821851,0.00008767308,0.000040886243,0.002298032],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833304,0.0000054546476,0.00039081846,0.0005136287,0.00048233525,0.00027472884],"domain_scores_gemma":[0.99742824,0.000090761154,0.00039221643,0.0018971567,0.00015350398,0.000038145416],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009883579,0.00015311695,0.0002703883,0.00011227769,0.00011361369,0.00012448031,0.010728033,0.0000401712,0.0000023797447],"category_scores_gemma":[0.00029134986,0.00011564949,0.00007904076,0.0007856054,0.000051639996,0.0006002194,0.0066412683,0.00007752754,0.0000061682176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000352623,0.0006211754,0.0009703023,0.008269079,0.0011512956,0.000009215238,0.0008133448,0.09670835,0.001968636,0.25616768,0.554125,0.0788433],"study_design_scores_gemma":[0.00452925,0.00030122566,0.0035355294,0.0033275126,0.00026617065,0.0000048960746,0.0013825806,0.9422029,0.005854471,0.017294,0.020493472,0.00080796273],"about_ca_topic_score_codex":0.000004858656,"about_ca_topic_score_gemma":1.1440891e-7,"teacher_disagreement_score":0.84549457,"about_ca_system_score_codex":0.000018789748,"about_ca_system_score_gemma":0.000010909913,"threshold_uncertainty_score":0.9946244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066351728,0.000270717,0.99018806,0.00026940816,0.0008631071,0.0006346377,0.00048451533,0.00051572063,0.00013866331],"genre_scores_gemma":[0.9987765,0.00019496036,0.00009359588,0.00004265857,0.000053623862,0.00026317989,0.00023413419,0.000015126491,0.0003262472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806005,0.00012768534,0.0005201355,0.00057959417,0.00032232743,0.0003902137],"domain_scores_gemma":[0.9990051,0.00009552741,0.00016329858,0.00039195662,0.000123458,0.00022069644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031948855,0.00026573366,0.00035542424,0.0001495899,0.0004428965,0.00037156133,0.00024359634,0.00015428431,0.0000041006547],"category_scores_gemma":[0.0000037328105,0.00024925027,0.00006645622,0.00085834804,0.00006496891,0.00050950266,0.000006798541,0.00017031001,0.000071261304],"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.00004042145,0.00018642342,0.00016783774,0.0004049703,0.000106111074,0.000024570008,0.0005495203,0.9274414,0.0014054279,0.007930898,0.008903425,0.05283898],"study_design_scores_gemma":[0.0009860152,0.00009190973,0.0011217921,0.00008880684,0.000022139044,0.000062166364,0.00028618137,0.9898565,0.00014481958,0.0002596672,0.006725243,0.00035477287],"about_ca_topic_score_codex":0.00023191379,"about_ca_topic_score_gemma":0.000025060212,"teacher_disagreement_score":0.9921413,"about_ca_system_score_codex":0.00005484483,"about_ca_system_score_gemma":0.00003316518,"threshold_uncertainty_score":0.99999595},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018549126,0.9890876,0.006781346,0.0004924064,0.0011967081,0.0016583663,0.00020775567,0.00025582,0.0003014793],"genre_scores_gemma":[0.00010490135,0.9940837,0.004954146,0.00032574293,0.00018970914,0.00003413461,0.00019893092,0.000063871346,0.000044857014],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98477,0.009380142,0.0028865037,0.0012121202,0.00092721096,0.0008240521],"domain_scores_gemma":[0.9834173,0.010753781,0.0020408654,0.0032294346,0.0004529886,0.00010563935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013773912,0.0007865305,0.00383845,0.0002977974,0.00021739153,0.00017491358,0.004896742,0.00030233205,0.0000020191937],"category_scores_gemma":[0.0027406437,0.00056286156,0.0007321595,0.003294718,0.0001938571,0.00004784817,0.0014840296,0.0011843016,0.00009714063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.817344e-7,0.000068584006,0.000024217485,0.08705558,0.00015370181,0.0003666502,0.00022217642,0.000015059666,1.747146e-7,0.0007460463,0.008065127,0.9032821],"study_design_scores_gemma":[0.00032917198,0.000051984447,0.00035889208,0.23537138,0.00013145494,0.00058357016,0.00003872391,0.002921162,1.6741042e-7,0.00006520653,0.75945,0.00069828914],"about_ca_topic_score_codex":0.000686554,"about_ca_topic_score_gemma":0.00002789323,"teacher_disagreement_score":0.90258384,"about_ca_system_score_codex":0.000066864064,"about_ca_system_score_gemma":0.0005231874,"threshold_uncertainty_score":0.9996823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8488408,0.03335357,0.03921856,0.03875957,0.011335555,0.00710838,0.0003620638,0.0043129427,0.01670861],"genre_scores_gemma":[0.98331934,0.000011858294,0.015507132,0.000074186166,0.00015720588,0.00013459945,0.0000016369609,0.000012763975,0.0007813046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988235,0.0000049185483,0.00023348449,0.00035460707,0.00029617798,0.00028726863],"domain_scores_gemma":[0.99920136,0.0001276343,0.00011370994,0.0003570908,0.00015554944,0.000044670818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041817687,0.00014286298,0.00017179547,0.000058037,0.000103511054,0.0004118473,0.002400987,0.00005595168,0.0000027571896],"category_scores_gemma":[0.0005170365,0.00008933767,0.00013831966,0.00040740537,0.00007666776,0.00033141248,0.00043404827,0.00012455329,0.000007119602],"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.000013936852,0.0001016535,0.0012583664,0.0013885924,0.000083327875,0.0000039270135,0.0028814503,0.0000032852656,0.00726796,0.43816113,0.023198875,0.5256375],"study_design_scores_gemma":[0.00138216,0.0016632623,0.0016631433,0.006252382,0.00016135546,0.00012645636,0.004098448,0.0116428,0.1512585,0.048373654,0.77188903,0.0014887857],"about_ca_topic_score_codex":0.000015433572,"about_ca_topic_score_gemma":0.000001042995,"teacher_disagreement_score":0.7486902,"about_ca_system_score_codex":0.000020950029,"about_ca_system_score_gemma":0.00003514593,"threshold_uncertainty_score":0.44616714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4750002,0.002035048,0.517116,0.0004928976,0.00086689135,0.0003935305,0.000030845702,0.00027565524,0.0037889297],"genre_scores_gemma":[0.9973507,0.0005193386,0.0011764338,0.00002498665,0.00003055441,0.0000013578153,0.000034649478,0.000011061219,0.00085092266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998581,0.000105715204,0.0002304182,0.0007970706,0.000077064404,0.00020874885],"domain_scores_gemma":[0.9983866,0.000049220784,0.00015593231,0.0012244063,0.00007107007,0.00011274846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000257787,0.0002153453,0.00024323187,0.0002563509,0.00009358627,0.0003087867,0.0010457584,0.00021835532,0.000005664105],"category_scores_gemma":[0.000011010532,0.000255366,0.00008647634,0.00070086605,0.000058506146,0.00031233518,0.0012170877,0.00054561964,0.000035455974],"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.000028581744,0.000112955364,0.0033448983,0.00025108925,0.000093055794,0.00020077014,0.0014502013,0.0268224,0.00009628033,0.9483477,0.001716033,0.017536076],"study_design_scores_gemma":[0.0008881678,0.00006151541,0.014008781,0.001158765,0.000072452895,0.000010952237,0.00027648627,0.69950396,0.000061383085,0.27561456,0.007435035,0.00090792775],"about_ca_topic_score_codex":0.000861999,"about_ca_topic_score_gemma":0.0004959313,"teacher_disagreement_score":0.67273307,"about_ca_system_score_codex":0.0001304431,"about_ca_system_score_gemma":0.00016608664,"threshold_uncertainty_score":0.99998987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023466917,0.000029355768,0.98636585,0.0012832958,0.000302169,0.00067453453,0.0019683535,0.0010639861,0.0059657837],"genre_scores_gemma":[0.9637984,0.000009937235,0.030616116,0.0003214431,0.000072534676,0.0003332836,0.0020192042,0.000018119194,0.0028109755],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977261,0.00006402433,0.00044083066,0.00076330634,0.0005014405,0.0005042917],"domain_scores_gemma":[0.99744797,0.0000655396,0.00008048958,0.002011201,0.00017839564,0.000216387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000595258,0.00020038281,0.00023666861,0.00023366771,0.00034796435,0.0003150975,0.0019500921,0.000088503206,0.0000040881614],"category_scores_gemma":[0.00016253172,0.00017411851,0.0000683887,0.002679697,0.000032386823,0.0014829942,0.0010806675,0.0001637281,0.0003505084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002625038,0.00029899666,0.00021934493,0.000046354675,0.00008647577,0.000008538565,0.0024493805,0.39651456,0.0001295989,0.050334964,0.54726434,0.0026211608],"study_design_scores_gemma":[0.00026901523,0.000050293784,0.0008862283,0.000022708493,0.000007873878,0.000010699819,0.00071267766,0.9871139,0.000040603467,0.0006066926,0.010059908,0.0002193819],"about_ca_topic_score_codex":0.000097160686,"about_ca_topic_score_gemma":0.000055461212,"teacher_disagreement_score":0.9614517,"about_ca_system_score_codex":0.00009462275,"about_ca_system_score_gemma":0.0001524578,"threshold_uncertainty_score":0.71003467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25528884,0.00074392016,0.7137724,0.009553996,0.005351442,0.00799433,0.00216352,0.0024228208,0.0027087242],"genre_scores_gemma":[0.9980581,0.00002660572,0.00036339666,0.000028051776,0.000055341163,0.00063625217,0.00001769834,0.000015504858,0.00079906074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981995,0.00000762863,0.0005207711,0.0004386642,0.00039146983,0.0004419389],"domain_scores_gemma":[0.9988302,0.00005538038,0.0002985225,0.00032945577,0.00038980853,0.000096610296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045656465,0.00019024336,0.0002918909,0.000086946726,0.00026852297,0.0001687013,0.0012652678,0.00007980849,0.0000027583524],"category_scores_gemma":[0.000050782175,0.00013618659,0.00019935756,0.0012253057,0.00004731024,0.00030825863,0.000102919286,0.00011251516,0.000024087412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002147747,0.0016811369,0.0050094444,0.005598271,0.0012229757,0.000006553754,0.0057035247,0.0147677595,0.3461961,0.4245683,0.17179473,0.023236444],"study_design_scores_gemma":[0.0053787376,0.0005333044,0.016281554,0.0017924317,0.00021437014,0.00011154202,0.001844102,0.6537089,0.19233629,0.0081364615,0.1180317,0.0016306128],"about_ca_topic_score_codex":0.00013702859,"about_ca_topic_score_gemma":0.0000022275592,"teacher_disagreement_score":0.74276924,"about_ca_system_score_codex":0.00009509997,"about_ca_system_score_gemma":0.000045279692,"threshold_uncertainty_score":0.5553528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12245294,0.000058978254,0.8234717,0.012257511,0.001492292,0.00046654613,0.000019308058,0.0014924408,0.03828824],"genre_scores_gemma":[0.98105806,0.0000035094747,0.005597117,0.0007666874,0.00008422966,0.000031734202,0.0000073907304,0.000011315218,0.012439978],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998453,0.00005495694,0.00028244595,0.00044356225,0.00029565027,0.00047034674],"domain_scores_gemma":[0.99900377,0.00012743377,0.00004669001,0.0005473218,0.00010355308,0.00017124879],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005893809,0.00014481063,0.00025418657,0.00012574499,0.00016936792,0.00024408364,0.0006593346,0.00004436037,0.000027332728],"category_scores_gemma":[0.000060207083,0.00012279549,0.00006390977,0.0014560805,0.000019855484,0.00014257857,0.000293093,0.00008692159,0.0017823097],"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.00021367642,0.00019160472,0.0029845168,0.000155344,0.00012409306,0.0006477617,0.0030298366,0.012149912,0.013072014,0.23479645,0.62291855,0.10971622],"study_design_scores_gemma":[0.006309998,0.00016936242,0.00981436,0.00022877881,0.000011048347,0.00014423676,0.0003702295,0.48069987,0.006787969,0.0019544682,0.49229783,0.0012118495],"about_ca_topic_score_codex":0.00013238078,"about_ca_topic_score_gemma":0.000011986921,"teacher_disagreement_score":0.8586051,"about_ca_system_score_codex":0.000012398776,"about_ca_system_score_gemma":0.00004631977,"threshold_uncertainty_score":0.99899495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015563038,0.0077996557,0.5658475,0.13658905,0.032426223,0.0022086215,0.0043733604,0.0043626227,0.23082992],"genre_scores_gemma":[0.9135845,0.00006549316,0.016586622,0.004433717,0.0012918977,0.00028908422,0.00014038305,0.00008632301,0.063522],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965107,0.00008318435,0.00064308255,0.0014774476,0.0006954502,0.00059014914],"domain_scores_gemma":[0.9959918,0.000047743302,0.0003524381,0.0030868307,0.00025352256,0.00026765058],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004036093,0.0005221311,0.00066885183,0.00014325177,0.000112654896,0.0013047516,0.003993251,0.0004382763,0.00012703596],"category_scores_gemma":[0.00009364954,0.0004494847,0.00033590262,0.000394975,0.00004855038,0.00012728674,0.006921848,0.0011168943,0.00031804616],"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.00000350275,0.00009709715,0.00045340924,0.00079292565,0.0001986571,0.00074242766,0.0010026376,0.00052527,0.000041062987,0.11802986,0.8626693,0.015443833],"study_design_scores_gemma":[0.0009073926,0.00007847003,0.0045374515,0.0019474293,0.000105969055,0.0001955728,0.0004926808,0.095543735,0.0011750169,0.250029,0.64199764,0.0029896325],"about_ca_topic_score_codex":0.0015068273,"about_ca_topic_score_gemma":0.00071387086,"teacher_disagreement_score":0.89802146,"about_ca_system_score_codex":0.00018004354,"about_ca_system_score_gemma":0.00035255245,"threshold_uncertainty_score":0.9997957},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027128663,0.0015644642,0.5985303,0.0022389072,0.0023145697,0.00036537767,0.00022917303,0.000766848,0.39398766],"genre_scores_gemma":[0.037067518,0.00018681418,0.05041969,0.0054815626,0.010400292,0.0002852609,0.0001589118,0.00071466155,0.8952853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961425,0.00006972744,0.00058802526,0.0016259676,0.0010077422,0.00056602067],"domain_scores_gemma":[0.997408,0.0006136532,0.00020234073,0.0014359322,0.000098012126,0.0002420669],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022271585,0.001019352,0.000876918,0.000566648,0.00026927458,0.00052707415,0.0019605944,0.0007509268,0.00040265138],"category_scores_gemma":[0.0000116060855,0.00081743026,0.0008275573,0.00013750012,0.00012657761,0.00008690757,0.00021482905,0.0018757945,0.0008664804],"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.000032401687,0.000039269667,1.03380735e-7,0.000291397,0.0004801118,0.0003582036,0.00031362404,0.010379496,0.000027980515,0.24267234,0.03473142,0.71067363],"study_design_scores_gemma":[0.00014770706,0.00015709431,0.000009808875,0.0012977115,0.00008039606,0.0003378759,7.2830323e-7,0.007880413,0.00031823048,0.080485046,0.9082114,0.0010735734],"about_ca_topic_score_codex":0.000010532929,"about_ca_topic_score_gemma":0.000021319789,"teacher_disagreement_score":0.87348,"about_ca_system_score_codex":0.000157885,"about_ca_system_score_gemma":0.0001500994,"threshold_uncertainty_score":0.9999115},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002234253,0.0017680681,0.53988004,0.0044800765,0.0028121313,0.000696941,0.00037271754,0.0014602683,0.44850743],"genre_scores_gemma":[0.12388932,0.00026646449,0.08407399,0.010539038,0.012063473,0.00034945348,0.0002794335,0.0013209429,0.7672179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952216,0.000105934574,0.00076187914,0.002108647,0.0010303512,0.0007715936],"domain_scores_gemma":[0.99612516,0.00077764847,0.0003292342,0.0023207748,0.00013513413,0.0003120592],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00032951645,0.0012993788,0.001220131,0.00059464126,0.00030649695,0.0007837088,0.0028958789,0.000964587,0.00024569104],"category_scores_gemma":[0.000027871476,0.0010324868,0.00087335403,0.000191072,0.00015898615,0.00009516529,0.0007739227,0.0022086806,0.0008112986],"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.000028607397,0.000032301858,6.240002e-7,0.00026048603,0.0003606273,0.0003783822,0.00025046765,0.0020686956,0.000022165837,0.5993139,0.026117,0.37116674],"study_design_scores_gemma":[0.00013179854,0.00016656726,0.000019385856,0.0012275364,0.00007891833,0.00024004563,5.5276877e-7,0.0073502073,0.0002941774,0.13253991,0.85677385,0.0011770182],"about_ca_topic_score_codex":0.000016301798,"about_ca_topic_score_gemma":0.000034561825,"teacher_disagreement_score":0.8306569,"about_ca_system_score_codex":0.0002211726,"about_ca_system_score_gemma":0.00016499464,"threshold_uncertainty_score":0.9999758},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031099473,0.0026261865,0.6686892,0.0017565002,0.002770571,0.0004751284,0.00018562205,0.0010909121,0.3224028],"genre_scores_gemma":[0.0447941,0.00042237103,0.20712869,0.008412437,0.022473304,0.00044377203,0.00023710777,0.0015300257,0.7145582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954522,0.00007415644,0.0006959412,0.001972063,0.0010512827,0.00075432594],"domain_scores_gemma":[0.9966694,0.00068501476,0.00029390008,0.0019561232,0.00012170361,0.00027385273],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028636423,0.0012284467,0.0010842286,0.0006733111,0.00032319388,0.00088420854,0.0026593448,0.0008447301,0.00015153646],"category_scores_gemma":[0.000023854056,0.000978829,0.0008013885,0.00019077415,0.00012242771,0.000086674685,0.0007288991,0.0020748598,0.0008625277],"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.000012839416,0.000027590968,3.2026543e-7,0.00023629412,0.0003743359,0.00052176096,0.0002984589,0.0044535687,0.000015586023,0.20876816,0.017801858,0.76748925],"study_design_scores_gemma":[0.0001338209,0.00017787049,0.000008537769,0.002633958,0.00007969015,0.00031638856,6.980053e-7,0.022892486,0.0002816862,0.075478464,0.8967038,0.0012926417],"about_ca_topic_score_codex":0.000015118969,"about_ca_topic_score_gemma":0.00001698062,"teacher_disagreement_score":0.8789019,"about_ca_system_score_codex":0.00017468726,"about_ca_system_score_gemma":0.00012722902,"threshold_uncertainty_score":0.9999154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02667566,0.000016365346,0.93022364,0.00028479728,0.00012208668,0.04169182,0.000018023704,0.00025179674,0.00071582035],"genre_scores_gemma":[0.9288674,9.252349e-7,0.0024577763,0.000016651165,0.000025217201,0.068273254,0.0000032594276,0.0000056278936,0.00034989955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884176,0.00008324382,0.00027539424,0.00043359448,0.000113974675,0.00025204194],"domain_scores_gemma":[0.99939597,0.0001630958,0.00004318564,0.00026446587,0.000055817905,0.00007745282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708657,0.00010737228,0.000231792,0.000050267005,0.00006410797,0.00021723384,0.00022750541,0.000076512,7.289821e-7],"category_scores_gemma":[0.000031632022,0.000080776146,0.00002016995,0.00029182577,0.000037916598,0.00033411832,0.00015802542,0.000055759803,0.0000016457789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109500696,0.00028665183,0.012366472,0.0021203654,0.000023100258,0.000047188078,0.00084451406,0.29948527,0.000098237346,0.6564251,0.0024147758,0.025778817],"study_design_scores_gemma":[0.00058764906,0.00004762828,0.0063807066,0.000027706466,5.211253e-7,0.000007913653,0.0000448869,0.9895466,0.0000051559323,0.0017592409,0.0014764448,0.0001155262],"about_ca_topic_score_codex":0.000181014,"about_ca_topic_score_gemma":0.00005157703,"teacher_disagreement_score":0.92776585,"about_ca_system_score_codex":0.000023876306,"about_ca_system_score_gemma":0.000033038967,"threshold_uncertainty_score":0.3293956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029851131,0.04312019,0.52150095,0.009380406,0.03762964,0.0012486535,0.00014289437,0.0014778702,0.35564825],"genre_scores_gemma":[0.99398106,0.00020830378,0.0010767196,0.00041972447,0.001158617,0.00008817218,0.0000011262327,0.000014775276,0.0030515108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869096,0.000091432725,0.00023454004,0.00040038483,0.0002662119,0.00031643893],"domain_scores_gemma":[0.99944526,0.00018840608,0.000041606854,0.00015424205,0.00013949108,0.00003100264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038626097,0.00014742254,0.00026561937,0.000076261385,0.00034550644,0.00030978676,0.0006512299,0.00006901824,0.000006105516],"category_scores_gemma":[0.00018058855,0.0001321161,0.000069494534,0.0012224979,0.00011037083,0.0005148598,0.00056821207,0.00020082695,0.00003059325],"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.000028631492,0.00014833928,0.00046604735,0.002156279,0.0005703959,0.0006907983,0.17032562,0.00036146282,0.00008724306,0.3300906,0.36002174,0.13505283],"study_design_scores_gemma":[0.0032568092,0.0003789588,0.028040593,0.0040344805,0.0007411796,0.000083351275,0.11524194,0.123363934,0.0005469678,0.13250855,0.5877533,0.004049943],"about_ca_topic_score_codex":0.00009204603,"about_ca_topic_score_gemma":0.000078895464,"teacher_disagreement_score":0.9641299,"about_ca_system_score_codex":0.00036498878,"about_ca_system_score_gemma":0.00017563706,"threshold_uncertainty_score":0.5387538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005906324,0.00018095867,0.97094476,0.011501913,0.0008089321,0.00051858055,0.0000603373,0.00043999206,0.014953876],"genre_scores_gemma":[0.84262663,0.00001905528,0.100371614,0.0036378864,0.00057012634,0.0002967638,0.00008937509,0.000037670856,0.052350905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827534,0.000016998503,0.00037460186,0.00075243897,0.00024540225,0.0003352017],"domain_scores_gemma":[0.9984007,0.00007917989,0.00004327823,0.001025571,0.00026316123,0.0001881181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049447006,0.00015314562,0.00021011043,0.00009827295,0.00010256832,0.0005253185,0.0006369221,0.00006581686,0.000024808045],"category_scores_gemma":[0.00012540985,0.00012412468,0.000103464066,0.00078535295,0.0000117218315,0.000355009,0.00011388496,0.00007745756,0.00059937994],"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.000012125666,0.000074456315,0.000059217487,0.0001689137,0.000042464282,0.000009833737,0.0001879835,0.0013387462,0.007868728,0.19147144,0.75251013,0.046255972],"study_design_scores_gemma":[0.00009205098,0.000050708524,0.00007125446,0.00005430335,0.0000049528585,0.0000064228075,0.0000042336446,0.45254388,0.0012011565,0.00022059894,0.5456285,0.0001219159],"about_ca_topic_score_codex":0.000048926006,"about_ca_topic_score_gemma":0.000010523914,"teacher_disagreement_score":0.87057316,"about_ca_system_score_codex":0.000032849377,"about_ca_system_score_gemma":0.00008196925,"threshold_uncertainty_score":0.7704016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023119089,0.03333959,0.84632415,0.035759978,0.0010528797,0.005988633,0.0021169637,0.0056819087,0.06742399],"genre_scores_gemma":[0.9584223,0.0041419347,0.0047404137,0.00024503097,0.000082528015,0.0007465635,0.0004597308,0.00009127578,0.031070195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795693,0.000052936382,0.00060793327,0.0009307056,0.00019778978,0.00025371276],"domain_scores_gemma":[0.9955755,0.00015497602,0.00039084794,0.0034738174,0.00030080145,0.000104051804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745657,0.0002889838,0.0005329217,0.00023754888,0.00030583356,0.00025651994,0.0013454746,0.0005727885,0.0000031556683],"category_scores_gemma":[0.00012176353,0.00028791494,0.000052559346,0.0002817268,0.0002030092,0.00018207275,0.0014953022,0.0004335255,0.000050762646],"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.0000033209315,0.000011440407,0.0000339058,0.000089780406,0.000043903052,0.0000016282457,0.00007190748,0.0000122766605,0.00063427584,0.9412758,0.0012731917,0.0565486],"study_design_scores_gemma":[0.0007677235,0.00042559634,0.00073355844,0.001778967,0.00008106006,0.00010688455,0.00029658942,0.02385849,0.00071026664,0.44791764,0.5217194,0.0016038473],"about_ca_topic_score_codex":0.0000548152,"about_ca_topic_score_gemma":0.000012290096,"teacher_disagreement_score":0.9561104,"about_ca_system_score_codex":0.00007946598,"about_ca_system_score_gemma":0.000043185548,"threshold_uncertainty_score":0.9999573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8342992,0.000488875,0.15432103,0.0010738125,0.0013771276,0.0011781472,0.00009616926,0.0014475947,0.005718066],"genre_scores_gemma":[0.9968132,0.000022051858,0.00093731517,0.00005812889,0.000019491777,0.000018956916,0.00003068958,0.000012013153,0.002088147],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982593,0.00011357448,0.00046465365,0.0004727961,0.00039050743,0.00029914433],"domain_scores_gemma":[0.99879515,0.00023619755,0.0001984856,0.0004933885,0.00017015082,0.00010662877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046087673,0.00018333242,0.00031131893,0.00019645221,0.00012618187,0.000114354865,0.00027036056,0.00008868695,0.0000076630495],"category_scores_gemma":[0.000056224413,0.00015173796,0.00005967016,0.0008178922,0.000055226512,0.00010028146,0.00012664341,0.000093516144,0.00012032565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004344059,0.0023902336,0.019014593,0.0022232053,0.0012999151,0.00043505232,0.006754578,0.17759378,0.2625124,0.24971871,0.22454576,0.053077385],"study_design_scores_gemma":[0.001189153,0.00011454826,0.021339815,0.00027231398,0.000011467114,0.000017623579,0.00012259606,0.9723697,0.0023824964,0.000052838157,0.0018337823,0.00029367628],"about_ca_topic_score_codex":0.00014822335,"about_ca_topic_score_gemma":0.00000946549,"teacher_disagreement_score":0.7947759,"about_ca_system_score_codex":0.000021145062,"about_ca_system_score_gemma":0.000034777862,"threshold_uncertainty_score":0.6187694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23449783,0.0004244471,0.7619061,0.00039758452,0.00032589395,0.00048924127,0.000035034613,0.0003552814,0.0015686114],"genre_scores_gemma":[0.99869066,0.0000058673295,0.0007931276,0.000018023627,0.00001680478,0.000010041361,0.00004554941,0.0000051672823,0.00041475444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988663,0.000057828973,0.00019029075,0.00043080564,0.00026035483,0.00019438865],"domain_scores_gemma":[0.9990497,0.00004521933,0.00005297874,0.0007537512,0.000040080464,0.000058250273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003702909,0.00008791704,0.00013145935,0.00009429696,0.000068150046,0.00016055674,0.0005191974,0.000034140976,0.0000016670585],"category_scores_gemma":[0.0000126288605,0.00006175179,0.0000046730183,0.0007667134,0.000022714323,0.0000696096,0.0004093552,0.00005497311,0.00003833075],"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.000020126394,0.00014616872,0.0088143945,0.00023327251,0.000013915797,0.00012815453,0.0007330393,0.93324226,0.0003045778,0.024591291,0.01739537,0.014377407],"study_design_scores_gemma":[0.00030588682,0.000027709,0.008704376,0.00020246825,0.0000010077473,0.000012767569,0.000081924016,0.98839337,0.00001108614,0.000006282368,0.0021598195,0.00009327762],"about_ca_topic_score_codex":0.00018755803,"about_ca_topic_score_gemma":0.000029897103,"teacher_disagreement_score":0.7641928,"about_ca_system_score_codex":0.000027268252,"about_ca_system_score_gemma":0.000039628867,"threshold_uncertainty_score":0.25181645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088758186,0.0009694776,0.9077614,0.000056043024,0.0007433619,0.0005973025,0.000045128687,0.00032767263,0.0007414547],"genre_scores_gemma":[0.9465029,0.000017788529,0.053223766,0.000044524433,0.00006917552,0.00006925186,0.0000559146,0.000011495329,0.0000051702864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980827,0.000057575133,0.0008074385,0.0003090151,0.00026779503,0.00047547376],"domain_scores_gemma":[0.99913025,0.00022745246,0.00020761839,0.00020822676,0.00013969882,0.00008674434],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011425308,0.00022371918,0.00028201274,0.00021627135,0.0002616862,0.0013277235,0.00031566934,0.00013634343,0.0000010346032],"category_scores_gemma":[0.000078373865,0.0002199212,0.000066320245,0.00056032,0.000049165505,0.0036651194,0.0001784808,0.00021060438,0.000005070419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027337644,0.00003702341,0.0024841013,0.0024689345,0.00005180907,0.00003491892,0.02446006,0.0070102913,0.00002093496,0.029156635,0.00021081159,0.93403715],"study_design_scores_gemma":[0.00048175655,0.000060965933,0.0038188018,0.0006791146,0.000006153536,0.00008361231,0.0008626026,0.9901857,0.000029811132,0.0010466863,0.0024844627,0.00026038123],"about_ca_topic_score_codex":0.00003449066,"about_ca_topic_score_gemma":0.000017752762,"teacher_disagreement_score":0.98317534,"about_ca_system_score_codex":0.00033919464,"about_ca_system_score_gemma":0.00008185686,"threshold_uncertainty_score":0.999709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8671091,0.0018041077,0.12472607,0.0012001953,0.0009636554,0.00014255781,0.00005713022,0.0003250638,0.0036720906],"genre_scores_gemma":[0.99800324,0.000008746232,0.0008965112,0.000083471146,0.00006893495,0.000006482543,0.00000396671,0.000009190506,0.00091948075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892765,0.000028252913,0.0002721466,0.00029613584,0.00022819624,0.00024762994],"domain_scores_gemma":[0.9994574,0.000075894415,0.000057477824,0.00029139477,0.00005429435,0.00006352462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023973749,0.000117971395,0.00016411816,0.000056267432,0.00007029491,0.000087263106,0.0003952183,0.00005675831,0.0000066547964],"category_scores_gemma":[0.000010800421,0.00010454032,0.000061997096,0.00040221467,0.000048431837,0.00007626971,0.000093622235,0.000114990995,0.0000429181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023237575,0.00029608622,0.004291391,0.0011507926,0.000225929,0.00012447075,0.0025339567,0.0048158085,0.029627124,0.80058056,0.09428831,0.062042326],"study_design_scores_gemma":[0.00021881721,0.000104970255,0.0010845821,0.00026987804,0.0000070594524,0.00006198423,0.00006748981,0.9749258,0.0027352811,0.0001257817,0.020168437,0.00022991447],"about_ca_topic_score_codex":0.000028936507,"about_ca_topic_score_gemma":0.000004724676,"teacher_disagreement_score":0.97011,"about_ca_system_score_codex":0.000028337807,"about_ca_system_score_gemma":0.000058362708,"threshold_uncertainty_score":0.42630306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018633167,0.0011232727,0.9481233,0.001452059,0.0010857595,0.00033442723,0.00004350135,0.0010497742,0.044924617],"genre_scores_gemma":[0.9716661,0.0000070797846,0.007382758,0.0007577192,0.00014629752,0.000073801806,0.000023224518,0.00001908185,0.019923918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979135,0.000052694315,0.00038522933,0.0006805246,0.00044615212,0.00052194245],"domain_scores_gemma":[0.9988503,0.000080260885,0.000049274204,0.0007179925,0.00013570448,0.0001664623],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042192754,0.00022909608,0.0002767784,0.00012589907,0.00019118561,0.0013053273,0.0008223245,0.00009859198,0.00022595315],"category_scores_gemma":[0.000021662112,0.00018891631,0.00013153211,0.0012523774,0.00004372556,0.0005866614,0.00014238195,0.00018434237,0.00048715385],"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.0001268747,0.0010003182,0.0012638198,0.001458502,0.0004099168,0.001062437,0.001329906,0.012721291,0.02370105,0.3468898,0.40982503,0.20021108],"study_design_scores_gemma":[0.00053621584,0.00007659062,0.000054757442,0.00014580238,0.000005929909,0.000011340295,0.000013611086,0.6304618,0.0014594476,0.00028598035,0.36671352,0.00023498005],"about_ca_topic_score_codex":0.0003681598,"about_ca_topic_score_gemma":0.00007631588,"teacher_disagreement_score":0.9698028,"about_ca_system_score_codex":0.00010175324,"about_ca_system_score_gemma":0.00026219973,"threshold_uncertainty_score":0.9997314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075331144,0.0024813558,0.92283255,0.0021952912,0.0008570539,0.00028736627,0.0000041577714,0.00063656404,0.06317256],"genre_scores_gemma":[0.97622097,0.000028427432,0.0032979478,0.00034381732,0.00007911028,0.000025431707,0.0000026231462,0.00000632944,0.01999534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991665,0.000062757375,0.00019693536,0.0003091214,0.00012213421,0.00014255472],"domain_scores_gemma":[0.99943894,0.00019605836,0.000018488641,0.0002546183,0.00003069223,0.000061179526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952499,0.0000890379,0.00021365171,0.00004489976,0.000038792623,0.0005167964,0.00019925313,0.000037220645,0.000046048623],"category_scores_gemma":[0.0000401649,0.00005892277,0.000058143993,0.0002275347,0.000035264213,0.0003551949,0.00008706835,0.00006799873,0.0001525047],"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.0004528657,0.000053356158,0.00021469416,0.00026839794,0.0002497183,0.00020344727,0.0019660904,0.000018918005,0.0012814009,0.7767727,0.073281735,0.1452367],"study_design_scores_gemma":[0.03268298,0.000030805884,0.00039217292,0.00020073472,0.00002045192,0.00014218331,0.000025092606,0.5822283,0.00042345296,0.0028257687,0.38065046,0.00037759123],"about_ca_topic_score_codex":0.00007969575,"about_ca_topic_score_gemma":0.0000062133,"teacher_disagreement_score":0.96868783,"about_ca_system_score_codex":0.000008313111,"about_ca_system_score_gemma":0.000017454355,"threshold_uncertainty_score":0.498348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009222588,0.0004885563,0.73313713,0.0012229866,0.0023857595,0.0000874954,0.0000072835473,0.0008905085,0.25255767],"genre_scores_gemma":[0.9718711,0.0000052740593,0.016247317,0.0002509562,0.00006264585,0.000006704677,0.000001203661,0.0000057288166,0.011549086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927664,0.000018062492,0.0001425401,0.00026266417,0.000116568786,0.00018355055],"domain_scores_gemma":[0.9995737,0.000076057564,0.000013873259,0.0002579132,0.000022392329,0.000056041186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016053962,0.00007244905,0.00008566788,0.000033742752,0.00005304367,0.00042332342,0.00027090145,0.000032716285,0.000049618553],"category_scores_gemma":[0.000012150197,0.000059980208,0.000044491047,0.0002550567,0.0000127243475,0.0001959819,0.000055090764,0.00007106816,0.000507679],"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.0000019107295,0.000024017027,0.0005118133,0.00012255991,0.00004974773,0.0006317118,0.00069384,0.00025277512,0.0011216303,0.48440778,0.2207984,0.2913838],"study_design_scores_gemma":[0.000124105,0.000030077632,0.00015902432,0.00013785312,0.0000024113497,0.00021202957,0.000044506,0.45677242,0.00075401575,0.0024237665,0.53911626,0.00022351801],"about_ca_topic_score_codex":0.000046947996,"about_ca_topic_score_gemma":0.000009491816,"teacher_disagreement_score":0.9626485,"about_ca_system_score_codex":0.000023848575,"about_ca_system_score_gemma":0.000057343284,"threshold_uncertainty_score":0.65253556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010619006,0.004664738,0.9901524,0.00040822357,0.00041389762,0.0005716442,0.000103004255,0.00032548863,0.002298678],"genre_scores_gemma":[0.9974594,0.00001845527,0.00058326754,0.00024955717,0.00010027514,0.00023196163,0.000013050338,0.000007444559,0.0013365616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989953,0.00009322271,0.00021726683,0.0003849904,0.000095775446,0.00021343537],"domain_scores_gemma":[0.9990787,0.00028059413,0.000019767718,0.0004062372,0.00007453571,0.00014019516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064015633,0.000118162025,0.00017893463,0.00005034315,0.00007506498,0.0007729686,0.0003567995,0.000042604996,0.0000033115907],"category_scores_gemma":[0.000009037359,0.00008167743,0.000029823017,0.00057611876,0.000015871496,0.00016461144,0.00006383132,0.00006297504,0.0001375821],"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.00001853509,0.00010347305,0.00656813,0.00036609112,0.0002530706,0.000019858333,0.0013051335,0.005166693,0.0007996295,0.65489054,0.063310206,0.26719862],"study_design_scores_gemma":[0.00011509986,0.000026080923,0.0023526384,0.00007044235,0.000002205001,0.00001763612,0.0000331208,0.56802064,0.000011308025,0.00019630358,0.42899424,0.00016030182],"about_ca_topic_score_codex":0.00043909758,"about_ca_topic_score_gemma":0.00008288581,"teacher_disagreement_score":0.99639755,"about_ca_system_score_codex":0.000018758215,"about_ca_system_score_gemma":0.000034189543,"threshold_uncertainty_score":0.7453754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09746927,0.0010674138,0.8960941,0.0011207776,0.0011662088,0.0004570544,0.00037186447,0.0008136799,0.0014396594],"genre_scores_gemma":[0.9972061,0.0000036151384,0.0019125768,0.000113769886,0.00020339101,0.000022992883,0.00044933165,0.000035476023,0.000052736537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961634,0.00017610504,0.00084793806,0.0012137257,0.00063141197,0.00096739794],"domain_scores_gemma":[0.998007,0.0004496897,0.00028381875,0.0009926138,0.00010379726,0.00016306536],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007609697,0.00043972215,0.000538016,0.00024261151,0.00025087164,0.0017029709,0.0011855256,0.000120326986,0.0000051246957],"category_scores_gemma":[0.0000526503,0.00037707394,0.000122065736,0.001500516,0.00006055007,0.00046048505,0.00026076415,0.00047770882,0.00004799637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021138534,0.00050699787,0.019533196,0.0013381039,0.0008173296,0.0056057386,0.0047811535,0.19832797,0.0016817757,0.65650654,0.048562538,0.062127247],"study_design_scores_gemma":[0.0010887795,0.00014427751,0.00276679,0.0033468206,0.000020417418,0.00006877233,0.0006050136,0.93853265,0.00015006414,0.00025198032,0.052311294,0.000713131],"about_ca_topic_score_codex":0.001481353,"about_ca_topic_score_gemma":0.00007896714,"teacher_disagreement_score":0.8997368,"about_ca_system_score_codex":0.00017658796,"about_ca_system_score_gemma":0.000110031964,"threshold_uncertainty_score":0.9998681},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137652,0.003798662,0.7910494,0.037775043,0.0017023289,0.0005502655,0.00019722845,0.0017234953,0.03182704],"genre_scores_gemma":[0.9777399,0.0000068845784,0.0028832993,0.0017463373,0.000080922066,0.000016068536,0.0000016501211,0.000006175228,0.017518796],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992223,0.000010997567,0.00012820092,0.00031958122,0.00014486098,0.00017408932],"domain_scores_gemma":[0.9996043,0.0000154033,0.00000989062,0.00027025258,0.000021605829,0.00007854997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010629657,0.00009035203,0.00010484957,0.000037303264,0.000034495235,0.00038349905,0.00019940818,0.00004434264,0.00014164024],"category_scores_gemma":[0.00000234784,0.00006681885,0.00003865345,0.00019609918,0.000021346432,0.00032546173,0.000115069444,0.00006875806,0.0007990303],"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.000023735938,0.00006901861,0.0014939774,0.00038597884,0.00009152954,0.00049779675,0.00603669,0.000004559262,0.0007422852,0.13645203,0.25705943,0.597143],"study_design_scores_gemma":[0.0002333396,0.00011306806,0.011043254,0.00018545377,0.0000064927444,0.00012953013,0.00001148771,0.36571264,0.0004606262,0.0021503856,0.61964375,0.0003100059],"about_ca_topic_score_codex":0.000027010481,"about_ca_topic_score_gemma":0.00001002171,"teacher_disagreement_score":0.84636337,"about_ca_system_score_codex":0.000013024326,"about_ca_system_score_gemma":0.000026009151,"threshold_uncertainty_score":0.99997896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004567381,0.0012103707,0.95071584,0.0007399708,0.0014099992,0.0000758025,0.000048215992,0.00056158495,0.040670842],"genre_scores_gemma":[0.96643615,0.000008199754,0.017964352,0.00015311126,0.00028193407,0.000009764786,0.00001910066,0.000008807012,0.015118602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907005,0.0000175814,0.00016316626,0.00035878381,0.00018195911,0.0002084359],"domain_scores_gemma":[0.99941224,0.000046205492,0.000014654814,0.00041600713,0.00003272568,0.0000781694],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010566903,0.00009608251,0.000113721595,0.000031786552,0.000051583636,0.0006633139,0.0005118732,0.000048025104,0.00016369316],"category_scores_gemma":[0.000006632944,0.00007480851,0.00005259955,0.00029273005,0.000012725204,0.0004541204,0.00012322803,0.0001050288,0.0012660843],"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.0000043764703,0.000105875086,0.00080604525,0.000055690773,0.00013069029,0.0005172054,0.0012473186,0.0018293249,0.0025894318,0.6191074,0.26919058,0.10441602],"study_design_scores_gemma":[0.00009008358,0.000021864445,0.00052790967,0.0000451138,0.0000029914363,0.000008090514,0.00001817788,0.5902844,0.0010205634,0.0011904964,0.40665334,0.00013695423],"about_ca_topic_score_codex":0.00096370047,"about_ca_topic_score_gemma":0.000051694176,"teacher_disagreement_score":0.96186876,"about_ca_system_score_codex":0.00002779621,"about_ca_system_score_gemma":0.000065272514,"threshold_uncertainty_score":0.99951154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014154803,0.0066893958,0.91620195,0.019997794,0.0027336855,0.00051808386,0.000018251116,0.0010562469,0.038629808],"genre_scores_gemma":[0.994907,0.00004346965,0.0013385202,0.00022227342,0.00009245204,0.000023503713,0.0000024620465,0.000007187695,0.0033631108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989011,0.00003003707,0.00021537351,0.00036092094,0.00021555816,0.0002769888],"domain_scores_gemma":[0.99923813,0.00013818326,0.000029867464,0.00045097506,0.00005354877,0.0000892707],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002795428,0.000131737,0.00013994859,0.000034994406,0.000263826,0.0011799367,0.00068233587,0.00003388922,0.00001356601],"category_scores_gemma":[0.0000050409367,0.00007597097,0.00006001239,0.00031948538,0.00007482303,0.0003460485,0.00023383359,0.0001342954,0.00030894385],"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.0000038056394,0.000007752925,0.00007845754,0.000020988726,0.000030889973,0.000023311959,0.00043310222,0.000019337931,0.000069629445,0.93404955,0.045951273,0.019311888],"study_design_scores_gemma":[0.00031646102,0.000021222499,0.0004543178,0.000062473504,0.000005504536,0.00007938232,0.00014535258,0.13581325,0.0003292869,0.005997151,0.8565707,0.00020486952],"about_ca_topic_score_codex":0.0000832869,"about_ca_topic_score_gemma":0.000128733,"teacher_disagreement_score":0.9807522,"about_ca_system_score_codex":0.00003158341,"about_ca_system_score_gemma":0.00006354642,"threshold_uncertainty_score":0.99985695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034126805,0.000496626,0.9846992,0.0015558671,0.0011798532,0.00025414408,0.00003042869,0.0004308423,0.011011772],"genre_scores_gemma":[0.89561284,0.0000035370697,0.09603478,0.0003344686,0.00015029073,0.000112357986,0.000023022161,0.0000132379955,0.0077154627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989695,0.000015419464,0.00019202328,0.00038779102,0.00017258433,0.00026267028],"domain_scores_gemma":[0.99946815,0.00008787568,0.000024403635,0.0002932833,0.000056259374,0.0000700392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029999064,0.000112662,0.00013202713,0.000052481013,0.00011420394,0.00045655062,0.00045835262,0.000047416306,0.0000669235],"category_scores_gemma":[0.000018337336,0.00008893709,0.00019212472,0.00021697392,0.000010122677,0.00028787352,0.00008663916,0.00005770377,0.00008493038],"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.0000019585575,0.000021592758,0.0000012643736,0.00016419095,0.0000547634,0.000016357031,0.0005822764,0.00016805204,0.0033547583,0.9110478,0.037458617,0.047128323],"study_design_scores_gemma":[0.0001958803,0.00009294755,0.000007862479,0.00012871595,0.000010940785,0.000033001335,0.00038699576,0.85766417,0.0043379497,0.005870384,0.13102543,0.00024574233],"about_ca_topic_score_codex":0.000017048622,"about_ca_topic_score_gemma":0.0000056882686,"teacher_disagreement_score":0.9051775,"about_ca_system_score_codex":0.000032887394,"about_ca_system_score_gemma":0.00004472263,"threshold_uncertainty_score":0.4402528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005591025,0.00019067315,0.93374884,0.00046680475,0.0005552481,0.0002693438,0.000007616531,0.0007562299,0.05841423],"genre_scores_gemma":[0.98367953,0.0000019485633,0.014545308,0.0004621282,0.00016316106,0.000057891695,0.000009485379,0.000011432246,0.001069102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.00005646119,0.00021203818,0.0005839281,0.0002622749,0.00029744842],"domain_scores_gemma":[0.9990193,0.000038029855,0.00001861057,0.0006659315,0.000047424033,0.00021067586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032610647,0.00014438662,0.00019302651,0.00009824421,0.00008857425,0.0018542748,0.0015432124,0.000055260043,0.00002323459],"category_scores_gemma":[0.000008905298,0.0001099478,0.00006711809,0.00075051695,0.000014634787,0.0009953179,0.00016995503,0.0000999884,0.00025548515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004855375,0.0004897603,0.00035224375,0.00028881576,0.00012582705,0.000119050834,0.004127572,0.019313976,0.0022518567,0.5891765,0.05672772,0.32697818],"study_design_scores_gemma":[0.0005641329,0.000068227564,0.0010779226,0.000047615733,0.0000054441957,0.000049766153,0.00005888926,0.92172414,0.0006185621,0.00048861606,0.0749436,0.00035304888],"about_ca_topic_score_codex":0.000105670646,"about_ca_topic_score_gemma":0.0000051845113,"teacher_disagreement_score":0.9780885,"about_ca_system_score_codex":0.00003946869,"about_ca_system_score_gemma":0.000062593914,"threshold_uncertainty_score":0.99918187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017844463,0.0005132925,0.97377926,0.0032084119,0.0015748289,0.00034080225,0.000016207605,0.0011715625,0.0015511961],"genre_scores_gemma":[0.9639941,0.000038892314,0.034115735,0.0003065777,0.00011402532,0.00004171527,0.000006204173,0.00003078157,0.0013519782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975145,0.000074851225,0.0005364735,0.00086221524,0.00042305232,0.0005889438],"domain_scores_gemma":[0.99799067,0.00038364335,0.00008652843,0.0012648357,0.00008389051,0.0001904138],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041582933,0.0003326606,0.00033209188,0.000204155,0.0007362164,0.00074598345,0.0015626961,0.00013158414,0.00005874526],"category_scores_gemma":[0.00002762275,0.0003178751,0.0002668194,0.0010366061,0.000042751413,0.0005573474,0.000063316205,0.00047289496,0.001197407],"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.000039066257,0.000353046,0.00013014262,0.00039543264,0.00029119136,0.00032933493,0.0031480715,0.9042389,0.000064874475,0.039960135,0.001637922,0.049411934],"study_design_scores_gemma":[0.0004830571,0.00014758753,0.00084234757,0.00042380887,0.00001814944,0.0001337381,0.000028024357,0.8580706,0.000118570955,0.0022752823,0.13701323,0.0004456009],"about_ca_topic_score_codex":0.00018970096,"about_ca_topic_score_gemma":0.000114540824,"teacher_disagreement_score":0.94614965,"about_ca_system_score_codex":0.00012917818,"about_ca_system_score_gemma":0.00011216003,"threshold_uncertainty_score":0.99992734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41177538,0.0025275466,0.5360577,0.00055400416,0.0057891477,0.0011490653,0.00013668965,0.0008610491,0.04114941],"genre_scores_gemma":[0.9988864,8.3361937e-7,0.0003265007,0.00004682728,0.00014471945,0.0000054011575,0.0000051105444,0.000015238751,0.000568955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975987,0.0005547824,0.0006890206,0.00037160632,0.0004973939,0.00028848843],"domain_scores_gemma":[0.9976366,0.0009626301,0.0003102054,0.00087975024,0.00015423176,0.000056564422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671823,0.00020053709,0.00050611637,0.00010054301,0.00013313028,0.0002553578,0.001200918,0.000068244466,0.000022881084],"category_scores_gemma":[0.00008030613,0.00013427978,0.0001834103,0.0005506741,0.00026488435,0.00013299592,0.0001931494,0.00017902648,0.00011787615],"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.000029067269,0.00006987592,0.000013382432,0.0003654493,0.00010988624,0.000014736367,0.002281476,0.0012021641,0.0022616854,0.9893091,0.0028988067,0.0014443808],"study_design_scores_gemma":[0.000493162,0.00033436355,0.0010064425,0.003746962,0.000026841595,0.000062636165,0.00028257264,0.96701294,0.0013881169,0.021937717,0.0032931683,0.00041509225],"about_ca_topic_score_codex":0.00004175097,"about_ca_topic_score_gemma":5.8926275e-7,"teacher_disagreement_score":0.96737134,"about_ca_system_score_codex":0.00004377113,"about_ca_system_score_gemma":0.00007894902,"threshold_uncertainty_score":0.547577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010997713,0.00024628788,0.9413621,0.0016410976,0.0005250972,0.00042288564,0.00013184159,0.0009847222,0.043688286],"genre_scores_gemma":[0.9921912,0.0000037493905,0.0048353905,0.0021988542,0.000028459686,0.00006853946,0.000047130514,0.000015462461,0.00061123865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853593,0.00018258317,0.00020782684,0.00037706512,0.0003769353,0.00031967816],"domain_scores_gemma":[0.9987814,0.00025234045,0.000061780425,0.0007289292,0.00007877362,0.000096791555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034744153,0.00023309856,0.00025372012,0.00013291145,0.0002282583,0.000952087,0.0007681048,0.00010354118,0.000017333326],"category_scores_gemma":[0.0000058658493,0.00018264542,0.00015627801,0.0004962386,0.00009576145,0.0004037552,0.00010881806,0.0002759767,0.00008665862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107036816,0.0007742502,0.00044873077,0.00049758353,0.0002299958,0.0002646137,0.013554365,0.002144262,0.0002714179,0.9513036,0.017378798,0.013025322],"study_design_scores_gemma":[0.00078921363,0.00042471275,0.0012131636,0.001074514,0.000017874272,0.000037931062,0.004187653,0.97843504,0.0048346096,0.0020736444,0.006067758,0.00084386405],"about_ca_topic_score_codex":0.00029081167,"about_ca_topic_score_gemma":0.00003749064,"teacher_disagreement_score":0.9811935,"about_ca_system_score_codex":0.00005959247,"about_ca_system_score_gemma":0.000081124424,"threshold_uncertainty_score":0.91809964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002644912,0.021416558,0.7676333,0.047078054,0.0027356304,0.00032179337,0.000042329815,0.0011322068,0.15699522],"genre_scores_gemma":[0.9954111,0.00015111147,0.0014267743,0.00030714797,0.000028621986,0.000008374581,0.000011323745,0.0000049283526,0.0026506104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992217,0.00002780536,0.00017570288,0.00021246551,0.00019519172,0.00016712678],"domain_scores_gemma":[0.9991571,0.00007527591,0.000019875444,0.000643555,0.000040055864,0.00006416976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001694402,0.00008035492,0.000086927015,0.000026382248,0.00011387386,0.00032574442,0.0007089753,0.000029196959,0.000024458908],"category_scores_gemma":[0.0000074612367,0.000066093504,0.00002903221,0.0002693068,0.000014434349,0.00029268375,0.000110812434,0.00009078765,0.00010780385],"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":[4.4572133e-7,0.000009048325,0.00011802398,0.000042211326,0.000012179507,0.000024552804,0.00023947065,0.000040994037,0.000019776196,0.8589355,0.1190641,0.021493746],"study_design_scores_gemma":[0.000033044704,0.0000054195198,0.0012533803,0.00006282293,0.0000012109169,0.000011785869,0.000023918377,0.124035016,0.00006414662,0.00085814274,0.8735551,0.00009601151],"about_ca_topic_score_codex":0.31515124,"about_ca_topic_score_gemma":0.6023167,"teacher_disagreement_score":0.9927662,"about_ca_system_score_codex":0.00009881077,"about_ca_system_score_gemma":0.00032084377,"threshold_uncertainty_score":0.6894092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13303095,0.014335478,0.67814684,0.0030641328,0.00159547,0.00026926468,0.000010274645,0.0010225674,0.168525],"genre_scores_gemma":[0.9905948,0.000088247456,0.00691173,0.000042148615,0.00006605791,0.000010502878,0.0000010926217,0.000004847315,0.0022805473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992577,0.000017817634,0.00012857531,0.0003086006,0.00012827119,0.00015906346],"domain_scores_gemma":[0.9995909,0.00007158904,0.000052446627,0.00020412572,0.00002971681,0.0000512282],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00013561611,0.00008961168,0.00009334736,0.00003533418,0.00006715306,0.0015565456,0.00022803585,0.000031315845,0.0000095067235],"category_scores_gemma":[0.000015120464,0.00006983684,0.000020134908,0.00020620695,0.000019965104,0.0028089192,0.00009792496,0.00009243371,0.00006705714],"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.000002241515,0.000030918003,0.000046759145,0.00018474435,0.000024000517,0.000104841965,0.0008979289,0.000103139006,0.0018031657,0.8857411,0.0011683626,0.10989276],"study_design_scores_gemma":[0.00033489848,0.0002085508,0.00043195314,0.00043348462,0.000013741185,0.00022379852,0.003708824,0.15055653,0.0015111715,0.0073666275,0.83468056,0.0005298449],"about_ca_topic_score_codex":0.00009002137,"about_ca_topic_score_gemma":0.00007299238,"teacher_disagreement_score":0.8783745,"about_ca_system_score_codex":0.000010466866,"about_ca_system_score_gemma":0.000063181156,"threshold_uncertainty_score":0.99947995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033202495,0.00083953066,0.9815212,0.0027057717,0.0022064126,0.00019502167,0.0000022206552,0.0002205376,0.008989077],"genre_scores_gemma":[0.9268153,0.000004297766,0.0697897,0.00049770664,0.0013383867,8.2266e-7,0.0000015016999,0.000019269552,0.0015330166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980416,0.000090229376,0.00046902793,0.00048335234,0.00051562674,0.00040011384],"domain_scores_gemma":[0.99887186,0.00017467863,0.00012614357,0.0003940191,0.00011274791,0.0003205492],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082533475,0.00019346157,0.00023609349,0.00019982058,0.0005381902,0.0034124125,0.0007409902,0.000057845646,0.000010191262],"category_scores_gemma":[0.00013811566,0.0001603433,0.0001377179,0.0009518714,0.000013196296,0.00046446853,0.00019521368,0.0005123784,0.00020777163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019241517,0.00020114759,0.00008939982,0.00018834873,0.000088460736,0.00033904222,0.002694582,0.3446782,0.0003764924,0.17643826,0.09011738,0.38476944],"study_design_scores_gemma":[0.00015640834,0.000092283655,0.00010440305,0.0011146138,0.000004622145,0.0003290397,0.00002574473,0.7650986,0.000016630245,0.00077272614,0.23207651,0.00020845221],"about_ca_topic_score_codex":0.000009609247,"about_ca_topic_score_gemma":6.1234084e-7,"teacher_disagreement_score":0.92349505,"about_ca_system_score_codex":0.00016670857,"about_ca_system_score_gemma":0.00028483017,"threshold_uncertainty_score":0.99762213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011342639,0.0008160939,0.9814884,0.0015450962,0.0007645134,0.00029601585,0.0005087193,0.0016486379,0.0015898811],"genre_scores_gemma":[0.9713243,0.0000027345973,0.027960457,0.00016028987,0.00022506906,0.000012870051,0.00023402143,0.00002666965,0.00005357947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971645,0.00011427968,0.00049281097,0.00092430756,0.00054324436,0.0007608753],"domain_scores_gemma":[0.99796027,0.00016988708,0.000121998004,0.0013501082,0.00017709099,0.00022066028],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045469735,0.0003692893,0.00041062874,0.00012940579,0.00035466952,0.0011960838,0.0020894185,0.00011849311,0.000014081391],"category_scores_gemma":[0.000042924785,0.00030780447,0.00013760728,0.0015275363,0.00013778753,0.00046587148,0.00052650564,0.00045984154,0.000105752755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030398525,0.00022213135,0.0015175979,0.000370669,0.00030042848,0.0011527861,0.0007174775,0.0025339685,0.0003903553,0.84978586,0.036489062,0.10648926],"study_design_scores_gemma":[0.0006753496,0.00012992366,0.0032009566,0.0005144609,0.000019185714,0.00033364102,0.0000906312,0.9416686,0.00020696963,0.0024284082,0.05016836,0.00056346017],"about_ca_topic_score_codex":0.00025526714,"about_ca_topic_score_gemma":0.000037014364,"teacher_disagreement_score":0.9599817,"about_ca_system_score_codex":0.0001724658,"about_ca_system_score_gemma":0.00019562164,"threshold_uncertainty_score":0.9999374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014145243,0.0021118314,0.90962714,0.0042267647,0.001305623,0.00008982502,0.000011618322,0.0008829193,0.08032978],"genre_scores_gemma":[0.9730725,0.000012735242,0.0075000743,0.00036357375,0.00014361867,0.000015753056,0.0000028667657,0.0000072743032,0.018881546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992506,0.000015553407,0.00013147015,0.00026981367,0.00016355974,0.00016899097],"domain_scores_gemma":[0.9992825,0.000034992598,0.000009966744,0.00058814505,0.000023328581,0.00006111202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014217343,0.00007547246,0.00008516482,0.0000504636,0.00004109143,0.0003338559,0.000790015,0.00003475666,0.00005966048],"category_scores_gemma":[0.000012029525,0.000056525816,0.000054835622,0.00046446265,0.00001361111,0.00036060056,0.00020134072,0.000072182615,0.00061143964],"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.0000010453205,0.00002147417,0.000019082221,0.000035950026,0.0000127480525,0.00018953776,0.00013151468,0.00002287531,0.00027572794,0.5944946,0.36344546,0.04135003],"study_design_scores_gemma":[0.00015918292,0.000048669965,0.0002291383,0.000062970874,0.0000021066992,0.00004662671,0.000014812903,0.20566298,0.00028249648,0.007305924,0.7860326,0.0001524424],"about_ca_topic_score_codex":0.000028999022,"about_ca_topic_score_gemma":0.000003632807,"teacher_disagreement_score":0.97165805,"about_ca_system_score_codex":0.000018675453,"about_ca_system_score_gemma":0.000055186905,"threshold_uncertainty_score":0.7859023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6816122,0.0009986112,0.26128206,0.0017570143,0.0016946946,0.00015872925,0.000023489742,0.0004698571,0.05200337],"genre_scores_gemma":[0.9938848,0.000005762482,0.0029676994,0.00016428073,0.00003391825,0.0000038117378,0.000001743354,0.0000059304098,0.002932052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989409,0.000041099058,0.00028473625,0.0002974717,0.00023197275,0.00020384653],"domain_scores_gemma":[0.9992819,0.00009204745,0.000045093413,0.0004457837,0.000081161525,0.000054056298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030513547,0.00010964911,0.00016528224,0.000043964345,0.000042773423,0.00013826296,0.00040338666,0.00005782486,0.000042163894],"category_scores_gemma":[0.000007738636,0.000086154796,0.00006690821,0.00037720156,0.00006656995,0.00015741208,0.00009412455,0.00010051852,0.00010649569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034432265,0.00037818175,0.002320366,0.0011152071,0.00016781075,0.000082528946,0.001086517,0.0024649177,0.023802621,0.84051335,0.037215024,0.09081902],"study_design_scores_gemma":[0.0003526381,0.0003238107,0.006060603,0.0004070988,0.000012948726,0.00011826823,0.000101403624,0.869513,0.009227423,0.001669943,0.11175587,0.00045699408],"about_ca_topic_score_codex":0.00007723829,"about_ca_topic_score_gemma":0.000009250787,"teacher_disagreement_score":0.8670481,"about_ca_system_score_codex":0.000031950316,"about_ca_system_score_gemma":0.00008349866,"threshold_uncertainty_score":0.35132906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073519354,0.014786044,0.9642209,0.0001628689,0.008310346,0.0032841086,0.0009503558,0.00054721354,0.0003862545],"genre_scores_gemma":[0.9945622,0.00021121984,0.0010248619,0.000026687476,0.00022275902,0.0011060996,0.000022455652,0.00007157046,0.0027521094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550444,0.00040014103,0.0014175908,0.0012648023,0.0007210489,0.00069198856],"domain_scores_gemma":[0.9972846,0.0007755084,0.00035118352,0.0008106885,0.00037812188,0.00039991734],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093241956,0.0006584286,0.00091641507,0.00040809548,0.0005159069,0.0019104187,0.00045698154,0.00038762888,0.0000017585267],"category_scores_gemma":[0.000018540242,0.0005891594,0.00021273675,0.000538187,0.00014484386,0.00037616395,0.000010088118,0.00038520573,0.00006207956],"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.00014602486,0.000422989,0.00001876433,0.0068375687,0.0010032486,0.00025108995,0.005074101,0.86281395,0.0014470294,0.09261491,0.0035062118,0.025864104],"study_design_scores_gemma":[0.0011824509,0.00044285198,0.000015064725,0.0023874,0.00011404592,0.0003824142,0.0012596254,0.9863159,0.0001251068,0.0001048959,0.0070043765,0.00066586834],"about_ca_topic_score_codex":0.001459045,"about_ca_topic_score_gemma":0.00004899999,"teacher_disagreement_score":0.9872103,"about_ca_system_score_codex":0.00023852078,"about_ca_system_score_gemma":0.00015535054,"threshold_uncertainty_score":0.99965596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003795077,0.00029337782,0.9892584,0.0016735052,0.00017788897,0.0027404807,0.00011310012,0.00012303106,0.0055822693],"genre_scores_gemma":[0.0078085754,0.000029283745,0.9914182,0.00010828974,0.000080806916,0.00031524393,0.000058641446,0.000020075126,0.0001608744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985237,0.000012276281,0.0006815159,0.00020445113,0.00033650224,0.00024155188],"domain_scores_gemma":[0.9980396,0.00019662458,0.00044362273,0.0010018593,0.000263116,0.00005518003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043543277,0.0003114174,0.00043210792,0.00014069492,0.0007797499,0.0005214488,0.0027829362,0.00018980166,8.189584e-7],"category_scores_gemma":[0.000023582545,0.00022265608,0.00016143748,0.00028677695,0.00069021987,0.0004162429,0.0010618463,0.0005205179,0.0000015497626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024641222,0.000016358024,0.0000017253202,0.00036413473,0.000085380096,1.53128e-7,0.0007571459,0.3778306,0.0000032614587,0.616315,0.00009402529,0.004529779],"study_design_scores_gemma":[0.00025167366,0.00011916264,0.000030055238,0.0010875918,0.000040514486,0.000030354078,0.000003306003,0.90101135,0.000037403122,0.002363371,0.094666965,0.00035825119],"about_ca_topic_score_codex":0.000023500577,"about_ca_topic_score_gemma":0.000057545887,"teacher_disagreement_score":0.6139516,"about_ca_system_score_codex":0.000046269448,"about_ca_system_score_gemma":0.00019314574,"threshold_uncertainty_score":0.9079651},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08507404,0.044894632,0.46771064,0.11233729,0.0026811368,0.0016790672,0.000087950524,0.0072284243,0.2783068],"genre_scores_gemma":[0.968326,0.00018293054,0.018117482,0.00023069947,0.000042797652,0.000055016953,0.000009405337,0.000009227087,0.013026478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991006,0.00003922314,0.00022795286,0.00029027608,0.00014431553,0.0001975896],"domain_scores_gemma":[0.99901384,0.00008186214,0.000019893381,0.00079644244,0.00002915683,0.000058816655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017806397,0.00009938074,0.000123264,0.00008736844,0.00009981122,0.00029013303,0.00085499714,0.000049281247,0.00006907372],"category_scores_gemma":[0.000009528947,0.00008333514,0.000047784302,0.0006537711,0.00001939175,0.00034288372,0.00031870714,0.00010720387,0.0007274952],"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.0000045264856,0.000452985,0.0068511213,0.00032872133,0.00010203739,0.00020835779,0.0106711695,0.00049300474,0.00033976114,0.69623065,0.27488858,0.009429077],"study_design_scores_gemma":[0.000120560726,0.000014971361,0.0031085594,0.00013852448,0.0000021913413,0.000022192624,0.000043751996,0.25143152,0.00013361343,0.00071229856,0.74412453,0.00014731773],"about_ca_topic_score_codex":0.00032741114,"about_ca_topic_score_gemma":0.0010805072,"teacher_disagreement_score":0.8832519,"about_ca_system_score_codex":0.00009805407,"about_ca_system_score_gemma":0.000047987352,"threshold_uncertainty_score":0.9350721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033951256,0.00056505145,0.9515721,0.0007581377,0.0049012476,0.0005098274,0.00026109617,0.0008225049,0.0066587697],"genre_scores_gemma":[0.90798545,0.000060162678,0.08817632,0.00023724095,0.00006182104,0.00006404393,0.000053019146,0.000010078197,0.0033518476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997091,0.00007749785,0.00067234266,0.0011651746,0.00040444417,0.00058953784],"domain_scores_gemma":[0.9976141,0.000045846813,0.00026664027,0.0016762944,0.00025328356,0.00014383368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027952116,0.00050708564,0.0006381758,0.000085409425,0.00017318809,0.00038009213,0.0022146201,0.00041026177,0.000015500655],"category_scores_gemma":[0.000022341696,0.00048177742,0.00014680649,0.00050191826,0.000072233954,0.00013578663,0.002556154,0.00055115443,0.00012380992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000865382,0.0010211355,0.014186808,0.0055749393,0.0010124281,0.00053744426,0.00056125247,0.24082623,0.00040063827,0.09349107,0.014593397,0.62770814],"study_design_scores_gemma":[0.000618072,0.000024698795,0.0075950404,0.00051314203,0.00001433801,0.000036967544,0.000009842872,0.9854625,0.00011242626,0.00049919554,0.0044900947,0.0006237205],"about_ca_topic_score_codex":0.0009674357,"about_ca_topic_score_gemma":0.00030058276,"teacher_disagreement_score":0.8740342,"about_ca_system_score_codex":0.0003271236,"about_ca_system_score_gemma":0.00040291165,"threshold_uncertainty_score":0.99976337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002871138,0.06856625,0.037510857,0.41895586,0.0022162702,0.00021635911,0.00025616089,0.00017160726,0.47181952],"genre_scores_gemma":[0.9904953,0.0015039232,0.00039537606,0.006561297,0.0009114777,0.000013661457,0.000010563889,0.0000059555177,0.000102421654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987892,0.000043499695,0.0003445378,0.00024621797,0.0003590874,0.00021747175],"domain_scores_gemma":[0.9993,0.00023324997,0.000018008057,0.000100709265,0.00018253952,0.00016550969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019736674,0.00010455968,0.00023382559,0.00003779262,0.00006506238,0.000109582565,0.00036584216,0.00005599563,0.00011683982],"category_scores_gemma":[0.0005029143,0.00008490308,0.00014869698,0.00014424039,0.00023566926,0.00024821807,0.00012279883,0.00014334489,0.00009725857],"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.0000011614545,0.00003072386,0.000009794295,0.002201712,0.000017303182,0.000019199597,0.00002028805,5.8512666e-9,0.000007973335,0.9899138,0.0020684213,0.0057095713],"study_design_scores_gemma":[0.0000634187,0.000040366263,0.00019930892,0.0037277958,0.000016165945,0.00004021743,0.000005595594,0.0007423151,0.0000244974,0.7850474,0.2099681,0.00012480232],"about_ca_topic_score_codex":0.000015625486,"about_ca_topic_score_gemma":4.7459647e-8,"teacher_disagreement_score":0.9902082,"about_ca_system_score_codex":0.000032537613,"about_ca_system_score_gemma":0.00005402423,"threshold_uncertainty_score":0.3462247},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026072383,0.0027013083,0.034637723,0.019243078,0.93285304,0.00023039269,0.0006380394,0.00023512327,0.009435242],"genre_scores_gemma":[0.040162668,0.0017119872,0.0034939705,0.0025430934,0.93416345,0.00006716487,0.0006559967,0.00008700429,0.017114667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964408,0.00046892435,0.0007278708,0.00048487406,0.0011360622,0.0007414403],"domain_scores_gemma":[0.99642885,0.00084688986,0.00065959746,0.00053934916,0.0008035821,0.0007217157],"candidate_categories":["scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0021893622,0.00031293972,0.00049082737,0.0002773998,0.0005913849,0.0028294188,0.0022360946,0.001622905,0.00008036867],"category_scores_gemma":[0.0014136108,0.00024106198,0.00023738835,0.00052861177,0.000025871394,0.0008029746,0.00016963661,0.0034060818,0.00028400036],"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.0000043435903,0.000011582965,0.000025506997,0.000010735216,0.00007575919,0.00009850745,0.0001433441,0.0003816895,2.2843176e-7,0.0035054502,0.99342775,0.002315126],"study_design_scores_gemma":[0.00020339568,0.00006010062,0.000053910604,0.00010349417,0.000029432435,0.000051889634,0.000014179416,0.022443255,9.828267e-8,0.011192318,0.9655588,0.00028911693],"about_ca_topic_score_codex":0.002711397,"about_ca_topic_score_gemma":0.004569127,"teacher_disagreement_score":0.040136598,"about_ca_system_score_codex":0.0028798878,"about_ca_system_score_gemma":0.002896024,"threshold_uncertainty_score":0.9996732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553659,0.00023307021,0.43860903,0.00016528543,0.0011013731,0.00044690902,0.00020616129,0.00021164726,0.0036605976],"genre_scores_gemma":[0.99849683,0.000014366167,0.00041198093,0.000021773252,0.0000809156,0.0000014924715,0.000012434532,0.000013173733,0.00094705133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799925,0.0002207553,0.00034990895,0.0010234982,0.00009898253,0.0003075977],"domain_scores_gemma":[0.9972216,0.00012941,0.0002848761,0.001996934,0.00023971907,0.00012746081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005279716,0.00030547174,0.00046997322,0.0001024431,0.0001490278,0.00018057735,0.0019239715,0.00017459849,0.000015581596],"category_scores_gemma":[0.000026575108,0.00025247567,0.0002931654,0.00062399224,0.00023907032,0.00015147163,0.002895248,0.000833625,0.000060762697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035224646,0.00021984056,0.005917014,0.0008487616,0.00032946255,0.0045105754,0.0010436751,0.19577022,0.000024813442,0.78792834,0.0013767252,0.001995321],"study_design_scores_gemma":[0.00025573128,0.000030482866,0.0005689803,0.00021690778,0.000091847774,0.00011633227,0.00022809583,0.97681946,0.00006203958,0.020052705,0.0012243175,0.00033309092],"about_ca_topic_score_codex":0.001555102,"about_ca_topic_score_gemma":0.00032560274,"teacher_disagreement_score":0.78104925,"about_ca_system_score_codex":0.00013398446,"about_ca_system_score_gemma":0.00025605728,"threshold_uncertainty_score":0.9999927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981596,0.0011630068,0.01277497,0.0017196323,0.00018898757,0.0012376803,0.000015963315,0.0001536905,0.001150067],"genre_scores_gemma":[0.89270836,0.0000036611782,0.10697377,0.000043036733,0.00002144513,0.000060174792,0.0000010953698,0.000005554271,0.00018292462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989868,0.000008165725,0.00027461138,0.00030931944,0.00024072049,0.00018042828],"domain_scores_gemma":[0.9988587,0.00015048544,0.0003032853,0.00033583312,0.00032059246,0.000031135773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063744315,0.00010731611,0.00017897342,0.00004274871,0.00012952891,0.00009292981,0.0012783466,0.00006536087,2.978972e-7],"category_scores_gemma":[0.0022820837,0.00008031176,0.00004878605,0.00035435328,0.000084773,0.00029820402,0.00038154674,0.00011830695,1.444882e-7],"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.000051131843,0.00017224243,0.04029291,0.0012303852,0.00005274295,4.8855543e-7,0.0025224236,0.00010081927,0.0069581405,0.78875756,0.00025684296,0.15960433],"study_design_scores_gemma":[0.0076899556,0.0032160184,0.2412761,0.026727162,0.00039892964,0.00012156217,0.012579357,0.18694848,0.23679188,0.25212553,0.029193662,0.0029313634],"about_ca_topic_score_codex":0.000026808942,"about_ca_topic_score_gemma":0.000004130542,"teacher_disagreement_score":0.536632,"about_ca_system_score_codex":0.000018531906,"about_ca_system_score_gemma":0.00004135504,"threshold_uncertainty_score":0.32750183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012495932,0.00025933646,0.9903945,0.0007143577,0.00028495374,0.005859073,0.00021107217,0.0005985525,0.00042858638],"genre_scores_gemma":[0.959099,0.0000036856468,0.037942,0.00013049971,0.00021575384,0.0023163508,0.00009475483,0.000020450336,0.00017752696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985821,0.000027480557,0.00031474433,0.0005585394,0.0001574613,0.0003596354],"domain_scores_gemma":[0.9991869,0.0001584745,0.000047289286,0.0004260246,0.00007444476,0.000106898246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040298098,0.00016641481,0.00022002439,0.000050267376,0.00016202076,0.0010310494,0.0005352281,0.000062572915,0.0000049855776],"category_scores_gemma":[0.000039115013,0.00013159435,0.00005793195,0.00033698938,0.00003751365,0.00049944205,0.00022609976,0.000104220846,0.000026535303],"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.0000099765175,0.000065862245,0.00019352943,0.000677079,0.00005631443,0.00004750238,0.00022210757,0.00009753067,0.0005533866,0.79639596,0.026695233,0.17498554],"study_design_scores_gemma":[0.00030907252,0.000103883984,0.0003176528,0.0002187912,0.000003890382,0.00005596369,0.000019118565,0.7858851,0.00035102235,0.0024416586,0.21008897,0.00020489158],"about_ca_topic_score_codex":0.000027983704,"about_ca_topic_score_gemma":0.000005168523,"teacher_disagreement_score":0.9578494,"about_ca_system_score_codex":0.000035288293,"about_ca_system_score_gemma":0.00008667545,"threshold_uncertainty_score":0.99424326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020759893,0.00072226254,0.6513613,0.00017666449,0.00036386945,0.003033817,0.0006054676,0.0002063542,0.34145427],"genre_scores_gemma":[0.3906782,0.00026213768,0.5082805,0.00039726376,0.00077823404,0.00034795277,0.0003520314,0.00018922352,0.09871443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985684,0.0000060451916,0.00063245423,0.0003259503,0.0002519716,0.00021514838],"domain_scores_gemma":[0.99832934,0.00037348657,0.00064966804,0.00046099414,0.000113319424,0.00007321513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061177736,0.00029662962,0.00070127373,0.000027649143,0.00026599536,0.00013061818,0.00038887394,0.0004657319,0.0000014357306],"category_scores_gemma":[0.000013420866,0.00027963656,0.00021571331,0.000020284506,0.00025238266,0.000050397008,0.00030716296,0.00039197144,3.1281633e-7],"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.0000063808025,0.000014902152,4.920021e-7,0.00057431974,0.00015595401,1.3059956e-7,0.0018275162,0.000001882395,0.00037560135,0.9711602,0.0005920362,0.025290614],"study_design_scores_gemma":[0.0024270462,0.00006323376,0.0000022470524,0.0023383084,0.00023750692,0.0000083260375,0.0007010698,0.007667108,0.0008835044,0.9688267,0.01614959,0.0006953571],"about_ca_topic_score_codex":0.00002717493,"about_ca_topic_score_gemma":0.000008986551,"teacher_disagreement_score":0.3886022,"about_ca_system_score_codex":0.000070362104,"about_ca_system_score_gemma":0.00013557385,"threshold_uncertainty_score":0.9999656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021326134,0.0002928628,0.9595122,0.0059468327,0.001492258,0.000103917555,0.0000034232992,0.00003940451,0.011282991],"genre_scores_gemma":[0.9912822,0.000020964493,0.007228946,0.0006258232,0.00008142955,0.0000031820562,4.0568327e-7,0.0000040176296,0.00075302814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988388,0.00010146847,0.0004378285,0.0001626006,0.00027977,0.00017955425],"domain_scores_gemma":[0.9988658,0.00013343453,0.0003844861,0.00026932455,0.0002659927,0.000081002436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455558,0.00010934847,0.00025523928,0.00025191545,0.00010442249,0.00012220454,0.000560024,0.000057773203,0.0000051055267],"category_scores_gemma":[0.00013675379,0.00008895639,0.00014572572,0.0005383309,0.000026733142,0.00035336878,0.000057805675,0.00029504288,0.000019619138],"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.00018706,0.0007406108,0.0027421187,0.000050910396,0.00037326766,0.00018978644,0.0013097541,0.0019554812,0.0036571901,0.64672834,0.17762321,0.1644423],"study_design_scores_gemma":[0.013870805,0.0031765557,0.04487602,0.0027135718,0.0001916601,0.0006718217,0.0026791943,0.06641809,0.028266344,0.028637536,0.8071042,0.0013942199],"about_ca_topic_score_codex":0.000008430678,"about_ca_topic_score_gemma":0.0000026816647,"teacher_disagreement_score":0.96995604,"about_ca_system_score_codex":0.00011583873,"about_ca_system_score_gemma":0.00017718166,"threshold_uncertainty_score":0.36275363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014139569,0.0067410353,0.9601547,0.0008079211,0.0012578955,0.00029789752,0.00011360132,0.0004129993,0.01607436],"genre_scores_gemma":[0.9720119,0.00007306278,0.026920214,0.00073377794,0.00005207726,0.000049826198,0.00005156607,0.000010648561,0.000096904965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981911,0.000087817,0.00032361076,0.0006909792,0.00030798395,0.00039848808],"domain_scores_gemma":[0.99868304,0.00014987541,0.00011852071,0.00081290916,0.00012520613,0.00011045529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016525731,0.0002532173,0.00031774753,0.00059322244,0.00019038493,0.00036216833,0.0012678823,0.0001876927,0.000012445879],"category_scores_gemma":[0.000040516898,0.00023160786,0.00026907906,0.0036945406,0.000109196415,0.00040453384,0.0002211687,0.00030653804,0.000032632743],"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.00002736133,0.00026419386,0.0031545456,0.000061942854,0.00023647682,0.000041792613,0.0004568472,0.000023213828,0.0030723885,0.90737635,0.009612676,0.075672194],"study_design_scores_gemma":[0.0034493783,0.00039154157,0.31869543,0.0010233921,0.00011146611,0.000009887743,0.0004433662,0.040010676,0.0013050875,0.21382253,0.41890305,0.0018341852],"about_ca_topic_score_codex":0.00006853224,"about_ca_topic_score_gemma":0.00002593582,"teacher_disagreement_score":0.95787233,"about_ca_system_score_codex":0.000034398876,"about_ca_system_score_gemma":0.000050198265,"threshold_uncertainty_score":0.94446945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044400524,0.00065708946,0.9351592,0.0074502053,0.0017874389,0.0004149032,0.00045097806,0.0007305098,0.008949135],"genre_scores_gemma":[0.9863276,0.0000039371826,0.011136729,0.0014983347,0.000087884415,0.000009913547,0.00010366518,0.000013745391,0.0008182181],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709725,0.00017334067,0.00072043855,0.000875458,0.0003566182,0.0007768614],"domain_scores_gemma":[0.9976643,0.00036395053,0.0002687745,0.0011386682,0.00040251625,0.00016180717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005642519,0.0003514958,0.0005049709,0.00013570867,0.00052612845,0.0006038578,0.001244955,0.00018261903,0.00003127749],"category_scores_gemma":[0.00015794585,0.00035951572,0.00019489671,0.0009704447,0.00009627331,0.00010355074,0.0003830001,0.0003532061,0.00012297624],"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.000047021567,0.00031653536,0.01543192,0.00026277374,0.0004331821,0.00021301548,0.0013021703,0.0029670172,0.0014888879,0.108569734,0.8177468,0.051220912],"study_design_scores_gemma":[0.0021475723,0.0000708987,0.0065957964,0.0006651989,0.000037487203,0.0000929512,0.0002944794,0.7159601,0.0035992835,0.018238476,0.25132138,0.0009763959],"about_ca_topic_score_codex":0.00019947211,"about_ca_topic_score_gemma":0.00000746128,"teacher_disagreement_score":0.9419271,"about_ca_system_score_codex":0.0001519452,"about_ca_system_score_gemma":0.00026495924,"threshold_uncertainty_score":0.9998857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014223,0.00020116768,0.8663615,0.00047801624,0.0009301861,0.00014630206,0.0000062652507,0.00019619419,0.0015381364],"genre_scores_gemma":[0.99616694,0.0000405595,0.0022623253,0.00048629372,0.00003422698,0.000007327919,0.0000013384213,0.000008053158,0.0009929156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867314,0.000049069746,0.0002846265,0.00046050103,0.00018566876,0.00034697913],"domain_scores_gemma":[0.99929756,0.000096912845,0.00006441473,0.00037890504,0.00007996564,0.000082267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023073956,0.00019649853,0.00023732393,0.00015018595,0.00058516674,0.00022342674,0.0003892155,0.00010043951,0.000007851367],"category_scores_gemma":[0.0000018201025,0.00018494904,0.00007107375,0.0005816262,0.000035009813,0.00030387807,0.000008767588,0.00029772014,0.000021969063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005831955,0.0005108525,0.00047051994,0.0004999612,0.0003020964,0.00005029091,0.0018806023,0.41699886,0.0011699757,0.02349094,0.0026406136,0.551927],"study_design_scores_gemma":[0.000773955,0.000093774164,0.0006914503,0.000270027,0.000016059026,0.000040109742,0.00014352941,0.98852515,0.0035918707,0.00015587494,0.005400978,0.00029722662],"about_ca_topic_score_codex":0.00003387283,"about_ca_topic_score_gemma":0.00002670987,"teacher_disagreement_score":0.86602473,"about_ca_system_score_codex":0.00004204689,"about_ca_system_score_gemma":0.00006795446,"threshold_uncertainty_score":0.7542003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84243166,0.0051006684,0.037791807,0.023448043,0.0077237133,0.002168942,0.000081915736,0.0012511698,0.08000209],"genre_scores_gemma":[0.99840075,0.000010461824,0.0008388808,0.00005346768,0.000060218008,0.000032205528,2.480644e-7,0.000004789291,0.0005989603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893516,0.0000048078687,0.00024495943,0.00028689025,0.00034397002,0.00018422063],"domain_scores_gemma":[0.9995895,0.000023585508,0.00006726029,0.00017913528,0.000096086354,0.000044415672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003708143,0.0000995651,0.00012503858,0.000032192504,0.00006277006,0.00016639281,0.0009350317,0.00003030174,0.000008655227],"category_scores_gemma":[0.000036111935,0.000061359584,0.00012130506,0.0004635238,0.000043065127,0.0003301079,0.00031702704,0.00010431386,0.000024522247],"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.0000068743243,0.00014538938,0.0025077462,0.0005400298,0.00007239902,0.0000019308864,0.0016969902,0.000018537496,0.031062562,0.91765904,0.020766357,0.025522167],"study_design_scores_gemma":[0.0011163645,0.0003629712,0.030288717,0.0019261722,0.00007492176,0.00018893534,0.0006118295,0.05708325,0.34493735,0.10904338,0.45336708,0.0009990265],"about_ca_topic_score_codex":0.000020970092,"about_ca_topic_score_gemma":5.712025e-7,"teacher_disagreement_score":0.8086156,"about_ca_system_score_codex":0.00006599223,"about_ca_system_score_gemma":0.000033550026,"threshold_uncertainty_score":0.2502171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001405797,0.13427214,0.8516906,0.0039617666,0.0035182314,0.0003462526,0.000027851429,0.0000665787,0.0047107846],"genre_scores_gemma":[0.84243584,0.12983032,0.024936015,0.0006857672,0.0009851934,0.000023116554,0.00008939044,0.000016148062,0.0009982324],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985247,0.00010486833,0.0007521174,0.00018079506,0.0002388959,0.00019858302],"domain_scores_gemma":[0.9976922,0.00047815486,0.00047367098,0.00055309985,0.0007291451,0.0000736775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008340371,0.0001371195,0.00024198763,0.0002045019,0.00022890094,0.00047899727,0.0017363534,0.00009083885,0.0000020644256],"category_scores_gemma":[0.000019979012,0.00012871035,0.00013595547,0.00033014742,0.000078865494,0.0005374625,0.0003265474,0.00024310738,0.00000258088],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006555222,0.000112588335,0.0020273165,0.000016620006,0.00026638422,0.000005243057,0.00020882512,0.00034575962,0.00025301345,0.019955326,0.000346315,0.97639704],"study_design_scores_gemma":[0.0006438674,0.00006385924,0.0018214708,0.0007234781,0.000023063869,0.000059965252,0.00002438649,0.23813403,0.000027252734,0.0019849248,0.7563812,0.00011247829],"about_ca_topic_score_codex":0.000005619708,"about_ca_topic_score_gemma":0.0000073427886,"teacher_disagreement_score":0.97628456,"about_ca_system_score_codex":0.00006566526,"about_ca_system_score_gemma":0.00007873005,"threshold_uncertainty_score":0.52486557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010285196,0.00038327478,0.97568697,0.0012434907,0.0003441299,0.00020320977,0.000008860897,0.00011804282,0.01172681],"genre_scores_gemma":[0.92907304,0.0000070836863,0.04761445,0.0014666094,0.000067739165,0.00005750291,0.000004993061,0.000005316065,0.021703286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927497,0.000016493317,0.00017747877,0.00027075998,0.00007396177,0.00018632546],"domain_scores_gemma":[0.99948585,0.00010214372,0.000045010504,0.00026265916,0.000070619426,0.000033721986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017791378,0.00008778973,0.0001350018,0.000040627026,0.00011118329,0.0002541192,0.00027109502,0.00004127689,0.0000060936145],"category_scores_gemma":[0.00003851889,0.00007118749,0.00003625183,0.0001711884,0.000018666131,0.00024769668,0.00012033683,0.000040353738,0.00001091802],"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.000011183517,0.00007424327,0.0021325343,0.0002750744,0.000063281215,0.0000028247398,0.0010583028,0.00009510373,0.0016942876,0.51066923,0.12800965,0.35591426],"study_design_scores_gemma":[0.0015974151,0.00007921161,0.0028549728,0.0004709936,0.000013107704,0.000014565722,0.0002718892,0.15412198,0.0034659023,0.017155154,0.81942266,0.0005321524],"about_ca_topic_score_codex":0.0000415531,"about_ca_topic_score_gemma":0.000060323633,"teacher_disagreement_score":0.9280725,"about_ca_system_score_codex":0.0000110099245,"about_ca_system_score_gemma":0.000025864301,"threshold_uncertainty_score":0.29029414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00931049,0.000036527974,0.91235596,0.062595785,0.002000883,0.0009921435,0.00019508805,0.00015334299,0.012359755],"genre_scores_gemma":[0.9543857,0.0000015850919,0.029886845,0.009813602,0.00019586709,0.00022178436,0.00081199553,0.000010980437,0.0046716165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984603,0.000058933798,0.0003876072,0.00058934884,0.00024503603,0.0002587636],"domain_scores_gemma":[0.998203,0.0001631622,0.00007210746,0.0012557543,0.00024061832,0.00006537397],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068425137,0.00011798736,0.00017271374,0.00027386635,0.00010405363,0.0011178312,0.0018855346,0.0000709682,0.000015525138],"category_scores_gemma":[0.0006474675,0.00010265854,0.000029470037,0.0009733488,0.000012628293,0.0019796144,0.0004720752,0.00012450886,0.0000076545575],"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.0000046648415,0.000037182144,0.00043748674,0.000033217766,0.000008746659,5.277222e-7,0.000161169,0.00018608963,0.000038731065,0.28570765,0.660382,0.053002555],"study_design_scores_gemma":[0.0013008339,0.000065204775,0.029898074,0.0002593943,0.000005919593,8.61385e-7,0.00019456967,0.18863656,0.00047646422,0.015084691,0.7637099,0.0003675092],"about_ca_topic_score_codex":0.00018043576,"about_ca_topic_score_gemma":0.0008616431,"teacher_disagreement_score":0.9450752,"about_ca_system_score_codex":0.00007684892,"about_ca_system_score_gemma":0.00009223892,"threshold_uncertainty_score":0.9999191},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11908818,0.00035997794,0.8589118,0.0017182704,0.0013987466,0.0009255262,0.00004929994,0.0004954411,0.017052753],"genre_scores_gemma":[0.9937725,0.000008033469,0.00537195,0.00002610348,0.00023479342,0.00016153933,0.0000029308953,0.000007133565,0.00041499597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887013,0.000070848844,0.00022987794,0.0003585889,0.000200131,0.0002704248],"domain_scores_gemma":[0.99924076,0.00023979359,0.000028193721,0.00042173525,0.00003242278,0.000037114423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929306,0.00012073855,0.0001541196,0.00006106027,0.00006945624,0.00038877642,0.0007358886,0.000056098408,0.0000042270512],"category_scores_gemma":[0.000017304266,0.00007485775,0.00008934468,0.000428472,0.000007897247,0.00019894262,0.000039577633,0.00013034198,0.00005675234],"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.00005225853,0.0002925935,0.00019655352,0.001838871,0.00016350752,0.00026752826,0.05648426,0.0025516164,0.123228766,0.59708947,0.024181629,0.19365294],"study_design_scores_gemma":[0.001986274,0.00048848777,0.00260717,0.003138727,0.000036051148,0.0002466859,0.0021211084,0.6181695,0.05680043,0.029797286,0.282819,0.0017892809],"about_ca_topic_score_codex":0.00009489575,"about_ca_topic_score_gemma":0.00006947267,"teacher_disagreement_score":0.87468433,"about_ca_system_score_codex":0.000047465033,"about_ca_system_score_gemma":0.00004818722,"threshold_uncertainty_score":0.37489802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018717121,0.0018014228,0.94535315,0.0023447766,0.0003243508,0.00037217888,0.00002852972,0.00056035,0.0304981],"genre_scores_gemma":[0.9892197,0.0000033628985,0.00780893,0.0002123131,0.000075735465,0.00010831832,0.0000059228414,0.000008130938,0.0025575738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988035,0.0000332302,0.0003105473,0.0004191851,0.00017158399,0.0002619311],"domain_scores_gemma":[0.9994132,0.00012398671,0.000032712203,0.00033451882,0.000033162498,0.000062429266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029638756,0.000117038406,0.00014027697,0.00008048847,0.00009294901,0.00053570594,0.00040541388,0.00005910692,0.000016022275],"category_scores_gemma":[0.000011401775,0.00010829232,0.000040699102,0.0007690498,0.000020615624,0.00007081963,0.00009726288,0.00015612063,0.00007788162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016151165,0.00011160692,0.000619794,0.00014629672,0.000035269422,0.000064252774,0.0007525425,0.0018543678,0.017231531,0.82196885,0.039862093,0.11735181],"study_design_scores_gemma":[0.00016790986,0.000013415898,0.00015509748,0.00010484679,0.0000017307516,0.000030770687,0.000121394805,0.8401005,0.00039281833,0.0010717325,0.15760703,0.00023271203],"about_ca_topic_score_codex":0.00020350568,"about_ca_topic_score_gemma":0.00005485727,"teacher_disagreement_score":0.9705026,"about_ca_system_score_codex":0.000070146525,"about_ca_system_score_gemma":0.0000689572,"threshold_uncertainty_score":0.5165825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003847445,0.30639103,0.07459381,0.61012655,0.00087289896,0.0007157408,0.00008286155,0.00017296645,0.0031966842],"genre_scores_gemma":[0.96201086,0.012993142,0.02408344,0.0006077633,0.0000037903055,0.000050283932,0.0000031654954,0.0000040700243,0.00024350377],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937755,0.000120394856,0.00018066302,0.0001372547,0.00009694328,0.00008716772],"domain_scores_gemma":[0.98204154,0.00017153176,0.00009587215,0.017532513,0.00013729466,0.000021268299],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00012250803,0.00007353877,0.00012389716,0.000044470136,0.0003383891,0.00015498066,0.016368719,0.00004755657,0.0000012372321],"category_scores_gemma":[0.0002389262,0.00005488704,0.000065452026,0.00031409084,0.000110588284,0.00040284047,0.0032379336,0.0001533735,0.0000022424854],"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.000020256148,0.00046720743,0.0022432772,0.0005433827,0.00027476207,7.7125515e-7,0.028526189,0.0006132052,0.0010071392,0.12215581,0.05826158,0.7858864],"study_design_scores_gemma":[0.0008916094,0.000040611376,0.011681585,0.0028405476,0.00008125424,0.000011102358,0.01825641,0.007992675,0.0014201375,0.11420263,0.84220296,0.00037845675],"about_ca_topic_score_codex":0.0000319615,"about_ca_topic_score_gemma":0.00032496982,"teacher_disagreement_score":0.9581634,"about_ca_system_score_codex":0.000024934205,"about_ca_system_score_gemma":0.00004220508,"threshold_uncertainty_score":0.9889532},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055584595,0.00063679833,0.83818495,0.0035141332,0.0021211037,0.00050396385,0.000026927977,0.00048214608,0.0989454],"genre_scores_gemma":[0.97645795,0.0000072160133,0.010329744,0.0011573219,0.000034971858,0.000027573333,0.000008031614,0.000008179546,0.011969035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979918,0.00012047087,0.00050492195,0.0006379548,0.00032620854,0.00041862862],"domain_scores_gemma":[0.9984025,0.00016860946,0.00011320208,0.0010292645,0.00016574057,0.00012073362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039532784,0.00021491516,0.00030774318,0.00014917538,0.00020767676,0.00022803998,0.0008178899,0.00010927459,0.000027434817],"category_scores_gemma":[0.00007191909,0.0001778264,0.0001458174,0.0008890526,0.00006179215,0.00007007818,0.00028538975,0.00015256327,0.00023321522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021711766,0.001646801,0.0012612152,0.00026087204,0.00034641288,0.00025978938,0.0006758363,0.022249373,0.006533532,0.21780695,0.3521998,0.3965423],"study_design_scores_gemma":[0.0035031599,0.00027322536,0.038310353,0.0005368376,0.00003936147,0.0001243617,0.000244518,0.6668502,0.0038577695,0.0020990858,0.28299832,0.0011628177],"about_ca_topic_score_codex":0.00014227603,"about_ca_topic_score_gemma":0.00004755221,"teacher_disagreement_score":0.92087334,"about_ca_system_score_codex":0.000116425144,"about_ca_system_score_gemma":0.0001650715,"threshold_uncertainty_score":0.725155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009775301,0.0012777693,0.98500776,0.0018785105,0.00028727218,0.00013697354,0.00014385009,0.000120756304,0.0013717866],"genre_scores_gemma":[0.9973234,0.000010593413,0.0020608166,0.000029823068,0.000026268455,0.0000059174718,0.000028971841,0.000005835464,0.00050840026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988283,0.000070573464,0.00032134072,0.00028219813,0.00028792984,0.00020963639],"domain_scores_gemma":[0.99914837,0.0003166991,0.000055625314,0.00034253864,0.00008344915,0.000053292526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043172904,0.00010676842,0.000174897,0.000056108893,0.00007464271,0.0002279083,0.0003283482,0.000052829844,0.00002747493],"category_scores_gemma":[0.00008949071,0.00007098423,0.000060006798,0.0009858941,0.00002461573,0.0003169884,0.00010024907,0.00013401089,0.0000074463564],"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.00004344349,0.00020253539,0.00092762546,0.00045744205,0.00012661716,0.00012305938,0.0061055394,0.38013783,0.09335797,0.36812627,0.0924174,0.057974283],"study_design_scores_gemma":[0.0001735701,0.000029022496,0.00023174025,0.00047418597,0.00000414954,0.0000038593253,0.00034228325,0.8713469,0.01576269,0.00039807177,0.1110891,0.00014443384],"about_ca_topic_score_codex":0.00009365946,"about_ca_topic_score_gemma":0.00006632046,"teacher_disagreement_score":0.98754805,"about_ca_system_score_codex":0.0000761331,"about_ca_system_score_gemma":0.00011163212,"threshold_uncertainty_score":0.28946528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836027,0.005281876,0.0062772445,0.0012125139,0.00070003734,0.0010574227,0.000040122213,0.00018373964,0.0016443231],"genre_scores_gemma":[0.99777716,0.00009234342,0.0015064344,0.000015756095,0.00011350497,0.00009027287,0.0000023676027,0.00001783581,0.00038431623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979001,0.000008853878,0.0004954385,0.0005522479,0.0006990411,0.00034426778],"domain_scores_gemma":[0.99880266,0.000023887535,0.0004905125,0.00020150155,0.00041043997,0.000070967115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555667,0.00024950222,0.00036422475,0.00016363777,0.00019988646,0.0009788572,0.0007452754,0.00007324849,0.00000113775],"category_scores_gemma":[0.000033974295,0.0001751386,0.00007086747,0.00088681467,0.000074172865,0.0013415348,0.00030100698,0.00016445002,0.000001105878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103295344,0.0004525361,0.03799323,0.03154788,0.0002286608,0.000006713861,0.011318127,0.0024766258,0.080289215,0.028236818,0.0037578654,0.80358905],"study_design_scores_gemma":[0.00090943393,0.0006496123,0.0064049987,0.023361316,0.00014013155,0.00014000243,0.0031203085,0.70281345,0.2507963,0.0006634847,0.010118541,0.0008824221],"about_ca_topic_score_codex":0.000052305262,"about_ca_topic_score_gemma":0.0000013996296,"teacher_disagreement_score":0.8027066,"about_ca_system_score_codex":0.00009727423,"about_ca_system_score_gemma":0.00009417335,"threshold_uncertainty_score":0.94391423},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11401738,0.0005991027,0.8809087,0.0024997722,0.00068550574,0.0006254317,0.00003211745,0.000563852,0.000068129935],"genre_scores_gemma":[0.9890048,0.000026052061,0.010282058,0.00028508462,0.000017755083,0.0002295308,0.00000460027,0.000015201269,0.00013495525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998118,0.000059742666,0.00040088096,0.0007573151,0.00016332045,0.00050077116],"domain_scores_gemma":[0.99859095,0.0000881609,0.00008794897,0.00092746114,0.00021195236,0.00009354691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002986553,0.00026531357,0.00039913395,0.00040753823,0.00045708884,0.000121604084,0.0006079535,0.0004223924,0.0000026198443],"category_scores_gemma":[0.0000094110455,0.0002515394,0.000116237825,0.0010586048,0.00019896092,0.000075875636,0.0000074588042,0.00037187003,0.0000065077857],"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.000058922928,0.0005676195,0.000035037,0.00007250306,0.00013996115,0.00004889083,0.000052346397,0.87467206,0.006592149,0.037188683,0.0003182061,0.08025364],"study_design_scores_gemma":[0.0011987922,0.00023642587,0.00004046232,0.00010626447,0.000038691953,0.00006367198,0.000056673507,0.9703474,0.017667219,0.00034045667,0.009645339,0.00025856931],"about_ca_topic_score_codex":0.000026216607,"about_ca_topic_score_gemma":0.000018630268,"teacher_disagreement_score":0.87498736,"about_ca_system_score_codex":0.000037720707,"about_ca_system_score_gemma":0.00006537705,"threshold_uncertainty_score":0.9999937},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06699106,0.00046994412,0.9287968,0.0004207471,0.0007751121,0.0002487545,0.00027885466,0.0005499628,0.001468733],"genre_scores_gemma":[0.9871686,0.0000024691576,0.012184124,0.00016295465,0.000077523284,0.000006366083,0.0003642918,0.0000091327865,0.000024534243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978482,0.00013005506,0.0005170969,0.000671076,0.00035474176,0.00047884134],"domain_scores_gemma":[0.9985316,0.0002181888,0.00021187802,0.0006540683,0.00029117565,0.000093136754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034285078,0.00024391219,0.0003469608,0.00010873062,0.0004958754,0.00064468884,0.00088158075,0.00010691064,0.000007788533],"category_scores_gemma":[0.00012625703,0.00025230175,0.00010019841,0.0011960893,0.000060385653,0.00012855825,0.0003156947,0.00020065349,0.000024858737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007133883,0.00047254164,0.010793205,0.00020381763,0.00042923907,0.000109370296,0.001883313,0.30952203,0.0023136428,0.39270917,0.008766302,0.272726],"study_design_scores_gemma":[0.00068947684,0.000024249615,0.007826874,0.0004198556,0.000014002671,0.0000025639783,0.00011000283,0.98228914,0.0012464261,0.001549502,0.0055451007,0.00028280332],"about_ca_topic_score_codex":0.00006106487,"about_ca_topic_score_gemma":0.0000023097857,"teacher_disagreement_score":0.9201775,"about_ca_system_score_codex":0.0003165289,"about_ca_system_score_gemma":0.00025250885,"threshold_uncertainty_score":0.9999929},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.134882,0.000042991483,0.8634203,0.0004334095,0.0003646354,0.00051920314,0.000058285514,0.00013011972,0.00014906879],"genre_scores_gemma":[0.9864841,9.346223e-7,0.012481288,0.00088270725,0.000023080021,0.00006707542,0.000047372094,0.0000048319575,0.000008622553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893725,0.00013361136,0.00018101,0.00044195575,0.00014680288,0.00015939747],"domain_scores_gemma":[0.99927694,0.00018742669,0.000080425285,0.0002600908,0.00011870559,0.00007639144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039759683,0.00013163617,0.0001799674,0.00012395503,0.00025303164,0.00019948784,0.00018619037,0.000052343028,5.191807e-7],"category_scores_gemma":[0.00007217998,0.000116043295,0.000040017683,0.0002392972,0.000038112186,0.00024403371,0.00002821944,0.00006838543,0.000001409907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131146,0.0006083102,0.003303947,0.0004647012,0.000022549255,0.0000030419412,0.0010331823,0.019382635,0.0005425862,0.020055784,0.0025711106,0.95192087],"study_design_scores_gemma":[0.0006707094,0.00027524968,0.021570688,0.00019930436,0.0000038103128,3.9204295e-7,0.000026967711,0.9718155,0.0008358176,0.0040605487,0.00041378924,0.00012719471],"about_ca_topic_score_codex":0.000036437108,"about_ca_topic_score_gemma":0.000007023907,"teacher_disagreement_score":0.9524329,"about_ca_system_score_codex":0.000050908027,"about_ca_system_score_gemma":0.00006028452,"threshold_uncertainty_score":0.4732108},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063502945,0.008249376,0.87566435,0.0024947075,0.0052542863,0.031040592,0.0022118457,0.000593475,0.0109884385],"genre_scores_gemma":[0.9965686,0.0004571272,0.0006461534,0.000037847225,0.0003618114,0.001419036,0.00003446373,0.000016919601,0.00045804738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560404,0.00024674353,0.001039215,0.00071786216,0.00037471543,0.0020174354],"domain_scores_gemma":[0.9973429,0.00008035353,0.0010622066,0.0011282804,0.0002535672,0.00013272784],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023784311,0.00040631747,0.0008060116,0.00020433565,0.00016537608,0.00034211433,0.0031799036,0.0003871026,0.000014722451],"category_scores_gemma":[0.00007405206,0.0003991607,0.0004655349,0.00018091405,0.00005395921,0.0003752388,0.0011953552,0.0043217544,0.000018528703],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001841334,0.00071571575,0.007137101,0.0013686381,0.0013279227,0.000024516332,0.0026590228,0.0041470383,0.00010386518,0.9551166,0.005209658,0.022005783],"study_design_scores_gemma":[0.0019227391,0.0002654468,0.00037438693,0.0012491482,0.00003767591,0.00019758176,0.00019817466,0.075108096,0.0005328877,0.90062934,0.018705497,0.00077901187],"about_ca_topic_score_codex":0.00041613684,"about_ca_topic_score_gemma":0.0015357551,"teacher_disagreement_score":0.93306565,"about_ca_system_score_codex":0.0017602661,"about_ca_system_score_gemma":0.010113825,"threshold_uncertainty_score":0.99984604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015619726,0.0014685591,0.9910306,0.00054904615,0.0014810336,0.0009482667,0.000058082514,0.00017677473,0.0042720656],"genre_scores_gemma":[0.23759012,0.00011453151,0.7520744,0.0037107014,0.0004543722,0.00055130327,0.00013161516,0.000053479205,0.0053194873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723744,0.00003372273,0.00055920635,0.0010792363,0.0005828842,0.00050748285],"domain_scores_gemma":[0.9964189,0.00072360196,0.00028999618,0.002050878,0.00042093315,0.00009567346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000765708,0.0004137384,0.0005175325,0.0005304385,0.0003720689,0.0007018092,0.004099132,0.00027527235,0.000010277936],"category_scores_gemma":[0.00005935731,0.0004013136,0.00018198791,0.00047187172,0.00031246067,0.00045681474,0.0007125455,0.0004138656,0.000013059252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124436765,0.00007055444,0.00003354533,0.00028986335,0.00002082916,0.00001068764,0.0006331821,0.06211586,0.00008053277,0.20110217,0.0010193563,0.734611],"study_design_scores_gemma":[0.0004792912,0.00016065054,0.000019385974,0.0010935813,0.000009168926,0.000005963395,4.902384e-7,0.8652509,0.0011277993,0.06402423,0.06720374,0.00062480534],"about_ca_topic_score_codex":0.000036300913,"about_ca_topic_score_gemma":0.000085335,"teacher_disagreement_score":0.80313504,"about_ca_system_score_codex":0.00027116822,"about_ca_system_score_gemma":0.00066406233,"threshold_uncertainty_score":0.9998439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3197254,0.0020819895,0.3955477,0.046146568,0.0027223555,0.0038658709,0.003154065,0.00041957098,0.22633648],"genre_scores_gemma":[0.9833844,0.00010883787,0.015579778,0.0001539084,0.0000064449123,0.0000086253,0.000015817732,0.000004058122,0.0007381392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99834377,0.000007981167,0.0004932259,0.00045032863,0.0005329125,0.00017180189],"domain_scores_gemma":[0.9966889,0.000021659642,0.00048651805,0.0025690312,0.00021181266,0.000022079084],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008020885,0.00012325744,0.00037077797,0.00024600985,0.000038959155,0.000050121333,0.011908105,0.000032593234,0.000004454307],"category_scores_gemma":[0.00012284525,0.000087969434,0.00011953585,0.0019711622,0.00006312152,0.00045770625,0.007895271,0.00007494777,0.0000015932902],"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.00006987168,0.00044658882,0.012675679,0.0016141352,0.0036602342,0.0000019933002,0.00012820626,0.00047464634,0.0009921243,0.8658156,0.06880877,0.045312144],"study_design_scores_gemma":[0.0048437105,0.0004157328,0.5287294,0.008989298,0.007098665,0.0000030233919,0.00321097,0.18159813,0.058399383,0.092801385,0.112321526,0.0015887925],"about_ca_topic_score_codex":0.000042001746,"about_ca_topic_score_gemma":0.0000019552367,"teacher_disagreement_score":0.77301425,"about_ca_system_score_codex":0.000026075386,"about_ca_system_score_gemma":0.000017782691,"threshold_uncertainty_score":0.99343795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028869217,0.0055384566,0.9559291,0.0001325091,0.004942828,0.0025131209,0.0004955071,0.00025919886,0.0013200669],"genre_scores_gemma":[0.99488527,0.00008832032,0.00010776861,0.00004931271,0.000078454315,0.00041007646,0.0000061509577,0.000040465366,0.004334174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519616,0.00059812755,0.0016615262,0.0009967126,0.0008753109,0.00067214377],"domain_scores_gemma":[0.9966949,0.00035859257,0.0006937962,0.0013495642,0.00059748394,0.00030566996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007926204,0.0006245532,0.001362412,0.00042922783,0.0003469605,0.0006039742,0.0007645341,0.00024448984,0.000002080526],"category_scores_gemma":[0.0000070793567,0.00051535905,0.0002073896,0.0006658973,0.0002069335,0.00016911511,0.000008938828,0.00038257564,0.000028527602],"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.00052930275,0.0012309724,0.0005016114,0.0051728473,0.0021376777,0.00032371207,0.0012667507,0.9470008,0.0027570303,0.02972471,0.004405197,0.004949384],"study_design_scores_gemma":[0.0057218918,0.00058331166,0.00015587533,0.0038955575,0.00021811639,0.00046353365,0.0014701781,0.9709874,0.0011610787,0.000012393239,0.014487834,0.00084286917],"about_ca_topic_score_codex":0.0018957965,"about_ca_topic_score_gemma":0.000045445933,"teacher_disagreement_score":0.96601605,"about_ca_system_score_codex":0.00017470545,"about_ca_system_score_gemma":0.00021675268,"threshold_uncertainty_score":0.9997298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005490049,0.00003917926,0.8033919,0.0018137268,0.00016617519,0.00007292478,0.0000022316813,0.00011543189,0.19384944],"genre_scores_gemma":[0.9644964,0.0000028837069,0.012035272,0.0004105835,0.000016869464,0.00002103815,0.0000022693332,0.0000011748322,0.023013532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995206,0.0000082633205,0.0000960852,0.00016163285,0.00010379466,0.00010960095],"domain_scores_gemma":[0.9995842,0.000009635867,0.000018194383,0.00030904706,0.000052316536,0.000026598243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006162028,0.000050560073,0.0000628617,0.000036228477,0.00007259633,0.00007322942,0.0002732181,0.000014762888,0.000019409907],"category_scores_gemma":[0.000002788189,0.000034332224,0.000015320022,0.00037599454,0.000012532966,0.00013427193,0.000059349557,0.000034550285,0.000035840338],"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.0000026566918,0.00007270308,0.00269536,0.0000121581,0.000031911866,0.000005573365,0.000053012864,0.000278901,0.00007150878,0.9356292,0.051029645,0.0101174],"study_design_scores_gemma":[0.00090429815,0.00010913428,0.026717491,0.00012191741,0.000009334968,0.000012594407,0.00007065345,0.12445695,0.00091877696,0.0005813459,0.845909,0.00018848189],"about_ca_topic_score_codex":0.000040679013,"about_ca_topic_score_gemma":0.000027885428,"teacher_disagreement_score":0.96394736,"about_ca_system_score_codex":0.0000071718873,"about_ca_system_score_gemma":0.000039432,"threshold_uncertainty_score":0.14000274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056571546,0.0002893584,0.75866,0.0011233186,0.0010092403,0.00019993949,0.000006480152,0.00045673642,0.23259777],"genre_scores_gemma":[0.94749427,0.00005561398,0.029471299,0.0019261974,0.000079493424,0.0000327974,0.000013013742,0.0000074335267,0.020919902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876285,0.00004569274,0.000270645,0.00040701803,0.0002243555,0.00028945133],"domain_scores_gemma":[0.9991809,0.00005214282,0.000051941926,0.000554588,0.00010515448,0.000055249606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035657463,0.00012072032,0.00015962034,0.00006931521,0.00022778343,0.00026320646,0.0006231879,0.000058775124,0.00004321349],"category_scores_gemma":[0.000023151666,0.00010623247,0.00005527514,0.0006115169,0.000012795571,0.0005494023,0.00032582105,0.000091952534,0.00007981378],"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.000014153144,0.00033537744,0.0024263125,0.00013309337,0.00006273158,0.000023541692,0.001012978,0.00032466458,0.0027589945,0.7984429,0.12729512,0.06717016],"study_design_scores_gemma":[0.0005688274,0.00004958514,0.00071391516,0.00009323949,0.000004330882,0.000005515328,0.00007161777,0.104917,0.001178925,0.0027471054,0.88943404,0.0002158797],"about_ca_topic_score_codex":0.00010983213,"about_ca_topic_score_gemma":0.00002106197,"teacher_disagreement_score":0.9418371,"about_ca_system_score_codex":0.00010336641,"about_ca_system_score_gemma":0.00011562025,"threshold_uncertainty_score":0.43320346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35816187,0.0066831065,0.56703985,0.014146255,0.0011574714,0.0036370961,0.00007298273,0.0013948814,0.04770648],"genre_scores_gemma":[0.98363596,0.000009806823,0.0010817175,0.00040916563,0.000030344367,0.00012706891,0.000005011092,0.000011591659,0.014689345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828833,0.000046201578,0.0003174599,0.00058334967,0.00037489398,0.00038975233],"domain_scores_gemma":[0.9988689,0.000030504236,0.00012778069,0.0005865286,0.00031397698,0.00007234111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017901085,0.00025554534,0.0003632307,0.00014076282,0.00010638552,0.00045626968,0.0008049637,0.00009386617,0.0000010528817],"category_scores_gemma":[0.000030083076,0.00014704985,0.000020240925,0.001257949,0.000080816804,0.00041248946,0.00009746241,0.00020566714,0.00000393195],"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.0038195217,0.003800404,0.20500937,0.03836884,0.0017089689,0.003932347,0.02158419,0.08558733,0.017734729,0.5381561,0.05306491,0.027233323],"study_design_scores_gemma":[0.026032679,0.004566507,0.03437693,0.05888703,0.00027982527,0.0015203907,0.020748496,0.3535354,0.12147513,0.0002532602,0.3686146,0.009709729],"about_ca_topic_score_codex":0.0014204123,"about_ca_topic_score_gemma":0.0020166654,"teacher_disagreement_score":0.6254741,"about_ca_system_score_codex":0.000041758936,"about_ca_system_score_gemma":0.00052493793,"threshold_uncertainty_score":0.5996519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002404092,0.00025753034,0.9944704,0.0007066782,0.0006091484,0.0011214264,0.000035039506,0.000039821774,0.00035585478],"genre_scores_gemma":[0.9569693,0.0000018707734,0.042099696,0.0005478992,0.000031878477,0.00009917402,0.0000020150242,0.000003889253,0.00024423614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987894,0.00006904479,0.00034551395,0.00034483432,0.00020588521,0.00024530044],"domain_scores_gemma":[0.9988592,0.00017883808,0.00008051992,0.00054935535,0.00027699428,0.000055057764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802439,0.000117964344,0.00020696307,0.00004042632,0.00016740714,0.00009030161,0.0007349054,0.000036865327,0.0000046094183],"category_scores_gemma":[0.000057840054,0.00008024093,0.00013316654,0.0004046369,0.00004957827,0.00010873678,0.0001835532,0.00005194398,0.000001522355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012624374,0.0008825038,0.0005791654,0.0008435486,0.0005707387,0.000003598587,0.005352744,0.17374934,0.028201949,0.12437671,0.022116575,0.6431969],"study_design_scores_gemma":[0.00051922724,0.00017995138,0.00021475587,0.000070860384,0.000022051305,0.0000023661332,0.00035362013,0.9759378,0.0065924493,0.0003663814,0.015586972,0.00015358152],"about_ca_topic_score_codex":0.00010880142,"about_ca_topic_score_gemma":0.000006220951,"teacher_disagreement_score":0.9545652,"about_ca_system_score_codex":0.00009583186,"about_ca_system_score_gemma":0.00014723328,"threshold_uncertainty_score":0.327213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096945755,0.0004623742,0.82325524,0.05856487,0.0022583094,0.0027949226,0.00029942763,0.00039109506,0.015028015],"genre_scores_gemma":[0.96299124,0.0000732037,0.034544118,0.00040042782,0.000027671764,0.000023269064,0.000009769591,0.000011791529,0.0019185258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983535,0.000008158059,0.00040866708,0.0005649548,0.0004299913,0.00023472252],"domain_scores_gemma":[0.9976196,0.000035943754,0.00032407706,0.0018393607,0.00014326943,0.00003770901],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00050944556,0.00018034191,0.00025284203,0.00012808674,0.000095016236,0.00013553043,0.008679803,0.0000592386,0.00000951819],"category_scores_gemma":[0.00012746618,0.00012901933,0.000069013724,0.00062171655,0.000041186657,0.0010122329,0.002697233,0.00016180618,0.000002446287],"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.0015208987,0.0032133416,0.00887787,0.023824217,0.0037892552,0.00002191597,0.007870779,0.0016398174,0.03264361,0.1794755,0.3062414,0.4308814],"study_design_scores_gemma":[0.011086256,0.0023948052,0.017329589,0.07438261,0.0019239751,0.000033778393,0.016933832,0.41205817,0.23491332,0.0790498,0.14589098,0.004002865],"about_ca_topic_score_codex":0.00009950792,"about_ca_topic_score_gemma":0.000012834901,"teacher_disagreement_score":0.8660455,"about_ca_system_score_codex":0.00004496994,"about_ca_system_score_gemma":0.000021526888,"threshold_uncertainty_score":0.9966837},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070423023,0.00040129002,0.89476293,0.004868401,0.0009235011,0.0003283923,0.000013398123,0.00034132155,0.09131849],"genre_scores_gemma":[0.97664064,0.0000033342305,0.022017522,0.000268981,0.000013309045,0.000040250303,0.0000046448336,0.000006572434,0.001004734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984606,0.000086402615,0.00043086227,0.00039773714,0.00030824987,0.00031615837],"domain_scores_gemma":[0.9984871,0.0004339703,0.000051260336,0.0007974373,0.0001469676,0.000083235405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905767,0.0001591507,0.0002710233,0.00013141886,0.00015812083,0.00018922107,0.0006918037,0.00009464342,0.000051290957],"category_scores_gemma":[0.0006277969,0.00014006309,0.000115413095,0.0005696507,0.000069039954,0.00032329126,0.00015065314,0.000120303,0.00018990909],"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.0000059232375,0.00013269775,0.0000053605067,0.00017764456,0.000016315782,0.000017158212,0.00026789668,0.0000013763332,0.00029810748,0.97803706,0.008113458,0.01292701],"study_design_scores_gemma":[0.00050976884,0.000048895297,0.00059367745,0.00043347475,0.000027495484,0.00005334928,0.0001260641,0.20612513,0.0008721783,0.75801563,0.032913398,0.00028093831],"about_ca_topic_score_codex":0.000006410976,"about_ca_topic_score_gemma":0.0000023406274,"teacher_disagreement_score":0.96959835,"about_ca_system_score_codex":0.000046952482,"about_ca_system_score_gemma":0.000058936424,"threshold_uncertainty_score":0.5711607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007325749,0.00027355336,0.89133203,0.0025316568,0.00063725334,0.00016674714,0.000017853705,0.00031888337,0.10398943],"genre_scores_gemma":[0.9362899,0.000039302897,0.02643397,0.002034502,0.000045309538,0.000040861083,0.000019937761,0.0000059686276,0.035090238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894375,0.000036648562,0.00021001599,0.0003794408,0.00020579921,0.00022433726],"domain_scores_gemma":[0.9990142,0.000023912848,0.000033702527,0.0007689951,0.00009787382,0.0000612992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020127012,0.00011346716,0.00015280962,0.00009341638,0.000117110125,0.00019996038,0.0008163006,0.000029024677,0.000029007111],"category_scores_gemma":[0.000034677836,0.00006105133,0.000058513087,0.0007460621,0.000035442736,0.0004820473,0.0003271453,0.00007505789,0.00007445482],"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.000004346255,0.00015883335,0.00077707757,0.000046309655,0.000025835867,0.000024330968,0.00007176091,0.000025342826,0.0002697237,0.41428885,0.30099434,0.28331324],"study_design_scores_gemma":[0.00046280553,0.000057072084,0.008597229,0.00015987807,0.000005881314,0.000013294203,0.000036989684,0.025276117,0.0015490231,0.002411386,0.96114045,0.00028987325],"about_ca_topic_score_codex":0.0005117688,"about_ca_topic_score_gemma":0.000057022593,"teacher_disagreement_score":0.93555737,"about_ca_system_score_codex":0.000017947854,"about_ca_system_score_gemma":0.00011378005,"threshold_uncertainty_score":0.24896011},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003109116,0.000028470724,0.9955107,0.0028325445,0.00057613064,0.00032042514,0.00022707101,0.00011044728,0.000083298706],"genre_scores_gemma":[0.7585147,0.000010350242,0.24053569,0.00013021335,0.00003621464,0.00004446945,0.0000057507045,0.0000083164705,0.00071429677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00003158245,0.0003874569,0.0002742766,0.00011128683,0.00017802235],"domain_scores_gemma":[0.99919856,0.00016575234,0.00006982465,0.0003128453,0.00019800798,0.000055017354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019832833,0.00013049768,0.00020221424,0.0002095279,0.00026080024,0.00010491196,0.00021567845,0.00008337809,0.000003809592],"category_scores_gemma":[0.000018246586,0.0001348796,0.00006609897,0.00042819776,0.00003205098,0.00032472613,0.0000027254182,0.00012275917,0.0000031296076],"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.000008899917,0.00012669833,0.0000031646355,0.000050683553,0.000036172354,3.7191379e-7,0.000095999836,0.9341621,0.0017219525,0.031161608,0.000074507436,0.03255788],"study_design_scores_gemma":[0.0008109581,0.00009092088,0.0010287617,0.00013975121,0.00003760012,0.000004968198,0.000052231753,0.990555,0.0062843976,0.00047303236,0.00034327438,0.00017913348],"about_ca_topic_score_codex":0.00034915324,"about_ca_topic_score_gemma":0.00021224646,"teacher_disagreement_score":0.7582038,"about_ca_system_score_codex":0.00008625052,"about_ca_system_score_gemma":0.0002933909,"threshold_uncertainty_score":0.5500231},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034948541,0.00061724446,0.17186499,0.00012582174,0.0005647003,0.00052606215,0.0000632264,0.00018063778,0.8260538],"genre_scores_gemma":[0.00057009474,0.0000969258,0.03241735,0.0002585813,0.00011272141,0.00005425011,0.000024048919,0.00004883755,0.9664172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974445,0.000021443664,0.00092116825,0.00068734575,0.00051452493,0.00041100717],"domain_scores_gemma":[0.99754506,0.00025053855,0.00044150327,0.001488478,0.0001729631,0.000101470265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042390113,0.00052490586,0.0008750987,0.0002879708,0.0000840365,0.00023107008,0.0016446549,0.00047827087,0.000041974097],"category_scores_gemma":[0.00006920333,0.0005084031,0.00022850109,0.000093547824,0.00010664034,0.0001846431,0.00053296605,0.00063101266,0.000271643],"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.0000012676328,0.000039676477,0.0000017659872,0.00039632348,0.000042547577,0.00009166856,0.0005778336,0.000007828754,0.0000058169126,0.97790915,0.014542512,0.006383583],"study_design_scores_gemma":[0.00043407467,0.00004665389,0.000010250413,0.0040603084,0.000034222747,0.000033185537,0.000035908382,0.010668406,0.00006560897,0.55594295,0.42784682,0.00082159863],"about_ca_topic_score_codex":0.000005707582,"about_ca_topic_score_gemma":0.000014991552,"teacher_disagreement_score":0.42196622,"about_ca_system_score_codex":0.00021361106,"about_ca_system_score_gemma":0.000271092,"threshold_uncertainty_score":0.9997368},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022065965,0.015762351,0.38072315,0.011196638,0.0039463514,0.01547828,0.0007962127,0.0040012836,0.5658891],"genre_scores_gemma":[0.44472477,0.00046858087,0.0010372205,0.0003166536,0.00013795099,0.00045987108,0.00027784414,0.00004978995,0.5525273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707836,0.000073293646,0.00084296596,0.0013857721,0.0004162228,0.00020341206],"domain_scores_gemma":[0.9964885,0.00010779478,0.0005737434,0.0023316226,0.00039275558,0.00010557967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004530674,0.00038388115,0.0006005733,0.00018113502,0.0003636678,0.00042821123,0.0007408619,0.00017953326,0.000012903681],"category_scores_gemma":[0.00006952948,0.0003772879,0.00008505221,0.00013647668,0.000081554994,0.00042619137,0.00030601933,0.00021607336,0.00007200585],"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.000073555486,0.0002739341,0.00047590554,0.00012330426,0.00027114866,0.000012785774,0.00072164147,0.0000058524856,0.00025731124,0.86757797,0.04373399,0.086472616],"study_design_scores_gemma":[0.001053728,0.0001973603,0.008311367,0.000226074,0.00008426681,0.000031646254,0.0001463789,0.001647753,0.00009714348,0.0075956415,0.97995514,0.0006535001],"about_ca_topic_score_codex":0.000024156823,"about_ca_topic_score_gemma":0.000017287524,"teacher_disagreement_score":0.9362211,"about_ca_system_score_codex":0.00009028057,"about_ca_system_score_gemma":0.00008610274,"threshold_uncertainty_score":0.9998679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075573134,0.000111462534,0.5163749,0.002383103,0.00062523293,0.00020406583,0.000002082908,0.00023650815,0.47250533],"genre_scores_gemma":[0.97460115,0.00001086297,0.003961011,0.00085189036,0.00001935321,0.000019129955,0.0000018556966,0.0000031955742,0.02053157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988228,0.00003999281,0.0003033648,0.000351174,0.00019237777,0.00029025305],"domain_scores_gemma":[0.9992957,0.000048921193,0.00003894705,0.0005017601,0.0000657262,0.000048956572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036065042,0.00010860558,0.00019221204,0.00020386191,0.00006634085,0.00015858407,0.0006378087,0.000042980595,0.000019240404],"category_scores_gemma":[0.000022249416,0.00009758868,0.000044048,0.0012771704,0.000017182794,0.00027194008,0.00017057247,0.00012429709,0.00008455876],"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.0000069836556,0.00013036968,0.017164448,0.00006944882,0.000018232398,0.000051768846,0.00033771858,0.0006555879,0.0008490301,0.8960678,0.053366978,0.031281613],"study_design_scores_gemma":[0.0021729388,0.000055614382,0.13559751,0.0011896653,0.000005935547,0.0000089773375,0.00011864903,0.26496753,0.0017623644,0.013655429,0.5796291,0.00083623425],"about_ca_topic_score_codex":0.0021498643,"about_ca_topic_score_gemma":0.0036193237,"teacher_disagreement_score":0.9670438,"about_ca_system_score_codex":0.00011286801,"about_ca_system_score_gemma":0.000119881,"threshold_uncertainty_score":0.3979551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073656295,0.00023910875,0.9857531,0.0004286885,0.0009329498,0.00018111298,0.000015645066,0.00014052118,0.004943213],"genre_scores_gemma":[0.9660008,0.000009753737,0.033324067,0.000102847014,0.00001581609,0.000019816112,0.0000017541861,0.0000034366217,0.00052170677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887097,0.0000431317,0.00043832994,0.00028606065,0.00014126852,0.00022021675],"domain_scores_gemma":[0.99934214,0.00008069452,0.0000948391,0.00031684598,0.00012857697,0.000036874088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012685548,0.00012032541,0.00022830201,0.00003689836,0.00014533727,0.00008502444,0.0003451609,0.000053036234,0.000036130255],"category_scores_gemma":[0.000021433605,0.00010782282,0.00008136642,0.00040993022,0.000053447842,0.0001868937,0.000039568273,0.00011120173,0.0000075249172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001981013,0.0009796814,0.0026000363,0.00047053955,0.00034387584,0.000032039105,0.0046371697,0.016932331,0.012526948,0.49550462,0.003641311,0.46231166],"study_design_scores_gemma":[0.0022730443,0.00006944845,0.0010543138,0.00031971553,0.000024105619,0.000014042952,0.00066105044,0.9066832,0.040080585,0.00022175154,0.048185557,0.00041317465],"about_ca_topic_score_codex":0.0002384543,"about_ca_topic_score_gemma":0.00010114728,"teacher_disagreement_score":0.95863515,"about_ca_system_score_codex":0.000020658454,"about_ca_system_score_gemma":0.00011462308,"threshold_uncertainty_score":0.4396887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076693753,0.00039851802,0.98579925,0.003245294,0.0025984845,0.00018478015,0.0000369452,0.00003083901,0.000036532623],"genre_scores_gemma":[0.95691925,0.000051367602,0.04197282,0.00020317276,0.00007116465,0.000007174823,0.000014295851,0.000006252171,0.00075448205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.000052409672,0.00062498875,0.0001484987,0.00031905583,0.0001267277],"domain_scores_gemma":[0.99825937,0.00010215289,0.000509113,0.00011717755,0.0009559872,0.000056196153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040159037,0.00011063272,0.00021098535,0.0002146631,0.00008071157,0.0003423982,0.00038682562,0.00006531641,0.0000015195544],"category_scores_gemma":[0.00007813384,0.00009686362,0.000092904025,0.00011902476,0.000018090459,0.00022110448,0.000059596838,0.0000791399,0.000005370302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004149161,0.00023842482,0.000093066206,0.000103997125,0.00055467145,0.0000345076,0.00019785583,0.2126467,0.0070583564,0.7656687,0.0029300821,0.010432145],"study_design_scores_gemma":[0.0010857173,0.000047348836,0.0006241868,0.000300764,0.00002314565,0.0000697973,0.00004108715,0.9913577,0.00020727474,0.005422256,0.00072755973,0.00009319382],"about_ca_topic_score_codex":0.000008098647,"about_ca_topic_score_gemma":0.0000029881485,"teacher_disagreement_score":0.9492499,"about_ca_system_score_codex":0.00013063774,"about_ca_system_score_gemma":0.00011724922,"threshold_uncertainty_score":0.39499837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14047806,0.000027063646,0.85556066,0.0016096209,0.00036342707,0.00031615284,0.000020902777,0.00004454593,0.0015795782],"genre_scores_gemma":[0.9983394,4.810349e-7,0.0003795427,0.0004204546,0.000015668105,0.000027509888,0.000008310384,0.0000022565328,0.0008063641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998952,0.0002741367,0.00022742778,0.00022624068,0.00019421111,0.00012599373],"domain_scores_gemma":[0.9989834,0.00018129678,0.000058261758,0.00062120496,0.000113307615,0.000042540472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005462172,0.00008329798,0.00013569815,0.00006740992,0.000067021625,0.0001984842,0.0006913497,0.00003078503,0.0000034852692],"category_scores_gemma":[0.0000687971,0.000049996772,0.000034408124,0.00057666743,0.000012390587,0.000145795,0.00006390883,0.00006283456,0.000014968197],"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.000022943243,0.00013393245,0.0015644899,0.00003500222,0.000031319996,0.000001533645,0.00069367304,0.04276045,0.0017056338,0.9199412,0.026572406,0.0065374207],"study_design_scores_gemma":[0.0006783437,0.0006570329,0.14614534,0.0005550772,0.000009380744,0.0000070739566,0.00035651386,0.80009675,0.003647512,0.0027136607,0.044641215,0.000492076],"about_ca_topic_score_codex":0.0023340522,"about_ca_topic_score_gemma":0.0018036023,"teacher_disagreement_score":0.9172275,"about_ca_system_score_codex":0.000018924338,"about_ca_system_score_gemma":0.00005437937,"threshold_uncertainty_score":0.35284042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6503596,0.0011251885,0.050931405,0.04387285,0.0040370016,0.0028511814,0.000117984506,0.0007096771,0.24599516],"genre_scores_gemma":[0.9922834,0.000008166343,0.00408646,0.00029980353,0.000025060584,0.000039554918,8.12755e-7,0.000005559173,0.003251171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987016,0.0000079636675,0.00037294385,0.00032492244,0.00031855298,0.00027404705],"domain_scores_gemma":[0.99921596,0.000031823827,0.00020145453,0.00025065953,0.00024642068,0.00005366249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021493429,0.00015432826,0.00022858329,0.00007127457,0.00011513899,0.000106779895,0.0012967394,0.000057900612,0.0000045790985],"category_scores_gemma":[0.000042285763,0.00010499943,0.00011018165,0.0006047031,0.00008190897,0.000094706775,0.00045171398,0.00013237954,0.000009042058],"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.00003604531,0.00029032675,0.0052591744,0.00031530386,0.00016165739,0.0000025572594,0.00059512723,0.000039536888,0.11401966,0.8262026,0.034007836,0.019070195],"study_design_scores_gemma":[0.0074518444,0.00043212096,0.06660543,0.0028778375,0.00019168218,0.00014917093,0.0011267962,0.23473954,0.42931283,0.083531074,0.17184035,0.0017413225],"about_ca_topic_score_codex":0.00005939519,"about_ca_topic_score_gemma":0.000003253296,"teacher_disagreement_score":0.7426715,"about_ca_system_score_codex":0.000088702036,"about_ca_system_score_gemma":0.000058000467,"threshold_uncertainty_score":0.42817524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99250644,0.0004031485,0.0032042393,0.0019539336,0.00032235423,0.00046850296,0.000017589318,0.00010408364,0.0010197286],"genre_scores_gemma":[0.99751866,0.000059978465,0.0013314224,0.00016240499,0.000012129732,0.000028966866,0.0000012356161,0.0000069695293,0.0008782052],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987068,0.000009250412,0.00038980288,0.00038902895,0.00021396577,0.00029114034],"domain_scores_gemma":[0.9991428,0.000021565458,0.00028017611,0.0002572214,0.00025196557,0.000046239926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030174173,0.00018000237,0.00027169555,0.00009464311,0.00024230323,0.000190034,0.00079280534,0.000042127333,0.0000021764458],"category_scores_gemma":[0.000035673365,0.00012604785,0.0000413609,0.0007202574,0.00010224499,0.00041821576,0.00049768476,0.000110263754,0.0000016880847],"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.00025443942,0.00047580485,0.16041873,0.0023468004,0.0005253431,0.0000037932173,0.0020702307,0.0015315213,0.6861364,0.08881836,0.011442597,0.045975957],"study_design_scores_gemma":[0.0020863318,0.00011712857,0.049714103,0.001152659,0.000058800997,0.00004363121,0.00009686054,0.13741918,0.79933757,0.0055891583,0.003908764,0.0004758467],"about_ca_topic_score_codex":0.00026009826,"about_ca_topic_score_gemma":0.0000020008613,"teacher_disagreement_score":0.13588765,"about_ca_system_score_codex":0.00007010621,"about_ca_system_score_gemma":0.000038679373,"threshold_uncertainty_score":0.5140082},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85472083,0.001273978,0.10820852,0.004040956,0.0025351958,0.0013165252,0.000016658993,0.0002951736,0.02759216],"genre_scores_gemma":[0.9962987,0.0000061672476,0.0028691934,0.00019380433,0.000027884902,0.000046639485,2.3774201e-7,0.0000055799023,0.0005518394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983859,0.000007998908,0.00039347756,0.00039437748,0.00048072147,0.00033751564],"domain_scores_gemma":[0.9991534,0.000033579243,0.00023573016,0.0002953817,0.00022895605,0.00005295582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047778734,0.00017046531,0.0002363288,0.00012563188,0.00020383029,0.00017436255,0.0017387815,0.000055079952,0.0000025442505],"category_scores_gemma":[0.00007768048,0.00011729364,0.00014095775,0.0010221984,0.00006996985,0.00012601336,0.00076624355,0.00014215168,0.0000056418767],"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.0000150579035,0.00031771732,0.0053490666,0.00024796446,0.00007552688,8.1291597e-7,0.0006047437,0.0024549426,0.06917038,0.90727586,0.0066732913,0.007814625],"study_design_scores_gemma":[0.0022624384,0.00013860497,0.013204361,0.0017716611,0.000071532246,0.000017675753,0.0004186212,0.09654362,0.80746365,0.009427817,0.06799141,0.0006885836],"about_ca_topic_score_codex":0.000031146697,"about_ca_topic_score_gemma":6.6391397e-7,"teacher_disagreement_score":0.89784807,"about_ca_system_score_codex":0.000106490304,"about_ca_system_score_gemma":0.000052613064,"threshold_uncertainty_score":0.47830957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32650098,0.0062121293,0.6388805,0.017060313,0.005092218,0.0002811856,0.000053385458,0.00002444246,0.005894849],"genre_scores_gemma":[0.9980124,0.00020056723,0.0007262545,0.0007507075,0.00008614822,0.000004799361,7.0539886e-7,0.0000019218776,0.00021647618],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99930876,0.0000940652,0.000214296,0.00013474558,0.00012757657,0.000120576355],"domain_scores_gemma":[0.999198,0.00031533718,0.00013157996,0.00012274634,0.00016644965,0.0000658416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344446,0.00008533503,0.00016117527,0.000058093632,0.00013504365,0.00016352761,0.00023872951,0.00003196267,0.000008164787],"category_scores_gemma":[0.00013396137,0.000050848703,0.00003634447,0.00013122584,0.000091017544,0.00036381968,0.0000988707,0.0002701935,0.0000012315304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002864628,0.00032092092,0.012359906,0.000104938226,0.0007698696,0.00021479538,0.05393569,0.00012795709,0.01017864,0.24470519,0.16367367,0.51332194],"study_design_scores_gemma":[0.0074511725,0.0009098009,0.34990275,0.0033005315,0.00018025342,0.0035103604,0.011480294,0.11524629,0.04390593,0.11866654,0.34424916,0.0011969282],"about_ca_topic_score_codex":0.000010767583,"about_ca_topic_score_gemma":0.000011004155,"teacher_disagreement_score":0.6715115,"about_ca_system_score_codex":0.000014148824,"about_ca_system_score_gemma":0.00007525974,"threshold_uncertainty_score":0.207355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015217753,0.0025796616,0.59066516,0.010347088,0.0031682302,0.0015028014,0.000029878855,0.00042550243,0.37606394],"genre_scores_gemma":[0.9920134,0.000023014867,0.0037939833,0.00028951673,0.00003188239,0.000036269175,4.674008e-7,0.0000044074877,0.0038070772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988515,0.000005289892,0.00030005974,0.00027758811,0.00032315453,0.00024244047],"domain_scores_gemma":[0.999318,0.000027492319,0.00015339488,0.00023630128,0.0002217013,0.000043122716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033009035,0.000118593285,0.00019111855,0.00012122694,0.00011081997,0.00011296882,0.001343171,0.00005175343,0.0000024139977],"category_scores_gemma":[0.00006822992,0.000080196376,0.00009827281,0.0015429758,0.00005601787,0.0002218441,0.0005153634,0.00012105671,0.000011640454],"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.000016720736,0.00027249838,0.0028982598,0.0002831254,0.00009025564,9.1019933e-7,0.0002389016,0.00015583723,0.009676969,0.8333809,0.08016745,0.07281817],"study_design_scores_gemma":[0.0018439834,0.00019547481,0.0073222015,0.0008116674,0.000056868805,0.00002319457,0.00026936515,0.06559712,0.51609147,0.025245363,0.38203192,0.0005113603],"about_ca_topic_score_codex":0.00008052291,"about_ca_topic_score_gemma":8.675389e-7,"teacher_disagreement_score":0.9767956,"about_ca_system_score_codex":0.00008193474,"about_ca_system_score_gemma":0.000053570373,"threshold_uncertainty_score":0.3270313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004752785,0.0006040714,0.98710626,0.004492371,0.0009195286,0.0012525523,0.00006398191,0.00011316557,0.0006952647],"genre_scores_gemma":[0.99533755,0.00002146671,0.0036944335,0.00045567332,0.000015986263,0.00030312993,0.000002137849,0.000006792753,0.0001628372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862695,0.00000806765,0.00042695273,0.00033664567,0.00025744052,0.0003439739],"domain_scores_gemma":[0.99910736,0.00005516879,0.0002484423,0.00020049015,0.0003249962,0.000063538515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032773567,0.00017427627,0.0002914998,0.00009572849,0.00023515393,0.00013485012,0.0010147197,0.00005533208,0.0000069084244],"category_scores_gemma":[0.000033404576,0.00012923428,0.00026105804,0.0005696493,0.00006584578,0.00024061048,0.000033147295,0.00010937337,0.0000016462201],"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.00049117045,0.0013616342,0.018603522,0.0021033797,0.0009209264,0.0000018026677,0.0010758905,0.0036349632,0.03658173,0.8386704,0.028439865,0.06811477],"study_design_scores_gemma":[0.036120217,0.00051207986,0.0125851715,0.0029731449,0.0007031078,0.00001883219,0.0003431571,0.29213154,0.46728662,0.03828,0.14744172,0.0016044066],"about_ca_topic_score_codex":0.000019556868,"about_ca_topic_score_gemma":0.0000030973022,"teacher_disagreement_score":0.99058473,"about_ca_system_score_codex":0.00006249616,"about_ca_system_score_gemma":0.00008773111,"threshold_uncertainty_score":0.5270021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023404555,0.00016018788,0.9746752,0.0014440326,0.0006478974,0.00023062047,0.000003065696,0.0002424044,0.020256143],"genre_scores_gemma":[0.9618157,0.000010000231,0.018128915,0.0014836622,0.00003020417,0.00005161759,0.000003848717,0.0000041654425,0.018471884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989978,0.000045683486,0.00023631199,0.00033034984,0.00016411711,0.00022574025],"domain_scores_gemma":[0.99923486,0.000054085045,0.00004798883,0.0005319232,0.000070885544,0.000060251972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021644037,0.00011214167,0.0001845687,0.000070495356,0.000111650144,0.00042522955,0.0012438529,0.000046259283,0.000027851373],"category_scores_gemma":[0.000022904289,0.000087669614,0.00007085402,0.0004885298,0.000018838631,0.00036538477,0.0003261923,0.00007111262,0.00006835772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014829666,0.0011435227,0.016747538,0.00030645358,0.00040109802,0.00010582318,0.0012765703,0.00498078,0.009871482,0.39316982,0.2417185,0.3301301],"study_design_scores_gemma":[0.009837713,0.000034791454,0.028782936,0.00017498316,0.00001379417,0.000007663318,0.000083212486,0.66871214,0.008858607,0.0007892621,0.2821605,0.0005444039],"about_ca_topic_score_codex":0.00010518156,"about_ca_topic_score_gemma":0.000023778164,"teacher_disagreement_score":0.9594752,"about_ca_system_score_codex":0.000034302666,"about_ca_system_score_gemma":0.00004995218,"threshold_uncertainty_score":0.41004983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10343306,0.000033438104,0.866254,0.00027596735,0.0005552504,0.0005809503,0.00011002448,0.00023033707,0.028526984],"genre_scores_gemma":[0.99384683,0.00005292678,0.0013760318,0.00024000244,0.000034240857,0.0000048858356,0.000023895996,0.000011532867,0.004409644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974776,0.00014424797,0.00029458004,0.0014817644,0.00014177209,0.0004600568],"domain_scores_gemma":[0.9979242,0.00007754049,0.0001696095,0.0015326255,0.00011745237,0.00017854935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027883294,0.00039060193,0.0004955052,0.00047478313,0.00011683902,0.00018500039,0.0022307462,0.00032276378,0.000006505162],"category_scores_gemma":[0.000021501004,0.00043036885,0.0001775223,0.0009974742,0.000047946494,0.00036494352,0.0023393196,0.00062959007,0.000081650614],"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.00004907919,0.00026734432,0.00060299365,0.00020018996,0.000030767587,0.0003518077,0.00052980194,0.7696108,0.00005053402,0.22540307,0.0014718518,0.0014317323],"study_design_scores_gemma":[0.0005013459,0.000037211063,0.0007002807,0.0006211271,0.000011849084,0.000001132893,0.000056456927,0.97650725,0.00006712713,0.02002148,0.0010085776,0.0004661851],"about_ca_topic_score_codex":0.00039807617,"about_ca_topic_score_gemma":0.00011482396,"teacher_disagreement_score":0.89041376,"about_ca_system_score_codex":0.00033501053,"about_ca_system_score_gemma":0.00016138474,"threshold_uncertainty_score":0.9998148},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004461289,0.010009096,0.15111023,0.0010199489,0.00027114298,0.0005245509,0.00012896888,0.00028694948,0.83664465],"genre_scores_gemma":[0.013146375,0.0008193963,0.02180963,0.0018694112,0.00013421472,0.00011226434,0.00040031766,0.00006861843,0.96163976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979213,0.00004965876,0.0005896404,0.0006234338,0.0005220735,0.0002938846],"domain_scores_gemma":[0.9965657,0.00016908096,0.00042963264,0.0023729394,0.00034894148,0.00011372835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030004213,0.00041648585,0.00058026623,0.00013417374,0.00018592419,0.0002818209,0.002378007,0.0002729513,0.000101272046],"category_scores_gemma":[0.000010993888,0.00036027722,0.00013473806,0.000067603876,0.00010988509,0.00025961717,0.00062812306,0.00038123396,0.00012359467],"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.000010995604,0.00003073558,0.000003971598,0.00010396161,0.0001630988,0.000031840693,0.00009443506,0.000069725415,0.000028482764,0.73615783,0.21777189,0.045533035],"study_design_scores_gemma":[0.0003500268,0.000044011744,0.000027911605,0.0014052624,0.00003858869,0.000020552556,0.0000026897183,0.0023442178,0.00014829225,0.012138913,0.98298836,0.0004911969],"about_ca_topic_score_codex":0.00012562828,"about_ca_topic_score_gemma":0.00001935645,"teacher_disagreement_score":0.76521647,"about_ca_system_score_codex":0.0000958653,"about_ca_system_score_gemma":0.00016782354,"threshold_uncertainty_score":0.9998849},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086546466,0.007237219,0.7650925,0.016754607,0.0019122211,0.0009702434,0.00009989884,0.00029638124,0.12109048],"genre_scores_gemma":[0.97522783,0.0001000291,0.005537168,0.00046051116,0.000045687902,0.0000072782495,0.0000016561713,0.0000061222863,0.018613705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978241,0.00010576608,0.0004603338,0.0008081489,0.0003173016,0.0004843834],"domain_scores_gemma":[0.99852705,0.00014475718,0.00013963647,0.0007650361,0.000250693,0.00017284727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034613,0.0003116532,0.00046548242,0.00010729164,0.00039521698,0.00082732463,0.00048982253,0.00015459901,0.000017579952],"category_scores_gemma":[0.0000577537,0.00024336921,0.000049816383,0.0011780357,0.00050920557,0.0002145898,0.00032434813,0.00027612405,0.000016810782],"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.00015045737,0.00020977954,0.030100154,0.000539377,0.00023397106,0.00016673894,0.001430228,0.000041309548,0.00013349975,0.802228,0.022740252,0.14202626],"study_design_scores_gemma":[0.010565182,0.0016482807,0.20385532,0.0039870837,0.00027593158,0.00066980784,0.0034672085,0.2876192,0.0038007335,0.009725571,0.47120044,0.0031852329],"about_ca_topic_score_codex":0.00029309132,"about_ca_topic_score_gemma":0.00014938618,"teacher_disagreement_score":0.88868135,"about_ca_system_score_codex":0.000046995385,"about_ca_system_score_gemma":0.0004422633,"threshold_uncertainty_score":0.99243087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002652278,0.00049511425,0.990003,0.0005185842,0.0024171053,0.00087473897,0.000675356,0.00018571255,0.0021781044],"genre_scores_gemma":[0.9938766,0.000015578038,0.004797615,0.00005215321,0.00004592785,0.00013823246,0.00008583268,0.000010855332,0.0009772062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762917,0.00021956296,0.00075082586,0.00064072653,0.00042315826,0.00033654177],"domain_scores_gemma":[0.99719644,0.00018724614,0.00024546278,0.001974835,0.00028840388,0.0001075913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043636173,0.00026825778,0.0004166359,0.00029325334,0.00028144885,0.000099276745,0.0009331523,0.00012949016,0.000015460908],"category_scores_gemma":[0.00004776638,0.00025306994,0.00014900413,0.0012342267,0.00010710796,0.00036150674,0.000034017125,0.00025787935,0.00005325044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007942349,0.0064961603,0.00051892945,0.006581675,0.0023925097,0.0005400547,0.0031908478,0.107231714,0.056337167,0.53254086,0.027961342,0.25541452],"study_design_scores_gemma":[0.0076793674,0.0009605011,0.0015956651,0.00967422,0.00037227376,0.0005209135,0.0016436207,0.72549427,0.15805763,0.004589951,0.08665077,0.002760835],"about_ca_topic_score_codex":0.00051307364,"about_ca_topic_score_gemma":0.000028131037,"teacher_disagreement_score":0.99122435,"about_ca_system_score_codex":0.0001386735,"about_ca_system_score_gemma":0.00018541493,"threshold_uncertainty_score":0.99999213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001046145,0.00026162155,0.9843609,0.00078282534,0.0028418312,0.0008699596,0.000039754646,0.0002348592,0.01050364],"genre_scores_gemma":[0.8449035,0.000015152187,0.14838816,0.0017339048,0.0007341896,0.000056252073,0.000016483038,0.00004345312,0.004108899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518985,0.00006679739,0.0007210133,0.0019449441,0.0014014862,0.0006759166],"domain_scores_gemma":[0.9971648,0.0003006626,0.0002657071,0.0017230853,0.0003575593,0.00018819855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009848521,0.0006222622,0.0007957283,0.00071120675,0.00042202944,0.0006712022,0.0040522655,0.0002754064,0.000029749022],"category_scores_gemma":[0.00003850224,0.0005810957,0.00019675378,0.0009534156,0.0005940782,0.00050030014,0.0007196962,0.00095997384,0.000043893193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027322607,0.00056476716,0.00016985384,0.00015265775,0.00011402239,0.00043084475,0.0023014308,0.042430256,0.000049270973,0.062044766,0.0004997003,0.8912151],"study_design_scores_gemma":[0.00185241,0.00069302064,0.0011070431,0.0010357639,0.00004323414,0.00020627191,0.0000023176708,0.8616243,0.00030364108,0.11825371,0.012801987,0.002076295],"about_ca_topic_score_codex":0.000097882046,"about_ca_topic_score_gemma":0.00031342072,"teacher_disagreement_score":0.8891388,"about_ca_system_score_codex":0.00035606604,"about_ca_system_score_gemma":0.0008883169,"threshold_uncertainty_score":0.99966407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09780583,0.0011561129,0.8937314,0.00053736364,0.0022486914,0.0032340488,0.00010606842,0.00022175006,0.0009587448],"genre_scores_gemma":[0.98383904,0.000016747888,0.012637514,0.0002241026,0.00004657871,0.00073074317,0.000026284171,0.000030264378,0.0024487108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99379206,0.00034086013,0.002144984,0.0020414414,0.00043458055,0.0012460717],"domain_scores_gemma":[0.99645513,0.0006090179,0.0006034679,0.0012374001,0.0008684314,0.00022657128],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020925836,0.0008300333,0.0013960724,0.0005279874,0.00040867898,0.0012916096,0.0016985503,0.0004000734,0.000013066505],"category_scores_gemma":[0.0007034979,0.00079983077,0.00022974864,0.0015975693,0.00023999558,0.00089821644,0.0012418093,0.00050087855,0.000021349562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057084165,0.008064908,0.012583627,0.03046207,0.0012725106,0.0002660823,0.045221448,0.004359989,0.046959717,0.3209917,0.005734378,0.51837516],"study_design_scores_gemma":[0.0064247674,0.0014266039,0.0016184094,0.008645424,0.000055379245,0.000024933483,0.0025117167,0.97669494,0.0012061889,0.0004869762,0.000107233034,0.0007974307],"about_ca_topic_score_codex":0.0004277541,"about_ca_topic_score_gemma":0.00038839766,"teacher_disagreement_score":0.9723349,"about_ca_system_score_codex":0.0005321983,"about_ca_system_score_gemma":0.0004517944,"threshold_uncertainty_score":0.99974513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934301,0.004335479,0.19362167,0.004727178,0.00041139382,0.00010772324,0.000023010827,0.0000053333497,0.0033381009],"genre_scores_gemma":[0.9989461,0.0000045509214,0.00020272254,0.00067740615,0.0001375982,4.2240893e-7,0.00000121697,0.0000016591409,0.000028333436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938697,0.000026510992,0.0002287691,0.00007032627,0.00009759694,0.00018980732],"domain_scores_gemma":[0.9994137,0.000060951978,0.000109152745,0.00014025756,0.000065195796,0.00021071125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092549156,0.00005619863,0.00010044228,0.000039553343,0.000066217144,0.00011546967,0.0003691258,0.000051419105,0.0000031732768],"category_scores_gemma":[0.000025806861,0.000042117714,0.000027083222,0.00014604245,0.00004859064,0.00008931398,0.000004659073,0.00018078383,7.637224e-7],"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.00024462852,0.00031694002,0.28228086,0.0005455578,0.0003777352,0.014941869,0.012900377,0.0010306877,0.06707873,0.034606718,0.41969192,0.16598399],"study_design_scores_gemma":[0.017999806,0.0006707676,0.38128445,0.002269836,0.00009891373,0.018171731,0.0062852507,0.02561042,0.027597537,0.006877195,0.5109897,0.0021443572],"about_ca_topic_score_codex":0.00059589476,"about_ca_topic_score_gemma":0.0016776549,"teacher_disagreement_score":0.20551597,"about_ca_system_score_codex":0.00004716085,"about_ca_system_score_gemma":0.00023397274,"threshold_uncertainty_score":0.17175105},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3116876,0.010881936,0.29060137,0.0010841442,0.022669774,0.0014228149,0.00028314328,0.0014077675,0.35996145],"genre_scores_gemma":[0.9507892,0.00016645859,0.0033586195,0.000086966764,0.0003546327,0.00006597413,0.000438966,0.00002403855,0.04471514],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99830705,0.000022698949,0.00035103512,0.0004942298,0.00047223957,0.00035276584],"domain_scores_gemma":[0.99909467,0.000015706888,0.00014972317,0.0004214756,0.00015267306,0.0001657779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016982282,0.00032138516,0.00036586839,0.0001106267,0.0001828662,0.00018488232,0.00057405257,0.00030338153,0.00024081525],"category_scores_gemma":[0.0000028831714,0.00026806092,0.00007478612,0.00020836205,0.000019552393,0.00086691213,0.000023763225,0.00028258265,0.00012075786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007673267,0.0002457775,0.00032855148,0.0015594822,0.00025453174,0.00002368485,0.003094664,0.000047698057,0.0009242126,0.07163751,0.01563878,0.9061684],"study_design_scores_gemma":[0.0030590685,0.0003934716,0.53126895,0.0015454203,0.00023020912,0.0002673563,0.0006247808,0.023499066,0.058184706,0.0014043824,0.37485012,0.0046724677],"about_ca_topic_score_codex":0.00011715628,"about_ca_topic_score_gemma":0.000057218404,"teacher_disagreement_score":0.90149593,"about_ca_system_score_codex":0.000043777076,"about_ca_system_score_gemma":0.00013762049,"threshold_uncertainty_score":0.9999772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002200605,0.058637556,0.93501335,0.000021097054,0.0022666906,0.00076839334,0.00022628494,0.00047088903,0.00039514198],"genre_scores_gemma":[0.9859282,0.0042297905,0.0041254642,0.000023554832,0.00032829156,0.00012024472,0.00040189832,0.00009629361,0.0047463137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950258,0.000056502908,0.0019351935,0.0013257579,0.0007912222,0.00086549204],"domain_scores_gemma":[0.99719065,0.00021920963,0.000897221,0.0012030823,0.00026362287,0.00022618636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008848341,0.0010027117,0.0020937468,0.0011179337,0.00024482553,0.00048615967,0.001078792,0.0006046117,0.0000053412045],"category_scores_gemma":[0.000038423757,0.0010098199,0.00028365804,0.00069542887,0.00012901603,0.002183599,0.0003017316,0.0010910452,0.000006876707],"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.000012245631,0.000028591103,0.0019367401,0.0013339687,0.0001742509,0.000055895474,0.00015599128,0.9617757,0.0000031171808,0.033726707,0.000019804418,0.000776945],"study_design_scores_gemma":[0.0005040741,0.0000927705,0.0012835382,0.0027326571,0.000104962695,0.000037207952,0.000019025583,0.89068705,0.00000842432,0.00007387234,0.103384115,0.0010722877],"about_ca_topic_score_codex":0.00027095134,"about_ca_topic_score_gemma":0.00018048205,"teacher_disagreement_score":0.9837275,"about_ca_system_score_codex":0.00038635024,"about_ca_system_score_gemma":0.00016787247,"threshold_uncertainty_score":0.9992352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099233305,0.00002254865,0.9333632,0.00020440266,0.00015275851,0.00010296998,0.0000014990919,0.00007396161,0.056155346],"genre_scores_gemma":[0.9909266,5.2212914e-7,0.00831633,0.000060803246,0.000005711894,0.000003938017,3.047485e-7,0.000001578459,0.0006842165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993958,0.00002541728,0.0001748474,0.00016168915,0.000106024796,0.00013626005],"domain_scores_gemma":[0.9992626,0.000013037929,0.000051969957,0.00045838114,0.00016832603,0.00004570292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019584435,0.000052832,0.0001033068,0.000023890845,0.000021691973,0.000013220396,0.0004897896,0.000027165408,0.000031418407],"category_scores_gemma":[0.000024175966,0.000041831456,0.000042098996,0.00018678667,0.00003834287,0.00022460854,0.000106385574,0.000031667427,0.000011471101],"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.0000122706415,0.00023766168,0.009622055,0.000112186295,0.000018787456,0.000013864399,0.00329916,0.000028197734,0.00007608745,0.9436011,0.006209723,0.036768936],"study_design_scores_gemma":[0.0040824646,0.0013625101,0.3683235,0.00016333771,0.00003102722,0.00009695998,0.0055193803,0.26685125,0.03792923,0.19005863,0.123339966,0.002241725],"about_ca_topic_score_codex":0.0003037521,"about_ca_topic_score_gemma":0.000009430812,"teacher_disagreement_score":0.9810033,"about_ca_system_score_codex":0.000020981728,"about_ca_system_score_gemma":0.000048925183,"threshold_uncertainty_score":0.17058372},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022673808,0.0007888311,0.11759683,0.00040967445,0.0023446192,0.00061545963,0.000058797956,0.0001502369,0.8780129],"genre_scores_gemma":[0.004002304,0.0003568546,0.16725859,0.00082070223,0.00071544823,0.000121308105,0.000015947217,0.00014390184,0.82656497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975319,0.00004537445,0.00018797193,0.0011577643,0.0006046943,0.00047227886],"domain_scores_gemma":[0.9968231,0.000050451225,0.00044716013,0.0023351163,0.000096765965,0.0002474274],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012108383,0.00026173328,0.00039388184,0.00019367349,0.0006197241,0.004387536,0.008959878,0.0003281622,0.00022475026],"category_scores_gemma":[0.00037314158,0.00023054174,0.000040548955,0.00048836746,0.00070131395,0.0012873147,0.002433364,0.00037595988,0.0004969819],"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.0000021975834,0.00003390511,0.000028658867,0.000041003335,0.000012257041,0.00003272541,0.00028022908,4.8670563e-7,0.000028527946,0.013686378,0.4354341,0.5504195],"study_design_scores_gemma":[0.00018160742,0.000039301616,0.00017107546,0.0021424182,0.0000069487364,0.000031012056,0.000030291112,0.00056504697,0.00006442081,0.014468416,0.98175603,0.00054340187],"about_ca_topic_score_codex":0.0006478396,"about_ca_topic_score_gemma":0.0000822288,"teacher_disagreement_score":0.54987615,"about_ca_system_score_codex":0.000044721823,"about_ca_system_score_gemma":0.00036268364,"threshold_uncertainty_score":0.996646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46081805,0.00038456736,0.4981441,0.003263144,0.0045266603,0.0048719677,0.0033735586,0.00057334616,0.02404462],"genre_scores_gemma":[0.9903376,0.000007091055,0.0082776295,0.00032975318,0.00003917957,0.00020530823,0.00021958695,0.000022210292,0.00056163967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970969,0.00008896039,0.0008851078,0.00025897886,0.00094199675,0.00072805764],"domain_scores_gemma":[0.99758184,0.00012005927,0.00071977306,0.0011130557,0.0003135791,0.0001516963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00086518505,0.00029703908,0.00044833627,0.00010786849,0.0015348129,0.0004490979,0.002104456,0.000057446745,0.000012867763],"category_scores_gemma":[0.000027582862,0.00021407825,0.0001689682,0.00060246774,0.0003215776,0.0008812634,0.00083839707,0.0003781254,0.00001807987],"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.0012478007,0.002051335,0.01273216,0.0016990666,0.0010485013,0.000037923684,0.035721574,0.006001638,0.00054962357,0.8715564,0.059066933,0.008287059],"study_design_scores_gemma":[0.0070402706,0.0012242962,0.004990599,0.00020738697,0.000040911113,0.00027541773,0.0062465253,0.32101724,0.0012427093,0.0048626605,0.6518389,0.0010130976],"about_ca_topic_score_codex":0.00013582436,"about_ca_topic_score_gemma":0.00006520351,"teacher_disagreement_score":0.86669374,"about_ca_system_score_codex":0.00017262161,"about_ca_system_score_gemma":0.00015916194,"threshold_uncertainty_score":0.99976504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037230118,0.0009925071,0.97139066,0.00052088767,0.005498759,0.0028881321,0.005478515,0.0006212277,0.008886306],"genre_scores_gemma":[0.9619626,0.00004983015,0.02985241,0.0012330288,0.0007355024,0.0016594637,0.0024958423,0.000100467696,0.0019108689],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630743,0.000035784306,0.001337673,0.0005954559,0.00060287415,0.0011207537],"domain_scores_gemma":[0.9977278,0.00028424314,0.00032187896,0.0008967165,0.0004629416,0.00030643784],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008279353,0.00055634684,0.00065539894,0.00028364197,0.00045109438,0.0016424016,0.0016031519,0.00025400033,0.00005614426],"category_scores_gemma":[0.000082726576,0.00048589896,0.0005404887,0.00058592495,0.00010441422,0.002838416,0.00040400846,0.0004213138,0.00023303498],"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.00028359436,0.00075928145,0.00022441163,0.0068284306,0.0011487224,0.000067521425,0.031301826,0.0013162433,0.00022838615,0.2986713,0.50561374,0.15355654],"study_design_scores_gemma":[0.0019634461,0.0004899716,0.000051864965,0.0006787541,0.000041288873,0.00008628629,0.0008138276,0.52257997,0.00052448345,0.0009699955,0.47113135,0.0006687777],"about_ca_topic_score_codex":0.000023692652,"about_ca_topic_score_gemma":0.000018921304,"teacher_disagreement_score":0.95823956,"about_ca_system_score_codex":0.0002589809,"about_ca_system_score_gemma":0.00031653512,"threshold_uncertainty_score":0.99975926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027063368,0.00019083434,0.9553042,0.0016338697,0.0017550298,0.0020554063,0.0022714771,0.00059939164,0.009126446],"genre_scores_gemma":[0.725077,0.00005616063,0.22435783,0.006332287,0.0011283741,0.0012433259,0.0054984195,0.00022826085,0.03607837],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670815,0.00004961077,0.001266835,0.00047754715,0.00054429873,0.00095355435],"domain_scores_gemma":[0.9969713,0.00020902109,0.00045039697,0.0012002155,0.00081261946,0.0003564469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056676735,0.00044906407,0.0006639017,0.00016278245,0.0005414542,0.0006978078,0.0012975036,0.0002881909,0.00007352183],"category_scores_gemma":[0.0002058362,0.0004081699,0.00045347514,0.00060367206,0.00006337579,0.0011497074,0.00041176396,0.0002694641,0.00031392364],"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.000708564,0.0043088733,0.0021798161,0.005578531,0.001964938,0.00020049747,0.03628355,0.002304558,0.008336488,0.1777426,0.5364708,0.22392084],"study_design_scores_gemma":[0.003954049,0.0001996778,0.0001992593,0.00021234418,0.000035040357,0.00017031167,0.00039202144,0.498538,0.0028551244,0.0005832436,0.49218285,0.0006781012],"about_ca_topic_score_codex":0.000005494224,"about_ca_topic_score_gemma":0.0000037923498,"teacher_disagreement_score":0.73094636,"about_ca_system_score_codex":0.00013011435,"about_ca_system_score_gemma":0.000256329,"threshold_uncertainty_score":0.99983704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42049205,0.00011505895,0.5772058,0.000010737616,0.000721384,0.00016418775,0.000017476894,0.00017587928,0.0010974366],"genre_scores_gemma":[0.9986504,0.00006382935,0.0008575322,0.000018198474,0.0000676296,0.0000014955165,0.000044008928,0.000014398873,0.00028255588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997948,0.00012743499,0.00026570444,0.0011800413,0.00011416472,0.00036468322],"domain_scores_gemma":[0.99813545,0.000025359152,0.00024626742,0.0012728574,0.00017601645,0.00014407687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036562647,0.0002663913,0.00034196788,0.00026660855,0.00012541782,0.00017550893,0.0015697546,0.00028092353,0.000013662972],"category_scores_gemma":[0.000017957711,0.00031310332,0.0000874327,0.00084786216,0.000074453266,0.0003450895,0.0010385754,0.00035095125,0.00009446324],"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.00003054828,0.00025745592,0.00541629,0.00016167526,0.000019666786,0.00040588877,0.0006885873,0.958024,0.000019421022,0.030829798,0.00032265342,0.003823977],"study_design_scores_gemma":[0.000384357,0.000035916404,0.0036814502,0.00065221335,0.000014531095,0.000003006022,0.000052644864,0.993281,0.000032732925,0.0011500022,0.00033002335,0.0003821073],"about_ca_topic_score_codex":0.00034963933,"about_ca_topic_score_gemma":0.000100313715,"teacher_disagreement_score":0.5781583,"about_ca_system_score_codex":0.00031862356,"about_ca_system_score_gemma":0.00018804894,"threshold_uncertainty_score":0.9999321},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014080412,0.000028464989,0.944004,0.0023150381,0.00020542237,0.00074809865,0.000097452365,0.0014789278,0.03704216],"genre_scores_gemma":[0.9953823,0.000023104933,0.0033834216,0.00008170467,0.000055291122,1.6785664e-7,0.0001733866,0.00026607167,0.0006345685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878526,0.0001557853,0.00015938657,0.0003734284,0.00024477264,0.00028139906],"domain_scores_gemma":[0.9990331,0.00009648623,0.000065249245,0.00026307462,0.00042058984,0.00012151897],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091553864,0.000084838095,0.0000966005,0.00013898208,0.0019082656,0.00084526825,0.0005563864,0.000043315154,0.0001705905],"category_scores_gemma":[0.00092146156,0.00008361217,0.000031770243,0.00073795987,0.00009217473,0.00018859016,0.0007229083,0.00011128732,0.00095762755],"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.00014681644,0.00019767415,0.0000051851125,0.00013642981,0.000056519042,0.00003210113,0.0035746463,0.0010720888,0.008129114,0.67967695,0.14951901,0.15745349],"study_design_scores_gemma":[0.00068853167,0.00021840495,0.00087665766,0.000033871973,0.000005608949,0.000057074783,0.00026190633,0.22824566,0.00023373599,0.0005728719,0.76866174,0.00014390433],"about_ca_topic_score_codex":0.0000024248343,"about_ca_topic_score_gemma":4.7701953e-8,"teacher_disagreement_score":0.98130184,"about_ca_system_score_codex":0.0000611447,"about_ca_system_score_gemma":0.0000040407404,"threshold_uncertainty_score":0.99982023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19124158,0.0012436054,0.57767564,0.008109324,0.0007803921,0.0013779374,0.00034396918,0.002820024,0.21640754],"genre_scores_gemma":[0.9977192,0.00004496207,0.00039008766,0.000121135905,0.00004249536,4.3241076e-8,0.00018289228,0.00016507688,0.0013340521],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984623,0.00022455145,0.00026214414,0.00043779155,0.0002655388,0.00034766266],"domain_scores_gemma":[0.9990531,0.000026021267,0.000065761335,0.00041624758,0.00031060545,0.00012821524],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000792549,0.00011043027,0.00014254554,0.0001829591,0.0013423014,0.0012100218,0.0010699836,0.00004277736,0.00048989843],"category_scores_gemma":[0.00017927821,0.000111383175,0.00003374151,0.0006748652,0.0001071825,0.00033266944,0.0016678479,0.00019524207,0.0007681476],"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.000010724397,0.0001323328,0.000039812956,0.0001578156,0.000041124345,0.00003651249,0.0013312941,0.000061783336,0.00730818,0.16913319,0.118404984,0.70334226],"study_design_scores_gemma":[0.0004521571,0.00011707699,0.003673756,0.00008645276,0.0000044961203,0.000052217343,0.00023607793,0.01943762,0.00052627985,0.00020616196,0.97505456,0.00015315315],"about_ca_topic_score_codex":0.000016303635,"about_ca_topic_score_gemma":2.3024742e-7,"teacher_disagreement_score":0.8566496,"about_ca_system_score_codex":0.00006774737,"about_ca_system_score_gemma":0.000007612671,"threshold_uncertainty_score":0.9999578},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008490433,0.0004643924,0.47121376,0.0030862314,0.00086106383,0.0007714652,0.00013616729,0.002565808,0.5124107],"genre_scores_gemma":[0.996955,0.00003616222,0.00035162,0.00019773621,0.00007416242,6.662048e-8,0.00030820345,0.00020234792,0.0018747034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985381,0.00016006452,0.00024986506,0.0004450935,0.00029293232,0.00031396438],"domain_scores_gemma":[0.9986657,0.000015589614,0.00007891963,0.0006236987,0.0005002504,0.000115837654],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005354699,0.00012063778,0.0001483441,0.00014603809,0.0013824832,0.0013836168,0.0018515456,0.000053391945,0.0006160682],"category_scores_gemma":[0.0001270277,0.00012167691,0.000051119623,0.0008051899,0.00008440795,0.00038898722,0.0014140082,0.00020864762,0.0023799029],"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.000015673557,0.00014743743,0.000011136882,0.00007836986,0.00003796512,0.000011189836,0.00059177,0.000028771268,0.00090377074,0.4402377,0.30509624,0.25283998],"study_design_scores_gemma":[0.0007121213,0.000052067247,0.00063482096,0.00004071894,0.000003900854,0.000019374458,0.00006133087,0.0029621306,0.00043722967,0.00042125932,0.99452764,0.00012742946],"about_ca_topic_score_codex":0.000016321976,"about_ca_topic_score_gemma":3.6600474e-7,"teacher_disagreement_score":0.9884646,"about_ca_system_score_codex":0.00013669278,"about_ca_system_score_gemma":0.0000089195355,"threshold_uncertainty_score":0.99991757},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074499674,0.0010494672,0.13398379,0.04393181,0.0027250624,0.0028955874,0.004960839,0.0066271843,0.7293266],"genre_scores_gemma":[0.9842147,0.000017208748,0.0022345104,0.0014079042,0.00012346239,2.638158e-7,0.0005705912,0.00076612283,0.0106652],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976654,0.0005119951,0.0002876311,0.0005575817,0.0005546791,0.00042272976],"domain_scores_gemma":[0.9984729,0.000034885936,0.00013918547,0.0007882004,0.00040014807,0.00016466896],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008711466,0.00014178538,0.00016972731,0.00014189631,0.0034206964,0.0010224266,0.0018394967,0.000037052345,0.011181857],"category_scores_gemma":[0.00017721514,0.00015881508,0.00006754187,0.0005775204,0.00009024918,0.00014011926,0.0021724952,0.00032289673,0.003952352],"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.00002629062,0.00009788355,0.000005732,0.000024456645,0.00003506448,0.000048536876,0.0020716153,0.00015139798,0.0010411902,0.011658545,0.9584128,0.026426451],"study_design_scores_gemma":[0.00048405473,0.0001564427,0.00009723548,0.000010920899,0.0000036657955,0.00035549255,0.00029570374,0.0070674648,0.00016670453,0.0012201169,0.9899459,0.00019631388],"about_ca_topic_score_codex":0.000055539174,"about_ca_topic_score_gemma":2.5653335e-7,"teacher_disagreement_score":0.90971506,"about_ca_system_score_codex":0.00017261293,"about_ca_system_score_gemma":0.0000116215215,"threshold_uncertainty_score":0.9978767},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.412182e-7,0.003787552,0.08816395,0.001196691,0.0022221773,0.0004651435,0.9031915,0.0002237922,0.00074842613],"genre_scores_gemma":[0.0000014920055,0.00125879,0.019884773,0.0012137438,0.000363153,0.00008529972,0.9745142,0.000012021734,0.0026665418],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945399,0.0009942058,0.00085944677,0.0021982316,0.00067860284,0.0007296226],"domain_scores_gemma":[0.98478425,0.0009170809,0.0003720467,0.0134156495,0.0002478825,0.0002630943],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0038435988,0.0006189439,0.00093917805,0.00014315016,0.00018164415,0.0005277787,0.01573855,0.0014291842,0.00007540912],"category_scores_gemma":[0.0032267247,0.0006048259,0.00014030826,0.0016340363,0.000118777454,0.0010800214,0.0039010793,0.002338153,0.00023572863],"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.0000036741849,0.0001253982,0.000008428636,0.0005555604,0.000055952154,0.00002963996,0.000017486354,0.000003355042,0.0000034646448,0.00025946103,0.97897494,0.019962637],"study_design_scores_gemma":[0.00026558843,0.000023418157,0.00003513335,0.0004726419,0.000029358855,0.000011689595,0.000005995548,0.0022502318,0.0000093078825,0.00037360765,0.9959304,0.0005926516],"about_ca_topic_score_codex":0.0011833673,"about_ca_topic_score_gemma":0.00019937895,"teacher_disagreement_score":0.071322665,"about_ca_system_score_codex":0.0002910765,"about_ca_system_score_gemma":0.001480189,"threshold_uncertainty_score":0.9999635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1859135,0.0005355973,0.78393936,0.0024642798,0.004265965,0.0029870335,0.003976505,0.00091037183,0.015007383],"genre_scores_gemma":[0.9736671,0.000021351236,0.022255408,0.0011525088,0.00018718622,0.00035649943,0.00059807656,0.000039611,0.0017222891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99734986,0.00005780862,0.0009352714,0.00035892933,0.0005792858,0.0007188222],"domain_scores_gemma":[0.99798995,0.000088869914,0.0003896966,0.0011115058,0.00018495445,0.00023501493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007345172,0.0003266537,0.00043398415,0.0001703626,0.0008946312,0.00071883685,0.001782911,0.00011408934,0.00004515423],"category_scores_gemma":[0.000063370615,0.00031898436,0.00015847092,0.000445761,0.00008197238,0.0014067504,0.0015259675,0.0005304169,0.000039522984],"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.0006695277,0.0032603452,0.034013506,0.0037321527,0.0011787547,0.0001570376,0.06645034,0.016041582,0.0007603334,0.5076265,0.26495788,0.10115205],"study_design_scores_gemma":[0.0024024127,0.00034818173,0.00053050986,0.000048023667,0.000014844149,0.0001311283,0.0011032891,0.39276308,0.000081296275,0.00056315685,0.60150796,0.00050609704],"about_ca_topic_score_codex":0.00007655701,"about_ca_topic_score_gemma":0.000015483745,"teacher_disagreement_score":0.7877536,"about_ca_system_score_codex":0.00013877856,"about_ca_system_score_gemma":0.00011499642,"threshold_uncertainty_score":0.9999262},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015416909,0.0002567087,0.96796846,0.0012179357,0.0014684518,0.0012815848,0.001760997,0.0008780069,0.009750962],"genre_scores_gemma":[0.89298433,0.00002279679,0.103572994,0.0012461167,0.00030960093,0.0002958816,0.0005322612,0.00007661266,0.00095937744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680895,0.000041930052,0.001019077,0.00048153344,0.00070165907,0.00094685965],"domain_scores_gemma":[0.9974518,0.0001234848,0.00024269863,0.0016109378,0.00027959168,0.00029150426],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005735031,0.00049799995,0.00054947176,0.0002634483,0.00036178113,0.0015518086,0.0024149776,0.0002128118,0.000023881035],"category_scores_gemma":[0.00004305118,0.00038515797,0.00024873388,0.00072289316,0.0002051603,0.0023686462,0.00065021,0.00053380494,0.0002641555],"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.00019423054,0.0005436662,0.0019569756,0.0034560855,0.00078046205,0.00019267134,0.011321685,0.00021945579,0.00007392673,0.8215928,0.092846155,0.066821866],"study_design_scores_gemma":[0.002990855,0.00047974425,0.0008051649,0.00079732237,0.000043502005,0.00053787866,0.0005468591,0.50719726,0.00021625165,0.0035134398,0.48193917,0.0009325703],"about_ca_topic_score_codex":0.000095539624,"about_ca_topic_score_gemma":0.00011834374,"teacher_disagreement_score":0.87756747,"about_ca_system_score_codex":0.00019115361,"about_ca_system_score_gemma":0.00021478695,"threshold_uncertainty_score":0.99986005},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037727793,0.00029378425,0.061955143,0.00029465702,0.00018652892,0.0004973866,0.00068014854,0.00081090163,0.9352777],"genre_scores_gemma":[0.01187429,0.00030548527,0.009211142,0.00040167716,0.0005534628,4.3033333e-7,0.013435634,0.0031266084,0.9610913],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982161,0.000078462945,0.00036713434,0.0006186672,0.00036285407,0.00035677315],"domain_scores_gemma":[0.99863297,0.000032111013,0.00015812782,0.00069111394,0.0003779859,0.00010771014],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047501162,0.00020898921,0.0002579871,0.00034510484,0.0009515889,0.0013464479,0.0019714343,0.00015678277,0.005528733],"category_scores_gemma":[0.00020292556,0.00023201731,0.000076855,0.00028866425,0.00006799234,0.0002565676,0.0016420273,0.00046173818,0.0034249395],"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.000006238818,0.000031069354,1.178501e-7,0.00011179008,0.000022793005,0.000050793242,0.00026094913,0.000024160325,0.000015938609,0.20047455,0.31615087,0.48285073],"study_design_scores_gemma":[0.00021619843,0.000056064517,0.000009718194,0.00045648075,0.000003991729,0.000032810258,0.000014006547,0.0019836116,0.000007383996,0.0008634578,0.99613816,0.00021812257],"about_ca_topic_score_codex":0.000012997313,"about_ca_topic_score_gemma":8.4305503e-7,"teacher_disagreement_score":0.6799873,"about_ca_system_score_codex":0.00018659048,"about_ca_system_score_gemma":0.000011159687,"threshold_uncertainty_score":0.99969023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028916955,0.00012962472,0.8970363,0.0025247727,0.00053301913,0.0005585721,0.00035868748,0.001802656,0.06813943],"genre_scores_gemma":[0.99697644,0.00000577348,0.0016555104,0.00019507807,0.00007789185,1.081741e-7,0.00017441962,0.00033377158,0.00058099633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802595,0.00040578088,0.00022580507,0.00043179028,0.00056752894,0.00034312435],"domain_scores_gemma":[0.9989171,0.0000140947795,0.00010333532,0.0006006676,0.00022933222,0.00013548079],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00096962374,0.000101911304,0.00012225292,0.0001317082,0.003441285,0.00078928226,0.0021075972,0.000023650973,0.0037202751],"category_scores_gemma":[0.00012863691,0.00011831406,0.000055282002,0.0007475037,0.000049007216,0.00034589675,0.0026759433,0.00030064702,0.0014836112],"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.000031033098,0.00055928354,0.0000081774715,0.00007898949,0.00007891509,0.000056112673,0.0033887092,0.002891718,0.017835537,0.4690272,0.30523273,0.2008116],"study_design_scores_gemma":[0.000256508,0.00011736559,0.00031450094,0.000010343266,0.0000026426158,0.00011441983,0.00008157884,0.007530042,0.0003163527,0.00075820135,0.9903469,0.0001511513],"about_ca_topic_score_codex":0.00002154892,"about_ca_topic_score_gemma":7.938027e-8,"teacher_disagreement_score":0.9680595,"about_ca_system_score_codex":0.00022685356,"about_ca_system_score_gemma":0.000003979386,"threshold_uncertainty_score":0.99929386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010795161,0.0000052833575,0.9620523,0.0005790687,0.00007373121,0.024623152,0.000032007283,0.00074272533,0.011783795],"genre_scores_gemma":[0.99095434,0.000010830119,0.0022598978,0.0007695527,0.000858321,0.00042466176,0.0009047165,0.0018585802,0.001959092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980806,0.0002579329,0.00026899623,0.00049748964,0.00031072105,0.00058425986],"domain_scores_gemma":[0.99862593,0.000025952217,0.00013582072,0.00061332213,0.00044505947,0.00015393613],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095283333,0.00015292205,0.00016740095,0.00007792663,0.0013417222,0.0010761272,0.0016950718,0.0000696163,0.00039542504],"category_scores_gemma":[0.00010447625,0.00014503494,0.000066864166,0.00045425445,0.00005041764,0.00030089813,0.0006815536,0.00021253429,0.0005279258],"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.000069715294,0.00018788618,0.0000019131571,0.0001374916,0.000039550596,0.0000026142184,0.0004685781,0.00037892355,0.00046350522,0.4614183,0.27391347,0.26291806],"study_design_scores_gemma":[0.00080903986,0.0003275096,0.000030832092,0.00003685234,0.000002531164,0.000025788897,0.000016537664,0.16088814,0.00011501311,0.0005422709,0.8370514,0.000154117],"about_ca_topic_score_codex":0.000004466425,"about_ca_topic_score_gemma":3.7791017e-7,"teacher_disagreement_score":0.9908464,"about_ca_system_score_codex":0.00013522252,"about_ca_system_score_gemma":0.0000069482853,"threshold_uncertainty_score":0.99996084},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018696148,0.000037032147,0.000667376,0.00019067868,0.0014652879,0.0002836342,0.99701744,0.00017292592,0.00014694188],"genre_scores_gemma":[0.0000069382036,0.000028960518,0.0000047249505,0.00054970215,0.0000010446774,0.000009921925,0.9993985,7.2505837e-9,1.7899767e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794537,0.00010440842,0.00045633677,0.00034668003,0.0008020652,0.00034516168],"domain_scores_gemma":[0.9981642,0.00001743972,0.00040005814,0.0010479646,0.00020316361,0.00016721047],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037878117,0.00028142027,0.00030545925,0.00008399956,0.0005086907,0.00041539935,0.002197047,0.0002072715,0.0077994163],"category_scores_gemma":[0.000065005705,0.00029989553,0.000170391,0.0006543842,0.00007692567,0.0019387549,0.0012760046,0.0003675342,0.062935024],"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.000008441593,0.00003462646,0.000102376835,0.00008724347,0.000018468729,0.0000058521896,0.000040373012,0.000032614786,8.205435e-9,0.0000022339486,0.9970778,0.0025899606],"study_design_scores_gemma":[0.0002486095,0.000034641518,0.000029077813,0.0000014491451,0.000010952692,0.000012448414,0.000050057846,0.0000025445925,3.6656814e-7,0.0000013994904,0.9993006,0.000307864],"about_ca_topic_score_codex":0.0005082353,"about_ca_topic_score_gemma":0.0000059250137,"teacher_disagreement_score":0.055135608,"about_ca_system_score_codex":0.00043182884,"about_ca_system_score_gemma":0.00021999903,"threshold_uncertainty_score":0.99994534},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009730661,0.0015051054,0.005407026,0.00015760402,0.0007807738,0.0005010732,0.98177594,0.00009413763,0.00004770836],"genre_scores_gemma":[0.024119914,0.0013188205,0.00070000475,0.00027221537,0.00095908926,0.00003206608,0.972549,0.00002848384,0.000020399708],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955643,0.0004353792,0.0006852188,0.0021970836,0.00049855676,0.00061948015],"domain_scores_gemma":[0.9938913,0.0009862338,0.00066237414,0.004035901,0.00007689341,0.000347273],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00058483635,0.00065504166,0.0008075802,0.00017084285,0.000408514,0.0011849012,0.007929965,0.00023553423,0.000014700366],"category_scores_gemma":[0.000045962184,0.0005781594,0.00004320968,0.00032784653,0.000093069415,0.0030975132,0.009525911,0.00083504367,0.000070330876],"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.000020618363,0.000052038755,0.0003540734,0.00056146935,0.0005364304,0.000029048457,0.000910708,0.000018194254,0.000016225866,0.000029617066,0.99049234,0.0069792364],"study_design_scores_gemma":[0.0006534129,0.00016429444,0.005643372,0.0026015,0.00023255488,0.000041503903,0.00035044007,0.19652219,0.000007218855,0.000225924,0.79253256,0.0010250126],"about_ca_topic_score_codex":0.0049554743,"about_ca_topic_score_gemma":0.009345318,"teacher_disagreement_score":0.19795977,"about_ca_system_score_codex":0.00003261159,"about_ca_system_score_gemma":0.000090440706,"threshold_uncertainty_score":0.99985194},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115630886,0.0026675577,0.124027714,0.0011273597,0.0013738866,0.0019244445,0.003819935,0.0029708839,0.8619726],"genre_scores_gemma":[0.014783055,0.00053488556,0.0039249435,0.0005005123,0.0013788504,0.000002399522,0.007531824,0.01255278,0.9587908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965576,0.00037186683,0.0006068511,0.0011563083,0.0006317439,0.0006756504],"domain_scores_gemma":[0.9978076,0.000038175876,0.00028626734,0.0013109678,0.00033024544,0.00022670194],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001323279,0.0003897992,0.0005093438,0.0005352408,0.00040460326,0.0019391432,0.0028178857,0.00029660654,0.0040479116],"category_scores_gemma":[0.00027696646,0.00040326908,0.00015619183,0.0009408691,0.00011991083,0.00029101854,0.0014868494,0.00047499652,0.02405247],"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.000022802962,0.00011036867,0.0000020099346,0.00057207217,0.00007253936,0.000022111017,0.0008149345,0.000018240667,0.0001831427,0.012970528,0.96818227,0.017028986],"study_design_scores_gemma":[0.00056445674,0.000091484355,0.000039109,0.00040611994,0.00001339597,0.00003925614,0.00009974769,0.0007422416,0.000019593886,0.000333786,0.9971996,0.0004512101],"about_ca_topic_score_codex":0.0002514743,"about_ca_topic_score_gemma":0.000029332346,"teacher_disagreement_score":0.12010277,"about_ca_system_score_codex":0.00026880307,"about_ca_system_score_gemma":0.000017192198,"threshold_uncertainty_score":0.9998419},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008490433,0.0004643924,0.47121376,0.0030862314,0.00086106383,0.0007714652,0.00013616729,0.002565808,0.5124107],"genre_scores_gemma":[0.996955,0.00003616222,0.00035162,0.00019773621,0.00007416242,6.662048e-8,0.00030820345,0.00020234792,0.0018747034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985381,0.00016006452,0.00024986506,0.0004450935,0.00029293232,0.00031396438],"domain_scores_gemma":[0.9986657,0.000015589614,0.00007891963,0.0006236987,0.0005002504,0.000115837654],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005354699,0.00012063778,0.0001483441,0.00014603809,0.0013824832,0.0013836168,0.0018515456,0.000053391945,0.0006160682],"category_scores_gemma":[0.0001270277,0.00012167691,0.000051119623,0.0008051899,0.00008440795,0.00038898722,0.0014140082,0.00020864762,0.0023799029],"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.000015673557,0.00014743743,0.000011136882,0.00007836986,0.00003796512,0.000011189836,0.00059177,0.000028771268,0.00090377074,0.4402377,0.30509624,0.25283998],"study_design_scores_gemma":[0.0007121213,0.000052067247,0.00063482096,0.00004071894,0.000003900854,0.000019374458,0.00006133087,0.0029621306,0.00043722967,0.00042125932,0.99452764,0.00012742946],"about_ca_topic_score_codex":0.000016321976,"about_ca_topic_score_gemma":3.6600474e-7,"teacher_disagreement_score":0.9884646,"about_ca_system_score_codex":0.00013669278,"about_ca_system_score_gemma":0.0000089195355,"threshold_uncertainty_score":0.99991757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01076507,0.0005118679,0.97795826,0.00036926768,0.0006328442,0.002789702,0.0006782839,0.00020370117,0.006090981],"genre_scores_gemma":[0.9797362,0.000019641195,0.016327862,0.0009388728,0.000083732564,0.0016515021,0.00017639603,0.000021882224,0.0010438988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801743,0.00002008105,0.0007672388,0.00036300955,0.00020660945,0.00062565895],"domain_scores_gemma":[0.9982379,0.00017993864,0.00026137521,0.0008196789,0.00034312624,0.00015797146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049526035,0.0003216816,0.00041107426,0.00020480857,0.0006142586,0.0005179457,0.0009367141,0.00015548203,0.0000024195383],"category_scores_gemma":[0.000044990746,0.00026781348,0.00027760473,0.00042985295,0.00009046079,0.00050332095,0.00034525545,0.00017850476,0.000017617063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041226883,0.0025588893,0.0014378985,0.01131737,0.0018917865,0.000004164305,0.05937604,0.011193808,0.0016081125,0.3709307,0.039855223,0.49941376],"study_design_scores_gemma":[0.0031560957,0.00020531875,0.000136333,0.00024799327,0.000045342964,0.00003120374,0.0047013736,0.7181038,0.002083268,0.0010628087,0.26966497,0.00056144554],"about_ca_topic_score_codex":0.000011374351,"about_ca_topic_score_gemma":0.0000112022135,"teacher_disagreement_score":0.96897113,"about_ca_system_score_codex":0.000121217265,"about_ca_system_score_gemma":0.0001250131,"threshold_uncertainty_score":0.9999774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98193425,0.0007024255,0.0000948383,0.0000074757145,0.001994676,0.0020756994,0.00031485857,0.0005402443,0.012335546],"genre_scores_gemma":[0.98840964,0.000013838261,0.008467691,0.000099847915,0.00003560393,0.000614809,0.00043258656,0.00009167953,0.0018343293],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99286026,0.0004956732,0.0018153229,0.0021548832,0.0015383997,0.0011354554],"domain_scores_gemma":[0.99658257,0.00016791816,0.00096084666,0.0012940143,0.0006316002,0.00036304863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010785883,0.0011448186,0.0015484298,0.0005743546,0.0012683898,0.0004818927,0.002506058,0.0006344531,0.000027076878],"category_scores_gemma":[0.00020566996,0.0012116225,0.00024400519,0.0016906579,0.000043558943,0.001699893,0.00033172796,0.0019014087,0.00030186126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007403497,0.009192191,0.0013659371,0.0026145983,0.00113636,0.0032365539,0.006317026,0.01758537,0.0052815303,0.07308514,0.00004254706,0.8794024],"study_design_scores_gemma":[0.05319997,0.0038788244,0.30331478,0.05755717,0.0006843491,0.0005382026,0.03505738,0.006221436,0.15451479,0.04634127,0.30326894,0.035422876],"about_ca_topic_score_codex":0.00050835375,"about_ca_topic_score_gemma":0.008189217,"teacher_disagreement_score":0.84397954,"about_ca_system_score_codex":0.0017417476,"about_ca_system_score_gemma":0.00042403844,"threshold_uncertainty_score":0.9990334},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066258694,0.00034054075,0.06581218,0.00018629989,0.0049965736,0.0002861522,0.00019300795,0.0004818856,0.92769676],"genre_scores_gemma":[0.00043586254,0.00003277686,0.0053785713,0.0003699401,0.0017861824,0.000026003929,0.000096245974,0.00010206277,0.99177235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765885,0.000032761796,0.0006110452,0.00091354595,0.00036313088,0.00042067663],"domain_scores_gemma":[0.997486,0.000048182806,0.00054773095,0.0016769484,0.00009231813,0.00014880444],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028336365,0.00035298447,0.00044643696,0.00011518318,0.000062464045,0.00021558623,0.0007561941,0.00049466395,0.0015092107],"category_scores_gemma":[0.00015065678,0.0003027128,0.00012044074,0.00024520818,0.0000805143,0.000121830024,0.00019201457,0.00015732263,0.002082595],"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.0000021015042,0.000039010854,0.000015925867,0.000034453256,0.000015512673,0.00021889547,0.000045697485,6.5925896e-8,0.0000021951514,0.0014313837,0.99741364,0.00078113534],"study_design_scores_gemma":[0.00025445633,0.00007347478,0.00015709815,0.00020986011,0.0000056352887,0.00007740088,0.0000026210857,0.00010979914,0.00007927598,0.00023878374,0.9983756,0.0004160212],"about_ca_topic_score_codex":0.00016457208,"about_ca_topic_score_gemma":0.0005848285,"teacher_disagreement_score":0.06407561,"about_ca_system_score_codex":0.00003701228,"about_ca_system_score_gemma":0.0001779593,"threshold_uncertainty_score":0.9999425},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014324653,0.0003857424,0.0045221555,0.0009718105,0.00020993283,0.00037556028,0.00014131874,0.000015478503,0.99194556],"genre_scores_gemma":[0.9003423,0.00008045988,0.000059034664,0.00007964103,0.00009489957,0.0000014495351,0.000071091614,0.0000047985454,0.09926631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914765,0.00009544753,0.00021589578,0.00015613339,0.00028329395,0.00010156346],"domain_scores_gemma":[0.999264,0.00023841043,0.00016738739,0.00023307453,0.000077260716,0.000019860576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017578035,0.000119206925,0.0002300128,0.0000881013,0.00015609566,0.00003319056,0.0005964208,0.00009246124,0.00001110466],"category_scores_gemma":[0.000010063689,0.00007031458,0.00010720081,0.00012087864,0.0010732979,0.00021180163,0.00006450362,0.0002354771,0.000017313534],"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.0002624949,0.000052487292,0.00023963826,0.00007308726,0.000104457176,0.00008043048,0.006357906,0.00023599027,0.0000012374816,0.9732788,0.014625438,0.004688015],"study_design_scores_gemma":[0.0014702355,0.00008309857,0.0052920314,0.0002754275,0.000041399162,0.00020212532,0.00013920215,0.0013502298,0.000007008705,0.016379949,0.97455615,0.0002031562],"about_ca_topic_score_codex":0.00016782068,"about_ca_topic_score_gemma":0.00010983899,"teacher_disagreement_score":0.9599307,"about_ca_system_score_codex":0.00005297735,"about_ca_system_score_gemma":0.00029248727,"threshold_uncertainty_score":0.39546108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61584204,0.0047003273,0.007542854,0.00028727655,0.068739876,0.016203113,0.015687933,0.01317387,0.25782272],"genre_scores_gemma":[0.9611732,0.00020781216,0.0039861156,0.00030831504,0.00033029733,0.0014974641,0.004119087,0.00037987504,0.027997836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99360824,0.00024595176,0.0015439631,0.002182723,0.00087097386,0.0015481604],"domain_scores_gemma":[0.9945767,0.0010249059,0.0012667434,0.0016314711,0.001033838,0.0004663267],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016685867,0.0010454373,0.0012583848,0.00040701436,0.0021806902,0.0011667011,0.0038940988,0.0011335891,0.000035522837],"category_scores_gemma":[0.0016388231,0.0011366094,0.00062544947,0.0015770498,0.000045319768,0.002261401,0.0003118034,0.0014737444,0.00025230783],"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.00029171992,0.00033525293,0.00015453064,0.0021262409,0.0006884148,0.0001636227,0.00003254122,0.0028071855,0.004948265,0.21037316,0.0010227025,0.7770564],"study_design_scores_gemma":[0.004284625,0.00034670052,0.0017443051,0.004242447,0.00025334765,0.00005806969,0.00040840713,0.09434207,0.03250002,0.02378219,0.8329318,0.005105993],"about_ca_topic_score_codex":0.00051506393,"about_ca_topic_score_gemma":0.0014734073,"teacher_disagreement_score":0.8319091,"about_ca_system_score_codex":0.00047739135,"about_ca_system_score_gemma":0.00012210733,"threshold_uncertainty_score":0.9998702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78541464,0.0027171024,0.13284324,0.01465406,0.0013957755,0.0038501564,0.0032900593,0.00073493377,0.05510002],"genre_scores_gemma":[0.9745853,0.00016967568,0.0055457754,0.0007630556,0.000081507555,0.000043358057,0.00014106033,0.00007334866,0.018596895],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99583566,0.00047307255,0.00046936766,0.00094750465,0.00051236246,0.0017620338],"domain_scores_gemma":[0.99566686,0.0014486903,0.0004883227,0.0012673282,0.00058738794,0.0005414127],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00094026385,0.0006171579,0.000628854,0.00016790238,0.0017504136,0.00078666286,0.004642992,0.00043206417,0.00015796168],"category_scores_gemma":[0.0001363794,0.00054795726,0.0011090917,0.0009491728,0.0013132739,0.001951525,0.0015458723,0.0006445847,0.000081648446],"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.00032894203,0.0005943204,0.014154115,0.00030836585,0.0013841895,0.0003167833,0.010175669,0.0018576571,0.011619373,0.12062411,0.8313561,0.0072803707],"study_design_scores_gemma":[0.0071058962,0.00087042834,0.05383048,0.00026876846,0.00035373878,0.0009609885,0.01749152,0.033919718,0.001269786,0.022238279,0.8593459,0.0023445112],"about_ca_topic_score_codex":0.0005348544,"about_ca_topic_score_gemma":0.00007639622,"teacher_disagreement_score":0.18917067,"about_ca_system_score_codex":0.0012252501,"about_ca_system_score_gemma":0.00094160787,"threshold_uncertainty_score":0.9996972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40631407,0.018328676,0.52812976,0.0029614242,0.015018785,0.0064124255,0.00888176,0.003248625,0.010704472],"genre_scores_gemma":[0.9896073,0.00013452013,0.005619607,0.000008934874,0.00004336101,0.00041383415,0.0030178945,0.000057328944,0.0010972584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961122,0.000069362206,0.0011319888,0.0010907457,0.0010643679,0.000531302],"domain_scores_gemma":[0.9946675,0.000026295735,0.0020498843,0.0024697802,0.0006862585,0.000100285884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033598364,0.00061370444,0.0012729946,0.0010019096,0.00024126805,0.00008584852,0.0029077665,0.00086649216,0.000013330554],"category_scores_gemma":[0.00012854746,0.00058557873,0.00021477579,0.0028143134,0.00028820022,0.0006118725,0.00023189673,0.0008465184,0.0000089026935],"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.0007382011,0.0027267162,0.0049091885,0.0086830715,0.0040375604,0.00064306206,0.0034191154,0.03980392,0.048516262,0.82811916,0.01245286,0.045950867],"study_design_scores_gemma":[0.004411259,0.0019648816,0.006873761,0.0036784986,0.00062095706,0.00021513864,0.0041804323,0.0291023,0.025912723,0.0015420056,0.91806924,0.0034287977],"about_ca_topic_score_codex":0.00026435484,"about_ca_topic_score_gemma":0.00010178128,"teacher_disagreement_score":0.9056164,"about_ca_system_score_codex":0.00027294754,"about_ca_system_score_gemma":0.0005056173,"threshold_uncertainty_score":0.99965954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44927782,0.0044371993,0.4263979,0.005998059,0.004649124,0.065184936,0.0008430223,0.005819363,0.037392598],"genre_scores_gemma":[0.9861459,0.00011818029,0.011261959,0.000025594041,0.000057698933,0.00007748638,0.0013194579,0.000026381553,0.00096732256],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99837,0.00013054156,0.00035471868,0.0005273379,0.00043200018,0.00018539708],"domain_scores_gemma":[0.99831665,0.000086079155,0.0005679698,0.00071423047,0.00016809502,0.00014698785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021240332,0.00022496162,0.00056115317,0.00010907671,0.00016540743,0.000055652148,0.001371904,0.0003881027,0.000023698847],"category_scores_gemma":[0.00011220612,0.00025426334,0.00010775771,0.00038948833,0.00006396158,0.00036767416,0.00020199298,0.00034735363,0.000016731607],"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.0016600024,0.0035612953,0.013122416,0.029020565,0.0009853496,0.0010440819,0.030691,0.00041274636,0.038431033,0.35787684,0.05731476,0.46587992],"study_design_scores_gemma":[0.006123469,0.0008022738,0.71692896,0.006982621,0.00040165626,0.000044023076,0.0033684215,0.10598234,0.0023847471,0.004627661,0.14903452,0.0033193089],"about_ca_topic_score_codex":0.00020665278,"about_ca_topic_score_gemma":0.00014205604,"teacher_disagreement_score":0.7038065,"about_ca_system_score_codex":0.00006904872,"about_ca_system_score_gemma":0.00011193283,"threshold_uncertainty_score":0.99999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021922956,0.0023580503,0.009905466,0.0006043688,0.0014674312,0.0002682267,0.0005035589,0.0009223948,0.9839683],"genre_scores_gemma":[0.0008761323,0.000049721664,0.003964431,0.00030368989,0.0005519216,0.000023936716,0.00028307183,0.00008691306,0.9938602],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978,0.00007898694,0.00040619427,0.0007727745,0.0005787036,0.0003633546],"domain_scores_gemma":[0.9980415,0.000028552562,0.00033535075,0.0013134282,0.00011915102,0.0001620092],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035987468,0.00035239072,0.00043115087,0.00013856655,0.000048611542,0.0003101278,0.0018630861,0.00033899842,0.000042563093],"category_scores_gemma":[0.0000064494384,0.0002639492,0.00007504294,0.00032718337,0.00003779406,0.0002942786,0.00024764708,0.00017516196,0.0013572586],"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.000016748041,0.000047871577,0.000005847027,0.0001103982,0.000030314755,0.000032523738,0.00034247158,0.0000025948905,0.0000012591761,0.0029564486,0.99582267,0.00063086825],"study_design_scores_gemma":[0.00036951373,0.0001937513,0.00004050445,0.0004111615,0.000007110205,0.000019903831,0.00017968108,0.003585435,0.000002337544,0.00015904957,0.99465376,0.00037781845],"about_ca_topic_score_codex":0.0011404409,"about_ca_topic_score_gemma":0.00069410604,"teacher_disagreement_score":0.00989187,"about_ca_system_score_codex":0.000026716696,"about_ca_system_score_gemma":0.0001203573,"threshold_uncertainty_score":0.9999813},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060214796,0.000012878209,0.038586717,0.00039015498,0.0030348452,0.0019363585,0.00077315106,0.001795018,0.9534107],"genre_scores_gemma":[0.010614586,0.00027143635,0.0072911326,0.0004199444,0.00082039984,0.0008828546,0.0002274797,0.0007024929,0.97876966],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98692685,0.0007743984,0.0019572591,0.006332614,0.0020632711,0.0019455795],"domain_scores_gemma":[0.9814668,0.0003158464,0.00145792,0.015248391,0.00049227546,0.0010187103],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0030032408,0.0016448279,0.0021139341,0.00039137475,0.0003283504,0.0006222656,0.0091449665,0.0019312184,0.88436085],"category_scores_gemma":[0.00071414973,0.0015755175,0.00096890016,0.00084264326,0.00056272926,0.0007465257,0.007067946,0.0015882365,0.9703997],"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.000057944617,0.00046534112,0.0028594728,0.0004044656,0.000342725,0.0004022374,0.0005847919,0.000010734886,0.00051376957,0.0032223465,0.9754428,0.015693342],"study_design_scores_gemma":[0.001990143,0.0000022684717,0.00053409656,0.0006421793,0.000096819116,0.0006053525,0.00007427524,0.000037154306,0.0010060963,0.0006728189,0.9924728,0.0018659905],"about_ca_topic_score_codex":0.0008015381,"about_ca_topic_score_gemma":0.00024736024,"teacher_disagreement_score":0.08603886,"about_ca_system_score_codex":0.00084312464,"about_ca_system_score_gemma":0.00096355285,"threshold_uncertainty_score":0.9996299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93246645,0.00024083839,0.06342168,0.0006258922,0.001454425,0.00047375797,0.00023970484,0.0006754497,0.00040182346],"genre_scores_gemma":[0.6550668,0.00005614094,0.0030724064,0.000011215318,0.00007644968,0.000002397157,0.001965411,0.000052832544,0.33969635],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983339,0.000051681283,0.00019945137,0.00057177903,0.00048292876,0.00036028607],"domain_scores_gemma":[0.99876255,0.000020506148,0.00036254642,0.00043584374,0.0003066751,0.00011185274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019473855,0.00026067125,0.00043007004,0.00025525308,0.00031253722,0.000087570086,0.0009035442,0.0003184014,0.000021280126],"category_scores_gemma":[0.0000069299613,0.00030533154,0.00020102737,0.00078562147,0.000042377298,0.00020402852,0.0000454628,0.00026780542,0.00013251996],"study_design_candidate":"qualitative","study_design_consensus":null,"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.0006288011,0.0010725085,0.00020754339,0.0075767683,0.0006862263,0.00089276716,0.645304,0.047423605,0.016602434,0.0033419568,0.020394515,0.25586882],"study_design_scores_gemma":[0.0037601287,0.00042150848,0.03054574,0.0038149646,0.0004254896,0.00003170309,0.28156742,0.663278,0.0038612948,0.00041654796,0.009045475,0.0028317666],"about_ca_topic_score_codex":0.009384923,"about_ca_topic_score_gemma":0.0070809564,"teacher_disagreement_score":0.6158544,"about_ca_system_score_codex":0.0001114111,"about_ca_system_score_gemma":0.00015895326,"threshold_uncertainty_score":0.99993986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13122563,0.00037726865,0.86363196,0.0003320526,0.0008026191,0.00020432219,0.0009937314,0.00009367464,0.0023387673],"genre_scores_gemma":[0.9984045,0.0000054536063,0.0007379236,0.00033732376,0.000025909827,0.000017064032,0.00005815185,0.00000809655,0.0004055941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861735,0.000063205494,0.00028643446,0.0002893104,0.0003277231,0.00041598556],"domain_scores_gemma":[0.9987779,0.00005594486,0.00012111345,0.0006052075,0.00014158369,0.00029822474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021088147,0.00011297091,0.00028345644,0.0008511829,0.00025620818,0.000050970903,0.0009519586,0.000040040424,0.00013303867],"category_scores_gemma":[0.00006274299,0.00013017775,0.00011193273,0.0054789092,0.000021101712,0.00007651347,0.00008377777,0.0001833704,0.0000071231207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0000052952,0.00010869172,0.0030381107,0.000042761236,0.0010450778,0.00033746465,0.0009975618,0.8788322,0.04972483,0.021743752,0.03632423,0.007800014],"study_design_scores_gemma":[0.00013185377,0.000059003225,0.037695963,0.0000026917044,0.00031034285,0.000015020811,0.00012101572,0.9550913,0.00003533064,0.00010576683,0.0062162,0.00021550548],"about_ca_topic_score_codex":0.015657147,"about_ca_topic_score_gemma":0.005363247,"teacher_disagreement_score":0.86717886,"about_ca_system_score_codex":0.00036816945,"about_ca_system_score_gemma":0.0007815764,"threshold_uncertainty_score":0.99089766},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046035307,0.00007627726,0.00014456948,0.0002962834,0.0001765451,0.0004097929,0.0003086052,0.00006912637,0.99391526],"genre_scores_gemma":[0.17483167,0.000020574902,0.0020584667,0.0007986118,0.00011337244,0.000023536537,0.00016572932,0.000054838154,0.8219332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978205,0.000082128354,0.00065447984,0.00042800335,0.00076403806,0.00025084653],"domain_scores_gemma":[0.9984232,0.00017075044,0.00053326064,0.00039191745,0.0003485988,0.00013222508],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003708724,0.0003431733,0.00055447954,0.00036979793,0.00009952636,0.00018514071,0.00030498963,0.0002865545,0.00244689],"category_scores_gemma":[0.00015984237,0.00032574017,0.00013259581,0.000058343718,0.000120836994,0.0000011840517,0.000057264817,0.00016425356,0.00021958776],"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.00013835491,0.00008517305,0.0000115418125,0.00024993575,0.00018238284,0.000005574131,0.0007698742,0.0034956986,0.000009040506,0.00017207851,0.9938377,0.0010426543],"study_design_scores_gemma":[0.00057771493,0.00041260265,0.00011176732,0.00039308477,0.00007600477,0.000005531769,0.00006164607,0.0172491,0.00006519863,0.0000057839234,0.9807169,0.00032469124],"about_ca_topic_score_codex":0.0026856968,"about_ca_topic_score_gemma":0.0014803361,"teacher_disagreement_score":0.17198208,"about_ca_system_score_codex":0.00008128099,"about_ca_system_score_gemma":0.00007885641,"threshold_uncertainty_score":0.9999195},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047136,0.0005884462,0.36160594,0.00016847845,0.0013307174,0.001361595,0.00012004092,0.00017040443,0.6196072],"genre_scores_gemma":[0.56317705,0.00013242332,0.002543067,0.00013156353,0.0003095427,0.000079497215,0.00024983363,0.00022049349,0.4331565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706244,0.00025066646,0.0006773424,0.0010677492,0.00037368777,0.0005681061],"domain_scores_gemma":[0.99812806,0.00047858743,0.0005139716,0.00067303766,0.000025337851,0.00018101855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017872709,0.00059330335,0.00079577893,0.0007485909,0.000021497455,0.00018267351,0.0011411045,0.00016966544,0.000060952152],"category_scores_gemma":[0.000063476306,0.0005496627,0.00019511099,0.00021181571,0.00016723924,0.00016983473,0.0005197553,0.0004933673,0.000073632764],"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.0003135567,0.00060148264,0.010031134,0.0009985619,0.00041752093,0.00058197195,0.0055154944,0.00072805653,0.0006154413,0.05555366,0.9138558,0.010787331],"study_design_scores_gemma":[0.005877998,0.0019225519,0.03093088,0.021125223,0.00011873598,0.00022386346,0.000042856624,0.26050228,0.0044635627,0.006562105,0.665595,0.0026349851],"about_ca_topic_score_codex":0.09803418,"about_ca_topic_score_gemma":0.16599621,"teacher_disagreement_score":0.5481299,"about_ca_system_score_codex":0.000054590597,"about_ca_system_score_gemma":0.00005270358,"threshold_uncertainty_score":0.9996955},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78639054,0.0004549928,0.0056981724,0.023187743,0.0008088638,0.00080835493,0.000011949055,0.00003095074,0.18260841],"genre_scores_gemma":[0.997937,0.000012111489,0.00008999238,0.000037534974,0.000029058085,0.0000017819094,3.918882e-7,0.0000018378737,0.0018902518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960874,0.0014330978,0.00010012734,0.00031838857,0.0017646403,0.00029637522],"domain_scores_gemma":[0.99829865,0.0004758732,0.0000933612,0.00046937476,0.00064192835,0.000020804346],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0063009313,0.00006710875,0.000089857036,0.00043924307,0.0015669283,0.00024475777,0.0020732349,0.000044297347,0.000003059943],"category_scores_gemma":[0.00047971006,0.000036432404,0.00006761933,0.01823961,0.0005424673,0.00020856089,0.0005135305,0.00026298687,0.000005368438],"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.000008461696,0.00014310022,0.0014516084,0.000008527681,0.000014627304,0.0000042476604,0.0024996833,0.004080697,0.0002831572,0.97926974,0.0059444765,0.0062916493],"study_design_scores_gemma":[0.0023910159,0.00018010568,0.1227863,0.00022476741,0.000037227077,0.0000132586865,0.057323616,0.5812283,0.0027305428,0.0058037546,0.22678256,0.00049854006],"about_ca_topic_score_codex":0.00014362077,"about_ca_topic_score_gemma":0.0001128662,"teacher_disagreement_score":0.97346604,"about_ca_system_score_codex":0.00022118002,"about_ca_system_score_gemma":0.0006673259,"threshold_uncertainty_score":0.9997329},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00250033,0.0031380963,0.17432894,0.0038634378,0.009584414,0.0031469734,0.00046294095,0.0002224558,0.80275244],"genre_scores_gemma":[0.5523769,0.000058005953,0.00009951621,0.0006317783,0.000094100236,0.00012317402,0.000017240893,0.0001034002,0.44649586],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977923,0.0005280775,0.0004172919,0.00033049873,0.00075520365,0.00017664897],"domain_scores_gemma":[0.99751735,0.00019254777,0.0008927081,0.0012994517,0.000073189905,0.00002472697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033548637,0.00023053664,0.0003922642,0.00006188525,0.00009867772,0.000025989566,0.0019513896,0.00013437496,0.000465808],"category_scores_gemma":[0.00003801259,0.000108610504,0.00028067338,0.00061728386,0.0001373063,0.000048710237,0.00016483595,0.00026898895,0.0000022791373],"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.000013022162,0.0001961483,0.00027525175,0.00035019874,0.00016139468,0.00000147569,0.0010031846,0.00013450123,0.004597746,0.13439593,0.8561258,0.0027453802],"study_design_scores_gemma":[0.0007065157,0.00039477707,0.0017879705,0.0005749902,0.000060049322,0.000004599031,0.000107556036,0.0028086551,0.00626677,0.00039119768,0.98658234,0.00031455586],"about_ca_topic_score_codex":0.001647714,"about_ca_topic_score_gemma":0.0003851538,"teacher_disagreement_score":0.5498766,"about_ca_system_score_codex":0.000026732578,"about_ca_system_score_gemma":0.000110448906,"threshold_uncertainty_score":0.5100271},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20481065,0.48775667,0.12259426,0.16861957,0.0033666797,0.0004402894,0.0007087187,0.0007643064,0.010938853],"genre_scores_gemma":[0.90920275,0.0104522,0.0025219216,0.0003350576,0.0005359402,0.000014564659,0.000053243875,0.00007132104,0.07681297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966294,0.00036127894,0.00038278435,0.0009512774,0.0005267643,0.0011485069],"domain_scores_gemma":[0.9981355,0.00027181758,0.00014469656,0.0007508127,0.00017598616,0.0005212001],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006765233,0.0005242295,0.00051098346,0.00021721069,0.0016082888,0.0003357412,0.0010678465,0.00048908906,0.00013430299],"category_scores_gemma":[0.000054976488,0.0005893129,0.00041151763,0.0007910066,0.00030454318,0.0009556366,0.0006970128,0.0006205497,0.00043468163],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005469158,0.00018516342,0.0018479397,0.00037072372,0.00033064868,0.0154115,0.006776041,0.0054896283,0.0005355066,0.42445073,0.24856783,0.29597962],"study_design_scores_gemma":[0.00056816475,0.0001227191,0.007001717,0.0005427491,0.00012332798,0.0016224455,0.0010127856,0.13078512,0.00015919122,0.00074281,0.85674566,0.0005732853],"about_ca_topic_score_codex":0.27294913,"about_ca_topic_score_gemma":0.25380936,"teacher_disagreement_score":0.70439214,"about_ca_system_score_codex":0.0075327815,"about_ca_system_score_gemma":0.0003842676,"threshold_uncertainty_score":0.9996915},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016028297,0.00068191596,0.13054034,0.0008707775,0.0066259266,0.0008404876,0.0020827928,0.0018693771,0.8548856],"genre_scores_gemma":[0.120080784,0.00066611305,0.0015972237,0.00028011814,0.0006448879,0.00006403769,0.00008526966,0.00045690197,0.8761247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986073,0.000036616242,0.00029393667,0.00041225125,0.00040358814,0.00024635243],"domain_scores_gemma":[0.99881816,0.00003830524,0.00026206064,0.00074678735,0.00005936924,0.00007532881],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011721623,0.00023250445,0.0003885577,0.00015467446,0.00003916838,0.0000583939,0.000816254,0.00014037247,0.0006610274],"category_scores_gemma":[0.000019702175,0.00020913339,0.00014068262,0.00036407151,0.000045273893,0.0001442573,0.00014015444,0.00012663283,0.0008832342],"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.000002138891,0.000034457393,0.0003160521,0.00027186473,0.000030241103,0.0000103156835,0.0018115377,0.000007794831,0.00002157236,0.0009839184,0.98244095,0.014069137],"study_design_scores_gemma":[0.00029187853,0.000029376684,0.0032215877,0.00064615847,0.000011913343,0.000010824865,0.000318272,0.0018699558,0.000011631556,0.000036235047,0.9931557,0.00039642115],"about_ca_topic_score_codex":0.00079882354,"about_ca_topic_score_gemma":0.00070956675,"teacher_disagreement_score":0.12894312,"about_ca_system_score_codex":0.00003314872,"about_ca_system_score_gemma":0.00006903933,"threshold_uncertainty_score":0.9998947},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031737807,0.0010902125,0.31918877,0.00032608182,0.0026650126,0.0006406942,0.00023033777,0.0009585347,0.6748686],"genre_scores_gemma":[0.0003086824,0.000047402125,0.01019623,0.00003970945,0.00038910544,0.0000022930049,0.00091123814,0.000037450674,0.98806787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99682945,0.000102740516,0.0004510164,0.001318393,0.00069124723,0.00060713204],"domain_scores_gemma":[0.99689066,0.00003308678,0.0006089313,0.001701273,0.00045539558,0.00031063636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020624454,0.000492232,0.0006823632,0.00043483204,0.00028880624,0.00031756615,0.001866571,0.00053528807,0.00010923039],"category_scores_gemma":[0.000017428487,0.0005854438,0.00042714167,0.0008474647,0.00013520346,0.00070956326,0.0008538887,0.0006723948,0.000100601974],"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.000017780903,0.00025825226,0.000071856615,0.00026372806,0.0005050255,0.04194787,0.0009722305,0.000031791278,0.0000082561655,0.073139146,0.80340296,0.07938109],"study_design_scores_gemma":[0.00039598168,0.0000881303,0.000032840922,0.0005193873,0.00008085597,0.0004924012,0.00030662114,0.00036527036,0.000009269144,0.00010278142,0.9969791,0.0006273379],"about_ca_topic_score_codex":0.00006420518,"about_ca_topic_score_gemma":0.0006391004,"teacher_disagreement_score":0.31319928,"about_ca_system_score_codex":0.0003601232,"about_ca_system_score_gemma":0.0009969419,"threshold_uncertainty_score":0.9996597},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072143436,0.020188326,0.012187941,0.0027148311,0.011378701,0.0036806783,0.0026102744,0.0015023,0.9450155],"genre_scores_gemma":[0.017339248,0.0018575911,0.0022903208,0.003183483,0.00382719,0.0006955081,0.0013202328,0.0011302459,0.9683562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9854213,0.0013456482,0.0027033056,0.004228583,0.0033565827,0.0029445696],"domain_scores_gemma":[0.9899178,0.00039464515,0.002293949,0.005697696,0.00045555606,0.0012403141],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0019635223,0.0024646726,0.0029633755,0.001022736,0.0014498389,0.001970883,0.00905018,0.0011527492,0.066795796],"category_scores_gemma":[0.0003717364,0.0026444031,0.0014506229,0.0026883762,0.00060088496,0.001086541,0.0043977327,0.0024196552,0.01387474],"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.00010980302,0.0010858026,0.0013402709,0.0010749418,0.000946657,0.0016304705,0.0022525738,0.00051628024,0.00014601607,0.044480603,0.8510607,0.095355876],"study_design_scores_gemma":[0.0020966737,0.0004886275,0.0012975633,0.0007763348,0.00029574716,0.0003266491,0.0002848731,0.0032433656,0.00003490672,0.0005971505,0.98765826,0.0028998335],"about_ca_topic_score_codex":0.0025818613,"about_ca_topic_score_gemma":0.00044338653,"teacher_disagreement_score":0.13659757,"about_ca_system_score_codex":0.0013049513,"about_ca_system_score_gemma":0.0013167204,"threshold_uncertainty_score":0.9998818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014075075,0.00039103715,0.9685964,0.0014677187,0.00016651586,0.00044599207,0.0007414492,0.00016644584,0.013949355],"genre_scores_gemma":[0.92462283,0.0001033699,0.06887697,0.000022663631,0.000035426594,8.244013e-7,0.00035152334,0.00000876608,0.005977626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890846,0.000021128139,0.00010628132,0.0005340598,0.00017399207,0.0002561031],"domain_scores_gemma":[0.997801,0.000025510753,0.0001445891,0.0018322376,0.00008787246,0.00010877457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026407972,0.000119015785,0.0002684325,0.000012218729,0.00033142115,0.000095565825,0.0037019127,0.00007212524,0.0018137672],"category_scores_gemma":[0.000014562867,0.00014622141,0.000083222214,0.000048691207,0.000057610832,0.0017363152,0.00052319915,0.00005251343,0.000017338845],"study_design_candidate":"design_other","study_design_consensus":null,"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.0013353727,0.0012743237,0.00437814,0.00041749125,0.000679014,0.00023392712,0.015148419,0.0061068283,0.0008968513,0.019846348,0.100119606,0.84956366],"study_design_scores_gemma":[0.008041666,0.000251407,0.15642723,0.00028073124,0.00014277146,0.000016680864,0.0021088114,0.7474387,0.000093149545,0.000090360525,0.084166005,0.0009424343],"about_ca_topic_score_codex":0.042777658,"about_ca_topic_score_gemma":0.0034348264,"teacher_disagreement_score":0.91054773,"about_ca_system_score_codex":0.00009276315,"about_ca_system_score_gemma":0.000055589906,"threshold_uncertainty_score":0.9990987},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035186048,0.0034744435,0.22430357,0.0006018014,0.0063774935,0.002366637,0.0032411965,0.0014446247,0.75783837],"genre_scores_gemma":[0.01560929,0.0007314073,0.0030130325,0.0009841593,0.0010846503,0.00026937094,0.0024312516,0.0008006505,0.9750762],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99147147,0.00045213156,0.0014301967,0.0031670884,0.0015589927,0.0019200981],"domain_scores_gemma":[0.99436206,0.00024308565,0.001549138,0.002931918,0.00010249703,0.0008113226],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00047476613,0.0018913524,0.0020391366,0.0011150385,0.00008564814,0.00082935655,0.006655748,0.00056565186,0.0022381763],"category_scores_gemma":[0.000042153217,0.0017690483,0.0007336654,0.0004963583,0.00038456183,0.00043174403,0.0025697441,0.0016233219,0.0051956796],"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.00021418672,0.0002623792,0.000330012,0.000433564,0.00047954897,0.00031280215,0.0013990017,0.000008053263,0.00025585768,0.0051994678,0.9878192,0.003285944],"study_design_scores_gemma":[0.0023373892,0.00036223006,0.00027168062,0.0024384134,0.000080949336,0.00020302976,0.0000448387,0.0047181402,0.00050803775,0.00042324475,0.9866981,0.0019139622],"about_ca_topic_score_codex":0.022689313,"about_ca_topic_score_gemma":0.012573201,"teacher_disagreement_score":0.22129054,"about_ca_system_score_codex":0.0001539548,"about_ca_system_score_gemma":0.00024968493,"threshold_uncertainty_score":0.99938303},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001720307,0.0006204051,0.16915578,0.00056986866,0.00008452306,0.00043396663,0.00016315037,0.0017766817,0.8271784],"genre_scores_gemma":[0.17548268,0.00050214713,0.015644168,0.0009556838,0.00044167304,9.5226886e-7,0.0053053927,0.012487707,0.7891796],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979991,0.00027853344,0.00026902265,0.0006491541,0.00047213616,0.00033210978],"domain_scores_gemma":[0.99744415,0.000017754977,0.00027296896,0.0016650084,0.00047651544,0.00012360321],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046763592,0.00022715895,0.00024370485,0.0002757682,0.0013113673,0.0015185643,0.0033214933,0.00012627043,0.001700365],"category_scores_gemma":[0.00013235652,0.00021448788,0.000045662942,0.0009757162,0.00013518047,0.00016628875,0.0019236042,0.00033355673,0.0023437736],"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.000015892596,0.00018612067,0.0000014337334,0.00034580307,0.0000832963,0.000016231013,0.0005849365,0.00043710636,0.000027642898,0.03670843,0.85562575,0.10596739],"study_design_scores_gemma":[0.0003222542,0.000064284264,0.000059461498,0.00064604887,0.000009349421,0.00003299955,0.000045692297,0.0028341527,0.000025112518,0.000046998233,0.99567336,0.00024030638],"about_ca_topic_score_codex":0.00009371507,"about_ca_topic_score_gemma":0.0000033933752,"teacher_disagreement_score":0.17546548,"about_ca_system_score_codex":0.00009860229,"about_ca_system_score_gemma":0.000023201093,"threshold_uncertainty_score":0.9999888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20643693,0.00009179894,0.7854798,0.0051727183,0.00054243987,0.0008888226,0.000044443383,0.00033223664,0.0010108146],"genre_scores_gemma":[0.9929268,0.0000017492738,0.006722567,0.00018332445,0.000055002347,0.000032317927,0.000018074483,0.0000115875,0.00004862487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977701,0.000027368165,0.00055781915,0.00054025743,0.00039518625,0.0007092985],"domain_scores_gemma":[0.9989003,0.00010940474,0.00013008469,0.0005769882,0.00008109178,0.00020216272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197003,0.00024681806,0.00024097807,0.00007159034,0.0003730746,0.00063457363,0.0011727854,0.00008841841,0.0000067161423],"category_scores_gemma":[0.000048642818,0.00017381579,0.00008809367,0.000857328,0.00005360485,0.00032875774,0.0002674441,0.00027046492,0.000108985776],"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.00009794208,0.002258227,0.01725838,0.0002912865,0.00028196242,0.00048431367,0.015245405,0.3002323,0.030108584,0.4527189,0.0132932095,0.1677295],"study_design_scores_gemma":[0.011068473,0.0011916124,0.60472333,0.0016373603,0.000023072804,0.0003582511,0.007992508,0.15085924,0.008395998,0.016200602,0.19331661,0.0042329575],"about_ca_topic_score_codex":0.00083219336,"about_ca_topic_score_gemma":0.0042566434,"teacher_disagreement_score":0.78648984,"about_ca_system_score_codex":0.0002974735,"about_ca_system_score_gemma":0.000109645356,"threshold_uncertainty_score":0.70880026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0817942,0.0022019965,0.7622292,0.0027525898,0.0015493978,0.00051057205,0.000025004758,0.0006761982,0.14826083],"genre_scores_gemma":[0.97176915,0.000023523937,0.019862156,0.0006123595,0.000064168154,0.000015134311,0.0000026644586,0.0000105830995,0.0076402356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985437,0.00007144241,0.0002827817,0.0004864861,0.0002577579,0.00035784146],"domain_scores_gemma":[0.9985834,0.000069995396,0.00007573997,0.0009750377,0.00009971727,0.00019614368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033944857,0.00018215667,0.00023050657,0.00005004564,0.00012301609,0.0003182063,0.0007794724,0.0000904869,0.000035340396],"category_scores_gemma":[0.00013525905,0.00015495844,0.000058530473,0.00032411524,0.00004914964,0.00038499606,0.00019315424,0.00013058142,0.000087403736],"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.000008944307,0.0002218025,0.005378454,0.000104780804,0.000053230313,0.00014142733,0.0010294362,0.000034312394,0.0010253185,0.8537245,0.11208681,0.026190994],"study_design_scores_gemma":[0.00382858,0.0002005991,0.023644703,0.00014621583,0.00001640717,0.00039808996,0.0001380203,0.028203933,0.0031479308,0.021379247,0.9175833,0.0013129895],"about_ca_topic_score_codex":0.000091957154,"about_ca_topic_score_gemma":0.00006575664,"teacher_disagreement_score":0.88997495,"about_ca_system_score_codex":0.000027412956,"about_ca_system_score_gemma":0.000060808226,"threshold_uncertainty_score":0.63190216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004475064,0.000083665276,0.77152646,0.0003199861,0.0003211216,0.000043590135,4.8548054e-7,0.00013893559,0.2230907],"genre_scores_gemma":[0.9652006,0.0000012931029,0.027911374,0.00037796985,0.000029799232,0.00000512151,9.158045e-7,0.000001937335,0.0064710137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950254,0.000003843296,0.00009169265,0.00015478201,0.00011185933,0.00013528355],"domain_scores_gemma":[0.99960405,0.0000032078385,0.000017195573,0.0002969833,0.000024193663,0.00005438039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005482421,0.000052321753,0.00006337185,0.0000048474353,0.00004041126,0.000082760795,0.0003781624,0.000022936087,0.00015668347],"category_scores_gemma":[0.0000018098796,0.000042209704,0.00002864244,0.000048855807,0.000006319796,0.00044944647,0.000052454277,0.00003084504,0.00017116545],"study_design_candidate":"theoretical_or_conceptual","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":[5.843983e-7,0.000038908194,0.00027953082,0.0000016763328,0.0000048882525,0.000012320353,0.0006847241,0.00012995584,0.000107198706,0.9877416,0.002722225,0.008276423],"study_design_scores_gemma":[0.001662351,0.00015927033,0.037622802,0.000043232183,0.0000029249368,0.00009023266,0.00010300869,0.0013719482,0.0021797833,0.023216402,0.9329821,0.00056593376],"about_ca_topic_score_codex":0.1305256,"about_ca_topic_score_gemma":0.24982807,"teacher_disagreement_score":0.96452516,"about_ca_system_score_codex":0.00022453789,"about_ca_system_score_gemma":0.00008986886,"threshold_uncertainty_score":0.8752643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45939922,0.000034690995,0.5338229,0.000069220856,0.000104255436,0.0001808879,0.00002795111,0.000034104498,0.0063267904],"genre_scores_gemma":[0.9852803,0.000002444228,0.0140609015,0.0001946558,0.0000059952367,0.000009056759,0.000009320211,0.000004153019,0.00043320569],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988217,0.000056071254,0.0002865633,0.00031008985,0.00030461795,0.0002209571],"domain_scores_gemma":[0.9991835,0.000039930546,0.00012703797,0.00048064167,0.000066731045,0.00010220854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003139557,0.0001354938,0.00028364998,0.00012353243,0.00006704947,0.000030727628,0.00041113322,0.000032465075,0.00016653577],"category_scores_gemma":[0.0000083313635,0.000107843414,0.000048895847,0.00040030305,0.000035352106,0.00018469016,0.000064333304,0.00005906982,0.000006977651],"study_design_candidate":"observational","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.0008865276,0.002165612,0.74278027,0.0004891471,0.0039208643,0.00017592739,0.0054978314,0.020281598,0.005908396,0.019060679,0.072514124,0.126319],"study_design_scores_gemma":[0.00046641054,0.00017257746,0.25873536,0.000029180252,0.00008972744,0.0000027939184,0.000045457426,0.73423594,0.0049643293,0.000009059318,0.0009703264,0.0002788239],"about_ca_topic_score_codex":0.3001236,"about_ca_topic_score_gemma":0.14353675,"teacher_disagreement_score":0.7139544,"about_ca_system_score_codex":0.000052659867,"about_ca_system_score_gemma":0.00019862902,"threshold_uncertainty_score":0.8720915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800934,0.000121439596,0.015354641,0.00037249923,0.00088585424,0.00029470018,0.000034541197,0.00006588303,0.0027770074],"genre_scores_gemma":[0.96119034,0.000019592599,0.03801218,0.000117551885,0.000052620333,0.00001125339,0.00005524067,0.000014928023,0.00052629254],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718314,0.00012586343,0.0010272717,0.0005964523,0.0005568747,0.00051040127],"domain_scores_gemma":[0.99786204,0.00009292281,0.0006488826,0.000988067,0.00027865835,0.00012941906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011208373,0.00031308064,0.00045561488,0.00023842075,0.00032309076,0.00029728297,0.0018025205,0.00009665775,0.00011971503],"category_scores_gemma":[0.00006133837,0.00028648047,0.00004382674,0.00023780986,0.00016187647,0.0017414282,0.0009830411,0.00039691041,0.000008439249],"study_design_candidate":"observational","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.00017751727,0.000798337,0.87163436,0.00071903126,0.00021291686,0.000016015449,0.00813437,0.0005632226,0.010929783,0.029340366,0.0022351088,0.07523895],"study_design_scores_gemma":[0.0015987151,0.00015268072,0.28670853,0.0006367299,0.000017195533,0.00007277758,0.0012495634,0.7017555,0.003351488,0.00006167382,0.003528548,0.00086657086],"about_ca_topic_score_codex":0.3376393,"about_ca_topic_score_gemma":0.109462835,"teacher_disagreement_score":0.7011923,"about_ca_system_score_codex":0.00023810958,"about_ca_system_score_gemma":0.00042474057,"threshold_uncertainty_score":0.99995875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37462032,0.00007153218,0.61235213,0.000038999526,0.00012276295,0.0002918379,0.000011289555,0.000076462595,0.012414664],"genre_scores_gemma":[0.9991212,0.0000010541565,0.00080268946,0.000011157199,0.000018743784,0.000021746635,0.0000074213817,0.0000028563213,0.000013154718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983724,0.000076652526,0.0005102794,0.00025729582,0.0005419969,0.00024142365],"domain_scores_gemma":[0.99889666,0.000057266945,0.00016263564,0.00048586872,0.00035092994,0.000046623114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003336819,0.000095635274,0.0002120885,0.00008324613,0.000034585653,0.00005587063,0.00039996466,0.000058681508,0.0000042522665],"category_scores_gemma":[0.000030570834,0.00008019861,0.000036488633,0.0005490532,0.000023462759,0.0004784236,0.000030983214,0.00006715352,0.000009336255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015440768,0.00041794978,0.05189835,0.00052590657,0.000078908684,0.000034059154,0.0012635353,0.044496097,0.0066723386,0.75076234,0.0007086072,0.14298752],"study_design_scores_gemma":[0.0012845824,0.000053688713,0.13379666,0.00011298533,0.0000063776247,0.0000119328715,0.0005273998,0.8628431,0.00096263905,0.0000675058,0.00022003849,0.00011307305],"about_ca_topic_score_codex":0.00011545402,"about_ca_topic_score_gemma":0.00006452776,"teacher_disagreement_score":0.81834704,"about_ca_system_score_codex":0.00013270942,"about_ca_system_score_gemma":0.00013364403,"threshold_uncertainty_score":0.32704043},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633251,0.00021553127,0.20020348,0.059718795,0.00092487474,0.0019270362,0.00017742865,0.00032051658,0.17318723],"genre_scores_gemma":[0.9954285,4.6108747e-7,0.002036714,0.0020335987,0.000010194607,0.000006049183,0.0000011271168,0.000001963227,0.00048140876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990735,0.00003723465,0.00021873711,0.00021098413,0.00027140373,0.00018813914],"domain_scores_gemma":[0.99916947,0.00008625621,0.000055405388,0.0005435936,0.000085152606,0.000060113154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023378835,0.00008367971,0.00012800447,0.000033178483,0.000052708143,0.000059277136,0.000497848,0.000019920913,0.00013629663],"category_scores_gemma":[0.000041739935,0.000050996172,0.000047820646,0.00023016888,0.000009113024,0.000028947063,0.000059774742,0.000043686254,0.00010775944],"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.000020836087,0.00015552196,0.000038382634,0.000003458669,0.000019286734,0.0000051198494,0.0007851188,0.00025338834,0.0027374418,0.87481874,0.11575243,0.005410259],"study_design_scores_gemma":[0.0057744696,0.012659361,0.27522975,0.0011381763,0.000056014745,0.00007048088,0.0022858973,0.03923082,0.17327264,0.055107497,0.43191478,0.0032601238],"about_ca_topic_score_codex":0.000048234077,"about_ca_topic_score_gemma":0.000015898504,"teacher_disagreement_score":0.81971127,"about_ca_system_score_codex":0.000021674656,"about_ca_system_score_gemma":0.000033185304,"threshold_uncertainty_score":0.20795636},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20375958,0.008915681,0.124889456,0.001957764,0.00065269787,0.0007080704,0.000036069665,0.0002633209,0.65881735],"genre_scores_gemma":[0.9854759,0.0001961654,0.00082282716,0.000018057824,0.0000068179643,0.0000010914367,9.4217575e-7,0.0000015805194,0.013476609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994667,0.0000657017,0.00012776835,0.00013182613,0.000105448285,0.00010255917],"domain_scores_gemma":[0.99933594,0.0002177081,0.000035838882,0.0002935292,0.000075418604,0.00004155441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016724518,0.000051543528,0.00009813379,0.000012352169,0.0002594054,0.00005381298,0.00027019205,0.000025803645,0.000011996798],"category_scores_gemma":[0.000012886115,0.000037548172,0.000027289441,0.00010672957,0.00018278742,0.00016938079,0.000033386255,0.00003680596,0.000014230636],"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.000011379276,0.000055192588,0.0005660788,0.00008938437,0.000047950525,0.000010491454,0.0040570227,0.0003318339,0.00008038399,0.8334722,0.0097280145,0.15155005],"study_design_scores_gemma":[0.0016794023,0.00027917072,0.045942403,0.00023345186,0.000042993834,0.00015963962,0.028098466,0.33328438,0.000095121686,0.004673763,0.5847771,0.00073408196],"about_ca_topic_score_codex":0.0009882492,"about_ca_topic_score_gemma":0.00017777088,"teacher_disagreement_score":0.8287985,"about_ca_system_score_codex":0.000011766649,"about_ca_system_score_gemma":0.00004758736,"threshold_uncertainty_score":0.19951628},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04664756,0.0010830143,0.95006835,0.00008029224,0.000105921616,0.0012179769,0.000051939754,0.000059526228,0.000685405],"genre_scores_gemma":[0.97025347,0.000022084781,0.028719444,0.000012733471,0.000022606848,0.000060001137,0.000048554306,0.0000063630446,0.0008547517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998831,0.00008768992,0.0003586643,0.00034324435,0.00018688248,0.00019255654],"domain_scores_gemma":[0.99903744,0.00008907681,0.0002998831,0.00032778084,0.00021119975,0.000034596338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004848376,0.00014618937,0.00025835185,0.00015550946,0.0002694139,0.00006980233,0.0003305605,0.00006711618,0.00000253428],"category_scores_gemma":[0.00000438705,0.000112066075,0.000108020606,0.00031687727,0.00010279819,0.00021183174,0.00007889321,0.000041883868,7.9264146e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074670115,0.005899426,0.030462699,0.012061685,0.0018033889,0.000008194757,0.059813842,0.09077965,0.0066854563,0.27855042,0.093679845,0.4195087],"study_design_scores_gemma":[0.0008013708,0.0001619239,0.0037325304,0.00014487842,0.000066608656,0.0000018222376,0.0026478001,0.98859805,0.001191541,0.00006555984,0.0024590578,0.00012888052],"about_ca_topic_score_codex":0.0012576033,"about_ca_topic_score_gemma":0.000697413,"teacher_disagreement_score":0.9236059,"about_ca_system_score_codex":0.000102614365,"about_ca_system_score_gemma":0.000024616953,"threshold_uncertainty_score":0.45699218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012734549,0.000012864107,0.9665413,0.00027126542,0.00012201678,0.00002056567,2.631222e-7,0.00017039746,0.020126786],"genre_scores_gemma":[0.9898915,0.0000032672597,0.007765532,0.00018578567,0.000019375742,5.815091e-7,0.0000013765307,0.0000014356085,0.0021310926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973285,0.000005176523,0.000053064156,0.00008230813,0.00006905688,0.00005757093],"domain_scores_gemma":[0.99975187,0.0000038194044,0.000011765928,0.0001555389,0.00005439884,0.000022620612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021632508,0.000024711911,0.00003157552,0.00001080126,0.000062944295,0.000019391618,0.00019615909,0.000012375244,0.000028711804],"category_scores_gemma":[0.000008541212,0.000020134483,0.000006522016,0.0002865978,0.000006154657,0.0001857781,0.00002872353,0.000013957418,0.00027489147],"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":[3.1930205e-7,0.00006208214,0.021890724,0.000004607961,0.000006292824,0.00005116169,0.0007144221,0.00009368975,0.0013597433,0.8583612,0.10783744,0.009618358],"study_design_scores_gemma":[0.0012519105,0.00010027735,0.31621623,0.000022267293,0.0000024782487,0.0012343962,0.000053098953,0.098557666,0.027375193,0.002441486,0.55185956,0.00088547805],"about_ca_topic_score_codex":0.000008731163,"about_ca_topic_score_gemma":5.1801965e-7,"teacher_disagreement_score":0.977157,"about_ca_system_score_codex":0.000006494897,"about_ca_system_score_gemma":0.000015325111,"threshold_uncertainty_score":0.35332653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060394583,0.000007681842,0.9262793,0.0002122449,0.00035657096,0.00011276683,0.0000070171677,0.00021906625,0.06676588],"genre_scores_gemma":[0.97762984,3.3400943e-7,0.020198898,0.0005828087,0.00005826285,0.0000048707975,0.000006472018,0.000004324444,0.0015141892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.000017655442,0.00022668914,0.0002623595,0.00022018199,0.0002556035],"domain_scores_gemma":[0.9992898,0.00012233038,0.000058277838,0.00035049234,0.00007008425,0.000109014814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024278813,0.000098459896,0.00010956166,0.00006024354,0.000121032324,0.00014107394,0.00041991766,0.00004046165,0.000010990655],"category_scores_gemma":[0.00002049248,0.00008178621,0.000042730248,0.00030118195,0.000023744835,0.0001483403,0.00005615441,0.000081012935,0.00034460437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010796523,0.00032346314,0.0005577574,0.000028027947,0.000019753925,0.00016333899,0.0006871149,0.0022217892,0.00020900041,0.6536727,0.008230822,0.33387542],"study_design_scores_gemma":[0.0014887278,0.00063656527,0.059499256,0.00016975222,0.000009281147,0.00018622931,0.00024817328,0.75485224,0.001174162,0.003907049,0.1769157,0.00091285567],"about_ca_topic_score_codex":0.000018813165,"about_ca_topic_score_gemma":0.000027963604,"teacher_disagreement_score":0.9715904,"about_ca_system_score_codex":0.00002865355,"about_ca_system_score_gemma":0.00002876141,"threshold_uncertainty_score":0.4429307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4711438,0.0027275793,0.5028535,0.0050786636,0.0061778035,0.0006341441,0.0000577627,0.0002867338,0.011039993],"genre_scores_gemma":[0.9862326,0.00004527148,0.00072196784,0.003085054,0.00036047248,0.000042411786,0.000024757235,0.00002807647,0.009459388],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950358,0.00035338037,0.0011462772,0.0015674861,0.00076691865,0.0011300889],"domain_scores_gemma":[0.99655354,0.000237866,0.00037128018,0.0020925645,0.00040521412,0.0003395576],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000904919,0.00064023706,0.00075435266,0.00028808945,0.00090469007,0.00047258276,0.0022682252,0.0004392616,0.00017457313],"category_scores_gemma":[0.00018653745,0.00064234785,0.00040099423,0.0021127835,0.00027682647,0.0006109336,0.00095613446,0.0006551743,0.0013016135],"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.00045203167,0.0031247782,0.5536053,0.0015216025,0.0005723233,0.00085235864,0.00322129,0.012460458,0.015021826,0.06894535,0.108828664,0.23139398],"study_design_scores_gemma":[0.0037175566,0.00039767602,0.18078044,0.0020949633,0.000118060874,0.000015564901,0.00015013808,0.5075323,0.009251238,0.0005546101,0.29404894,0.0013385493],"about_ca_topic_score_codex":0.0003223885,"about_ca_topic_score_gemma":0.000032321263,"teacher_disagreement_score":0.5150888,"about_ca_system_score_codex":0.00028557895,"about_ca_system_score_gemma":0.0009844851,"threshold_uncertainty_score":0.9996028},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07868365,0.000047931673,0.9141892,0.0006714544,0.0018349264,0.002144254,0.00030772944,0.00029935592,0.0018214677],"genre_scores_gemma":[0.9701849,0.000008508502,0.024418702,0.0020279186,0.00014538915,0.0006274515,0.00075454864,0.000038784052,0.0017937621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733996,0.00003568371,0.0009655754,0.00045352578,0.0004160616,0.000789198],"domain_scores_gemma":[0.9977394,0.000087329856,0.00041442295,0.0008991706,0.000699952,0.00015973065],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064697687,0.00040311727,0.00048242323,0.00027194864,0.0006961886,0.0012647078,0.0010205759,0.00025582168,0.0000049986584],"category_scores_gemma":[0.000047306305,0.00034349452,0.00022446031,0.0005653526,0.00013001265,0.0028871442,0.00010265168,0.00028587494,0.00002476899],"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.0032347774,0.0044347597,0.008706571,0.004535452,0.0021209982,0.00002618442,0.014470006,0.0023736262,0.0034214072,0.7562157,0.0747636,0.12569693],"study_design_scores_gemma":[0.011463557,0.0020873996,0.0018006833,0.0006675462,0.00011789524,0.000113737944,0.0015440705,0.6037809,0.0038937803,0.005482049,0.36786482,0.0011835573],"about_ca_topic_score_codex":0.00005777849,"about_ca_topic_score_gemma":0.00008917235,"teacher_disagreement_score":0.8915013,"about_ca_system_score_codex":0.00023976939,"about_ca_system_score_gemma":0.00021672416,"threshold_uncertainty_score":0.9999017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0376623,0.0005146817,0.8931156,0.0014943246,0.005870158,0.0029060848,0.0012886618,0.00079190533,0.05635633],"genre_scores_gemma":[0.98809433,0.00006857796,0.0064059575,0.0021232183,0.00018987256,0.00034575674,0.0008131147,0.000026213062,0.0019329486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964994,0.00003838047,0.0014458784,0.00046679145,0.0006284997,0.00092101324],"domain_scores_gemma":[0.99743414,0.0000889267,0.00048348727,0.0012141415,0.0005591249,0.00022020961],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073961227,0.0004754774,0.0006235159,0.0002446973,0.0005005733,0.0010652823,0.0019027598,0.000238425,0.000015617736],"category_scores_gemma":[0.00005077113,0.00043219642,0.00029571462,0.0007100162,0.00013335852,0.0020604052,0.00066818396,0.00043151327,0.00010946279],"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.00018258761,0.00092836516,0.0091344025,0.0018814611,0.00047884329,0.000012596304,0.007570327,0.00016177466,0.00008899267,0.8251014,0.09970014,0.054759145],"study_design_scores_gemma":[0.0073874434,0.00017301792,0.0013202786,0.00040605047,0.000035516496,0.000022016575,0.0005230727,0.06919592,0.00078100344,0.001302013,0.91817445,0.00067923055],"about_ca_topic_score_codex":0.000049077087,"about_ca_topic_score_gemma":0.000034012013,"teacher_disagreement_score":0.95043206,"about_ca_system_score_codex":0.00027399443,"about_ca_system_score_gemma":0.00025941856,"threshold_uncertainty_score":0.9999717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14808768,0.0009095456,0.8330859,0.0023234836,0.0014773777,0.0011322049,0.008117651,0.00073265476,0.0041334843],"genre_scores_gemma":[0.9825162,0.00007037297,0.0046332036,0.0030990911,0.00020375877,0.00009921608,0.009136604,0.000023927782,0.00021756689],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943422,0.00018680145,0.0018771528,0.0011366123,0.0010700327,0.0013871676],"domain_scores_gemma":[0.9945368,0.00016896552,0.0006867592,0.0040035984,0.00023320036,0.00037067576],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011548086,0.00069703104,0.00085363694,0.00032525675,0.00051605765,0.0017857521,0.0064273085,0.00032998397,0.000068109555],"category_scores_gemma":[0.00019396869,0.00067486335,0.00013439626,0.0015992735,0.0001767022,0.006681411,0.0027195776,0.0008021419,0.00028482996],"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.0006417881,0.0030474048,0.12202354,0.0012007885,0.00089634873,0.00045691672,0.02368183,0.011082736,0.0013772153,0.045449514,0.16139752,0.6287444],"study_design_scores_gemma":[0.005800858,0.00023609122,0.051285304,0.0011487089,0.000055583852,0.000062853986,0.0014000991,0.41073337,0.0006649987,0.0015562908,0.5254438,0.0016120202],"about_ca_topic_score_codex":0.0023014748,"about_ca_topic_score_gemma":0.0003791562,"teacher_disagreement_score":0.8344286,"about_ca_system_score_codex":0.00039816427,"about_ca_system_score_gemma":0.00044609862,"threshold_uncertainty_score":0.99957025},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.317051e-8,0.00017717162,0.48875898,0.00018165649,0.0003686254,0.00007340757,0.000011325896,0.00012401667,0.5103048],"genre_scores_gemma":[0.00042516782,0.0000624307,0.0046965466,0.00021773887,0.00007682105,0.0000057364355,0.000076349934,0.0000072310195,0.994432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909717,0.0000059037143,0.00023364619,0.0003529156,0.00019812385,0.00011225842],"domain_scores_gemma":[0.99919415,0.000015996528,0.00010709934,0.0005423812,0.000101591024,0.000038782324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071738716,0.00016554978,0.00018879648,0.000088957946,0.00005513048,0.00014715178,0.00048225952,0.00019267459,0.000120488156],"category_scores_gemma":[0.0000052290943,0.00014979098,0.00008414687,0.000045035235,0.000013017789,0.00018322519,0.00013421214,0.00011624893,0.00027218508],"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":[4.8514954e-7,0.0000030169351,0.0000011012024,0.00002060218,0.000009465643,0.000004206056,0.0000075354915,0.000009559158,8.0200607e-7,0.8977035,0.029146787,0.07309294],"study_design_scores_gemma":[0.00008938868,0.000011824337,0.000015881786,0.000160381,0.000006723729,0.0000045681786,5.796637e-7,0.01601775,0.0000062113895,0.031289127,0.9521899,0.00020764905],"about_ca_topic_score_codex":0.0000073434558,"about_ca_topic_score_gemma":0.0000060850957,"teacher_disagreement_score":0.92304313,"about_ca_system_score_codex":0.000050503775,"about_ca_system_score_gemma":0.00005972743,"threshold_uncertainty_score":0.6108299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20244919,0.011609473,0.76992726,0.0063843695,0.00035433704,0.0007628359,0.006690975,0.0001831168,0.0016384177],"genre_scores_gemma":[0.99493897,0.00033857377,0.002942839,0.0003116697,0.000021881142,0.000026563828,0.0012242058,0.000005441769,0.00018986853],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985963,0.000088417,0.00034067422,0.00053232553,0.00013119048,0.00031109422],"domain_scores_gemma":[0.9992031,0.00014495318,0.00009500386,0.00044942248,0.000014922255,0.000092630435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023321595,0.00018304108,0.00028328272,0.00007612633,0.0001570488,0.0001757918,0.00027760435,0.00004782351,0.0000031998159],"category_scores_gemma":[0.00008429666,0.00017633247,0.000026715354,0.0002812249,0.00011325505,0.00026205427,0.00027379577,0.00013349936,0.000004107217],"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.00035171752,0.00061493396,0.39512965,0.0020175679,0.00033496573,0.0014530547,0.00171797,0.0011106846,0.0037511187,0.37435403,0.063722976,0.15544133],"study_design_scores_gemma":[0.0058936565,0.00006415704,0.40691924,0.0028126559,0.000051534513,0.00014449566,0.0016268655,0.063957475,0.0003483693,0.0009222291,0.5159166,0.0013427412],"about_ca_topic_score_codex":0.00016388098,"about_ca_topic_score_gemma":0.000034881345,"teacher_disagreement_score":0.79248977,"about_ca_system_score_codex":0.00002877446,"about_ca_system_score_gemma":0.000029597053,"threshold_uncertainty_score":0.719063},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002421025,0.00007539957,0.0012327023,0.000550683,0.000010484482,0.00014678242,0.00001601053,0.00027526883,0.9974506],"genre_scores_gemma":[0.0016657328,1.7945436e-7,0.0009804468,0.00013627714,0.00009294626,0.000017968014,0.0000060935367,0.000008903235,0.9970915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988913,0.000034688233,0.00019562762,0.00033420924,0.00023226236,0.00031194635],"domain_scores_gemma":[0.99911547,0.000023946006,0.000029185305,0.00061152515,0.00005018059,0.00016968817],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015566222,0.00012941411,0.00016585267,0.000044148008,0.00008809658,0.00016442074,0.0008215213,0.000050263065,0.89391315],"category_scores_gemma":[0.0000110645815,0.000121756915,0.000056906603,0.00039955162,0.000015983418,0.00026053007,0.000077448385,0.00007155897,0.9781405],"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.0000065664854,0.00003308081,1.6475722e-7,0.0000031922252,0.000006222003,0.0000116497085,0.000022797367,0.00014711247,0.00003142439,0.000085552885,0.23924522,0.76040703],"study_design_scores_gemma":[0.0001544294,0.000067050016,0.00005739914,0.000017857345,0.000001936771,0.000014272545,2.586841e-7,0.0067347223,0.000041771713,0.000018120023,0.99272394,0.00016825802],"about_ca_topic_score_codex":0.000024329074,"about_ca_topic_score_gemma":1.0137023e-7,"teacher_disagreement_score":0.76023877,"about_ca_system_score_codex":0.00002621428,"about_ca_system_score_gemma":0.000029530087,"threshold_uncertainty_score":0.4965103},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023414592,0.00007639197,0.001215313,0.00054428563,0.000010440426,0.00014597995,0.00001600173,0.0002773558,0.9974801],"genre_scores_gemma":[0.0016563869,1.7872063e-7,0.00097502617,0.00013611236,0.000092599315,0.000017920433,0.00000615259,0.000008886641,0.99710673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988924,0.00003468905,0.00019589007,0.0003335615,0.00023196379,0.00031146803],"domain_scores_gemma":[0.9991178,0.000023974631,0.000029148932,0.0006094651,0.000050073482,0.00016955647],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015595913,0.00012920592,0.0001654647,0.00004407381,0.000088014895,0.00016434198,0.00081946264,0.00005019959,0.89386797],"category_scores_gemma":[0.00001108769,0.000121611134,0.000056855737,0.00039913558,0.000015964304,0.00026007293,0.000077195575,0.00007147673,0.97757596],"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.000006555501,0.000033274537,1.6329449e-7,0.0000031909208,0.0000062228314,0.000011838691,0.000022989214,0.00014690084,0.000031888518,0.00008835052,0.23839477,0.76125383],"study_design_scores_gemma":[0.00015414681,0.000067233865,0.00005768658,0.000017824337,0.0000019353529,0.000014515852,2.5353245e-7,0.0067317677,0.00004133894,0.000018505283,0.99272686,0.00016790413],"about_ca_topic_score_codex":0.000023860066,"about_ca_topic_score_gemma":1.0091413e-7,"teacher_disagreement_score":0.761086,"about_ca_system_score_codex":0.0000261764,"about_ca_system_score_gemma":0.000029572702,"threshold_uncertainty_score":0.4959158},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019929976,0.00007386967,0.0012039958,0.00059838657,0.000010277863,0.00014302018,0.000015652415,0.00027009766,0.9974854],"genre_scores_gemma":[0.0015200013,1.7321119e-7,0.00097217446,0.00016728608,0.000078931,0.000017950284,0.000006072818,0.000008923052,0.9972285],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988931,0.00003455558,0.00019515288,0.00033389335,0.00023191024,0.00031142062],"domain_scores_gemma":[0.99911666,0.000023751325,0.000029145007,0.0006111645,0.00005007638,0.00016920794],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015479625,0.00012929634,0.00015982246,0.000044004948,0.00008788745,0.000163983,0.00082097144,0.000050224106,0.8653983],"category_scores_gemma":[0.000010940242,0.00012166415,0.000056825145,0.00037880713,0.000015956322,0.00025628126,0.000077308876,0.00007143881,0.9777756],"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.000005683953,0.000031763586,1.4928206e-7,0.0000027269841,0.00000592822,0.000011305926,0.000021937756,0.0001382993,0.00002983988,0.00007994591,0.22137152,0.7783009],"study_design_scores_gemma":[0.00015346459,0.00006679494,0.000075618445,0.000017738943,0.00000180556,0.000014443996,2.5142438e-7,0.006695757,0.000037116166,0.000018521341,0.9927504,0.00016810934],"about_ca_topic_score_codex":0.00002414812,"about_ca_topic_score_gemma":1.00235084e-7,"teacher_disagreement_score":0.7781328,"about_ca_system_score_codex":0.00002616984,"about_ca_system_score_gemma":0.000029416664,"threshold_uncertainty_score":0.496132},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021685532,0.00007974036,0.0012216138,0.0005872457,0.000010586183,0.00014622229,0.000017493774,0.00028199056,0.99743825],"genre_scores_gemma":[0.0013880433,1.9525002e-7,0.0011245542,0.00013910585,0.00009603217,0.000018081495,0.0000062878485,0.000009173347,0.99721855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889183,0.000034565517,0.00019740463,0.0003347571,0.0002266669,0.00031477166],"domain_scores_gemma":[0.99910045,0.00002344325,0.00002899896,0.000623913,0.000049901024,0.00017331234],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015443345,0.00013055856,0.00016784407,0.000044075365,0.000089354995,0.00016423782,0.0008310593,0.00005201862,0.8902837],"category_scores_gemma":[0.00001004589,0.00012329945,0.000057414036,0.00040493443,0.000016487405,0.00026168436,0.000077340876,0.00007378218,0.97622025],"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.0000064806623,0.000031218387,1.4242092e-7,0.0000031231575,0.0000060375173,0.000010658661,0.000022911225,0.000151243,0.000030272771,0.00008627848,0.22699799,0.77265364],"study_design_scores_gemma":[0.00015078492,0.00006738534,0.000052719868,0.000018126819,0.0000019267954,0.000015857146,2.7618395e-7,0.0066661714,0.00004327939,0.000017970002,0.9927952,0.00017026065],"about_ca_topic_score_codex":0.000024786801,"about_ca_topic_score_gemma":1.1147547e-7,"teacher_disagreement_score":0.7724834,"about_ca_system_score_codex":0.000025791775,"about_ca_system_score_gemma":0.00002892243,"threshold_uncertainty_score":0.5028006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032452866,0.00013958618,0.93452835,0.009779354,0.0036508641,0.0020689163,0.0000903985,0.0001747024,0.046322532],"genre_scores_gemma":[0.9039975,0.000012007614,0.01430617,0.0035307973,0.0001673603,0.0002946139,0.000010665492,0.000016853457,0.07766408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970567,0.000015449259,0.0007065585,0.0010578126,0.00032362287,0.000839832],"domain_scores_gemma":[0.9977196,0.00012918693,0.00014871356,0.0011766206,0.0005210305,0.00030483655],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045570233,0.00037341393,0.00052330265,0.00024846572,0.00034876945,0.001999191,0.0029807494,0.00018336611,0.00008367482],"category_scores_gemma":[0.00013341932,0.00031739584,0.00021994396,0.0019042159,0.00004785405,0.0011495418,0.0012956086,0.00017419185,0.00017729937],"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.00010735818,0.0002222578,0.00092385686,0.00039466083,0.00012600876,0.0000063065486,0.00058174535,0.0012363368,0.0002548726,0.64353037,0.13969383,0.2129224],"study_design_scores_gemma":[0.0016286728,0.00024087807,0.006160203,0.0008498614,0.000026050899,0.0000054480684,0.00021466063,0.38138616,0.0061491504,0.0043090796,0.59830576,0.00072405604],"about_ca_topic_score_codex":0.00013707578,"about_ca_topic_score_gemma":0.00013793675,"teacher_disagreement_score":0.92022216,"about_ca_system_score_codex":0.00014367091,"about_ca_system_score_gemma":0.00037391877,"threshold_uncertainty_score":0.9999278},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54474986,0.0029739616,0.22752427,0.0011517951,0.011955704,0.0038629125,0.000033800414,0.00030710324,0.20744063],"genre_scores_gemma":[0.99482584,0.000016881579,0.0007437834,0.0004177141,0.00042334013,0.00008023671,0.00008445897,0.000042319058,0.0033654454],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486405,0.00062341866,0.0012324424,0.0011665861,0.0011756447,0.0009378348],"domain_scores_gemma":[0.9970835,0.0004747889,0.0006861413,0.0013388201,0.0002753359,0.00014143926],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028634244,0.0007047687,0.000792467,0.00032585376,0.0005683123,0.0015174854,0.00242128,0.0005061297,0.000014352277],"category_scores_gemma":[0.00012256125,0.0005382255,0.00023427996,0.0014030448,0.000053057232,0.00031928497,0.00010906586,0.0013682664,0.0002793028],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003578572,0.0011583405,0.0008672773,0.0052417265,0.0002489463,0.0035435737,0.6022491,0.014019696,0.005356993,0.22103553,0.003919776,0.1420012],"study_design_scores_gemma":[0.0022104883,0.00095641316,0.009064211,0.037730675,0.00009188007,0.0003807754,0.3052939,0.6247124,0.0031295647,0.000026654854,0.013650939,0.002752122],"about_ca_topic_score_codex":0.0018638276,"about_ca_topic_score_gemma":0.00064210844,"teacher_disagreement_score":0.6106927,"about_ca_system_score_codex":0.0004942243,"about_ca_system_score_gemma":0.00025290376,"threshold_uncertainty_score":0.9997069},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18366188,0.0009258445,0.81274706,0.0000935579,0.00062374445,0.0008058779,0.0000140535685,0.00012033583,0.0010076412],"genre_scores_gemma":[0.9818247,0.00014775651,0.015332957,0.000029470944,0.000025081476,0.000047546004,0.00019933857,0.000027690876,0.0023654683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984396,0.000113903465,0.00039893307,0.00046872094,0.00032091004,0.0002579159],"domain_scores_gemma":[0.9989882,0.00005467695,0.00039790513,0.0004088418,0.00008429092,0.000066045686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031548511,0.0002582506,0.00037596578,0.00014451014,0.00011184828,0.00014126193,0.0004383311,0.00017303531,0.0000350814],"category_scores_gemma":[0.000005338858,0.00026134908,0.00006559795,0.00023682012,0.000007010864,0.00023554322,0.00003702113,0.00017071614,0.000010676241],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032307598,0.00015375404,0.000021851887,0.0017492186,0.0003773701,0.000077093835,0.12517977,0.00063526735,0.08109703,0.021263577,0.001226845,0.76789516],"study_design_scores_gemma":[0.008314667,0.0018929339,0.010543466,0.0036874188,0.00048008806,0.00020707875,0.06068837,0.75489384,0.12789418,0.023399413,0.0031503448,0.0048481943],"about_ca_topic_score_codex":0.00053039874,"about_ca_topic_score_gemma":0.00035590347,"teacher_disagreement_score":0.7981628,"about_ca_system_score_codex":0.00006137849,"about_ca_system_score_gemma":0.00016314667,"threshold_uncertainty_score":0.99998385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970566,0.022500444,0.2514722,0.009973456,0.07672298,0.008379354,0.0033563045,0.002058525,0.028480094],"genre_scores_gemma":[0.95432764,0.0008472703,0.010219994,0.0001002245,0.0009872849,0.00017805464,0.0009159088,0.00018001997,0.032243606],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930605,0.000643252,0.0014763608,0.0017349684,0.0017832118,0.0013016651],"domain_scores_gemma":[0.9912107,0.002543445,0.0020066283,0.0028720482,0.0009478978,0.000419257],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012601172,0.0010356616,0.0015243215,0.000120495635,0.0014263934,0.0011299265,0.0033029204,0.00064936467,0.00014579855],"category_scores_gemma":[0.0008424053,0.0008817686,0.0006199635,0.0018295245,0.00078327744,0.00033765638,0.00046792926,0.0010149726,0.0006083081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.002519056,0.0035914548,0.0010784828,0.0050710435,0.0061350046,0.0016285592,0.47288382,0.003135404,0.024621854,0.19696149,0.082727864,0.19964597],"study_design_scores_gemma":[0.008526793,0.001796718,0.08845288,0.0075350227,0.0008736878,0.00006142856,0.14278871,0.6313127,0.030822268,0.039261363,0.04151967,0.0070487484],"about_ca_topic_score_codex":0.022508707,"about_ca_topic_score_gemma":0.0070517226,"teacher_disagreement_score":0.6281773,"about_ca_system_score_codex":0.00031038502,"about_ca_system_score_gemma":0.0013489607,"threshold_uncertainty_score":0.999907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2702618,0.00027976857,0.72160226,0.0002532698,0.0048103565,0.0023019179,0.00022361905,0.00003081167,0.00023619404],"genre_scores_gemma":[0.99553156,0.000020632204,0.0006075843,0.00002224883,0.00018265238,0.00018593608,0.00021508354,0.000047981204,0.0031863512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529105,0.0004007666,0.0015647453,0.0009430931,0.0013780366,0.00042228948],"domain_scores_gemma":[0.99526846,0.00026674563,0.0016097592,0.0009981572,0.0017308054,0.00012607491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074446754,0.0005435801,0.0009993215,0.00023137996,0.0005572293,0.00008544771,0.0012705218,0.0002748796,0.00015724584],"category_scores_gemma":[0.00009257454,0.00046701138,0.0007427026,0.00073356467,0.00017761957,0.00030127357,0.00003466969,0.00045630772,0.000005520591],"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.00312367,0.01698353,0.00019715381,0.0070469263,0.0038612399,0.000028203534,0.14382374,0.5399657,0.04990656,0.009709923,0.0033021753,0.22205119],"study_design_scores_gemma":[0.012138578,0.0038289288,0.019420164,0.002935681,0.002105349,0.0002839738,0.057134565,0.8741813,0.022905553,0.0012858845,0.0017300943,0.0020499607],"about_ca_topic_score_codex":0.00037576104,"about_ca_topic_score_gemma":0.00030789364,"teacher_disagreement_score":0.72526973,"about_ca_system_score_codex":0.00011450855,"about_ca_system_score_gemma":0.00074578996,"threshold_uncertainty_score":0.99977815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16385972,0.05654291,0.73383605,0.0024255302,0.005708437,0.007610436,0.0003127802,0.00024222468,0.029461915],"genre_scores_gemma":[0.7207152,0.0126281595,0.07813175,0.00077158253,0.00078302313,0.0035421085,0.008154998,0.00017477616,0.17509837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963616,0.00010388973,0.00069497694,0.0019277683,0.00039562865,0.0005161199],"domain_scores_gemma":[0.9967683,0.00013025684,0.00048694215,0.0022145978,0.0002560872,0.00014382967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007545674,0.00043842552,0.0005860743,0.00020616235,0.00023584723,0.00041819035,0.0006701981,0.00018539406,0.000029807059],"category_scores_gemma":[0.00010804734,0.00050429476,0.000117100244,0.0008189491,0.000043054904,0.00039726315,0.0002318186,0.0002517137,0.000018508264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027314728,0.00066503405,0.0007425144,0.0071902424,0.00027129563,0.00020679846,0.019632911,0.00035201677,0.0012737655,0.055842344,0.01111715,0.9024328],"study_design_scores_gemma":[0.010866634,0.0005336402,0.11179889,0.034523614,0.0006345171,0.00013523734,0.10998332,0.1806387,0.010643445,0.0011066847,0.53298753,0.0061477954],"about_ca_topic_score_codex":0.0003364815,"about_ca_topic_score_gemma":0.00043302355,"teacher_disagreement_score":0.896285,"about_ca_system_score_codex":0.000107789485,"about_ca_system_score_gemma":0.00013596159,"threshold_uncertainty_score":0.99974084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40556353,0.0063445335,0.4345694,0.04850583,0.0030603963,0.001766763,0.00024181274,0.00047437267,0.09947337],"genre_scores_gemma":[0.98082465,0.00044308364,0.002731456,0.000046830977,0.000044003693,6.2863614e-7,0.000004717298,0.000009171127,0.015895471],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747133,0.00017298464,0.00016315497,0.0005954995,0.0010473133,0.0005497088],"domain_scores_gemma":[0.9964257,0.00008630059,0.0002575977,0.002210651,0.00074720907,0.0002725241],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012412553,0.00013272335,0.00031806377,0.00020948163,0.0017982799,0.00082603394,0.0049302094,0.00012546075,0.00007361324],"category_scores_gemma":[0.00011270885,0.00016646953,0.0001554159,0.00032197332,0.00071832526,0.0032503568,0.001419906,0.00035711093,0.00057318294],"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.00013392749,0.00055349874,0.005448787,0.0003015737,0.00016900344,0.0013104868,0.006952345,0.000012043711,0.00161968,0.05827274,0.49710712,0.4281188],"study_design_scores_gemma":[0.0015464035,0.00024702522,0.040354766,0.00042301495,0.000012045253,0.000052032752,0.004645867,0.018156895,0.0004720321,0.0038080516,0.92976093,0.00052091863],"about_ca_topic_score_codex":0.0033412331,"about_ca_topic_score_gemma":0.00040382435,"teacher_disagreement_score":0.5752611,"about_ca_system_score_codex":0.00015615638,"about_ca_system_score_gemma":0.00025999258,"threshold_uncertainty_score":0.9995012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57488483,0.0013243919,0.35319695,0.024015622,0.0051336647,0.00053359143,0.000011509317,0.0007055403,0.0401939],"genre_scores_gemma":[0.9941782,0.000020652742,0.0054072174,0.00007071323,0.0000074128175,0.0000068344557,2.1795626e-7,7.698769e-7,0.0003080038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907494,0.0000036688416,0.00019585596,0.00031784902,0.00019739814,0.00021029497],"domain_scores_gemma":[0.9991131,0.000009751692,0.000069461596,0.00046744902,0.0003053096,0.00003495633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044339767,0.000074287476,0.00014849787,0.00056760607,0.00024124801,0.00006047429,0.0012474884,0.00010681233,6.963575e-7],"category_scores_gemma":[0.00022907222,0.00006490683,0.000012953662,0.0042466223,0.0026503548,0.0006843774,0.00039857294,0.00011533716,0.000004258556],"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":[7.9768154e-7,0.000017230417,0.0012737549,0.000009697535,0.0000035221492,0.000003981516,0.000017675593,0.0000040492337,0.005754934,0.91023326,0.00083888805,0.0818422],"study_design_scores_gemma":[0.0014938996,0.00019534823,0.008191042,0.00033160148,0.000018667806,0.000083695144,0.00025616537,0.009500931,0.120151415,0.10159659,0.7577173,0.00046333513],"about_ca_topic_score_codex":0.000019158886,"about_ca_topic_score_gemma":0.0000047739613,"teacher_disagreement_score":0.80863667,"about_ca_system_score_codex":0.000027364515,"about_ca_system_score_gemma":0.00046086087,"threshold_uncertainty_score":0.97653425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28651848,0.0007862302,0.71039,0.00005041268,0.0010984371,0.00032744135,0.00002877661,0.0002376887,0.0005625261],"genre_scores_gemma":[0.9824619,0.0000018567781,0.01700109,0.00004457267,0.00034029348,0.000016002197,0.000017235077,0.00001908322,0.000097942735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00011657795,0.0004452957,0.0004015065,0.00046285483,0.00039136357],"domain_scores_gemma":[0.99843055,0.000046057005,0.00030843198,0.0007658191,0.0002658411,0.00018329972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002272662,0.0002692677,0.00046941423,0.00011760107,0.00009625804,0.00024402114,0.00083261455,0.00011337734,0.0000025967447],"category_scores_gemma":[0.0000086928185,0.0001955175,0.00007705065,0.0004966959,0.000069847505,0.00050976657,0.00026720006,0.00015579519,0.000012657509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022113844,0.00040358835,0.04952598,0.002011343,0.0011898669,0.0009841628,0.03168945,0.1906818,0.0019290759,0.6169848,0.06348283,0.040895976],"study_design_scores_gemma":[0.008208623,0.0019378206,0.08926823,0.0014137478,0.00018505585,0.0078054853,0.0036327194,0.85189337,0.0030077735,0.0032146408,0.026488187,0.0029443586],"about_ca_topic_score_codex":0.00069549895,"about_ca_topic_score_gemma":0.00009254974,"teacher_disagreement_score":0.6959434,"about_ca_system_score_codex":0.000054959204,"about_ca_system_score_gemma":0.00010902987,"threshold_uncertainty_score":0.7972972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005237282,0.00049577304,0.69403315,0.000092755254,0.00028406555,0.009664489,0.0005745326,0.00015499917,0.294695],"genre_scores_gemma":[0.42039144,0.011929777,0.21457085,0.007494167,0.0026108804,0.20530564,0.01527917,0.00031746784,0.12210062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977807,0.000024358545,0.0010940216,0.00035662905,0.0004665557,0.00027775648],"domain_scores_gemma":[0.9977887,0.00012710391,0.0007393789,0.00088080514,0.00038426564,0.00007973714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055094925,0.00029995205,0.000629349,0.00037090207,0.0001380956,0.00015597894,0.00085752987,0.00026634434,0.000030236648],"category_scores_gemma":[0.00007715724,0.0002924112,0.00030652966,0.00033251144,0.00007757081,0.0047705206,0.00012594464,0.00031848572,0.000058238125],"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.000074009724,0.00007417502,0.0005768863,0.001054944,0.00019696934,0.000005980651,0.00334051,0.0068412297,1.16797075e-7,0.88244253,0.0052859792,0.10010665],"study_design_scores_gemma":[0.0004152684,0.000043890162,0.0001557407,0.00009369239,0.0000144689475,0.000004035963,0.000008197003,0.022730114,0.000005187556,0.027570466,0.9486272,0.00033178896],"about_ca_topic_score_codex":0.000011615211,"about_ca_topic_score_gemma":0.000085032065,"teacher_disagreement_score":0.9433412,"about_ca_system_score_codex":0.00017330375,"about_ca_system_score_gemma":0.000110178255,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20581645,0.0007032392,0.7903688,0.000788337,0.00023810299,0.00014476833,0.00015026153,0.000057033452,0.0017330144],"genre_scores_gemma":[0.99817073,0.00013632985,0.0013117457,0.00005525265,0.000071016475,0.000007803832,0.00020076218,0.000004778965,0.00004156958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854624,0.00006169925,0.00045191395,0.00044911937,0.00020213165,0.00028887324],"domain_scores_gemma":[0.9991929,0.0001338027,0.00019669923,0.00017599863,0.00021565203,0.00008498304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022594261,0.00020268519,0.00032381748,0.00007202759,0.000118174125,0.00021088879,0.0002875152,0.0001067101,0.000003768974],"category_scores_gemma":[0.000029904684,0.00018652923,0.000030544543,0.0002542038,0.00013445776,0.00015469977,0.00017327102,0.00021164106,8.226993e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116529365,0.000339195,0.062875494,0.000046519304,0.00006128718,0.000064012536,0.00024702845,0.05315005,0.00014431293,0.8617186,0.0011582945,0.02007868],"study_design_scores_gemma":[0.0011508905,0.00006652126,0.08132731,0.00024930254,0.0000043424,0.000040247098,0.000058136895,0.91235334,0.000009693984,0.004012514,0.0005117629,0.00021591304],"about_ca_topic_score_codex":0.00030675664,"about_ca_topic_score_gemma":0.000078353936,"teacher_disagreement_score":0.85920334,"about_ca_system_score_codex":0.000022406015,"about_ca_system_score_gemma":0.00003380443,"threshold_uncertainty_score":0.76064414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099433986,0.0021287645,0.99005973,0.00038927438,0.0024241984,0.00031585072,0.00001553184,0.00017901759,0.004388171],"genre_scores_gemma":[0.63746226,0.000058185342,0.36113563,0.0007509034,0.00027096632,0.000014033506,0.000018085062,0.000040448605,0.00024951206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956797,0.000061631465,0.00075860054,0.0014533007,0.001052511,0.0009942695],"domain_scores_gemma":[0.9977084,0.00055154436,0.00033628274,0.0010287656,0.0002014343,0.0001736061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011726681,0.0005739785,0.00068306265,0.0006053185,0.00040264236,0.00041204426,0.0022854963,0.000398428,0.00005672705],"category_scores_gemma":[0.000087185545,0.00057717843,0.00017351023,0.00072207034,0.0005444661,0.0016309976,0.00051663414,0.0012403348,0.000045010085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014484435,0.00006313652,0.00021329285,0.000114813185,0.000025651621,0.00032667076,0.0047048447,0.0980857,0.00014307826,0.02511803,0.000016201177,0.8711741],"study_design_scores_gemma":[0.0011452389,0.00015985423,0.0006159577,0.0032225626,0.000018714463,0.00048478896,0.00001001256,0.91768306,0.00015809915,0.07085883,0.0037929676,0.0018499155],"about_ca_topic_score_codex":0.000108510714,"about_ca_topic_score_gemma":0.0001644043,"teacher_disagreement_score":0.8693242,"about_ca_system_score_codex":0.0007457281,"about_ca_system_score_gemma":0.00068567763,"threshold_uncertainty_score":0.99966794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020941375,0.00081904535,0.9925227,0.00027357953,0.0019848384,0.0006626459,0.00006651222,0.000132749,0.003328493],"genre_scores_gemma":[0.96336514,0.000021066862,0.034874048,0.00022853563,0.00027928766,0.00002272451,0.000043369593,0.00003724383,0.0011285793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608475,0.00005410086,0.001037031,0.0011886758,0.0010877454,0.0005477076],"domain_scores_gemma":[0.9967855,0.00043131612,0.0007836774,0.0013178245,0.000518638,0.00016303854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000696766,0.0004889881,0.00074510573,0.00048398474,0.00022940195,0.0005728436,0.002213686,0.00038616586,0.000023198094],"category_scores_gemma":[0.00006193984,0.0004472045,0.0001417252,0.0005947457,0.000335834,0.0010877434,0.00045358043,0.00056715944,0.000090485235],"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.000003227219,0.000043657714,0.000042567597,0.000118455406,0.000023254095,0.000013813899,0.0010059592,0.83694583,0.0012937641,0.019808294,0.00014899638,0.14055216],"study_design_scores_gemma":[0.0002005983,0.00007145393,0.00007773424,0.0007888356,0.0000069434927,0.000016420023,3.852747e-7,0.9854919,0.0002543169,0.0032495724,0.009370276,0.000471569],"about_ca_topic_score_codex":0.00009929361,"about_ca_topic_score_gemma":0.000009765208,"teacher_disagreement_score":0.96315575,"about_ca_system_score_codex":0.00025051873,"about_ca_system_score_gemma":0.00026511442,"threshold_uncertainty_score":0.999798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011684248,0.0007520731,0.9835125,0.0010178023,0.003317014,0.00047333335,0.00001800668,0.00030607905,0.010486302],"genre_scores_gemma":[0.7818807,0.00005333892,0.209724,0.0020954055,0.0017110261,0.000029956393,0.000021255479,0.000104819606,0.004379547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410224,0.000063915635,0.00079669297,0.0023329537,0.0016110257,0.0010931665],"domain_scores_gemma":[0.99577934,0.0004385812,0.0004906938,0.0026048243,0.000348636,0.0003379569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001234221,0.0008328947,0.0009380362,0.0007362817,0.00034943392,0.0010000825,0.005206465,0.00046292265,0.00002831349],"category_scores_gemma":[0.00010490904,0.00072814425,0.00026945063,0.0008846192,0.0008094431,0.00029637924,0.0014241949,0.0008995168,0.0003030166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008306346,0.000069226604,0.00006189677,0.00007904198,0.00002427482,0.00016196846,0.0008396665,0.27520776,0.00016469539,0.1881164,0.00049681833,0.53476995],"study_design_scores_gemma":[0.00048024947,0.00021806417,0.00023353798,0.00087352324,0.000010201756,0.000102418526,2.3832824e-7,0.92461264,0.00044399028,0.022342982,0.04948045,0.0012017258],"about_ca_topic_score_codex":0.00004244146,"about_ca_topic_score_gemma":0.00015947301,"teacher_disagreement_score":0.7817638,"about_ca_system_score_codex":0.00036390248,"about_ca_system_score_gemma":0.0004863301,"threshold_uncertainty_score":0.99951696},"labels":[],"label_agreement":null}]}