{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Dana Angluin","is_ca":false},{"name":"James Aspnes","is_ca":false},{"name":"David Eisenstat","is_ca":false},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01301871282599473,"gpt":0.2926498428743762,"spread":0.2796311300483815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004976653,0.0005705881,0.001250712,0.001105668,0.002231963,0.004626979,0.002654004,0.002529253,0.01154602],"category_scores_gemma":[0.04529893,0.0008608248,0.0008815113,0.001801575,0.006089455,0.01202459,0.003745748,0.004494414,0.001842743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778417,"about_ca_system_score_gemma":0.002039216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858921,"about_ca_topic_score_gemma":0.001122927,"domain_scores_codex":[0.9960453,0.001980397,0.0001126933,0.0005129041,0.001002595,0.0003460291],"domain_scores_gemma":[0.9596558,0.0308526,0.0009587056,0.006458024,0.001322048,0.0007529389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001084006,0.00003625318,0.0005265009,0.00008318244,0.00003054184,0.00004927786,0.0002179477,0.04798079,0.0007336175,0.9195455,0.004413994,0.02627392],"study_design_scores_gemma":[0.0000511738,0.0000197046,0.000172988,0.00002107373,0.00001761384,0.00005339971,0.00005371193,0.1659211,0.0005349307,0.8264191,0.006718992,0.0000162119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07785799,0.00446819,0.7676588,0.02006661,0.001212046,0.0001158454,0.000355436,0.0008777197,0.1273873],"genre_scores_gemma":[0.903626,0.002867626,0.07248335,0.001285514,0.001246759,0.0002742894,0.0002213935,0.0003360731,0.01765893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01154602,"threshold_uncertainty_score":0.0386253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038924034","doi":"10.1007/s00446-003-0091-y","title":"Hundreds of impossibility results for distributed computing","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Impossibility; Variety (cybernetics); Distributed computing; Theory of computation; Theoretical computer science; Resource (disambiguation); Fault tolerance; Resource allocation; Algorithm; Artificial intelligence; Computer network","authors":[{"name":"Faith E. Fich","is_ca":true},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02072866808562297,"gpt":0.2763131975748732,"spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008939336,0.00251168,0.002468864,0.003970305,0.004228515,0.00741259,0.003844103,0.004871828,0.01046457],"category_scores_gemma":[0.04495262,0.002189247,0.003308967,0.004653584,0.009975886,0.02005447,0.00733724,0.01686954,0.002802087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002176426,"about_ca_system_score_gemma":0.001187664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004605965,"about_ca_topic_score_gemma":0.0003476413,"domain_scores_codex":[0.9910572,0.002146513,0.000684143,0.001898667,0.003467156,0.0007463678],"domain_scores_gemma":[0.9208265,0.06435084,0.001071005,0.009906809,0.002566925,0.001277927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004057715,0.0002478607,0.001651392,0.001717261,0.0003052776,0.0003507829,0.0006332051,0.01630402,0.001675056,0.8296218,0.04513405,0.1019535],"study_design_scores_gemma":[0.00004464392,0.00002104765,0.0002406392,0.0001078784,0.00005404233,0.0001359999,0.00006537158,0.00990284,0.0006434238,0.974703,0.01404701,0.00003416126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04999556,0.06880267,0.6724761,0.06010863,0.00582547,0.0001998953,0.0009797054,0.002897731,0.1387143],"genre_scores_gemma":[0.6609802,0.04966535,0.216995,0.01156868,0.0242804,0.001027559,0.002947852,0.001877685,0.03065731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046457,"threshold_uncertainty_score":0.04727632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Bogdan S. Chlebus","is_ca":false},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Alan Gibbons","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Wojciech Rytter","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002569336,0.000594406,0.001780994,0.001061911,0.001591034,0.002210427,0.00212552,0.001711579,0.001870973],"category_scores_gemma":[0.01968859,0.001245275,0.0005152824,0.001982166,0.002649199,0.003294042,0.00169479,0.001598367,0.0004500304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002490814,"about_ca_system_score_gemma":0.001797128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003648922,"about_ca_topic_score_gemma":0.003426608,"domain_scores_codex":[0.9971926,0.001025951,0.0001525155,0.0004015309,0.0008734586,0.0003539222],"domain_scores_gemma":[0.980602,0.01534768,0.001077046,0.001497605,0.001048799,0.0004267957],"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.0003637569,0.00007463469,0.001394995,0.0005847492,0.00007085381,0.0001591049,0.0003839695,0.5423565,0.002952815,0.3847028,0.005564239,0.0613917],"study_design_scores_gemma":[0.00008359343,0.00006195765,0.0003334538,0.00003117905,0.00005483661,0.0001184784,0.00006398417,0.7262622,0.001093932,0.2663286,0.005541548,0.00002630592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03702918,0.004340146,0.9492983,0.001181133,0.0002370564,0.00007719439,0.0001480405,0.0006353972,0.007053666],"genre_scores_gemma":[0.8920283,0.004980634,0.09097169,0.0003132312,0.0004948259,0.000280477,0.0003043051,0.0002020048,0.0104245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003648922,"threshold_uncertainty_score":0.01807225,"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","authors":[{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021264,0.0005240059,0.001247619,0.001433984,0.00119874,0.002002414,0.001707054,0.0013519,0.002136397],"category_scores_gemma":[0.009951831,0.000762044,0.0004596879,0.002447343,0.00152631,0.002556138,0.001045862,0.001243541,0.0005169011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212949,"about_ca_system_score_gemma":0.0007740419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004331235,"about_ca_topic_score_gemma":0.003649353,"domain_scores_codex":[0.9989497,0.0003885249,0.00006174485,0.0001898405,0.0002726496,0.0001375736],"domain_scores_gemma":[0.989162,0.008448905,0.000875144,0.0004304357,0.0007041939,0.0003793049],"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.000269931,0.0001258372,0.002050736,0.0008489103,0.00009992611,0.000595022,0.0007934227,0.4100861,0.006782664,0.4729134,0.009070623,0.09636345],"study_design_scores_gemma":[0.00007407401,0.00005148176,0.0005557881,0.00004392861,0.00008612032,0.0002420537,0.0001411788,0.6189094,0.001215925,0.371038,0.007611537,0.00003062018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09794622,0.003716506,0.8803899,0.001410035,0.0002702641,0.000119647,0.000341933,0.0006799547,0.01512559],"genre_scores_gemma":[0.866259,0.00754515,0.1019293,0.0003941651,0.0006923603,0.0002718143,0.0008572193,0.000282692,0.02176819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004331235,"threshold_uncertainty_score":0.008800626,"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","authors":[{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839503,0.00089897,0.002509745,0.001321114,0.001268863,0.002357709,0.002756943,0.001837487,0.00281627],"category_scores_gemma":[0.02142861,0.001574471,0.0006220618,0.002104518,0.002624183,0.00357916,0.002230402,0.001375719,0.0003650674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003758959,"about_ca_system_score_gemma":0.00240443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005285484,"about_ca_topic_score_gemma":0.007254449,"domain_scores_codex":[0.9978022,0.0008663112,0.00009974043,0.0003697994,0.0004385523,0.0004233187],"domain_scores_gemma":[0.976877,0.01961066,0.001153888,0.001018214,0.000774616,0.0005655903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005058962,0.00007171193,0.0004094454,0.0002263569,0.00004327124,0.00005384042,0.0001678978,0.919899,0.001476081,0.05540874,0.002703675,0.01903406],"study_design_scores_gemma":[0.00009989125,0.00005412967,0.0001455368,0.0000136106,0.00002684242,0.00002802536,0.00004358252,0.9472029,0.000429946,0.05136624,0.0005757125,0.00001351556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.144238,0.002193143,0.8353878,0.002091766,0.0001810677,0.0001613425,0.0004174625,0.0007651385,0.01456419],"genre_scores_gemma":[0.9148328,0.001453938,0.07567897,0.0002374602,0.0002114153,0.0001924674,0.0003260451,0.0002117432,0.006855068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005285484,"threshold_uncertainty_score":0.02727324,"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","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004947437,0.001144834,0.002224059,0.001560033,0.001746246,0.002930306,0.003302854,0.003342548,0.001830673],"category_scores_gemma":[0.01923596,0.001040811,0.0008657154,0.001705477,0.004449083,0.006762413,0.004269706,0.002351875,0.00025103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001715246,"about_ca_system_score_gemma":0.001711676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001308423,"about_ca_topic_score_gemma":0.001353263,"domain_scores_codex":[0.9981604,0.00101625,0.00007370037,0.000263074,0.0002776113,0.000208985],"domain_scores_gemma":[0.9909146,0.006719633,0.0007891433,0.0007001975,0.0004401555,0.0004362835],"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.0006295367,0.0001177961,0.0004105656,0.0001467101,0.000123785,0.00008766325,0.000286559,0.6097395,0.001248091,0.3606811,0.002843355,0.0236853],"study_design_scores_gemma":[0.0000843727,0.00003835392,0.00003971746,0.00001609653,0.00002545422,0.00001945145,0.00004405811,0.8231792,0.0003759562,0.1755553,0.0006113939,0.00001073484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06756887,0.001115362,0.9222708,0.002111899,0.0001314955,0.0001080723,0.00004241544,0.0001920997,0.006458954],"genre_scores_gemma":[0.7533854,0.0009599434,0.2410101,0.0002981804,0.0001533916,0.0002469492,0.00005823137,0.0001225397,0.003765321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004947437,"threshold_uncertainty_score":0.02616489,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Adrian Kosowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337631,0.0005717441,0.00131302,0.0005386437,0.00240847,0.002044891,0.001879113,0.001929084,0.006696729],"category_scores_gemma":[0.01254202,0.0004763996,0.0005480371,0.001144963,0.002904287,0.007260653,0.003557068,0.002526334,0.001283942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000809992,"about_ca_system_score_gemma":0.000961769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005029136,"about_ca_topic_score_gemma":0.005290134,"domain_scores_codex":[0.9991515,0.0003298116,0.0000280438,0.0001722639,0.0001471189,0.0001714186],"domain_scores_gemma":[0.9953087,0.002655376,0.0001920213,0.001111378,0.0002667903,0.0004656976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001899159,0.0002342891,0.001879601,0.0002810437,0.00009777004,0.000578236,0.002069564,0.4001177,0.00633093,0.4220969,0.03509764,0.1293172],"study_design_scores_gemma":[0.00008884924,0.00005345644,0.0001864195,0.0000212484,0.00002385275,0.0001535723,0.0007218623,0.5786982,0.0024775,0.4119942,0.005550333,0.00003049559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2927701,0.001337389,0.6687254,0.008788339,0.0005333234,0.0001376068,0.0004042942,0.003363268,0.0239403],"genre_scores_gemma":[0.920525,0.000365096,0.06597112,0.0003279146,0.00008372366,0.00006762081,0.0002084418,0.0005681103,0.0118829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006696729,"threshold_uncertainty_score":0.02240282,"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","authors":[{"name":"Shantanu Das","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Nicola Santoro","is_ca":true},{"name":"Masafumi Yamashita","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005985481,0.0006026094,0.001001074,0.0007042409,0.0007983479,0.0008262084,0.001854909,0.0009867318,0.003440945],"category_scores_gemma":[0.003314691,0.0008231797,0.0006281958,0.001235663,0.00135244,0.001909721,0.002455776,0.0009987102,0.000727844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006277568,"about_ca_system_score_gemma":0.0007535969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732507,"about_ca_topic_score_gemma":0.00209608,"domain_scores_codex":[0.9993775,0.0001674474,0.00004340896,0.0001518247,0.0001785137,0.00008142512],"domain_scores_gemma":[0.9987249,0.0005185935,0.0002286758,0.0003058678,0.0001108234,0.0001110824],"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.0004329408,0.0001382973,0.001706532,0.0001867591,0.00005977618,0.0002024008,0.0005019716,0.7889013,0.01176979,0.07438716,0.001688209,0.1200249],"study_design_scores_gemma":[0.00006498057,0.0001967976,0.0002925712,0.00001878262,0.00001514347,0.0001115455,0.0001559777,0.9180307,0.006363535,0.07206865,0.002662597,0.0000186434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058434,0.0001098809,0.8894525,0.0001896353,0.00003942158,0.0001364452,0.00005610604,0.0004234236,0.003749228],"genre_scores_gemma":[0.6083172,0.0002059171,0.3822359,0.00009656754,0.00002643184,0.0003224644,0.000215107,0.0001483865,0.008432167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003440945,"threshold_uncertainty_score":0.01151109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050846431","doi":"10.1007/s00446-012-0168-6","title":"A framework for automated distributed implementation of component-based models","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Distributed computing; Asynchronous communication; Synchronizing; Component (thermodynamics); Implementation; POSIX Threads; Scheduling (production processes); Software deployment; Partition (number theory); Correctness; Distributed algorithm; Programming language; Thread (computing); Operating system; Computer network","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Marius Bozga","is_ca":false},{"name":"Mohamad Jaber","is_ca":false},{"name":"Jean Quilbeuf","is_ca":false},{"name":"Joseph Sifakis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03403358076798483,"gpt":0.326526578156011,"spread":0.2924929973880261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585039,0.001428249,0.0015088,0.00165883,0.001676029,0.005744028,0.005358757,0.002566513,0.007311522],"category_scores_gemma":[0.01195998,0.001717182,0.003014322,0.001417591,0.001779388,0.005850646,0.004876179,0.004208982,0.003026081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588075,"about_ca_system_score_gemma":0.003299807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006819891,"about_ca_topic_score_gemma":0.007800639,"domain_scores_codex":[0.9967591,0.0008425121,0.0003528747,0.0004119153,0.001390301,0.0002432271],"domain_scores_gemma":[0.9952034,0.001666213,0.0002477532,0.002014395,0.0006679595,0.0002004141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002124352,0.0003338236,0.001066458,0.0004549494,0.0002642461,0.0006290621,0.0008456874,0.1891944,0.009255807,0.5607356,0.01494914,0.2220584],"study_design_scores_gemma":[0.00008048161,0.00003983718,0.0001119102,0.0001009543,0.00009216954,0.0001517661,0.00006854282,0.7573336,0.005899902,0.1973237,0.03873728,0.00005984816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005344294,0.00003268714,0.9936199,0.00006162457,0.00001767662,0.00006946023,0.00004950729,0.004984434,0.0006302029],"genre_scores_gemma":[0.0375741,0.0001514863,0.9591058,0.00007182588,0.00003118758,0.0002761983,0.0004617183,0.001011969,0.001315656],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007311522,"threshold_uncertainty_score":0.02445948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067397086","doi":"10.1007/s00446-007-0042-0","title":"Anonymous and fault-tolerant shared-memory computing","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Identifier; Asynchronous communication; Object (grammar); Distributed computing; Shared memory; Theoretical computer science; Theory of computation; Parallel computing; Programming language; Computer network; Artificial intelligence","authors":[{"name":"Rachid Guerraoui","is_ca":false},{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069697413433289,"gpt":0.2478945046766815,"spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176801,0.0003022478,0.0006254021,0.000612196,0.001739087,0.002876005,0.001493636,0.001335305,0.002666078],"category_scores_gemma":[0.007782384,0.0003184434,0.0002901537,0.001238032,0.00218542,0.004790266,0.001805307,0.001361313,0.0005296899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008149726,"about_ca_system_score_gemma":0.0009549237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007916933,"about_ca_topic_score_gemma":0.0009625477,"domain_scores_codex":[0.9985121,0.0003495641,0.00007195456,0.0002018699,0.0006349516,0.0002296828],"domain_scores_gemma":[0.9957138,0.001955689,0.0003135123,0.001147755,0.0006426919,0.00022659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002397104,0.00007149788,0.0006165053,0.0001138382,0.00002473357,0.0002056089,0.0003614967,0.03987617,0.002370859,0.9024074,0.005995981,0.04771622],"study_design_scores_gemma":[0.00002773485,0.00002346069,0.0001678549,0.00001230144,0.00001907641,0.0001350922,0.00008104888,0.09005065,0.001974403,0.8945238,0.01296742,0.00001709108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1335546,0.005612809,0.8088734,0.005725837,0.001735941,0.00008498644,0.0001630101,0.001246797,0.04300249],"genre_scores_gemma":[0.9396695,0.001340344,0.03910671,0.0003474266,0.0007144848,0.00006588652,0.00008170788,0.00009122365,0.01858277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002876005,"threshold_uncertainty_score":0.008918941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Cyril Gavoille","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842328,0.0008321191,0.001824337,0.001530804,0.001372144,0.002378773,0.002179762,0.002136572,0.004930954],"category_scores_gemma":[0.04708641,0.0008454504,0.0009329546,0.001872014,0.002312885,0.003863544,0.002474108,0.003387084,0.0003631122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002881511,"about_ca_system_score_gemma":0.002324391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006059072,"about_ca_topic_score_gemma":0.004196071,"domain_scores_codex":[0.9966708,0.001634444,0.0000792048,0.0004321102,0.0007461088,0.0004372747],"domain_scores_gemma":[0.9569213,0.03628909,0.00103809,0.003133386,0.001787023,0.0008311703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006632699,0.0002783809,0.001704994,0.0002544622,0.00008965328,0.0002188918,0.0003518576,0.6188512,0.003667652,0.3045048,0.0112994,0.05811546],"study_design_scores_gemma":[0.00002981724,0.00002115182,0.0001744954,0.00001172002,0.00002122709,0.00004540581,0.00002762809,0.836578,0.0009063092,0.1614092,0.0007644597,0.00001050042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1536035,0.001391447,0.8101708,0.004263989,0.0003919196,0.0001719766,0.0002563341,0.001515963,0.02823412],"genre_scores_gemma":[0.9344736,0.0006017674,0.05854094,0.0005559204,0.0002303262,0.00009822717,0.0001181998,0.000308409,0.005072545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006059072,"threshold_uncertainty_score":0.02090693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Sam Toueg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01483399648761171,"gpt":0.2609815734317931,"spread":0.2461475769441814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920202,0.0009542321,0.001647534,0.0008933588,0.002108856,0.002663313,0.003421101,0.002824713,0.008006364],"category_scores_gemma":[0.02077135,0.0007901814,0.001295379,0.001021098,0.003842969,0.005296099,0.005183544,0.004001971,0.002253528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0020653,"about_ca_system_score_gemma":0.004384436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002173639,"about_ca_topic_score_gemma":0.001574627,"domain_scores_codex":[0.992301,0.002952337,0.0003320232,0.001209593,0.002281186,0.0009239303],"domain_scores_gemma":[0.9887263,0.005020905,0.0004345564,0.00305802,0.002440033,0.0003201634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006743628,0.00009498098,0.0005174791,0.0002727966,0.0001159656,0.0001754846,0.000390482,0.05986957,0.005868649,0.8716545,0.01360328,0.04676249],"study_design_scores_gemma":[0.0003957047,0.0001143064,0.0002524887,0.0000726853,0.00007667776,0.0001210629,0.0001220543,0.3414288,0.009413559,0.6332886,0.01463751,0.00007654683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02979471,0.0005943167,0.9173594,0.005831168,0.0008842833,0.0002594176,0.0002724879,0.001608322,0.04339584],"genre_scores_gemma":[0.7462149,0.0007108263,0.2255464,0.002538193,0.0005460829,0.000544195,0.0005698665,0.00063495,0.0226946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008006364,"threshold_uncertainty_score":0.03130937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133718851","doi":"10.1007/s00446-008-0068-y","title":"On implementing omega in systems with weak reliability and synchrony assumptions","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lossy compression; Reliability (semiconductor); Computer science; Process (computing); Crash; Core (optical fiber); Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Carole Delporte-Gallet","is_ca":false},{"name":"Hugues Fauconnier","is_ca":false},{"name":"Sam Toueg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01336803634467652,"gpt":0.239738238464348,"spread":0.2263702021196715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009005548,0.001049995,0.001418074,0.0008619538,0.001774014,0.00268388,0.00231568,0.001827276,0.00432013],"category_scores_gemma":[0.03291757,0.0008485015,0.0009474163,0.001085675,0.003906088,0.01272799,0.006934017,0.004710176,0.0008948735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001340715,"about_ca_system_score_gemma":0.00193694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789877,"about_ca_topic_score_gemma":0.001594656,"domain_scores_codex":[0.9955124,0.001665124,0.000336262,0.000383143,0.001275721,0.0008273099],"domain_scores_gemma":[0.9703481,0.01958378,0.001085778,0.006479405,0.001932618,0.000570446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001267342,0.0002155934,0.002765789,0.000258017,0.00006202164,0.000220367,0.001292124,0.1030945,0.006328263,0.763335,0.004111777,0.1170492],"study_design_scores_gemma":[0.0001219853,0.0002232865,0.0002342229,0.00005559176,0.00006544172,0.0000837117,0.0003135777,0.3605182,0.007744813,0.6262851,0.004319922,0.00003418976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06934384,0.0002547417,0.9173099,0.001676543,0.0001353951,0.0001037616,0.00003912962,0.001298693,0.009838074],"genre_scores_gemma":[0.7560529,0.0006133417,0.2312006,0.0007152128,0.0001823797,0.0003508464,0.0001571775,0.0005594593,0.01016804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009005548,"threshold_uncertainty_score":0.04762644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Linda Pagli","is_ca":false},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Giovanni Viglietta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264209,0.0006475769,0.0009599339,0.0003884214,0.00130642,0.0009710107,0.001257983,0.001495842,0.002106453],"category_scores_gemma":[0.002857773,0.0004642514,0.0005523699,0.0005959864,0.001116695,0.002549549,0.002736126,0.00118617,0.0004137785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003250334,"about_ca_system_score_gemma":0.0004888489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001994157,"about_ca_topic_score_gemma":0.001931023,"domain_scores_codex":[0.9997482,0.00006358919,0.00001055455,0.00006740099,0.00006809535,0.00004214931],"domain_scores_gemma":[0.9992908,0.0003849088,0.00006778797,0.00008529918,0.00006629784,0.0001048411],"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.0005542605,0.0002549534,0.001152343,0.0002654881,0.00006698508,0.000462468,0.0008112345,0.7618486,0.01210929,0.04209102,0.00607003,0.1743134],"study_design_scores_gemma":[0.00001533483,0.00009258155,0.0001783824,0.000008438336,0.00001408922,0.00009603282,0.0001131548,0.9614931,0.0009586627,0.03605548,0.0009626026,0.00001222342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158875,0.0007740333,0.8753353,0.0005601909,0.0001405892,0.00005686167,0.00005112401,0.0003699601,0.006824409],"genre_scores_gemma":[0.8567005,0.0005849194,0.1346851,0.0001333991,0.0001090896,0.00007864359,0.0001035599,0.0001675634,0.007437288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002106453,"threshold_uncertainty_score":0.007046819,"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","authors":[{"name":"Faith Ellen","is_ca":true},{"name":"Panagiota Fatourou","is_ca":false},{"name":"Eleftherios Kosmas","is_ca":false},{"name":"Alessia Milani","is_ca":false},{"name":"Corentin Travers","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006261159,0.001342862,0.002514919,0.001455763,0.004901464,0.005312399,0.003753002,0.002613401,0.00666745],"category_scores_gemma":[0.02623344,0.002238306,0.002673709,0.002689329,0.009840058,0.01695075,0.01703569,0.009264467,0.001672999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002407887,"about_ca_system_score_gemma":0.003405311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009090218,"about_ca_topic_score_gemma":0.001162095,"domain_scores_codex":[0.9922509,0.001446018,0.0006252603,0.001738442,0.001812854,0.00212661],"domain_scores_gemma":[0.9702324,0.01182264,0.001526671,0.01283769,0.001789088,0.001791463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001190909,0.00005277071,0.0002315183,0.00008077504,0.00001807242,0.00004306663,0.0004800253,0.002246739,0.001767082,0.9834238,0.001677751,0.009859366],"study_design_scores_gemma":[0.00006581372,0.00003061682,0.00008883781,0.0000357705,0.00006762485,0.00006864834,0.00008991758,0.009442411,0.005140097,0.9791527,0.005775709,0.00004181332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04724572,0.0003495073,0.9295985,0.001301153,0.0002861,0.0001551398,0.0002268616,0.003793714,0.01704345],"genre_scores_gemma":[0.7870108,0.0004612867,0.1977201,0.001360983,0.0003691289,0.0005091628,0.0003562807,0.002016015,0.01019623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00666745,"threshold_uncertainty_score":0.03311253,"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","authors":[{"name":"Giuseppe Di Luna","is_ca":true},{"name":"Stefan Dobrev","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124683,0.0003591917,0.00116003,0.0005973892,0.0008981883,0.001382653,0.001151132,0.0008283199,0.00356863],"category_scores_gemma":[0.00549112,0.0004484383,0.0005948634,0.0006931551,0.001261577,0.002258141,0.00244778,0.0009025898,0.0002505434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007070033,"about_ca_system_score_gemma":0.0008804943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009925124,"about_ca_topic_score_gemma":0.00102861,"domain_scores_codex":[0.9994162,0.0002445227,0.00001750025,0.0001042149,0.0001041772,0.0001134349],"domain_scores_gemma":[0.9976428,0.001545811,0.0001529576,0.0002969094,0.0001687805,0.0001927428],"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.0005139653,0.0001003168,0.0009190438,0.0001039313,0.00005747591,0.0001229608,0.0001854167,0.7972136,0.003291239,0.1650093,0.0015905,0.0308923],"study_design_scores_gemma":[0.00003145696,0.00003918796,0.00007892094,0.00000539029,0.00000871827,0.00002794645,0.00003019479,0.9472394,0.0004281111,0.05131426,0.0007910903,0.000005284132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2511045,0.001053022,0.7323618,0.0007278529,0.00009891801,0.00007095971,0.00007559379,0.0003415589,0.01416581],"genre_scores_gemma":[0.9476522,0.0002788914,0.04452195,0.00005295444,0.00003857544,0.00007601842,0.00005102604,0.00006355994,0.007264754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00356863,"threshold_uncertainty_score":0.01193821,"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","authors":[{"name":"Yuval Emek","is_ca":false},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Erez Kantor","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false},{"name":"Chang Su","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712863,0.0004580818,0.001491335,0.001517956,0.001720665,0.002560665,0.001529571,0.00143765,0.001526108],"category_scores_gemma":[0.01172554,0.0008224827,0.0003900145,0.002718091,0.001690313,0.002654061,0.001895876,0.0009624203,0.0003190323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002352499,"about_ca_system_score_gemma":0.001069238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009406949,"about_ca_topic_score_gemma":0.009061621,"domain_scores_codex":[0.998854,0.0004917595,0.00004418219,0.000163756,0.0002276834,0.0002185715],"domain_scores_gemma":[0.9919769,0.006102434,0.0005304547,0.0004695776,0.0006816797,0.0002388318],"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.0006029278,0.00008774953,0.00236117,0.0003155961,0.0000602293,0.000545219,0.0008925603,0.7654147,0.005599092,0.1681242,0.004456605,0.05153992],"study_design_scores_gemma":[0.00002375602,0.00002651577,0.00020279,0.00001341964,0.00002354379,0.00007370332,0.0001300718,0.9680011,0.0007508323,0.02988655,0.000856455,0.00001115246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2456824,0.002942683,0.7356347,0.001729894,0.0001870873,0.000139411,0.0002839021,0.0007224067,0.01267751],"genre_scores_gemma":[0.9549881,0.001455084,0.03732956,0.0001564892,0.0001355837,0.00009424642,0.0001626852,0.00009000384,0.005588265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009406949,"threshold_uncertainty_score":0.01870441,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Jan Pachl","is_ca":true},{"name":"Irwin S. Pressman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00355649,0.001168609,0.002965158,0.001225172,0.001505602,0.002600981,0.002607567,0.003205569,0.003711203],"category_scores_gemma":[0.01716458,0.001190048,0.0006323179,0.001815147,0.00196043,0.005682991,0.00183982,0.001119719,0.0006779543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001856863,"about_ca_system_score_gemma":0.002722177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003355413,"about_ca_topic_score_gemma":0.004644971,"domain_scores_codex":[0.9982547,0.0008120571,0.0001264027,0.0003308504,0.0001949045,0.0002811074],"domain_scores_gemma":[0.9907444,0.006297998,0.0007494726,0.0009182171,0.0007130801,0.0005767577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001953335,0.000234244,0.001723279,0.0003687256,0.00009132398,0.0001996861,0.0002427867,0.9055181,0.006151845,0.02896929,0.004886084,0.04966129],"study_design_scores_gemma":[0.0001549518,0.0001055454,0.0002361512,0.00001594958,0.00003778905,0.00005622921,0.0001461934,0.9763001,0.002300446,0.02023035,0.0003957146,0.00002056472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315156,0.001899949,0.669498,0.003584258,0.0002926263,0.0004138192,0.0005159753,0.001127659,0.00751169],"genre_scores_gemma":[0.8684052,0.0004542724,0.1268047,0.0001556628,0.00009730137,0.0001500257,0.0001485712,0.000153114,0.003631143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003711203,"threshold_uncertainty_score":0.01880872,"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","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Mika Göös","is_ca":true},{"name":"Amos Korman","is_ca":false},{"name":"Merav Parter","is_ca":false},{"name":"David Peleg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006929921,0.001587821,0.00364951,0.001357345,0.002529901,0.004596557,0.004717937,0.003124089,0.02744792],"category_scores_gemma":[0.03100004,0.001033515,0.001633107,0.003039888,0.003290397,0.007898296,0.005018621,0.005014098,0.003577094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004760454,"about_ca_system_score_gemma":0.007504612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002174836,"about_ca_topic_score_gemma":0.003647073,"domain_scores_codex":[0.9876695,0.005445566,0.0004142048,0.003123315,0.001822598,0.00152481],"domain_scores_gemma":[0.9682064,0.02103926,0.001063762,0.006444219,0.001852606,0.001393688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003039698,0.001277253,0.001598465,0.0005762052,0.000222376,0.0001638105,0.0001974523,0.1791439,0.001835035,0.5845543,0.08356836,0.1438231],"study_design_scores_gemma":[0.0004885283,0.0001375148,0.0002391638,0.00003616578,0.00005626721,0.00007371391,0.0000473354,0.5904188,0.0009524744,0.4018513,0.005668465,0.00003024711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04335401,0.001511974,0.9032078,0.008407327,0.001207006,0.0007767814,0.001665476,0.002039048,0.03783075],"genre_scores_gemma":[0.7315632,0.0008711798,0.2175908,0.002496977,0.001778475,0.001246748,0.002451388,0.0005984562,0.04140281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02744792,"threshold_uncertainty_score":0.09182239,"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","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Sandeep S. Kulkarni","is_ca":false},{"name":"Fuad Abujarad","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281688,0.0003932232,0.0003701076,0.0003033815,0.0004052826,0.000695048,0.000641646,0.0004702054,0.003706527],"category_scores_gemma":[0.001795922,0.0002030481,0.000293693,0.0002750407,0.0005719166,0.000541289,0.0006515274,0.0006066279,0.0003226419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005874307,"about_ca_system_score_gemma":0.0008030449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008568236,"about_ca_topic_score_gemma":0.001246976,"domain_scores_codex":[0.9997118,0.00006928155,0.00001475745,0.00003521575,0.0001204271,0.00004835424],"domain_scores_gemma":[0.9994081,0.0003217541,0.00005678777,0.000106133,0.00008038245,0.00002680344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004583012,0.0001173938,0.0005887593,0.000277675,0.00003640682,0.000310884,0.0003797978,0.5209579,0.06162677,0.3166982,0.001717147,0.09683084],"study_design_scores_gemma":[0.00009082784,0.0001001051,0.00009047839,0.00002727836,0.00003062729,0.00005026184,0.00003507427,0.8900952,0.02970329,0.07555492,0.004210723,0.00001120219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1493599,0.0002054832,0.8290407,0.000313958,0.0001167718,0.00005721216,0.0000814,0.001930827,0.01889373],"genre_scores_gemma":[0.9144051,0.0001058711,0.08239056,0.00005466737,0.00001776115,0.00005865181,0.00007811211,0.0001338737,0.002755341],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003706527,"threshold_uncertainty_score":0.01239955,"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","authors":[{"name":"James Aspnes","is_ca":false},{"name":"Faith E. Fich","is_ca":true},{"name":"Eric Ruppert","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005400278,0.0004309186,0.001064134,0.001873984,0.00294865,0.00614255,0.002115626,0.002498858,0.006443531],"category_scores_gemma":[0.06128152,0.001075285,0.0004470682,0.002829255,0.004918782,0.01556091,0.003034099,0.003130679,0.0006692082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961997,"about_ca_system_score_gemma":0.001548168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103733,"about_ca_topic_score_gemma":0.00165786,"domain_scores_codex":[0.9958971,0.002116637,0.0002088112,0.000461338,0.0009607723,0.0003553956],"domain_scores_gemma":[0.9199609,0.066146,0.004932876,0.00415566,0.003632027,0.001172572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000408078,0.0000685193,0.001314987,0.0001447647,0.00002739866,0.0001333638,0.001302774,0.01525289,0.0005171849,0.9557678,0.002746441,0.02231572],"study_design_scores_gemma":[0.00008149913,0.00006106739,0.0004607906,0.00004155928,0.000073739,0.0001719203,0.0004021144,0.05822583,0.0007780864,0.9335372,0.00613647,0.00002961024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563055,0.01210598,0.6617668,0.009982339,0.0005374189,0.0001644634,0.0004088974,0.0007699408,0.05795867],"genre_scores_gemma":[0.9611552,0.00216449,0.02750044,0.0003127855,0.0006068801,0.0001477817,0.000152581,0.0001572096,0.007802579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006443531,"threshold_uncertainty_score":0.0285598,"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","authors":[{"name":"Wojciech Golab","is_ca":true},{"name":"Aditya Ramaraju","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785119,0.0006368649,0.0007390262,0.0007813538,0.001842118,0.001910328,0.001714018,0.00109601,0.01539214],"category_scores_gemma":[0.004735625,0.000305635,0.000531978,0.0008178646,0.001357725,0.00265173,0.003309251,0.002191293,0.003378454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008221579,"about_ca_system_score_gemma":0.001524783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008948134,"about_ca_topic_score_gemma":0.001271349,"domain_scores_codex":[0.9981785,0.0003407806,0.00007670682,0.0003108965,0.0007680978,0.0003249928],"domain_scores_gemma":[0.9971469,0.0007111801,0.0002265766,0.001311449,0.0004518738,0.0001520734],"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.0005778627,0.0001847026,0.0004402446,0.0002575895,0.00004942993,0.0003421047,0.0003973017,0.03162323,0.013718,0.7445378,0.0304947,0.1773771],"study_design_scores_gemma":[0.0001102501,0.0001608234,0.0003892756,0.00007295643,0.00005697751,0.0004813343,0.0001473094,0.1713689,0.02311789,0.6968248,0.1072072,0.00006232473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03563436,0.00150213,0.8284402,0.00213374,0.000905887,0.000344853,0.0006598368,0.006467965,0.1239111],"genre_scores_gemma":[0.7651868,0.001133188,0.1347517,0.0008269132,0.0005079585,0.000389894,0.001670674,0.0008577951,0.09467502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01539214,"threshold_uncertainty_score":0.05149186,"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","authors":[{"name":"Wojciech Golab","is_ca":false},{"name":"Vassos Hadzilacos","is_ca":true},{"name":"Danny Hendler","is_ca":false},{"name":"Philipp Woelfel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088679,0.001682087,0.00183363,0.001896747,0.001417317,0.003755416,0.005996076,0.00171299,0.01990307],"category_scores_gemma":[0.01138543,0.001385556,0.001006345,0.003001766,0.001399044,0.007983651,0.003385786,0.002203389,0.007874102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948413,"about_ca_system_score_gemma":0.002370399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00124292,"about_ca_topic_score_gemma":0.002592724,"domain_scores_codex":[0.9936962,0.001956582,0.0005851079,0.0008531021,0.002071438,0.0008375931],"domain_scores_gemma":[0.9878127,0.003187015,0.0008175625,0.006465895,0.001411275,0.0003055413],"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.004019241,0.000687263,0.001773539,0.0008883213,0.0001923349,0.0003878738,0.0005828799,0.02090024,0.09978031,0.1152575,0.04372182,0.7118086],"study_design_scores_gemma":[0.001653821,0.001083805,0.001731001,0.0002345636,0.0003284221,0.001003948,0.0003923061,0.5037284,0.3096986,0.117695,0.06204768,0.0004024483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05261527,0.001535063,0.8782443,0.0004771105,0.0004490906,0.000362651,0.0005490288,0.05053958,0.01522793],"genre_scores_gemma":[0.3988683,0.0003351977,0.5772398,0.0004629607,0.0002674249,0.0005119728,0.001342167,0.004219066,0.01675312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01990307,"threshold_uncertainty_score":0.06658238,"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","authors":[{"name":"Robert M. Hierons","is_ca":false},{"name":"Hasan Ural","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006253239,0.001349767,0.001109196,0.002396588,0.00123711,0.002092357,0.002944747,0.002162492,0.005696523],"category_scores_gemma":[0.03713331,0.0009888442,0.001277106,0.001374195,0.002405126,0.004468919,0.00258177,0.001960818,0.0008394103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001680812,"about_ca_system_score_gemma":0.003154975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003536064,"about_ca_topic_score_gemma":0.006391599,"domain_scores_codex":[0.9921378,0.003173489,0.0007053586,0.001067894,0.0021293,0.0007861726],"domain_scores_gemma":[0.924105,0.05696542,0.003974479,0.008504717,0.00527409,0.001176144],"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.004748357,0.00134845,0.03014487,0.00121608,0.0003158542,0.001956325,0.001988355,0.2190951,0.04073011,0.2698539,0.01332081,0.4152817],"study_design_scores_gemma":[0.0004750743,0.0005504891,0.001797886,0.0002135269,0.0002060461,0.000448917,0.0002448487,0.6217657,0.04881046,0.3201542,0.005239173,0.0000935432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1718159,0.0002437488,0.8127167,0.0005973174,0.00009616583,0.0003240345,0.0004602565,0.009521416,0.004224446],"genre_scores_gemma":[0.7227802,0.000100455,0.2713146,0.0002482076,0.00004707689,0.000263049,0.001082877,0.0008613068,0.003302364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006253239,"threshold_uncertainty_score":0.03307068,"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","authors":[{"name":"Emanuele G. Fusco","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009947054,0.000427111,0.0009296086,0.0006105321,0.0013649,0.002628871,0.001105606,0.001088965,0.01651865],"category_scores_gemma":[0.01115943,0.0004891425,0.0004567661,0.0005647711,0.0007045245,0.007838663,0.001107802,0.001135584,0.003495852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000694736,"about_ca_system_score_gemma":0.00153889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001527238,"about_ca_topic_score_gemma":0.003477034,"domain_scores_codex":[0.9987977,0.0002841147,0.00007843652,0.0002310993,0.0002207879,0.0003879415],"domain_scores_gemma":[0.9942183,0.00257516,0.000372022,0.001622907,0.000780017,0.0004315132],"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.005840114,0.0005080726,0.01513906,0.00137937,0.0003691783,0.0006143629,0.0009231056,0.0902732,0.1061427,0.07322182,0.0361659,0.669423],"study_design_scores_gemma":[0.0008870071,0.001127893,0.01238375,0.0003356898,0.0007790317,0.001410932,0.003201692,0.5720394,0.1544921,0.2074883,0.0456253,0.0002289045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5895717,0.008946066,0.3056702,0.01791267,0.003504581,0.0002289388,0.001307233,0.005579461,0.06727925],"genre_scores_gemma":[0.9756511,0.0005039293,0.01462042,0.0003701645,0.0002243008,0.00005671828,0.0002319666,0.0002803334,0.008061062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01651865,"threshold_uncertainty_score":0.05526042,"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","authors":[{"name":"Dariusz Dereniowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142483,0.0004390535,0.0005728916,0.0006115921,0.00105014,0.001065164,0.001155983,0.0008257456,0.001322384],"category_scores_gemma":[0.005366917,0.0002404979,0.0003597171,0.0008263691,0.001225777,0.001539201,0.001342255,0.0006417539,0.0002331817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007618911,"about_ca_system_score_gemma":0.0005650648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001497088,"about_ca_topic_score_gemma":0.001514052,"domain_scores_codex":[0.9992908,0.000323962,0.00002223345,0.0001313947,0.0001177268,0.0001137921],"domain_scores_gemma":[0.99803,0.001263348,0.0002939264,0.0001234013,0.0001538744,0.0001353834],"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.0001217111,0.00004084484,0.000577323,0.00004992916,0.00001650457,0.0001840504,0.0001741556,0.8496106,0.001362131,0.135032,0.0009196191,0.01191113],"study_design_scores_gemma":[0.00002039098,0.00002068394,0.00007138532,0.000003212503,0.000004312687,0.00001864089,0.00004631122,0.9446194,0.0003740373,0.05416926,0.0006479604,0.000004489594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1283112,0.0002204045,0.8624864,0.0004714344,0.00004526392,0.00006692681,0.00006613718,0.0001742237,0.00815806],"genre_scores_gemma":[0.9214944,0.0002843867,0.07271769,0.00005928736,0.00004560653,0.000121286,0.00008813747,0.00003802752,0.005151123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001497088,"threshold_uncertainty_score":0.006042123,"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","authors":[{"name":"Robert Danek","is_ca":true},{"name":"Wojciech Golab","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004631169,0.0007277518,0.001650971,0.001026412,0.002578016,0.005187476,0.002765178,0.002845907,0.006044928],"category_scores_gemma":[0.02855426,0.0006979965,0.001228112,0.001593582,0.005526633,0.02125068,0.007254755,0.006435995,0.000745485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003752954,"about_ca_system_score_gemma":0.004065422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003059976,"about_ca_topic_score_gemma":0.002132238,"domain_scores_codex":[0.9919761,0.002147889,0.0002746464,0.000755275,0.004085675,0.0007604297],"domain_scores_gemma":[0.9604365,0.02919187,0.001198633,0.006360447,0.001945417,0.0008671447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004144782,0.00008642584,0.000665582,0.0002076466,0.0000473236,0.0001020525,0.0005296917,0.04012436,0.00161715,0.8994859,0.004850097,0.05186936],"study_design_scores_gemma":[0.00005913375,0.00004485387,0.0002860832,0.00003767246,0.00002646558,0.0001321295,0.0001182978,0.1301836,0.001741239,0.8554233,0.01191676,0.00003038663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07617928,0.003789555,0.8651083,0.01736369,0.0008324564,0.0001161423,0.0002064144,0.0007784577,0.03562574],"genre_scores_gemma":[0.8504859,0.002317554,0.1344388,0.001728239,0.001760693,0.0002475568,0.000249118,0.0004022664,0.00837002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006044928,"threshold_uncertainty_score":0.02722967,"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","authors":[{"name":"Alex Brodsky","is_ca":true},{"name":"Faith Ellen","is_ca":true},{"name":"Philipp Woelfel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003037067,0.0008178732,0.001547263,0.0007406835,0.001522287,0.002060833,0.004189156,0.00165414,0.005436555],"category_scores_gemma":[0.01453017,0.0006078042,0.0006207082,0.001094765,0.001609531,0.006153566,0.004841792,0.002389903,0.001008954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001025507,"about_ca_system_score_gemma":0.001593803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002471926,"about_ca_topic_score_gemma":0.003271628,"domain_scores_codex":[0.9975817,0.0007209286,0.0001944183,0.000514978,0.0005782907,0.000409599],"domain_scores_gemma":[0.9911531,0.003600619,0.0004187059,0.003359674,0.001108197,0.0003597582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001265876,0.0002971673,0.001569972,0.0002057995,0.0001287183,0.0001282506,0.0005997025,0.4181314,0.01107914,0.1991756,0.00750439,0.359914],"study_design_scores_gemma":[0.00005989211,0.00006046418,0.00009678665,0.00001078951,0.00001763976,0.00005280689,0.00004527703,0.9244851,0.002022824,0.071188,0.001934319,0.00002600182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01867239,0.0003467579,0.9777866,0.0001571429,0.0001193912,0.00005612353,0.00003437162,0.001062651,0.001764551],"genre_scores_gemma":[0.5392501,0.0003240623,0.4506724,0.0002334122,0.0001333098,0.0002327418,0.0002244085,0.0003981698,0.008531333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005436555,"threshold_uncertainty_score":0.01818717,"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","authors":[{"name":"Danny Hendler","is_ca":false},{"name":"Philipp Woelfel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009906407,0.002899646,0.005257669,0.001552554,0.003216957,0.006601159,0.008274031,0.005704552,0.02480879],"category_scores_gemma":[0.05285151,0.001632937,0.002877981,0.002824116,0.005757574,0.01661447,0.01035043,0.009440579,0.005777047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00745204,"about_ca_system_score_gemma":0.01001778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00208921,"about_ca_topic_score_gemma":0.004007456,"domain_scores_codex":[0.9792486,0.008853491,0.0007828613,0.002983124,0.004895264,0.003236647],"domain_scores_gemma":[0.9077522,0.06656636,0.002656271,0.01846665,0.002123937,0.002434576],"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.007560364,0.001817538,0.002598921,0.001342712,0.0004013607,0.0003731479,0.0006372533,0.3121388,0.01263346,0.4311673,0.0578946,0.1714346],"study_design_scores_gemma":[0.0009563423,0.0002216436,0.0003793343,0.00004705953,0.0001270591,0.0001909504,0.00007596584,0.5696833,0.003638468,0.4211941,0.003414121,0.00007168369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09079266,0.002639833,0.8145105,0.02215314,0.001067053,0.0008701934,0.002345877,0.01061495,0.05500576],"genre_scores_gemma":[0.7887092,0.0008686402,0.1781666,0.003545326,0.001296758,0.001508068,0.001678767,0.00201053,0.02221602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02480879,"threshold_uncertainty_score":0.08299369,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Paz Carmi","is_ca":false},{"name":"Stéphane Durocher","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008003347,0.0008020556,0.002270128,0.002214291,0.002230418,0.003123683,0.0037077,0.002841071,0.002088577],"category_scores_gemma":[0.06333081,0.001017513,0.0007505124,0.002566535,0.004282678,0.008459055,0.006230128,0.003264179,0.0004707647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002948495,"about_ca_system_score_gemma":0.002204258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002176788,"about_ca_topic_score_gemma":0.002083359,"domain_scores_codex":[0.9899555,0.004897049,0.0003275739,0.001396075,0.002583446,0.0008403225],"domain_scores_gemma":[0.893239,0.08628561,0.004410473,0.01019388,0.004240687,0.001630386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008203935,0.0002431828,0.006019201,0.000411209,0.0001585162,0.0001930059,0.0006716617,0.6006088,0.008165318,0.3267012,0.005622089,0.05038544],"study_design_scores_gemma":[0.00003715072,0.00006984924,0.0003727352,0.00002079886,0.00002926792,0.00006529313,0.00007382999,0.8657991,0.00175338,0.1303283,0.001434197,0.00001618682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1317197,0.003089936,0.8486084,0.003873344,0.0002158625,0.0001019019,0.0001900201,0.001218869,0.01098194],"genre_scores_gemma":[0.9084959,0.0008130398,0.08700293,0.0003158364,0.0003175649,0.0001867443,0.0001870083,0.0003019728,0.002379029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008003347,"threshold_uncertainty_score":0.04232621,"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","authors":[{"name":"Faith Ellen","is_ca":true},{"name":"Panagiota Fatourou","is_ca":false},{"name":"Eric Ruppert","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006636223,0.0009652716,0.002717498,0.002504025,0.002981099,0.009302873,0.003541145,0.003363438,0.008728581],"category_scores_gemma":[0.06823652,0.001473183,0.001709057,0.005500683,0.006676571,0.03604212,0.00579669,0.006898002,0.001113109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00400933,"about_ca_system_score_gemma":0.003349597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002691903,"about_ca_topic_score_gemma":0.001621615,"domain_scores_codex":[0.9907535,0.002838008,0.0005899339,0.001055256,0.003502332,0.001260944],"domain_scores_gemma":[0.8841103,0.09396911,0.005051635,0.01136503,0.003205412,0.002298479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005676594,0.00006720379,0.001548343,0.000197593,0.00004896025,0.0001842553,0.0005070518,0.07796781,0.001112408,0.8905435,0.007042246,0.02021302],"study_design_scores_gemma":[0.00004878522,0.00001938228,0.0001867961,0.00002314911,0.00002516505,0.00008798986,0.00007883908,0.1029088,0.0004561916,0.8947146,0.001428607,0.00002163382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3620284,0.007801481,0.5494653,0.03039823,0.0008589542,0.0001323064,0.002537496,0.00144249,0.04533524],"genre_scores_gemma":[0.952192,0.002824814,0.03435052,0.0007305803,0.001147881,0.0001562531,0.0007243268,0.0004005486,0.007472984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009302873,"threshold_uncertainty_score":0.03509611,"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","authors":[{"name":"Hirozumi Yamaguchi","is_ca":false},{"name":"Khaled El‐Fakih","is_ca":false},{"name":"Gregor von Bochmann","is_ca":true},{"name":"Teruo Higashino","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441405,0.0007513733,0.0008376162,0.0006599966,0.000620516,0.001106444,0.001201341,0.0005579314,0.002471747],"category_scores_gemma":[0.002131758,0.0004488867,0.0008360067,0.0005974959,0.000945193,0.001230394,0.0009896057,0.0009519319,0.0003013211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008589399,"about_ca_system_score_gemma":0.001531654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700151,"about_ca_topic_score_gemma":0.002736803,"domain_scores_codex":[0.9989759,0.0002685845,0.00009317011,0.0002058985,0.0003034648,0.0001530746],"domain_scores_gemma":[0.9989334,0.0004719072,0.00008411019,0.0002750995,0.000189704,0.00004584288],"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.0003979822,0.0001292909,0.0004461773,0.0002523266,0.00009270149,0.0003853421,0.0001904049,0.7017057,0.0535349,0.1149351,0.0008952264,0.1270349],"study_design_scores_gemma":[0.00006482099,0.00006446159,0.0001012624,0.00001847749,0.00006420942,0.00006221995,0.000028316,0.9261894,0.0284674,0.04230118,0.002618342,0.00002005383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01850375,0.0001170861,0.9771696,0.00007511893,0.0000566876,0.0001041735,0.00002899934,0.000672359,0.003272315],"genre_scores_gemma":[0.5125995,0.0002376796,0.4831996,0.00007388459,0.00002790997,0.000352636,0.0001149836,0.0001801313,0.003213666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002471747,"threshold_uncertainty_score":0.008268833,"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","authors":[{"name":"Varsha Dani","is_ca":false},{"name":"Valerie King","is_ca":true},{"name":"Mahnush Movahedi","is_ca":false},{"name":"Jared Saia","is_ca":false},{"name":"Mahdi Zamani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004331241,0.0005143351,0.001119282,0.0007085679,0.001673935,0.002925932,0.001238896,0.001434228,0.002696089],"category_scores_gemma":[0.01330685,0.0006061664,0.0004812014,0.001242141,0.002649223,0.006094757,0.003820467,0.002832748,0.0007258049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144804,"about_ca_system_score_gemma":0.001180804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004141552,"about_ca_topic_score_gemma":0.0006011379,"domain_scores_codex":[0.9960479,0.001714978,0.0002229575,0.0004120373,0.001270018,0.000332091],"domain_scores_gemma":[0.9869039,0.008218803,0.0006475733,0.003406185,0.0005034608,0.0003201767],"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.00085955,0.0001641373,0.00132036,0.0002740836,0.00007855255,0.0003652848,0.0003553989,0.3086933,0.01069212,0.5884505,0.004713621,0.0840332],"study_design_scores_gemma":[0.00005248529,0.00003017932,0.0001591762,0.00001431765,0.00001389268,0.00007405884,0.00003604456,0.6604809,0.003504924,0.3329959,0.002628034,0.0000100963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06454403,0.001043197,0.9246077,0.002406449,0.0001646031,0.00009417348,0.00007102935,0.000514693,0.006554221],"genre_scores_gemma":[0.9157827,0.0006869574,0.07572972,0.000151495,0.0001861193,0.0001588419,0.00009696493,0.00009701932,0.007110169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004331241,"threshold_uncertainty_score":0.02290606,"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","authors":[{"name":"Dan Holtby","is_ca":true},{"name":"Bruce M. Kapron","is_ca":true},{"name":"Valerie King","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01237664,0.003858949,0.006260192,0.003341338,0.006522413,0.01034369,0.009901251,0.005197372,0.02906808],"category_scores_gemma":[0.04960419,0.001677825,0.002378206,0.005768336,0.0052918,0.02610046,0.01337742,0.01328741,0.006193316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007163005,"about_ca_system_score_gemma":0.009600716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003151412,"about_ca_topic_score_gemma":0.004814119,"domain_scores_codex":[0.9851075,0.002831099,0.0005373533,0.001950132,0.006178004,0.00339595],"domain_scores_gemma":[0.9471688,0.03472018,0.00173221,0.01030394,0.003782459,0.002292474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002637557,0.0005048899,0.0009802984,0.0009901389,0.0002311147,0.0002132548,0.0007869541,0.1273451,0.006403559,0.7350034,0.05452098,0.07038272],"study_design_scores_gemma":[0.0002261168,0.000155097,0.0002231847,0.00009743672,0.0001137019,0.00009399379,0.0001202788,0.2900317,0.002388302,0.7004599,0.006042546,0.000047727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06011786,0.004335816,0.8134137,0.01649726,0.001570881,0.0006397493,0.002394816,0.006090998,0.09493899],"genre_scores_gemma":[0.7645482,0.003193957,0.1790758,0.003288412,0.002010622,0.001607113,0.003445656,0.002893444,0.0399368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02906808,"threshold_uncertainty_score":0.09724241,"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","authors":[{"name":"Avery Miller","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005255019,0.00106064,0.001780955,0.001525043,0.001432039,0.0026614,0.001990048,0.002166934,0.007513347],"category_scores_gemma":[0.0323959,0.0008982265,0.000653358,0.001830535,0.002314356,0.004598316,0.002213795,0.001470198,0.000508913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003311567,"about_ca_system_score_gemma":0.001863318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004242463,"about_ca_topic_score_gemma":0.004186494,"domain_scores_codex":[0.9975025,0.001026536,0.00008914774,0.000278653,0.0005338991,0.000569267],"domain_scores_gemma":[0.9684124,0.02815408,0.0008288804,0.001117226,0.0007365384,0.0007508405],"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.001308296,0.0001038242,0.0005426037,0.0001923092,0.0000388788,0.00005493393,0.0001938543,0.9012066,0.002460046,0.06903172,0.001843716,0.02302314],"study_design_scores_gemma":[0.00009167186,0.0001300592,0.0003195846,0.00002456058,0.00003077773,0.00004267881,0.0001387562,0.9494182,0.001145998,0.04800859,0.0006294345,0.00001975487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5569002,0.004605,0.3925569,0.004333884,0.0002235266,0.0002779142,0.0005798864,0.0007439504,0.03977875],"genre_scores_gemma":[0.9692532,0.0006921851,0.02510205,0.00009546521,0.00006943646,0.00008858152,0.00008732137,0.0001803685,0.004431387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007513347,"threshold_uncertainty_score":0.0277915,"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","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false},{"name":"Stéphane Pérennès","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005534482,0.0006103884,0.0017813,0.001186546,0.003457262,0.003587292,0.003260926,0.002642013,0.002339471],"category_scores_gemma":[0.01542194,0.0007124128,0.0005936733,0.002039357,0.002494144,0.005217633,0.002945661,0.001564277,0.0005071776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002165501,"about_ca_system_score_gemma":0.001883979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004050685,"about_ca_topic_score_gemma":0.005154645,"domain_scores_codex":[0.9965035,0.001828948,0.0001295302,0.0006651637,0.0004702545,0.0004026229],"domain_scores_gemma":[0.9850636,0.01054154,0.001203642,0.00126115,0.0009828745,0.0009472986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001596122,0.0006090926,0.003151414,0.0002091576,0.00008550911,0.0004410718,0.001013162,0.7109883,0.002588087,0.2111709,0.005447079,0.06270014],"study_design_scores_gemma":[0.00007711949,0.00005819869,0.0001584948,0.000008891679,0.00002419269,0.00003546524,0.0001501778,0.9010614,0.0009308839,0.09658369,0.0008956296,0.0000158466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2272898,0.0001606904,0.7637348,0.001922003,0.0001027341,0.0002248799,0.0001982956,0.0004510341,0.005915733],"genre_scores_gemma":[0.7764744,0.000172601,0.2105197,0.0002104142,0.0001498792,0.0002264809,0.0001728606,0.0001491763,0.01192456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005534482,"threshold_uncertainty_score":0.02926952,"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","authors":[{"name":"Jérémie Chalopin","is_ca":false},{"name":"Yoann Dieudonné","is_ca":false},{"name":"Arnaud Labourel","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412523,0.000650195,0.001374628,0.001178552,0.001396246,0.001651762,0.00136372,0.001316222,0.001990435],"category_scores_gemma":[0.008680195,0.0004944555,0.0004229943,0.001345102,0.001817605,0.002621774,0.001532159,0.000915244,0.0002425717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001614957,"about_ca_system_score_gemma":0.0008439951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005702813,"about_ca_topic_score_gemma":0.003600892,"domain_scores_codex":[0.9994029,0.000171253,0.0000304571,0.0001179389,0.0001011012,0.0001762792],"domain_scores_gemma":[0.9947018,0.003676208,0.0006188253,0.0002697111,0.0003469857,0.0003864509],"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.0006980222,0.0000392653,0.0009998039,0.00009530887,0.00005461043,0.0002838067,0.0001736105,0.9290594,0.003210016,0.05368434,0.001188904,0.01051286],"study_design_scores_gemma":[0.00004864267,0.00005187792,0.0002289419,0.000007985069,0.00002085042,0.00006155093,0.0001313266,0.9608059,0.001268613,0.03685851,0.0005059885,0.000009786795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6943711,0.001732719,0.2877108,0.002317338,0.0002387789,0.00008695403,0.0001818812,0.0004032103,0.0129572],"genre_scores_gemma":[0.9901163,0.0002751033,0.006629485,0.00004571904,0.00003921604,0.0000266045,0.00004550824,0.00005666412,0.002765311],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005702813,"threshold_uncertainty_score":0.01171738,"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","authors":[{"name":"Emanuele G. Fusco","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007542293,0.0002756458,0.001371733,0.001582417,0.001054322,0.004039652,0.001262174,0.001465156,0.003906224],"category_scores_gemma":[0.08046734,0.0003908767,0.0005419584,0.0009678736,0.002984239,0.008115983,0.002092369,0.001833049,0.0005118847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001537562,"about_ca_system_score_gemma":0.002733065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000983418,"about_ca_topic_score_gemma":0.0007556507,"domain_scores_codex":[0.9965675,0.0009937922,0.0002361115,0.0006917558,0.000764668,0.000746155],"domain_scores_gemma":[0.8764958,0.08890758,0.01390453,0.009959788,0.005860295,0.004872003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006397646,0.0007607332,0.07049349,0.0003900206,0.0005057288,0.000599604,0.002574247,0.2246316,0.01659954,0.57703,0.003265376,0.09675214],"study_design_scores_gemma":[0.0002876612,0.001002294,0.02202434,0.00005239223,0.0001800781,0.0004228244,0.001067119,0.3325128,0.008747438,0.6321821,0.001391596,0.0001293567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7858179,0.0002976855,0.195814,0.001687081,0.00007325765,0.00009661898,0.0003838891,0.0003154054,0.01551422],"genre_scores_gemma":[0.996473,0.00003945058,0.002701772,0.00001834405,0.00001987705,0.0000151098,0.00006359254,0.00001675609,0.0006520682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007542293,"threshold_uncertainty_score":0.03988796,"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","authors":[{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335214,0.0005109254,0.0005086632,0.0007308898,0.001026287,0.001776492,0.001189315,0.0008465588,0.006972992],"category_scores_gemma":[0.005413875,0.0002933368,0.0003288544,0.0006032012,0.0005754571,0.001899385,0.002249441,0.0007639577,0.001704955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003615404,"about_ca_system_score_gemma":0.0005500254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002649333,"about_ca_topic_score_gemma":0.0006666296,"domain_scores_codex":[0.998786,0.0004001889,0.00004288732,0.0001291995,0.0004411315,0.0002005385],"domain_scores_gemma":[0.995884,0.001997779,0.0002513113,0.0008823803,0.0007386009,0.0002459468],"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.001918912,0.0008531328,0.007077057,0.0008541733,0.0001489078,0.002121917,0.001663776,0.09667126,0.1997432,0.2509351,0.02177431,0.4162383],"study_design_scores_gemma":[0.0001490576,0.0005563943,0.001182874,0.00006072496,0.0002026965,0.000975698,0.0009504419,0.6434188,0.1407546,0.1277578,0.08391872,0.00007211653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1713995,0.0006843101,0.7465377,0.001206339,0.001207883,0.0003745264,0.0001547946,0.004987185,0.07344785],"genre_scores_gemma":[0.9065124,0.0004345237,0.06618685,0.000275846,0.0002324288,0.0001374434,0.0001377016,0.0001846018,0.02589826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006972992,"threshold_uncertainty_score":0.02332699,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Adrian Kosowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002857473,0.000638641,0.001668441,0.001298947,0.001605822,0.002147147,0.001601529,0.001587469,0.008881876],"category_scores_gemma":[0.02156791,0.000490721,0.0005616136,0.001655159,0.001928272,0.004234365,0.001946159,0.001202703,0.0007010217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525065,"about_ca_system_score_gemma":0.0009370204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002451922,"about_ca_topic_score_gemma":0.003991719,"domain_scores_codex":[0.9985093,0.0005189377,0.00006538162,0.0001885255,0.0002651658,0.0004526255],"domain_scores_gemma":[0.980759,0.01601772,0.0005801263,0.001147327,0.000664905,0.0008309347],"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.002107419,0.0002148242,0.001784782,0.0002484075,0.00007322232,0.0001144368,0.0005799299,0.7993042,0.0100669,0.1053147,0.003496288,0.07669482],"study_design_scores_gemma":[0.0001074148,0.0002618906,0.0006395272,0.00002752864,0.00005116947,0.00008814048,0.0003795332,0.8809496,0.003448522,0.1129342,0.001084636,0.00002785184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7196363,0.002947289,0.2552141,0.001523829,0.0001187546,0.0001171572,0.0003409421,0.0007998146,0.01930177],"genre_scores_gemma":[0.9783417,0.0003179409,0.01858379,0.00004242997,0.00003211021,0.00003708609,0.00006077228,0.0001768787,0.002407359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008881876,"threshold_uncertainty_score":0.0297128,"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","authors":[{"name":"A. Mashreghi","is_ca":true},{"name":"Valerie King","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002862544,0.0005893377,0.001610767,0.0008467343,0.001578487,0.002581885,0.002162639,0.001771671,0.004175472],"category_scores_gemma":[0.01364241,0.0006670026,0.0007399223,0.001482178,0.002015127,0.006312758,0.002302956,0.002184293,0.0004492771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313335,"about_ca_system_score_gemma":0.001624032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003407316,"about_ca_topic_score_gemma":0.003482969,"domain_scores_codex":[0.9980199,0.0008896042,0.00007771355,0.0003320333,0.0003359187,0.000344927],"domain_scores_gemma":[0.988848,0.008162046,0.0008895294,0.001013032,0.0004838345,0.0006037041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007272472,0.0001350738,0.0007802522,0.0001825003,0.00005610421,0.0002149847,0.0003958921,0.3865323,0.002619545,0.5876343,0.007347795,0.01337418],"study_design_scores_gemma":[0.00005657605,0.00003446216,0.0001486594,0.000009798645,0.00002325373,0.00006056251,0.00006595401,0.7533996,0.0003846922,0.2448819,0.000920387,0.0000141139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2243111,0.001274272,0.7517684,0.004519503,0.0001609025,0.0001141297,0.0006796536,0.0005685834,0.01660343],"genre_scores_gemma":[0.9464611,0.0006395985,0.04478683,0.0002750874,0.0002311838,0.0001237504,0.0002291118,0.0001671313,0.007086232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004175472,"threshold_uncertainty_score":0.01678449,"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","authors":[{"name":"Marcos K. Aguilera","is_ca":false},{"name":"Carole Delporte-Gallet","is_ca":false},{"name":"Hugues Fauconnier","is_ca":false},{"name":"Sam Toueg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02008877577624257,"gpt":0.2676204534354973,"spread":0.2475316776592548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003295772,0.0008286234,0.002010681,0.001950693,0.001372597,0.002795924,0.002192557,0.001097519,0.006389798],"category_scores_gemma":[0.01735171,0.0006932407,0.001107389,0.002113318,0.00240315,0.005206048,0.003494803,0.002081925,0.0008511369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342577,"about_ca_system_score_gemma":0.001495955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001211853,"about_ca_topic_score_gemma":0.00116665,"domain_scores_codex":[0.9970478,0.0007372797,0.0002338529,0.0006549923,0.001038154,0.0002878575],"domain_scores_gemma":[0.9787587,0.01155428,0.001817335,0.004817673,0.00203189,0.001020094],"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.001136928,0.0000935045,0.001485302,0.0002300609,0.0001020656,0.0002577479,0.0004938971,0.1678347,0.008209985,0.7476475,0.003806728,0.0687016],"study_design_scores_gemma":[0.0001504787,0.0002202037,0.000341663,0.0000335975,0.00009217816,0.0001576785,0.00008944564,0.5768275,0.004710463,0.4130093,0.004314118,0.00005331221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03284977,0.0002533627,0.9596345,0.0002822702,0.0001852335,0.00009642597,0.0002126126,0.0009318999,0.005553859],"genre_scores_gemma":[0.8332646,0.0004123785,0.1588831,0.0002241,0.0003885858,0.0003050886,0.0005142931,0.0004606252,0.005547211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006389798,"threshold_uncertainty_score":0.02137601,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005788481,0.003364495,0.003286406,0.002784839,0.00337049,0.006995354,0.01008425,0.003523367,0.03860527],"category_scores_gemma":[0.03605476,0.001287915,0.002723888,0.004222237,0.00445936,0.02259005,0.009875914,0.01411193,0.008146487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007900179,"about_ca_system_score_gemma":0.005804764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004488717,"about_ca_topic_score_gemma":0.01008237,"domain_scores_codex":[0.9925591,0.001890924,0.0002210816,0.001579712,0.001719065,0.002030192],"domain_scores_gemma":[0.9473547,0.03775369,0.001568761,0.008429783,0.002558161,0.002334942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001402169,0.0009651104,0.003072387,0.001144052,0.0002135937,0.0003150654,0.0006291897,0.1764314,0.004143095,0.6363931,0.09560758,0.07968313],"study_design_scores_gemma":[0.00007860803,0.00006423998,0.0004186144,0.00009882295,0.0000962988,0.0001159532,0.0001392473,0.2361224,0.001540886,0.7554516,0.005835036,0.00003824019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06028363,0.007999639,0.7549086,0.03340473,0.001536125,0.00025069,0.003779039,0.003818648,0.1340188],"genre_scores_gemma":[0.757907,0.005078374,0.15205,0.008220504,0.002469975,0.001050229,0.003652162,0.005584034,0.06398772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03860527,"threshold_uncertainty_score":0.1291475,"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","authors":[{"name":"Carole Delporte-Gallet","is_ca":false},{"name":"Hugues Fauconnier","is_ca":false},{"name":"Rachid Guerraoui","is_ca":false},{"name":"Anne-Marie Kermarrec","is_ca":false},{"name":"Eric Ruppert","is_ca":true},{"name":"Hung Tran-The","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005082103,0.0006476432,0.001739747,0.001044084,0.003841202,0.005487614,0.001615248,0.0028158,0.009958551],"category_scores_gemma":[0.01346785,0.0006376198,0.0007554621,0.00169289,0.004347262,0.01267923,0.00676069,0.004428754,0.003712126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226034,"about_ca_system_score_gemma":0.001759987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003340616,"about_ca_topic_score_gemma":0.0003241483,"domain_scores_codex":[0.9918767,0.003617384,0.0004972022,0.001164621,0.002027472,0.000816552],"domain_scores_gemma":[0.9888529,0.003882868,0.0005253913,0.005312579,0.0011179,0.0003084331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000189679,0.00002646238,0.00008128893,0.00006490147,0.000009869775,0.00007512758,0.000321854,0.001741444,0.001594419,0.9773605,0.002855222,0.01567915],"study_design_scores_gemma":[0.00005976266,0.00003693121,0.00003357949,0.00003331103,0.00001751308,0.0001052501,0.00007952972,0.01542015,0.004950495,0.955056,0.0241838,0.00002383453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02804537,0.0005497396,0.9160599,0.002366254,0.0009790169,0.0002204843,0.0002465989,0.001657731,0.04987488],"genre_scores_gemma":[0.7429169,0.0007265901,0.2144873,0.00106698,0.0007904036,0.000563533,0.0004734466,0.0009467917,0.03802801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009958551,"threshold_uncertainty_score":0.0333147,"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","authors":[{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574683,0.0008954377,0.001676148,0.0008431322,0.0007323585,0.002075173,0.00191324,0.001417785,0.006875718],"category_scores_gemma":[0.007685785,0.0006045426,0.0009938689,0.001493527,0.001651594,0.003495226,0.002092369,0.003372773,0.0009201287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002585219,"about_ca_system_score_gemma":0.001811205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004215908,"about_ca_topic_score_gemma":0.004587641,"domain_scores_codex":[0.9987664,0.0004380015,0.00004102253,0.00022873,0.0003252593,0.0002005185],"domain_scores_gemma":[0.996242,0.002702167,0.0001543433,0.000444256,0.0003125964,0.0001445741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001613285,0.00007431149,0.0003149403,0.0001676443,0.00004692053,0.00003778111,0.00005773956,0.2511245,0.0005830822,0.709961,0.00755498,0.02991576],"study_design_scores_gemma":[0.00003983997,0.00001468381,0.00008159116,0.00001257523,0.00001125326,0.00001469524,0.00001448833,0.6461815,0.0001826917,0.3508003,0.002640732,0.000005703322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01409602,0.001302511,0.9670795,0.001837682,0.0001489926,0.00003777794,0.000190267,0.0002324536,0.01507477],"genre_scores_gemma":[0.5871106,0.002666116,0.3824858,0.0006172451,0.0007027178,0.0002821213,0.0005302862,0.0004289952,0.02517609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006875718,"threshold_uncertainty_score":0.02300161,"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","authors":[{"name":"Heiner Ackermann","is_ca":false},{"name":"Petra Berenbrink","is_ca":true},{"name":"Simon Fischer","is_ca":false},{"name":"Martin Hoefer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106245,0.0006221688,0.00119174,0.0006908874,0.0009394058,0.002375007,0.001888574,0.001578149,0.004517321],"category_scores_gemma":[0.01684773,0.0005617196,0.0006924747,0.0005448639,0.003121512,0.003528936,0.002404573,0.001970763,0.0002491119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001683771,"about_ca_system_score_gemma":0.001480477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005443832,"about_ca_topic_score_gemma":0.002870196,"domain_scores_codex":[0.9988298,0.0005034813,0.00004219014,0.0001755624,0.0002419856,0.0002070924],"domain_scores_gemma":[0.9911685,0.006570723,0.0006659017,0.0003333728,0.0005283098,0.0007331412],"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.0001448577,0.00009782166,0.001267777,0.00009282606,0.00005990986,0.0002744467,0.0004584978,0.3164807,0.001959542,0.6695749,0.001088046,0.008500709],"study_design_scores_gemma":[0.000045843,0.00002858786,0.0002090094,0.000008373413,0.00001525669,0.00003817995,0.0000784875,0.787169,0.0002191478,0.2116615,0.0005113262,0.00001532961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3389235,0.0005883814,0.630268,0.002435555,0.000181227,0.0001151674,0.00008198322,0.0001779675,0.02722827],"genre_scores_gemma":[0.9868135,0.0001439496,0.008123462,0.00006258454,0.00003673742,0.00006390978,0.00001596317,0.00002000772,0.004719898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005443832,"threshold_uncertainty_score":0.01511192,"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","authors":[{"name":"Wai-Kau Lo","is_ca":true},{"name":"Vassos Hadzilacos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006909389,0.0005945904,0.001088539,0.001504628,0.002289604,0.003148955,0.002959124,0.00196808,0.003958737],"category_scores_gemma":[0.02601681,0.0008976237,0.0009435914,0.001613342,0.007945944,0.01161386,0.00434223,0.004199585,0.0008031276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001637742,"about_ca_system_score_gemma":0.001117503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002068578,"about_ca_topic_score_gemma":0.002062828,"domain_scores_codex":[0.9967052,0.001112106,0.0002870383,0.0003609748,0.001045204,0.0004893566],"domain_scores_gemma":[0.9660478,0.02183267,0.001032836,0.008399566,0.002014443,0.0006726849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006520427,0.00008750942,0.0008518056,0.0001381722,0.0000418255,0.0001346996,0.0006132868,0.06964306,0.003141811,0.8624266,0.003932846,0.05833636],"study_design_scores_gemma":[0.0001257478,0.0001006366,0.0001627524,0.0000396813,0.0000562511,0.00008494659,0.00009655739,0.2357948,0.003554056,0.7554674,0.004461138,0.00005618184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08675697,0.0009371929,0.8853475,0.002518205,0.0005578995,0.0001105248,0.00007305059,0.001293791,0.02240494],"genre_scores_gemma":[0.8260117,0.0007793445,0.1621929,0.0008576192,0.0003577299,0.0002079869,0.0001212831,0.0005550989,0.008916302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006909389,"threshold_uncertainty_score":0.03654075,"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","authors":[{"name":"Hoda Akbari","is_ca":true},{"name":"Petra Berenbrink","is_ca":true},{"name":"Thomas Sauerwald","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562067,0.0009491131,0.001289848,0.0005322577,0.0006940217,0.001452313,0.002012355,0.001428313,0.005300655],"category_scores_gemma":[0.005861675,0.0005612265,0.0008980275,0.0008067733,0.001086733,0.001925453,0.002292379,0.003626236,0.001135405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006281551,"about_ca_system_score_gemma":0.001111727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001585722,"about_ca_topic_score_gemma":0.002128171,"domain_scores_codex":[0.9991332,0.0003001219,0.00004894769,0.0001546278,0.0003067715,0.00005634457],"domain_scores_gemma":[0.9987057,0.0005461709,0.00008354594,0.0003762444,0.0002006961,0.00008751866],"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.0001089667,0.0002539098,0.0004771911,0.0001661651,0.0001116917,0.0001985268,0.0001221774,0.6158862,0.01140566,0.2521327,0.004705352,0.1144314],"study_design_scores_gemma":[0.00001276535,0.00001711069,0.00005521267,0.000004408216,0.000009595557,0.00003218718,0.000005296926,0.9595746,0.0005468408,0.03823355,0.001499536,0.000008854639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009968507,0.00002469168,0.9977968,0.00007448255,0.00005808335,0.00002706493,0.000009959309,0.0001334424,0.0008786072],"genre_scores_gemma":[0.2406306,0.0002918294,0.7495772,0.0003227695,0.0003109822,0.0003420696,0.00008317843,0.0002820969,0.008159252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005300655,"threshold_uncertainty_score":0.01773238,"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","authors":[{"name":"Jonathan Eisler","is_ca":false},{"name":"Vassos Hadzilacos","is_ca":true},{"name":"Sam Toueg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003421135,0.0006374439,0.001600377,0.0008246424,0.0008608843,0.0009946086,0.001755023,0.001131075,0.001541657],"category_scores_gemma":[0.01468781,0.0004337076,0.0004896116,0.0008394236,0.001519864,0.002384004,0.00248071,0.002344798,0.0002854137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008327136,"about_ca_system_score_gemma":0.001869812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243991,"about_ca_topic_score_gemma":0.001304846,"domain_scores_codex":[0.9987952,0.0004538375,0.00007734889,0.0002129844,0.0003441847,0.0001163733],"domain_scores_gemma":[0.9948627,0.003012941,0.0002642871,0.000682254,0.0009645081,0.0002133277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007464558,0.0001170236,0.001242129,0.0003205012,0.0001678077,0.00009280506,0.0002907579,0.532174,0.006768813,0.2027561,0.008488501,0.2468351],"study_design_scores_gemma":[0.00005046935,0.00005661249,0.00006116408,0.000007062049,0.00001728493,0.0000195414,0.00001196742,0.9506096,0.001314185,0.04697159,0.0008719727,0.000008561508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01099814,0.0002585123,0.9869289,0.0003394891,0.0001513551,0.00003355871,0.00002050937,0.0002687478,0.001000748],"genre_scores_gemma":[0.6840736,0.0004859223,0.3091443,0.0004719449,0.0002803701,0.000302596,0.0001559391,0.0001527783,0.004932667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003421135,"threshold_uncertainty_score":0.01809287,"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","authors":[{"name":"David Kirkpatrick","is_ca":true},{"name":"Irina Kostitsyna","is_ca":false},{"name":"Alfredo Navarra","is_ca":false},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005102524,0.0008346702,0.001659682,0.0009674596,0.001152679,0.002027273,0.002348038,0.001558486,0.002427571],"category_scores_gemma":[0.03736747,0.0007819505,0.001233935,0.0006560073,0.004317056,0.004309606,0.005191385,0.002789019,0.0003989683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001400436,"about_ca_system_score_gemma":0.001508846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002398558,"about_ca_topic_score_gemma":0.0015239,"domain_scores_codex":[0.9960548,0.001910138,0.0001974079,0.0006910677,0.0007621638,0.0003843131],"domain_scores_gemma":[0.9578612,0.03377205,0.002812749,0.002498151,0.001624792,0.001430997],"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.0005924419,0.00006562598,0.001604256,0.0001695807,0.00007564757,0.000302534,0.0004601335,0.7649187,0.003343322,0.210305,0.0013339,0.01682883],"study_design_scores_gemma":[0.00006101925,0.00007654302,0.0001447512,0.00002280162,0.00001326125,0.00002829843,0.00004199539,0.9127785,0.0006829216,0.08558559,0.0005516449,0.00001262374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09730536,0.0005401739,0.8937159,0.001254525,0.000063516,0.00005806685,0.000058283,0.0003397448,0.006664471],"genre_scores_gemma":[0.9470812,0.000346295,0.0491316,0.0001804029,0.00007600545,0.0001441976,0.00006589031,0.0001264965,0.002847952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005102524,"threshold_uncertainty_score":0.02698511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}