{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78581786,0.00029768547,0.195814,0.0016870806,0.00007325765,0.000096618984,0.00038388913,0.00031540537,0.015514215],"genre_scores_gemma":[0.996473,0.000039450577,0.0027017721,0.000018344053,0.000019877049,0.000015109797,0.00006359254,0.000016756088,0.0006520682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965675,0.0009937922,0.0002361115,0.0006917558,0.000764668,0.000746155],"domain_scores_gemma":[0.8764958,0.088907585,0.013904528,0.009959788,0.0058602947,0.0048720026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075422926,0.00027564575,0.001371733,0.0015824173,0.0010543219,0.004039652,0.0012621742,0.0014651555,0.003906224],"category_scores_gemma":[0.080467336,0.00039087672,0.00054195843,0.0009678736,0.002984239,0.008115983,0.0020923694,0.0018330493,0.00051188475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006397646,0.0007607332,0.07049349,0.0003900206,0.00050572876,0.00059960404,0.0025742466,0.22463156,0.016599536,0.57703,0.0032653764,0.09675214],"study_design_scores_gemma":[0.00028766115,0.0010022939,0.022024345,0.000052392228,0.00018007813,0.00042282444,0.001067119,0.33251283,0.008747438,0.63218206,0.0013915964,0.00012935669],"about_ca_topic_score_codex":0.000983418,"about_ca_topic_score_gemma":0.00075565075,"teacher_disagreement_score":0.0075422926,"about_ca_system_score_codex":0.0015375621,"about_ca_system_score_gemma":0.0027330648,"threshold_uncertainty_score":0.039887965},"labels":[],"label_agreement":null},{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","score_opus":0.01483399648761171,"score_gpt":0.26098157343179307,"score_spread":0.24614757694418135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967908173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02979471,0.00059431675,0.9173594,0.0058311685,0.0008842833,0.00025941757,0.00027248793,0.0016083221,0.043395836],"genre_scores_gemma":[0.74621487,0.00071082625,0.22554645,0.0025381926,0.0005460829,0.000544195,0.0005698665,0.00063495,0.022694597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992301,0.0029523366,0.0003320232,0.0012095935,0.0022811864,0.00092393026],"domain_scores_gemma":[0.9887263,0.005020905,0.00043455642,0.00305802,0.0024400328,0.0003201634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059202015,0.00095423206,0.0016475344,0.0008933588,0.0021088559,0.002663313,0.0034211006,0.0028247125,0.008006364],"category_scores_gemma":[0.020771353,0.0007901814,0.0012953788,0.0010210985,0.0038429692,0.005296099,0.0051835445,0.0040019713,0.0022535278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006743628,0.000094980984,0.00051747914,0.00027279663,0.000115965646,0.00017548457,0.00039048205,0.059869573,0.0058686486,0.8716545,0.0136032775,0.046762493],"study_design_scores_gemma":[0.0003957047,0.000114306415,0.0002524887,0.0000726853,0.00007667776,0.00012106288,0.00012205429,0.34142882,0.009413559,0.63328856,0.014637506,0.00007654683],"about_ca_topic_score_codex":0.002173639,"about_ca_topic_score_gemma":0.0015746271,"teacher_disagreement_score":0.008006364,"about_ca_system_score_codex":0.0020653,"about_ca_system_score_gemma":0.004384436,"threshold_uncertainty_score":0.031309366},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2927701,0.0013373895,0.66872543,0.008788339,0.0005333234,0.00013760678,0.0004042942,0.0033632678,0.023940297],"genre_scores_gemma":[0.920525,0.00036509597,0.06597112,0.0003279146,0.00008372366,0.000067620815,0.00020844175,0.0005681103,0.011882902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915147,0.00032981162,0.000028043798,0.00017226387,0.00014711889,0.00017141858],"domain_scores_gemma":[0.9953087,0.0026553764,0.00019202134,0.0011113777,0.0002667903,0.0004656976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013376315,0.0005717441,0.0013130197,0.0005386437,0.0024084696,0.0020448908,0.001879113,0.0019290836,0.006696729],"category_scores_gemma":[0.0125420205,0.0004763996,0.0005480371,0.001144963,0.002904287,0.007260653,0.0035570678,0.002526334,0.0012839418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018991586,0.00023428911,0.0018796006,0.0002810437,0.00009777004,0.00057823595,0.0020695638,0.4001177,0.0063309297,0.42209688,0.035097636,0.12931722],"study_design_scores_gemma":[0.00008884924,0.000053456442,0.00018641946,0.000021248403,0.000023852748,0.00015357233,0.0007218623,0.57869816,0.0024775004,0.4119942,0.005550333,0.000030495594],"about_ca_topic_score_codex":0.0050291363,"about_ca_topic_score_gemma":0.005290134,"teacher_disagreement_score":0.006696729,"about_ca_system_score_codex":0.000809992,"about_ca_system_score_gemma":0.00096176896,"threshold_uncertainty_score":0.022402823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15360351,0.0013914475,0.81017077,0.004263989,0.00039191957,0.00017197664,0.00025633414,0.0015159635,0.02823412],"genre_scores_gemma":[0.93447363,0.00060176745,0.05854094,0.00055592036,0.00023032624,0.000098227174,0.000118199845,0.00030840904,0.005072545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966708,0.0016344438,0.0000792048,0.00043211022,0.00074610877,0.0004372747],"domain_scores_gemma":[0.95692134,0.03628909,0.0010380899,0.0031333864,0.0017870227,0.0008311703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038423284,0.0008321191,0.0018243368,0.0015308041,0.0013721439,0.0023787732,0.0021797617,0.0021365718,0.004930954],"category_scores_gemma":[0.04708641,0.0008454504,0.0009329546,0.0018720139,0.0023128847,0.0038635435,0.0024741078,0.0033870845,0.00036311222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006632699,0.00027838087,0.0017049937,0.00025446218,0.00008965328,0.00021889182,0.00035185763,0.6188512,0.003667652,0.30450484,0.011299399,0.058115464],"study_design_scores_gemma":[0.000029817242,0.000021151818,0.00017449536,0.00001172002,0.000021227092,0.000045405806,0.000027628086,0.836578,0.0009063092,0.16140923,0.00076445966,0.000010500419],"about_ca_topic_score_codex":0.0060590724,"about_ca_topic_score_gemma":0.0041960706,"teacher_disagreement_score":0.0060590724,"about_ca_system_score_codex":0.002881511,"about_ca_system_score_gemma":0.0023243907,"threshold_uncertainty_score":0.020906925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056988213,0.00041840124,0.9397937,0.0007128589,0.000046273148,0.000032524607,0.00005756963,0.00017492223,0.0017755354],"genre_scores_gemma":[0.81648964,0.00057105,0.17292087,0.00011607244,0.00012388024,0.00019375661,0.00015441953,0.0000867393,0.009343608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923337,0.00022982372,0.00004310068,0.00023065857,0.00014945919,0.00011354803],"domain_scores_gemma":[0.997619,0.0016182199,0.00029421868,0.00010616781,0.0002479851,0.000114493894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359624,0.00084530225,0.0013378863,0.0011373769,0.001358751,0.0016657964,0.0016786396,0.0023950043,0.002527987],"category_scores_gemma":[0.0067961863,0.00072587194,0.00078388385,0.0017349487,0.0021285505,0.0021183516,0.0026400466,0.001024874,0.00037475204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017457212,0.00003493581,0.000791873,0.00011012163,0.000041234063,0.00017441504,0.00014522088,0.95360535,0.001314453,0.029820122,0.00062896515,0.013158823],"study_design_scores_gemma":[0.000025409377,0.000025315845,0.00011044248,0.0000043685177,0.000009961422,0.000029157676,0.000028491451,0.9808357,0.00019354591,0.018536689,0.00019335552,0.000007571619],"about_ca_topic_score_codex":0.0076442673,"about_ca_topic_score_gemma":0.004302157,"teacher_disagreement_score":0.0076442673,"about_ca_system_score_codex":0.0012822077,"about_ca_system_score_gemma":0.0010257902,"threshold_uncertainty_score":0.015199542},"labels":[],"label_agreement":null},{"id":"W1983791345","doi":"10.1007/s00446-011-0139-3","title":"Symbolic synthesis of masking fault-tolerant distributed programs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Masking (illustration); Computer science; Fault tolerance; Programming language; Backward masking; Parallel computing; Distributed computing; Psychology; Art; Neuroscience","score_opus":0.027575467724975253,"score_gpt":0.2330057222646325,"score_spread":0.20543025453965724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983791345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14935987,0.00020548321,0.8290407,0.00031395804,0.00011677183,0.000057212164,0.0000814,0.0019308272,0.01889373],"genre_scores_gemma":[0.9144051,0.000105871106,0.08239056,0.000054667365,0.000017761155,0.00005865181,0.00007811211,0.0001338737,0.0027553411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997118,0.00006928155,0.000014757451,0.00003521575,0.00012042712,0.000048354235],"domain_scores_gemma":[0.9994081,0.00032175405,0.000056787765,0.000106132975,0.00008038245,0.00002680344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032816883,0.00039322322,0.0003701076,0.00030338153,0.00040528257,0.00069504796,0.000641646,0.00047020544,0.0037065274],"category_scores_gemma":[0.0017959217,0.00020304813,0.000293693,0.00027504066,0.00057191664,0.00054128905,0.0006515274,0.0006066279,0.00032264192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045830122,0.00011739383,0.00058875926,0.000277675,0.00003640682,0.00031088397,0.0003797978,0.5209579,0.06162677,0.31669816,0.0017171471,0.096830845],"study_design_scores_gemma":[0.00009082784,0.00010010509,0.00009047839,0.000027278356,0.000030627292,0.000050261842,0.000035074267,0.89009523,0.029703293,0.07555492,0.004210723,0.000011202192],"about_ca_topic_score_codex":0.0008568236,"about_ca_topic_score_gemma":0.0012469764,"teacher_disagreement_score":0.0037065274,"about_ca_system_score_codex":0.0005874307,"about_ca_system_score_gemma":0.0008030449,"threshold_uncertainty_score":0.012399554},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06756887,0.0011153618,0.9222708,0.0021118987,0.00013149552,0.00010807226,0.000042415442,0.00019209969,0.006458954],"genre_scores_gemma":[0.75338537,0.0009599434,0.24101007,0.0002981804,0.00015339156,0.0002469492,0.000058231366,0.0001225397,0.0037653206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981604,0.0010162502,0.00007370037,0.00026307398,0.00027761125,0.00020898496],"domain_scores_gemma":[0.9909146,0.0067196335,0.0007891433,0.00070019753,0.0004401555,0.00043628353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049474365,0.0011448337,0.0022240586,0.0015600326,0.0017462457,0.0029303061,0.0033028538,0.003342548,0.0018306734],"category_scores_gemma":[0.01923596,0.0010408107,0.0008657154,0.0017054772,0.004449083,0.0067624133,0.004269706,0.0023518754,0.00025102997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006295367,0.000117796066,0.0004105656,0.00014671005,0.00012378496,0.00008766325,0.00028655896,0.60973954,0.0012480909,0.36068106,0.0028433546,0.023685303],"study_design_scores_gemma":[0.0000843727,0.00003835392,0.000039717455,0.000016096534,0.000025454225,0.00001945145,0.000044058113,0.82317924,0.00037595624,0.17555529,0.0006113939,0.0000107348405],"about_ca_topic_score_codex":0.0013084225,"about_ca_topic_score_gemma":0.0013532632,"teacher_disagreement_score":0.0049474365,"about_ca_system_score_codex":0.0017152458,"about_ca_system_score_gemma":0.0017116765,"threshold_uncertainty_score":0.02616489},"labels":[],"label_agreement":null},{"id":"W1984883054","doi":"10.1007/s00446-011-0128-6","title":"Randomized mutual exclusion with sub-logarithmic RMR-complexity","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Upper and lower bounds; Logarithm; Binary logarithm; Computer science; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.03728997020315791,"score_gpt":0.2374978864502045,"score_spread":0.2002079162470466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984883054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090792656,0.002639833,0.8145105,0.02215314,0.0010670534,0.00087019335,0.002345877,0.010614955,0.05500576],"genre_scores_gemma":[0.7887092,0.0008686402,0.1781666,0.0035453257,0.0012967577,0.0015080681,0.0016787669,0.0020105303,0.022216022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97924864,0.008853491,0.0007828613,0.0029831235,0.0048952643,0.0032366475],"domain_scores_gemma":[0.9077522,0.06656636,0.0026562705,0.018466648,0.0021239365,0.002434576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009906407,0.0028996456,0.0052576694,0.0015525543,0.0032169565,0.0066011595,0.008274031,0.005704552,0.024808787],"category_scores_gemma":[0.052851513,0.0016329366,0.0028779814,0.0028241165,0.0057575735,0.016614465,0.010350426,0.0094405785,0.0057770466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075603644,0.0018175383,0.0025989213,0.0013427119,0.00040136065,0.0003731479,0.00063725334,0.31213877,0.012633461,0.43116733,0.0578946,0.17143457],"study_design_scores_gemma":[0.00095634226,0.0002216436,0.00037933432,0.000047059526,0.00012705915,0.00019095042,0.000075965836,0.5696833,0.003638468,0.42119414,0.0034141215,0.00007168369],"about_ca_topic_score_codex":0.0020892096,"about_ca_topic_score_gemma":0.0040074564,"teacher_disagreement_score":0.024808787,"about_ca_system_score_codex":0.0074520395,"about_ca_system_score_gemma":0.010017782,"threshold_uncertainty_score":0.082993686},"labels":[],"label_agreement":null},{"id":"W1987584238","doi":"10.1007/s00446-010-0096-2","title":"Closing the complexity gap between FCFS mutual exclusion and mutual exclusion","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Binary logarithm; Algorithm; Parallel computing; Theoretical computer science; Distributed computing; Discrete mathematics; Mathematics; Computer network; Artificial intelligence","score_opus":0.038226657414625956,"score_gpt":0.27780160395382425,"score_spread":0.2395749465391983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987584238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07617928,0.003789555,0.86510825,0.01736369,0.0008324564,0.000116142335,0.0002064144,0.0007784577,0.035625737],"genre_scores_gemma":[0.85048586,0.002317554,0.1344388,0.001728239,0.0017606934,0.00024755677,0.000249118,0.00040226642,0.00837002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919761,0.0021478892,0.00027464636,0.000755275,0.0040856753,0.00076042966],"domain_scores_gemma":[0.9604365,0.029191868,0.0011986332,0.006360447,0.0019454171,0.00086714467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046311687,0.00072775176,0.001650971,0.001026412,0.0025780164,0.0051874756,0.002765178,0.002845907,0.0060449285],"category_scores_gemma":[0.028554255,0.0006979965,0.001228112,0.0015935821,0.005526633,0.021250676,0.0072547547,0.006435995,0.00074548495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041447824,0.00008642584,0.000665582,0.00020764656,0.000047323596,0.000102052494,0.0005296917,0.040124357,0.00161715,0.8994859,0.004850097,0.05186936],"study_design_scores_gemma":[0.00005913375,0.000044853867,0.0002860832,0.000037672464,0.000026465576,0.00013212951,0.00011829779,0.13018364,0.0017412386,0.8554233,0.011916764,0.000030386629],"about_ca_topic_score_codex":0.0030599763,"about_ca_topic_score_gemma":0.0021322384,"teacher_disagreement_score":0.0060449285,"about_ca_system_score_codex":0.003752954,"about_ca_system_score_gemma":0.0040654223,"threshold_uncertainty_score":0.027229667},"labels":[],"label_agreement":null},{"id":"W1991072415","doi":"10.1007/s00446-010-0106-4","title":"Adaptive progress: a gracefully-degrading liveness property","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Liveness; Computer science; Abstraction; Implementation; Property (philosophy); Object (grammar); Process (computing); Distributed computing; Bridge (graph theory); Key (lock); Simple (philosophy); Theoretical computer science; Programming language; Computer security; Artificial intelligence","score_opus":0.014107387576893332,"score_gpt":0.24322895281708548,"score_spread":0.22912156524019214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991072415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13953647,0.0005146182,0.8357943,0.0014982807,0.00019918139,0.00011490703,0.00023788182,0.0028101313,0.019294096],"genre_scores_gemma":[0.94161797,0.00033935113,0.04787702,0.00023425794,0.00019176291,0.00017057912,0.00014352221,0.00046221633,0.008963392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761486,0.00036204004,0.0001705807,0.0005375867,0.0008623173,0.00045266617],"domain_scores_gemma":[0.9717452,0.011091392,0.0026759203,0.009693335,0.0033001164,0.0014940941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026610862,0.0009607295,0.001044904,0.0010821507,0.0015334907,0.0027166528,0.0021393339,0.0015475722,0.0034612452],"category_scores_gemma":[0.024997042,0.0005245051,0.0006659254,0.0010993294,0.003692062,0.006537035,0.0038639987,0.0041680136,0.00085383817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009281849,0.00016380734,0.0023526668,0.0002466607,0.00006386367,0.00086140144,0.0014170201,0.091395825,0.03809454,0.77768624,0.0043063937,0.0824834],"study_design_scores_gemma":[0.00014353014,0.00027012982,0.00053164456,0.0000356711,0.00008272955,0.00074136193,0.0002122776,0.32282147,0.023440063,0.64439195,0.0072737574,0.000055373705],"about_ca_topic_score_codex":0.00069657015,"about_ca_topic_score_gemma":0.00043194083,"teacher_disagreement_score":0.0034612452,"about_ca_system_score_codex":0.0008841741,"about_ca_system_score_gemma":0.0013260727,"threshold_uncertainty_score":0.014073312},"labels":[],"label_agreement":null},{"id":"W1991558558","doi":"10.1007/s00446-015-0261-8","title":"Universal constructions that ensure disjoint-access parallelism and wait-freedom","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Computer science; Parallelism (grammar); Parallel computing; Data parallelism; Task parallelism; Crash; Degrees of freedom (physics and chemistry); Base (topology); Process (computing); Distributed computing; Programming language; Mathematics","score_opus":0.01891117604027799,"score_gpt":0.2416308932677721,"score_spread":0.22271971722749412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991558558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04724572,0.0003495073,0.92959845,0.0013011532,0.00028610002,0.00015513982,0.00022686161,0.0037937143,0.017043453],"genre_scores_gemma":[0.7870108,0.00046128666,0.19772011,0.0013609825,0.00036912892,0.00050916284,0.00035628068,0.0020160147,0.010196229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99225086,0.001446018,0.00062526035,0.0017384425,0.0018128536,0.00212661],"domain_scores_gemma":[0.9702324,0.011822645,0.0015266712,0.012837687,0.0017890877,0.0017914625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062611587,0.0013428618,0.0025149193,0.0014557629,0.004901464,0.0053123995,0.0037530023,0.0026134008,0.00666745],"category_scores_gemma":[0.02623344,0.0022383055,0.002673709,0.0026893292,0.009840058,0.01695075,0.017035693,0.009264467,0.0016729987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011909088,0.000052770713,0.0002315183,0.00008077504,0.000018072418,0.000043066626,0.00048002528,0.0022467393,0.0017670819,0.9834238,0.0016777513,0.009859366],"study_design_scores_gemma":[0.00006581372,0.00003061682,0.000088837805,0.000035770496,0.00006762485,0.00006864834,0.00008991758,0.009442411,0.005140097,0.97915274,0.0057757087,0.000041813324],"about_ca_topic_score_codex":0.0009090218,"about_ca_topic_score_gemma":0.0011620949,"teacher_disagreement_score":0.00666745,"about_ca_system_score_codex":0.0024078866,"about_ca_system_score_gemma":0.0034053107,"threshold_uncertainty_score":0.033112526},"labels":[],"label_agreement":null},{"id":"W1992598604","doi":"10.1007/s00446-011-0131-y","title":"How much memory is needed for leader election","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Logarithm; Class (philosophy); Computer science; Node (physics); Theory of computation; Exponential function; Topology (electrical circuits); Discrete mathematics; Binary logarithm; Combinatorics; Mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.041901846813373694,"score_gpt":0.24376545351609982,"score_spread":0.20186360670272613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992598604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58957165,0.008946066,0.30567023,0.01791267,0.0035045808,0.00022893878,0.0013072328,0.005579461,0.06727925],"genre_scores_gemma":[0.9756511,0.0005039293,0.014620424,0.00037016455,0.00022430076,0.000056718276,0.0002319666,0.00028033342,0.008061062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.00028411468,0.00007843652,0.0002310993,0.00022078794,0.00038794155],"domain_scores_gemma":[0.99421835,0.00257516,0.00037202204,0.0016229075,0.000780017,0.00043151318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009947054,0.000427111,0.0009296086,0.0006105321,0.0013649,0.0026288708,0.0011056061,0.0010889648,0.016518654],"category_scores_gemma":[0.011159431,0.00048914255,0.00045676614,0.00056477106,0.00070452446,0.007838663,0.0011078017,0.0011355841,0.0034958522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005840114,0.00050807255,0.01513906,0.00137937,0.00036917833,0.0006143629,0.0009231056,0.0902732,0.106142744,0.07322182,0.036165897,0.669423],"study_design_scores_gemma":[0.0008870071,0.0011278928,0.012383748,0.0003356898,0.00077903166,0.0014109319,0.0032016921,0.57203937,0.15449211,0.20748831,0.045625295,0.00022890452],"about_ca_topic_score_codex":0.0015272377,"about_ca_topic_score_gemma":0.0034770342,"teacher_disagreement_score":0.016518654,"about_ca_system_score_codex":0.000694736,"about_ca_system_score_gemma":0.0015388897,"threshold_uncertainty_score":0.05526042},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31515604,0.0018999486,0.66949797,0.0035842578,0.00029262633,0.00041381925,0.00051597535,0.0011276588,0.0075116903],"genre_scores_gemma":[0.86840516,0.0004542724,0.12680474,0.00015566281,0.00009730137,0.00015002573,0.00014857118,0.00015311404,0.003631143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982547,0.0008120571,0.0001264027,0.0003308504,0.00019490447,0.0002811074],"domain_scores_gemma":[0.9907444,0.006297998,0.00074947265,0.00091821706,0.00071308005,0.00057675765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00355649,0.0011686094,0.0029651583,0.0012251723,0.0015056016,0.0026009814,0.0026075668,0.0032055688,0.0037112033],"category_scores_gemma":[0.017164582,0.0011900477,0.0006323179,0.001815147,0.0019604296,0.005682991,0.0018398198,0.001119719,0.00067795435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001953335,0.000234244,0.0017232787,0.00036872562,0.00009132398,0.00019968614,0.00024278671,0.90551805,0.006151845,0.028969286,0.004886084,0.049661286],"study_design_scores_gemma":[0.0001549518,0.00010554537,0.00023615117,0.000015949578,0.00003778905,0.00005622921,0.00014619339,0.9763001,0.0023004464,0.020230345,0.0003957146,0.000020564723],"about_ca_topic_score_codex":0.0033554125,"about_ca_topic_score_gemma":0.004644971,"teacher_disagreement_score":0.0037112033,"about_ca_system_score_codex":0.0018568629,"about_ca_system_score_gemma":0.0027221774,"threshold_uncertainty_score":0.018808722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018503748,0.000117086114,0.9771696,0.00007511893,0.000056687597,0.00010417351,0.000028999342,0.000672359,0.0032723148],"genre_scores_gemma":[0.51259947,0.00023767963,0.4831996,0.00007388459,0.000027909973,0.00035263598,0.00011498364,0.00018013126,0.0032136657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989759,0.00026858452,0.00009317011,0.0002058985,0.0003034648,0.00015307455],"domain_scores_gemma":[0.9989334,0.00047190717,0.00008411019,0.0002750995,0.00018970399,0.000045842877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014414048,0.0007513733,0.00083761616,0.00065999664,0.000620516,0.0011064443,0.0012013407,0.0005579314,0.002471747],"category_scores_gemma":[0.0021317576,0.0004488867,0.00083600666,0.00059749593,0.000945193,0.001230394,0.0009896057,0.00095193187,0.0003013211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039798216,0.00012929093,0.00044617732,0.00025232663,0.00009270149,0.00038534208,0.00019040494,0.7017057,0.0535349,0.114935145,0.0008952264,0.12703487],"study_design_scores_gemma":[0.00006482099,0.00006446159,0.00010126242,0.000018477485,0.000064209424,0.00006221995,0.000028316002,0.92618936,0.028467396,0.042301178,0.0026183417,0.000020053832],"about_ca_topic_score_codex":0.001700151,"about_ca_topic_score_gemma":0.002736803,"teacher_disagreement_score":0.002471747,"about_ca_system_score_codex":0.0008589399,"about_ca_system_score_gemma":0.0015316542,"threshold_uncertainty_score":0.008268833},"labels":[],"label_agreement":null},{"id":"W2005147105","doi":"10.1007/s00446-011-0137-5","title":"Fully-adaptive algorithms for long-lived renaming","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto; Dalhousie University","funders":"","keywords":"Computer science; Asynchronous communication; Algorithm; Process (computing); Bounded function; Theoretical computer science; Mathematics; Programming language; Computer network","score_opus":0.0666930311508916,"score_gpt":0.2723594850737362,"score_spread":0.2056664539228446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005147105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018672392,0.00034675788,0.9777866,0.00015714286,0.0001193912,0.00005612353,0.000034371616,0.0010626507,0.0017645508],"genre_scores_gemma":[0.53925014,0.00032406233,0.4506724,0.00023341223,0.00013330982,0.00023274183,0.00022440849,0.00039816977,0.008531333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975817,0.0007209286,0.00019441826,0.000514978,0.0005782907,0.00040959896],"domain_scores_gemma":[0.99115306,0.0036006193,0.00041870587,0.0033596735,0.001108197,0.00035975815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003037067,0.00081787317,0.0015472628,0.00074068346,0.0015222867,0.0020608334,0.0041891565,0.0016541398,0.0054365546],"category_scores_gemma":[0.014530172,0.00060780416,0.0006207082,0.001094765,0.001609531,0.0061535663,0.004841792,0.0023899034,0.0010089542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012658762,0.00029716734,0.0015699723,0.00020579952,0.00012871825,0.00012825055,0.00059970253,0.41813144,0.011079141,0.19917555,0.00750439,0.35991398],"study_design_scores_gemma":[0.000059892114,0.000060464175,0.00009678665,0.000010789513,0.000017639763,0.000052806892,0.000045277025,0.92448515,0.0020228236,0.071188,0.0019343188,0.000026001822],"about_ca_topic_score_codex":0.002471926,"about_ca_topic_score_gemma":0.003271628,"teacher_disagreement_score":0.0054365546,"about_ca_system_score_codex":0.0010255075,"about_ca_system_score_gemma":0.0015938028,"threshold_uncertainty_score":0.018187165},"labels":[],"label_agreement":null},{"id":"W2015468161","doi":"10.1007/s00446-011-0146-4","title":"The minimum information about failures for solving non-local tasks in message-passing systems","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Message passing; Commit; Task (project management); Process (computing); Set (abstract data type); Function (biology); Distributed computing; Value (mathematics); Theory of computation; Theoretical computer science; Algorithm; Programming language; Machine learning","score_opus":0.014691213198245175,"score_gpt":0.23371146627504805,"score_spread":0.21902025307680287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015468161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16589546,0.001506353,0.825347,0.002261676,0.00022172797,0.00011433328,0.0005306351,0.0009972788,0.0031256431],"genre_scores_gemma":[0.85700464,0.0005815344,0.13900359,0.00019228135,0.00031516203,0.00022726784,0.00055572245,0.00045239998,0.0016674433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596715,0.0014340946,0.00048271002,0.0005724517,0.001128253,0.00041530098],"domain_scores_gemma":[0.9396034,0.046936624,0.0032716999,0.0050582476,0.0031628085,0.0019672909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005632433,0.0013196768,0.0031214624,0.002531453,0.0015978044,0.0032714629,0.003675836,0.0029068347,0.0024370884],"category_scores_gemma":[0.058600347,0.0011484869,0.0010569652,0.0018704366,0.0027223432,0.008903621,0.002585884,0.0037767568,0.00035701576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070566977,0.00044059023,0.0037827366,0.0014024948,0.00019599433,0.00022174684,0.0013997175,0.53440034,0.01226632,0.25112018,0.007728323,0.17998493],"study_design_scores_gemma":[0.00014947282,0.00034195848,0.0009908429,0.00007970195,0.00007835091,0.000070880946,0.00009255319,0.6986983,0.0050915405,0.29363796,0.00071596645,0.000052449584],"about_ca_topic_score_codex":0.0010590678,"about_ca_topic_score_gemma":0.0011202524,"teacher_disagreement_score":0.005632433,"about_ca_system_score_codex":0.0015272326,"about_ca_system_score_gemma":0.0023702562,"threshold_uncertainty_score":0.02978748},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33892348,0.00058838143,0.630268,0.0024355554,0.00018122698,0.000115167415,0.00008198322,0.00017796748,0.027228268],"genre_scores_gemma":[0.98681355,0.00014394958,0.008123462,0.000062584535,0.000036737416,0.00006390978,0.000015963173,0.000020007721,0.0047198976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988298,0.0005034813,0.00004219014,0.00017556238,0.00024198559,0.00020709241],"domain_scores_gemma":[0.9911685,0.0065707234,0.0006659017,0.0003333728,0.0005283098,0.0007331412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021062454,0.0006221688,0.0011917402,0.00069088745,0.0009394058,0.002375007,0.0018885739,0.0015781493,0.0045173215],"category_scores_gemma":[0.016847726,0.00056171964,0.0006924747,0.00054486387,0.0031215125,0.0035289358,0.0024045727,0.0019707633,0.00024911185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001448577,0.00009782166,0.0012677766,0.000092826056,0.000059909864,0.00027444668,0.00045849776,0.31648073,0.0019595423,0.66957486,0.0010880461,0.008500709],"study_design_scores_gemma":[0.000045843,0.000028587856,0.00020900936,0.000008373413,0.000015256688,0.000038179955,0.0000784875,0.787169,0.00021914777,0.21166149,0.0005113262,0.000015329613],"about_ca_topic_score_codex":0.0054438324,"about_ca_topic_score_gemma":0.0028701962,"teacher_disagreement_score":0.0054438324,"about_ca_system_score_codex":0.0016837713,"about_ca_system_score_gemma":0.001480477,"threshold_uncertainty_score":0.015111923},"labels":[],"label_agreement":null},{"id":"W2034109654","doi":"10.1007/s00446-008-0069-x","title":"Lower bound for scalable Byzantine Agreement","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scalability; Omega; Upper and lower bounds; Binary logarithm; String (physics); Parallel computing; Combinatorics; Discrete mathematics; Mathematics; Physics; Operating system","score_opus":0.02167600237742189,"score_gpt":0.2504902375396287,"score_spread":0.22881423516220678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034109654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060117863,0.0043358156,0.81341374,0.01649726,0.0015708809,0.0006397493,0.0023948161,0.006090998,0.09493899],"genre_scores_gemma":[0.7645482,0.0031939566,0.17907578,0.003288412,0.002010622,0.0016071132,0.003445656,0.002893444,0.0399368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9851075,0.002831099,0.0005373533,0.0019501322,0.006178004,0.0033959504],"domain_scores_gemma":[0.94716877,0.03472018,0.00173221,0.010303941,0.0037824593,0.0022924738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012376635,0.003858949,0.0062601916,0.0033413377,0.006522413,0.010343688,0.009901251,0.0051973723,0.029068084],"category_scores_gemma":[0.049604192,0.0016778246,0.0023782062,0.005768336,0.0052918005,0.026100457,0.013377416,0.013287409,0.0061933156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026375568,0.00050488993,0.0009802984,0.0009901389,0.00023111467,0.0002132548,0.00078695413,0.12734507,0.0064035594,0.7350034,0.054520976,0.07038272],"study_design_scores_gemma":[0.00022611678,0.000155097,0.00022318469,0.00009743672,0.000113701906,0.00009399379,0.00012027884,0.2900317,0.0023883022,0.7004599,0.006042546,0.000047726997],"about_ca_topic_score_codex":0.0031514124,"about_ca_topic_score_gemma":0.0048141186,"teacher_disagreement_score":0.029068084,"about_ca_system_score_codex":0.0071630054,"about_ca_system_score_gemma":0.009600716,"threshold_uncertainty_score":0.097242415},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17181586,0.0002437488,0.81271666,0.00059731735,0.00009616583,0.0003240345,0.00046025653,0.009521416,0.004224446],"genre_scores_gemma":[0.72278017,0.00010045502,0.2713146,0.00024820757,0.000047076886,0.00026304898,0.0010828768,0.00086130685,0.0033023644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99213785,0.0031734887,0.00070535863,0.0010678944,0.0021293,0.0007861726],"domain_scores_gemma":[0.92410505,0.056965422,0.0039744787,0.008504717,0.0052740905,0.0011761443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062532392,0.0013497671,0.0011091955,0.0023965882,0.0012371099,0.0020923573,0.0029447468,0.0021624917,0.0056965225],"category_scores_gemma":[0.037133306,0.0009888442,0.0012771063,0.0013741952,0.0024051263,0.004468919,0.0025817698,0.0019608177,0.0008394103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047483565,0.0013484498,0.030144867,0.00121608,0.00031585418,0.0019563246,0.0019883548,0.21909514,0.040730108,0.2698539,0.0133208055,0.41528174],"study_design_scores_gemma":[0.00047507425,0.00055048906,0.0017978864,0.00021352689,0.00020604614,0.00044891704,0.00024484866,0.62176573,0.048810463,0.32015425,0.0052391733,0.0000935432],"about_ca_topic_score_codex":0.0035360642,"about_ca_topic_score_gemma":0.0063915993,"teacher_disagreement_score":0.0062532392,"about_ca_system_score_codex":0.0016808121,"about_ca_system_score_gemma":0.0031549747,"threshold_uncertainty_score":0.033070683},"labels":[],"label_agreement":null},{"id":"W2038924034","doi":"10.1007/s00446-003-0091-y","title":"Hundreds of impossibility results for distributed computing","year":2003,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Impossibility; Variety (cybernetics); Distributed computing; Theory of computation; Theoretical computer science; Resource (disambiguation); Fault tolerance; Resource allocation; Algorithm; Artificial intelligence; Computer network","score_opus":0.020728668085622966,"score_gpt":0.27631319757487316,"score_spread":0.2555845294892502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038924034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049995556,0.06880267,0.6724761,0.06010863,0.0058254697,0.00019989534,0.0009797054,0.0028977306,0.13871425],"genre_scores_gemma":[0.66098017,0.049665354,0.21699505,0.011568677,0.024280395,0.0010275592,0.0029478515,0.0018776848,0.030657306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99105716,0.0021465134,0.00068414304,0.0018986673,0.0034671559,0.0007463678],"domain_scores_gemma":[0.9208265,0.064350836,0.0010710054,0.009906809,0.0025669255,0.001277927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008939336,0.0025116797,0.0024688637,0.0039703045,0.0042285146,0.0074125896,0.0038441026,0.0048718285,0.010464572],"category_scores_gemma":[0.04495262,0.0021892472,0.0033089675,0.0046535837,0.009975886,0.020054474,0.00733724,0.01686954,0.0028020875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040577154,0.00024786073,0.0016513921,0.001717261,0.0003052776,0.0003507829,0.00063320505,0.016304016,0.0016750557,0.8296218,0.045134053,0.10195348],"study_design_scores_gemma":[0.00004464392,0.000021047648,0.00024063925,0.00010787845,0.00005404233,0.00013599994,0.00006537158,0.0099028405,0.0006434238,0.974703,0.01404701,0.00003416126],"about_ca_topic_score_codex":0.00046059646,"about_ca_topic_score_gemma":0.00034764133,"teacher_disagreement_score":0.010464572,"about_ca_system_score_codex":0.0021764257,"about_ca_system_score_gemma":0.001187664,"threshold_uncertainty_score":0.047276318},"labels":[],"label_agreement":null},{"id":"W2042734235","doi":"10.1007/s00446-012-0158-8","title":"Partial synchrony based on set timeliness","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Generalization; Set (abstract data type); Simple (philosophy); Simplicity; Computer science; Theory of computation; Agreement; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Physics","score_opus":0.020088775776242573,"score_gpt":0.26762045343549734,"score_spread":0.24753167765925477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042734235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03284977,0.00025336267,0.95963454,0.00028227016,0.0001852335,0.000096425974,0.00021261262,0.00093189994,0.005553859],"genre_scores_gemma":[0.8332646,0.00041237855,0.1588831,0.00022410002,0.00038858585,0.0003050886,0.0005142931,0.00046062525,0.005547211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704784,0.0007372797,0.00023385293,0.0006549923,0.0010381541,0.00028785755],"domain_scores_gemma":[0.9787587,0.011554282,0.0018173354,0.0048176735,0.0020318902,0.001020094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032957725,0.0008286234,0.002010681,0.0019506931,0.0013725968,0.0027959237,0.0021925569,0.0010975192,0.006389798],"category_scores_gemma":[0.017351713,0.00069324067,0.0011073885,0.0021133178,0.00240315,0.005206048,0.0034948026,0.0020819253,0.00085113687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001136928,0.0000935045,0.0014853018,0.0002300609,0.00010206563,0.0002577479,0.0004938971,0.1678347,0.008209985,0.7476475,0.0038067284,0.068701595],"study_design_scores_gemma":[0.00015047866,0.00022020367,0.00034166296,0.000033597502,0.00009217816,0.00015767847,0.00008944564,0.5768275,0.0047104633,0.41300932,0.0043141176,0.000053312207],"about_ca_topic_score_codex":0.0012118535,"about_ca_topic_score_gemma":0.0011666501,"teacher_disagreement_score":0.006389798,"about_ca_system_score_codex":0.0013425767,"about_ca_system_score_gemma":0.0014959552,"threshold_uncertainty_score":0.021376014},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17139949,0.0006843101,0.7465377,0.0012063395,0.0012078832,0.00037452643,0.00015479464,0.004987185,0.073447846],"genre_scores_gemma":[0.9065124,0.00043452374,0.066186845,0.00027584605,0.0002324288,0.00013744342,0.00013770163,0.00018460178,0.025898255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.0004001889,0.000042887325,0.0001291995,0.0004411315,0.00020053852],"domain_scores_gemma":[0.995884,0.001997779,0.00025131128,0.0008823803,0.00073860085,0.0002459468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013352139,0.0005109254,0.0005086632,0.0007308898,0.0010262869,0.0017764922,0.001189315,0.00084655883,0.006972992],"category_scores_gemma":[0.0054138745,0.00029333675,0.0003288544,0.0006032012,0.0005754571,0.0018993855,0.0022494413,0.00076395774,0.0017049555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001918912,0.0008531328,0.0070770574,0.00085417327,0.00014890781,0.0021219172,0.0016637759,0.09667126,0.19974318,0.2509351,0.021774314,0.41623828],"study_design_scores_gemma":[0.0001490576,0.0005563943,0.0011828741,0.000060724964,0.00020269645,0.000975698,0.0009504419,0.6434188,0.1407546,0.12775783,0.08391872,0.000072116534],"about_ca_topic_score_codex":0.00026493333,"about_ca_topic_score_gemma":0.0006666296,"teacher_disagreement_score":0.006972992,"about_ca_system_score_codex":0.00036154044,"about_ca_system_score_gemma":0.00055002543,"threshold_uncertainty_score":0.023326993},"labels":[],"label_agreement":null},{"id":"W2050846431","doi":"10.1007/s00446-012-0168-6","title":"A framework for automated distributed implementation of component-based models","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Distributed computing; Asynchronous communication; Synchronizing; Component (thermodynamics); Implementation; POSIX Threads; Scheduling (production processes); Software deployment; Partition (number theory); Correctness; Distributed algorithm; Programming language; Thread (computing); Operating system; Computer network","score_opus":0.03403358076798483,"score_gpt":0.326526578156011,"score_spread":0.29249299738802614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050846431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005344294,0.000032687138,0.99361986,0.00006162457,0.000017676624,0.000069460235,0.000049507285,0.0049844338,0.0006302029],"genre_scores_gemma":[0.0375741,0.00015148628,0.9591058,0.00007182588,0.000031187585,0.0002761983,0.0004617183,0.0010119693,0.0013156555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967591,0.0008425121,0.00035287472,0.00041191527,0.0013903009,0.00024322708],"domain_scores_gemma":[0.9952034,0.001666213,0.0002477532,0.002014395,0.0006679595,0.00020041406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045850393,0.0014282492,0.0015087998,0.0016588302,0.0016760294,0.0057440284,0.0053587575,0.0025665127,0.007311522],"category_scores_gemma":[0.0119599765,0.0017171819,0.0030143217,0.0014175909,0.0017793882,0.0058506457,0.0048761787,0.0042089815,0.0030260808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021243525,0.00033382358,0.0010664576,0.00045494942,0.0002642461,0.00062906207,0.0008456874,0.18919444,0.009255807,0.5607356,0.014949136,0.22205843],"study_design_scores_gemma":[0.00008048161,0.00003983718,0.0001119102,0.00010095435,0.00009216954,0.00015176607,0.00006854282,0.75733364,0.0058999024,0.1973237,0.038737282,0.000059848164],"about_ca_topic_score_codex":0.006819891,"about_ca_topic_score_gemma":0.007800639,"teacher_disagreement_score":0.007311522,"about_ca_system_score_codex":0.0015880746,"about_ca_system_score_gemma":0.003299807,"threshold_uncertainty_score":0.024459481},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14423795,0.0021931431,0.8353878,0.002091766,0.00018106775,0.00016134245,0.00041746246,0.0007651385,0.014564189],"genre_scores_gemma":[0.91483283,0.0014539378,0.07567897,0.00023746022,0.0002114153,0.00019246737,0.00032604512,0.0002117432,0.006855068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.0008663112,0.00009974043,0.00036979938,0.00043855226,0.0004233187],"domain_scores_gemma":[0.97687703,0.019610658,0.0011538882,0.0010182139,0.00077461597,0.0005655903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028395026,0.00089897,0.002509745,0.0013211136,0.0012688629,0.0023577095,0.002756943,0.001837487,0.0028162703],"category_scores_gemma":[0.021428615,0.0015744705,0.00062206184,0.0021045182,0.0026241827,0.0035791595,0.0022304018,0.0013757186,0.00036506742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050589617,0.000071711926,0.0004094454,0.00022635693,0.00004327124,0.000053840424,0.00016789782,0.91989905,0.0014760812,0.055408742,0.002703675,0.019034063],"study_design_scores_gemma":[0.00009989125,0.000054129672,0.00014553676,0.000013610605,0.000026842425,0.000028025359,0.000043582524,0.9472029,0.000429946,0.051366236,0.0005757125,0.0000135155615],"about_ca_topic_score_codex":0.005285484,"about_ca_topic_score_gemma":0.0072544487,"teacher_disagreement_score":0.005285484,"about_ca_system_score_codex":0.0037589585,"about_ca_system_score_gemma":0.0024044297,"threshold_uncertainty_score":0.027273238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71963626,0.002947289,0.2552141,0.0015238292,0.00011875457,0.00011715722,0.00034094206,0.0007998146,0.019301772],"genre_scores_gemma":[0.9783417,0.00031794087,0.018583791,0.000042429972,0.000032110212,0.00003708609,0.000060772276,0.00017687875,0.0024073594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850935,0.0005189377,0.00006538162,0.00018852553,0.00026516576,0.00045262554],"domain_scores_gemma":[0.98075897,0.016017718,0.0005801263,0.0011473265,0.000664905,0.00083093473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028574727,0.00063864095,0.0016684406,0.0012989474,0.001605822,0.0021471474,0.0016015291,0.001587469,0.008881876],"category_scores_gemma":[0.021567909,0.000490721,0.0005616136,0.0016551589,0.0019282722,0.004234365,0.0019461587,0.0012027032,0.0007010217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021074186,0.00021482418,0.0017847817,0.00024840745,0.00007322232,0.00011443683,0.0005799299,0.7993042,0.010066903,0.105314724,0.0034962876,0.076694824],"study_design_scores_gemma":[0.00010741483,0.00026189064,0.0006395272,0.000027528644,0.00005116947,0.000088140485,0.00037953316,0.88094956,0.003448522,0.112934224,0.0010846361,0.000027851842],"about_ca_topic_score_codex":0.002451922,"about_ca_topic_score_gemma":0.003991719,"teacher_disagreement_score":0.008881876,"about_ca_system_score_codex":0.001525065,"about_ca_system_score_gemma":0.0009370204,"threshold_uncertainty_score":0.029712796},"labels":[],"label_agreement":null},{"id":"W2058204792","doi":"10.1007/s00446-014-0227-2","title":"The complexity of automated addition of fault-tolerance without explicit legitimate states","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Set (abstract data type); Computer science; State (computer science); Fault tolerance; Fault model; Identification (biology); Polynomial; Fault (geology); Reliability engineering; Algorithm; Theoretical computer science; Distributed computing; Mathematics; Engineering; Programming language","score_opus":0.019660953845410882,"score_gpt":0.2609594278962686,"score_spread":0.2412984740508577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058204792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16260925,0.00047854247,0.80149394,0.005477383,0.00022552593,0.00027695383,0.0006008853,0.004972617,0.023864886],"genre_scores_gemma":[0.81450444,0.00035593205,0.17701395,0.0005542581,0.00021932529,0.0002748745,0.0006083063,0.0007898381,0.005679095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98871523,0.0036437232,0.00065962726,0.0018408725,0.003848612,0.0012918989],"domain_scores_gemma":[0.93633235,0.04630528,0.002339159,0.011853722,0.002478795,0.00069059606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044314903,0.0009137553,0.0019528628,0.0011605766,0.0029575767,0.006552186,0.004383036,0.00290164,0.00839123],"category_scores_gemma":[0.04300245,0.0015559307,0.0023113636,0.0019360293,0.005439541,0.017796045,0.007530373,0.005734769,0.0015440726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010505883,0.000347995,0.002894279,0.0006481932,0.00015744772,0.0007056209,0.0011217315,0.26012522,0.0054132,0.5805451,0.009173384,0.13781726],"study_design_scores_gemma":[0.00008415506,0.000035171564,0.000298683,0.000034285855,0.00007211701,0.00013868952,0.00014021812,0.37640247,0.0036026384,0.61660135,0.002545413,0.00004484137],"about_ca_topic_score_codex":0.0041079274,"about_ca_topic_score_gemma":0.0044971076,"teacher_disagreement_score":0.00839123,"about_ca_system_score_codex":0.0026910421,"about_ca_system_score_gemma":0.0036530874,"threshold_uncertainty_score":0.028071463},"labels":[],"label_agreement":null},{"id":"W2063992960","doi":"10.1007/s00446-011-0150-8","title":"RMR-efficient implementations of comparison primitives using read and write operations","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Swap (finance); Asynchronous communication; Shared memory; Reading (process); Constant (computer programming); Distributed shared memory; Cache; Implementation; Programming language; Uniform memory access; Memory management; Overlay; Computer network","score_opus":0.07288501185737015,"score_gpt":0.31795905169134403,"score_spread":0.24507403983397388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063992960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052615274,0.001535063,0.87824434,0.00047711047,0.00044909056,0.000362651,0.0005490288,0.050539583,0.015227925],"genre_scores_gemma":[0.39886826,0.0003351977,0.5772398,0.00046296074,0.00026742494,0.0005119728,0.0013421673,0.004219066,0.016753118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99369615,0.0019565823,0.0005851079,0.0008531021,0.0020714384,0.0008375931],"domain_scores_gemma":[0.9878127,0.003187015,0.0008175625,0.0064658946,0.0014112747,0.00030554127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040886793,0.0016820872,0.0018336297,0.0018967468,0.0014173168,0.0037554158,0.0059960764,0.0017129905,0.019903067],"category_scores_gemma":[0.011385434,0.0013855557,0.0010063449,0.0030017663,0.001399044,0.007983651,0.0033857857,0.0022033888,0.007874102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004019241,0.000687263,0.0017735388,0.0008883213,0.00019233495,0.00038787385,0.0005828799,0.02090024,0.09978031,0.11525752,0.04372182,0.71180856],"study_design_scores_gemma":[0.001653821,0.0010838045,0.0017310008,0.0002345636,0.00032842206,0.0010039482,0.00039230613,0.50372845,0.30969858,0.11769495,0.062047683,0.00040244826],"about_ca_topic_score_codex":0.0012429204,"about_ca_topic_score_gemma":0.0025927236,"teacher_disagreement_score":0.019903067,"about_ca_system_score_codex":0.0019484134,"about_ca_system_score_gemma":0.0023703994,"threshold_uncertainty_score":0.06658238},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22728983,0.00016069037,0.7637348,0.0019220029,0.0001027341,0.00022487994,0.00019829559,0.00045103405,0.0059157326],"genre_scores_gemma":[0.7764744,0.00017260102,0.2105197,0.00021041419,0.00014987915,0.0002264809,0.00017286063,0.00014917628,0.011924557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965035,0.0018289484,0.00012953024,0.00066516374,0.00047025445,0.00040262294],"domain_scores_gemma":[0.98506355,0.010541538,0.0012036421,0.0012611499,0.0009828745,0.0009472986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005534482,0.0006103884,0.0017813,0.0011865462,0.0034572622,0.0035872923,0.0032609259,0.0026420134,0.0023394711],"category_scores_gemma":[0.015421945,0.00071241276,0.0005936733,0.0020393566,0.0024941438,0.0052176327,0.002945661,0.0015642771,0.00050717755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015961216,0.0006090926,0.003151414,0.00020915765,0.000085509106,0.0004410718,0.0010131624,0.7109883,0.0025880868,0.21117087,0.005447079,0.06270014],"study_design_scores_gemma":[0.00007711949,0.00005819869,0.00015849477,0.0000088916795,0.00002419269,0.000035465237,0.0001501778,0.9010614,0.00093088386,0.096583694,0.00089562964,0.000015846597],"about_ca_topic_score_codex":0.004050685,"about_ca_topic_score_gemma":0.005154645,"teacher_disagreement_score":0.005534482,"about_ca_system_score_codex":0.0021655012,"about_ca_system_score_gemma":0.0018839791,"threshold_uncertainty_score":0.029269516},"labels":[],"label_agreement":null},{"id":"W2067397086","doi":"10.1007/s00446-007-0042-0","title":"Anonymous and fault-tolerant shared-memory computing","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Identifier; Asynchronous communication; Object (grammar); Distributed computing; Shared memory; Theoretical computer science; Theory of computation; Parallel computing; Programming language; Computer network; Artificial intelligence","score_opus":0.01069697413433289,"score_gpt":0.24789450467668148,"score_spread":0.2371975305423486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067397086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1335546,0.0056128087,0.8088734,0.0057258373,0.0017359413,0.000084986445,0.0001630101,0.0012467973,0.04300249],"genre_scores_gemma":[0.9396695,0.0013403441,0.03910671,0.0003474266,0.0007144848,0.00006588652,0.00008170788,0.00009122365,0.018582765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985121,0.0003495641,0.00007195456,0.00020186986,0.0006349516,0.0002296828],"domain_scores_gemma":[0.99571383,0.0019556887,0.00031351234,0.0011477552,0.0006426919,0.00022658998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011768013,0.00030224782,0.00062540214,0.000612196,0.0017390868,0.0028760047,0.0014936356,0.0013353048,0.0026660783],"category_scores_gemma":[0.007782384,0.00031844337,0.00029015366,0.0012380324,0.0021854204,0.0047902656,0.0018053073,0.0013613132,0.00052968995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023971035,0.00007149788,0.0006165053,0.000113838156,0.000024733574,0.00020560887,0.00036149667,0.039876174,0.0023708593,0.9024074,0.0059959814,0.047716223],"study_design_scores_gemma":[0.000027734846,0.000023460692,0.00016785489,0.0000123014415,0.00001907641,0.00013509222,0.00008104888,0.090050645,0.0019744027,0.8945238,0.012967419,0.00001709108],"about_ca_topic_score_codex":0.00079169334,"about_ca_topic_score_gemma":0.0009625477,"teacher_disagreement_score":0.0028760047,"about_ca_system_score_codex":0.00081497256,"about_ca_system_score_gemma":0.0009549237,"threshold_uncertainty_score":0.008918941},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037029177,0.0043401457,0.94929826,0.0011811326,0.00023705636,0.00007719439,0.00014804053,0.0006353972,0.007053666],"genre_scores_gemma":[0.8920283,0.0049806335,0.090971686,0.00031323123,0.00049482594,0.00028047705,0.00030430514,0.00020200481,0.010424505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719256,0.0010259509,0.00015251551,0.00040153085,0.0008734586,0.00035392217],"domain_scores_gemma":[0.980602,0.015347681,0.0010770457,0.0014976055,0.0010487986,0.00042679574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025693364,0.000594406,0.0017809939,0.0010619112,0.0015910335,0.002210427,0.0021255205,0.0017115794,0.0018709726],"category_scores_gemma":[0.019688586,0.0012452755,0.0005152824,0.001982166,0.002649199,0.0032940423,0.0016947897,0.0015983667,0.0004500304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036375693,0.00007463469,0.0013949948,0.0005847492,0.000070853814,0.00015910486,0.00038396948,0.5423565,0.0029528153,0.38470277,0.0055642393,0.061391704],"study_design_scores_gemma":[0.00008359343,0.00006195765,0.0003334538,0.000031179054,0.000054836608,0.00011847837,0.000063984175,0.72626215,0.0010939322,0.2663286,0.005541548,0.000026305925],"about_ca_topic_score_codex":0.003648922,"about_ca_topic_score_gemma":0.0034266082,"teacher_disagreement_score":0.003648922,"about_ca_system_score_codex":0.0024908136,"about_ca_system_score_gemma":0.0017971284,"threshold_uncertainty_score":0.018072248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1317197,0.0030899358,0.84860843,0.003873344,0.00021586248,0.00010190187,0.00019002006,0.0012188685,0.010981943],"genre_scores_gemma":[0.9084959,0.00081303983,0.087002926,0.00031583643,0.00031756493,0.00018674432,0.00018700826,0.00030197276,0.0023790288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995554,0.0048970487,0.00032757394,0.0013960749,0.0025834457,0.0008403225],"domain_scores_gemma":[0.89323896,0.08628561,0.0044104727,0.010193877,0.0042406875,0.0016303863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008003347,0.00080205564,0.0022701283,0.0022142911,0.0022304177,0.0031236827,0.0037077,0.0028410708,0.0020885766],"category_scores_gemma":[0.06333081,0.0010175132,0.0007505124,0.0025665346,0.0042826775,0.008459055,0.006230128,0.0032641788,0.00047076473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008203935,0.00024318283,0.0060192007,0.00041120904,0.00015851615,0.00019300588,0.0006716617,0.60060877,0.008165318,0.3267012,0.005622089,0.05038544],"study_design_scores_gemma":[0.000037150716,0.000069849244,0.00037273523,0.000020798861,0.000029267918,0.000065293134,0.000073829986,0.8657991,0.0017533802,0.1303283,0.0014341973,0.00001618682],"about_ca_topic_score_codex":0.0021767884,"about_ca_topic_score_gemma":0.0020833593,"teacher_disagreement_score":0.008003347,"about_ca_system_score_codex":0.0029484946,"about_ca_system_score_gemma":0.002204258,"threshold_uncertainty_score":0.042326212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22507223,0.0028756221,0.7610226,0.0020917444,0.00034021903,0.00016903419,0.0003989306,0.0011286058,0.0069010556],"genre_scores_gemma":[0.95226616,0.0010950239,0.04202182,0.00018011268,0.00022549949,0.00006883593,0.00023165997,0.00012727108,0.0037837492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970847,0.0009071984,0.00016710273,0.00041804538,0.0008166261,0.0006064222],"domain_scores_gemma":[0.98126537,0.013839799,0.0013454447,0.0015397145,0.0016085367,0.00040115553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043699644,0.0006500612,0.0023468928,0.0019941793,0.0020558634,0.003237106,0.002075409,0.0020150554,0.0013291169],"category_scores_gemma":[0.026835639,0.0015463966,0.00042991398,0.004002226,0.0022907658,0.0037554565,0.0022181473,0.0013982927,0.00035025974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012178377,0.00012456832,0.0062942277,0.00039574632,0.00012405393,0.0014220148,0.0011628226,0.82685757,0.006220646,0.066882566,0.0045567397,0.08474124],"study_design_scores_gemma":[0.000025314395,0.0000431089,0.0004695115,0.00001722345,0.000053196203,0.00023105681,0.0001830025,0.97508496,0.0015455672,0.021367714,0.00096004806,0.000019323119],"about_ca_topic_score_codex":0.010645292,"about_ca_topic_score_gemma":0.010180228,"teacher_disagreement_score":0.010645292,"about_ca_system_score_codex":0.0026681165,"about_ca_system_score_gemma":0.001479742,"threshold_uncertainty_score":0.023110807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105843395,0.00010988089,0.8894525,0.0001896353,0.000039421582,0.00013644519,0.00005610604,0.0004234236,0.003749228],"genre_scores_gemma":[0.6083172,0.00020591705,0.38223585,0.00009656754,0.000026431839,0.0003224644,0.00021510698,0.00014838652,0.008432167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937755,0.00016744739,0.000043408963,0.00015182474,0.00017851371,0.00008142512],"domain_scores_gemma":[0.9987249,0.00051859353,0.00022867577,0.00030586778,0.00011082341,0.00011108244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005985481,0.00060260936,0.0010010736,0.00070424087,0.00079834793,0.0008262084,0.0018549089,0.0009867318,0.0034409447],"category_scores_gemma":[0.0033146907,0.0008231797,0.0006281958,0.0012356626,0.0013524399,0.0019097214,0.0024557763,0.0009987102,0.000727844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043294084,0.0001382973,0.0017065317,0.00018675915,0.000059776175,0.00020240077,0.0005019716,0.78890127,0.011769792,0.07438716,0.0016882087,0.12002485],"study_design_scores_gemma":[0.00006498057,0.00019679761,0.00029257117,0.000018782615,0.000015143468,0.0001115455,0.0001559777,0.91803074,0.006363535,0.07206865,0.002662597,0.000018643399],"about_ca_topic_score_codex":0.0017325067,"about_ca_topic_score_gemma":0.0020960802,"teacher_disagreement_score":0.0034409447,"about_ca_system_score_codex":0.00062775676,"about_ca_system_score_gemma":0.00075359695,"threshold_uncertainty_score":0.011511087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12831123,0.0002204045,0.86248636,0.0004714344,0.000045263918,0.00006692681,0.00006613718,0.00017422368,0.00815806],"genre_scores_gemma":[0.9214944,0.0002843867,0.07271769,0.000059287362,0.00004560653,0.00012128603,0.000088137465,0.00003802752,0.0051511233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.00032396195,0.000022233446,0.00013139474,0.00011772679,0.00011379208],"domain_scores_gemma":[0.99803,0.0012633484,0.00029392642,0.00012340135,0.00015387438,0.00013538336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011424827,0.00043905352,0.00057289156,0.0006115921,0.0010501397,0.0010651635,0.0011559834,0.0008257456,0.0013223838],"category_scores_gemma":[0.005366917,0.0002404979,0.0003597171,0.0008263691,0.001225777,0.0015392012,0.001342255,0.0006417539,0.00023318166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121711055,0.000040844836,0.000577323,0.00004992916,0.000016504568,0.00018405041,0.00017415558,0.84961057,0.0013621311,0.13503204,0.00091961905,0.011911134],"study_design_scores_gemma":[0.000020390982,0.000020683945,0.000071385315,0.0000032125029,0.000004312687,0.000018640892,0.000046311223,0.94461936,0.00037403728,0.054169264,0.0006479604,0.0000044895937],"about_ca_topic_score_codex":0.0014970881,"about_ca_topic_score_gemma":0.0015140516,"teacher_disagreement_score":0.0014970881,"about_ca_system_score_codex":0.00076189113,"about_ca_system_score_gemma":0.0005650648,"threshold_uncertainty_score":0.006042123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24568242,0.0029426827,0.7356347,0.0017298942,0.00018708727,0.00013941104,0.00028390207,0.0007224067,0.01267751],"genre_scores_gemma":[0.9549881,0.001455084,0.037329562,0.00015648923,0.00013558366,0.00009424642,0.00016268519,0.000090003836,0.005588265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.0004917595,0.000044182194,0.000163756,0.00022768337,0.00021857145],"domain_scores_gemma":[0.9919769,0.006102434,0.0005304547,0.00046957756,0.0006816797,0.0002388318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017128631,0.00045808183,0.0014913348,0.0015179558,0.0017206651,0.002560665,0.0015295715,0.00143765,0.0015261082],"category_scores_gemma":[0.011725538,0.00082248275,0.0003900145,0.002718091,0.0016903131,0.0026540614,0.0018958759,0.00096242025,0.00031903232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060292776,0.000087749526,0.0023611698,0.0003155961,0.000060229297,0.000545219,0.00089256035,0.7654147,0.0055990918,0.16812421,0.004456605,0.051539924],"study_design_scores_gemma":[0.000023756022,0.000026515765,0.00020278998,0.000013419644,0.000023543787,0.00007370332,0.0001300718,0.9680011,0.0007508323,0.029886555,0.000856455,0.00001115246],"about_ca_topic_score_codex":0.009406949,"about_ca_topic_score_gemma":0.009061621,"teacher_disagreement_score":0.009406949,"about_ca_system_score_codex":0.0023524987,"about_ca_system_score_gemma":0.001069238,"threshold_uncertainty_score":0.018704414},"labels":[],"label_agreement":null},{"id":"W2091544818","doi":"10.1007/s00446-006-0019-4","title":"The weakest failure detector to solve nonuniform consensus","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Computer science; Theory of computation; Consensus; Distributed computing; Algorithm; Telecommunications; Artificial intelligence; Multi-agent system","score_opus":0.008785664092193463,"score_gpt":0.24358182893036828,"score_spread":0.2347961648381748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091544818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010998143,0.00025851233,0.98692894,0.00033948914,0.00015135513,0.000033558706,0.000020509373,0.00026874777,0.0010007484],"genre_scores_gemma":[0.68407357,0.00048592227,0.30914432,0.00047194495,0.00028037006,0.00030259602,0.00015593905,0.00015277832,0.0049326667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.00045383754,0.000077348894,0.0002129844,0.0003441847,0.000116373296],"domain_scores_gemma":[0.99486274,0.0030129415,0.00026428705,0.00068225403,0.0009645081,0.00021332766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003421135,0.0006374439,0.0016003774,0.00082464237,0.00086088426,0.0009946086,0.0017550228,0.0011310752,0.0015416567],"category_scores_gemma":[0.014687808,0.00043370758,0.0004896116,0.00083942356,0.0015198643,0.0023840044,0.0024807104,0.0023447983,0.0002854137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007464558,0.00011702362,0.0012421291,0.00032050116,0.00016780772,0.000092805065,0.0002907579,0.532174,0.0067688134,0.20275612,0.008488501,0.24683507],"study_design_scores_gemma":[0.000050469345,0.000056612487,0.00006116408,0.0000070620486,0.000017284929,0.000019541405,0.000011967417,0.9506096,0.0013141851,0.046971586,0.0008719727,0.000008561508],"about_ca_topic_score_codex":0.0012439911,"about_ca_topic_score_gemma":0.0013048465,"teacher_disagreement_score":0.003421135,"about_ca_system_score_codex":0.0008327136,"about_ca_system_score_gemma":0.0018698117,"threshold_uncertainty_score":0.01809287},"labels":[],"label_agreement":null},{"id":"W2093197865","doi":"10.1007/s00446-005-0145-4","title":"Relationships between broadcast and shared memory in reliable anonymous distributed systems","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; Atomic broadcast; Shared memory; Identifier; Robustness (evolution); Distributed computing; Distributed shared memory; Computer network; Broadcasting (networking); Parallel computing; Memory management; Operating system; Uniform memory access","score_opus":0.025746112959283897,"score_gpt":0.24509743549439192,"score_spread":0.21935132253510803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093197865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25630552,0.012105981,0.66176677,0.009982339,0.0005374189,0.0001644634,0.00040889744,0.0007699408,0.057958674],"genre_scores_gemma":[0.96115524,0.00216449,0.027500438,0.00031278547,0.00060688006,0.00014778167,0.00015258098,0.00015720958,0.0078025786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589705,0.002116637,0.00020881117,0.00046133803,0.0009607723,0.00035539558],"domain_scores_gemma":[0.91996086,0.066146,0.0049328757,0.0041556596,0.0036320267,0.0011725719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005400278,0.00043091862,0.0010641341,0.001873984,0.0029486502,0.0061425497,0.002115626,0.002498858,0.006443531],"category_scores_gemma":[0.061281517,0.001075285,0.00044706822,0.0028292546,0.004918782,0.015560905,0.0030340985,0.0031306795,0.00066920824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040807796,0.0000685193,0.0013149873,0.00014476472,0.000027398664,0.00013336378,0.001302774,0.01525289,0.0005171849,0.9557678,0.002746441,0.022315718],"study_design_scores_gemma":[0.00008149913,0.00006106739,0.0004607906,0.000041559284,0.000073739,0.00017192034,0.00040211435,0.058225825,0.00077808637,0.93353724,0.0061364695,0.000029610239],"about_ca_topic_score_codex":0.0021037334,"about_ca_topic_score_gemma":0.00165786,"teacher_disagreement_score":0.006443531,"about_ca_system_score_codex":0.0019619975,"about_ca_system_score_gemma":0.0015481676,"threshold_uncertainty_score":0.028559804},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1158875,0.00077403325,0.87533534,0.00056019094,0.00014058924,0.000056861674,0.000051124014,0.0003699601,0.006824409],"genre_scores_gemma":[0.85670054,0.00058491935,0.13468507,0.00013339912,0.00010908964,0.00007864359,0.00010355986,0.00016756335,0.007437288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997482,0.00006358919,0.000010554545,0.000067400986,0.000068095345,0.000042149306],"domain_scores_gemma":[0.9992908,0.00038490884,0.000067787965,0.00008529918,0.00006629784,0.00010484107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264209,0.0006475769,0.0009599339,0.0003884214,0.0013064196,0.0009710107,0.0012579832,0.0014958419,0.0021064528],"category_scores_gemma":[0.002857773,0.00046425135,0.0005523699,0.00059598644,0.0011166955,0.002549549,0.002736126,0.0011861699,0.00041377853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005542605,0.00025495337,0.0011523431,0.00026548805,0.00006698508,0.000462468,0.0008112345,0.76184857,0.012109291,0.04209102,0.00607003,0.17431335],"study_design_scores_gemma":[0.00001533483,0.00009258155,0.00017838243,0.000008438336,0.000014089219,0.00009603282,0.00011315485,0.9614931,0.00095866265,0.036055475,0.0009626026,0.000012223416],"about_ca_topic_score_codex":0.0019941574,"about_ca_topic_score_gemma":0.0019310225,"teacher_disagreement_score":0.0021064528,"about_ca_system_score_codex":0.00032503338,"about_ca_system_score_gemma":0.0004888489,"threshold_uncertainty_score":0.0070468187},"labels":[],"label_agreement":null},{"id":"W2120152386","doi":"10.1007/pl00008920","title":"On the power of shared object types to implement one-resilient Consensus","year":2000,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Object (grammar); Computer science; Asynchronous communication; Set (abstract data type); Process (computing); Power (physics); Consensus; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language; Artificial intelligence; Computer network; Multi-agent system; Physics","score_opus":0.0179501018062648,"score_gpt":0.26072369786078337,"score_spread":0.24277359605451856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120152386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086756974,0.0009371929,0.8853475,0.0025182047,0.00055789953,0.000110524765,0.00007305059,0.0012937912,0.022404945],"genre_scores_gemma":[0.8260117,0.0007793445,0.16219294,0.0008576192,0.00035772988,0.00020798692,0.0001212831,0.00055509893,0.008916302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670523,0.0011121058,0.00028703833,0.00036097475,0.0010452035,0.00048935664],"domain_scores_gemma":[0.96604776,0.021832671,0.0010328356,0.008399566,0.0020144426,0.00067268487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069093886,0.00059459044,0.0010885389,0.0015046276,0.0022896044,0.003148955,0.0029591236,0.00196808,0.0039587375],"category_scores_gemma":[0.026016813,0.00089762366,0.0009435914,0.0016133416,0.007945944,0.011613859,0.0043422296,0.004199585,0.0008031276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065204274,0.00008750942,0.00085180555,0.00013817224,0.000041825497,0.00013469964,0.0006132868,0.06964306,0.0031418107,0.8624266,0.0039328462,0.05833636],"study_design_scores_gemma":[0.00012574783,0.00010063656,0.00016275245,0.0000396813,0.0000562511,0.000084946594,0.000096557385,0.23579475,0.0035540557,0.7554674,0.0044611376,0.000056181838],"about_ca_topic_score_codex":0.0020685783,"about_ca_topic_score_gemma":0.002062828,"teacher_disagreement_score":0.0069093886,"about_ca_system_score_codex":0.0016377416,"about_ca_system_score_gemma":0.0011175026,"threshold_uncertainty_score":0.036540747},"labels":[],"label_agreement":null},{"id":"W2123429492","doi":"10.1007/s00446-007-0040-2","title":"The computational power of population protocols","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":272,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multiset; Communication source; Theory of computation; Theoretical computer science; Population; Predicate (mathematical logic); Computation; State (computer science); Computer network; Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.013018712825994727,"score_gpt":0.2926498428743762,"score_spread":0.27963113004838147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123429492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077857986,0.0044681905,0.7676588,0.020066613,0.0012120459,0.00011584536,0.000355436,0.0008777197,0.1273873],"genre_scores_gemma":[0.903626,0.0028676256,0.07248335,0.0012855141,0.0012467586,0.00027428937,0.00022139354,0.00033607314,0.017658934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960453,0.0019803972,0.00011269331,0.00051290414,0.0010025947,0.00034602915],"domain_scores_gemma":[0.95965576,0.030852605,0.0009587056,0.0064580236,0.0013220476,0.00075293885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049766535,0.0005705881,0.0012507115,0.0011056677,0.0022319632,0.0046269787,0.0026540037,0.0025292535,0.011546018],"category_scores_gemma":[0.045298934,0.00086082483,0.0008815113,0.0018015752,0.0060894554,0.012024593,0.0037457482,0.004494414,0.0018427435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108400585,0.00003625318,0.0005265009,0.00008318244,0.000030541836,0.000049277856,0.00021794767,0.047980785,0.00073361746,0.9195455,0.0044139945,0.02627392],"study_design_scores_gemma":[0.0000511738,0.000019704605,0.00017298802,0.00002107373,0.00001761384,0.00005339971,0.000053711934,0.16592112,0.0005349307,0.82641906,0.006718992,0.000016211905],"about_ca_topic_score_codex":0.0018589215,"about_ca_topic_score_gemma":0.0011229267,"teacher_disagreement_score":0.011546018,"about_ca_system_score_codex":0.0017784169,"about_ca_system_score_gemma":0.002039216,"threshold_uncertainty_score":0.0386253},"labels":[],"label_agreement":null},{"id":"W2133718851","doi":"10.1007/s00446-008-0068-y","title":"On implementing omega in systems with weak reliability and synchrony assumptions","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lossy compression; Reliability (semiconductor); Computer science; Process (computing); Crash; Core (optical fiber); Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications","score_opus":0.013368036344676518,"score_gpt":0.23973823846434802,"score_spread":0.22637020211967152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133718851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06934384,0.00025474167,0.9173099,0.001676543,0.00013539514,0.00010376157,0.000039129623,0.0012986925,0.009838074],"genre_scores_gemma":[0.7560529,0.00061334175,0.23120056,0.0007152128,0.00018237969,0.0003508464,0.0001571775,0.0005594593,0.010168041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955124,0.0016651235,0.00033626202,0.00038314296,0.0012757208,0.00082730985],"domain_scores_gemma":[0.9703481,0.01958378,0.0010857783,0.0064794053,0.0019326183,0.00057044596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0090055475,0.0010499951,0.0014180737,0.00086195377,0.0017740137,0.00268388,0.0023156803,0.0018272758,0.00432013],"category_scores_gemma":[0.03291757,0.00084850146,0.0009474163,0.0010856749,0.0039060884,0.012727991,0.006934017,0.004710176,0.00089487346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673422,0.00021559336,0.0027657894,0.00025801695,0.00006202164,0.00022036699,0.0012921238,0.103094496,0.006328263,0.763335,0.0041117766,0.117049225],"study_design_scores_gemma":[0.000121985315,0.00022328652,0.00023422287,0.000055591758,0.000065441716,0.0000837117,0.00031357774,0.36051816,0.007744813,0.6262851,0.004319922,0.000034189758],"about_ca_topic_score_codex":0.0017898773,"about_ca_topic_score_gemma":0.001594656,"teacher_disagreement_score":0.0090055475,"about_ca_system_score_codex":0.0013407149,"about_ca_system_score_gemma":0.00193694,"threshold_uncertainty_score":0.047626436},"labels":[],"label_agreement":null},{"id":"W2134091651","doi":"10.1007/s00446-008-0060-6","title":"The space complexity of unbounded timestamps","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"European Commission; University of Toronto; York University","keywords":"Timestamp; Computer science; Asynchronous communication; Upper and lower bounds; Identifier; Time complexity; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Mathematics; Programming language; Real-time computing; Computer network","score_opus":0.03477025260088355,"score_gpt":0.24936744135896993,"score_spread":0.21459718875808637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134091651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36202842,0.0078014806,0.5494653,0.030398233,0.00085895415,0.00013230644,0.0025374964,0.0014424903,0.04533524],"genre_scores_gemma":[0.952192,0.0028248143,0.034350518,0.0007305803,0.0011478809,0.00015625305,0.0007243268,0.00040054857,0.007472984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99075353,0.0028380079,0.00058993394,0.0010552556,0.003502332,0.0012609441],"domain_scores_gemma":[0.8841103,0.093969114,0.005051635,0.011365035,0.0032054123,0.0022984785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006636223,0.00096527155,0.002717498,0.0025040254,0.0029810993,0.009302873,0.0035411455,0.0033634382,0.008728581],"category_scores_gemma":[0.06823652,0.0014731832,0.0017090566,0.005500683,0.0066765705,0.03604212,0.0057966895,0.0068980022,0.0011131088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005676594,0.000067203786,0.0015483429,0.000197593,0.000048960246,0.0001842553,0.0005070518,0.07796781,0.0011124077,0.8905435,0.0070422464,0.020213023],"study_design_scores_gemma":[0.000048785223,0.000019382282,0.00018679613,0.000023149114,0.000025165054,0.00008798986,0.00007883908,0.10290884,0.00045619163,0.8947146,0.0014286068,0.000021633823],"about_ca_topic_score_codex":0.0026919034,"about_ca_topic_score_gemma":0.0016216155,"teacher_disagreement_score":0.009302873,"about_ca_system_score_codex":0.0040093297,"about_ca_system_score_gemma":0.003349597,"threshold_uncertainty_score":0.03509611},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16017738,0.005215833,0.71641463,0.02019079,0.0017375137,0.0009869483,0.005569235,0.010768691,0.07893889],"genre_scores_gemma":[0.6988838,0.0017878022,0.2550275,0.0040578526,0.0012737501,0.001154167,0.004553766,0.0020592497,0.031202171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883939,0.0023162155,0.000537881,0.0026176667,0.0035349978,0.0025993327],"domain_scores_gemma":[0.97225934,0.0126471,0.0011383367,0.010944323,0.0011754719,0.0018353313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047222064,0.0026743512,0.0040664608,0.0019662955,0.0039219703,0.009852861,0.010228578,0.0052254545,0.028607542],"category_scores_gemma":[0.023316307,0.0012371441,0.0030517292,0.0062524453,0.0037727833,0.025136251,0.008260536,0.0099137025,0.006274087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0140326265,0.0024803705,0.0045341924,0.002045294,0.00060506654,0.00027218388,0.0011752268,0.18004516,0.023772167,0.33263117,0.08800895,0.35039768],"study_design_scores_gemma":[0.0011194268,0.0003179983,0.0009809621,0.00015248911,0.00042782538,0.00037064168,0.00038160835,0.4792551,0.008992788,0.4921661,0.015736286,0.000098823686],"about_ca_topic_score_codex":0.005837771,"about_ca_topic_score_gemma":0.01195316,"teacher_disagreement_score":0.028607542,"about_ca_system_score_codex":0.012830699,"about_ca_system_score_gemma":0.010623258,"threshold_uncertainty_score":0.095701754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45694467,0.0006691459,0.53090304,0.0005569758,0.00032459063,0.00009834593,0.000111567504,0.00095566537,0.009435943],"genre_scores_gemma":[0.9358534,0.00043717417,0.057496928,0.00007029768,0.00010023057,0.000083085746,0.0001045268,0.000083311155,0.0057711042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917895,0.00031079253,0.000044465996,0.00009161917,0.00026509038,0.00010907525],"domain_scores_gemma":[0.9968252,0.0013385506,0.0002845459,0.00077062286,0.0006001067,0.000180965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011005135,0.0003647046,0.0005988143,0.0006987566,0.0014037777,0.0018081167,0.0012574274,0.0007113859,0.0013505844],"category_scores_gemma":[0.0052442667,0.00038634564,0.00033250058,0.0011404831,0.0013684859,0.0025306635,0.0016966413,0.0006466361,0.0003261667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012154935,0.00014242885,0.0031248135,0.00024387149,0.00007719986,0.00094615534,0.0007503097,0.6006825,0.017490223,0.3282957,0.0033629132,0.043668445],"study_design_scores_gemma":[0.00009125821,0.00012002567,0.0004379152,0.000015092161,0.000046059995,0.0001508385,0.00016617321,0.8254982,0.011097412,0.15808703,0.004266969,0.000022969909],"about_ca_topic_score_codex":0.0012022149,"about_ca_topic_score_gemma":0.0012520916,"teacher_disagreement_score":0.0018081167,"about_ca_system_score_codex":0.0009862971,"about_ca_system_score_gemma":0.00072791375,"threshold_uncertainty_score":0.007156074},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6943711,0.0017327195,0.28771076,0.0023173385,0.00023877893,0.00008695403,0.0001818812,0.00040321032,0.012957204],"genre_scores_gemma":[0.9901163,0.00027510335,0.006629485,0.00004571904,0.000039216036,0.000026604504,0.000045508237,0.00005666412,0.0027653114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00017125302,0.000030457104,0.00011793891,0.00010110117,0.00017627918],"domain_scores_gemma":[0.9947018,0.003676208,0.0006188253,0.0002697111,0.0003469857,0.00038645093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014125232,0.000650195,0.0013746278,0.0011785524,0.0013962461,0.0016517617,0.0013637202,0.0013162225,0.0019904352],"category_scores_gemma":[0.008680195,0.00049445545,0.0004229943,0.0013451017,0.001817605,0.0026217739,0.0015321589,0.000915244,0.00024257165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006980222,0.000039265302,0.0009998039,0.000095308875,0.000054610427,0.00028380667,0.0001736105,0.9290594,0.0032100158,0.053684335,0.0011889043,0.010512858],"study_design_scores_gemma":[0.00004864267,0.000051877916,0.00022894195,0.000007985069,0.00002085042,0.000061550934,0.00013132657,0.9608059,0.0012686126,0.036858514,0.0005059885,0.000009786795],"about_ca_topic_score_codex":0.005702813,"about_ca_topic_score_gemma":0.0036008921,"teacher_disagreement_score":0.005702813,"about_ca_system_score_codex":0.0016149568,"about_ca_system_score_gemma":0.00084399513,"threshold_uncertainty_score":0.011717379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009968507,0.000024691684,0.9977968,0.00007448255,0.00005808335,0.000027064929,0.000009959309,0.0001334424,0.00087860716],"genre_scores_gemma":[0.24063055,0.00029182938,0.7495772,0.00032276948,0.00031098217,0.00034206963,0.000083178435,0.00028209685,0.008159252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913317,0.00030012187,0.00004894769,0.00015462776,0.0003067715,0.000056344572],"domain_scores_gemma":[0.99870574,0.0005461709,0.000083545936,0.00037624442,0.0002006961,0.00008751866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015620668,0.0009491131,0.0012898484,0.0005322577,0.0006940217,0.0014523129,0.002012355,0.0014283131,0.0053006555],"category_scores_gemma":[0.005861675,0.00056122645,0.0008980275,0.00080677326,0.0010867334,0.0019254531,0.0022923793,0.003626236,0.0011354046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010896668,0.00025390976,0.00047719106,0.00016616512,0.00011169169,0.00019852685,0.00012217744,0.6158862,0.011405663,0.25213265,0.004705352,0.114431426],"study_design_scores_gemma":[0.000012765355,0.000017110693,0.000055212666,0.000004408216,0.000009595557,0.000032187178,0.0000052969262,0.95957464,0.00054684083,0.03823355,0.0014995355,0.000008854639],"about_ca_topic_score_codex":0.001585722,"about_ca_topic_score_gemma":0.0021281708,"teacher_disagreement_score":0.0053006555,"about_ca_system_score_codex":0.00062815513,"about_ca_system_score_gemma":0.0011117274,"threshold_uncertainty_score":0.017732382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06454403,0.0010431967,0.9246077,0.0024064493,0.00016460306,0.000094173476,0.00007102935,0.000514693,0.006554221],"genre_scores_gemma":[0.9157827,0.00068695744,0.07572972,0.000151495,0.00018611933,0.00015884188,0.00009696493,0.00009701932,0.007110169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960479,0.0017149778,0.00022295746,0.00041203728,0.0012700178,0.00033209097],"domain_scores_gemma":[0.9869039,0.008218803,0.0006475733,0.0034061852,0.0005034608,0.0003201767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004331241,0.00051433506,0.0011192823,0.00070856785,0.0016739347,0.002925932,0.0012388958,0.0014342279,0.0026960892],"category_scores_gemma":[0.013306848,0.0006061664,0.00048120136,0.0012421411,0.002649223,0.006094757,0.003820467,0.0028327478,0.0007258049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085954997,0.00016413732,0.0013203598,0.00027408358,0.00007855255,0.00036528482,0.00035539886,0.30869326,0.0106921205,0.5884505,0.004713621,0.0840332],"study_design_scores_gemma":[0.00005248529,0.000030179317,0.00015917623,0.000014317652,0.000013892676,0.000074058844,0.000036044556,0.66048086,0.0035049245,0.33299592,0.0026280342,0.0000100963],"about_ca_topic_score_codex":0.00041415522,"about_ca_topic_score_gemma":0.00060113793,"teacher_disagreement_score":0.004331241,"about_ca_system_score_codex":0.0014480402,"about_ca_system_score_gemma":0.0011808043,"threshold_uncertainty_score":0.022906065},"labels":[],"label_agreement":null},{"id":"W2406835255","doi":"10.1007/s00446-018-0331-9","title":"On the optimal space complexity of consensus for anonymous processes","year":2018,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy","keywords":"Space (punctuation); Computer science; Psychology","score_opus":0.043456980142650946,"score_gpt":0.27990980350561945,"score_spread":0.2364528233629685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406835255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3790558,0.0038016527,0.5621186,0.014964501,0.000653491,0.00027989302,0.0010272262,0.00095047936,0.037148308],"genre_scores_gemma":[0.94856197,0.0011852371,0.04138478,0.00064857095,0.00062230777,0.00028398336,0.0004131169,0.000433033,0.006467007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931886,0.0029809123,0.00025476667,0.00078012666,0.001616843,0.0011787922],"domain_scores_gemma":[0.90825653,0.08062414,0.0026688636,0.0039996435,0.0022590358,0.0021918663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066253557,0.0015361294,0.003019097,0.002113162,0.0023370152,0.005155601,0.0035839295,0.003652348,0.010378534],"category_scores_gemma":[0.06055605,0.0010570745,0.0013768413,0.0025744166,0.0049723675,0.0133967195,0.006020017,0.005697308,0.0007843381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017776558,0.00033517618,0.0019125392,0.00041614866,0.00013140247,0.00014860953,0.0007441333,0.5359023,0.0033787393,0.41551232,0.008829894,0.030911066],"study_design_scores_gemma":[0.00011848137,0.00011447011,0.00033628152,0.000028427556,0.00003850961,0.00003809204,0.0001546316,0.63216174,0.0006130379,0.36569986,0.0006670602,0.000029427527],"about_ca_topic_score_codex":0.004022144,"about_ca_topic_score_gemma":0.0040675425,"teacher_disagreement_score":0.010378534,"about_ca_system_score_codex":0.0049962075,"about_ca_system_score_gemma":0.0049723936,"threshold_uncertainty_score":0.036250234},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5569002,0.0046050004,0.39255688,0.0043338845,0.00022352657,0.0002779142,0.0005798864,0.00074395037,0.03977875],"genre_scores_gemma":[0.9692532,0.0006921851,0.025102047,0.000095465206,0.000069436464,0.00008858152,0.00008732137,0.00018036847,0.004431387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975025,0.0010265359,0.00008914774,0.00027865302,0.00053389906,0.00056926697],"domain_scores_gemma":[0.9684124,0.028154077,0.0008288804,0.0011172255,0.00073653844,0.00075084047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052550193,0.0010606399,0.0017809549,0.0015250434,0.0014320387,0.0026614,0.0019900477,0.0021669338,0.0075133466],"category_scores_gemma":[0.032395903,0.0008982265,0.000653358,0.001830535,0.0023143564,0.004598316,0.002213795,0.001470198,0.00050891296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013082961,0.000103824226,0.00054260367,0.00019230925,0.0000388788,0.00005493393,0.00019385434,0.9012066,0.002460046,0.06903172,0.0018437161,0.023023136],"study_design_scores_gemma":[0.00009167186,0.00013005923,0.00031958462,0.00002456058,0.000030777734,0.000042678806,0.00013875624,0.9494182,0.0011459985,0.048008587,0.0006294345,0.000019754865],"about_ca_topic_score_codex":0.004242463,"about_ca_topic_score_gemma":0.004186494,"teacher_disagreement_score":0.0075133466,"about_ca_system_score_codex":0.0033115665,"about_ca_system_score_gemma":0.0018633177,"threshold_uncertainty_score":0.0277915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04335401,0.0015119744,0.9032078,0.008407327,0.0012070058,0.00077678135,0.0016654765,0.002039048,0.03783075],"genre_scores_gemma":[0.73156315,0.0008711798,0.2175908,0.0024969766,0.0017784748,0.0012467476,0.0024513877,0.0005984562,0.041402806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876695,0.0054455665,0.00041420475,0.003123315,0.0018225983,0.0015248099],"domain_scores_gemma":[0.9682064,0.021039262,0.001063762,0.0064442186,0.0018526058,0.0013936885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069299205,0.0015878214,0.0036495102,0.0013573453,0.0025299005,0.0045965575,0.004717937,0.0031240894,0.027447924],"category_scores_gemma":[0.031000044,0.0010335146,0.001633107,0.003039888,0.0032903966,0.007898296,0.0050186208,0.0050140982,0.0035770938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030396981,0.0012772533,0.0015984649,0.0005762052,0.00022237602,0.00016381053,0.0001974523,0.17914388,0.0018350353,0.5845543,0.083568364,0.14382315],"study_design_scores_gemma":[0.0004885283,0.00013751478,0.0002391638,0.000036165784,0.000056267207,0.00007371391,0.0000473354,0.59041876,0.0009524744,0.40185127,0.005668465,0.000030247109],"about_ca_topic_score_codex":0.0021748357,"about_ca_topic_score_gemma":0.0036470732,"teacher_disagreement_score":0.027447924,"about_ca_system_score_codex":0.004760454,"about_ca_system_score_gemma":0.007504612,"threshold_uncertainty_score":0.091822386},"labels":[],"label_agreement":null},{"id":"W2611856048","doi":"10.1007/s00446-013-0190-3","title":"Byzantine agreement with homonyms","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Identifier; Impossibility; Computer science; Byzantine architecture; Agreement; Process (computing); Unique identifier; Theoretical computer science; Distributed computing; Computer network; Programming language; Political science; Geography","score_opus":0.006880588067287215,"score_gpt":0.20448400230934033,"score_spread":0.1976034142420531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611856048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028045367,0.00054973963,0.9160599,0.0023662539,0.0009790169,0.00022048435,0.00024659894,0.0016577309,0.04987488],"genre_scores_gemma":[0.7429169,0.0007265901,0.21448733,0.0010669798,0.0007904036,0.000563533,0.0004734466,0.00094679167,0.038028006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918767,0.0036173838,0.0004972022,0.0011646212,0.002027472,0.00081655197],"domain_scores_gemma":[0.98885286,0.0038828682,0.0005253913,0.0053125788,0.0011178997,0.00030843305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005082103,0.00064764323,0.0017397469,0.0010440835,0.0038412025,0.005487614,0.0016152483,0.0028158005,0.009958551],"category_scores_gemma":[0.013467846,0.0006376198,0.0007554621,0.0016928898,0.0043472624,0.012679231,0.00676069,0.004428754,0.0037121258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018967902,0.00002646238,0.000081288934,0.00006490147,0.000009869775,0.00007512758,0.000321854,0.0017414445,0.0015944192,0.9773605,0.0028552224,0.01567915],"study_design_scores_gemma":[0.000059762664,0.000036931207,0.000033579494,0.00003331103,0.000017513079,0.00010525008,0.00007952972,0.015420149,0.0049504945,0.95505595,0.024183799,0.000023834535],"about_ca_topic_score_codex":0.00033406162,"about_ca_topic_score_gemma":0.0003241483,"teacher_disagreement_score":0.009958551,"about_ca_system_score_codex":0.0012260339,"about_ca_system_score_gemma":0.0017599871,"threshold_uncertainty_score":0.033314705},"labels":[],"label_agreement":null},{"id":"W2645852407","doi":"10.1007/s00446-017-0305-3","title":"Inherent limitations of hybrid transactional memory","year":2017,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"U.S. Department of Energy; Agence Nationale de la Recherche; National Science Foundation","keywords":"Transactional memory; Computer science; Instrumentation (computer programming); Software transactional memory; Concurrency; Overhead (engineering); Database transaction; Software; Operating system; Distributed computing; Embedded system; Parallel computing; Programming language","score_opus":0.058459097462485156,"score_gpt":0.27225957813678897,"score_spread":0.21380048067430382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2645852407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38537452,0.027324956,0.49094108,0.011305375,0.0018464471,0.00016517132,0.00057721365,0.0031361412,0.0793291],"genre_scores_gemma":[0.95575434,0.0021445404,0.03585035,0.0004808935,0.00047520845,0.00013593465,0.00014555259,0.0001792039,0.00483402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971655,0.0007106781,0.00016026401,0.00031152755,0.0014100396,0.00024198198],"domain_scores_gemma":[0.98147005,0.010422555,0.0005164348,0.005146555,0.0020896143,0.00035470884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003974942,0.00037381914,0.00091055,0.0007252148,0.0008656724,0.003408688,0.004453442,0.0015889617,0.0074009052],"category_scores_gemma":[0.017256996,0.00062438013,0.00031281466,0.001399871,0.0019683861,0.008172616,0.0021797067,0.0017790571,0.0015502815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017525998,0.00033493162,0.006293323,0.0017154207,0.00025442193,0.0005167584,0.001001749,0.077203386,0.034435067,0.5142206,0.018453015,0.3438187],"study_design_scores_gemma":[0.00020650226,0.0004602978,0.0017978626,0.00021034814,0.0002324151,0.0015329176,0.0005852485,0.41861102,0.03029726,0.5109716,0.03496682,0.00012759525],"about_ca_topic_score_codex":0.00052771176,"about_ca_topic_score_gemma":0.0006269795,"teacher_disagreement_score":0.0074009052,"about_ca_system_score_codex":0.000753009,"about_ca_system_score_gemma":0.0008245474,"threshold_uncertainty_score":0.024758458},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09794622,0.0037165058,0.88038987,0.0014100347,0.0002702641,0.00011964703,0.00034193302,0.0006799547,0.015125589],"genre_scores_gemma":[0.86625904,0.00754515,0.1019293,0.00039416505,0.00069236034,0.0002718143,0.00085721933,0.00028269197,0.02176819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989497,0.00038852493,0.000061744846,0.0001898405,0.00027264963,0.00013757359],"domain_scores_gemma":[0.98916197,0.008448905,0.00087514403,0.00043043573,0.0007041939,0.0003793049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212642,0.0005240059,0.0012476192,0.0014339841,0.0011987402,0.0020024143,0.001707054,0.0013519003,0.002136397],"category_scores_gemma":[0.009951831,0.00076204404,0.00045968787,0.002447343,0.0015263101,0.0025561384,0.001045862,0.0012435414,0.0005169011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026993098,0.00012583724,0.002050736,0.0008489103,0.00009992611,0.000595022,0.0007934227,0.41008613,0.006782664,0.47291335,0.009070623,0.09636345],"study_design_scores_gemma":[0.000074074014,0.000051481762,0.00055578805,0.000043928605,0.00008612032,0.00024205372,0.0001411788,0.61890936,0.0012159253,0.37103796,0.0076115374,0.000030620176],"about_ca_topic_score_codex":0.004331235,"about_ca_topic_score_gemma":0.0036493526,"teacher_disagreement_score":0.004331235,"about_ca_system_score_codex":0.0012129488,"about_ca_system_score_gemma":0.00077404187,"threshold_uncertainty_score":0.008800626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22431105,0.0012742716,0.7517684,0.004519503,0.00016090253,0.00011412974,0.0006796536,0.0005685834,0.016603433],"genre_scores_gemma":[0.94646114,0.0006395985,0.044786826,0.00027508737,0.00023118376,0.00012375036,0.00022911183,0.00016713126,0.0070862323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801993,0.0008896042,0.00007771355,0.0003320333,0.0003359187,0.00034492696],"domain_scores_gemma":[0.988848,0.008162046,0.0008895294,0.001013032,0.0004838345,0.0006037041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028625436,0.0005893377,0.0016107666,0.00084673427,0.0015784866,0.002581885,0.0021626388,0.0017716711,0.0041754716],"category_scores_gemma":[0.013642411,0.00066700263,0.0007399223,0.0014821776,0.0020151273,0.006312758,0.0023029558,0.0021842935,0.0004492771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007272472,0.00013507383,0.00078025216,0.00018250025,0.000056104214,0.00021498474,0.00039589213,0.38653228,0.002619545,0.58763427,0.007347795,0.013374176],"study_design_scores_gemma":[0.00005657605,0.000034462162,0.00014865941,0.000009798645,0.00002325373,0.000060562514,0.00006595401,0.75339955,0.00038469216,0.24488194,0.000920387,0.000014113897],"about_ca_topic_score_codex":0.0034073163,"about_ca_topic_score_gemma":0.0034829692,"teacher_disagreement_score":0.0041754716,"about_ca_system_score_codex":0.002313335,"about_ca_system_score_gemma":0.001624032,"threshold_uncertainty_score":0.01678449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25110447,0.0010530225,0.7323618,0.00072785286,0.00009891801,0.00007095971,0.000075593794,0.0003415589,0.014165806],"genre_scores_gemma":[0.9476522,0.00027889138,0.04452195,0.000052954445,0.00003857544,0.00007601842,0.000051026036,0.00006355994,0.007264754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941623,0.00024452267,0.000017500253,0.00010421491,0.00010417725,0.000113434915],"domain_scores_gemma":[0.9976428,0.0015458114,0.00015295764,0.00029690945,0.00016878055,0.00019274275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012468303,0.00035919173,0.00116003,0.0005973892,0.0008981883,0.0013826533,0.0011511319,0.00082831987,0.00356863],"category_scores_gemma":[0.0054911203,0.00044843825,0.0005948634,0.0006931551,0.0012615775,0.0022581406,0.0024477795,0.0009025898,0.00025054338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051396526,0.00010031676,0.0009190438,0.00010393133,0.000057475914,0.00012296083,0.00018541672,0.79721355,0.0032912386,0.16500929,0.0015905001,0.0308923],"study_design_scores_gemma":[0.000031456955,0.00003918796,0.000078920944,0.00000539029,0.00000871827,0.00002794645,0.000030194788,0.9472394,0.00042811112,0.05131426,0.0007910903,0.0000052841324],"about_ca_topic_score_codex":0.0009925124,"about_ca_topic_score_gemma":0.0010286097,"teacher_disagreement_score":0.00356863,"about_ca_system_score_codex":0.0007070033,"about_ca_system_score_gemma":0.0008804943,"threshold_uncertainty_score":0.011938214},"labels":[],"label_agreement":null},{"id":"W2946052740","doi":"10.1007/s00446-019-00354-2","title":"The complexity of leader election in diameter-two networks","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Computing and Communication Foundations; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Upper and lower bounds; Combinatorics; Constant (computer programming); Randomized algorithm; Monte Carlo method; Monte Carlo algorithm; Theory of computation; Mathematics; Discrete mathematics; Deterministic algorithm; Binary logarithm; Communication complexity; Computer science; Algorithm; Theoretical computer science; Statistics","score_opus":0.021335128452466,"score_gpt":0.25505197559873033,"score_spread":0.23371684714626434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946052740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4379986,0.0023688741,0.49320945,0.017636253,0.0005840206,0.00032280886,0.0012905275,0.0009794493,0.04561004],"genre_scores_gemma":[0.9614315,0.00090026757,0.03024424,0.00040769338,0.0002849874,0.00020820479,0.0004103261,0.0001737812,0.005938951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545825,0.0017225161,0.00021550691,0.0006794198,0.0012390502,0.0006853493],"domain_scores_gemma":[0.93717235,0.054085016,0.0025503703,0.0031385366,0.0013891509,0.0016646266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017615,0.00058751134,0.0018907235,0.0010373875,0.0023065237,0.0050340546,0.002974249,0.0029061865,0.0061129523],"category_scores_gemma":[0.041818973,0.0010880247,0.0009495124,0.0018395572,0.0028193896,0.009181184,0.0035359669,0.0030864389,0.0006960741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012461878,0.00018467807,0.0041906754,0.00037071918,0.00012163432,0.00042892483,0.00076639553,0.5454755,0.0035587088,0.39682168,0.013091053,0.033743925],"study_design_scores_gemma":[0.00012828891,0.000049421822,0.0007549059,0.000021795526,0.000040574036,0.00013194016,0.00018334367,0.7036515,0.0007807176,0.29271302,0.0015180509,0.000026486108],"about_ca_topic_score_codex":0.0029827892,"about_ca_topic_score_gemma":0.0029410196,"teacher_disagreement_score":0.0061129523,"about_ca_system_score_codex":0.0034463939,"about_ca_system_score_gemma":0.0023862375,"threshold_uncertainty_score":0.02500552},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060283635,0.007999639,0.7549086,0.03340473,0.0015361245,0.00025069,0.0037790395,0.003818648,0.13401884],"genre_scores_gemma":[0.75790703,0.0050783744,0.15205005,0.008220504,0.0024699748,0.0010502294,0.0036521622,0.0055840337,0.06398772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925591,0.0018909242,0.00022108163,0.0015797123,0.0017190645,0.0020301917],"domain_scores_gemma":[0.9473547,0.037753694,0.0015687614,0.008429783,0.002558161,0.002334942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057884813,0.0033644952,0.0032864064,0.0027848391,0.00337049,0.006995354,0.01008425,0.0035233665,0.03860527],"category_scores_gemma":[0.036054764,0.001287915,0.002723888,0.0042222366,0.0044593597,0.022590049,0.009875914,0.014111934,0.008146487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014021687,0.0009651104,0.0030723868,0.0011440516,0.00021359372,0.00031506535,0.00062918966,0.17643137,0.004143095,0.63639313,0.09560758,0.079683125],"study_design_scores_gemma":[0.00007860803,0.00006423998,0.00041861436,0.00009882295,0.0000962988,0.00011595321,0.00013924726,0.23612241,0.0015408865,0.7554516,0.005835036,0.000038240192],"about_ca_topic_score_codex":0.004488717,"about_ca_topic_score_gemma":0.01008237,"teacher_disagreement_score":0.03860527,"about_ca_system_score_codex":0.007900179,"about_ca_system_score_gemma":0.0058047636,"threshold_uncertainty_score":0.12914753},"labels":[],"label_agreement":null},{"id":"W2951207499","doi":"10.1007/s00446-019-00355-1","title":"Deciding and verifying network properties locally with few output bits","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Predicate (mathematical logic); Verdict; Computer science; Theory of computation; Boolean network; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Boolean function; Law; Programming language","score_opus":0.013251922115166466,"score_gpt":0.1993719256950851,"score_spread":0.18612000357991865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951207499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853365,0.00016794707,0.6046528,0.0011466908,0.00010423656,0.00020873822,0.00042864642,0.003729487,0.0042249546],"genre_scores_gemma":[0.9338028,0.00007204226,0.06329946,0.00022229234,0.00009666677,0.000136777,0.00034894136,0.00050710054,0.0015140339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98905563,0.0035774854,0.0008443103,0.0024984688,0.0025263485,0.0014977744],"domain_scores_gemma":[0.87541014,0.10307584,0.005516218,0.012189192,0.002625892,0.0011827032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005431774,0.0014236518,0.0020467883,0.00086665794,0.00166977,0.0045841425,0.0025038323,0.0026486926,0.0057240073],"category_scores_gemma":[0.037467387,0.0012555424,0.001755454,0.0008867824,0.0041077402,0.011793715,0.0049613626,0.0033786285,0.0013287055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011945098,0.0010697522,0.024783786,0.001479532,0.0006937979,0.002330169,0.001882946,0.40716425,0.20587635,0.16676831,0.0065820375,0.16942397],"study_design_scores_gemma":[0.00049709075,0.00056969567,0.0011095196,0.00006865699,0.00019974276,0.0002563391,0.000437966,0.63497597,0.14611427,0.21463433,0.001056556,0.000079874735],"about_ca_topic_score_codex":0.0012044791,"about_ca_topic_score_gemma":0.0021121155,"teacher_disagreement_score":0.0057240073,"about_ca_system_score_codex":0.0017932643,"about_ca_system_score_gemma":0.0026684224,"threshold_uncertainty_score":0.02872628},"labels":[],"label_agreement":null},{"id":"W2963560569","doi":"10.1007/s00446-013-0205-0","title":"Partition consistency","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Consistency model; Sequential consistency; Computer science; Weak consistency; Correctness; Consistency (knowledge bases); Implementation; Partition (number theory); Causal consistency; Cache coherence; Theoretical computer science; Strong consistency; Mathematical proof; Abstraction; Programming language; Class (philosophy); Parallel computing; Mathematics; Artificial intelligence; CPU cache; Cache algorithms; Cache","score_opus":0.010681241435513439,"score_gpt":0.22914644566822248,"score_spread":0.21846520423270904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963560569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023733225,0.0010960805,0.8201859,0.0016751266,0.0013369744,0.0008720176,0.00176501,0.006678612,0.142657],"genre_scores_gemma":[0.54682696,0.0011136506,0.33774698,0.0019039692,0.00075163785,0.0010223035,0.006232509,0.0038939961,0.10050805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590224,0.0007738778,0.00022275568,0.0009987864,0.0015763079,0.00052612874],"domain_scores_gemma":[0.98848224,0.0014693666,0.0003816761,0.0068324693,0.0024781933,0.00035606927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023959228,0.0010051749,0.0015441556,0.0017318932,0.003040956,0.0043736007,0.0032133136,0.0015371009,0.03363634],"category_scores_gemma":[0.01422746,0.0008644216,0.0010794438,0.0023899034,0.0018438735,0.005521729,0.005407949,0.0032819347,0.009969332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012855522,0.00033363086,0.002707718,0.0006244082,0.00018462709,0.00029019458,0.0008228334,0.028820017,0.019524755,0.50657904,0.07322887,0.36559838],"study_design_scores_gemma":[0.00040364952,0.0003388325,0.0021007983,0.00021218351,0.00028056387,0.00097458897,0.0008748248,0.09697404,0.0505958,0.5801238,0.26700723,0.00011366321],"about_ca_topic_score_codex":0.0019673344,"about_ca_topic_score_gemma":0.0027552983,"teacher_disagreement_score":0.03363634,"about_ca_system_score_codex":0.001455557,"about_ca_system_score_gemma":0.0034955286,"threshold_uncertainty_score":0.11252475},"labels":[],"label_agreement":null},{"id":"W2971627429","doi":"10.1007/s00446-019-00361-3","title":"A complexity-based classification for multiprocessor synchronization","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Computer science; Computability; Theory of computation; Hierarchy; Synchronization (alternating current); Multiprocessing; Theoretical computer science; Parallel computing; Programming language","score_opus":0.03210111754726115,"score_gpt":0.27591656205991083,"score_spread":0.2438154445126497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971627429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078533575,0.0034992036,0.88471955,0.002415643,0.00070336374,0.0003555362,0.0008198583,0.0010964914,0.027856745],"genre_scores_gemma":[0.6819996,0.0031667051,0.29075193,0.0005670101,0.0021952223,0.00049320114,0.0035300646,0.0005919248,0.01670429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974158,0.0002814686,0.00029414616,0.00040202387,0.0012572972,0.00034932618],"domain_scores_gemma":[0.98934865,0.0043831775,0.0012807052,0.0021443022,0.0020524696,0.0007906395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014674175,0.0011630107,0.0011565302,0.0056540077,0.0016596201,0.0043168063,0.0021906213,0.001696756,0.006388889],"category_scores_gemma":[0.012160234,0.00044832885,0.001962558,0.004015557,0.0021320537,0.0072043524,0.003521077,0.002901982,0.0017298327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004290485,0.00021661201,0.010900692,0.00052920904,0.00009424226,0.00033400758,0.0006591558,0.052813593,0.0136065595,0.6635479,0.017603407,0.2392656],"study_design_scores_gemma":[0.00006275659,0.00029493292,0.0067589097,0.0001197923,0.00008596603,0.0008090624,0.00028836966,0.39948162,0.004698737,0.56258464,0.024709402,0.000105828505],"about_ca_topic_score_codex":0.0013635372,"about_ca_topic_score_gemma":0.0009733513,"teacher_disagreement_score":0.006388889,"about_ca_system_score_codex":0.0019417197,"about_ca_system_score_gemma":0.0013852997,"threshold_uncertainty_score":0.021373034},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27824807,0.0002816735,0.6892009,0.0011400474,0.0001554421,0.00020800928,0.0002363814,0.0006087186,0.029920736],"genre_scores_gemma":[0.8946161,0.00024686396,0.09062397,0.00006717011,0.000052864052,0.00018125279,0.00017095853,0.00010676561,0.013933974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990288,0.00032224873,0.000048042926,0.00020088552,0.00019753471,0.00020248367],"domain_scores_gemma":[0.9980319,0.00089762144,0.0003961181,0.00033039885,0.00009190879,0.0002520157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006730622,0.00057364395,0.0009931003,0.0005241455,0.0020111478,0.0017947757,0.0018073035,0.0012969305,0.0053638634],"category_scores_gemma":[0.0042420547,0.00060561695,0.00087557867,0.0011610516,0.0014746042,0.0028611557,0.0041913413,0.00095183385,0.000987774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001823785,0.00024473446,0.0026546419,0.00032379845,0.00017493422,0.001283204,0.0014438819,0.7876036,0.0116922995,0.12848035,0.004809448,0.059465338],"study_design_scores_gemma":[0.000098829594,0.0002304966,0.00041132903,0.000019351233,0.00004278014,0.0001752449,0.00076372107,0.923247,0.0035162864,0.06412762,0.007341059,0.00002633231],"about_ca_topic_score_codex":0.0024280434,"about_ca_topic_score_gemma":0.00202663,"teacher_disagreement_score":0.0053638634,"about_ca_system_score_codex":0.0007061212,"about_ca_system_score_gemma":0.0006621573,"threshold_uncertainty_score":0.01794386},"labels":[],"label_agreement":null},{"id":"W2985470207","doi":"10.1007/s00446-019-00364-0","title":"Recoverable mutual exclusion","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Semaphore; Mutual exclusion; Critical section; Liveness; Computer science; Lock (firearm); Process (computing); Copycat; Reboot; Distributed computing; Operating system; Engineering","score_opus":0.007466612976992102,"score_gpt":0.22188916391477162,"score_spread":0.2144225509377795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985470207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035634365,0.0015021296,0.8284402,0.0021337403,0.00090588705,0.00034485298,0.0006598368,0.006467965,0.123911135],"genre_scores_gemma":[0.7651868,0.0011331877,0.13475174,0.00082691316,0.0005079585,0.00038989398,0.0016706736,0.00085779506,0.09467502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981785,0.00034078056,0.00007670682,0.00031089646,0.0007680978,0.00032499278],"domain_scores_gemma":[0.9971469,0.0007111801,0.00022657661,0.0013114491,0.00045187384,0.00015207341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785119,0.0006368649,0.00073902623,0.0007813538,0.0018421182,0.0019103277,0.0017140182,0.0010960104,0.015392143],"category_scores_gemma":[0.0047356253,0.00030563495,0.000531978,0.0008178646,0.0013577247,0.0026517299,0.0033092506,0.0021912928,0.0033784537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005778627,0.00018470256,0.00044024456,0.0002575895,0.000049429927,0.0003421047,0.0003973017,0.031623226,0.013717998,0.7445378,0.030494705,0.17737707],"study_design_scores_gemma":[0.00011025015,0.00016082339,0.00038927558,0.00007295643,0.00005697751,0.00048133434,0.00014730943,0.17136888,0.023117889,0.6968248,0.107207246,0.00006232473],"about_ca_topic_score_codex":0.00089481345,"about_ca_topic_score_gemma":0.0012713489,"teacher_disagreement_score":0.015392143,"about_ca_system_score_codex":0.00082215795,"about_ca_system_score_gemma":0.0015247827,"threshold_uncertainty_score":0.051491857},"labels":[],"label_agreement":null},{"id":"W3017746918","doi":"10.1007/s00446-020-00372-5","title":"Life beyond set agreement","year":2020,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Hierarchy; Power set; Object (grammar); Combinatorics; Sequence (biology); Theory of computation; Mathematics; Power (physics); Discrete mathematics; Computer science; Algorithm; Physics; Programming language; Artificial intelligence; Chemistry","score_opus":0.02706743297341297,"score_gpt":0.24815861650227383,"score_spread":0.22109118352886087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017746918","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010496016,0.0041066865,0.23981446,0.043436963,0.004615726,0.00016226241,0.00042916115,0.0012973611,0.69564146],"genre_scores_gemma":[0.5494932,0.0038694758,0.06999907,0.016694149,0.0030926825,0.0007033739,0.0009340455,0.0013910364,0.353823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640226,0.0013759498,0.00014724997,0.0007061076,0.0010067893,0.00036166035],"domain_scores_gemma":[0.9933357,0.0017610987,0.00023907798,0.002699198,0.0011651013,0.00079976575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034566743,0.0006063848,0.0008281213,0.0010775729,0.004669387,0.0067885653,0.0017924733,0.0029166373,0.028877137],"category_scores_gemma":[0.010988445,0.00050739857,0.00069178373,0.0008400388,0.009728489,0.015933478,0.0066773677,0.008240313,0.010591226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068383056,0.0000059922645,0.000025024077,0.000013716403,0.0000021198914,0.000010269272,0.00019865013,0.00014912257,0.00007928599,0.9875493,0.0057471483,0.0062125907],"study_design_scores_gemma":[0.000004411652,0.000008196712,0.00001460765,0.000030379178,0.0000020728032,0.00002283769,0.00007989753,0.0005265767,0.00017523789,0.91975904,0.079370946,0.0000058667256],"about_ca_topic_score_codex":0.0012246029,"about_ca_topic_score_gemma":0.0007382252,"teacher_disagreement_score":0.028877137,"about_ca_system_score_codex":0.0025434494,"about_ca_system_score_gemma":0.0028051923,"threshold_uncertainty_score":0.09660363},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26212537,0.0012857417,0.6205562,0.009245734,0.0009495228,0.00022568386,0.00023864125,0.0021757397,0.10319744],"genre_scores_gemma":[0.9209938,0.0002971745,0.06304156,0.0005724218,0.00022666286,0.00010316685,0.00006674446,0.0002587073,0.014439778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970464,0.0012220849,0.00010246726,0.00039784654,0.00069435546,0.00053688645],"domain_scores_gemma":[0.99208117,0.003864269,0.00044682127,0.002327947,0.0005735595,0.00070619467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029077192,0.0003488641,0.001141146,0.0008120122,0.0027583083,0.0039139627,0.0021649285,0.0019058527,0.0082110595],"category_scores_gemma":[0.012476732,0.0005379964,0.0009289418,0.00079786044,0.0041397773,0.0051263133,0.0036421139,0.0023109359,0.0009306817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053510466,0.00010687823,0.000816236,0.000094012845,0.000035710727,0.000094197276,0.0006446456,0.052453905,0.0017784033,0.90954053,0.00661972,0.02728056],"study_design_scores_gemma":[0.000081624996,0.000073346535,0.00031519323,0.000024236719,0.000035231475,0.000069604415,0.00024146431,0.24073592,0.0011283447,0.75185084,0.005407809,0.000036433623],"about_ca_topic_score_codex":0.0016886033,"about_ca_topic_score_gemma":0.0022987395,"teacher_disagreement_score":0.0082110595,"about_ca_system_score_codex":0.0016155558,"about_ca_system_score_gemma":0.0014547498,"threshold_uncertainty_score":0.027468681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032305565,0.0006502941,0.96070105,0.00079265045,0.000079821155,0.00008747581,0.000043570108,0.0004090085,0.0049305344],"genre_scores_gemma":[0.6761798,0.0009031331,0.31519544,0.00047628954,0.00022679368,0.0005010248,0.00015028537,0.00019772016,0.0061693997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944997,0.0022877872,0.0003062646,0.0011031252,0.0010460747,0.00075704954],"domain_scores_gemma":[0.98492646,0.010592445,0.0011416136,0.0021589573,0.00090457924,0.00027592186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004429774,0.00095481495,0.001547167,0.0010935711,0.0015309411,0.0020999587,0.0024515186,0.0023661882,0.003485514],"category_scores_gemma":[0.019138604,0.0007772745,0.0011654317,0.0014094375,0.003936548,0.005052507,0.0028618101,0.002957976,0.00063205406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004268541,0.000112485686,0.00074590824,0.00019645055,0.000046818757,0.00015019857,0.0002862851,0.50115854,0.005390222,0.4616519,0.0016696131,0.028164757],"study_design_scores_gemma":[0.00012146057,0.00016790869,0.00010524807,0.000035734927,0.000024276296,0.000046943165,0.000060657152,0.8321642,0.0036771763,0.16117914,0.0023830775,0.000034189354],"about_ca_topic_score_codex":0.0024920674,"about_ca_topic_score_gemma":0.0019909542,"teacher_disagreement_score":0.004429774,"about_ca_system_score_codex":0.0021235095,"about_ca_system_score_gemma":0.0021741416,"threshold_uncertainty_score":0.023427129},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140960235,0.0013025108,0.96707946,0.0018376817,0.00014899262,0.00003777794,0.000190267,0.00023245356,0.015074767],"genre_scores_gemma":[0.58711064,0.002666116,0.3824858,0.0006172451,0.0007027178,0.00028212133,0.0005302862,0.00042899518,0.025176095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987664,0.0004380015,0.000041022526,0.00022872999,0.0003252593,0.00020051851],"domain_scores_gemma":[0.99624205,0.0027021675,0.00015434335,0.000444256,0.0003125964,0.00014457406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015746835,0.0008954377,0.0016761484,0.0008431322,0.00073235855,0.002075173,0.0019132402,0.0014177846,0.0068757175],"category_scores_gemma":[0.007685785,0.00060454255,0.0009938689,0.0014935269,0.0016515944,0.0034952261,0.0020923694,0.0033727733,0.00092012866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001613285,0.000074311494,0.00031494032,0.00016764426,0.000046920533,0.00003778111,0.00005773956,0.2511245,0.0005830822,0.709961,0.0075549795,0.029915765],"study_design_scores_gemma":[0.00003983997,0.000014683811,0.00008159116,0.000012575227,0.0000112532625,0.000014695243,0.000014488332,0.6461815,0.00018269167,0.35080034,0.0026407316,0.0000057033217],"about_ca_topic_score_codex":0.0042159082,"about_ca_topic_score_gemma":0.0045876405,"teacher_disagreement_score":0.0068757175,"about_ca_system_score_codex":0.0025852188,"about_ca_system_score_gemma":0.0018112047,"threshold_uncertainty_score":0.023001611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09730536,0.0005401739,0.8937159,0.0012545246,0.000063515996,0.00005806685,0.000058283003,0.00033974476,0.006664471],"genre_scores_gemma":[0.9470812,0.00034629504,0.049131602,0.00018040287,0.000076005446,0.00014419765,0.00006589031,0.00012649652,0.002847952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605477,0.0019101381,0.00019740792,0.00069106766,0.0007621638,0.0003843131],"domain_scores_gemma":[0.95786124,0.033772048,0.0028127485,0.002498151,0.001624792,0.0014309969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005102524,0.0008346702,0.0016596825,0.0009674596,0.0011526791,0.0020272734,0.0023480377,0.0015584856,0.002427571],"category_scores_gemma":[0.037367467,0.0007819505,0.0012339355,0.0006560073,0.0043170564,0.0043096063,0.005191385,0.002789019,0.00039896826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059244194,0.00006562598,0.0016042565,0.00016958067,0.00007564757,0.00030253403,0.00046013354,0.7649187,0.0033433216,0.210305,0.0013338998,0.016828826],"study_design_scores_gemma":[0.000061019247,0.00007654302,0.00014475117,0.000022801618,0.000013261248,0.000028298431,0.00004199539,0.9127785,0.0006829216,0.08558559,0.0005516449,0.00001262374],"about_ca_topic_score_codex":0.0023985582,"about_ca_topic_score_gemma":0.0015239002,"teacher_disagreement_score":0.005102524,"about_ca_system_score_codex":0.0014004356,"about_ca_system_score_gemma":0.0015088458,"threshold_uncertainty_score":0.026985109},"labels":[],"label_agreement":null},{"id":"W4399383464","doi":"10.1007/s00446-024-00465-5","title":"On implementing SWMR registers from SWSR registers in systems with Byzantine failures","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Byzantine architecture; Computer science; Byzantine fault tolerance; Operating system; History; Archaeology; Fault tolerance","score_opus":0.01023162103595374,"score_gpt":0.24413851145048826,"score_spread":0.23390689041453452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399383464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24994107,0.0014210568,0.72065717,0.00095969567,0.0002713551,0.00027301817,0.00010381548,0.0077339807,0.01863889],"genre_scores_gemma":[0.75745654,0.0005918786,0.23014261,0.00030324532,0.00007909103,0.00014534309,0.00016159902,0.0005250567,0.010594567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987876,0.00045850463,0.000082110615,0.00010290201,0.00031976562,0.00024907955],"domain_scores_gemma":[0.9975017,0.0010555724,0.00019617342,0.0008430321,0.00036074006,0.00004270549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014150686,0.00066023757,0.0006378544,0.00066520384,0.0009926212,0.0017402207,0.0017357575,0.0008239214,0.0061673573],"category_scores_gemma":[0.004823611,0.00046266578,0.000522677,0.0007059877,0.0010614131,0.0045980606,0.0015839739,0.0011053565,0.0009592847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027663882,0.00025894213,0.0037672534,0.0011289119,0.00014680153,0.00052170444,0.0018349519,0.10240627,0.07734555,0.2170973,0.00944026,0.5832856],"study_design_scores_gemma":[0.00047562446,0.0019811082,0.0017219243,0.00042123286,0.00037681838,0.0006683384,0.0009944357,0.57909065,0.24700767,0.11285645,0.054239143,0.00016650432],"about_ca_topic_score_codex":0.0026566503,"about_ca_topic_score_gemma":0.0060171583,"teacher_disagreement_score":0.0061673573,"about_ca_system_score_codex":0.0007046124,"about_ca_system_score_gemma":0.0010764119,"threshold_uncertainty_score":0.02063185},"labels":[],"label_agreement":null},{"id":"W4401669598","doi":"10.1007/s00446-024-00471-7","title":"A wait-free queue with polylogarithmic step complexity","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Amortized analysis; Mathematics; Bounded function; Combinatorics; Computer science; Lock (firearm); Priority queue; Discrete mathematics; Binary logarithm; Parallel computing; Data structure; Operating system; Computer network","score_opus":0.017274164517485865,"score_gpt":0.2459224800769418,"score_spread":0.22864831555945594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401669598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741894,0.0008012579,0.91445434,0.0028764675,0.00052932044,0.00027888175,0.0007201222,0.003178092,0.0097425515],"genre_scores_gemma":[0.6651208,0.00052598666,0.30689585,0.0010918074,0.00043776914,0.00043300685,0.00070994056,0.00069621106,0.02408865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963329,0.0006294573,0.0002796406,0.00067481335,0.0012221517,0.00086111634],"domain_scores_gemma":[0.9841925,0.008703567,0.00060408795,0.002553587,0.0022684333,0.0016777789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041908855,0.001269596,0.002125745,0.0015425546,0.0038666534,0.007192497,0.0050628725,0.0029284914,0.011156927],"category_scores_gemma":[0.018686187,0.0012331548,0.0011415548,0.0023315616,0.0022068974,0.007685734,0.0040216777,0.0044350578,0.002120649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031184705,0.00085974054,0.0020802477,0.00041125165,0.00013455967,0.00042049718,0.00054457027,0.124895364,0.017600508,0.74692893,0.027005257,0.07600053],"study_design_scores_gemma":[0.00056316686,0.00024393603,0.0002424799,0.000031607568,0.00008548118,0.00015712308,0.000063341344,0.6814876,0.0044495775,0.3090179,0.0035675005,0.00009030834],"about_ca_topic_score_codex":0.006381738,"about_ca_topic_score_gemma":0.007493223,"teacher_disagreement_score":0.011156927,"about_ca_system_score_codex":0.0052715605,"about_ca_system_score_gemma":0.009894508,"threshold_uncertainty_score":0.038248003},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16375248,0.0012210347,0.67530155,0.010083989,0.0013194709,0.0009789455,0.0030702166,0.011123798,0.13314846],"genre_scores_gemma":[0.5223725,0.0007864247,0.4024832,0.0016289443,0.0006042898,0.0010319253,0.0026541962,0.0017584254,0.06668014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724835,0.0007509329,0.00012737664,0.0007031737,0.00053181214,0.00063844124],"domain_scores_gemma":[0.9937589,0.0031491735,0.00034755073,0.0020652234,0.0002723921,0.0004067461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011217287,0.0016632179,0.0012778954,0.000979969,0.002002366,0.0035155052,0.003797943,0.0016596137,0.041873734],"category_scores_gemma":[0.0054659946,0.0006478161,0.001414329,0.002955235,0.0013256408,0.0055066287,0.0036253852,0.001952165,0.009840458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040554167,0.0019489134,0.004816294,0.0014565159,0.0003242683,0.00071180786,0.00045416842,0.22880757,0.036342934,0.097956784,0.09961303,0.5235123],"study_design_scores_gemma":[0.0015228225,0.00033571303,0.0032562155,0.00015134558,0.0003091865,0.00077266415,0.0005339243,0.6944885,0.021086147,0.2439471,0.033503085,0.00009327768],"about_ca_topic_score_codex":0.007054407,"about_ca_topic_score_gemma":0.022021778,"teacher_disagreement_score":0.041873734,"about_ca_system_score_codex":0.0040565873,"about_ca_system_score_gemma":0.004317493,"threshold_uncertainty_score":0.14008158},"labels":[],"label_agreement":null},{"id":"W4407262244","doi":"10.1007/s00446-025-00476-w","title":"When is recoverable consensus harder than consensus?","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Hellenic Foundation for Research and Innovation","keywords":"Scientific consensus; Consensus conference; Washington Consensus; Consensus algorithm; Uniform consensus; Computer science; Consensus; Geology; Political science; Data science; Artificial intelligence; Climate change; Library science; Law; Multi-agent system","score_opus":0.014030030635338654,"score_gpt":0.25512901596238197,"score_spread":0.24109898532704332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407262244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39882606,0.01569718,0.21734904,0.26126903,0.0066555203,0.00019920999,0.0012717721,0.0016460062,0.097086236],"genre_scores_gemma":[0.97681594,0.0022302342,0.008717256,0.0031793904,0.0026094082,0.00009910351,0.0004139326,0.0002993452,0.005635349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99186045,0.0024396502,0.00039403274,0.0018491119,0.0019496033,0.0015070611],"domain_scores_gemma":[0.89384055,0.08614713,0.0046851467,0.0061789644,0.0056284983,0.0035196133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072059114,0.00055265747,0.0021691807,0.0017514452,0.0025976992,0.006393826,0.0023526575,0.0071030506,0.02000268],"category_scores_gemma":[0.10194932,0.0008913909,0.0010086304,0.0020634288,0.006635899,0.027275858,0.0037306887,0.0069412375,0.0026303977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018955914,0.00045809403,0.009904522,0.0015018949,0.00034275022,0.00084320205,0.0018776356,0.031270187,0.0026689598,0.6756695,0.07027681,0.20329084],"study_design_scores_gemma":[0.000061438506,0.0000372809,0.0011999498,0.000079446545,0.00002704773,0.00023186384,0.0014151179,0.019761825,0.00060323655,0.9716912,0.0048479023,0.000043765893],"about_ca_topic_score_codex":0.0016497029,"about_ca_topic_score_gemma":0.00076570513,"teacher_disagreement_score":0.02000268,"about_ca_system_score_codex":0.0014810172,"about_ca_system_score_gemma":0.0016241936,"threshold_uncertainty_score":0.06691569},"labels":[],"label_agreement":null},{"id":"W4409872544","doi":"10.1007/s00446-025-00478-8","title":"Efficient bounded timestamping from standard synchronization primitives","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Bounded function; Distributed computing; Parallel computing; Theoretical computer science; Computer network; Mathematics","score_opus":0.0062293000241328495,"score_gpt":0.2439041454820549,"score_spread":0.23767484545792206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409872544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015537308,0.00040461178,0.9699948,0.00025865436,0.00028499452,0.000100480596,0.00022508013,0.008354471,0.0048395335],"genre_scores_gemma":[0.49933535,0.000462224,0.48878047,0.000287301,0.00030045808,0.00028985628,0.0013537949,0.0016350875,0.007555465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605715,0.0007305389,0.00030667256,0.00048402714,0.0019197185,0.00050175656],"domain_scores_gemma":[0.98973686,0.003308286,0.0005261871,0.0052750325,0.00086500536,0.0002886247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023728858,0.0013854105,0.0017229404,0.0016163936,0.0010979249,0.0028957976,0.0027777574,0.0010733621,0.008361707],"category_scores_gemma":[0.0120164845,0.0010371004,0.00079050224,0.0027555618,0.00137798,0.0058240113,0.006296328,0.0028682442,0.0026062415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023306927,0.0002556034,0.0010054277,0.00045940132,0.000094761956,0.0002573476,0.0004361732,0.050851624,0.064194545,0.35244668,0.02509954,0.5025682],"study_design_scores_gemma":[0.00037419487,0.00024088495,0.0003528331,0.00008168457,0.00012248654,0.00023802476,0.00012279065,0.49769056,0.092283025,0.38302618,0.025383413,0.00008398195],"about_ca_topic_score_codex":0.001134263,"about_ca_topic_score_gemma":0.0023034622,"teacher_disagreement_score":0.008361707,"about_ca_system_score_codex":0.0012882634,"about_ca_system_score_gemma":0.0026886526,"threshold_uncertainty_score":0.027972639},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11088586,0.00034701035,0.8748832,0.00046771645,0.00011699126,0.00013506935,0.00033480156,0.0031116891,0.009717724],"genre_scores_gemma":[0.6993688,0.00016583152,0.2857813,0.00016007792,0.000033713695,0.00017455718,0.0005002111,0.00061554566,0.013200088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988256,0.00037347982,0.000046317873,0.00027268595,0.000250658,0.00023126163],"domain_scores_gemma":[0.99565566,0.0027430342,0.0002889064,0.0007303546,0.00036956256,0.00021244638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685847,0.0006913059,0.0012582139,0.00069827423,0.0016309167,0.0015422688,0.0017629109,0.0015012488,0.008309128],"category_scores_gemma":[0.0060680504,0.0007148723,0.0005314831,0.0013163277,0.0014950943,0.002559266,0.0023765867,0.0014428289,0.0014252382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010810579,0.00015318194,0.0009275515,0.00018137226,0.00005447263,0.00022003235,0.0003499803,0.7709396,0.007270173,0.12180992,0.009011047,0.08800166],"study_design_scores_gemma":[0.00007243512,0.000046037603,0.00006942977,0.00001255207,0.0000061150863,0.000027037873,0.000048777274,0.96036404,0.0025607687,0.035045855,0.0017344784,0.000012450185],"about_ca_topic_score_codex":0.007361789,"about_ca_topic_score_gemma":0.00828956,"teacher_disagreement_score":0.008309128,"about_ca_system_score_codex":0.0013899032,"about_ca_system_score_gemma":0.0011825165,"threshold_uncertainty_score":0.027796805},"labels":[],"label_agreement":null}]}