{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":73,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":73,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"66da2a6e6827","filters":{"venue":"Distributed Computing"}},"results":[{"id":"W2123429492","doi":"10.1007/s00446-007-0040-2","title":"The computational power of population protocols","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":272,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Multiset; Communication source; Theory of computation; Theoretical computer science; Population; Predicate (mathematical logic); Computation; State (computer science); Computer network; Discrete mathematics; Mathematics; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01301871282599473,"gpt":0.2926498428743762,"spread":0.2796311300483815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267094,0.0001318681,0.0001836601,0.00004435397,0.0003898634,0.0001750698,0.000827454,0.00006035689,0.000001649331],"category_scores_gemma":[0.00009262704,0.0001012922,0.00008755139,0.0006541482,0.0000502647,0.0001692224,0.0001296233,0.0001327548,0.000007691612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006043773,"about_ca_system_score_gemma":0.00003672708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003153499,"about_ca_topic_score_gemma":0.000003650719,"domain_scores_codex":[0.9982085,0.00006177539,0.0006469056,0.0002648699,0.0004472832,0.000370641],"domain_scores_gemma":[0.9983837,0.0004002952,0.0003854322,0.0004502683,0.0003050618,0.00007526307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005473757,0.000267071,0.04318874,0.00006713584,0.00008767055,0.00002588793,0.0007121328,0.07189802,0.0004323566,0.7518101,0.003082318,0.1283738],"study_design_scores_gemma":[0.0008236195,0.0001153425,0.4656373,0.0001790201,0.000004328559,0.00003512761,0.0001644194,0.5105296,0.000617619,0.007170006,0.01437641,0.0003472102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02742673,0.00004139248,0.9700186,0.0001648796,0.0002190991,0.001528798,0.00003493496,0.0001358986,0.0004296783],"genre_scores_gemma":[0.9917646,1.577006e-7,0.008006996,0.00003638189,0.00004418573,0.00003733603,0.00009824424,0.000006040924,0.000006034867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9643379,"threshold_uncertainty_score":0.4130577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038924034","doi":"10.1007/s00446-003-0091-y","title":"Hundreds of impossibility results for distributed computing","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Impossibility; Variety (cybernetics); Distributed computing; Theory of computation; Theoretical computer science; Resource (disambiguation); Fault tolerance; Resource allocation; Algorithm; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02072866808562297,"gpt":0.2763131975748732,"spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002346419,0.000462003,0.0008568477,0.0001186463,0.0005399209,0.0002857147,0.001537892,0.00023365,0.00000255014],"category_scores_gemma":[0.001192744,0.0004756514,0.0003956437,0.001562261,0.0001426161,0.0003372133,0.0002507809,0.0003156462,0.000007963256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002032465,"about_ca_system_score_gemma":0.0002426369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004339594,"about_ca_topic_score_gemma":0.000004831496,"domain_scores_codex":[0.9951001,0.0003171561,0.00179535,0.001173726,0.0005426154,0.001071089],"domain_scores_gemma":[0.9954721,0.0008823109,0.001028574,0.001505017,0.0008324793,0.0002794753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005797469,0.003291491,0.03457547,0.001783901,0.0009596645,0.0001154636,0.003914486,0.1165141,0.01169766,0.6792864,0.03321145,0.1140702],"study_design_scores_gemma":[0.007730723,0.0005230135,0.020863,0.0005422675,0.00006716172,0.0001006093,0.0005135322,0.9099503,0.01938593,0.005468548,0.0332696,0.001585331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0701034,0.0002415541,0.9239806,0.0001582736,0.0008600277,0.0007113399,0.00279796,0.0004190751,0.0007277523],"genre_scores_gemma":[0.9647329,0.000001983497,0.03399343,0.00005056236,0.0001029492,0.00001033947,0.001072342,0.00002264625,0.00001283572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8946295,"threshold_uncertainty_score":0.9997695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069239201","doi":"10.1007/s446-002-8028-1","title":"Deterministic broadcasting in ad hoc radio networks","year":2002,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Broadcasting (networking); Computer science; Computer network; Node (physics); Wireless ad hoc network; Acknowledgement; Collision; Network topology; Block (permutation group theory); Collision detection; Mobile ad hoc network; Unicast; Distributed computing; Topology (electrical circuits); Theoretical computer science; Telecommunications; Mathematics; Computer security; Wireless; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.01824020398321956,"gpt":0.2265913010055592,"spread":0.2083510970223397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004501525,0.0002966829,0.0003669275,0.0001189967,0.0002445475,0.0003384709,0.001369715,0.0001476153,0.00003395479],"category_scores_gemma":[0.0001240702,0.0003315093,0.0001014667,0.001405969,0.00005564488,0.0002663811,0.000456397,0.0005549071,0.00005636154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001739228,"about_ca_system_score_gemma":0.00002060183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006697932,"about_ca_topic_score_gemma":0.000006686618,"domain_scores_codex":[0.9972144,0.0001685185,0.0006278629,0.0007289439,0.0002897019,0.0009705151],"domain_scores_gemma":[0.998195,0.0005157088,0.0002333102,0.0008024945,0.00006673126,0.0001867679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004272357,0.0001217663,0.004127119,0.00001785871,0.00001739625,0.0004395492,0.0004357012,0.3723145,0.00002507735,0.002102613,0.002227434,0.6181667],"study_design_scores_gemma":[0.0005184116,0.00005767775,0.005192597,0.0001313068,0.000005123512,0.00009340924,0.00001786817,0.9914877,0.00001222277,0.0001378047,0.001997197,0.0003487045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0293706,0.001958009,0.9664992,0.000133087,0.0006376585,0.0002248878,0.000004854851,0.0004634301,0.0007082497],"genre_scores_gemma":[0.986253,0.00004016751,0.01323026,0.0001732844,0.0002234402,0.00001017732,0.00002560714,0.00002261321,0.00002146812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9568824,"threshold_uncertainty_score":0.9999137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2667052534","doi":"10.1007/s00446-005-0126-7","title":"Broadcasting in undirected ad hoc radio networks","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Binary logarithm; Upper and lower bounds; Radio networks; Omega; Combinatorics; Logarithm; RADIUS; Log-log plot; Node (physics); Mathematics; Discrete mathematics; Computer science; Topology (electrical circuits); Computer network; Telecommunications; Physics; Wireless network","retraction":null,"screen_n_in":null,"score":{"opus":0.01055025266061116,"gpt":0.2309611542078272,"spread":0.2204109015472161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006440566,0.0002966346,0.0003642182,0.000135994,0.000228372,0.0003028955,0.001316257,0.0001628264,0.00001750034],"category_scores_gemma":[0.0000929114,0.0003306158,0.00009936099,0.001871024,0.00004404316,0.0003915566,0.000461747,0.0006083593,0.00003968588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003181608,"about_ca_system_score_gemma":0.00006740359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001571717,"about_ca_topic_score_gemma":0.00003755265,"domain_scores_codex":[0.9971569,0.000191028,0.0006346858,0.0007297429,0.000300781,0.0009868474],"domain_scores_gemma":[0.9983385,0.0004067802,0.0002354363,0.0007401378,0.0000958654,0.0001833197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005685383,0.00006855497,0.002687123,0.00000539019,0.00001439015,0.00005045407,0.0002026333,0.5636765,0.00004281931,0.001903204,0.00140255,0.4299407],"study_design_scores_gemma":[0.0006123231,0.0000308214,0.01293927,0.000114842,0.000004422171,0.00004213777,0.00001794883,0.9778243,0.00007412168,0.0000881146,0.007904756,0.0003469244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05335906,0.001946977,0.9422755,0.0003649344,0.0004528478,0.0002373486,0.000004680069,0.0007578149,0.0006008605],"genre_scores_gemma":[0.958159,0.00003053924,0.04104399,0.0002277625,0.0004158669,0.000008733304,0.00007236127,0.00002323105,0.00001847501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9048,"threshold_uncertainty_score":0.9999146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051628581","doi":"10.1007/s00446-006-0007-8","title":"Optimal Deterministic Broadcasting in Known Topology Radio Networks","year":2006,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Binary logarithm; Broadcasting (networking); Radio networks; Scheme (mathematics); Node (physics); Mathematics; Discrete mathematics; Graph; Time complexity; Combinatorics; Topology (electrical circuits); Computer science; Algorithm; Computer network; Telecommunications; Wireless network; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.008946229700157711,"gpt":0.2331893582974499,"spread":0.2242431285972922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005045452,0.0002910772,0.0003941824,0.000122617,0.0002404005,0.0002538971,0.001184956,0.0001831693,0.0000126887],"category_scores_gemma":[0.00006626553,0.0003256251,0.0000968609,0.001033682,0.00009221653,0.0001957992,0.0004991091,0.0004995351,0.0000179728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001785914,"about_ca_system_score_gemma":0.00006764897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001494608,"about_ca_topic_score_gemma":0.00003206961,"domain_scores_codex":[0.997155,0.0001896915,0.0006933087,0.000723224,0.0002114059,0.001027392],"domain_scores_gemma":[0.9983964,0.0005409358,0.0002424986,0.000637137,0.00007370741,0.0001093285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005359635,0.0000713549,0.008630696,0.000007831039,0.000007190398,0.0002700729,0.00005287826,0.9397498,0.00003468039,0.0146795,0.0008861814,0.03560446],"study_design_scores_gemma":[0.0005027802,0.00005635967,0.01872953,0.00006218703,0.000005504563,0.0001342372,0.00001408247,0.9787828,0.00004476993,0.00040187,0.0009413497,0.000324527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039132,0.0003505936,0.893603,0.0001002959,0.0006577318,0.0001874291,0.000004814622,0.000355981,0.0008269847],"genre_scores_gemma":[0.9701331,0.000002439115,0.02908119,0.00008153415,0.0005731522,0.00001020216,0.00008130982,0.00001956332,0.0000175081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8662199,"threshold_uncertainty_score":0.9999196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984719907","doi":"10.1007/s00446-006-0154-y","title":"Searching for a black hole in arbitrary networks: optimal mobile agents protocols","year":2006,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Node (physics); Ignorance; Computer science; Mathematical proof; Upper and lower bounds; Protocol (science); Topology (electrical circuits); Flexibility (engineering); Degree (music); Constructive; Mathematics; Computer network; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02511181324543472,"gpt":0.3120113948574338,"spread":0.2868995816119991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068446,0.0001693568,0.0002118744,0.0001242952,0.0002127669,0.0004404158,0.0007874536,0.00007565095,0.000005696114],"category_scores_gemma":[0.00003331737,0.0001775384,0.00008651515,0.000773529,0.0000477693,0.000315948,0.0002632925,0.0002652817,0.000008576883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008846001,"about_ca_system_score_gemma":0.00008774924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003923658,"about_ca_topic_score_gemma":0.000003575963,"domain_scores_codex":[0.9980365,0.0001256601,0.0004307605,0.0004713197,0.0002545684,0.0006811789],"domain_scores_gemma":[0.9991409,0.000181176,0.0001200235,0.0003477407,0.0001114417,0.00009875417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008784551,0.0001474263,0.0009739586,0.00003392355,0.00000530689,0.00001118204,0.0001683371,0.9849128,0.00003175967,0.008067607,0.0009016587,0.004737279],"study_design_scores_gemma":[0.0009270316,0.00009386793,0.001333949,0.0001098051,0.000001166569,0.000001752215,0.00003311459,0.9940535,0.0001372622,0.0006859876,0.002426452,0.0001961037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923591,0.0000192458,0.9724547,0.0001259404,0.00005364388,0.007478134,0.00001604434,0.0002337948,0.0003825811],"genre_scores_gemma":[0.8802769,0.000001153948,0.1173456,0.0001389187,0.0001431681,0.00177121,0.0002711594,0.000019581,0.00003226253],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.861041,"threshold_uncertainty_score":0.7239804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972775782","doi":"10.1007/s00446-011-0141-9","title":"How to meet when you forget: log-space rendezvous in arbitrary graphs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Binary logarithm; Computer science; Upper and lower bounds; Graph; Combinatorics; Matching (statistics); Discrete mathematics; Node (physics); Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03537092847980609,"gpt":0.2406513227041873,"spread":0.2052803942243812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617027,0.0002004084,0.00023238,0.0002593795,0.0001532676,0.0002850758,0.001143708,0.00008891807,0.000006806449],"category_scores_gemma":[0.0001094033,0.0002034379,0.00007512331,0.001137607,0.0000352286,0.0004051659,0.0004226143,0.0002003515,0.00001087049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006439949,"about_ca_system_score_gemma":0.00006771616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007866191,"about_ca_topic_score_gemma":0.00003955699,"domain_scores_codex":[0.9980858,0.0001304448,0.0002898492,0.000556711,0.0003027103,0.000634497],"domain_scores_gemma":[0.9988629,0.00006762162,0.0001060209,0.0005855592,0.0001297746,0.0002481019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005789202,0.0007456832,0.03668425,0.00009790109,0.0001039995,0.0003819234,0.02267364,0.0202812,0.0008151094,0.8465513,0.02365459,0.04795251],"study_design_scores_gemma":[0.001467893,0.0003615454,0.0140496,0.0001846331,0.000008803246,0.00004071819,0.0006371241,0.908446,0.003331227,0.06328729,0.007129476,0.001055754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046853,0.00006147606,0.9830145,0.002676431,0.0002296129,0.000307341,0.00002184628,0.000341751,0.002878531],"genre_scores_gemma":[0.8391864,0.000003364142,0.1602095,0.000448054,0.0000268747,0.000009272001,0.0000355004,0.0000139638,0.0000670857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8881648,"threshold_uncertainty_score":0.8295956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078130991","doi":"10.1007/s00446-014-0220-9","title":"Forming sequences of geometric patterns with oblivious mobile robots","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Computer science; Simple (philosophy); Series (stratigraphy); Mobile robot; Orientation (vector space); Theoretical computer science; Theory of computation; Distributed computing; Artificial intelligence; Algorithm; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01243097375740878,"gpt":0.2426073737867117,"spread":0.2301764000293029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004359291,0.0001297796,0.0002067569,0.0001983512,0.0001553873,0.0001405303,0.0007150595,0.00004269465,0.000009520794],"category_scores_gemma":[0.0000530751,0.0001077708,0.00004496001,0.001294955,0.00004005414,0.0002600921,0.000185505,0.0001256396,0.000006740692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003418219,"about_ca_system_score_gemma":0.00004810598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004401472,"about_ca_topic_score_gemma":0.00000314029,"domain_scores_codex":[0.998621,0.00008062833,0.0002877124,0.000305811,0.000348129,0.0003567202],"domain_scores_gemma":[0.9988963,0.0002116582,0.0002014726,0.0003690815,0.0002201137,0.0001013656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003362621,0.0000981594,0.02372041,0.00007525365,0.00002309747,0.000006919071,0.0004117309,0.8573546,0.0002961677,0.005674541,0.00005605021,0.1122797],"study_design_scores_gemma":[0.0003662229,0.0002935193,0.004105759,0.00009492207,0.000004471084,0.00001655145,0.00006716981,0.9916887,0.002883217,0.0001227266,0.0001719909,0.0001847629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360677,0.00004023705,0.8633026,0.00005060884,0.00006506829,0.0001427786,0.00001007705,0.0001505325,0.0001703361],"genre_scores_gemma":[0.9597098,0.000005101317,0.04015734,0.0000506321,0.00002587805,0.000006150502,0.00003171774,0.000007462374,0.000005916609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8236421,"threshold_uncertainty_score":0.4394765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050846431","doi":"10.1007/s00446-012-0168-6","title":"A framework for automated distributed implementation of component-based models","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Distributed computing; Asynchronous communication; Synchronizing; Component (thermodynamics); Implementation; POSIX Threads; Scheduling (production processes); Software deployment; Partition (number theory); Correctness; Distributed algorithm; Programming language; Thread (computing); Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03403358076798483,"gpt":0.326526578156011,"spread":0.2924929973880261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745727,0.0003257797,0.0005268579,0.0001140934,0.0002913502,0.0001537289,0.0009540268,0.0001712526,0.000006444982],"category_scores_gemma":[0.00007134611,0.0003341535,0.0002381883,0.0009781207,0.00005504428,0.0005919776,0.0001515166,0.0001773976,0.000006523425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532931,"about_ca_system_score_gemma":0.0001206335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007768668,"about_ca_topic_score_gemma":0.000001522634,"domain_scores_codex":[0.9970962,0.0001340678,0.0009247634,0.0004588895,0.0004455534,0.0009404991],"domain_scores_gemma":[0.997484,0.0004579484,0.0006688433,0.0007282303,0.0004125335,0.0002483961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006517652,0.0009544241,0.01563434,0.0004867624,0.000270036,0.000005401835,0.001180691,0.1787128,0.002292069,0.7693945,0.009006813,0.02199697],"study_design_scores_gemma":[0.001182893,0.0000782453,0.009052184,0.0001523773,0.00002763009,0.000005865738,0.0002471679,0.9819377,0.003654349,0.002154707,0.001133266,0.0003735814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03640945,0.000175838,0.9583027,0.0002482486,0.0006280371,0.0006810318,0.002543866,0.0009861721,0.00002469239],"genre_scores_gemma":[0.8769027,8.277548e-7,0.1205926,0.00008505661,0.0001128269,0.00004525926,0.002239901,0.00002026837,5.267534e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8404933,"threshold_uncertainty_score":0.9999111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067397086","doi":"10.1007/s00446-007-0042-0","title":"Anonymous and fault-tolerant shared-memory computing","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Identifier; Asynchronous communication; Object (grammar); Distributed computing; Shared memory; Theoretical computer science; Theory of computation; Parallel computing; Programming language; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01069697413433289,"gpt":0.2478945046766815,"spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001469711,0.0004220148,0.0005309588,0.0001550097,0.0006802311,0.0006677269,0.001181139,0.0001852724,0.000006484075],"category_scores_gemma":[0.00009070554,0.0004271433,0.0001323113,0.00101318,0.0001055226,0.0004371368,0.0005847425,0.0004396086,0.00004120814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238267,"about_ca_system_score_gemma":0.00006818712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008675518,"about_ca_topic_score_gemma":0.00001118316,"domain_scores_codex":[0.9963823,0.00009315432,0.0008939746,0.0009682222,0.0005291745,0.001133154],"domain_scores_gemma":[0.997834,0.0003490105,0.000372009,0.0007990343,0.0002647006,0.0003812913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006265619,0.0005363065,0.02399076,0.0003614804,0.0002288665,0.001446018,0.005230121,0.0173689,0.005201877,0.04775634,0.007355185,0.8904615],"study_design_scores_gemma":[0.001643095,0.0001192678,0.07002632,0.0003556416,0.00001857705,0.0005084412,0.0006129013,0.9139845,0.001429731,0.0003391306,0.009898175,0.001064258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2057257,0.0006058962,0.7904406,0.0002037638,0.0006505979,0.0002460556,0.00008548668,0.0006503998,0.001391534],"genre_scores_gemma":[0.9837412,0.000003500922,0.01543046,0.0003228323,0.000304431,0.00000164955,0.0001453373,0.0000245368,0.00002604052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8966156,"threshold_uncertainty_score":0.999818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975011672","doi":"10.1007/s00446-008-0076-y","title":"Distributed computing with advice: information sensitivity of graph coloring","year":2009,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Computer science; Graph; Computation; Graph coloring; Sensitivity (control systems); Theoretical computer science; Greedy coloring; Algorithm; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.009462218466195972,"gpt":0.2377085951874492,"spread":0.2282463767212533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622462,0.0002313378,0.0003352636,0.0001881167,0.0003566495,0.000279331,0.0004898999,0.00008597296,0.000002604914],"category_scores_gemma":[0.0001375222,0.0002179544,0.00008126787,0.001745491,0.0000656485,0.001004656,0.0001750744,0.0002835329,0.00000750587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008520168,"about_ca_system_score_gemma":0.0001032538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003715789,"about_ca_topic_score_gemma":0.000002658819,"domain_scores_codex":[0.9978561,0.0001984242,0.0005915082,0.0003167919,0.00050759,0.0005295643],"domain_scores_gemma":[0.9980598,0.0002543139,0.0004509816,0.0004558578,0.0006167829,0.000162238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000458865,0.0002192946,0.006262247,0.00008441276,0.00006434543,0.00003150735,0.001355886,0.8822149,0.0007374836,0.03549226,0.0005596156,0.07293217],"study_design_scores_gemma":[0.0007536773,0.000186887,0.02574426,0.000132477,0.000008617884,0.00003347695,0.0001401472,0.9709319,0.001246732,0.0002691793,0.0002838962,0.0002687448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05178207,0.00001354227,0.9463267,0.0004828831,0.0000949243,0.0002692757,0.00006960071,0.000576477,0.0003845733],"genre_scores_gemma":[0.9486211,0.000002635988,0.05069963,0.0001919058,0.00002895342,8.986331e-7,0.000448264,0.000005497232,0.000001143949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.896839,"threshold_uncertainty_score":0.8887922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01483399648761171,"gpt":0.2609815734317931,"spread":0.2461475769441814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563889,0.0002604694,0.0007022837,0.00004547714,0.0004819943,0.0001926503,0.001169692,0.0001012148,0.000003880634],"category_scores_gemma":[0.0005024263,0.0001609085,0.0002254524,0.0007842351,0.0002665587,0.0001592736,0.0002762981,0.0002313452,0.000009650431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000059165,"about_ca_system_score_gemma":0.0001211633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006144887,"about_ca_topic_score_gemma":0.00000264003,"domain_scores_codex":[0.9970387,0.0004809118,0.0009087874,0.0003244502,0.0004725972,0.0007745735],"domain_scores_gemma":[0.9961504,0.001909255,0.0006208143,0.000773053,0.0003675393,0.0001788927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002698973,0.0005897211,0.001972621,0.0001547611,0.0005449711,0.00004239227,0.002450969,0.003833033,0.0002041211,0.1380569,0.0109793,0.8384722],"study_design_scores_gemma":[0.02330962,0.00005249243,0.0006711123,0.0001735176,0.00004014913,0.0001464801,0.0003079181,0.9601002,0.003822225,0.0005570307,0.01037856,0.0004406872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008094969,0.001373904,0.9869502,0.0002863564,0.001978626,0.0006244184,0.0001248466,0.0001763224,0.0003903399],"genre_scores_gemma":[0.9914011,0.000006583343,0.008224578,0.00004290297,0.0002020617,0.00002477542,0.0000376649,0.00001243588,0.00004787568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9833062,"threshold_uncertainty_score":0.6561657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133718851","doi":"10.1007/s00446-008-0068-y","title":"On implementing omega in systems with weak reliability and synchrony assumptions","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lossy compression; Reliability (semiconductor); Computer science; Process (computing); Crash; Core (optical fiber); Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01336803634467652,"gpt":0.239738238464348,"spread":0.2263702021196715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819092,0.0002482141,0.0003709017,0.0001125768,0.000507333,0.000225024,0.0004999982,0.00007943481,0.000001675411],"category_scores_gemma":[0.00006966027,0.0002187931,0.00004471463,0.000815416,0.00008092398,0.0002973297,0.0001921084,0.0002938381,0.00001132855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719111,"about_ca_system_score_gemma":0.00007899533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002459317,"about_ca_topic_score_gemma":0.00001736956,"domain_scores_codex":[0.9975705,0.0001520445,0.0005531738,0.000701753,0.000374319,0.0006482246],"domain_scores_gemma":[0.9986073,0.0002633855,0.0002205118,0.0006378393,0.0001321635,0.0001387669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008880629,0.001063783,0.4587919,0.0005431562,0.0001542523,0.0007066536,0.002366999,0.2851001,0.0003991332,0.228463,0.00581694,0.01650527],"study_design_scores_gemma":[0.001492725,0.0001810557,0.1475854,0.0004490812,0.000006545243,0.000260441,0.00024322,0.8451266,0.00004230222,0.0001758726,0.003941207,0.0004955041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4941354,0.000128404,0.5044112,0.0001287002,0.0001427343,0.0002572876,0.0000688283,0.000176112,0.0005513259],"genre_scores_gemma":[0.9978874,0.000006492966,0.001902556,0.00003280244,0.00005158616,0.0000192246,0.00007317164,0.00001132927,0.00001544631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5600265,"threshold_uncertainty_score":0.8922125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105783854","doi":"10.1007/s00446-015-0248-5","title":"Getting close without touching: near-gathering for autonomous mobile robots","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mobile robot; Robot; Computer science; Human–computer interaction; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03433678672213519,"gpt":0.2993103808530412,"spread":0.264973594130906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072006,0.0001999949,0.0002493126,0.00005858792,0.0004489298,0.0007510396,0.0008674082,0.00007843703,0.000002935116],"category_scores_gemma":[0.0002128776,0.0002037771,0.00009287671,0.0004195844,0.000040683,0.000370164,0.0003675278,0.000204961,0.00002118698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001466646,"about_ca_system_score_gemma":0.0002320579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002526259,"about_ca_topic_score_gemma":0.00000143623,"domain_scores_codex":[0.9981133,0.00009052849,0.0003909551,0.0005101304,0.0002875182,0.0006076066],"domain_scores_gemma":[0.9985825,0.0001570436,0.0001827884,0.0004824293,0.0003076876,0.0002875354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008386176,0.00008284132,0.00161185,0.00002970592,0.00002652146,0.000007575644,0.002348493,0.9261475,0.0002685127,0.008530471,0.0007634101,0.06017476],"study_design_scores_gemma":[0.0007648882,0.0001192767,0.0001443379,0.00004034642,0.000004499128,0.00001366905,0.0001374765,0.9906602,0.0003877112,0.001074996,0.006387648,0.0002649403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03402266,0.0000889052,0.963478,0.0003050071,0.0003677686,0.0005402386,0.00001462572,0.0006846042,0.000498241],"genre_scores_gemma":[0.7124917,7.695915e-7,0.2870922,0.0001550208,0.0001094998,0.00002909895,0.00006517993,0.00001944423,0.00003712122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.678469,"threshold_uncertainty_score":0.8309789,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01891117604027799,"gpt":0.2416308932677721,"spread":0.2227197172274941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002412842,0.0002683376,0.0003306292,0.00008312544,0.0004276331,0.0005166475,0.001136836,0.000119568,0.00001357471],"category_scores_gemma":[0.00005967157,0.0002033232,0.00009466748,0.0004534884,0.0002133956,0.0008231215,0.0005961313,0.0001593493,0.00002087445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008626816,"about_ca_system_score_gemma":0.0000698251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007887979,"about_ca_topic_score_gemma":0.000008159874,"domain_scores_codex":[0.9980437,0.0001057738,0.000347151,0.0006571807,0.0003022648,0.0005439767],"domain_scores_gemma":[0.9984874,0.0002159585,0.0002265353,0.0006755104,0.0001625321,0.0002320783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008195025,0.0002440748,0.08011099,0.0001076403,0.0003386576,0.0003295927,0.0008510143,0.002690503,0.003391437,0.5542651,0.02103083,0.3365583],"study_design_scores_gemma":[0.01133796,0.0004051459,0.3069931,0.001850755,0.0001236311,0.001571956,0.00116903,0.4772922,0.003581239,0.01292211,0.1787437,0.004009178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06703073,0.0001789338,0.928389,0.00192951,0.0008113922,0.0001787009,0.0003513311,0.0004287565,0.0007016386],"genre_scores_gemma":[0.9960711,0.00002273439,0.003566563,0.00006609613,0.0001641204,0.000004303737,0.00004710778,0.00001203501,0.00004592275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9290404,"threshold_uncertainty_score":0.8291279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888048527","doi":"10.1007/s00446-018-0339-1","title":"Distributed exploration of dynamic rings","year":2018,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; A priori and a posteriori; Focus (optics); Theoretical computer science; Graph; Context (archaeology); Invariant (physics); Topology (electrical circuits); Distributed computing; Mathematics; Combinatorics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.0256524799855562,"gpt":0.2861344033419593,"spread":0.2604819233564031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502206,0.0001290533,0.0001751094,0.00009678026,0.0002158076,0.0001349717,0.0007118986,0.00005933556,0.00001655578],"category_scores_gemma":[0.000112385,0.0001307701,0.00005716102,0.001021441,0.000105168,0.0006042317,0.000256958,0.0001142172,0.00004045364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000629488,"about_ca_system_score_gemma":0.00006002788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001245585,"about_ca_topic_score_gemma":0.000002912235,"domain_scores_codex":[0.998598,0.00008179717,0.0003798944,0.0003291624,0.0002865242,0.0003245532],"domain_scores_gemma":[0.9986962,0.00007659439,0.0002038812,0.0004549892,0.0004716035,0.00009671773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009197494,0.001267473,0.008018259,0.0003150933,0.00030369,0.00004461754,0.01016934,0.1130911,0.02589385,0.4776654,0.009125102,0.3540141],"study_design_scores_gemma":[0.0003268904,0.0001101044,0.002466823,0.00004179681,0.000003307705,0.000003512743,0.00006355091,0.9905606,0.003142214,0.002249319,0.0008809147,0.0001509798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01419029,0.00001801464,0.9841978,0.0005479668,0.0002103587,0.0001488272,0.00005375529,0.0002898372,0.0003431308],"genre_scores_gemma":[0.9595506,0.000004019721,0.04004616,0.00005813619,0.00004037681,0.000002807355,0.0002798956,0.000007536851,0.00001042636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9453604,"threshold_uncertainty_score":0.5332648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088895311","doi":"10.1007/s00446-008-0075-z","title":"Broadcasting in UDG radio networks with unknown topology","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Topology (electrical circuits); Telecommunications; Radio broadcasting; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02864918246934317,"gpt":0.2524416359140839,"spread":0.2237924534447407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000317892,0.0001774181,0.0002513082,0.00009921859,0.0004752387,0.00007812575,0.0009669531,0.0000678686,0.000009496292],"category_scores_gemma":[0.00005673952,0.0001660724,0.00004001937,0.001259983,0.0001043146,0.0001876829,0.0003892423,0.000405152,0.000006910729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001018722,"about_ca_system_score_gemma":0.00007786936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001467098,"about_ca_topic_score_gemma":0.00003152497,"domain_scores_codex":[0.9984384,0.0002188994,0.000333761,0.0003885169,0.0001440689,0.0004763859],"domain_scores_gemma":[0.9987656,0.0002952102,0.0001295828,0.0005982444,0.0001206742,0.00009068753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003470641,0.0002719375,0.1201956,0.00001383692,0.00006143095,0.0004786076,0.002883288,0.5427346,0.0001843785,0.08936605,0.002227759,0.2415478],"study_design_scores_gemma":[0.0005954254,0.00005879948,0.02861268,0.00007069502,0.000002015708,0.0002012847,0.0000281076,0.9661343,0.00006341604,0.00003918654,0.003954194,0.000239879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09347284,0.0006521397,0.9038534,0.0004831626,0.0001407622,0.0001154281,8.6828e-7,0.0002304265,0.001050995],"genre_scores_gemma":[0.9833871,0.0001148619,0.01612174,0.0002233596,0.00008697098,0.000004679663,0.0000306394,0.000009749263,0.0000209709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8899142,"threshold_uncertainty_score":0.6772236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002043779","doi":"10.1007/s446-002-8031-5","title":"The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy","year":2002,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Carleton University; University of Toronto","funders":"","keywords":"Computer science; Consistency (knowledge bases); Mathematical optimization; Dynamic programming; Function (biology); Path (computing); Linear programming; Zero (linguistics); Optimization problem; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05930555058723942,"gpt":0.3061084122070256,"spread":0.2468028616197862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007236183,0.0001080644,0.0001586269,0.00008953804,0.0002421369,0.0001805811,0.000696437,0.00005768031,0.000003916815],"category_scores_gemma":[0.0002610179,0.0000972987,0.00003925353,0.002390377,0.00006120014,0.00016903,0.0002589292,0.0001865506,0.000005285341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137441,"about_ca_system_score_gemma":0.00007241322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001366835,"about_ca_topic_score_gemma":0.000006781027,"domain_scores_codex":[0.9983698,0.0001718714,0.0004524949,0.0002930188,0.0002547074,0.0004581692],"domain_scores_gemma":[0.9986866,0.0002386204,0.0002071967,0.000542279,0.0002519783,0.00007330433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003735279,0.0000705622,0.0008436968,0.00001533522,0.00001329904,0.00000318542,0.0005477602,0.9461551,0.00009674331,0.03456974,0.0002578107,0.017423],"study_design_scores_gemma":[0.0002442732,0.00002998265,0.0008132493,0.00009114698,0.000002214435,0.000008238987,0.00003161954,0.9976645,0.00006417422,0.0004251558,0.000526243,0.00009917752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254611,0.0002887222,0.9848921,0.001553611,0.00006269715,0.0002080902,0.000002865346,0.0000916274,0.0003541572],"genre_scores_gemma":[0.9463887,0.00003041963,0.05330833,0.0001397404,0.00009476651,0.000003153832,0.00001341841,0.000007685759,0.00001381456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9338425,"threshold_uncertainty_score":0.3967726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570310514","doi":"10.1007/s00446-014-0211-x","title":"Randomized distributed decision","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Boosting (machine learning); Randomized algorithm; Context (archaeology); Monte Carlo method; Randomization; Distributed algorithm; Theoretical computer science; Artificial intelligence; Distributed computing; Algorithm; Randomized controlled trial; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01455801862158842,"gpt":0.2548765614012152,"spread":0.2403185427796267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001822564,0.0002928848,0.0006533474,0.0001385241,0.0005083633,0.0004536189,0.001702687,0.0001063809,0.00001830196],"category_scores_gemma":[0.0009378619,0.0002634508,0.0003371277,0.001112942,0.0001656769,0.0002679876,0.0006008368,0.0003025366,0.00007616331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005822092,"about_ca_system_score_gemma":0.00003691978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002289983,"about_ca_topic_score_gemma":0.000001492509,"domain_scores_codex":[0.9971987,0.0004045025,0.0006439841,0.0006586396,0.0004891682,0.0006050196],"domain_scores_gemma":[0.9962398,0.002128796,0.0002472227,0.0009767181,0.0002008871,0.0002065831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001014529,0.0001775338,0.0003423482,0.00002114749,0.00008613434,0.0000193426,0.0001980393,0.008873064,0.0000675004,0.6803365,0.002873793,0.30599],"study_design_scores_gemma":[0.03215652,0.00003164636,0.0007598197,0.00006377304,0.00001381204,0.00002268754,0.00001040362,0.883907,0.0002644285,0.07623865,0.006203454,0.0003277847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01396235,0.00008711524,0.9828699,0.0004820452,0.0008469219,0.0002559135,0.0000454239,0.0007842978,0.000666025],"genre_scores_gemma":[0.8999703,0.000004842772,0.09940291,0.0002284228,0.0001718379,0.000007607684,0.0001978528,0.00001158888,0.000004669228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8860079,"threshold_uncertainty_score":0.9999818,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02757546772497525,"gpt":0.2330057222646325,"spread":0.2054302545396572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000736644,0.0004892829,0.0008552115,0.0001566203,0.0003306834,0.0002199016,0.002272764,0.0002165504,0.00001695319],"category_scores_gemma":[0.0001641668,0.0004688042,0.0003337012,0.001720999,0.0001581281,0.000432101,0.0004618856,0.0003374206,0.00003930076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000112807,"about_ca_system_score_gemma":0.0001141155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002444548,"about_ca_topic_score_gemma":0.000005224475,"domain_scores_codex":[0.9959791,0.0002132392,0.001231177,0.0008983104,0.0006444846,0.001033733],"domain_scores_gemma":[0.9969604,0.0002015558,0.0007483368,0.00134078,0.0004576942,0.0002912301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001595013,0.003770065,0.06956404,0.001092402,0.001086186,0.0006542484,0.008265054,0.007334785,0.003393397,0.2656724,0.002236908,0.636771],"study_design_scores_gemma":[0.001827891,0.0003648172,0.06173458,0.001946622,0.0001467996,0.0002561292,0.001144751,0.8889293,0.03162241,0.0024261,0.007407499,0.002193079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06735592,0.0002115263,0.9286537,0.00007428402,0.0005251018,0.0004319889,0.0004135513,0.0006906213,0.001643363],"genre_scores_gemma":[0.986017,0.000005380557,0.01351075,0.00003351882,0.00009046745,0.00003770818,0.0002674537,0.00003058739,0.0000071224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9186611,"threshold_uncertainty_score":0.9997764,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0257461129592839,"gpt":0.2450974354943919,"spread":0.219351322535108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001322771,0.0004040768,0.0006513553,0.000204246,0.0005205976,0.0007810615,0.001023044,0.0002861564,0.000004515872],"category_scores_gemma":[0.0001945537,0.0004280769,0.00008924981,0.001546399,0.0000755189,0.000877623,0.0003734344,0.0007351555,0.00005982436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003213934,"about_ca_system_score_gemma":0.0001262483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002546481,"about_ca_topic_score_gemma":0.00002169947,"domain_scores_codex":[0.9962919,0.0002993442,0.0011026,0.0009414016,0.0004722442,0.000892534],"domain_scores_gemma":[0.9978272,0.0003750561,0.0003883021,0.0008643924,0.0002107431,0.0003343103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004984299,0.0006385157,0.4488809,0.0005245027,0.0002380827,0.0003272289,0.003651124,0.3827451,0.0005578961,0.05015256,0.02263045,0.08960379],"study_design_scores_gemma":[0.001576964,0.00005447723,0.1388661,0.0004436175,0.00001925078,0.00009168097,0.0004186073,0.83775,0.00009422353,0.000224289,0.01971736,0.0007433891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654086,0.001814289,0.8287727,0.0008952623,0.0003697582,0.0005655261,0.001000474,0.0005819259,0.0005914707],"genre_scores_gemma":[0.9936332,0.00001136007,0.00480121,0.00003566832,0.0003070481,0.00002219187,0.00111898,0.00002420206,0.00004611657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8282246,"threshold_uncertainty_score":0.9998171,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Semaphore; Mutual exclusion; Critical section; Liveness; Computer science; Lock (firearm); Process (computing); Copycat; Reboot; Distributed computing; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007466612976992102,"gpt":0.2218891639147716,"spread":0.2144225509377795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004214123,0.0002117359,0.0002992387,0.0000645227,0.0002251415,0.0003338462,0.001128432,0.0001047528,0.00005061366],"category_scores_gemma":[0.00003558513,0.0002058418,0.0001153712,0.0007278445,0.00001695659,0.0004412431,0.0003832213,0.0002281381,0.0009325575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001068917,"about_ca_system_score_gemma":0.00006711119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003281402,"about_ca_topic_score_gemma":9.452449e-7,"domain_scores_codex":[0.9979932,0.00008219246,0.00040286,0.000600575,0.0003732546,0.0005478711],"domain_scores_gemma":[0.9985892,0.0001162887,0.0001822664,0.0008397014,0.0001409043,0.0001317053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008448117,0.0008717945,0.07012001,0.0003978615,0.000252267,0.0002798768,0.002154653,0.08303803,0.02349128,0.3929066,0.08048049,0.3459226],"study_design_scores_gemma":[0.0008954222,0.0001025255,0.007024153,0.0001515802,0.000004180744,0.00005144571,0.00007208163,0.9083718,0.001181516,0.0008634601,0.08079088,0.0004909195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1575305,0.0001331787,0.8344969,0.0002461858,0.001282796,0.000225391,0.0000565643,0.0004543937,0.005574199],"genre_scores_gemma":[0.9946917,0.000003034715,0.004586481,0.0002002971,0.0001132247,0.000002877602,0.0001433108,0.0000116175,0.0002474429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8371612,"threshold_uncertainty_score":0.9998453,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07288501185737015,"gpt":0.317959051691344,"spread":0.2450740398339739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318955,0.0001592405,0.0002844816,0.0000852308,0.0003393638,0.0001186566,0.0004089652,0.00004822131,0.0000112348],"category_scores_gemma":[0.00003726454,0.0001606152,0.00005648439,0.0005148532,0.00008651978,0.0001839341,0.0002127437,0.000109414,0.00000252252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004306562,"about_ca_system_score_gemma":0.0000617581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003106795,"about_ca_topic_score_gemma":0.00001176544,"domain_scores_codex":[0.9983964,0.00009620574,0.0006168203,0.0003702117,0.0002047743,0.0003155921],"domain_scores_gemma":[0.9990048,0.00006975007,0.0002082771,0.0003760142,0.0002387598,0.0001024072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003084481,0.001637405,0.1022535,0.0002548633,0.0003315961,0.00003619913,0.0284223,0.157733,0.01483273,0.6206006,0.0005316175,0.07333537],"study_design_scores_gemma":[0.00037772,0.00005225014,0.03522395,0.00009526396,0.00001723325,0.00001777697,0.0009404147,0.9604916,0.002231869,0.00009873525,0.0002553143,0.0001978525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2965812,0.0001513072,0.7024087,0.00002453921,0.0001176817,0.0001659389,0.0001865638,0.00007203523,0.0002919628],"genre_scores_gemma":[0.9388443,0.000002227875,0.06099318,0.00002026265,0.00002274105,0.000003741978,0.0001047425,0.000006582068,0.000002233131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8027586,"threshold_uncertainty_score":0.6549699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034873526","doi":"10.1007/s00446-008-0062-4","title":"Checking sequences for distributed test architectures","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Observability; Controllability; Computer science; Sequence (biology); Construct (python library); Sequence diagram; Distributed computing; Test (biology); Model checking; Digraph; Theoretical computer science; Programming language; Unified Modeling Language; Mathematics; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.03386251293888783,"gpt":0.2757959318795185,"spread":0.2419334189406307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004148962,0.0002862888,0.0003169162,0.0001168806,0.0008664727,0.0001864089,0.001308456,0.0001050104,0.000001584903],"category_scores_gemma":[0.001871619,0.0002723493,0.0001565155,0.000769536,0.0001333359,0.0001150489,0.0002726341,0.00024389,0.00000571535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009239567,"about_ca_system_score_gemma":0.0001273041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005289096,"about_ca_topic_score_gemma":0.000001149756,"domain_scores_codex":[0.9979245,0.00005435812,0.0004193176,0.0006320082,0.0003043259,0.0006654899],"domain_scores_gemma":[0.9970384,0.001699532,0.0002340567,0.0006446163,0.0002391301,0.0001443011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006049485,0.001174923,0.5431077,0.0004293135,0.0002722562,0.0005447494,0.00480683,0.0416141,0.005512746,0.01885519,0.1422119,0.2414098],"study_design_scores_gemma":[0.0007685233,0.0003327656,0.03634822,0.0002563776,0.00001929675,0.0006502106,0.00001838127,0.907324,0.0116241,0.03898212,0.002706871,0.0009691376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04993527,0.000126257,0.937053,0.0004174991,0.0002010644,0.0002716495,0.0001765933,0.01175393,0.00006472696],"genre_scores_gemma":[0.7904158,0.000001979198,0.2090545,0.00016123,0.0001445788,0.00002154582,0.0001806635,0.00001568317,0.000004039162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8657099,"threshold_uncertainty_score":0.9999729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04190184681337369,"gpt":0.2437654535160998,"spread":0.2018636067027261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003387674,0.0002603693,0.0003134105,0.00008582002,0.0003927044,0.0004139747,0.0009214996,0.0001431944,0.000007124259],"category_scores_gemma":[0.00006285042,0.0002581716,0.0001834491,0.0006963041,0.00004044663,0.0004796282,0.0001188376,0.0001852969,0.00002011203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008593869,"about_ca_system_score_gemma":0.00005988154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009007869,"about_ca_topic_score_gemma":0.000003005257,"domain_scores_codex":[0.9980525,0.00005655859,0.00035405,0.0006281577,0.0002608776,0.000647905],"domain_scores_gemma":[0.9985731,0.000075592,0.0002462325,0.0006245383,0.0003364492,0.0001440712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001853086,0.001269426,0.002906008,0.0006413566,0.0006878547,0.00009826807,0.0194211,0.0005248918,0.01597178,0.2036331,0.3066598,0.4480012],"study_design_scores_gemma":[0.002524838,0.0003588778,0.002915683,0.0001713497,0.000045526,0.0001062176,0.003303221,0.8464531,0.0945071,0.005026625,0.04326152,0.001325903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01835001,0.000139493,0.9776894,0.001175853,0.0008895511,0.0003952333,0.0001169734,0.0004908159,0.000752655],"genre_scores_gemma":[0.9827698,0.000001399915,0.0162062,0.0004482287,0.0002237811,0.00002770234,0.0001157571,0.00001822381,0.0001888697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9644198,"threshold_uncertainty_score":0.9999871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078479354","doi":"10.1007/s00446-013-0196-x","title":"Leader election for anonymous asynchronous agents in arbitrary networks","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Université du Québec en Outaouais","keywords":"Leader election; Asynchronous communication; Computer science; Adversarial system; Adversary; Graph; Theoretical computer science; Computer network; Distributed computing; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02571712385047296,"gpt":0.2721889136313614,"spread":0.2464717897808885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473144,0.0001300381,0.0001512583,0.0001013045,0.0001753203,0.0002939793,0.0004523057,0.00008507768,0.00002091949],"category_scores_gemma":[0.0000402668,0.000134955,0.00005556806,0.0006371299,0.00002053268,0.0003658398,0.00010015,0.0001998258,0.00002622066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029272,"about_ca_system_score_gemma":0.00005207162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006558423,"about_ca_topic_score_gemma":0.000004486258,"domain_scores_codex":[0.9986342,0.00007230308,0.0002932104,0.0003496537,0.0001408092,0.0005097983],"domain_scores_gemma":[0.999327,0.0001157847,0.00008743888,0.0002426494,0.0001330537,0.00009405636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005559305,0.0001920872,0.006429515,0.00003097155,0.00002305493,0.000006770322,0.0003485474,0.8916149,0.0001089274,0.006548777,0.006307293,0.08838362],"study_design_scores_gemma":[0.0004672961,0.00005851139,0.009239513,0.00002280327,0.000001316832,0.000005521842,0.00002303132,0.9886977,0.0001046073,0.0008509746,0.000376837,0.0001518726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496404,0.00005521298,0.9831005,0.0005573628,0.0002409182,0.0005714511,0.000002981836,0.000221607,0.0002859675],"genre_scores_gemma":[0.9633964,0.000004979879,0.03587246,0.0004412667,0.00008664594,0.00004019554,0.0001267717,0.00001092316,0.00002038317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9484323,"threshold_uncertainty_score":0.5503306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03822665741462596,"gpt":0.2778016039538242,"spread":0.2395749465391983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001247716,0.0003893154,0.0004670812,0.00008149299,0.001764991,0.0007576782,0.001606669,0.0002198073,0.00001166082],"category_scores_gemma":[0.0001550986,0.0003029694,0.0001334421,0.0007884503,0.0004063508,0.0004133171,0.001237769,0.0009093558,0.00004338395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006461598,"about_ca_system_score_gemma":0.00007953659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001335553,"about_ca_topic_score_gemma":0.0000280369,"domain_scores_codex":[0.9968447,0.0002348388,0.000682902,0.0008325517,0.0006292458,0.0007757765],"domain_scores_gemma":[0.997655,0.0004579212,0.0003647909,0.001032871,0.0002197192,0.0002697434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007996937,0.0005738526,0.06743652,0.0002913616,0.0002701904,0.0002190183,0.008585045,0.001180817,0.06189181,0.375046,0.0187344,0.465691],"study_design_scores_gemma":[0.002024465,0.00019492,0.1438912,0.0003179033,0.00005599076,0.0002963657,0.0004442159,0.7941356,0.003635121,0.009689615,0.04394299,0.001371664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4368544,0.0001077994,0.5595011,0.001382182,0.0008237452,0.0002818209,0.000215852,0.0003294244,0.0005036946],"genre_scores_gemma":[0.9939287,0.00000376048,0.004887434,0.0001787904,0.0006721188,0.00000472685,0.0002889734,0.00002017482,0.00001529779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7929547,"threshold_uncertainty_score":0.9999422,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0666930311508916,"gpt":0.2723594850737362,"spread":0.2056664539228446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005631213,0.0003204475,0.0004099818,0.00008775306,0.0004453304,0.00021514,0.001376604,0.0001378069,0.000007802539],"category_scores_gemma":[0.00007701012,0.0003190832,0.0002057208,0.0006368583,0.00006136308,0.0003752132,0.0002687321,0.0002124736,0.00003579983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104096,"about_ca_system_score_gemma":0.00008071404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006918525,"about_ca_topic_score_gemma":0.000004079652,"domain_scores_codex":[0.9974568,0.00008520923,0.000587162,0.0007804151,0.0002992217,0.0007911223],"domain_scores_gemma":[0.9981568,0.0001712239,0.0003375348,0.0007367075,0.0003941929,0.0002035372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002250287,0.001258801,0.009931132,0.0003214941,0.0007215747,0.0004704336,0.01091968,0.003960981,0.001187449,0.2699546,0.0107687,0.6902802],"study_design_scores_gemma":[0.00127334,0.0002735533,0.01369445,0.0001983278,0.00002474729,0.00005969423,0.0003409345,0.9756922,0.002392248,0.002313552,0.003013257,0.0007236713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008079177,0.000208672,0.9885164,0.00007086887,0.0008670073,0.0004842289,0.0001875841,0.0005457239,0.001040266],"genre_scores_gemma":[0.903703,0.000001775923,0.09577356,0.00008726402,0.0001882354,0.00003266505,0.0001608329,0.00002068664,0.00003197459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9717312,"threshold_uncertainty_score":0.9999261,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03728997020315791,"gpt":0.2374978864502045,"spread":0.2002079162470466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001171427,0.0004015843,0.0008319716,0.0001160205,0.0005096401,0.0002590365,0.001476118,0.0001350974,0.00002273866],"category_scores_gemma":[0.00009052819,0.0003160055,0.0002154749,0.0009312319,0.0003140779,0.0004211555,0.000436569,0.0003440096,0.00009089259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009880454,"about_ca_system_score_gemma":0.0001062551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002264177,"about_ca_topic_score_gemma":0.00001454345,"domain_scores_codex":[0.9967882,0.0003697474,0.0007125303,0.0008266295,0.0005359214,0.0007669525],"domain_scores_gemma":[0.9978835,0.0002125694,0.0004255075,0.0009325684,0.0003028224,0.0002430136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.02016908,0.001898022,0.007216029,0.0003039969,0.0009183624,0.001255726,0.01086353,0.002585828,0.002096333,0.8710959,0.006227001,0.07537018],"study_design_scores_gemma":[0.1059719,0.0002645729,0.008488575,0.000376878,0.00006990506,0.0003530468,0.0002237181,0.8689554,0.004850393,0.007191775,0.001846284,0.001407522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320037,0.0001131312,0.8633454,0.0001174848,0.0004081725,0.0005405471,0.00007176407,0.0006364441,0.002763435],"genre_scores_gemma":[0.9737752,0.000003968637,0.0257781,0.0001227622,0.0001038868,0.00002153554,0.00015661,0.00001991924,0.00001800845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8663696,"threshold_uncertainty_score":0.9999292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072592698","doi":"10.1007/s00446-012-0179-3","title":"Bounding the locality of distributed routing algorithms","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Locality; Computer science; Bounding overwatch; Dilation (metric space); Equal-cost multi-path routing; Static routing; Node (physics); Neighbourhood (mathematics); Shortest path problem; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Graph; Combinatorics; Routing protocol; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01993346998580042,"gpt":0.2626555313645435,"spread":0.2427220613787431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113031,0.0002743122,0.0003715221,0.00004378545,0.0005724178,0.0002211018,0.001760557,0.000119347,0.000009141038],"category_scores_gemma":[0.0002336851,0.0002171406,0.000174209,0.001347681,0.0001569518,0.00045858,0.0008532379,0.0004475758,0.00001758864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001698064,"about_ca_system_score_gemma":0.00006696633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006780164,"about_ca_topic_score_gemma":0.000001440185,"domain_scores_codex":[0.9969716,0.0003104439,0.0007194949,0.0004147928,0.0005202577,0.001063379],"domain_scores_gemma":[0.9972594,0.0007326314,0.0005030557,0.001104283,0.0001914525,0.0002091484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002506805,0.0008553764,0.196035,0.0001484234,0.000400205,0.00002984193,0.004428699,0.05621134,0.001231401,0.4577634,0.004956369,0.2779149],"study_design_scores_gemma":[0.0003381468,0.00003126511,0.03338959,0.00009121,0.0000259615,0.00004057147,0.0002469205,0.9599534,0.00220018,0.0006849957,0.002658164,0.0003395645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03473182,0.0003571889,0.9628279,0.0002992589,0.0009409295,0.0002511865,0.00006781268,0.000309705,0.0002142141],"genre_scores_gemma":[0.9873247,0.000002932678,0.01196134,0.0001052867,0.0004440508,0.000007116283,0.0001361156,0.00001578038,0.000002741655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9525928,"threshold_uncertainty_score":0.8854737,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03477025260088355,"gpt":0.2493674413589699,"spread":0.2145971887580864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484259,0.0001978829,0.0003167807,0.00003535399,0.0009827146,0.0001401503,0.001552341,0.0000677904,0.000002888926],"category_scores_gemma":[0.0001012763,0.0001520731,0.0001380387,0.0008539768,0.0004517062,0.0001737513,0.0002995945,0.0002091825,0.00002853056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006407315,"about_ca_system_score_gemma":0.0001368898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009183156,"about_ca_topic_score_gemma":0.000005048153,"domain_scores_codex":[0.9980043,0.0001414661,0.0005399531,0.0003735162,0.00043818,0.0005025897],"domain_scores_gemma":[0.9980024,0.000289141,0.000359044,0.0009374224,0.0002958891,0.0001161136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000272114,0.0002686932,0.007636001,0.00005711116,0.0001311681,0.00009885328,0.001126831,0.00433863,0.00124856,0.9432564,0.02631694,0.01549365],"study_design_scores_gemma":[0.001495926,0.0001667871,0.08345161,0.0001654074,0.00001463856,0.000379652,0.0002621538,0.8220555,0.005157233,0.009829465,0.07622456,0.0007971154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06306172,0.0003473524,0.9330612,0.0008899411,0.0005909764,0.000187013,0.00008881169,0.0002446239,0.001528287],"genre_scores_gemma":[0.9941561,0.00001378417,0.005602382,0.00004119021,0.0000730219,0.000003067386,0.00005287365,0.00000840376,0.000049212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9334269,"threshold_uncertainty_score":0.7558345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003887790","doi":"10.1007/s00446-002-0074-4","title":"Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Petri net; Formal specification; Language Of Temporal Ordering Specification; Distributed computing; Specification language; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02122048162154704,"gpt":0.2571902043735971,"spread":0.2359697227520501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111993,0.0002662239,0.0003776287,0.0002204744,0.0002396875,0.0001800512,0.0006369714,0.0000948368,0.000006240206],"category_scores_gemma":[0.0006787007,0.0002299534,0.0000606945,0.0009016638,0.00007708988,0.0001674238,0.00008807376,0.0001585479,0.000002279736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009276581,"about_ca_system_score_gemma":0.0001138684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001370469,"about_ca_topic_score_gemma":0.000001028628,"domain_scores_codex":[0.9974731,0.0003995101,0.0005150405,0.0006480553,0.0005654097,0.0003989328],"domain_scores_gemma":[0.9971817,0.001271422,0.0004386926,0.0007786471,0.000210841,0.0001186753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003397696,0.0007202977,0.00780874,0.0005808541,0.0001418945,0.00007144059,0.001009777,0.8828897,0.00186336,0.009658457,0.000299184,0.09461655],"study_design_scores_gemma":[0.000533959,0.00017362,0.002293922,0.0006521863,0.00001733104,0.00001886575,0.0001154468,0.9665126,0.02881316,0.00003698091,0.000535754,0.0002961338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04505593,0.00001246203,0.9472336,0.0001458073,0.0000412989,0.006421159,0.00001522792,0.0001941918,0.0008802757],"genre_scores_gemma":[0.9122661,2.189255e-7,0.08511596,0.0000386251,0.00001997106,0.002536466,0.000003126953,0.00001756243,0.000001987306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8672101,"threshold_uncertainty_score":0.9377229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405322972","doi":"10.1007/s00446-016-0284-9","title":"Secure multi-party computation in large networks","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Computer science; Scalability; Computation; Protocol (science); Theory of computation; Latency (audio); Distributed computing; Security parameter; Secure multi-party computation; Communication complexity; Adversary; Fraction (chemistry); Theoretical computer science; Computer network; Cryptography; Computer security; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01360963221056115,"gpt":0.2581931113703358,"spread":0.2445834791597746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005037061,0.0001747099,0.0002001437,0.0001157764,0.0001721028,0.0001348456,0.0006627989,0.0001042995,0.000007115772],"category_scores_gemma":[0.00005686286,0.0001382721,0.00008373925,0.0009502076,0.000035337,0.000420818,0.0003386987,0.0001899816,0.00001857906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000582221,"about_ca_system_score_gemma":0.00002760865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001577493,"about_ca_topic_score_gemma":0.00003874895,"domain_scores_codex":[0.9982815,0.0001318392,0.0003515171,0.0004955778,0.0001840553,0.0005555096],"domain_scores_gemma":[0.9990442,0.0002295818,0.0001343539,0.0004024234,0.00007980716,0.0001096245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000481276,0.001475215,0.3086795,0.0000611869,0.00008614385,0.0002332312,0.001858398,0.03485807,0.0007228006,0.37595,0.006627575,0.2693997],"study_design_scores_gemma":[0.001397271,0.00002518776,0.08621931,0.00009203745,0.000002668517,0.000007935441,0.00003006511,0.9089447,0.00009119186,0.001765917,0.001172877,0.0002508592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04387192,0.0001195552,0.9548003,0.0002918942,0.0003237731,0.0001364916,0.0001261268,0.0002932752,0.00003667693],"genre_scores_gemma":[0.9702815,0.000007468311,0.02932967,0.0001263657,0.00006945447,0.000003008991,0.000175064,0.000006967211,5.114977e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9264095,"threshold_uncertainty_score":0.5638572,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02167600237742189,"gpt":0.2504902375396287,"spread":0.2288142351622068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003990911,0.0002578492,0.0003581341,0.00006131891,0.0007354352,0.0002244323,0.001025967,0.00009233029,0.00001207035],"category_scores_gemma":[0.0000698311,0.0002526501,0.0001776983,0.0006374083,0.00006802525,0.0002952742,0.0002127,0.0001444607,0.00007529726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006373929,"about_ca_system_score_gemma":0.0001018366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003147815,"about_ca_topic_score_gemma":0.000001650206,"domain_scores_codex":[0.9976875,0.0000434643,0.0005355527,0.0006317879,0.0003707972,0.0007309385],"domain_scores_gemma":[0.9984337,0.0001335591,0.0002232793,0.0007233986,0.0003140929,0.0001719875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001991462,0.00302241,0.02954137,0.0005827338,0.0006675191,0.0008480909,0.002072883,0.03555658,0.008683004,0.3280724,0.4848797,0.1058741],"study_design_scores_gemma":[0.002059432,0.0002228532,0.007867376,0.0001369208,0.00001375396,0.0001617987,0.00003979274,0.742118,0.002276039,0.0005150443,0.2438627,0.0007263445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05905445,0.000247018,0.9372805,0.000460371,0.0009832223,0.0003930066,0.0001845336,0.0003249731,0.001071883],"genre_scores_gemma":[0.9834828,0.00000575302,0.01557843,0.0002208117,0.000242085,0.00002224867,0.0002341538,0.00001427576,0.0001994739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9244283,"threshold_uncertainty_score":0.9999925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568630404","doi":"10.1007/s00446-015-0253-8","title":"Time versus cost tradeoffs for deterministic rendezvous in networks","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Benchmark (surveying); Computer science; Node (physics); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Integer (computer science); Theory of computation; Set (abstract data type); Binary logarithm; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06831252283688527,"gpt":0.3088721895120278,"spread":0.2405596666751426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824768,0.0001351911,0.0001905259,0.0000798328,0.000107311,0.0001986535,0.0006472026,0.00007771768,0.000002593687],"category_scores_gemma":[0.0002508216,0.0001432777,0.00005032643,0.0005669167,0.00003869232,0.0001566894,0.0001467248,0.0001579464,0.00001867423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398911,"about_ca_system_score_gemma":0.0001220313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006296149,"about_ca_topic_score_gemma":0.000003703406,"domain_scores_codex":[0.9985711,0.00009093153,0.0003066497,0.0003471678,0.0001950197,0.0004891448],"domain_scores_gemma":[0.9988882,0.0003726454,0.00009392722,0.0003103998,0.0001336343,0.0002011751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006803706,0.00009345331,0.0001759701,0.00001008427,0.00001387548,0.00002730561,0.0004348759,0.9398628,0.000008752749,0.005296122,0.004318262,0.04969041],"study_design_scores_gemma":[0.002047283,0.0001471717,0.0001537919,0.00002270594,0.000003035448,0.000005814649,0.00003470487,0.9943383,0.00001338159,0.000240906,0.002825438,0.0001674558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001450017,0.00004596867,0.9966105,0.0003437235,0.0004597423,0.0003927491,0.00002100244,0.0002074409,0.0004688946],"genre_scores_gemma":[0.9732858,0.000001700887,0.0262256,0.00009980242,0.0001003042,0.00002001613,0.000223665,0.00001243686,0.00003070727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9718357,"threshold_uncertainty_score":0.5842695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064766370","doi":"10.1007/pl00008935","title":"Assigning labels in an unknown anonymous network with a leader","year":2001,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Task (project management); Node (physics); A priori and a posteriori; Network topology; Protocol (science); Process (computing); Computer network; Quality (philosophy); Time complexity; Range (aeronautics); Theoretical computer science; Algorithm; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02643573616965906,"gpt":0.2701634363020163,"spread":0.2437277001323573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004810629,0.0001602959,0.0001915368,0.00008827264,0.0002294935,0.0003711723,0.0006593104,0.00006492433,0.0000107301],"category_scores_gemma":[0.00002307435,0.0001451787,0.00002470042,0.001618922,0.00003895215,0.0004677404,0.0001446734,0.0002702019,0.0000130845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006708842,"about_ca_system_score_gemma":0.00008658072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274964,"about_ca_topic_score_gemma":0.00004149071,"domain_scores_codex":[0.9982025,0.0001731613,0.0002702276,0.000439602,0.0002676552,0.0006468433],"domain_scores_gemma":[0.9991256,0.00009983741,0.00009653749,0.0003906756,0.0001363669,0.0001509793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001059051,0.0001157993,0.05558589,0.000006756477,0.00001025236,0.000141112,0.0005622576,0.9057184,0.0000554653,0.009981291,0.0002733068,0.0275389],"study_design_scores_gemma":[0.0006535487,0.000135167,0.008366898,0.00008310031,0.000001975576,0.00003506477,0.00006265259,0.9888267,0.00003633264,0.0002977448,0.001269755,0.0002310469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04601225,0.00005346969,0.9519407,0.0004788614,0.000082161,0.0001723116,0.000001903516,0.0003171237,0.0009412602],"genre_scores_gemma":[0.9344643,0.000003649621,0.06502947,0.0003081371,0.00008802236,0.000004946898,0.00006017917,0.0000123544,0.00002897678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.888452,"threshold_uncertainty_score":0.5920217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295522973","doi":"10.1007/s00446-015-0259-2","title":"Rendezvous in networks in spite of delay faults","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Upper and lower bounds; Bounded function; Node (physics); Leader election; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.029227116691228,"gpt":0.2747710410700512,"spread":0.2455439243788232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433728,0.00009320734,0.0001809837,0.0001452945,0.00002375474,0.00004243875,0.0005478453,0.00006442237,0.00000146532],"category_scores_gemma":[0.0001066487,0.00009611452,0.00002740866,0.001248005,0.00002418458,0.0001675422,0.000226541,0.0002012912,0.000003633778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000862563,"about_ca_system_score_gemma":0.00007956142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001143343,"about_ca_topic_score_gemma":0.00003518983,"domain_scores_codex":[0.9986921,0.0001261411,0.000389896,0.0002488867,0.0002154361,0.0003275324],"domain_scores_gemma":[0.9993023,0.00008264124,0.0001098145,0.0002782631,0.0001250077,0.0001019846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005316072,0.00006754597,0.01968241,0.000005570132,0.000002617692,0.00003128167,0.0005239443,0.9643151,0.000007788364,0.005445803,0.0002195539,0.009693131],"study_design_scores_gemma":[0.0007043689,0.00004068614,0.008336372,0.00005843758,4.882467e-7,0.000005102342,0.00005685518,0.9900594,0.00003659937,0.0004285152,0.0001744909,0.00009863076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04366941,0.0001027326,0.955102,0.0001751503,0.0001327344,0.0001202385,0.000003769612,0.00006576076,0.0006282159],"genre_scores_gemma":[0.982671,0.000004454535,0.01720351,0.00005396254,0.00001827147,0.000001798521,0.00003733444,0.000004612302,0.00000507266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9390016,"threshold_uncertainty_score":0.3919436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1949215090","doi":"10.1007/s00446-014-0237-0","title":"Knowledge, level of symmetry, and time of leader election","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Node (physics); Topology (electrical circuits); Computation; Computer science; Network topology; Computer network; Symmetry (geometry); Lambda; Mathematics; Combinatorics; Discrete mathematics; Physics; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03682208018543388,"gpt":0.2641277812374795,"spread":0.2273057010520456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004575417,0.00008407006,0.0002128301,0.00007583751,0.00006963259,0.00003172249,0.0002246865,0.00005616267,0.000002755391],"category_scores_gemma":[0.00005731895,0.00007972835,0.00004818572,0.0003904947,0.00003304772,0.0000758034,0.0000904351,0.00007822795,0.000006295714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001754068,"about_ca_system_score_gemma":0.00001541424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003551878,"about_ca_topic_score_gemma":0.00000225602,"domain_scores_codex":[0.9991394,0.0001057649,0.000311664,0.0001909041,0.0000990023,0.0001532935],"domain_scores_gemma":[0.9992026,0.0001786269,0.0001885276,0.0002020297,0.0001918346,0.00003638928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003483497,0.000530622,0.01329289,0.0006145299,0.0002819659,0.00000228321,0.004233145,0.009179324,0.03671177,0.4903372,0.01741781,0.4273636],"study_design_scores_gemma":[0.0002246443,0.0001079682,0.00490958,0.00009747167,0.000005031591,0.00001578772,0.00003512589,0.9842678,0.008838885,0.0004542672,0.000946663,0.00009677488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07330929,0.00008066649,0.9249661,0.00004357683,0.0002699319,0.00005285044,0.000006207856,0.00004689309,0.001224489],"genre_scores_gemma":[0.9981872,8.247322e-7,0.001634584,0.00001335008,0.00009076708,5.893527e-7,0.000007909867,0.000004221164,0.00006055279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9750885,"threshold_uncertainty_score":0.3251228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045008360","doi":"10.1007/s00446-007-0021-5","title":"Activating anonymous ad hoc radio networks","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Node (physics); Asynchronous communication; Mobile ad hoc network; Distributed computing; Network topology; Task (project management); Dissemination; Theoretical computer science; Network packet; Wireless; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.00994954787033086,"gpt":0.2380018821562034,"spread":0.2280523342858725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001322481,0.0003243176,0.0003421385,0.0001005649,0.0004922289,0.0003513232,0.00153824,0.0001915663,0.00001318623],"category_scores_gemma":[0.00009759024,0.0003459103,0.0001393727,0.001466398,0.00005922304,0.0003630823,0.0005602164,0.0006278079,0.00002466409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002207821,"about_ca_system_score_gemma":0.00006040984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008739841,"about_ca_topic_score_gemma":0.000005538795,"domain_scores_codex":[0.9969022,0.000101094,0.000619596,0.000746901,0.0004101876,0.001220029],"domain_scores_gemma":[0.9975677,0.0007070511,0.0003431539,0.0009480837,0.0001549684,0.0002790286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001935812,0.0001006666,0.00230309,0.0000135452,0.0000567152,0.0002175882,0.0003532601,0.1346872,0.0003952855,0.009692151,0.00338346,0.8487777],"study_design_scores_gemma":[0.0004944142,0.00007486858,0.01018443,0.00007655543,0.000006318467,0.00008570416,0.00006152574,0.9788202,0.0007403324,0.000244922,0.008751506,0.0004592142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0406001,0.0009896178,0.9551225,0.0001214694,0.000929313,0.0002380905,0.000004158404,0.0009136105,0.001081137],"genre_scores_gemma":[0.9526423,0.00001353653,0.04644236,0.000264221,0.0005203101,0.000003428524,0.00006607235,0.00002792045,0.0000198076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9120423,"threshold_uncertainty_score":0.9998993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057121017","doi":"10.1007/s00446-013-0201-4","title":"Time versus space trade-offs for rendezvous in trees","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Node (physics); Logarithm; Tree (set theory); Constant (computer programming); Computer science; Binary logarithm; Task (project management); Combinatorics; Line (geometry); Mathematics; Discrete mathematics; Algorithm; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02343529895674592,"gpt":0.2642404078515405,"spread":0.2408051088947945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002601281,0.0001350468,0.0001778789,0.00009703777,0.0001354144,0.000252907,0.0006264866,0.00006617559,0.0000239313],"category_scores_gemma":[0.0001137938,0.0001356936,0.00006407197,0.0005698639,0.00003386365,0.0002932454,0.0001301505,0.0001343604,0.00007217583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008057903,"about_ca_system_score_gemma":0.00005314161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003269019,"about_ca_topic_score_gemma":0.000006256992,"domain_scores_codex":[0.9986693,0.00006980079,0.0002619957,0.0003529762,0.0001829441,0.0004630371],"domain_scores_gemma":[0.9990861,0.0003313541,0.00008206448,0.0003168435,0.00007145182,0.0001121554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001064833,0.0008116948,0.001960839,0.0001066889,0.0001308964,0.00003584257,0.004224226,0.5129594,0.003980462,0.0930328,0.06659097,0.3160596],"study_design_scores_gemma":[0.001378834,0.00009871519,0.002067086,0.00002169735,0.00000178814,0.000001997369,0.00005321052,0.9932109,0.0002490576,0.0005885724,0.002158708,0.0001694754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01318307,0.00004265402,0.9816476,0.003310262,0.0002333056,0.0005058224,0.00001946732,0.0002879082,0.0007699648],"genre_scores_gemma":[0.9459422,0.000002712619,0.05366658,0.00009954915,0.00005783082,0.00002605914,0.0001184723,0.0000116277,0.00007498762],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9327591,"threshold_uncertainty_score":0.5533425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808433750","doi":"10.1007/s00446-020-00387-y","title":"Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model","year":2021,"lang":"en","type":"preprint","venue":"Distributed Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","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":"Asynchronous communication; Spanning tree; Computer science; Minimum spanning tree; Binary logarithm; Graph; Distributed algorithm; Tree (set theory); Combinatorics; Omega; Distributed minimum spanning tree; Theoretical computer science; Algorithm; Mathematics; Distributed computing; Computer network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03099239851985214,"gpt":0.2679055455920573,"spread":0.2369131470722052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009417989,0.000527352,0.0006127142,0.0001855754,0.000271635,0.001479458,0.02409089,0.0003835471,9.44951e-7],"category_scores_gemma":[0.002768165,0.000424406,0.00007577778,0.0007623829,0.0002476317,0.0003043342,0.1017846,0.001742117,0.0000012247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001703464,"about_ca_system_score_gemma":0.0003115117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104691,"about_ca_topic_score_gemma":0.00005622126,"domain_scores_codex":[0.9964883,0.0002475088,0.0005300989,0.001456092,0.0005400467,0.0007379834],"domain_scores_gemma":[0.9908155,0.0004738492,0.000399714,0.008091957,0.0001429551,0.00007601028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007404111,0.001070521,0.04630834,0.001584822,0.0007912315,0.005050738,0.01104493,0.455615,0.0006433479,0.00855449,0.05766161,0.4116009],"study_design_scores_gemma":[0.0004111381,0.0000415082,0.004947098,0.0007287762,0.00002575963,0.0001241711,0.0007426144,0.9813496,0.0001749436,0.01089837,0.00003967462,0.0005162764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2061912,0.00130249,0.7824815,0.00858562,0.0001564335,0.0003537343,0.0001200661,0.0005453258,0.0002636749],"genre_scores_gemma":[0.7657577,0.00005606266,0.2336263,0.0001324869,0.00003690727,0.00002447975,0.0003437817,0.00002104527,0.000001245161],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5595666,"threshold_uncertainty_score":0.9998208,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02008877577624257,"gpt":0.2676204534354973,"spread":0.2475316776592548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006880685,0.0002857314,0.0003153556,0.00007534583,0.0003112705,0.0002494403,0.0009593596,0.0001169912,0.00002351337],"category_scores_gemma":[0.00006729607,0.0002675906,0.0001324214,0.0007383453,0.00003869668,0.0003529637,0.0001520896,0.0002493126,0.0002960659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149333,"about_ca_system_score_gemma":0.00007116236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596778,"about_ca_topic_score_gemma":2.92607e-7,"domain_scores_codex":[0.9975591,0.0001533892,0.0004546395,0.0004642272,0.0004730802,0.0008955759],"domain_scores_gemma":[0.9983137,0.0001958446,0.000202484,0.0008559452,0.0001332094,0.0002988264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001390699,0.003004713,0.07860126,0.000372617,0.0002472879,0.0002184792,0.00148042,0.3991984,0.001718489,0.1835698,0.1015747,0.2298748],"study_design_scores_gemma":[0.0005476991,0.00005079961,0.005648037,0.00009547143,0.00000737046,0.00001329033,0.0000257362,0.9646257,0.00106392,0.000027804,0.02753502,0.0003591328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02174422,0.0001172053,0.9746499,0.0004021814,0.001317647,0.0001753097,0.000186785,0.0005169658,0.0008897993],"genre_scores_gemma":[0.9943252,4.177842e-7,0.004250524,0.0004728495,0.0005857969,0.00001019611,0.0003289208,0.00001581843,0.00001033099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725809,"threshold_uncertainty_score":0.9999776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949581528","doi":"10.1007/s00446-015-0245-8","title":"Linear-in- $$\\varDelta $$ Δ lower bounds in the LOCAL model","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Helsingin Yliopisto","keywords":"Logarithm; Graph; Upper and lower bounds; Matching (statistics); Degree (music); Theory of computation; Strength of a graph; Range (aeronautics); Graph bandwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.0492260071130564,"gpt":0.2853473280723429,"spread":0.2361213209592865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224552,0.0001790746,0.0002133305,0.0001339506,0.0001279426,0.000212686,0.001783407,0.00007855865,0.000001433501],"category_scores_gemma":[0.00007983141,0.000148476,0.00007922305,0.001441468,0.00010268,0.0002170613,0.0004134877,0.000449096,0.00001801796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001150432,"about_ca_system_score_gemma":0.0001665336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001328856,"about_ca_topic_score_gemma":0.00005047692,"domain_scores_codex":[0.9981045,0.0001482516,0.0003809343,0.0004184137,0.000432972,0.000514911],"domain_scores_gemma":[0.9988987,0.0001757033,0.00007710551,0.0006550939,0.00009444818,0.00009893492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001638069,0.0004676733,0.004468803,0.0000134673,0.0000122471,0.0002577973,0.004524108,0.8247268,0.000008911305,0.1106094,0.002755495,0.05213891],"study_design_scores_gemma":[0.0005314613,0.00003997461,0.001902154,0.00003306842,0.000001394888,0.00002271368,0.0002954621,0.9684577,0.00001297163,0.02719304,0.001324413,0.0001856596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04847552,0.00008779307,0.9490056,0.001080388,0.0003206677,0.0001260334,0.00001410458,0.0001149223,0.0007749405],"genre_scores_gemma":[0.9687892,0.00000133982,0.03062935,0.0004530354,0.00007983597,0.000004575919,0.00003041432,0.000006766363,0.000005471976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9203137,"threshold_uncertainty_score":0.6054676,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006880588067287215,"gpt":0.2044840023093403,"spread":0.1976034142420531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002095548,0.0002578494,0.0002936489,0.00005938529,0.000270304,0.0005760252,0.001070833,0.00006384786,0.00004364187],"category_scores_gemma":[0.00001759686,0.0002042841,0.00007082203,0.0008044865,0.00004801396,0.0004610393,0.0002209401,0.0001883384,0.0003865002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004066075,"about_ca_system_score_gemma":0.00004830354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001824417,"about_ca_topic_score_gemma":0.000003490351,"domain_scores_codex":[0.9979389,0.00005677414,0.0004033334,0.0005540263,0.0004198783,0.0006271153],"domain_scores_gemma":[0.9984581,0.00006257334,0.0002066911,0.0007914367,0.0002898637,0.0001913716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003331099,0.001465089,0.07762256,0.000306969,0.0006080826,0.0004652443,0.002030384,0.02831868,0.006820683,0.2609395,0.1065666,0.5148228],"study_design_scores_gemma":[0.001859575,0.0002942286,0.07667773,0.0003003972,0.00001703896,0.0001540961,0.0002794258,0.8809845,0.002021864,0.0005365425,0.03580743,0.001067183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0791133,0.0001159611,0.9164649,0.0008530599,0.0002287772,0.0003428964,0.00003263989,0.000391522,0.002456921],"genre_scores_gemma":[0.9851099,0.000001724738,0.01436859,0.000205733,0.00009823576,0.00002328814,0.000110758,0.0000115561,0.00007024795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9059966,"threshold_uncertainty_score":0.8330462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4302609198","doi":"10.1007/s00446-014-0216-5","title":"Deterministic polynomial approach in the plane","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Polynomial; Plane (geometry); Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01776693751107875,"gpt":0.2474252493438052,"spread":0.2296583118327264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050976,0.00009604436,0.0001150578,0.00005938238,0.0001629681,0.0002770963,0.001080871,0.00004031658,0.000002254629],"category_scores_gemma":[0.00008199533,0.00007216331,0.00003151944,0.0004695336,0.00003196606,0.00008943181,0.0001332621,0.0001902819,0.00001780396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002235826,"about_ca_system_score_gemma":0.0000284918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124978,"about_ca_topic_score_gemma":0.000001121178,"domain_scores_codex":[0.9987612,0.000249963,0.0002125998,0.0002538854,0.0002123884,0.0003099669],"domain_scores_gemma":[0.9992071,0.0002678257,0.00006130896,0.0003837072,0.00002948983,0.00005056563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000261019,0.0008490781,0.01543727,0.0001189425,0.0000345178,0.00006701051,0.008439657,0.4479974,0.0002601631,0.2689983,0.01183914,0.2459324],"study_design_scores_gemma":[0.0003007554,0.00003465686,0.005456118,0.000008317372,0.000001112667,0.00002003808,0.00004923009,0.9918916,0.00001338594,0.0002332114,0.001893999,0.00009757405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007994859,0.000008353308,0.9878334,0.0004466201,0.0001014742,0.0001336697,0.000004718222,0.0001004051,0.003376548],"genre_scores_gemma":[0.9798623,5.362857e-7,0.01956902,0.0004124837,0.00007521122,0.000004373087,0.00006755353,0.000003937598,0.000004580481],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9718674,"threshold_uncertainty_score":0.2942734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025273848","doi":"10.1007/s00446-014-0223-6","title":"Concurrent imitation dynamics in congestion games","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Latency (audio); Computer science; Imitation; Convergence (economics); Coordination game; Singleton; Monotonic function; Mathematical optimization; Mathematics; Mathematical economics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.05841268452614844,"gpt":0.3673720416978564,"spread":0.3089593571717079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972244,0.00008425726,0.0001534272,0.0001020224,0.0001121301,0.0001330192,0.0003322895,0.00004645153,0.00002398813],"category_scores_gemma":[0.001827187,0.00007516209,0.00004198269,0.0006676673,0.00006139937,0.00008746052,0.0000516372,0.0001255557,0.0001389723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009547413,"about_ca_system_score_gemma":0.00001638315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009114995,"about_ca_topic_score_gemma":0.00002759006,"domain_scores_codex":[0.9985334,0.0002556491,0.0004362366,0.0002846309,0.0003131027,0.0001769667],"domain_scores_gemma":[0.9977484,0.001568165,0.0001921741,0.0002681944,0.000169415,0.00005361568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003317305,0.00005375535,0.02766988,0.000002326422,0.000002531913,5.180073e-7,0.0001694165,0.02013549,0.000123945,0.5049187,0.0002830162,0.4466371],"study_design_scores_gemma":[0.000254535,0.00001870168,0.1005961,0.00001920991,0.000003276934,0.000002045105,0.0007286695,0.8197853,0.0001158239,0.0767752,0.001601479,0.00009969137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4722397,0.00000947833,0.526179,0.0004353526,0.0001214355,0.00007019872,0.00002746293,0.00003866615,0.0008787177],"genre_scores_gemma":[0.9994019,6.491769e-7,0.0002735243,0.0000567083,0.00004502161,0.000004712968,0.0001965979,0.000004037872,0.00001687831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7996498,"threshold_uncertainty_score":0.3065021,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0179501018062648,"gpt":0.2607236978607834,"spread":0.2427735960545186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124231,0.0002072896,0.0003001149,0.00005274287,0.0002396807,0.0001621339,0.001081455,0.00005207268,0.0002273354],"category_scores_gemma":[0.00009619706,0.00015855,0.0001170569,0.0007359281,0.00003325494,0.00004352099,0.0001552124,0.0001555573,0.0001724154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007561926,"about_ca_system_score_gemma":0.00006661278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007816831,"about_ca_topic_score_gemma":0.00000483433,"domain_scores_codex":[0.9979005,0.0001363142,0.0005405734,0.0004670518,0.0004732165,0.0004823259],"domain_scores_gemma":[0.9982887,0.0003543404,0.000160921,0.0008919312,0.0001733696,0.0001307432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002752447,0.001402488,0.001842754,0.0001111832,0.0005165552,0.000109253,0.006142688,0.1192331,0.004817611,0.5710436,0.1654404,0.1290651],"study_design_scores_gemma":[0.00570998,0.003184978,0.1315539,0.002607422,0.0001063875,0.0001223188,0.001656477,0.6194769,0.03047716,0.00745294,0.1940021,0.003649366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.745676,0.0001151733,0.2443618,0.003429217,0.000369111,0.0007498232,0.0008343709,0.000235748,0.004228698],"genre_scores_gemma":[0.9978073,8.640448e-7,0.001534705,0.0005126279,0.00003418979,0.00001022943,0.00004955284,0.000009352946,0.00004114013],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5635906,"threshold_uncertainty_score":0.6465482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2314313325","doi":"10.1007/s00446-016-0266-y","title":"A simple approach for adapting continuous load balancing processes to discrete settings","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Load balancing (electrical power); Computer science; Mathematics; Asymptotically optimal algorithm; Discrete mathematics; Algorithm; Mathematical optimization; Grid","retraction":null,"screen_n_in":null,"score":{"opus":0.01248628975288722,"gpt":0.2490511314608281,"spread":0.2365648417079409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006527297,0.0002625181,0.0003214582,0.0001027401,0.0003387746,0.0002680263,0.001023601,0.00007499661,0.000002241191],"category_scores_gemma":[0.00196851,0.0002076591,0.00008140319,0.0008755692,0.00004288368,0.0003015104,0.0003867628,0.00008121115,0.000005576077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002073332,"about_ca_system_score_gemma":0.0001549632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000987089,"about_ca_topic_score_gemma":6.224941e-7,"domain_scores_codex":[0.9976512,0.00004266454,0.0004742627,0.0007675821,0.000360521,0.0007037738],"domain_scores_gemma":[0.9978207,0.0005460851,0.0002780185,0.0004881392,0.0006815667,0.0001854698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003083362,0.0009635047,0.02413783,0.002264424,0.0005364775,0.00005501111,0.01287678,0.1407638,0.04622613,0.2517254,0.07769522,0.442447],"study_design_scores_gemma":[0.001098974,0.0002905157,0.0004939855,0.0003876252,0.00002171211,0.00002916156,0.000222557,0.9757745,0.01458262,0.002977866,0.003296169,0.0008242714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002288901,0.00003481732,0.99464,0.0005837113,0.00008835721,0.0008148028,0.0001067318,0.001247764,0.0001948928],"genre_scores_gemma":[0.6291704,4.08736e-7,0.3704197,0.0001895817,0.00007617303,0.00006372694,0.00004960727,0.00001823175,0.00001219944],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8350107,"threshold_uncertainty_score":0.8468091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008785664092193463,"gpt":0.2435818289303683,"spread":0.2347961648381748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145994,0.0002940848,0.0002852704,0.00007440853,0.001066478,0.0006740637,0.001746365,0.0001204033,0.000002482746],"category_scores_gemma":[0.0002260095,0.0002259762,0.0001387472,0.001249982,0.00007860715,0.0001081215,0.0003622182,0.0003329098,0.0001612125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001612967,"about_ca_system_score_gemma":0.00009446714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005876239,"about_ca_topic_score_gemma":0.00016787,"domain_scores_codex":[0.997128,0.00004118915,0.0006723549,0.0005757377,0.0004932347,0.001089556],"domain_scores_gemma":[0.9973776,0.0006534647,0.0002370548,0.001010289,0.0003559946,0.0003656041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001233662,0.0002938813,0.00409085,0.00008504108,0.0002681248,0.0006375046,0.002231699,0.00941796,0.01041186,0.3326313,0.08170771,0.5581006],"study_design_scores_gemma":[0.001582656,0.0002973772,0.03118956,0.0002751558,0.00002295791,0.0003673042,0.001605486,0.2510063,0.009032396,0.0009367864,0.7021801,0.001503887],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05020417,0.0001201381,0.9446306,0.002274843,0.0009610055,0.0003610759,0.00009569363,0.0004464957,0.0009060306],"genre_scores_gemma":[0.9825905,8.946805e-7,0.0167188,0.0003413366,0.0002619637,0.000006013976,0.00003493606,0.0000159207,0.00002963498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9323863,"threshold_uncertainty_score":0.9215041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394601352","doi":"10.1007/s00446-024-00463-7","title":"On the power of bounded asynchrony: convergence by autonomous robots with limited visibility","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of British Columbia","funders":"Gruppo Nazionale per il Calcolo Scientifico; Università di Pisa; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Asynchrony (computer programming); Visibility; Bounded function; Convergence (economics); Power (physics); Computer science; Robot; Mathematics; Artificial intelligence; Telecommunications; Economics; Geography; Asynchronous communication; Mathematical analysis; Physics; Meteorology","retraction":null,"screen_n_in":null,"score":{"opus":0.01252185378138521,"gpt":0.247799545274655,"spread":0.2352776914932698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000568668,0.0001601286,0.0001694446,0.00005569324,0.0001981398,0.000353998,0.0007780686,0.00005234316,0.00006449349],"category_scores_gemma":[0.00009567327,0.0001060187,0.00006135002,0.0009935012,0.000124039,0.0001742236,0.0001692184,0.0002594646,0.00002959241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009405631,"about_ca_system_score_gemma":0.0001821008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002000387,"about_ca_topic_score_gemma":0.000001170207,"domain_scores_codex":[0.9983926,0.0001510237,0.0003002324,0.0004632986,0.0003692383,0.0003235528],"domain_scores_gemma":[0.9985194,0.0005268757,0.00009176722,0.0006036955,0.0001715251,0.0000867272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005365434,0.0005735596,0.001489207,0.0001847695,0.0002871971,0.00006259804,0.00302622,0.238848,0.001840468,0.7105559,0.02717587,0.01590251],"study_design_scores_gemma":[0.0001689473,0.000200996,0.0006247439,0.0001148965,0.000004531948,0.000005954389,0.00003988099,0.9947034,0.001712086,0.001470115,0.0008030127,0.0001514895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05113731,0.0001258308,0.9455351,0.001805125,0.0002011619,0.0002554124,0.00004794081,0.0003391288,0.0005530473],"genre_scores_gemma":[0.9947923,0.000003062628,0.004867845,0.0002334138,0.000009805985,0.000004580023,0.00005221495,0.000009960328,0.00002684446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.943655,"threshold_uncertainty_score":0.4323317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}