{"meta":{"query_hash":"66da2a6e6827","filters":{"venue":"Distributed Computing"},"cohort_total":73,"direct_labels_cover":0,"predictions_cover":73,"exported":73,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/66da2a6e6827","api":"https://metacan.xera.ac/api/v1/cohort?venue=Distributed+Computing"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Node (physics); Topology (electrical circuits); Computation; Computer science; Network topology; Computer network; Symmetry (geometry); Lambda; Mathematics; Combinatorics; Discrete mathematics; Physics; Algorithm; Geometry","score_opus":0.036822080185433884,"score_gpt":0.2641277812374795,"score_spread":0.22730570105204562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949215090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073309295,0.00008066649,0.9249661,0.000043576827,0.0002699319,0.000052850442,0.0000062078557,0.00004689309,0.0012244891],"genre_scores_gemma":[0.9981872,8.2473224e-7,0.0016345839,0.00001335008,0.00009076708,5.893527e-7,0.000007909867,0.0000042211636,0.000060552793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913937,0.000105764855,0.00031166401,0.00019090406,0.000099002296,0.00015329345],"domain_scores_gemma":[0.9992026,0.00017862694,0.0001885276,0.00020202965,0.00019183455,0.000036389276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045754173,0.00008407006,0.00021283014,0.00007583751,0.00006963259,0.00003172249,0.00022468653,0.00005616267,0.0000027553908],"category_scores_gemma":[0.00005731895,0.00007972835,0.000048185724,0.0003904947,0.00003304772,0.0000758034,0.000090435096,0.00007822795,0.000006295714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003483497,0.00053062197,0.013292895,0.00061452994,0.00028196585,0.00000228321,0.0042331447,0.009179324,0.036711767,0.49033722,0.017417813,0.4273636],"study_design_scores_gemma":[0.00022464432,0.00010796823,0.00490958,0.00009747167,0.0000050315907,0.000015787717,0.000035125886,0.9842678,0.008838885,0.0004542672,0.000946663,0.00009677488],"about_ca_topic_score_codex":0.000035518777,"about_ca_topic_score_gemma":0.0000022560196,"teacher_disagreement_score":0.9750885,"about_ca_system_score_codex":0.000017540679,"about_ca_system_score_gemma":0.000015414236,"threshold_uncertainty_score":0.32512277},"labels":[],"label_agreement":null},{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","score_opus":0.01483399648761171,"score_gpt":0.26098157343179307,"score_spread":0.24614757694418135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967908173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008094969,0.0013739038,0.9869502,0.0002863564,0.001978626,0.00062441843,0.00012484657,0.00017632236,0.0003903399],"genre_scores_gemma":[0.99140114,0.000006583343,0.008224578,0.00004290297,0.00020206165,0.00002477542,0.000037664897,0.000012435881,0.000047875685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703866,0.00048091175,0.00090878736,0.00032445017,0.0004725972,0.00077457353],"domain_scores_gemma":[0.99615043,0.0019092546,0.0006208143,0.000773053,0.00036753927,0.00017889266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025638891,0.00026046936,0.0007022837,0.00004547714,0.00048199427,0.0001926503,0.0011696924,0.000101214784,0.0000038806343],"category_scores_gemma":[0.0005024263,0.00016090847,0.0002254524,0.0007842351,0.00026655872,0.00015927361,0.00027629806,0.00023134516,0.000009650431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026989733,0.0005897211,0.0019726213,0.00015476115,0.00054497115,0.000042392272,0.0024509688,0.003833033,0.0002041211,0.13805689,0.010979299,0.83847225],"study_design_scores_gemma":[0.02330962,0.00005249243,0.0006711123,0.00017351762,0.00004014913,0.00014648012,0.00030791815,0.96010023,0.0038222251,0.00055703067,0.010378562,0.00044068717],"about_ca_topic_score_codex":0.000061448874,"about_ca_topic_score_gemma":0.0000026400303,"teacher_disagreement_score":0.98330617,"about_ca_system_score_codex":0.000059165,"about_ca_system_score_gemma":0.000121163255,"threshold_uncertainty_score":0.6561657},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Binary logarithm; Computer science; Upper and lower bounds; Graph; Combinatorics; Matching (statistics); Discrete mathematics; Node (physics); Mathematics; Theoretical computer science","score_opus":0.035370928479806094,"score_gpt":0.2406513227041873,"score_spread":0.2052803942243812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972775782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010468527,0.000061476065,0.98301446,0.0026764313,0.0002296129,0.00030734105,0.000021846285,0.000341751,0.002878531],"genre_scores_gemma":[0.83918643,0.0000033641415,0.16020946,0.00044805396,0.0000268747,0.000009272001,0.0000355004,0.000013963795,0.0000670857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980858,0.0001304448,0.00028984924,0.00055671105,0.00030271034,0.000634497],"domain_scores_gemma":[0.9988629,0.000067621615,0.00010602093,0.00058555923,0.00012977459,0.00024810192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046170267,0.00020040835,0.00023237999,0.00025937948,0.0001532676,0.0002850758,0.0011437081,0.000088918074,0.0000068064487],"category_scores_gemma":[0.000109403256,0.00020343787,0.00007512331,0.0011376068,0.000035228604,0.0004051659,0.00042261428,0.00020035153,0.0000108704935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005789202,0.0007456832,0.03668425,0.00009790109,0.0001039995,0.0003819234,0.022673642,0.0202812,0.0008151094,0.8465513,0.023654593,0.04795251],"study_design_scores_gemma":[0.0014678931,0.00036154545,0.014049596,0.00018463311,0.000008803246,0.000040718187,0.00063712406,0.90844595,0.0033312272,0.06328729,0.007129476,0.0010557538],"about_ca_topic_score_codex":0.000078661906,"about_ca_topic_score_gemma":0.00003955699,"teacher_disagreement_score":0.88816476,"about_ca_system_score_codex":0.000064399486,"about_ca_system_score_gemma":0.00006771616,"threshold_uncertainty_score":0.82959557},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"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","score_opus":0.009462218466195972,"score_gpt":0.23770859518744922,"score_spread":0.22824637672125325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05178207,0.000013542274,0.9463267,0.00048288307,0.0000949243,0.00026927574,0.00006960071,0.00057647703,0.00038457333],"genre_scores_gemma":[0.9486211,0.000002635988,0.05069963,0.00019190584,0.000028953422,8.986331e-7,0.000448264,0.0000054972315,0.0000011439489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785614,0.00019842417,0.0005915082,0.0003167919,0.00050759,0.0005295643],"domain_scores_gemma":[0.9980598,0.00025431393,0.00045098158,0.0004558578,0.00061678287,0.00016223798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622462,0.00023133784,0.00033526355,0.00018811673,0.00035664946,0.00027933097,0.00048989995,0.00008597296,0.000002604914],"category_scores_gemma":[0.00013752223,0.00021795438,0.00008126787,0.001745491,0.0000656485,0.0010046558,0.00017507444,0.00028353292,0.0000075058697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045886503,0.00021929455,0.0062622465,0.000084412764,0.000064345426,0.00003150735,0.0013558856,0.8822149,0.00073748355,0.035492256,0.00055961555,0.07293217],"study_design_scores_gemma":[0.00075367733,0.00018688703,0.025744261,0.000132477,0.000008617884,0.000033476947,0.00014014717,0.9709319,0.0012467323,0.0002691793,0.00028389622,0.00026874477],"about_ca_topic_score_codex":0.000037157886,"about_ca_topic_score_gemma":0.0000026588186,"teacher_disagreement_score":0.896839,"about_ca_system_score_codex":0.00008520168,"about_ca_system_score_gemma":0.00010325377,"threshold_uncertainty_score":0.88879216},"labels":[],"label_agreement":null},{"id":"W1981392728","doi":"10.1007/s00446-014-0234-3","title":"Localization for a system of colliding robots","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Position (finance); Conjecture; Ring (chemistry); Mobile robot; Energy (signal processing); Motion (physics); Trajectory; Momentum (technical analysis); Physics; Topology (electrical circuits); Computer science; Mathematics; Control theory (sociology); Combinatorics; Classical mechanics; Artificial intelligence; Quantum mechanics; Control (management)","score_opus":0.017592758448582733,"score_gpt":0.2551770093600642,"score_spread":0.23758425091148147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981392728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057688495,0.000012143716,0.99840534,0.00008882922,0.00015990585,0.00023562307,0.000010910664,0.00020862084,0.0003017307],"genre_scores_gemma":[0.9093128,4.4991435e-7,0.09054113,0.00003519214,0.000034029603,0.0000054258917,0.00006088213,0.0000057717725,0.00000434376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.00008057814,0.0002851465,0.00020919337,0.00016103842,0.00021085276],"domain_scores_gemma":[0.99905103,0.00019588695,0.00016261206,0.00023885543,0.00029216264,0.000059472834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611363,0.00007756975,0.00015653095,0.00006426013,0.00017458256,0.00009352442,0.00039755236,0.000041371277,7.121932e-7],"category_scores_gemma":[0.0001314092,0.000078187986,0.000049378512,0.00048166257,0.000015888323,0.0001113969,0.00008776983,0.000039660626,0.0000024587637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024265407,0.000020398655,0.00043500948,0.00013082798,0.000008486719,2.2529449e-7,0.00013919806,0.70859987,0.00017961382,0.28297558,0.00027517782,0.0072332015],"study_design_scores_gemma":[0.00035419647,0.000050483828,0.00008119364,0.00009413055,0.0000030560966,0.0000021590404,0.000040782816,0.9967276,0.0015329855,0.00027895896,0.0007525419,0.00008191239],"about_ca_topic_score_codex":0.0000052535515,"about_ca_topic_score_gemma":3.3381812e-7,"teacher_disagreement_score":0.9087359,"about_ca_system_score_codex":0.00004785628,"about_ca_system_score_gemma":0.000032307355,"threshold_uncertainty_score":0.31884137},"labels":[],"label_agreement":null},{"id":"W1983791345","doi":"10.1007/s00446-011-0139-3","title":"Symbolic synthesis of masking fault-tolerant distributed programs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Masking (illustration); Computer science; Fault tolerance; Programming language; Backward masking; Parallel computing; Distributed computing; Psychology; Art; Neuroscience","score_opus":0.027575467724975253,"score_gpt":0.2330057222646325,"score_spread":0.20543025453965724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983791345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067355916,0.0002115263,0.92865366,0.00007428402,0.0005251018,0.00043198888,0.00041355132,0.00069062127,0.0016433634],"genre_scores_gemma":[0.986017,0.0000053805575,0.013510753,0.00003351882,0.00009046745,0.000037708178,0.00026745372,0.00003058739,0.0000071224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959791,0.00021323923,0.0012311774,0.00089831045,0.0006444846,0.0010337327],"domain_scores_gemma":[0.9969604,0.00020155577,0.00074833684,0.0013407803,0.00045769423,0.00029123007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073664397,0.0004892829,0.00085521146,0.00015662033,0.00033068337,0.00021990162,0.0022727635,0.00021655041,0.000016953187],"category_scores_gemma":[0.00016416679,0.0004688042,0.00033370117,0.001720999,0.0001581281,0.00043210105,0.0004618856,0.00033742064,0.000039300758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950135,0.003770065,0.069564044,0.0010924016,0.0010861858,0.0006542484,0.008265054,0.0073347846,0.0033933974,0.26567245,0.002236908,0.63677096],"study_design_scores_gemma":[0.001827891,0.00036481724,0.06173458,0.0019466222,0.00014679963,0.00025612922,0.0011447514,0.8889293,0.031622406,0.0024260997,0.0074074985,0.002193079],"about_ca_topic_score_codex":0.0002444548,"about_ca_topic_score_gemma":0.0000052244745,"teacher_disagreement_score":0.9186611,"about_ca_system_score_codex":0.000112806985,"about_ca_system_score_gemma":0.000114115515,"threshold_uncertainty_score":0.99977636},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"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","score_opus":0.025111813245434718,"score_gpt":0.3120113948574338,"score_spread":0.2868995816119991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984719907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019235913,0.000019245801,0.9724547,0.00012594044,0.00005364388,0.007478134,0.000016044336,0.00023379475,0.00038258106],"genre_scores_gemma":[0.8802769,0.0000011539479,0.1173456,0.00013891872,0.00014316812,0.0017712101,0.00027115943,0.000019580999,0.000032262535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980365,0.00012566011,0.00043076053,0.00047131968,0.00025456838,0.0006811789],"domain_scores_gemma":[0.99914086,0.00018117602,0.00012002354,0.00034774074,0.00011144173,0.00009875417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068446004,0.00016935682,0.00021187439,0.00012429518,0.00021276693,0.00044041584,0.00078745355,0.00007565095,0.000005696114],"category_scores_gemma":[0.00003331737,0.00017753837,0.00008651515,0.000773529,0.000047769296,0.00031594795,0.00026329255,0.00026528168,0.000008576883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008784551,0.0001474263,0.00097395864,0.00003392355,0.00000530689,0.000011182042,0.00016833712,0.98491275,0.00003175967,0.008067607,0.0009016587,0.0047372794],"study_design_scores_gemma":[0.0009270316,0.00009386793,0.0013339493,0.0001098051,0.0000011665688,0.0000017522149,0.000033114586,0.9940535,0.00013726218,0.00068598764,0.0024264515,0.00019610375],"about_ca_topic_score_codex":0.000039236576,"about_ca_topic_score_gemma":0.0000035759626,"teacher_disagreement_score":0.861041,"about_ca_system_score_codex":0.00008846001,"about_ca_system_score_gemma":0.00008774924,"threshold_uncertainty_score":0.7239804},"labels":[],"label_agreement":null},{"id":"W1984883054","doi":"10.1007/s00446-011-0128-6","title":"Randomized mutual exclusion with sub-logarithmic RMR-complexity","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Upper and lower bounds; Logarithm; Binary logarithm; Computer science; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.03728997020315791,"score_gpt":0.2374978864502045,"score_spread":0.2002079162470466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984883054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13200366,0.00011313123,0.8633454,0.00011748476,0.00040817255,0.00054054713,0.000071764065,0.00063644414,0.0027634355],"genre_scores_gemma":[0.9737752,0.0000039686374,0.025778104,0.00012276224,0.000103886814,0.000021535538,0.00015660995,0.00001991924,0.000018008448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967882,0.00036974737,0.00071253034,0.0008266295,0.00053592137,0.00076695246],"domain_scores_gemma":[0.9978835,0.0002125694,0.0004255075,0.0009325684,0.00030282242,0.00024301358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011714274,0.00040158426,0.0008319716,0.000116020514,0.00050964014,0.0002590365,0.0014761185,0.0001350974,0.000022738659],"category_scores_gemma":[0.00009052819,0.00031600555,0.00021547485,0.0009312319,0.00031407792,0.00042115554,0.000436569,0.00034400963,0.00009089259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020169083,0.0018980218,0.007216029,0.00030399693,0.0009183624,0.0012557259,0.010863532,0.0025858276,0.0020963333,0.8710959,0.0062270006,0.07537018],"study_design_scores_gemma":[0.105971925,0.00026457285,0.008488575,0.000376878,0.00006990506,0.00035304678,0.0002237181,0.86895543,0.004850393,0.007191775,0.001846284,0.0014075225],"about_ca_topic_score_codex":0.00022641766,"about_ca_topic_score_gemma":0.000014543453,"teacher_disagreement_score":0.8663696,"about_ca_system_score_codex":0.000098804536,"about_ca_system_score_gemma":0.000106255124,"threshold_uncertainty_score":0.9999292},"labels":[],"label_agreement":null},{"id":"W1987584238","doi":"10.1007/s00446-010-0096-2","title":"Closing the complexity gap between FCFS mutual exclusion and mutual exclusion","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Binary logarithm; Algorithm; Parallel computing; Theoretical computer science; Distributed computing; Discrete mathematics; Mathematics; Computer network; Artificial intelligence","score_opus":0.038226657414625956,"score_gpt":0.27780160395382425,"score_spread":0.2395749465391983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987584238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4368544,0.0001077994,0.55950105,0.0013821825,0.0008237452,0.00028182095,0.00021585202,0.00032942442,0.0005036946],"genre_scores_gemma":[0.99392873,0.0000037604802,0.004887434,0.00017879036,0.0006721188,0.00000472685,0.00028897336,0.000020174823,0.000015297794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968447,0.00023483884,0.000682902,0.00083255174,0.00062924577,0.0007757765],"domain_scores_gemma":[0.997655,0.00045792115,0.00036479093,0.0010328706,0.00021971922,0.00026974335],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012477163,0.00038931545,0.00046708118,0.00008149299,0.0017649912,0.0007576782,0.0016066686,0.00021980735,0.000011660824],"category_scores_gemma":[0.00015509863,0.00030296945,0.00013344214,0.0007884503,0.00040635077,0.00041331706,0.0012377693,0.0009093558,0.000043383952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079969366,0.0005738526,0.06743652,0.00029136156,0.0002701904,0.00021901829,0.008585045,0.0011808175,0.061891805,0.37504604,0.018734397,0.465691],"study_design_scores_gemma":[0.002024465,0.00019492004,0.1438912,0.0003179033,0.000055990757,0.0002963657,0.0004442159,0.7941356,0.0036351208,0.009689615,0.043942988,0.0013716638],"about_ca_topic_score_codex":0.00013355531,"about_ca_topic_score_gemma":0.000028036904,"teacher_disagreement_score":0.79295474,"about_ca_system_score_codex":0.000064615975,"about_ca_system_score_gemma":0.00007953659,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W1991072415","doi":"10.1007/s00446-010-0106-4","title":"Adaptive progress: a gracefully-degrading liveness property","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Liveness; Computer science; Abstraction; Implementation; Property (philosophy); Object (grammar); Process (computing); Distributed computing; Bridge (graph theory); Key (lock); Simple (philosophy); Theoretical computer science; Programming language; Computer security; Artificial intelligence","score_opus":0.014107387576893332,"score_gpt":0.24322895281708548,"score_spread":0.22912156524019214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991072415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068768024,0.00018194363,0.9267905,0.0005329281,0.0014411412,0.00046201385,0.00009539849,0.0009038461,0.0008242536],"genre_scores_gemma":[0.9745835,0.0000012972489,0.02488757,0.00007888351,0.00027409228,0.000032611886,0.00008199816,0.000022132836,0.000037888858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721944,0.000115673065,0.0005364588,0.0008444806,0.00047688317,0.0008070376],"domain_scores_gemma":[0.9979669,0.00011718693,0.00031362596,0.0009578314,0.00038004093,0.00026443184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006339776,0.00035995874,0.00041309648,0.000098131924,0.00055610243,0.0006499505,0.0017726867,0.00017734812,0.000009958095],"category_scores_gemma":[0.00009370782,0.0002687549,0.00016073059,0.0010911601,0.00014408928,0.0005465351,0.00039097044,0.000678016,0.00007644282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006399565,0.0009946864,0.033203863,0.00019536914,0.00025947302,0.0005115271,0.0021352423,0.0020565782,0.0094493,0.26103103,0.006871632,0.6832273],"study_design_scores_gemma":[0.000936918,0.00015586922,0.013539332,0.00027031393,0.000017163224,0.00021910988,0.00019094502,0.9504822,0.0022779733,0.0011059946,0.029879509,0.00092466123],"about_ca_topic_score_codex":0.00005641381,"about_ca_topic_score_gemma":0.000010666639,"teacher_disagreement_score":0.94842565,"about_ca_system_score_codex":0.00006659214,"about_ca_system_score_gemma":0.00014816539,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W1991558558","doi":"10.1007/s00446-015-0261-8","title":"Universal constructions that ensure disjoint-access parallelism and wait-freedom","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Computer science; Parallelism (grammar); Parallel computing; Data parallelism; Task parallelism; Crash; Degrees of freedom (physics and chemistry); Base (topology); Process (computing); Distributed computing; Programming language; Mathematics","score_opus":0.01891117604027799,"score_gpt":0.2416308932677721,"score_spread":0.22271971722749412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991558558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703073,0.00017893377,0.928389,0.0019295104,0.0008113922,0.00017870085,0.0003513311,0.0004287565,0.00070163864],"genre_scores_gemma":[0.9960711,0.000022734386,0.003566563,0.00006609613,0.00016412037,0.000004303737,0.000047107776,0.000012035005,0.000045922752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804366,0.00010577378,0.00034715098,0.00065718073,0.0003022648,0.0005439767],"domain_scores_gemma":[0.9984874,0.0002159585,0.00022653531,0.0006755104,0.00016253212,0.00023207831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024128423,0.00026833764,0.00033062923,0.000083125444,0.00042763306,0.00051664753,0.0011368357,0.000119567994,0.000013574714],"category_scores_gemma":[0.000059671565,0.00020332319,0.00009466748,0.00045348844,0.00021339559,0.00082312146,0.0005961313,0.00015934928,0.000020874451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081950246,0.0002440748,0.08011099,0.00010764032,0.00033865758,0.00032959267,0.0008510143,0.002690503,0.003391437,0.5542651,0.021030828,0.33655825],"study_design_scores_gemma":[0.011337956,0.00040514593,0.3069931,0.0018507553,0.00012363112,0.0015719563,0.0011690297,0.47729218,0.0035812394,0.012922112,0.17874372,0.0040091784],"about_ca_topic_score_codex":0.00007887979,"about_ca_topic_score_gemma":0.000008159874,"teacher_disagreement_score":0.9290404,"about_ca_system_score_codex":0.000086268155,"about_ca_system_score_gemma":0.0000698251,"threshold_uncertainty_score":0.8291279},"labels":[],"label_agreement":null},{"id":"W1992598604","doi":"10.1007/s00446-011-0131-y","title":"How much memory is needed for leader election","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Logarithm; Class (philosophy); Computer science; Node (physics); Theory of computation; Exponential function; Topology (electrical circuits); Discrete mathematics; Binary logarithm; Combinatorics; Mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.041901846813373694,"score_gpt":0.24376545351609982,"score_spread":0.20186360670272613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992598604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01835001,0.00013949303,0.9776894,0.0011758531,0.0008895511,0.00039523328,0.000116973424,0.0004908159,0.000752655],"genre_scores_gemma":[0.98276985,0.0000013999153,0.016206201,0.00044822873,0.0002237811,0.000027702341,0.00011575705,0.000018223807,0.00018886966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980525,0.00005655859,0.00035405005,0.0006281577,0.0002608776,0.00064790505],"domain_scores_gemma":[0.9985731,0.000075592,0.00024623246,0.0006245383,0.0003364492,0.00014407116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033876736,0.00026036933,0.00031341054,0.00008582002,0.00039270436,0.00041397472,0.00092149957,0.00014319443,0.000007124259],"category_scores_gemma":[0.00006285042,0.0002581716,0.00018344908,0.00069630414,0.000040446634,0.00047962816,0.0001188376,0.00018529689,0.000020112033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018530859,0.0012694263,0.0029060082,0.00064135663,0.0006878547,0.00009826807,0.019421095,0.0005248918,0.015971778,0.20363306,0.3066598,0.44800118],"study_design_scores_gemma":[0.0025248383,0.0003588778,0.0029156832,0.00017134975,0.000045526,0.00010621762,0.0033032214,0.84645313,0.0945071,0.0050266255,0.043261517,0.0013259031],"about_ca_topic_score_codex":0.00009007869,"about_ca_topic_score_gemma":0.0000030052572,"teacher_disagreement_score":0.96441984,"about_ca_system_score_codex":0.00008593869,"about_ca_system_score_gemma":0.00005988154,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059305550587239415,"score_gpt":0.3061084122070256,"score_spread":0.2468028616197862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002043779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012546115,0.00028872222,0.98489213,0.0015536115,0.00006269715,0.0002080902,0.0000028653456,0.0000916274,0.00035415724],"genre_scores_gemma":[0.94638866,0.000030419626,0.05330833,0.00013974038,0.00009476651,0.0000031538318,0.000013418415,0.000007685759,0.00001381456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836975,0.00017187142,0.00045249486,0.00029301885,0.0002547074,0.00045816918],"domain_scores_gemma":[0.9986866,0.00023862037,0.00020719666,0.000542279,0.00025197834,0.000073304334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007236183,0.00010806442,0.00015862692,0.00008953804,0.0002421369,0.00018058115,0.000696437,0.000057680314,0.0000039168153],"category_scores_gemma":[0.0002610179,0.000097298696,0.000039253533,0.0023903772,0.00006120014,0.00016903004,0.0002589292,0.00018655058,0.000005285341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037352786,0.0000705622,0.0008436968,0.000015335221,0.000013299035,0.0000031854202,0.00054776017,0.94615513,0.00009674331,0.034569737,0.00025781067,0.017423004],"study_design_scores_gemma":[0.00024427316,0.00002998265,0.0008132493,0.00009114698,0.0000022144354,0.000008238987,0.00003161954,0.9976645,0.00006417422,0.00042515583,0.000526243,0.000099177516],"about_ca_topic_score_codex":0.00013668349,"about_ca_topic_score_gemma":0.0000067810274,"teacher_disagreement_score":0.93384254,"about_ca_system_score_codex":0.00011374412,"about_ca_system_score_gemma":0.00007241322,"threshold_uncertainty_score":0.3967726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Petri net; Formal specification; Language Of Temporal Ordering Specification; Distributed computing; Specification language; Programming language","score_opus":0.021220481621547042,"score_gpt":0.25719020437359713,"score_spread":0.23596972275205008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003887790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045055933,0.000012462031,0.9472336,0.00014580728,0.0000412989,0.0064211586,0.000015227918,0.00019419182,0.0008802757],"genre_scores_gemma":[0.9122661,2.189255e-7,0.08511596,0.0000386251,0.000019971058,0.0025364659,0.000003126953,0.000017562432,0.000001987306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747306,0.00039951009,0.00051504053,0.00064805534,0.00056540966,0.00039893275],"domain_scores_gemma":[0.9971817,0.0012714225,0.00043869263,0.0007786471,0.00021084097,0.00011867526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011199301,0.00026622385,0.00037762872,0.00022047444,0.00023968748,0.00018005121,0.00063697144,0.000094836796,0.000006240206],"category_scores_gemma":[0.00067870074,0.00022995344,0.0000606945,0.0009016638,0.00007708988,0.00016742376,0.000088073764,0.00015854789,0.0000022797365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033976955,0.0007202977,0.00780874,0.0005808541,0.00014189452,0.00007144059,0.001009777,0.8828897,0.0018633597,0.009658457,0.00029918397,0.09461655],"study_design_scores_gemma":[0.000533959,0.00017362002,0.0022939225,0.0006521863,0.000017331042,0.00001886575,0.000115446775,0.9665126,0.028813165,0.00003698091,0.000535754,0.00029613383],"about_ca_topic_score_codex":0.000013704691,"about_ca_topic_score_gemma":0.0000010286282,"teacher_disagreement_score":0.86721015,"about_ca_system_score_codex":0.00009276581,"about_ca_system_score_gemma":0.00011386843,"threshold_uncertainty_score":0.9377229},"labels":[],"label_agreement":null},{"id":"W2005147105","doi":"10.1007/s00446-011-0137-5","title":"Fully-adaptive algorithms for long-lived renaming","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto; Dalhousie University","funders":"","keywords":"Computer science; Asynchronous communication; Algorithm; Process (computing); Bounded function; Theoretical computer science; Mathematics; Programming language; Computer network","score_opus":0.0666930311508916,"score_gpt":0.2723594850737362,"score_spread":0.2056664539228446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005147105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008079177,0.00020867196,0.98851645,0.000070868875,0.0008670073,0.00048422886,0.00018758413,0.00054572395,0.0010402658],"genre_scores_gemma":[0.90370303,0.0000017759232,0.095773555,0.00008726402,0.00018823543,0.00003266505,0.0001608329,0.000020686639,0.000031974592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745685,0.000085209234,0.00058716204,0.00078041514,0.0002992217,0.00079112226],"domain_scores_gemma":[0.9981568,0.00017122395,0.0003375348,0.0007367075,0.00039419293,0.0002035372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056312134,0.00032044746,0.00040998182,0.00008775306,0.00044533037,0.00021514,0.001376604,0.00013780686,0.000007802539],"category_scores_gemma":[0.00007701012,0.00031908322,0.00020572076,0.0006368583,0.00006136308,0.00037521325,0.00026873214,0.00021247363,0.00003579983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022502869,0.0012588005,0.009931132,0.00032149412,0.0007215747,0.00047043356,0.010919681,0.0039609815,0.0011874489,0.26995456,0.010768696,0.6902802],"study_design_scores_gemma":[0.0012733401,0.00027355328,0.013694454,0.00019832782,0.00002474729,0.000059694226,0.00034093446,0.9756922,0.002392248,0.0023135524,0.0030132567,0.0007236713],"about_ca_topic_score_codex":0.000069185255,"about_ca_topic_score_gemma":0.0000040796517,"teacher_disagreement_score":0.97173125,"about_ca_system_score_codex":0.00011040963,"about_ca_system_score_gemma":0.00008071404,"threshold_uncertainty_score":0.99992615},"labels":[],"label_agreement":null},{"id":"W2015468161","doi":"10.1007/s00446-011-0146-4","title":"The minimum information about failures for solving non-local tasks in message-passing systems","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Message passing; Commit; Task (project management); Process (computing); Set (abstract data type); Function (biology); Distributed computing; Value (mathematics); Theory of computation; Theoretical computer science; Algorithm; Programming language; Machine learning","score_opus":0.014691213198245175,"score_gpt":0.23371146627504805,"score_spread":0.21902025307680287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015468161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086666355,0.00033584627,0.9880597,0.00015417874,0.0012057604,0.00059893815,0.00009404473,0.00018671437,0.00069818925],"genre_scores_gemma":[0.99601203,0.0000037386949,0.0036303713,0.000053735184,0.00009591403,0.0000653573,0.00011968069,0.000011067425,0.0000081172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752796,0.00008167002,0.00093192403,0.00035737487,0.00033386805,0.0007671803],"domain_scores_gemma":[0.9982021,0.0003382642,0.00046563565,0.0006016368,0.00027986907,0.00011252721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012366415,0.00025910098,0.00033278397,0.00010181929,0.00075467105,0.0010089304,0.0012940911,0.0001420483,8.1174556e-7],"category_scores_gemma":[0.00012461146,0.00021019725,0.0001181341,0.00063062273,0.00008400942,0.0010111626,0.00021881331,0.00025112508,0.000014593132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018215338,0.00039129105,0.008705511,0.0010316911,0.00029691862,0.0000838076,0.020887747,0.08146242,0.00073126156,0.32737255,0.023207119,0.5356475],"study_design_scores_gemma":[0.0007129982,0.000045897825,0.0067194435,0.0003252561,0.0000064521614,0.00001701964,0.0013450567,0.9761412,0.000272846,0.0002637322,0.013849916,0.000300138],"about_ca_topic_score_codex":0.00038851946,"about_ca_topic_score_gemma":0.000024910998,"teacher_disagreement_score":0.9873454,"about_ca_system_score_codex":0.0001603021,"about_ca_system_score_gemma":0.00011489167,"threshold_uncertainty_score":0.9729139},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05841268452614844,"score_gpt":0.36737204169785637,"score_spread":0.3089593571717079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025273848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47223973,0.00000947833,0.52617896,0.00043535256,0.000121435536,0.000070198716,0.000027462926,0.00003866615,0.0008787177],"genre_scores_gemma":[0.99940187,6.491769e-7,0.00027352432,0.000056708297,0.000045021607,0.0000047129683,0.00019659787,0.000004037872,0.00001687831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985334,0.00025564907,0.00043623662,0.00028463092,0.00031310273,0.00017696669],"domain_scores_gemma":[0.99774843,0.0015681651,0.00019217406,0.0002681944,0.00016941504,0.000053615677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972244,0.00008425726,0.00015342717,0.000102022415,0.00011213014,0.00013301923,0.00033228955,0.000046451532,0.000023988132],"category_scores_gemma":[0.0018271873,0.00007516209,0.000041982687,0.0006676673,0.00006139937,0.000087460525,0.0000516372,0.00012555569,0.00013897232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033173046,0.00005375535,0.02766988,0.000002326422,0.0000025319125,5.180073e-7,0.00016941648,0.02013549,0.000123945,0.5049187,0.00028301618,0.44663712],"study_design_scores_gemma":[0.000254535,0.000018701683,0.10059609,0.00001920991,0.0000032769344,0.0000020451048,0.00072866946,0.8197853,0.00011582385,0.0767752,0.0016014795,0.000099691366],"about_ca_topic_score_codex":0.000009114995,"about_ca_topic_score_gemma":0.000027590058,"teacher_disagreement_score":0.7996498,"about_ca_system_score_codex":0.00009547413,"about_ca_system_score_gemma":0.000016383148,"threshold_uncertainty_score":0.3065021},"labels":[],"label_agreement":null},{"id":"W2034109654","doi":"10.1007/s00446-008-0069-x","title":"Lower bound for scalable Byzantine Agreement","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scalability; Omega; Upper and lower bounds; Binary logarithm; String (physics); Parallel computing; Combinatorics; Discrete mathematics; Mathematics; Physics; Operating system","score_opus":0.02167600237742189,"score_gpt":0.2504902375396287,"score_spread":0.22881423516220678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034109654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05905445,0.00024701803,0.93728054,0.00046037097,0.0009832223,0.00039300657,0.00018453358,0.00032497308,0.0010718835],"genre_scores_gemma":[0.9834828,0.00000575302,0.015578427,0.0002208117,0.000242085,0.000022248669,0.00023415376,0.000014275759,0.0001994739],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768746,0.000043464304,0.00053555274,0.00063178793,0.00037079718,0.00073093845],"domain_scores_gemma":[0.9984337,0.00013355911,0.00022327928,0.00072339864,0.0003140929,0.00017198747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039909108,0.00025784917,0.0003581341,0.00006131891,0.00073543517,0.00022443233,0.0010259667,0.00009233029,0.000012070353],"category_scores_gemma":[0.0000698311,0.00025265012,0.00017769828,0.00063740835,0.00006802525,0.00029527416,0.00021269998,0.00014446073,0.000075297256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001991462,0.0030224097,0.029541373,0.00058273383,0.0006675191,0.0008480909,0.0020728833,0.03555658,0.008683004,0.32807243,0.4848797,0.10587413],"study_design_scores_gemma":[0.002059432,0.00022285324,0.007867376,0.00013692085,0.000013753962,0.00016179874,0.000039792736,0.742118,0.0022760392,0.00051504426,0.24386266,0.0007263445],"about_ca_topic_score_codex":0.000031478154,"about_ca_topic_score_gemma":0.0000016502058,"teacher_disagreement_score":0.92442834,"about_ca_system_score_codex":0.00006373929,"about_ca_system_score_gemma":0.00010183659,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033862512938887826,"score_gpt":0.2757959318795185,"score_spread":0.2419334189406307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034873526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04993527,0.00012625697,0.937053,0.00041749913,0.00020106435,0.00027164948,0.00017659328,0.0117539335,0.000064726955],"genre_scores_gemma":[0.79041576,0.000001979198,0.20905448,0.00016122998,0.00014457884,0.000021545817,0.00018066347,0.000015683174,0.000004039162],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979245,0.000054358123,0.00041931763,0.00063200825,0.0003043259,0.0006654899],"domain_scores_gemma":[0.99703836,0.0016995316,0.0002340567,0.0006446163,0.00023913005,0.00014430108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004148962,0.00028628882,0.00031691624,0.00011688059,0.00086647266,0.0001864089,0.0013084562,0.00010501044,0.0000015849032],"category_scores_gemma":[0.001871619,0.00027234925,0.00015651554,0.00076953595,0.00013333588,0.00011504889,0.00027263406,0.00024388998,0.0000057153497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060494855,0.0011749227,0.54310775,0.0004293135,0.00027225623,0.00054474943,0.00480683,0.041614097,0.005512746,0.018855192,0.14221185,0.24140978],"study_design_scores_gemma":[0.0007685233,0.0003327656,0.036348216,0.00025637756,0.00001929675,0.0006502106,0.00001838127,0.907324,0.011624095,0.038982123,0.0027068714,0.0009691376],"about_ca_topic_score_codex":0.00005289096,"about_ca_topic_score_gemma":0.0000011497563,"teacher_disagreement_score":0.8657099,"about_ca_system_score_codex":0.00009239567,"about_ca_system_score_gemma":0.00012730413,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2038924034","doi":"10.1007/s00446-003-0091-y","title":"Hundreds of impossibility results for distributed computing","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Impossibility; Variety (cybernetics); Distributed computing; Theory of computation; Theoretical computer science; Resource (disambiguation); Fault tolerance; Resource allocation; Algorithm; Artificial intelligence; Computer network","score_opus":0.020728668085622966,"score_gpt":0.27631319757487316,"score_spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038924034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0701034,0.00024155412,0.9239806,0.0001582736,0.0008600277,0.0007113399,0.00279796,0.00041907508,0.0007277523],"genre_scores_gemma":[0.9647329,0.0000019834968,0.03399343,0.00005056236,0.0001029492,0.000010339468,0.0010723416,0.00002264625,0.000012835715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951001,0.00031715608,0.0017953503,0.0011737263,0.00054261537,0.0010710887],"domain_scores_gemma":[0.99547213,0.00088231085,0.0010285743,0.0015050174,0.00083247933,0.0002794753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023464195,0.000462003,0.00085684774,0.00011864629,0.00053992093,0.00028571472,0.0015378916,0.00023364997,0.0000025501402],"category_scores_gemma":[0.0011927445,0.00047565135,0.00039564367,0.0015622608,0.00014261607,0.0003372133,0.00025078093,0.00031564623,0.000007963256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005797469,0.0032914907,0.034575474,0.0017839014,0.0009596645,0.000115463605,0.0039144857,0.11651411,0.011697661,0.67928636,0.033211455,0.1140702],"study_design_scores_gemma":[0.007730723,0.00052301347,0.020863,0.0005422675,0.00006716172,0.00010060928,0.0005135322,0.90995026,0.019385934,0.0054685483,0.033269595,0.0015853314],"about_ca_topic_score_codex":0.000043395943,"about_ca_topic_score_gemma":0.000004831496,"teacher_disagreement_score":0.89462954,"about_ca_system_score_codex":0.00020324647,"about_ca_system_score_gemma":0.00024263687,"threshold_uncertainty_score":0.9997695},"labels":[],"label_agreement":null},{"id":"W2042734235","doi":"10.1007/s00446-012-0158-8","title":"Partial synchrony based on set timeliness","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Generalization; Set (abstract data type); Simple (philosophy); Simplicity; Computer science; Theory of computation; Agreement; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Physics","score_opus":0.020088775776242573,"score_gpt":0.26762045343549734,"score_spread":0.24753167765925477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042734235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02174422,0.000117205345,0.9746499,0.00040218135,0.0013176467,0.00017530975,0.00018678502,0.0005169658,0.00088979927],"genre_scores_gemma":[0.99432516,4.1778415e-7,0.004250524,0.00047284953,0.0005857969,0.000010196111,0.00032892084,0.000015818432,0.000010330988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975591,0.00015338924,0.00045463952,0.00046422717,0.00047308017,0.0008955759],"domain_scores_gemma":[0.99831367,0.00019584464,0.00020248396,0.0008559452,0.00013320943,0.00029882637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006880685,0.0002857314,0.0003153556,0.00007534583,0.0003112705,0.00024944035,0.00095935963,0.000116991214,0.000023513367],"category_scores_gemma":[0.000067296074,0.00026759057,0.00013242144,0.00073834526,0.000038696682,0.00035296366,0.00015208965,0.00024931258,0.00029606587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390699,0.0030047132,0.07860126,0.00037261704,0.00024728794,0.00021847918,0.0014804201,0.39919835,0.001718489,0.18356985,0.10157469,0.22987476],"study_design_scores_gemma":[0.0005476991,0.000050799612,0.0056480374,0.000095471434,0.00000737046,0.00001329033,0.000025736197,0.9646257,0.0010639203,0.000027804002,0.027535018,0.0003591328],"about_ca_topic_score_codex":0.000015967782,"about_ca_topic_score_gemma":2.92607e-7,"teacher_disagreement_score":0.9725809,"about_ca_system_score_codex":0.00011493333,"about_ca_system_score_gemma":0.00007116236,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; 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","score_opus":0.00994954787033086,"score_gpt":0.2380018821562034,"score_spread":0.22805233428587254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045008360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0406001,0.0009896178,0.95512253,0.00012146942,0.000929313,0.00023809052,0.0000041584044,0.0009136105,0.0010811373],"genre_scores_gemma":[0.9526423,0.000013536529,0.04644236,0.00026422102,0.00052031013,0.0000034285245,0.000066072345,0.000027920452,0.000019807603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690217,0.00010109402,0.00061959604,0.000746901,0.00041018758,0.0012200286],"domain_scores_gemma":[0.9975677,0.00070705113,0.00034315392,0.0009480837,0.00015496838,0.00027902858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013224808,0.00032431757,0.00034213846,0.000100564896,0.0004922289,0.00035132322,0.0015382397,0.00019156632,0.000013186233],"category_scores_gemma":[0.00009759024,0.00034591032,0.00013937266,0.001466398,0.000059223043,0.00036308233,0.00056021643,0.0006278079,0.000024664088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019358118,0.0001006666,0.0023030897,0.0000135452,0.0000567152,0.00021758823,0.00035326014,0.13468723,0.0003952855,0.009692151,0.00338346,0.84877765],"study_design_scores_gemma":[0.0004944142,0.00007486858,0.010184434,0.00007655543,0.0000063184666,0.00008570416,0.00006152574,0.9788202,0.00074033235,0.00024492198,0.008751506,0.00045921418],"about_ca_topic_score_codex":0.000008739841,"about_ca_topic_score_gemma":0.000005538795,"teacher_disagreement_score":0.91204226,"about_ca_system_score_codex":0.00022078205,"about_ca_system_score_gemma":0.000060409842,"threshold_uncertainty_score":0.99989927},"labels":[],"label_agreement":null},{"id":"W2050846431","doi":"10.1007/s00446-012-0168-6","title":"A framework for automated distributed implementation of component-based models","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Distributed computing; Asynchronous communication; Synchronizing; Component (thermodynamics); Implementation; POSIX Threads; Scheduling (production processes); Software deployment; Partition (number theory); Correctness; Distributed algorithm; Programming language; Thread (computing); Operating system; Computer network","score_opus":0.03403358076798483,"score_gpt":0.326526578156011,"score_spread":0.29249299738802614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050846431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036409445,0.000175838,0.9583027,0.00024824863,0.00062803715,0.0006810318,0.0025438664,0.0009861721,0.000024692386],"genre_scores_gemma":[0.8769027,8.277548e-7,0.12059265,0.000085056614,0.000112826856,0.000045259265,0.0022399009,0.000020268368,5.267534e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709624,0.00013406783,0.00092476344,0.0004588895,0.00044555342,0.0009404991],"domain_scores_gemma":[0.997484,0.00045794842,0.0006688433,0.00072823034,0.00041253347,0.00024839607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074572704,0.00032577966,0.0005268579,0.00011409341,0.00029135018,0.00015372888,0.00095402676,0.00017125263,0.000006444982],"category_scores_gemma":[0.00007134611,0.0003341535,0.00023818832,0.0009781207,0.000055044282,0.00059197756,0.00015151662,0.0001773976,0.0000065234253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006517652,0.0009544241,0.015634336,0.00048676238,0.00027003602,0.000005401835,0.0011806907,0.17871279,0.0022920694,0.7693945,0.009006813,0.021996971],"study_design_scores_gemma":[0.0011828928,0.0000782453,0.009052184,0.00015237725,0.000027630094,0.000005865738,0.00024716795,0.9819377,0.0036543491,0.0021547065,0.0011332661,0.0003735814],"about_ca_topic_score_codex":0.00007768668,"about_ca_topic_score_gemma":0.0000015226341,"teacher_disagreement_score":0.84049326,"about_ca_system_score_codex":0.00015329309,"about_ca_system_score_gemma":0.00012063349,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"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","score_opus":0.008946229700157711,"score_gpt":0.23318935829744994,"score_spread":0.22424312859729223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051628581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103913195,0.00035059362,0.89360297,0.00010029588,0.0006577318,0.00018742912,0.000004814622,0.000355981,0.0008269847],"genre_scores_gemma":[0.9701331,0.0000024391147,0.029081186,0.00008153415,0.0005731522,0.0000102021595,0.00008130982,0.000019563324,0.000017508099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715495,0.00018969149,0.0006933087,0.00072322396,0.00021140593,0.0010273925],"domain_scores_gemma":[0.9983964,0.0005409358,0.00024249859,0.00063713704,0.00007370741,0.00010932849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005045452,0.00029107716,0.0003941824,0.00012261701,0.00024040048,0.0002538971,0.0011849557,0.00018316931,0.000012688703],"category_scores_gemma":[0.00006626553,0.00032562512,0.0000968609,0.0010336819,0.000092216535,0.00019579919,0.0004991091,0.00049953506,0.0000179728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053596345,0.0000713549,0.008630696,0.000007831039,0.000007190398,0.00027007292,0.00005287826,0.9397498,0.000034680386,0.014679495,0.00088618137,0.035604462],"study_design_scores_gemma":[0.0005027802,0.000056359666,0.018729532,0.00006218703,0.0000055045625,0.00013423724,0.0000140824695,0.9787828,0.000044769935,0.00040187,0.00094134966,0.000324527],"about_ca_topic_score_codex":0.00014946076,"about_ca_topic_score_gemma":0.000032069613,"teacher_disagreement_score":0.86621994,"about_ca_system_score_codex":0.00017859142,"about_ca_system_score_gemma":0.00006764897,"threshold_uncertainty_score":0.9999196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"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","score_opus":0.02343529895674592,"score_gpt":0.26424040785154046,"score_spread":0.24080510889479453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057121017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013183068,0.00004265402,0.98164755,0.0033102618,0.00023330559,0.0005058224,0.000019467316,0.00028790822,0.00076996477],"genre_scores_gemma":[0.94594216,0.0000027126189,0.053666584,0.00009954915,0.00005783082,0.000026059135,0.000118472264,0.0000116277,0.00007498762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866927,0.000069800786,0.0002619957,0.00035297617,0.00018294409,0.00046303714],"domain_scores_gemma":[0.99908614,0.00033135407,0.00008206448,0.00031684348,0.00007145182,0.00011215535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026012814,0.00013504678,0.00017787886,0.00009703777,0.00013541443,0.00025290696,0.00062648655,0.00006617559,0.0000239313],"category_scores_gemma":[0.00011379376,0.00013569363,0.00006407197,0.00056986394,0.000033863646,0.00029324542,0.00013015047,0.00013436041,0.000072175826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106483254,0.0008116948,0.001960839,0.0001066889,0.0001308964,0.000035842568,0.0042242263,0.5129594,0.0039804624,0.0930328,0.06659097,0.31605965],"study_design_scores_gemma":[0.0013788342,0.00009871519,0.002067086,0.000021697355,0.0000017881398,0.0000019973686,0.000053210515,0.99321085,0.0002490576,0.0005885724,0.002158708,0.0001694754],"about_ca_topic_score_codex":0.00003269019,"about_ca_topic_score_gemma":0.0000062569925,"teacher_disagreement_score":0.9327591,"about_ca_system_score_codex":0.000080579026,"about_ca_system_score_gemma":0.00005314161,"threshold_uncertainty_score":0.5533425},"labels":[],"label_agreement":null},{"id":"W2058204792","doi":"10.1007/s00446-014-0227-2","title":"The complexity of automated addition of fault-tolerance without explicit legitimate states","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Set (abstract data type); Computer science; State (computer science); Fault tolerance; Fault model; Identification (biology); Polynomial; Fault (geology); Reliability engineering; Algorithm; Theoretical computer science; Distributed computing; Mathematics; Engineering; Programming language","score_opus":0.019660953845410882,"score_gpt":0.2609594278962686,"score_spread":0.2412984740508577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058204792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13025703,0.00011041156,0.8673805,0.00025460438,0.00031957298,0.00025208155,0.0005421471,0.0005381932,0.0003454828],"genre_scores_gemma":[0.9941862,0.0000073968918,0.0053340625,0.000039935774,0.000056540764,0.000010541369,0.00034782942,0.000012581672,0.0000049046694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744284,0.00024516528,0.00092368934,0.00041588573,0.00047888453,0.00049352215],"domain_scores_gemma":[0.9972537,0.00037173243,0.00086360547,0.00088642945,0.000527483,0.000097014105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082559435,0.0002465942,0.00051980134,0.000051876446,0.00039945188,0.00016324672,0.0013188635,0.00007930574,0.0000031551203],"category_scores_gemma":[0.00012300575,0.00019535149,0.00013634843,0.00070426334,0.00032464848,0.00025182436,0.00021693979,0.0001722938,0.000009172862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012125453,0.0006032411,0.006679233,0.00068263366,0.00028784477,0.000010467024,0.002024692,0.19059423,0.0119011775,0.7133087,0.014825823,0.058960736],"study_design_scores_gemma":[0.00054668286,0.00007594873,0.009674996,0.00024566374,0.000007701393,0.000009510077,0.00009609925,0.97816443,0.0058447304,0.0023283658,0.002797384,0.00020850498],"about_ca_topic_score_codex":0.0001083536,"about_ca_topic_score_gemma":0.000008386373,"teacher_disagreement_score":0.86392915,"about_ca_system_score_codex":0.000043960394,"about_ca_system_score_gemma":0.00004846201,"threshold_uncertainty_score":0.79662025},"labels":[],"label_agreement":null},{"id":"W2063992960","doi":"10.1007/s00446-011-0150-8","title":"RMR-efficient implementations of comparison primitives using read and write operations","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Swap (finance); Asynchronous communication; Shared memory; Reading (process); Constant (computer programming); Distributed shared memory; Cache; Implementation; Programming language; Uniform memory access; Memory management; Overlay; Computer network","score_opus":0.07288501185737015,"score_gpt":0.31795905169134403,"score_spread":0.24507403983397388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063992960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29658124,0.00015130718,0.70240873,0.000024539206,0.00011768169,0.00016593888,0.00018656379,0.000072035225,0.00029196285],"genre_scores_gemma":[0.93884426,0.000002227875,0.060993176,0.000020262649,0.000022741055,0.0000037419777,0.00010474249,0.0000065820677,0.0000022331312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983964,0.00009620574,0.0006168203,0.00037021172,0.00020477427,0.0003155921],"domain_scores_gemma":[0.9990048,0.000069750065,0.00020827708,0.00037601416,0.0002387598,0.00010240719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318955,0.0001592405,0.00028448165,0.0000852308,0.00033936382,0.0001186566,0.0004089652,0.000048221307,0.000011234803],"category_scores_gemma":[0.000037264537,0.00016061524,0.000056484394,0.0005148532,0.00008651978,0.00018393411,0.0002127437,0.000109414024,0.0000025225204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003084481,0.001637405,0.102253504,0.0002548633,0.00033159606,0.000036199126,0.028422303,0.15773298,0.014832729,0.6206006,0.0005316175,0.07333537],"study_design_scores_gemma":[0.00037772005,0.000052250143,0.035223946,0.00009526396,0.000017233251,0.000017776969,0.0009404147,0.9604916,0.0022318687,0.000098735254,0.00025531434,0.00019785247],"about_ca_topic_score_codex":0.00031067952,"about_ca_topic_score_gemma":0.000011765444,"teacher_disagreement_score":0.80275863,"about_ca_system_score_codex":0.000043065622,"about_ca_system_score_gemma":0.000061758095,"threshold_uncertainty_score":0.65496993},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; 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","score_opus":0.026435736169659056,"score_gpt":0.27016343630201634,"score_spread":0.24372770013235728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064766370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046012245,0.000053469692,0.95194066,0.00047886136,0.000082161,0.0001723116,0.0000019035162,0.00031712366,0.0009412602],"genre_scores_gemma":[0.9344643,0.0000036496208,0.06502947,0.0003081371,0.00008802236,0.000004946898,0.000060179165,0.000012354396,0.000028976783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982025,0.00017316134,0.00027022758,0.00043960198,0.00026765524,0.0006468433],"domain_scores_gemma":[0.9991256,0.00009983741,0.000096537486,0.00039067565,0.00013636693,0.00015097928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048106295,0.00016029592,0.00019153676,0.00008827264,0.00022949354,0.0003711723,0.00065931043,0.00006492433,0.0000107300975],"category_scores_gemma":[0.000023074346,0.00014517872,0.000024700419,0.0016189216,0.000038952152,0.00046774038,0.00014467338,0.00027020194,0.000013084503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010590512,0.0001157993,0.055585895,0.0000067564774,0.000010252363,0.00014111205,0.0005622576,0.9057184,0.0000554653,0.009981291,0.00027330677,0.027538896],"study_design_scores_gemma":[0.00065354875,0.00013516698,0.008366898,0.000083100305,0.0000019755757,0.000035064768,0.000062652594,0.9888267,0.000036332644,0.0002977448,0.0012697546,0.00023104688],"about_ca_topic_score_codex":0.000022749637,"about_ca_topic_score_gemma":0.000041490708,"teacher_disagreement_score":0.888452,"about_ca_system_score_codex":0.00006708842,"about_ca_system_score_gemma":0.00008658072,"threshold_uncertainty_score":0.5920217},"labels":[],"label_agreement":null},{"id":"W2067397086","doi":"10.1007/s00446-007-0042-0","title":"Anonymous and fault-tolerant shared-memory computing","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Identifier; Asynchronous communication; Object (grammar); Distributed computing; Shared memory; Theoretical computer science; Theory of computation; Parallel computing; Programming language; Computer network; Artificial intelligence","score_opus":0.01069697413433289,"score_gpt":0.24789450467668148,"score_spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067397086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20572568,0.00060589623,0.79044056,0.00020376385,0.0006505979,0.00024605557,0.00008548668,0.00065039983,0.001391534],"genre_scores_gemma":[0.9837412,0.0000035009218,0.015430464,0.00032283232,0.000304431,0.0000016495503,0.00014533734,0.000024536797,0.000026040518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963823,0.00009315432,0.0008939746,0.0009682222,0.00052917446,0.0011331541],"domain_scores_gemma":[0.99783397,0.00034901046,0.000372009,0.0007990343,0.0002647006,0.00038129132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014697112,0.00042201477,0.0005309588,0.00015500972,0.00068023114,0.0006677269,0.001181139,0.00018527242,0.0000064840747],"category_scores_gemma":[0.000090705544,0.00042714333,0.0001323113,0.00101318,0.00010552255,0.00043713683,0.00058474246,0.00043960856,0.00004120814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006265619,0.00053630647,0.023990758,0.00036148037,0.00022886648,0.001446018,0.0052301213,0.017368902,0.0052018766,0.047756337,0.007355185,0.8904615],"study_design_scores_gemma":[0.0016430947,0.00011926776,0.07002632,0.0003556416,0.000018577051,0.00050844124,0.0006129013,0.9139845,0.001429731,0.00033913055,0.009898175,0.0010642576],"about_ca_topic_score_codex":0.00008675518,"about_ca_topic_score_gemma":0.000011183159,"teacher_disagreement_score":0.89661556,"about_ca_system_score_codex":0.0001238267,"about_ca_system_score_gemma":0.00006818712,"threshold_uncertainty_score":0.999818},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"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","score_opus":0.018240203983219558,"score_gpt":0.22659130100555924,"score_spread":0.20835109702233967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069239201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029370604,0.001958009,0.9664992,0.00013308703,0.00063765846,0.00022488782,0.0000048548513,0.00046343007,0.00070824975],"genre_scores_gemma":[0.98625296,0.000040167513,0.01323026,0.00017328441,0.00022344018,0.000010177322,0.000025607138,0.000022613207,0.00002146812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721444,0.00016851845,0.00062786293,0.00072894385,0.0002897019,0.0009705151],"domain_scores_gemma":[0.998195,0.00051570876,0.00023331023,0.0008024945,0.000066731256,0.00018676794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004501525,0.00029668288,0.00036692747,0.000118996715,0.00024454753,0.0003384709,0.0013697149,0.00014761533,0.000033954788],"category_scores_gemma":[0.00012407015,0.00033150933,0.000101466736,0.0014059689,0.000055644883,0.00026638107,0.000456397,0.0005549071,0.000056361543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004272357,0.00012176626,0.0041271187,0.000017858707,0.000017396249,0.0004395492,0.0004357012,0.3723145,0.000025077352,0.0021026125,0.002227434,0.6181667],"study_design_scores_gemma":[0.00051841163,0.00005767775,0.005192597,0.00013130684,0.0000051235115,0.00009340924,0.000017868166,0.9914877,0.000012222772,0.0001378047,0.0019971966,0.0003487045],"about_ca_topic_score_codex":0.000006697932,"about_ca_topic_score_gemma":0.0000066866182,"teacher_disagreement_score":0.95688236,"about_ca_system_score_codex":0.00017392283,"about_ca_system_score_gemma":0.000020601834,"threshold_uncertainty_score":0.9999137},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01993346998580042,"score_gpt":0.2626555313645435,"score_spread":0.24272206137874308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072592698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034731824,0.0003571889,0.96282786,0.00029925894,0.00094092946,0.00025118652,0.00006781268,0.00030970498,0.00021421413],"genre_scores_gemma":[0.98732466,0.0000029326782,0.011961341,0.0001052867,0.00044405082,0.000007116283,0.00013611563,0.000015780375,0.0000027416552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969716,0.00031044387,0.0007194949,0.00041479283,0.00052025774,0.0010633785],"domain_scores_gemma":[0.99725944,0.00073263136,0.0005030557,0.0011042834,0.00019145252,0.00020914839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021130312,0.00027431222,0.0003715221,0.00004378545,0.0005724178,0.00022110184,0.0017605567,0.00011934701,0.000009141038],"category_scores_gemma":[0.00023368507,0.00021714061,0.00017420904,0.0013476813,0.0001569518,0.00045857998,0.0008532379,0.00044757576,0.00001758864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025068053,0.0008553764,0.19603497,0.00014842344,0.000400205,0.000029841935,0.0044286987,0.056211345,0.0012314012,0.45776343,0.004956369,0.27791485],"study_design_scores_gemma":[0.0003381468,0.000031265114,0.03338959,0.00009121,0.000025961504,0.000040571467,0.00024692054,0.9599534,0.0022001797,0.00068499567,0.002658164,0.00033956452],"about_ca_topic_score_codex":0.00006780164,"about_ca_topic_score_gemma":0.000001440185,"teacher_disagreement_score":0.9525928,"about_ca_system_score_codex":0.00016980642,"about_ca_system_score_gemma":0.000066966335,"threshold_uncertainty_score":0.88547367},"labels":[],"label_agreement":null},{"id":"W2075811253","doi":"10.1007/s00446-010-0093-5","title":"Broadcasting in UDG radio networks with missing and inaccurate information","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Radio broadcasting; Position (finance); Unit disk; Granularity; Computer network; Topology (electrical circuits); Constant (computer programming); Euclidean distance; Algorithm; Network topology; Node (physics); Mathematics; Discrete mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.005497823584374866,"score_gpt":0.20698768423502492,"score_spread":0.20148986065065005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075811253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2176366,0.00004662856,0.7813926,0.000149364,0.00021357158,0.00014519317,0.0000017417635,0.00016975345,0.00024457145],"genre_scores_gemma":[0.9606811,0.0000025039042,0.039039288,0.00011835819,0.00010432697,0.0000039628953,0.000041883155,0.000007775773,8.0728967e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.00005528726,0.00038556205,0.00029054837,0.0001773283,0.00047471392],"domain_scores_gemma":[0.9989538,0.00022711729,0.0002349139,0.00037045978,0.000090526315,0.0001231418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235382,0.00018429171,0.00020112372,0.000096716176,0.00022975876,0.00060313306,0.0004589591,0.00010676784,0.0000022395964],"category_scores_gemma":[0.00007755389,0.0001734679,0.000020923904,0.00081717875,0.000054988643,0.0010725508,0.00023658208,0.000631932,0.0000027163776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017380273,0.000032115648,0.037969455,0.00003170944,0.000015314235,0.000047429392,0.00085645233,0.28895387,0.00018878862,0.010007584,0.00022787301,0.661652],"study_design_scores_gemma":[0.0005104913,0.00003104532,0.03218479,0.00009773889,0.0000030243039,0.0000998798,0.000037467373,0.9659697,0.000062597624,0.00012943425,0.0006607239,0.00021312885],"about_ca_topic_score_codex":0.000044647204,"about_ca_topic_score_gemma":0.000022572593,"teacher_disagreement_score":0.7430445,"about_ca_system_score_codex":0.00004272111,"about_ca_system_score_gemma":0.000053075368,"threshold_uncertainty_score":0.70738155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"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","score_opus":0.012430973757408781,"score_gpt":0.2426073737867117,"score_spread":0.23017640002930292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078130991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360677,0.000040237046,0.86330265,0.000050608836,0.00006506829,0.00014277862,0.00001007705,0.00015053246,0.00017033615],"genre_scores_gemma":[0.9597098,0.0000051013167,0.040157344,0.0000506321,0.00002587805,0.0000061505025,0.00003171774,0.000007462374,0.000005916609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.00008062833,0.0002877124,0.00030581097,0.00034812896,0.00035672018],"domain_scores_gemma":[0.9988963,0.00021165817,0.00020147262,0.00036908148,0.00022011365,0.00010136559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043592913,0.00012977955,0.00020675694,0.00019835122,0.00015538732,0.00014053028,0.00071505946,0.000042694646,0.000009520794],"category_scores_gemma":[0.0000530751,0.00010777078,0.000044960012,0.0012949554,0.000040054136,0.00026009206,0.00018550502,0.00012563962,0.0000067406922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033626209,0.0000981594,0.023720413,0.00007525365,0.000023097475,0.0000069190705,0.00041173087,0.8573546,0.00029616768,0.005674541,0.00005605021,0.11227969],"study_design_scores_gemma":[0.0003662229,0.00029351935,0.004105759,0.00009492207,0.0000044710837,0.000016551452,0.00006716981,0.99168867,0.0028832168,0.00012272657,0.00017199086,0.00018476292],"about_ca_topic_score_codex":0.000044014716,"about_ca_topic_score_gemma":0.0000031402897,"teacher_disagreement_score":0.8236421,"about_ca_system_score_codex":0.000034182194,"about_ca_system_score_gemma":0.000048105983,"threshold_uncertainty_score":0.4394765},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.02571712385047296,"score_gpt":0.27218891363136144,"score_spread":0.2464717897808885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078479354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014964041,0.00005521298,0.9831005,0.0005573628,0.00024091825,0.0005714511,0.0000029818364,0.00022160696,0.00028596752],"genre_scores_gemma":[0.9633964,0.0000049798787,0.035872456,0.00044126666,0.000086645945,0.00004019554,0.00012677175,0.000010923158,0.000020383173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986342,0.000072303075,0.00029321044,0.0003496537,0.00014080919,0.0005097983],"domain_scores_gemma":[0.999327,0.00011578469,0.00008743888,0.00024264942,0.00013305372,0.000094056355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473144,0.00013003805,0.00015125834,0.00010130453,0.00017532033,0.00029397933,0.00045230566,0.00008507768,0.00002091949],"category_scores_gemma":[0.000040266797,0.00013495503,0.00005556806,0.0006371299,0.000020532678,0.0003658398,0.00010015002,0.00019982575,0.00002622066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055593046,0.00019208725,0.0064295153,0.000030971547,0.00002305493,0.0000067703218,0.00034854736,0.89161485,0.00010892744,0.0065487768,0.006307293,0.088383615],"study_design_scores_gemma":[0.00046729608,0.000058511392,0.009239513,0.000022803268,0.0000013168319,0.000005521842,0.00002303132,0.9886977,0.00010460728,0.0008509746,0.00037683704,0.00015187262],"about_ca_topic_score_codex":0.00006558423,"about_ca_topic_score_gemma":0.000004486258,"teacher_disagreement_score":0.9484323,"about_ca_system_score_codex":0.00010292724,"about_ca_system_score_gemma":0.000052071624,"threshold_uncertainty_score":0.55033064},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Topology (electrical circuits); Telecommunications; Radio broadcasting; Engineering; Electrical engineering","score_opus":0.02864918246934317,"score_gpt":0.25244163591408386,"score_spread":0.2237924534447407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088895311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09347284,0.0006521397,0.90385336,0.00048316258,0.00014076217,0.000115428134,8.6828004e-7,0.00023042648,0.0010509954],"genre_scores_gemma":[0.98338705,0.00011486193,0.016121738,0.00022335959,0.00008697098,0.0000046796627,0.000030639396,0.000009749263,0.000020970896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843836,0.00021889943,0.000333761,0.00038851693,0.00014406886,0.00047638587],"domain_scores_gemma":[0.9987656,0.0002952102,0.0001295828,0.0005982444,0.0001206742,0.00009068753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031789203,0.00017741807,0.00025130823,0.00009921859,0.00047523875,0.00007812575,0.00096695306,0.000067868605,0.000009496292],"category_scores_gemma":[0.00005673952,0.00016607241,0.000040019368,0.0012599826,0.00010431455,0.00018768289,0.00038924234,0.000405152,0.000006910729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003470641,0.00027193755,0.1201956,0.000013836923,0.00006143095,0.00047860763,0.0028832878,0.5427346,0.00018437851,0.08936605,0.0022277595,0.24154778],"study_design_scores_gemma":[0.0005954254,0.000058799484,0.02861268,0.00007069502,0.0000020157077,0.00020128468,0.000028107603,0.9661343,0.00006341604,0.000039186536,0.0039541945,0.00023987897],"about_ca_topic_score_codex":0.000014670983,"about_ca_topic_score_gemma":0.000031524967,"teacher_disagreement_score":0.8899142,"about_ca_system_score_codex":0.00010187216,"about_ca_system_score_gemma":0.000077869365,"threshold_uncertainty_score":0.6772236},"labels":[],"label_agreement":null},{"id":"W2091544818","doi":"10.1007/s00446-006-0019-4","title":"The weakest failure detector to solve nonuniform consensus","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Computer science; Theory of computation; Consensus; Distributed computing; Algorithm; Telecommunications; Artificial intelligence; Multi-agent system","score_opus":0.008785664092193463,"score_gpt":0.24358182893036828,"score_spread":0.2347961648381748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091544818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05020417,0.000120138146,0.94463056,0.0022748432,0.0009610055,0.0003610759,0.00009569363,0.0004464957,0.0009060306],"genre_scores_gemma":[0.9825905,8.946805e-7,0.016718797,0.0003413366,0.00026196367,0.000006013976,0.000034936063,0.000015920703,0.000029634979],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99712795,0.000041189152,0.00067235494,0.0005757377,0.00049323466,0.001089556],"domain_scores_gemma":[0.9973776,0.0006534647,0.00023705482,0.0010102892,0.00035599465,0.00036560406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014599396,0.0002940848,0.0002852704,0.000074408534,0.0010664777,0.00067406375,0.0017463651,0.00012040327,0.0000024827457],"category_scores_gemma":[0.00022600946,0.00022597618,0.0001387472,0.0012499824,0.000078607154,0.000108121545,0.00036221818,0.00033290984,0.00016121249],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012336623,0.00029388134,0.00409085,0.00008504108,0.0002681248,0.00063750456,0.002231699,0.00941796,0.010411859,0.33263135,0.08170771,0.55810064],"study_design_scores_gemma":[0.0015826563,0.0002973772,0.031189565,0.00027515576,0.000022957905,0.0003673042,0.0016054858,0.2510063,0.009032396,0.00093678635,0.70218015,0.0015038875],"about_ca_topic_score_codex":0.000058762387,"about_ca_topic_score_gemma":0.00016787002,"teacher_disagreement_score":0.93238634,"about_ca_system_score_codex":0.00016129673,"about_ca_system_score_gemma":0.00009446714,"threshold_uncertainty_score":0.92150414},"labels":[],"label_agreement":null},{"id":"W2093197865","doi":"10.1007/s00446-005-0145-4","title":"Relationships between broadcast and shared memory in reliable anonymous distributed systems","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; Atomic broadcast; Shared memory; Identifier; Robustness (evolution); Distributed computing; Distributed shared memory; Computer network; Broadcasting (networking); Parallel computing; Memory management; Operating system; Uniform memory access","score_opus":0.025746112959283897,"score_gpt":0.24509743549439192,"score_spread":0.21935132253510803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093197865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16540861,0.0018142891,0.82877266,0.0008952623,0.0003697582,0.00056552613,0.001000474,0.0005819259,0.00059147074],"genre_scores_gemma":[0.9936332,0.000011360074,0.0048012096,0.000035668316,0.0003070481,0.000022191865,0.0011189795,0.000024202061,0.000046116565],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962919,0.00029934422,0.0011026,0.0009414016,0.0004722442,0.00089253404],"domain_scores_gemma":[0.9978272,0.00037505614,0.00038830214,0.00086439244,0.00021074308,0.00033431032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013227707,0.0004040768,0.0006513553,0.00020424604,0.00052059756,0.0007810615,0.0010230435,0.0002861564,0.000004515872],"category_scores_gemma":[0.0001945537,0.0004280769,0.000089249814,0.0015463985,0.000075518896,0.00087762304,0.00037343436,0.0007351555,0.00005982436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004984299,0.0006385157,0.44888088,0.00052450266,0.00023808274,0.00032722886,0.003651124,0.38274515,0.0005578961,0.05015256,0.022630451,0.08960379],"study_design_scores_gemma":[0.0015769644,0.00005447723,0.13886611,0.00044361746,0.000019250781,0.000091680966,0.00041860732,0.83775,0.00009422353,0.00022428896,0.019717364,0.0007433891],"about_ca_topic_score_codex":0.00025464807,"about_ca_topic_score_gemma":0.000021699469,"teacher_disagreement_score":0.8282246,"about_ca_system_score_codex":0.00032139337,"about_ca_system_score_gemma":0.0001262483,"threshold_uncertainty_score":0.99981713},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mobile robot; Robot; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.03433678672213519,"score_gpt":0.29931038085304124,"score_spread":0.26497359413090604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105783854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034022663,0.000088905195,0.96347797,0.00030500712,0.0003677686,0.0005402386,0.000014625724,0.00068460417,0.00049824105],"genre_scores_gemma":[0.7124917,7.695915e-7,0.28709218,0.00015502083,0.000109499786,0.00002909895,0.00006517993,0.000019444225,0.000037121215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981133,0.00009052849,0.00039095507,0.00051013037,0.0002875182,0.0006076066],"domain_scores_gemma":[0.99858254,0.00015704361,0.00018278841,0.00048242928,0.00030768762,0.00028753543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072006,0.00019999486,0.00024931255,0.00005858792,0.00044892984,0.0007510396,0.0008674082,0.00007843703,0.000002935116],"category_scores_gemma":[0.00021287755,0.0002037771,0.00009287671,0.0004195844,0.000040683,0.000370164,0.00036752777,0.00020496105,0.000021186983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008386176,0.000082841325,0.0016118496,0.000029705918,0.000026521462,0.000007575644,0.0023484933,0.92614746,0.0002685127,0.0085304715,0.0007634101,0.060174763],"study_design_scores_gemma":[0.00076488825,0.00011927669,0.0001443379,0.00004034642,0.0000044991284,0.000013669045,0.00013747653,0.9906602,0.00038771125,0.0010749956,0.0063876477,0.00026494026],"about_ca_topic_score_codex":0.000025262592,"about_ca_topic_score_gemma":0.0000014362304,"teacher_disagreement_score":0.678469,"about_ca_system_score_codex":0.00014666456,"about_ca_system_score_gemma":0.0002320579,"threshold_uncertainty_score":0.8309789},"labels":[],"label_agreement":null},{"id":"W2120152386","doi":"10.1007/pl00008920","title":"On the power of shared object types to implement one-resilient Consensus","year":2000,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Object (grammar); Computer science; Asynchronous communication; Set (abstract data type); Process (computing); Power (physics); Consensus; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language; Artificial intelligence; Computer network; Multi-agent system; Physics","score_opus":0.0179501018062648,"score_gpt":0.26072369786078337,"score_spread":0.24277359605451856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120152386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74567604,0.00011517328,0.2443618,0.0034292173,0.00036911096,0.0007498232,0.0008343709,0.00023574795,0.0042286976],"genre_scores_gemma":[0.9978073,8.6404475e-7,0.0015347047,0.00051262794,0.000034189787,0.000010229433,0.00004955284,0.000009352946,0.00004114013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790055,0.00013631416,0.0005405734,0.00046705175,0.00047321653,0.00048232588],"domain_scores_gemma":[0.9982887,0.0003543404,0.00016092103,0.0008919312,0.00017336963,0.00013074322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124231,0.00020728962,0.0003001149,0.000052742875,0.00023968065,0.00016213393,0.0010814551,0.000052072683,0.00022733539],"category_scores_gemma":[0.00009619706,0.00015855,0.00011705686,0.00073592813,0.000033254943,0.000043520988,0.00015521243,0.0001555573,0.00017241538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002752447,0.0014024883,0.0018427536,0.00011118318,0.0005165552,0.000109252964,0.0061426875,0.11923312,0.004817611,0.5710436,0.16544038,0.12906514],"study_design_scores_gemma":[0.0057099797,0.0031849784,0.13155392,0.0026074224,0.00010638754,0.0001223188,0.0016564775,0.6194769,0.030477159,0.00745294,0.19400214,0.0036493663],"about_ca_topic_score_codex":0.00007816831,"about_ca_topic_score_gemma":0.0000048343304,"teacher_disagreement_score":0.56359065,"about_ca_system_score_codex":0.00007561926,"about_ca_system_score_gemma":0.00006661278,"threshold_uncertainty_score":0.64654815},"labels":[],"label_agreement":null},{"id":"W2123429492","doi":"10.1007/s00446-007-0040-2","title":"The computational power of population protocols","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":272,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multiset; Communication source; Theory of computation; Theoretical computer science; Population; Predicate (mathematical logic); Computation; State (computer science); Computer network; Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.013018712825994727,"score_gpt":0.2926498428743762,"score_spread":0.27963113004838147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123429492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027426733,0.00004139248,0.97001857,0.00016487956,0.00021909909,0.0015287976,0.00003493496,0.0001358986,0.0004296783],"genre_scores_gemma":[0.9917646,1.577006e-7,0.008006996,0.000036381887,0.00004418573,0.00003733603,0.00009824424,0.000006040924,0.000006034867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982085,0.00006177539,0.00064690557,0.00026486992,0.00044728324,0.000370641],"domain_scores_gemma":[0.9983837,0.0004002952,0.00038543218,0.00045026827,0.0003050618,0.000075263066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012670943,0.00013186815,0.00018366006,0.00004435397,0.0003898634,0.00017506978,0.000827454,0.000060356888,0.000001649331],"category_scores_gemma":[0.000092627044,0.00010129221,0.000087551394,0.00065414817,0.000050264698,0.0001692224,0.0001296233,0.00013275477,0.000007691612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054737568,0.000267071,0.043188736,0.000067135836,0.000087670545,0.000025887926,0.0007121328,0.07189802,0.00043235664,0.75181013,0.0030823178,0.12837383],"study_design_scores_gemma":[0.00082361954,0.00011534247,0.4656373,0.00017902009,0.0000043285586,0.000035127607,0.00016441943,0.5105296,0.000617619,0.007170006,0.014376406,0.00034721015],"about_ca_topic_score_codex":0.00003153499,"about_ca_topic_score_gemma":0.000003650719,"teacher_disagreement_score":0.9643379,"about_ca_system_score_codex":0.000060437727,"about_ca_system_score_gemma":0.00003672708,"threshold_uncertainty_score":0.41305766},"labels":[],"label_agreement":null},{"id":"W2133718851","doi":"10.1007/s00446-008-0068-y","title":"On implementing omega in systems with weak reliability and synchrony assumptions","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lossy compression; Reliability (semiconductor); Computer science; Process (computing); Crash; Core (optical fiber); Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications","score_opus":0.013368036344676518,"score_gpt":0.23973823846434802,"score_spread":0.22637020211967152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133718851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4941354,0.00012840396,0.5044112,0.00012870021,0.00014273426,0.0002572876,0.0000688283,0.00017611204,0.00055132585],"genre_scores_gemma":[0.9978874,0.0000064929663,0.0019025563,0.00003280244,0.000051586165,0.000019224599,0.000073171635,0.000011329274,0.000015446309],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975705,0.00015204454,0.0005531738,0.00070175296,0.000374319,0.00064822455],"domain_scores_gemma":[0.99860734,0.00026338547,0.00022051182,0.00063783926,0.0001321635,0.00013876693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068190915,0.00024821408,0.0003709017,0.00011257684,0.00050733297,0.00022502399,0.00049999816,0.00007943481,0.0000016754107],"category_scores_gemma":[0.00006966027,0.00021879312,0.00004471463,0.00081541605,0.00008092398,0.00029732968,0.00019210837,0.00029383806,0.000011328554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088806286,0.0010637834,0.4587919,0.0005431562,0.0001542523,0.00070665363,0.0023669994,0.28510013,0.00039913322,0.22846298,0.00581694,0.01650527],"study_design_scores_gemma":[0.0014927252,0.00018105574,0.14758544,0.0004490812,0.0000065452427,0.00026044104,0.00024321997,0.8451266,0.000042302217,0.00017587256,0.003941207,0.00049550406],"about_ca_topic_score_codex":0.00024593167,"about_ca_topic_score_gemma":0.000017369564,"teacher_disagreement_score":0.56002647,"about_ca_system_score_codex":0.00017191112,"about_ca_system_score_gemma":0.00007899533,"threshold_uncertainty_score":0.89221245},"labels":[],"label_agreement":null},{"id":"W2134091651","doi":"10.1007/s00446-008-0060-6","title":"The space complexity of unbounded timestamps","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"European Commission; University of Toronto; York University","keywords":"Timestamp; Computer science; Asynchronous communication; Upper and lower bounds; Identifier; Time complexity; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Mathematics; Programming language; Real-time computing; Computer network","score_opus":0.03477025260088355,"score_gpt":0.24936744135896993,"score_spread":0.21459718875808637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134091651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06306172,0.00034735235,0.93306124,0.00088994106,0.00059097644,0.00018701302,0.00008881169,0.0002446239,0.0015282874],"genre_scores_gemma":[0.99415606,0.000013784171,0.0056023817,0.00004119021,0.0000730219,0.0000030673864,0.000052873645,0.00000840376,0.000049212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980043,0.0001414661,0.00053995306,0.0003735162,0.00043818002,0.0005025897],"domain_scores_gemma":[0.9980024,0.00028914103,0.00035904403,0.0009374224,0.0002958891,0.000116113595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484259,0.00019788285,0.00031678067,0.000035353987,0.0009827146,0.0001401503,0.0015523408,0.0000677904,0.000002888926],"category_scores_gemma":[0.00010127627,0.00015207309,0.00013803874,0.00085397676,0.00045170623,0.00017375134,0.00029959454,0.00020918252,0.000028530558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027211396,0.0002686932,0.007636001,0.000057111163,0.00013116808,0.00009885328,0.0011268306,0.00433863,0.0012485598,0.9432564,0.026316937,0.015493655],"study_design_scores_gemma":[0.0014959256,0.00016678705,0.083451614,0.0001654074,0.000014638564,0.00037965205,0.00026215377,0.82205546,0.0051572328,0.009829465,0.07622456,0.0007971154],"about_ca_topic_score_codex":0.00009183156,"about_ca_topic_score_gemma":0.000005048153,"teacher_disagreement_score":0.93342686,"about_ca_system_score_codex":0.000064073145,"about_ca_system_score_gemma":0.00013688976,"threshold_uncertainty_score":0.7558345},"labels":[],"label_agreement":null},{"id":"W2160532428","doi":"10.1007/s00446-013-0194-z","title":"No sublogarithmic-time approximation scheme for bipartite vertex cover","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Bipartite graph; Vertex cover; Vertex (graph theory); Approximation algorithm; Upper and lower bounds; Expander graph; Theory of computation; Independent set; Matching (statistics); Feedback vertex set","score_opus":0.014160740544779971,"score_gpt":0.23128453283306682,"score_spread":0.21712379228828685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160532428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952522,0.000037713216,0.98118013,0.00036986274,0.00050731987,0.00053142215,0.00005826635,0.0004804005,0.0008823738],"genre_scores_gemma":[0.59202236,0.00000205318,0.40636352,0.00048520535,0.00027361632,0.00007193625,0.00053146126,0.000024319994,0.00022552858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982789,0.000051028583,0.00036970168,0.000502197,0.0002558701,0.00054228917],"domain_scores_gemma":[0.99845284,0.0002978324,0.00016516178,0.00054530235,0.00041108608,0.00012776515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003072187,0.00021243424,0.00024757095,0.00009467448,0.00038350804,0.00052647176,0.0009382626,0.0000926891,0.00008272962],"category_scores_gemma":[0.00015011932,0.00021774344,0.00014719788,0.0005564866,0.000059955975,0.000615063,0.00029936308,0.00016233431,0.0009691842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057031593,0.0013741743,0.004042359,0.00047339918,0.0004930182,0.000020500069,0.0013487512,0.008952863,0.035415687,0.38560653,0.22440805,0.33780766],"study_design_scores_gemma":[0.00053998904,0.000063633095,0.001489666,0.00003650763,0.0000053516223,0.0000072165817,0.000007881499,0.9794848,0.0010302129,0.008858556,0.00819727,0.00027890014],"about_ca_topic_score_codex":0.000029601862,"about_ca_topic_score_gemma":2.0822583e-7,"teacher_disagreement_score":0.97053194,"about_ca_system_score_codex":0.00006426497,"about_ca_system_score_gemma":0.00004700727,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W2164061165","doi":"10.1007/pl00008936","title":"Distributed computing on oriented anonymous hypercubes with faulty components","year":2001,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hypercube; Computer science; Asynchronous communication; Parallel computing; Computation; Theory of computation; Lambda; Binary logarithm; Discrete mathematics; Combinatorics; Theoretical computer science; Algorithm; Mathematics; Computer network","score_opus":0.018123442934131442,"score_gpt":0.23799612498200168,"score_spread":0.21987268204787025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164061165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37984306,0.000031441592,0.61744845,0.00027037397,0.00078008143,0.00025011797,0.00006051444,0.00067597174,0.00063997786],"genre_scores_gemma":[0.9952802,0.0000032698997,0.0032143807,0.0003609047,0.00038775062,0.0000056799554,0.0006819268,0.000034596815,0.00003126308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961502,0.00028299165,0.0007768013,0.0010345965,0.0007046712,0.0010507256],"domain_scores_gemma":[0.9975418,0.0003744716,0.0004000884,0.0009540586,0.00043682224,0.00029278826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005343424,0.00052112446,0.0006023637,0.00017485884,0.00092767045,0.0005175002,0.001161674,0.00016910631,0.000015036033],"category_scores_gemma":[0.0000670031,0.0004434028,0.00016896127,0.0016401386,0.00008906763,0.00030845738,0.00032462933,0.00053970935,0.00009080883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006799433,0.0025717644,0.1263345,0.00016562412,0.0008985682,0.002355616,0.002778194,0.6806927,0.002764136,0.08664942,0.016898485,0.0772111],"study_design_scores_gemma":[0.0015027197,0.00041041776,0.017593307,0.0003814412,0.000017976481,0.000536172,0.00026062946,0.96447796,0.00036226067,0.00007190961,0.013701386,0.000683809],"about_ca_topic_score_codex":0.00013766078,"about_ca_topic_score_gemma":0.000013099961,"teacher_disagreement_score":0.61543715,"about_ca_system_score_codex":0.000282024,"about_ca_system_score_gemma":0.000056559285,"threshold_uncertainty_score":0.99980175},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.029227116691228003,"score_gpt":0.27477104107005124,"score_spread":0.24554392437882322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295522973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043669406,0.00010273264,0.95510197,0.00017515026,0.00013273438,0.00012023853,0.000003769612,0.00006576076,0.0006282159],"genre_scores_gemma":[0.98267096,0.000004454535,0.017203512,0.000053962536,0.000018271468,0.0000017985213,0.000037334437,0.0000046123023,0.0000050726603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00012614107,0.00038989598,0.00024888667,0.00021543614,0.00032753238],"domain_scores_gemma":[0.99930227,0.000082641236,0.000109814486,0.00027826312,0.00012500775,0.00010198462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433728,0.00009320734,0.0001809837,0.00014529453,0.00002375474,0.000042438747,0.00054784527,0.00006442237,0.0000014653202],"category_scores_gemma":[0.00010664865,0.00009611452,0.000027408658,0.0012480048,0.00002418458,0.00016754224,0.00022654097,0.00020129119,0.0000036337779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053160725,0.000067545974,0.01968241,0.000005570132,0.0000026176922,0.00003128167,0.0005239443,0.96431506,0.000007788364,0.0054458026,0.00021955393,0.009693131],"study_design_scores_gemma":[0.0007043689,0.000040686144,0.008336372,0.000058437578,4.8824666e-7,0.000005102342,0.000056855184,0.99005944,0.00003659937,0.00042851517,0.00017449092,0.000098630764],"about_ca_topic_score_codex":0.00011433427,"about_ca_topic_score_gemma":0.000035189827,"teacher_disagreement_score":0.93900156,"about_ca_system_score_codex":0.0000862563,"about_ca_system_score_gemma":0.00007956142,"threshold_uncertainty_score":0.39194363},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012486289752887219,"score_gpt":0.24905113146082808,"score_spread":0.23656484170794087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314313325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022889008,0.000034817323,0.99464,0.00058371125,0.000088357214,0.00081480277,0.00010673179,0.0012477644,0.00019489275],"genre_scores_gemma":[0.6291704,4.0873599e-7,0.37041965,0.00018958168,0.000076173026,0.00006372694,0.00004960727,0.000018231754,0.000012199439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976512,0.00004266454,0.0004742627,0.0007675821,0.000360521,0.0007037738],"domain_scores_gemma":[0.99782073,0.0005460851,0.0002780185,0.0004881392,0.0006815667,0.00018546982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006527297,0.0002625181,0.00032145824,0.00010274008,0.0003387746,0.0002680263,0.0010236013,0.000074996606,0.0000022411912],"category_scores_gemma":[0.0019685095,0.00020765908,0.00008140319,0.00087556924,0.00004288368,0.0003015104,0.00038676275,0.000081211154,0.0000055760765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030833622,0.00096350466,0.024137834,0.0022644238,0.0005364775,0.00005501111,0.012876777,0.14076385,0.046226133,0.25172538,0.07769522,0.44244704],"study_design_scores_gemma":[0.001098974,0.00029051566,0.00049398554,0.00038762524,0.000021712107,0.000029161556,0.000222557,0.9757745,0.014582623,0.0029778655,0.0032961692,0.0008242714],"about_ca_topic_score_codex":0.00000987089,"about_ca_topic_score_gemma":6.224941e-7,"teacher_disagreement_score":0.8350107,"about_ca_system_score_codex":0.00020733324,"about_ca_system_score_gemma":0.00015496316,"threshold_uncertainty_score":0.84680915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; 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","score_opus":0.013609632210561154,"score_gpt":0.2581931113703358,"score_spread":0.24458347915977463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405322972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04387192,0.00011955525,0.9548003,0.00029189422,0.00032377307,0.00013649158,0.00012612679,0.00029327517,0.000036676927],"genre_scores_gemma":[0.9702815,0.0000074683107,0.029329669,0.00012636573,0.000069454465,0.000003008991,0.00017506401,0.0000069672114,5.114977e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982815,0.00013183919,0.00035151714,0.00049557775,0.00018405527,0.00055550964],"domain_scores_gemma":[0.9990442,0.00022958181,0.0001343539,0.00040242338,0.000079807156,0.000109624474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005037061,0.00017470987,0.0002001437,0.000115776355,0.00017210278,0.00013484564,0.0006627989,0.00010429951,0.000007115772],"category_scores_gemma":[0.000056862864,0.00013827208,0.00008373925,0.0009502076,0.000035337,0.000420818,0.00033869874,0.00018998163,0.00001857906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048127604,0.0014752146,0.30867952,0.0000611869,0.000086143846,0.00023323117,0.0018583976,0.03485807,0.0007228006,0.37595004,0.0066275755,0.2693997],"study_design_scores_gemma":[0.0013972712,0.000025187755,0.08621931,0.00009203745,0.0000026685173,0.000007935441,0.000030065112,0.90894467,0.00009119186,0.0017659172,0.0011728775,0.00025085916],"about_ca_topic_score_codex":0.000015774935,"about_ca_topic_score_gemma":0.000038748953,"teacher_disagreement_score":0.92640954,"about_ca_system_score_codex":0.000058222104,"about_ca_system_score_gemma":0.000027608652,"threshold_uncertainty_score":0.5638572},"labels":[],"label_agreement":null},{"id":"W2406835255","doi":"10.1007/s00446-018-0331-9","title":"On the optimal space complexity of consensus for anonymous processes","year":2018,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy","keywords":"Space (punctuation); Computer science; Psychology","score_opus":0.043456980142650946,"score_gpt":0.27990980350561945,"score_spread":0.2364528233629685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406835255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11137091,0.0000594918,0.88504946,0.0016227085,0.00032739466,0.0004269669,0.00046883101,0.0001602462,0.00051396276],"genre_scores_gemma":[0.9825026,4.77858e-7,0.017092861,0.0001622817,0.00015287175,0.000012144119,0.000052825224,0.000010131089,0.000013811219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831307,0.00008479077,0.00042473897,0.00043702757,0.0002929863,0.0004473657],"domain_scores_gemma":[0.9971914,0.00087798666,0.00035775916,0.0006601948,0.00083474786,0.00007786909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052953116,0.00020676071,0.00030993565,0.00004051517,0.00046873887,0.00015492666,0.0011147881,0.000068514804,0.0000061232668],"category_scores_gemma":[0.0005251959,0.00015250241,0.000096517295,0.0007444936,0.00041681406,0.000061077604,0.00016064163,0.00012690536,0.000014970715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104179206,0.00030429015,0.00032191558,0.00023748676,0.00010404198,0.000009240917,0.0009112885,0.00466941,0.0010363881,0.9580921,0.029046858,0.0051628123],"study_design_scores_gemma":[0.0013989452,0.00092151016,0.0017565404,0.00041651097,0.000022980386,0.00005200588,0.00039417317,0.9419716,0.026663726,0.0088575715,0.016932154,0.00061226025],"about_ca_topic_score_codex":0.000029289551,"about_ca_topic_score_gemma":0.0000058826026,"teacher_disagreement_score":0.94923455,"about_ca_system_score_codex":0.000038780294,"about_ca_system_score_gemma":0.00014857911,"threshold_uncertainty_score":0.6218868},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.06831252283688527,"score_gpt":0.30887218951202783,"score_spread":0.24055966667514256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568630404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014500174,0.000045968674,0.99661046,0.00034372348,0.00045974227,0.00039274915,0.000021002443,0.00020744093,0.00046889458],"genre_scores_gemma":[0.9732858,0.0000017008867,0.026225597,0.00009980242,0.00010030416,0.00002001613,0.00022366497,0.000012436858,0.00003070727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985711,0.00009093153,0.0003066497,0.00034716784,0.00019501969,0.0004891448],"domain_scores_gemma":[0.9988882,0.00037264536,0.00009392722,0.00031039983,0.00013363428,0.00020117508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058247685,0.00013519109,0.00019052585,0.000079832804,0.00010731095,0.00019865355,0.0006472026,0.00007771768,0.0000025936874],"category_scores_gemma":[0.0002508216,0.00014327769,0.00005032643,0.00056691666,0.000038692324,0.00015668945,0.00014672484,0.00015794637,0.000018674235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068037065,0.00009345331,0.00017597011,0.000010084272,0.000013875481,0.000027305607,0.00043487587,0.93986285,0.000008752749,0.0052961223,0.004318262,0.049690407],"study_design_scores_gemma":[0.0020472829,0.00014717167,0.0001537919,0.00002270594,0.0000030354483,0.0000058146493,0.000034704866,0.99433833,0.0000133815865,0.00024090603,0.0028254376,0.00016745584],"about_ca_topic_score_codex":0.0000062961485,"about_ca_topic_score_gemma":0.0000037034056,"teacher_disagreement_score":0.97183573,"about_ca_system_score_codex":0.00013989108,"about_ca_system_score_gemma":0.00012203132,"threshold_uncertainty_score":0.58426946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014558018621588415,"score_gpt":0.2548765614012152,"score_spread":0.24031854277962675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570310514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013962351,0.00008711524,0.9828699,0.00048204523,0.0008469219,0.00025591347,0.0000454239,0.00078429776,0.00066602504],"genre_scores_gemma":[0.8999703,0.0000048427723,0.09940291,0.00022842281,0.00017183792,0.0000076076844,0.0001978528,0.000011588878,0.0000046692285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971987,0.0004045025,0.00064398407,0.00065863965,0.0004891682,0.00060501957],"domain_scores_gemma":[0.9962398,0.0021287964,0.0002472227,0.0009767181,0.0002008871,0.00020658308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018225637,0.0002928848,0.0006533474,0.00013852413,0.0005083633,0.0004536189,0.0017026871,0.000106380874,0.000018301958],"category_scores_gemma":[0.00093786186,0.00026345084,0.0003371277,0.0011129419,0.0001656769,0.00026798763,0.0006008368,0.0003025366,0.000076163305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010145295,0.00017753376,0.00034234818,0.00002114749,0.00008613434,0.000019342604,0.00019803931,0.008873064,0.000067500405,0.68033653,0.0028737935,0.30599004],"study_design_scores_gemma":[0.032156523,0.000031646356,0.0007598197,0.00006377304,0.000013812041,0.000022687544,0.000010403622,0.883907,0.00026442847,0.076238655,0.0062034545,0.00032778468],"about_ca_topic_score_codex":0.000022899834,"about_ca_topic_score_gemma":0.0000014925085,"teacher_disagreement_score":0.8860079,"about_ca_system_score_codex":0.000058220918,"about_ca_system_score_gemma":0.00003691978,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W2611856048","doi":"10.1007/s00446-013-0190-3","title":"Byzantine agreement with homonyms","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Identifier; Impossibility; Computer science; Byzantine architecture; Agreement; Process (computing); Unique identifier; Theoretical computer science; Distributed computing; Computer network; Programming language; Political science; Geography","score_opus":0.006880588067287215,"score_gpt":0.20448400230934033,"score_spread":0.1976034142420531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611856048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079113305,0.000115961135,0.9164649,0.00085305993,0.00022877724,0.00034289644,0.00003263989,0.00039152201,0.0024569214],"genre_scores_gemma":[0.98510987,0.0000017247382,0.014368592,0.00020573295,0.00009823576,0.000023288141,0.000110758,0.0000115561015,0.00007024795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979389,0.00005677414,0.0004033334,0.0005540263,0.00041987826,0.0006271153],"domain_scores_gemma":[0.9984581,0.00006257334,0.00020669111,0.0007914367,0.00028986373,0.0001913716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020955475,0.00025784937,0.00029364892,0.00005938529,0.00027030404,0.0005760252,0.0010708327,0.00006384786,0.00004364187],"category_scores_gemma":[0.000017596858,0.00020428406,0.00007082203,0.0008044865,0.00004801396,0.00046103934,0.0002209401,0.00018833844,0.0003865002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331099,0.0014650886,0.077622555,0.00030696904,0.0006080826,0.00046524426,0.0020303843,0.02831868,0.006820683,0.26093954,0.1065666,0.51482284],"study_design_scores_gemma":[0.001859575,0.00029422864,0.07667773,0.00030039722,0.00001703896,0.00015409611,0.00027942582,0.8809845,0.002021864,0.0005365425,0.035807427,0.0010671825],"about_ca_topic_score_codex":0.00018244171,"about_ca_topic_score_gemma":0.0000034903514,"teacher_disagreement_score":0.90599656,"about_ca_system_score_codex":0.00004066075,"about_ca_system_score_gemma":0.000048303544,"threshold_uncertainty_score":0.8330462},"labels":[],"label_agreement":null},{"id":"W2645852407","doi":"10.1007/s00446-017-0305-3","title":"Inherent limitations of hybrid transactional memory","year":2017,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy; Agence Nationale de la Recherche; National Science Foundation","keywords":"Transactional memory; Computer science; Instrumentation (computer programming); Software transactional memory; Concurrency; Overhead (engineering); Database transaction; Software; Operating system; Distributed computing; Embedded system; Parallel computing; Programming language","score_opus":0.058459097462485156,"score_gpt":0.27225957813678897,"score_spread":0.21380048067430382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2645852407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051642,0.000105409665,0.94443524,0.0005021867,0.0006464913,0.00013138926,0.00021954856,0.00011769102,0.002200017],"genre_scores_gemma":[0.9949242,0.0000057489474,0.0048443703,0.000028999391,0.00007724905,0.000005447305,0.00008360586,0.000006626061,0.000023767887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985982,0.000047228623,0.0004209957,0.00033373825,0.00031660727,0.0002831826],"domain_scores_gemma":[0.99813205,0.0001439139,0.00044320428,0.00094130065,0.00024078996,0.000098726734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721007,0.00014877749,0.00025050284,0.000047283247,0.0006445524,0.00029866138,0.0014128505,0.00003613676,0.0000058540036],"category_scores_gemma":[0.0001242239,0.00015101438,0.00013452428,0.00012202078,0.00009047197,0.00040867637,0.000121085526,0.00015041103,0.000017784054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027046575,0.000714974,0.004433198,0.00015081225,0.00027127258,0.00012518825,0.0008192226,0.040274434,0.0043703504,0.118610494,0.0070033832,0.8231996],"study_design_scores_gemma":[0.0016972848,0.00011353048,0.07619636,0.0002729244,0.000027999986,0.00010480947,0.00013450484,0.8882801,0.015006933,0.0030970783,0.0144326715,0.00063582964],"about_ca_topic_score_codex":0.000041627714,"about_ca_topic_score_gemma":0.0000040992413,"teacher_disagreement_score":0.9432822,"about_ca_system_score_codex":0.000043786527,"about_ca_system_score_gemma":0.00008273719,"threshold_uncertainty_score":0.6158188},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"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","score_opus":0.010550252660611156,"score_gpt":0.23096115420782723,"score_spread":0.22041090154721607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2667052534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05335906,0.0019469766,0.94227546,0.0003649344,0.00045284783,0.0002373486,0.0000046800687,0.0007578149,0.00060086045],"genre_scores_gemma":[0.958159,0.00003053924,0.041043986,0.0002277625,0.00041586687,0.000008733304,0.00007236127,0.000023231047,0.000018475013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971569,0.00019102803,0.0006346858,0.00072974287,0.00030078104,0.0009868474],"domain_scores_gemma":[0.99833846,0.0004067802,0.00023543631,0.00074013777,0.0000958654,0.0001833197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006440566,0.0002966346,0.00036421823,0.00013599396,0.00022837201,0.00030289553,0.0013162572,0.00016282639,0.000017500344],"category_scores_gemma":[0.0000929114,0.0003306158,0.00009936099,0.0018710241,0.000044043158,0.00039155662,0.00046174697,0.00060835935,0.00003968588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005685383,0.00006855497,0.002687123,0.0000053901904,0.000014390149,0.00005045407,0.00020263328,0.5636765,0.00004281931,0.0019032041,0.0014025504,0.42994073],"study_design_scores_gemma":[0.00061232306,0.0000308214,0.012939273,0.00011484196,0.0000044221706,0.000042137766,0.000017948827,0.97782433,0.00007412168,0.000088114604,0.007904756,0.00034692438],"about_ca_topic_score_codex":0.000015717174,"about_ca_topic_score_gemma":0.000037552647,"teacher_disagreement_score":0.9048,"about_ca_system_score_codex":0.00031816083,"about_ca_system_score_gemma":0.00006740359,"threshold_uncertainty_score":0.9999146},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.03099239851985214,"score_gpt":0.2679055455920573,"score_spread":0.23691314707220518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808433750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20619118,0.0013024895,0.7824815,0.00858562,0.00015643347,0.0003537343,0.00012006615,0.0005453258,0.00026367494],"genre_scores_gemma":[0.76575774,0.000056062658,0.23362628,0.00013248691,0.00003690727,0.000024479747,0.0003437817,0.000021045273,0.0000012451611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964883,0.00024750878,0.00053009886,0.0014560918,0.00054004666,0.00073798344],"domain_scores_gemma":[0.9908155,0.00047384924,0.00039971402,0.008091957,0.00014295513,0.000076010285],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009417989,0.00052735204,0.0006127142,0.00018557535,0.000271635,0.0014794581,0.024090888,0.00038354707,9.44951e-7],"category_scores_gemma":[0.0027681652,0.00042440597,0.00007577778,0.0007623829,0.0002476317,0.00030433421,0.10178464,0.0017421173,0.0000012246995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007404111,0.0010705214,0.046308342,0.0015848223,0.00079123146,0.005050738,0.0110449325,0.45561504,0.0006433479,0.00855449,0.05766161,0.4116009],"study_design_scores_gemma":[0.0004111381,0.0000415082,0.0049470975,0.00072877615,0.000025759628,0.0001241711,0.0007426144,0.98134965,0.00017494358,0.010898371,0.000039674618,0.0005162764],"about_ca_topic_score_codex":0.00011046914,"about_ca_topic_score_gemma":0.000056221263,"teacher_disagreement_score":0.55956656,"about_ca_system_score_codex":0.00017034638,"about_ca_system_score_gemma":0.00031151174,"threshold_uncertainty_score":0.99982077},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025652479985556205,"score_gpt":0.28613440334195933,"score_spread":0.26048192335640313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888048527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014190286,0.000018014644,0.9841978,0.0005479668,0.00021035869,0.00014882715,0.00005375529,0.00028983716,0.0003431308],"genre_scores_gemma":[0.9595506,0.000004019721,0.040046155,0.000058136193,0.00004037681,0.0000028073555,0.00027989564,0.000007536851,0.000010426358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859804,0.000081797174,0.0003798944,0.00032916237,0.0002865242,0.00032455323],"domain_scores_gemma":[0.9986962,0.00007659439,0.00020388117,0.00045498923,0.0004716035,0.00009671773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035022057,0.0001290533,0.00017510935,0.000096780255,0.00021580755,0.0001349717,0.00071189855,0.000059335558,0.000016555778],"category_scores_gemma":[0.00011238503,0.00013077006,0.00005716102,0.0010214413,0.00010516804,0.0006042317,0.000256958,0.00011421718,0.000040453644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091974944,0.0012674734,0.008018259,0.0003150933,0.00030369003,0.000044617536,0.01016934,0.113091104,0.025893847,0.47766542,0.009125102,0.35401407],"study_design_scores_gemma":[0.0003268904,0.000110104396,0.0024668227,0.000041796808,0.0000033077047,0.0000035127432,0.00006355091,0.9905606,0.0031422137,0.0022493186,0.0008809147,0.0001509798],"about_ca_topic_score_codex":0.0000124558455,"about_ca_topic_score_gemma":0.0000029122352,"teacher_disagreement_score":0.94536036,"about_ca_system_score_codex":0.0000629488,"about_ca_system_score_gemma":0.000060027884,"threshold_uncertainty_score":0.5332648},"labels":[],"label_agreement":null},{"id":"W2946052740","doi":"10.1007/s00446-019-00354-2","title":"The complexity of leader election in diameter-two networks","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Computing and Communication Foundations; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Upper and lower bounds; Combinatorics; Constant (computer programming); Randomized algorithm; Monte Carlo method; Monte Carlo algorithm; Theory of computation; Mathematics; Discrete mathematics; Deterministic algorithm; Binary logarithm; Communication complexity; Computer science; Algorithm; Theoretical computer science; Statistics","score_opus":0.021335128452466,"score_gpt":0.25505197559873033,"score_spread":0.23371684714626434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946052740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10082339,0.00025623248,0.8970634,0.00030596484,0.0007151585,0.00025637454,0.000016487342,0.00009504627,0.00046800578],"genre_scores_gemma":[0.9987308,0.00000445357,0.001088643,0.00004609433,0.000062274725,0.0000040473033,0.000042197185,0.0000072742127,0.000014218132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.00017181107,0.0005413213,0.00036760292,0.00025596315,0.00048065797],"domain_scores_gemma":[0.9986483,0.00025688915,0.0002802607,0.0006305468,0.00013075543,0.000053282198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070309226,0.00016032418,0.00029321463,0.0000503577,0.00016870152,0.0001666886,0.00092551694,0.00006614732,0.0000028465904],"category_scores_gemma":[0.000037829406,0.00012773628,0.00009482711,0.0010099573,0.0001165498,0.00018016755,0.00017439526,0.00028521733,0.000016741942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006710992,0.0004004088,0.11846131,0.00012142476,0.00012546018,0.000020922278,0.0007938811,0.3296097,0.0025915492,0.39528486,0.0035244538,0.1489989],"study_design_scores_gemma":[0.000556505,0.000044868466,0.038524766,0.000082066545,0.0000020360037,0.000008380523,0.00007739733,0.957866,0.00038781491,0.0008558197,0.0014353513,0.0001589616],"about_ca_topic_score_codex":0.00017943516,"about_ca_topic_score_gemma":0.000044101842,"teacher_disagreement_score":0.89790744,"about_ca_system_score_codex":0.000083084626,"about_ca_system_score_gemma":0.000038437276,"threshold_uncertainty_score":0.5208934},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0492260071130564,"score_gpt":0.2853473280723429,"score_spread":0.2361213209592865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949581528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048475523,0.000087793065,0.9490056,0.0010803875,0.00032066766,0.00012603342,0.00001410458,0.00011492225,0.00077494053],"genre_scores_gemma":[0.9687892,0.0000013398201,0.030629346,0.00045303538,0.00007983597,0.0000045759193,0.000030414316,0.0000067663627,0.000005471976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981045,0.00014825158,0.00038093427,0.0004184137,0.00043297195,0.000514911],"domain_scores_gemma":[0.9988987,0.00017570329,0.00007710551,0.00065509387,0.00009444818,0.00009893492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245524,0.00017907459,0.00021333047,0.00013395057,0.00012794262,0.00021268602,0.0017834072,0.000078558645,0.0000014335013],"category_scores_gemma":[0.000079831414,0.00014847601,0.00007922305,0.0014414676,0.00010267995,0.00021706126,0.00041348772,0.00044909597,0.000018017956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638069,0.0004676733,0.0044688033,0.000013467297,0.000012247096,0.00025779728,0.0045241076,0.8247268,0.0000089113055,0.11060939,0.0027554948,0.05213891],"study_design_scores_gemma":[0.00053146126,0.000039974606,0.0019021543,0.000033068423,0.0000013948885,0.000022713679,0.00029546206,0.9684577,0.0000129716345,0.027193038,0.0013244125,0.00018565962],"about_ca_topic_score_codex":0.00013288563,"about_ca_topic_score_gemma":0.00005047692,"teacher_disagreement_score":0.9203137,"about_ca_system_score_codex":0.000115043156,"about_ca_system_score_gemma":0.00016653363,"threshold_uncertainty_score":0.6054676},"labels":[],"label_agreement":null},{"id":"W2951207499","doi":"10.1007/s00446-019-00355-1","title":"Deciding and verifying network properties locally with few output bits","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Predicate (mathematical logic); Verdict; Computer science; Theory of computation; Boolean network; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Boolean function; Law; Programming language","score_opus":0.013251922115166466,"score_gpt":0.1993719256950851,"score_spread":0.18612000357991865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951207499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3630007,0.0006994181,0.63486874,0.00013022154,0.00031213323,0.00026048423,0.000010330557,0.00028078415,0.0004371851],"genre_scores_gemma":[0.99158037,0.000006622165,0.008027453,0.00015215365,0.00013712389,0.0000059958766,0.000029458492,0.000019147274,0.000041680432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779254,0.00008218723,0.00038975856,0.00067540683,0.00036411016,0.00069600536],"domain_scores_gemma":[0.9987991,0.00009424815,0.00020914242,0.0005603639,0.0001754375,0.00016171856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042653907,0.00029092512,0.0003990689,0.0000499801,0.00036245357,0.0006345265,0.00069116085,0.00009377105,0.000002229562],"category_scores_gemma":[0.00002511173,0.00023288018,0.000052484404,0.00071906403,0.000053594296,0.00042913636,0.0003388066,0.00025527287,0.000039775776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016292912,0.00023454624,0.3182998,0.00086474256,0.0004439377,0.0002774393,0.0025468888,0.41496527,0.0022663933,0.059227735,0.0041408245,0.1965695],"study_design_scores_gemma":[0.0012081516,0.00020497122,0.029496543,0.001369235,0.00001536717,0.0001550477,0.00020279229,0.9577413,0.00034885894,0.00014215948,0.008391565,0.0007240054],"about_ca_topic_score_codex":0.000035768146,"about_ca_topic_score_gemma":0.0000039702454,"teacher_disagreement_score":0.6285797,"about_ca_system_score_codex":0.00006425806,"about_ca_system_score_gemma":0.000086174856,"threshold_uncertainty_score":0.9496578},"labels":[],"label_agreement":null},{"id":"W2963560569","doi":"10.1007/s00446-013-0205-0","title":"Partition consistency","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Consistency model; Sequential consistency; Computer science; Weak consistency; Correctness; Consistency (knowledge bases); Implementation; Partition (number theory); Causal consistency; Cache coherence; Theoretical computer science; Strong consistency; Mathematical proof; Abstraction; Programming language; Class (philosophy); Parallel computing; Mathematics; Artificial intelligence; CPU cache; Cache algorithms; Cache","score_opus":0.010681241435513439,"score_gpt":0.22914644566822248,"score_spread":0.21846520423270904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963560569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013515137,0.00007355072,0.9799425,0.00048839883,0.00056605635,0.00010145647,0.000030481964,0.00054133986,0.004741074],"genre_scores_gemma":[0.99282503,0.0000011238019,0.0066106557,0.00027105445,0.00015006497,0.0000050411254,0.000114416864,0.000007340387,0.000015290358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983744,0.00012470286,0.00038397583,0.0004333366,0.00025992686,0.00042364965],"domain_scores_gemma":[0.9987751,0.00012511379,0.00016713461,0.00064061483,0.00015571172,0.00013627404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004866463,0.0001667556,0.00023346384,0.00004561505,0.0003041806,0.0002842159,0.000720347,0.00007194776,0.0000073964225],"category_scores_gemma":[0.00010876786,0.00016440528,0.00009251501,0.0005081592,0.000041928313,0.00024801638,0.00013247914,0.0001417803,0.00014428815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037894902,0.00013186519,0.0044129696,0.000046676552,0.000033080345,0.000018393903,0.00020156297,0.004339879,0.00092592515,0.8521822,0.009272,0.12843165],"study_design_scores_gemma":[0.0005457289,0.000066592205,0.011562652,0.000089178495,0.0000067551323,0.000041606203,0.000033088054,0.9203886,0.00079608726,0.004548011,0.061542377,0.0003793641],"about_ca_topic_score_codex":0.000017447008,"about_ca_topic_score_gemma":0.0000013864438,"teacher_disagreement_score":0.97930986,"about_ca_system_score_codex":0.000044150504,"about_ca_system_score_gemma":0.000033354892,"threshold_uncertainty_score":0.67042524},"labels":[],"label_agreement":null},{"id":"W2971627429","doi":"10.1007/s00446-019-00361-3","title":"A complexity-based classification for multiprocessor synchronization","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Computer science; Computability; Theory of computation; Hierarchy; Synchronization (alternating current); Multiprocessing; Theoretical computer science; Parallel computing; Programming language","score_opus":0.03210111754726115,"score_gpt":0.27591656205991083,"score_spread":0.2438154445126497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971627429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018610349,0.000052566225,0.97862846,0.00056760974,0.0005007547,0.00074578787,0.00021995118,0.00045912524,0.00021541891],"genre_scores_gemma":[0.9614253,3.38324e-7,0.03706672,0.00019448235,0.0000831121,0.000032016716,0.0011676735,0.000014808095,0.000015572221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982123,0.000058069923,0.00043593178,0.00059604907,0.00027376204,0.0004239218],"domain_scores_gemma":[0.998354,0.00019110336,0.0003075304,0.0006189909,0.00043544476,0.00009290477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003691428,0.00020032813,0.00027227122,0.00007544866,0.00025175355,0.00031278143,0.0008298416,0.000101039186,0.0000069574444],"category_scores_gemma":[0.00007775322,0.0002056312,0.00010829954,0.0006979856,0.000033769524,0.00028686377,0.00006489749,0.00011475866,0.00007651371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010545707,0.0008916548,0.03558107,0.0014348337,0.00013664401,0.000008386465,0.0006777611,0.19149798,0.010430371,0.61146665,0.0065303,0.1412389],"study_design_scores_gemma":[0.0011021153,0.00006264209,0.006632967,0.00009505087,0.000005337704,0.0000028408633,0.000041998148,0.9839385,0.0005969207,0.00053478894,0.006729087,0.00025773665],"about_ca_topic_score_codex":0.0000104839955,"about_ca_topic_score_gemma":0.0000014965786,"teacher_disagreement_score":0.94281495,"about_ca_system_score_codex":0.00013667044,"about_ca_system_score_gemma":0.00012520545,"threshold_uncertainty_score":0.8385397},"labels":[],"label_agreement":null},{"id":"W2972852770","doi":"10.1007/s00446-019-00362-2","title":"Meeting in a polygon by anonymous oblivious robots","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Computer science; Combinatorics; Asynchronous communication; Algebraic number; Visibility polygon; Upper and lower bounds; Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Simple polygon; Regular polygon; Geometry","score_opus":0.006297182411765845,"score_gpt":0.22727481758885,"score_spread":0.22097763517708413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972852770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13107428,0.00017680797,0.8647512,0.0005814832,0.00024313648,0.00029605164,0.000012944329,0.00033538908,0.0025286789],"genre_scores_gemma":[0.9863724,0.0000058375936,0.013175204,0.0002571586,0.000020447622,0.000003011142,0.00008404232,0.000011353174,0.000070526956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982145,0.00013003696,0.00034432494,0.00046582049,0.00029457992,0.0005507292],"domain_scores_gemma":[0.9991368,0.00014295487,0.000117891985,0.00041086168,0.000081544655,0.000109924906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966902,0.00015524963,0.00020809741,0.00012758658,0.00010570086,0.00027863876,0.0007937956,0.00007556279,0.000019235204],"category_scores_gemma":[0.00006125588,0.00016328835,0.0000495456,0.0010135107,0.000017248782,0.00027075116,0.00030704844,0.00024471057,0.000108352026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001461349,0.00058523176,0.08085507,0.000093351155,0.00003833356,0.0000692965,0.0020096274,0.8318006,0.008956331,0.017208586,0.0068011833,0.0515678],"study_design_scores_gemma":[0.0006140643,0.000051641066,0.0020300387,0.000076746874,9.894251e-7,0.000008741275,0.0000524199,0.99529094,0.00074212323,0.00018069045,0.0007276998,0.00022390048],"about_ca_topic_score_codex":0.000100570476,"about_ca_topic_score_gemma":0.0000069502844,"teacher_disagreement_score":0.85529816,"about_ca_system_score_codex":0.00009846246,"about_ca_system_score_gemma":0.00006138105,"threshold_uncertainty_score":0.66587055},"labels":[],"label_agreement":null},{"id":"W2985470207","doi":"10.1007/s00446-019-00364-0","title":"Recoverable mutual exclusion","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Semaphore; Mutual exclusion; Critical section; Liveness; Computer science; Lock (firearm); Process (computing); Copycat; Reboot; Distributed computing; Operating system; Engineering","score_opus":0.007466612976992102,"score_gpt":0.22188916391477162,"score_spread":0.2144225509377795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985470207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15753046,0.00013317874,0.83449686,0.00024618575,0.001282796,0.00022539102,0.000056564302,0.0004543937,0.005574199],"genre_scores_gemma":[0.9946917,0.0000030347148,0.0045864806,0.00020029715,0.0001132247,0.0000028776021,0.00014331084,0.000011617501,0.00024744292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799323,0.000082192455,0.00040285997,0.000600575,0.00037325456,0.0005478711],"domain_scores_gemma":[0.99858916,0.00011628872,0.00018226643,0.00083970145,0.00014090426,0.00013170532],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042141226,0.0002117359,0.0002992387,0.0000645227,0.00022514146,0.00033384623,0.0011284316,0.00010475283,0.00005061366],"category_scores_gemma":[0.000035585126,0.00020584176,0.00011537119,0.0007278445,0.000016956592,0.00044124314,0.00038322128,0.00022813812,0.00093255745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084481166,0.00087179453,0.070120014,0.00039786153,0.00025226697,0.00027987675,0.0021546527,0.08303803,0.023491276,0.39290664,0.080480486,0.34592262],"study_design_scores_gemma":[0.00089542224,0.000102525526,0.007024153,0.00015158016,0.000004180744,0.00005144571,0.00007208163,0.9083718,0.0011815164,0.0008634601,0.080790885,0.0004909195],"about_ca_topic_score_codex":0.000032814016,"about_ca_topic_score_gemma":9.4524495e-7,"teacher_disagreement_score":0.83716124,"about_ca_system_score_codex":0.0001068917,"about_ca_system_score_gemma":0.00006711119,"threshold_uncertainty_score":0.9998453},"labels":[],"label_agreement":null},{"id":"W3017746918","doi":"10.1007/s00446-020-00372-5","title":"Life beyond set agreement","year":2020,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Hierarchy; Power set; Object (grammar); Combinatorics; Sequence (biology); Theory of computation; Mathematics; Power (physics); Discrete mathematics; Computer science; Algorithm; Physics; Programming language; Artificial intelligence; Chemistry","score_opus":0.02706743297341297,"score_gpt":0.24815861650227383,"score_spread":0.22109118352886087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017746918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010497472,0.00025492656,0.97811383,0.008158016,0.000422927,0.0002025028,0.0002202555,0.00052250724,0.0016075508],"genre_scores_gemma":[0.99021244,0.0000024541705,0.0048615993,0.004370318,0.0002994316,0.000004848719,0.0002300457,0.000010691209,0.000008191987],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775565,0.00008811084,0.0005178376,0.0006468264,0.000444864,0.0005467417],"domain_scores_gemma":[0.99834853,0.00007337255,0.00021300571,0.0005413062,0.00014796654,0.00067578675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025609587,0.0002479645,0.00033713487,0.00003222398,0.00025948216,0.00038149112,0.0013751889,0.000080401966,0.000025602087],"category_scores_gemma":[0.0002037278,0.0002468718,0.00012702476,0.00089417835,0.00003221435,0.0002701182,0.00041569665,0.00023873436,0.00029604815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050569335,0.0003874312,0.013709667,0.0003676348,0.00043042982,0.0004915656,0.0068418467,0.05235963,0.0034449107,0.2675298,0.54458714,0.109799385],"study_design_scores_gemma":[0.00081925583,0.00011067911,0.002489358,0.000047235757,0.000010208346,0.00001334397,0.00021328253,0.89862555,0.00056761253,0.00030963146,0.09629667,0.0004971496],"about_ca_topic_score_codex":0.000016046131,"about_ca_topic_score_gemma":4.7903745e-7,"teacher_disagreement_score":0.97971493,"about_ca_system_score_codex":0.00005151992,"about_ca_system_score_gemma":0.0001317116,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W3085992258","doi":"10.1007/s00446-023-00451-3","title":"Four shades of deterministic leader election in anonymous networks","year":2023,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Node (physics); Computer science; Task (project management); Context (archaeology); Identifier; Computer network; Distributed computing; Computer security; Engineering; Geography","score_opus":0.033896789744311755,"score_gpt":0.26759833705344255,"score_spread":0.23370154730913079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085992258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15173095,0.000043424086,0.8472144,0.00013085466,0.00036991615,0.00009431968,0.000008294049,0.00031888913,0.00008894265],"genre_scores_gemma":[0.99477965,0.000005643176,0.0050341,0.000039395767,0.000081740436,0.00000346153,0.000040769093,0.000007652245,0.0000075916178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985733,0.00008360323,0.00036851843,0.00033989313,0.00019715885,0.00043753276],"domain_scores_gemma":[0.99912095,0.0003023567,0.00013020558,0.00032749344,0.000067120614,0.00005188541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038908434,0.00013552213,0.00022219322,0.00023263048,0.00013819963,0.00008519385,0.0006388023,0.00007395015,0.000003059479],"category_scores_gemma":[0.000079680685,0.00014822892,0.000079851365,0.002457731,0.000055210792,0.00012323655,0.00023546023,0.00022518911,0.0000097441425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024694185,0.00027179776,0.03665145,0.00014988614,0.000069591464,0.00037420436,0.0013271137,0.46450615,0.0012969774,0.04046678,0.0017125792,0.45314878],"study_design_scores_gemma":[0.00022161826,0.00005234975,0.053341515,0.000063870626,0.0000029159337,0.000021090756,0.0000493559,0.9425091,0.00030450872,0.0031794854,0.000107780295,0.00014642201],"about_ca_topic_score_codex":0.000037903308,"about_ca_topic_score_gemma":0.000013782799,"teacher_disagreement_score":0.8430487,"about_ca_system_score_codex":0.00004105034,"about_ca_system_score_gemma":0.000036044505,"threshold_uncertainty_score":0.60446},"labels":[],"label_agreement":null},{"id":"W3208121459","doi":"10.1007/s00446-021-00405-7","title":"On atomic registers and randomized consensus in M&M systems","year":2021,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Remote direct memory access; Theory of computation; Randomized algorithm; Atomicity; Message passing; Process (computing); Theoretical computer science; Distributed computing; Algorithm; Operating system; Programming language","score_opus":0.01617471040368907,"score_gpt":0.25233766084053905,"score_spread":0.23616295043684998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208121459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39132044,0.0012733026,0.6042603,0.00087111385,0.00080157234,0.00034570348,0.00007760785,0.0001918412,0.0008580949],"genre_scores_gemma":[0.99799144,0.000017658069,0.0015846124,0.00016969118,0.00004675695,0.000013097843,0.000111495734,0.000011187144,0.000054042957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727094,0.0005536141,0.00070888526,0.00069533166,0.00029730168,0.00047394677],"domain_scores_gemma":[0.99773544,0.0010182458,0.0002605335,0.0006849466,0.0001599992,0.00014084754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010392921,0.00025121105,0.0007678253,0.000097863776,0.00014888117,0.00046771686,0.00041054285,0.00011363798,0.0000018826091],"category_scores_gemma":[0.00041829314,0.00024060867,0.00011368147,0.00069862086,0.00010021084,0.00008025909,0.00018354577,0.00026296295,0.000022531123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018742844,0.00035438593,0.0036519747,0.0003513465,0.00021384157,0.001384867,0.0012994466,0.04206176,0.0008194871,0.9309898,0.0083080055,0.008690803],"study_design_scores_gemma":[0.04680243,0.000024868139,0.0012329186,0.0008087719,0.000015206049,0.0003866161,0.00021277931,0.94163954,0.00014005852,0.0021711905,0.0059929667,0.0005726708],"about_ca_topic_score_codex":0.00015409275,"about_ca_topic_score_gemma":0.000017570694,"teacher_disagreement_score":0.9288186,"about_ca_system_score_codex":0.00011486929,"about_ca_system_score_gemma":0.00010459449,"threshold_uncertainty_score":0.9811737},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Polynomial; Plane (geometry); Geometry; Mathematical analysis","score_opus":0.017766937511078752,"score_gpt":0.2474252493438052,"score_spread":0.22965831183272645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302609198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079948595,0.000008353308,0.9878334,0.0004466201,0.000101474165,0.00013366972,0.0000047182225,0.000100405145,0.0033765484],"genre_scores_gemma":[0.97986233,5.3628565e-7,0.019569015,0.00041248367,0.000075211225,0.000004373087,0.00006755353,0.0000039375977,0.0000045804813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987612,0.000249963,0.00021259977,0.00025388543,0.00021238839,0.00030996685],"domain_scores_gemma":[0.9992071,0.00026782567,0.00006130896,0.00038370723,0.00002948983,0.00005056563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080509763,0.000096044365,0.00011505776,0.000059382382,0.00016296806,0.00027709626,0.0010808709,0.00004031658,0.000002254629],"category_scores_gemma":[0.000081995335,0.00007216331,0.00003151944,0.00046953355,0.00003196606,0.00008943181,0.00013326206,0.00019028186,0.00001780396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000261019,0.00084907806,0.015437268,0.00011894249,0.0000345178,0.000067010515,0.008439657,0.4479974,0.0002601631,0.2689983,0.011839139,0.24593244],"study_design_scores_gemma":[0.00030075538,0.000034656863,0.005456118,0.000008317372,0.0000011126666,0.000020038084,0.00004923009,0.9918916,0.0000133859385,0.00023321144,0.001893999,0.000097574055],"about_ca_topic_score_codex":0.0000124978005,"about_ca_topic_score_gemma":0.0000011211781,"teacher_disagreement_score":0.97186744,"about_ca_system_score_codex":0.000022358261,"about_ca_system_score_gemma":0.000028491804,"threshold_uncertainty_score":0.29427344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012521853781385211,"score_gpt":0.247799545274655,"score_spread":0.2352776914932698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394601352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05113731,0.00012583076,0.94553506,0.0018051252,0.00020116186,0.00025541242,0.000047940808,0.0003391288,0.00055304734],"genre_scores_gemma":[0.9947923,0.0000030626284,0.004867845,0.0002334138,0.0000098059845,0.000004580023,0.000052214953,0.000009960328,0.000026844456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839264,0.00015102369,0.00030023238,0.0004632986,0.00036923832,0.00032355284],"domain_scores_gemma":[0.9985194,0.0005268757,0.000091767215,0.00060369546,0.00017152513,0.0000867272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056866795,0.00016012856,0.00016944463,0.000055693243,0.00019813982,0.00035399795,0.00077806856,0.00005234316,0.00006449349],"category_scores_gemma":[0.00009567327,0.00010601869,0.00006135002,0.0009935012,0.00012403897,0.00017422363,0.00016921845,0.0002594646,0.000029592411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053654345,0.0005735596,0.0014892074,0.00018476954,0.0002871971,0.00006259804,0.0030262205,0.23884803,0.0018404683,0.7105559,0.027175874,0.015902514],"study_design_scores_gemma":[0.00016894727,0.000200996,0.00062474393,0.00011489647,0.000004531948,0.000005954389,0.000039880986,0.99470335,0.0017120864,0.0014701149,0.0008030127,0.00015148953],"about_ca_topic_score_codex":0.000020003872,"about_ca_topic_score_gemma":0.0000011702068,"teacher_disagreement_score":0.94365495,"about_ca_system_score_codex":0.00009405631,"about_ca_system_score_gemma":0.0001821008,"threshold_uncertainty_score":0.43233168},"labels":[],"label_agreement":null},{"id":"W4399383464","doi":"10.1007/s00446-024-00465-5","title":"On implementing SWMR registers from SWSR registers in systems with Byzantine failures","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Byzantine architecture; Computer science; Byzantine fault tolerance; Operating system; History; Archaeology; Fault tolerance","score_opus":0.01023162103595374,"score_gpt":0.24413851145048826,"score_spread":0.23390689041453452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399383464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09746927,0.0010674138,0.8960941,0.0011207776,0.0011662088,0.0004570544,0.00037186447,0.0008136799,0.0014396594],"genre_scores_gemma":[0.9972061,0.0000036151384,0.0019125768,0.000113769886,0.00020339101,0.000022992883,0.00044933165,0.000035476023,0.000052736537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961634,0.00017610504,0.00084793806,0.0012137257,0.00063141197,0.00096739794],"domain_scores_gemma":[0.998007,0.0004496897,0.00028381875,0.0009926138,0.00010379726,0.00016306536],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007609697,0.00043972215,0.000538016,0.00024261151,0.00025087164,0.0017029709,0.0011855256,0.000120326986,0.0000051246957],"category_scores_gemma":[0.0000526503,0.00037707394,0.000122065736,0.001500516,0.00006055007,0.00046048505,0.00026076415,0.00047770882,0.00004799637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021138534,0.00050699787,0.019533196,0.0013381039,0.0008173296,0.0056057386,0.0047811535,0.19832797,0.0016817757,0.65650654,0.048562538,0.062127247],"study_design_scores_gemma":[0.0010887795,0.00014427751,0.00276679,0.0033468206,0.000020417418,0.00006877233,0.0006050136,0.93853265,0.00015006414,0.00025198032,0.052311294,0.000713131],"about_ca_topic_score_codex":0.001481353,"about_ca_topic_score_gemma":0.00007896714,"teacher_disagreement_score":0.8997368,"about_ca_system_score_codex":0.00017658796,"about_ca_system_score_gemma":0.000110031964,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W4401669598","doi":"10.1007/s00446-024-00471-7","title":"A wait-free queue with polylogarithmic step complexity","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Amortized analysis; Mathematics; Bounded function; Combinatorics; Computer science; Lock (firearm); Priority queue; Discrete mathematics; Binary logarithm; Parallel computing; Data structure; Operating system; Computer network","score_opus":0.017274164517485865,"score_gpt":0.2459224800769418,"score_spread":0.22864831555945594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401669598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011342639,0.0008160939,0.9814884,0.0015450962,0.0007645134,0.00029601585,0.0005087193,0.0016486379,0.0015898811],"genre_scores_gemma":[0.9713243,0.0000027345973,0.027960457,0.00016028987,0.00022506906,0.000012870051,0.00023402143,0.00002666965,0.00005357947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971645,0.00011427968,0.00049281097,0.00092430756,0.00054324436,0.0007608753],"domain_scores_gemma":[0.99796027,0.00016988708,0.000121998004,0.0013501082,0.00017709099,0.00022066028],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045469735,0.0003692893,0.00041062874,0.00012940579,0.00035466952,0.0011960838,0.0020894185,0.00011849311,0.000014081391],"category_scores_gemma":[0.000042924785,0.00030780447,0.00013760728,0.0015275363,0.00013778753,0.00046587148,0.00052650564,0.00045984154,0.000105752755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030398525,0.00022213135,0.0015175979,0.000370669,0.00030042848,0.0011527861,0.0007174775,0.0025339685,0.0003903553,0.84978586,0.036489062,0.10648926],"study_design_scores_gemma":[0.0006753496,0.00012992366,0.0032009566,0.0005144609,0.000019185714,0.00033364102,0.0000906312,0.9416686,0.00020696963,0.0024284082,0.05016836,0.00056346017],"about_ca_topic_score_codex":0.00025526714,"about_ca_topic_score_gemma":0.000037014364,"teacher_disagreement_score":0.9599817,"about_ca_system_score_codex":0.0001724658,"about_ca_system_score_gemma":0.00019562164,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4406247024","doi":"10.1007/s00446-024-00475-3","title":"($$\\Delta + 1$$) vertex coloring in O(n) communication","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Combinatorics; Fractional coloring; Vertex (graph theory); Complete coloring; List coloring; Mathematics; Computer science; Graph; Line graph","score_opus":0.013701662946639616,"score_gpt":0.2683874029262402,"score_spread":0.2546857399796006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406247024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056078885,0.00031380425,0.939144,0.0011950427,0.00035888422,0.00013678528,0.000008581306,0.00028247677,0.0024815155],"genre_scores_gemma":[0.9766286,0.0000111558775,0.023053916,0.00022672798,0.000010452943,0.0000057587736,0.000048781876,0.0000034184993,0.000011203852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877155,0.00011504277,0.0003294032,0.0003226923,0.00014099079,0.00032034202],"domain_scores_gemma":[0.9987177,0.0003341766,0.000073576855,0.00075622875,0.00007727922,0.000040986102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044282756,0.00012586771,0.0001821635,0.00020399259,0.00027932684,0.00019876519,0.0015057127,0.000059385045,0.000003241873],"category_scores_gemma":[0.000091514696,0.00014541669,0.000057488425,0.0017157324,0.000050264825,0.00021940436,0.00070928823,0.00028321365,0.000008570252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062631434,0.00016488356,0.013953577,0.00003161034,0.00002641221,0.00001515606,0.00043197678,0.006622859,0.00013923932,0.8239872,0.0014023787,0.15321843],"study_design_scores_gemma":[0.00049927697,0.000015076884,0.04486019,0.00021696776,0.0000033181338,0.0000034092245,0.00010568873,0.91555727,0.0005185071,0.034973945,0.0030622904,0.00018405869],"about_ca_topic_score_codex":0.00011751512,"about_ca_topic_score_gemma":0.000032129003,"teacher_disagreement_score":0.9205497,"about_ca_system_score_codex":0.000117385025,"about_ca_system_score_gemma":0.00006530439,"threshold_uncertainty_score":0.59299207},"labels":[],"label_agreement":null},{"id":"W4407262244","doi":"10.1007/s00446-025-00476-w","title":"When is recoverable consensus harder than consensus?","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Hellenic Foundation for Research and Innovation","keywords":"Scientific consensus; Consensus conference; Washington Consensus; Consensus algorithm; Uniform consensus; Computer science; Consensus; Geology; Political science; Data science; Artificial intelligence; Climate change; Library science; Law; Multi-agent system","score_opus":0.014030030635338654,"score_gpt":0.25512901596238197,"score_spread":0.24109898532704332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407262244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044400524,0.00065708946,0.9351592,0.0074502053,0.0017874389,0.0004149032,0.00045097806,0.0007305098,0.008949135],"genre_scores_gemma":[0.9863276,0.0000039371826,0.011136729,0.0014983347,0.000087884415,0.000009913547,0.00010366518,0.000013745391,0.0008182181],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709725,0.00017334067,0.00072043855,0.000875458,0.0003566182,0.0007768614],"domain_scores_gemma":[0.9976643,0.00036395053,0.0002687745,0.0011386682,0.00040251625,0.00016180717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005642519,0.0003514958,0.0005049709,0.00013570867,0.00052612845,0.0006038578,0.001244955,0.00018261903,0.00003127749],"category_scores_gemma":[0.00015794585,0.00035951572,0.00019489671,0.0009704447,0.00009627331,0.00010355074,0.0003830001,0.0003532061,0.00012297624],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047021567,0.00031653536,0.01543192,0.00026277374,0.0004331821,0.00021301548,0.0013021703,0.0029670172,0.0014888879,0.108569734,0.8177468,0.051220912],"study_design_scores_gemma":[0.0021475723,0.0000708987,0.0065957964,0.0006651989,0.000037487203,0.0000929512,0.0002944794,0.7159601,0.0035992835,0.018238476,0.25132138,0.0009763959],"about_ca_topic_score_codex":0.00019947211,"about_ca_topic_score_gemma":0.00000746128,"teacher_disagreement_score":0.9419271,"about_ca_system_score_codex":0.0001519452,"about_ca_system_score_gemma":0.00026495924,"threshold_uncertainty_score":0.9998857},"labels":[],"label_agreement":null},{"id":"W4409872544","doi":"10.1007/s00446-025-00478-8","title":"Efficient bounded timestamping from standard synchronization primitives","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Bounded function; Distributed computing; Parallel computing; Theoretical computer science; Computer network; Mathematics","score_opus":0.0062293000241328495,"score_gpt":0.2439041454820549,"score_spread":0.23767484545792206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409872544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06699106,0.00046994412,0.9287968,0.0004207471,0.0007751121,0.0002487545,0.00027885466,0.0005499628,0.001468733],"genre_scores_gemma":[0.9871686,0.0000024691576,0.012184124,0.00016295465,0.000077523284,0.000006366083,0.0003642918,0.0000091327865,0.000024534243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978482,0.00013005506,0.0005170969,0.000671076,0.00035474176,0.00047884134],"domain_scores_gemma":[0.9985316,0.0002181888,0.00021187802,0.0006540683,0.00029117565,0.000093136754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034285078,0.00024391219,0.0003469608,0.00010873062,0.0004958754,0.00064468884,0.00088158075,0.00010691064,0.000007788533],"category_scores_gemma":[0.00012625703,0.00025230175,0.00010019841,0.0011960893,0.000060385653,0.00012855825,0.0003156947,0.00020065349,0.000024858737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007133883,0.00047254164,0.010793205,0.00020381763,0.00042923907,0.000109370296,0.001883313,0.30952203,0.0023136428,0.39270917,0.008766302,0.272726],"study_design_scores_gemma":[0.00068947684,0.000024249615,0.007826874,0.0004198556,0.000014002671,0.0000025639783,0.00011000283,0.98228914,0.0012464261,0.001549502,0.0055451007,0.00028280332],"about_ca_topic_score_codex":0.00006106487,"about_ca_topic_score_gemma":0.0000023097857,"teacher_disagreement_score":0.9201775,"about_ca_system_score_codex":0.0003165289,"about_ca_system_score_gemma":0.00025250885,"threshold_uncertainty_score":0.9999929},"labels":[],"label_agreement":null},{"id":"W4411547426","doi":"10.1007/s00446-025-00489-5","title":"Fast deterministic rendezvous in labeled lines","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Aerospace engineering; Engineering","score_opus":0.013014461166883933,"score_gpt":0.28455956800656634,"score_spread":0.2715451068396824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411547426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012305577,0.000061012142,0.98457617,0.00089319126,0.00025344978,0.00013909461,0.000008340768,0.000247662,0.0015155111],"genre_scores_gemma":[0.9801683,0.00000473738,0.019368902,0.00027558955,0.00002115236,0.000004941671,0.000041303138,0.0000042955844,0.000110796675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987605,0.00009433403,0.00032363355,0.00033304977,0.0001452346,0.0003432234],"domain_scores_gemma":[0.99924374,0.0001747844,0.00006422506,0.00035025863,0.00010966198,0.000057306825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028688696,0.00011702016,0.00016963796,0.00017777049,0.00013638145,0.00022010434,0.0007028352,0.000056554174,0.0000050612243],"category_scores_gemma":[0.0001722071,0.00011976001,0.00003719863,0.0012949285,0.000028106497,0.00011587032,0.0002885449,0.00017758888,0.000015641761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002243002,0.00054246176,0.02961127,0.00018779236,0.00006178445,0.00023024397,0.0012848933,0.33612838,0.0013745031,0.21465583,0.0039780797,0.41192234],"study_design_scores_gemma":[0.00047633552,0.00002063195,0.004631778,0.000087838,0.0000018719858,0.0000034752957,0.000028957425,0.992118,0.0002674616,0.0012647758,0.00097603834,0.00012283734],"about_ca_topic_score_codex":0.000016994827,"about_ca_topic_score_gemma":0.000010615805,"teacher_disagreement_score":0.9678627,"about_ca_system_score_codex":0.00006474942,"about_ca_system_score_gemma":0.00010966759,"threshold_uncertainty_score":0.48836714},"labels":[],"label_agreement":null}]}