{"meta":{"query_hash":"8a0651cf6f4f","filters":{"venue":"Synthesis lectures on distributed computing theory"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/8a0651cf6f4f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Synthesis+lectures+on+distributed+computing+theory"},"results":[{"id":"W1981643246","doi":"10.2200/s00278ed1v01y201004dct001","title":"The Mobile Agent Rendezvous Problem in the Ring","year":2010,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Rendezvous; Computer science; Robotics; Artificial intelligence; Mobile agent; Ring (chemistry); Distributed computing; Mobile robot; Collective intelligence; Multi-agent system; Engineering; Robot; Aerospace engineering","score_opus":0.009257801723203448,"score_gpt":0.2502785384484939,"score_spread":0.24102073672529045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981643246","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.23488674,0.0054184655,0.66778064,0.007250919,0.0006270272,0.00014750141,0.00036856844,0.00031981067,0.083200365],"genre_scores_gemma":[0.89752,0.0026048175,0.06637199,0.00020695003,0.0003850763,0.0001458556,0.00013753709,0.00010554552,0.0325222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993703,0.0002340146,0.000019952471,0.00016730792,0.00010052227,0.00010803139],"domain_scores_gemma":[0.9987394,0.00082959357,0.00010977837,0.000108454304,0.00006150097,0.00015123056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183743,0.0005095787,0.0014413594,0.00038712705,0.0014697214,0.0025872595,0.0012993327,0.0019439296,0.0058630146],"category_scores_gemma":[0.0033002603,0.0004461648,0.0006296779,0.0006565202,0.0019650438,0.0038574885,0.0016305426,0.0019419314,0.0006219563],"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.0003284673,0.000042478554,0.0002072706,0.00014724988,0.00003531881,0.00015885927,0.00020294377,0.118504345,0.0022891916,0.85630196,0.005404657,0.016377304],"study_design_scores_gemma":[0.00011332036,0.00007286842,0.00019239784,0.000033378743,0.00002856345,0.00012248215,0.0002602645,0.3206053,0.0014688933,0.66605866,0.0110118985,0.000031880154],"about_ca_topic_score_codex":0.0015552294,"about_ca_topic_score_gemma":0.0010232189,"teacher_disagreement_score":0.0058630146,"about_ca_system_score_codex":0.0010714614,"about_ca_system_score_gemma":0.000834151,"threshold_uncertainty_score":0.019613743},"labels":[],"label_agreement":null},{"id":"W2082078474","doi":"10.2200/s00551ed1v01y201311dct012","title":"Impossibility Results for Distributed Computing","year":2014,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Impossibility; Computer science; Distributed computing; Political science","score_opus":0.012187151172236454,"score_gpt":0.25460207715230293,"score_spread":0.24241492598006648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082078474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.045301087,0.0121941995,0.70210904,0.031097773,0.004051675,0.00015252709,0.0006739095,0.0011845897,0.20323522],"genre_scores_gemma":[0.8214251,0.009471957,0.101071596,0.004965976,0.008472686,0.0009728014,0.0012418901,0.00078162167,0.05159643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99432445,0.0015784334,0.00031553785,0.0012018566,0.0019918126,0.00058793195],"domain_scores_gemma":[0.9656595,0.027927049,0.0005335583,0.0033041548,0.00159595,0.0009797135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060422476,0.0021849463,0.0025374987,0.0031225232,0.00390612,0.0059043146,0.0033295408,0.0034774821,0.011269505],"category_scores_gemma":[0.027312115,0.0015776904,0.0029754583,0.0030058387,0.009021997,0.015457681,0.0073107886,0.019863972,0.001732651],"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.00006579715,0.00002764688,0.00012091863,0.00014535873,0.000032398457,0.00005854106,0.00015147949,0.003828066,0.0003485289,0.9830918,0.005712811,0.00641656],"study_design_scores_gemma":[0.000017782788,0.0000069487537,0.000049609545,0.00002172021,0.000012212458,0.000024816522,0.00001791081,0.0060895393,0.00015704744,0.99023205,0.0033616612,0.0000088310335],"about_ca_topic_score_codex":0.0010599046,"about_ca_topic_score_gemma":0.0005848408,"teacher_disagreement_score":0.011269505,"about_ca_system_score_codex":0.004020414,"about_ca_system_score_gemma":0.0013658408,"threshold_uncertainty_score":0.037700295},"labels":[],"label_agreement":null},{"id":"W4211103781","doi":"10.2200/s00440ed1v01y201208dct010","title":"Distributed Computing by Oblivious Mobile Robots","year":2012,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":99,"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; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Mobile robot; Robotics; Robot; Artificial intelligence; Distributed computing; Human–computer interaction","score_opus":0.011187250422149997,"score_gpt":0.2538542189076905,"score_spread":0.2426669684855405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211103781","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.027795807,0.0020997464,0.94102275,0.0023318813,0.0006051685,0.0000754005,0.00007616891,0.00071106426,0.025282044],"genre_scores_gemma":[0.76963145,0.0026826416,0.17179026,0.00049362134,0.0005843471,0.00039975857,0.00012656563,0.00027677952,0.05401454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951196,0.000133951,0.000019244782,0.0001019587,0.00017085,0.00006193197],"domain_scores_gemma":[0.9990976,0.0005169279,0.00005024055,0.00021362427,0.00007296633,0.000048618804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006125467,0.0006789348,0.00080876035,0.00037461738,0.00064708735,0.0012801589,0.000847779,0.0006695147,0.004134455],"category_scores_gemma":[0.002844213,0.00043481783,0.00038317306,0.0007450294,0.001409477,0.001988391,0.0015654073,0.0021284411,0.00079040544],"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.0002486165,0.000052776417,0.00022779581,0.00023469733,0.00005118892,0.000061477214,0.0001941824,0.17440957,0.007812948,0.71736795,0.0110614635,0.08827731],"study_design_scores_gemma":[0.00010599329,0.000079679216,0.00019004647,0.00004155716,0.000031874224,0.0000632396,0.000042834472,0.42090115,0.0051383846,0.5459264,0.027458336,0.000020509287],"about_ca_topic_score_codex":0.0005825362,"about_ca_topic_score_gemma":0.00065158453,"teacher_disagreement_score":0.004134455,"about_ca_system_score_codex":0.0011834538,"about_ca_system_score_gemma":0.0006785732,"threshold_uncertainty_score":0.013831079},"labels":[],"label_agreement":null},{"id":"W4298022693","doi":"10.1007/978-3-031-02010-0_2","title":"Indistinguishability","year":2014,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Mathematical proof; Computer science; Process (computing); Point (geometry); State (computer science); Theoretical computer science; Value (mathematics); Mathematics; Algorithm; Machine learning; Programming language","score_opus":0.013266508646607765,"score_gpt":0.22601985886413065,"score_spread":0.21275335021752287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298022693","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054139053,0.0060389154,0.1453451,0.0058361567,0.001836304,0.00005932055,0.00034218628,0.00044117292,0.8346869],"genre_scores_gemma":[0.43477002,0.008068651,0.05269183,0.004665913,0.0032580453,0.00040573446,0.0012816122,0.0007532807,0.49410486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875236,0.00024031977,0.00005521096,0.00033627776,0.0004995147,0.000116310395],"domain_scores_gemma":[0.998971,0.00044686432,0.000036455156,0.00032864505,0.00015145964,0.00006560576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008047693,0.000668934,0.0006825484,0.0010167612,0.0016767307,0.00358092,0.0010630727,0.0011951915,0.028045747],"category_scores_gemma":[0.0035432526,0.00039490263,0.00059086614,0.00090007746,0.004971325,0.00771224,0.0033560633,0.005366321,0.006508264],"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.000007244292,0.0000066271195,0.000021188285,0.000024108524,0.0000022792417,0.000008279129,0.000058624595,0.00016527195,0.00017758254,0.9805648,0.005813386,0.013150669],"study_design_scores_gemma":[0.0000038051448,0.000004225506,0.00004413719,0.000019303896,0.0000026820937,0.000037106678,0.00002016976,0.00053595885,0.00036677698,0.94934696,0.049614914,0.000004083321],"about_ca_topic_score_codex":0.00064863963,"about_ca_topic_score_gemma":0.00052306225,"teacher_disagreement_score":0.028045747,"about_ca_system_score_codex":0.0020621477,"about_ca_system_score_gemma":0.0010440054,"threshold_uncertainty_score":0.09382236},"labels":[],"label_agreement":null},{"id":"W4298210941","doi":"10.1007/978-3-031-02008-7_3","title":"Gathering and Convergence","year":2012,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Digital Games and Media","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Robot; Computer science; Anonymity; Convergence (economics); Point (geometry); Mobile robot; Synchronization (alternating current); Adversary; Homing (biology); Theoretical computer science; Distributed computing; Artificial intelligence; Mathematics; Computer security; Engineering; Computer network; Geometry","score_opus":0.017367413231993273,"score_gpt":0.251215567287363,"score_spread":0.2338481540553697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298210941","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060664844,0.001396839,0.09064162,0.0031054148,0.00074614765,0.00015591027,0.00022421208,0.00034392317,0.89731944],"genre_scores_gemma":[0.26846743,0.002412391,0.057584725,0.0009864905,0.00084801036,0.0006386426,0.0010650589,0.0012100678,0.6667871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979048,0.0006847479,0.00010978019,0.0005236545,0.0005258884,0.00025111495],"domain_scores_gemma":[0.99785835,0.0006918361,0.000103104176,0.0007031889,0.00044947298,0.00019397466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023322129,0.0011062198,0.0011852048,0.0031341726,0.0059266263,0.0066401223,0.0017878745,0.0018501943,0.07559212],"category_scores_gemma":[0.007007932,0.0007011139,0.0013395816,0.0023862352,0.0054195127,0.011060315,0.008546395,0.0041386113,0.016993169],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015977537,0.000015585716,0.0000632344,0.000053926968,0.000006003021,0.000032222488,0.0009274477,0.00031718434,0.00020244658,0.9649419,0.009867353,0.023556763],"study_design_scores_gemma":[0.000009360942,0.000020085965,0.00015606557,0.00012289335,0.000008666286,0.000081612605,0.0009138404,0.0011422978,0.0005302084,0.8610085,0.13599461,0.000011733394],"about_ca_topic_score_codex":0.0015077004,"about_ca_topic_score_gemma":0.0015153186,"teacher_disagreement_score":0.07559212,"about_ca_system_score_codex":0.0027112053,"about_ca_system_score_gemma":0.0017806642,"threshold_uncertainty_score":0.25288087},"labels":[],"label_agreement":null},{"id":"W4299514705","doi":"10.1007/978-3-031-02010-0","title":"Impossibility Results for Distributed Computing","year":2014,"lang":"en","type":"book","venue":"Synthesis lectures on distributed computing theory","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Computer science; Distributed computing; Political science","score_opus":0.012572547963264421,"score_gpt":0.2417935549493368,"score_spread":0.22922100698607237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299514705","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.021449013,0.01949833,0.50145537,0.017238744,0.0035845458,0.00014168247,0.00048464065,0.00086675887,0.43528095],"genre_scores_gemma":[0.7350886,0.01761325,0.115457974,0.004261722,0.009205503,0.001165634,0.0012938778,0.001020817,0.11489261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657,0.00086966687,0.00018477732,0.0006334731,0.0014201031,0.0003219833],"domain_scores_gemma":[0.98707795,0.009653553,0.0002524811,0.0019078451,0.00075315643,0.00035490043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033839473,0.001897291,0.0020864694,0.002165558,0.0027963119,0.0048013926,0.0027234035,0.002512344,0.013486991],"category_scores_gemma":[0.015264612,0.0012432447,0.0022352522,0.0021901273,0.0069284504,0.012001774,0.0048672487,0.012973623,0.0024853495],"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.000033191856,0.000020999505,0.000059470207,0.00014104205,0.000021794047,0.000043884927,0.0000928038,0.003307378,0.00025094836,0.9786942,0.008639609,0.008694733],"study_design_scores_gemma":[0.000010716416,0.0000042779593,0.000033791766,0.000025892175,0.0000071746335,0.000028214077,0.0000110119945,0.0041602696,0.00010342035,0.9895319,0.006077506,0.000005980042],"about_ca_topic_score_codex":0.0006769881,"about_ca_topic_score_gemma":0.00037039808,"teacher_disagreement_score":0.013486991,"about_ca_system_score_codex":0.0033641846,"about_ca_system_score_gemma":0.0011724199,"threshold_uncertainty_score":0.04511845},"labels":[],"label_agreement":null},{"id":"W4302798199","doi":"10.1007/978-3-031-02010-0_6","title":"Covering Arguments","year":2014,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Object (grammar); Computer science; Value (mathematics); Process (computing); Programming language; Artificial intelligence","score_opus":0.016819149317491504,"score_gpt":0.24936951820619194,"score_spread":0.23255036888870043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302798199","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010362538,0.0028760924,0.012281069,0.00519628,0.0009211649,0.000024221621,0.00012829731,0.00011198084,0.9774245],"genre_scores_gemma":[0.10851428,0.004499447,0.0070175864,0.0059571513,0.0018384997,0.00017353822,0.0005129854,0.00051162747,0.87097484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898547,0.00033292267,0.00002793643,0.00019916592,0.00034369229,0.000110718465],"domain_scores_gemma":[0.9992505,0.00035884455,0.000031233896,0.00014320399,0.00017343106,0.000042818076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439686,0.00068641966,0.000545068,0.0010576688,0.001901061,0.0039867642,0.00090372784,0.002038692,0.10000191],"category_scores_gemma":[0.0044273753,0.00031817422,0.00060042564,0.0008459198,0.002803944,0.0053926283,0.0021664535,0.0037402126,0.023781125],"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.000009767687,0.000010278982,0.000026396103,0.000035986963,0.0000025477082,0.000015910988,0.00013653205,0.00011320286,0.000079201636,0.94498175,0.03992753,0.0146608455],"study_design_scores_gemma":[0.000007316186,0.000006615274,0.00009674932,0.00012806633,0.000004750497,0.000038067836,0.000121308825,0.00027725368,0.00020307637,0.5661014,0.4330103,0.0000051415846],"about_ca_topic_score_codex":0.0015010093,"about_ca_topic_score_gemma":0.0014231278,"teacher_disagreement_score":0.10000191,"about_ca_system_score_codex":0.0030676255,"about_ca_system_score_gemma":0.001055471,"threshold_uncertainty_score":0.3345397},"labels":[],"label_agreement":null},{"id":"W4302799385","doi":"10.1007/978-3-031-02008-7_6","title":"Flocking","year":2012,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Flocking (texture); Robot; Mobile robot; Computer science; Artificial intelligence; Human–computer interaction; Swarm robotics; Visual arts; Art","score_opus":0.019716228258574123,"score_gpt":0.23803860213713104,"score_spread":0.2183223738785569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302799385","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009436572,0.0137978885,0.17254156,0.0021346991,0.0029910489,0.00008059867,0.00025800182,0.0007773836,0.79798216],"genre_scores_gemma":[0.12279402,0.010207572,0.05460209,0.00086656655,0.0013531684,0.00018542015,0.00065594056,0.00081793655,0.80851734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985826,0.00001539445,0.0000046143546,0.00004431181,0.000057326353,0.00001998717],"domain_scores_gemma":[0.9998921,0.000025889147,0.000006343174,0.000029589237,0.000029374321,0.000016700693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017545423,0.0008250956,0.0005876584,0.0012341988,0.0010056219,0.0012685915,0.0006645863,0.0008442091,0.036969762],"category_scores_gemma":[0.00071577146,0.00032257795,0.00037056176,0.0007863228,0.0011591928,0.0023164484,0.0013100591,0.0014426593,0.00920706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003395438,0.00002538994,0.000104008956,0.00015150657,0.000013224099,0.000049251143,0.00021769166,0.004394828,0.003435428,0.6373342,0.08617651,0.26806393],"study_design_scores_gemma":[0.000013206452,0.000046706773,0.0003653999,0.00018394734,0.000013522433,0.0002306715,0.00009366667,0.012771588,0.0027225977,0.44962174,0.5339115,0.00002540796],"about_ca_topic_score_codex":0.0008510886,"about_ca_topic_score_gemma":0.0010286802,"teacher_disagreement_score":0.036969762,"about_ca_system_score_codex":0.00072385557,"about_ca_system_score_gemma":0.00031437114,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4366158500","doi":"10.1007/978-3-031-20002-1","title":"Recoverable Mutual Exclusion","year":2023,"lang":"en","type":"book","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Mutual exclusion; Computer science; Programming language","score_opus":0.013591751389051077,"score_gpt":0.23507455608325883,"score_spread":0.22148280469420775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158500","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042449,0.009819052,0.22721168,0.0021494264,0.0028817237,0.00011228006,0.00046656103,0.003238727,0.74987566],"genre_scores_gemma":[0.079977445,0.0064767017,0.039636,0.0007189252,0.0011278818,0.00017144617,0.0010452651,0.0010050251,0.8698412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996532,0.000037426154,0.000008783001,0.00005491193,0.00020880227,0.000036804788],"domain_scores_gemma":[0.9997397,0.00008120332,0.000013922517,0.00008582475,0.00006199123,0.000017311724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025399166,0.0007880669,0.0005370813,0.0005591809,0.0008158548,0.0012521978,0.00082815014,0.0005700611,0.03558053],"category_scores_gemma":[0.0008568917,0.0003865263,0.00034261387,0.00080574537,0.0008530424,0.001910515,0.0013546397,0.0019243043,0.012898822],"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.00010882935,0.00005686168,0.00005589919,0.0001954791,0.000014182812,0.00008546979,0.00018773152,0.0069141714,0.0051305396,0.4353588,0.19926806,0.35262403],"study_design_scores_gemma":[0.000018537417,0.000037976217,0.00014461657,0.00009493253,0.000012576631,0.00015088108,0.000039417682,0.012230965,0.0051395767,0.3113416,0.67076945,0.000019496518],"about_ca_topic_score_codex":0.0007773212,"about_ca_topic_score_gemma":0.0012941924,"teacher_disagreement_score":0.03558053,"about_ca_system_score_codex":0.00081528403,"about_ca_system_score_gemma":0.00063488685,"threshold_uncertainty_score":0.11902881},"labels":[],"label_agreement":null},{"id":"W4366158728","doi":"10.1007/978-3-031-20002-1_8","title":"Constant Amortized Complexity Algorithm","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Amortized analysis; Swap (finance); Computer science; Constant (computer programming); Algorithm; Set (abstract data type); Mathematics; Data structure; Combinatorics; Theoretical computer science; Programming language","score_opus":0.03270902441127518,"score_gpt":0.2575149012246038,"score_spread":0.22480587681332861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158728","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.014019892,0.0019954818,0.8358526,0.004565691,0.0015944842,0.00030701284,0.0017165568,0.005709812,0.13423844],"genre_scores_gemma":[0.172948,0.0014266773,0.6788426,0.0022482811,0.0015804993,0.00077263,0.0032716447,0.0036338489,0.1352759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716884,0.00043694116,0.00013204897,0.00070873636,0.0011654241,0.00038804318],"domain_scores_gemma":[0.9943281,0.0023242414,0.00014493872,0.002209237,0.00076461333,0.0002288216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016863421,0.0024762836,0.0016426475,0.0018074509,0.0019265641,0.0043745437,0.0052408525,0.002073419,0.044227432],"category_scores_gemma":[0.007832751,0.0007883343,0.0019450458,0.003422182,0.0021057313,0.009190707,0.004180757,0.0064610806,0.011477082],"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.00077706913,0.00034748475,0.00043696846,0.00046375263,0.00012212225,0.00008005368,0.0001378572,0.03654013,0.0074287895,0.45893788,0.12767641,0.36705145],"study_design_scores_gemma":[0.00022978432,0.000097981996,0.00041297782,0.00008418647,0.00012215158,0.0001935505,0.000053979784,0.25691664,0.0077109616,0.6743878,0.059736975,0.000052921132],"about_ca_topic_score_codex":0.002975437,"about_ca_topic_score_gemma":0.003897319,"teacher_disagreement_score":0.044227432,"about_ca_system_score_codex":0.0045361426,"about_ca_system_score_gemma":0.0035115285,"threshold_uncertainty_score":0.14795548},"labels":[],"label_agreement":null},{"id":"W4366158737","doi":"10.1007/978-3-031-20002-1_12","title":"Discussion and Open Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queue; Theoretical computer science; Distributed computing; Computer network","score_opus":0.024125019732167373,"score_gpt":0.2499984181994353,"score_spread":0.22587339846726792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158737","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020371052,0.030106243,0.0088540735,0.32643968,0.031884726,0.000058521066,0.00046983865,0.00022763116,0.59992224],"genre_scores_gemma":[0.056929957,0.025776329,0.009544449,0.102391884,0.045623053,0.0004155372,0.0012435179,0.0005328479,0.75754243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99538344,0.0015675498,0.00013346109,0.000731243,0.0015403989,0.0006438471],"domain_scores_gemma":[0.99370885,0.0023394686,0.00021642026,0.00084213645,0.0021426936,0.0007503765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006712931,0.00084801327,0.0010179974,0.002399471,0.0056096055,0.0097840605,0.0035727576,0.0069754785,0.15357593],"category_scores_gemma":[0.01715408,0.0003270189,0.0012272601,0.0028627384,0.0047916574,0.015343924,0.005206942,0.0074943407,0.04277133],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049142476,0.00009137002,0.00011187374,0.00015710693,0.000008619753,0.00006595963,0.0005877856,0.00019809198,0.00017330963,0.58231175,0.3682591,0.047985937],"study_design_scores_gemma":[0.000011819163,0.0000076236856,0.00011012371,0.00019033186,0.000004688139,0.00005425674,0.000754429,0.00016229706,0.00012187816,0.36900952,0.6295652,0.00000789984],"about_ca_topic_score_codex":0.002465336,"about_ca_topic_score_gemma":0.0017587444,"teacher_disagreement_score":0.15357593,"about_ca_system_score_codex":0.0046253167,"about_ca_system_score_gemma":0.003617742,"threshold_uncertainty_score":0.51376265},"labels":[],"label_agreement":null},{"id":"W4366158753","doi":"10.1007/978-3-031-20002-1_2","title":"Persistent Memory","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Psychology","score_opus":0.07121839519085539,"score_gpt":0.27266032886417585,"score_spread":0.20144193367332047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158753","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033333886,0.0064317733,0.07850411,0.00443009,0.002863709,0.000058181246,0.00054707826,0.0012223456,0.9026092],"genre_scores_gemma":[0.057564054,0.0036749616,0.008912047,0.001079203,0.00096724916,0.000079918165,0.00053440395,0.00040734076,0.92678076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998354,0.000018134044,0.000007645876,0.00004980614,0.00006448991,0.000024540765],"domain_scores_gemma":[0.99967027,0.00007518171,0.000013662403,0.00013531547,0.00007850871,0.00002703013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023383554,0.0006599557,0.0003829952,0.0005826284,0.0010482796,0.0031552014,0.0010545724,0.0009680373,0.08915449],"category_scores_gemma":[0.0011600648,0.00027398692,0.00033564167,0.0007357033,0.0012476536,0.0061623766,0.0015751775,0.0016629891,0.025565546],"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.000027533193,0.000017417991,0.000047584253,0.0000938045,0.000006069938,0.000039132705,0.00014865294,0.00046062126,0.0009904267,0.79254067,0.098714575,0.1069136],"study_design_scores_gemma":[0.000007379201,0.000014119432,0.00007254603,0.00005425938,0.000007409305,0.00012485663,0.00007654441,0.0011829427,0.0013922183,0.538507,0.45855165,0.000009159152],"about_ca_topic_score_codex":0.0010007251,"about_ca_topic_score_gemma":0.0012066886,"teacher_disagreement_score":0.08915449,"about_ca_system_score_codex":0.00090576365,"about_ca_system_score_gemma":0.00072462927,"threshold_uncertainty_score":0.29825145},"labels":[],"label_agreement":null},{"id":"W4366158757","doi":"10.1007/978-3-031-20002-1_11","title":"System Wide Failures","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reliability engineering; Distributed computing; Engineering","score_opus":0.013186385155070292,"score_gpt":0.21730077841067602,"score_spread":0.20411439325560574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158757","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045858654,0.0064613763,0.12414816,0.0035523206,0.0036291056,0.00018040756,0.0007580137,0.004595545,0.8520892],"genre_scores_gemma":[0.06772789,0.0058317687,0.011283168,0.001194771,0.0009879915,0.00014649624,0.00090126815,0.000749568,0.9111771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.000051337134,0.0000137736815,0.00009121389,0.000207917,0.00006657319],"domain_scores_gemma":[0.99940264,0.00011204428,0.000033902805,0.0002235495,0.00016279118,0.00006504253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048171743,0.0011624465,0.00055970665,0.0007450975,0.0009762829,0.0026125582,0.0009783789,0.0010278274,0.08619826],"category_scores_gemma":[0.0014655497,0.0004714812,0.0003806547,0.0008618302,0.0009185274,0.0030120711,0.0024621743,0.0022777086,0.035998203],"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.00008579148,0.00005784395,0.00021450764,0.00037950333,0.000019550776,0.00022691401,0.00038997128,0.0038991033,0.007239019,0.30054328,0.32215637,0.3647881],"study_design_scores_gemma":[0.000011044593,0.000054599328,0.00022855798,0.0000763194,0.000012492839,0.00028598998,0.00008944248,0.0025875475,0.0023493643,0.06945995,0.924832,0.000012755091],"about_ca_topic_score_codex":0.000584719,"about_ca_topic_score_gemma":0.00074257574,"teacher_disagreement_score":0.08619826,"about_ca_system_score_codex":0.00067043613,"about_ca_system_score_gemma":0.00086292304,"threshold_uncertainty_score":0.28836197},"labels":[],"label_agreement":null},{"id":"W4366158775","doi":"10.1007/978-3-031-20002-1_9","title":"Abortable Recoverable Mutual Exclusion","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutual exclusion; Critical section; Lock (firearm); Computer science; Abort; Logarithm; Process (computing); Task (project management); Distributed computing; Parallel computing; Operating system; Mathematics; Engineering","score_opus":0.016061836719582327,"score_gpt":0.230215265144554,"score_spread":0.21415342842497168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158775","genre_codex":"methods","genre_gemma":"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.015906226,0.0035319366,0.69765097,0.0017935149,0.0016944461,0.00016412669,0.00031197202,0.0049201585,0.27402675],"genre_scores_gemma":[0.46778986,0.003290283,0.14843345,0.0009754469,0.0009816387,0.0003651079,0.0010935728,0.0016324719,0.3754382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908316,0.00013901245,0.000025383062,0.00009744911,0.00052755635,0.00012740742],"domain_scores_gemma":[0.99886453,0.0004734792,0.00005946317,0.00039744793,0.00016115695,0.00004406009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555523,0.0006006277,0.0005356164,0.0003717244,0.000869121,0.0013747992,0.0017531952,0.0006714115,0.013572412],"category_scores_gemma":[0.0020770954,0.00035857933,0.0002967301,0.0005278546,0.0011868343,0.0022836828,0.0018367437,0.0029804332,0.0035152915],"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.00033820732,0.00009550699,0.00012069923,0.000255047,0.00001764272,0.00021782468,0.00050438393,0.015977047,0.010660751,0.63194346,0.04715611,0.29271325],"study_design_scores_gemma":[0.00008275771,0.00014267975,0.0002752252,0.0001470903,0.000030407806,0.00032290674,0.00011155623,0.073364526,0.020744145,0.6097216,0.2950098,0.000047230566],"about_ca_topic_score_codex":0.0005831045,"about_ca_topic_score_gemma":0.0010340499,"teacher_disagreement_score":0.013572412,"about_ca_system_score_codex":0.0007684397,"about_ca_system_score_gemma":0.0007340816,"threshold_uncertainty_score":0.045404255},"labels":[],"label_agreement":null},{"id":"W4366158777","doi":"10.1007/978-3-031-20002-1_3","title":"Prior Work","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutual exclusion; Scope (computer science); Computer science; Critical section; Variety (cybernetics); Dijkstra's algorithm; Theoretical computer science; Bounded function; Implementation; Work (physics); Operations research; Data science; Distributed computing; Software engineering; Mathematics; Artificial intelligence; Engineering; Programming language","score_opus":0.017197964460847235,"score_gpt":0.22916353295874636,"score_spread":0.21196556849789913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158777","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012815591,0.005038738,0.005236291,0.00511969,0.0049810754,0.00016422427,0.0071144826,0.0014361326,0.9696278],"genre_scores_gemma":[0.007212125,0.0045574275,0.0032625226,0.0018836663,0.0008933959,0.00011159007,0.009875534,0.0005168802,0.9716868],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988985,0.000121341145,0.000044476208,0.00029103897,0.00048266567,0.0001618767],"domain_scores_gemma":[0.9973928,0.0004915998,0.000082383,0.00072013895,0.0008652858,0.00044769316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008722433,0.00091447996,0.00075408764,0.0034310648,0.0017594745,0.004129779,0.0017092127,0.0014345024,0.6545165],"category_scores_gemma":[0.004333368,0.000347038,0.00072902377,0.003322406,0.0009828049,0.001679338,0.002173373,0.001429823,0.56553984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077964876,0.00012046393,0.00040526508,0.00036358403,0.000016031081,0.00009761068,0.000080052894,0.00029349132,0.00058374816,0.012493126,0.74846864,0.2370001],"study_design_scores_gemma":[0.0000071409513,0.000008971499,0.0001800589,0.00013985846,0.000008056922,0.00006344989,0.00005067164,0.000087648805,0.00030455625,0.0027476489,0.9963961,0.000005746338],"about_ca_topic_score_codex":0.004081426,"about_ca_topic_score_gemma":0.0092304265,"teacher_disagreement_score":0.6545165,"about_ca_system_score_codex":0.0014959465,"about_ca_system_score_gemma":0.0027150204,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4366158782","doi":"10.1007/978-3-031-20002-1_10","title":"Tight Lower Bound","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fetch; Computer science; Upper and lower bounds; Parallel computing; Algorithm; Mathematics; Geology","score_opus":0.015503645749227248,"score_gpt":0.230194060985531,"score_spread":0.21469041523630375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366158782","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078048026,0.015968326,0.34585556,0.018065948,0.0050827516,0.00022824542,0.0033160222,0.0033546628,0.6003236],"genre_scores_gemma":[0.30678457,0.023166513,0.16394818,0.02027723,0.011419243,0.0017459972,0.010459308,0.007845835,0.45435312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99295795,0.0011752418,0.00021573743,0.0015286197,0.0026836526,0.0014387536],"domain_scores_gemma":[0.988345,0.0060474994,0.00030354972,0.003094479,0.0014971123,0.0007123783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033306947,0.004611754,0.0048959623,0.004379799,0.005200322,0.009474622,0.006378237,0.0041651977,0.09789473],"category_scores_gemma":[0.023038063,0.0019947952,0.0025010125,0.007596618,0.004422485,0.016806263,0.010150501,0.016596632,0.03636598],"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.00027664157,0.00017687409,0.00021628184,0.0005361063,0.00006060896,0.00007681591,0.0001491018,0.007929215,0.0010354741,0.69997346,0.20335008,0.08621929],"study_design_scores_gemma":[0.00002504043,0.000022733502,0.00010132656,0.000107129694,0.000042245676,0.000077263285,0.000041682724,0.0127695305,0.0005193949,0.93804216,0.048229694,0.000021779357],"about_ca_topic_score_codex":0.0035376593,"about_ca_topic_score_gemma":0.0037857795,"teacher_disagreement_score":0.09789473,"about_ca_system_score_codex":0.0062064924,"about_ca_system_score_gemma":0.003614979,"threshold_uncertainty_score":0.3274905},"labels":[],"label_agreement":null},{"id":"W4366159806","doi":"10.1007/978-3-031-20002-1_5","title":"Load and Store Based Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Algorithm; Theoretical computer science","score_opus":0.01668194475266698,"score_gpt":0.23022624277783674,"score_spread":0.21354429802516975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366159806","genre_codex":"methods","genre_gemma":"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.006349383,0.0034074849,0.8236786,0.0015741806,0.0012194006,0.00018196127,0.0005511583,0.008768614,0.15426926],"genre_scores_gemma":[0.107054226,0.0030279937,0.5085695,0.0008634568,0.0009291134,0.0002684532,0.0016152201,0.0033743985,0.37429762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924785,0.000074788244,0.000034107194,0.00016160826,0.00040062718,0.00008110341],"domain_scores_gemma":[0.999119,0.00020319664,0.000024817718,0.00044043688,0.00016666715,0.00004596426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055781787,0.0015069239,0.0010628195,0.00094744074,0.0012175164,0.003071653,0.0022911134,0.0011360343,0.06109575],"category_scores_gemma":[0.0019408052,0.000841537,0.00064596283,0.0020270273,0.0010918872,0.004499738,0.0017169276,0.0023493068,0.024213823],"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.00026731417,0.0001856908,0.000187767,0.00020109236,0.000044430373,0.000029210743,0.0001058553,0.020059975,0.006138047,0.26855302,0.08521177,0.6190158],"study_design_scores_gemma":[0.000104966435,0.00008994161,0.00026040213,0.0000729202,0.00006175515,0.00016952303,0.000062625266,0.18589655,0.015234545,0.5342268,0.26377904,0.00004093879],"about_ca_topic_score_codex":0.0012551144,"about_ca_topic_score_gemma":0.0022293134,"teacher_disagreement_score":0.06109575,"about_ca_system_score_codex":0.0011160738,"about_ca_system_score_gemma":0.0010722394,"threshold_uncertainty_score":0.20438564},"labels":[],"label_agreement":null},{"id":"W4366160575","doi":"10.1007/978-3-031-20002-1_4","title":"Problem Formulation","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Computer science; Scalability; Mutual exclusion; Theoretical computer science; Semantics (computer science); Programming language; Distributed computing; Formal description; Measure (data warehouse); Data mining; Database","score_opus":0.01693060431566782,"score_gpt":0.2322325904871304,"score_spread":0.2153019861714626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160575","genre_codex":"methods","genre_gemma":"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.008355463,0.0017486912,0.7118503,0.016069284,0.0015996455,0.0010146152,0.0052444935,0.00051256537,0.25360504],"genre_scores_gemma":[0.3157932,0.0032199195,0.33624876,0.0054677124,0.002539923,0.003280538,0.008199474,0.00056565885,0.32468486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988476,0.0003819726,0.000035603964,0.0003901534,0.00019523424,0.00014935875],"domain_scores_gemma":[0.9986773,0.00087342534,0.00006706105,0.00009201017,0.00021689275,0.00007324799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226774,0.00095427927,0.001143978,0.00076861656,0.0007484273,0.0034657137,0.002442362,0.0037292622,0.09407325],"category_scores_gemma":[0.005699948,0.00044984513,0.0007568215,0.0008417106,0.0010560342,0.002661772,0.002296961,0.0025696566,0.009640984],"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.00018420124,0.00022441342,0.0007317805,0.0009408569,0.00004348445,0.00046959848,0.0001898638,0.15062323,0.0006144373,0.5673866,0.15952039,0.119071074],"study_design_scores_gemma":[0.00011996559,0.00012136408,0.00023296426,0.00024703506,0.00003220423,0.00023866734,0.00040347216,0.37340802,0.0007054267,0.4865347,0.13792719,0.000028923896],"about_ca_topic_score_codex":0.0026916426,"about_ca_topic_score_gemma":0.001996747,"teacher_disagreement_score":0.09407325,"about_ca_system_score_codex":0.0010530108,"about_ca_system_score_gemma":0.0018854324,"threshold_uncertainty_score":0.3147064},"labels":[],"label_agreement":null},{"id":"W4366160711","doi":"10.1007/978-3-031-20002-1_6","title":"Sublogarithmic Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constant (computer programming); Time complexity; Block (permutation group theory); Lock (firearm); Algorithm; Tree (set theory); Parallel computing; Mathematics; Combinatorics; Engineering; Programming language","score_opus":0.018866715742933277,"score_gpt":0.23622359271247856,"score_spread":0.21735687696954528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160711","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048624314,0.016039291,0.30873945,0.004913688,0.0045371437,0.00006533536,0.0006054526,0.0027531597,0.6574841],"genre_scores_gemma":[0.16264899,0.0137994755,0.15550381,0.0033844793,0.0048016794,0.00030426486,0.0017484131,0.0029199163,0.65488887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.00014684431,0.000035209243,0.0001928019,0.00046347556,0.00008899604],"domain_scores_gemma":[0.99910444,0.00035528583,0.000027694898,0.00028226717,0.0001692249,0.000060932412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493165,0.0014180318,0.001126708,0.0016075164,0.001311751,0.0034859115,0.0014568439,0.00092203525,0.05423448],"category_scores_gemma":[0.003200735,0.0006234887,0.00066379,0.0032096365,0.0017239362,0.0056198924,0.0021378277,0.0053409203,0.024412405],"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.00007147263,0.000047063168,0.000086467044,0.00015931988,0.000013661384,0.000021152831,0.00009405864,0.0017002786,0.0010585488,0.754251,0.08166975,0.16082728],"study_design_scores_gemma":[0.000020522855,0.000016507507,0.00012676719,0.000053145443,0.00001332359,0.00007581109,0.00002155035,0.0051721656,0.0011017082,0.78995967,0.20342864,0.000010188133],"about_ca_topic_score_codex":0.0005728061,"about_ca_topic_score_gemma":0.0007163597,"teacher_disagreement_score":0.05423448,"about_ca_system_score_codex":0.0025800131,"about_ca_system_score_gemma":0.0010261363,"threshold_uncertainty_score":0.18143237},"labels":[],"label_agreement":null},{"id":"W4366160739","doi":"10.1007/978-3-031-20002-1_7","title":"Adaptive Algorithms","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Crash; Algorithm; Distributed computing; Programming language","score_opus":0.023297562472138187,"score_gpt":0.23718426517283908,"score_spread":0.2138867027007009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160739","genre_codex":"methods","genre_gemma":"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.0026846542,0.0069405134,0.7360985,0.0012197307,0.0024551558,0.000075117445,0.00033075074,0.0023228861,0.24787271],"genre_scores_gemma":[0.12197344,0.009770482,0.20845698,0.0014635157,0.0025582737,0.00030602663,0.0016694159,0.001273253,0.6525285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967647,0.00003981359,0.000011966926,0.00009191917,0.00015871474,0.000021156357],"domain_scores_gemma":[0.99967575,0.00009157787,0.000013100966,0.00011812061,0.00008162009,0.000019786243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028942068,0.0010132713,0.0006772594,0.0006027047,0.00037901168,0.0014445124,0.00082133105,0.00097544666,0.044035528],"category_scores_gemma":[0.0014129006,0.00033196626,0.00037188074,0.0008888024,0.00058916106,0.0011624531,0.001101981,0.0015365097,0.027794674],"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.00006936853,0.00006144281,0.00023329591,0.00020026386,0.000042690026,0.000046748577,0.000046345158,0.026321964,0.006242802,0.20522892,0.10185928,0.65964687],"study_design_scores_gemma":[0.000046968005,0.00007953356,0.00058630697,0.000117728305,0.00004368707,0.00029663695,0.000037005662,0.17367245,0.007546913,0.30945572,0.5080788,0.000038252656],"about_ca_topic_score_codex":0.00041298824,"about_ca_topic_score_gemma":0.0004102378,"teacher_disagreement_score":0.044035528,"about_ca_system_score_codex":0.00037392127,"about_ca_system_score_gemma":0.00035676293,"threshold_uncertainty_score":0.14731348},"labels":[],"label_agreement":null},{"id":"W4366160740","doi":"10.1007/978-3-031-20002-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Critical section; Crash; State (computer science); Latency (audio); Class (philosophy); Synchronization (alternating current); Distributed computing; Operating system; Computer network; Telecommunications; Programming language; Artificial intelligence; Channel (broadcasting)","score_opus":0.012913357424054079,"score_gpt":0.22218331991053955,"score_spread":0.20926996248648547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366160740","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003610381,0.0021716263,0.004863045,0.0029086687,0.0055781044,0.0001463536,0.0028010234,0.001182136,0.979988],"genre_scores_gemma":[0.0010030455,0.0010476457,0.0011111143,0.00085879216,0.00066473003,0.00007261146,0.001714417,0.00025674448,0.99327093],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937755,0.00005488035,0.00001859675,0.00012782498,0.0003487877,0.00007235148],"domain_scores_gemma":[0.9991322,0.00010528951,0.000027480846,0.000117478434,0.0004126413,0.00020489638],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005872379,0.0009449476,0.00060467166,0.0015902732,0.0013314208,0.003929464,0.0015211217,0.001648162,0.658623],"category_scores_gemma":[0.0021816916,0.00031456508,0.0004885219,0.0014295323,0.00048200405,0.0026661556,0.0023765562,0.0016327889,0.58213395],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023906596,0.000031920343,0.00008205594,0.00011993858,0.0000018263732,0.000034532823,0.00007235261,0.00010800429,0.0003840158,0.020579383,0.8324274,0.14613469],"study_design_scores_gemma":[0.0000019025002,0.0000055844316,0.000055454853,0.00003992942,7.5254343e-7,0.000019349694,0.000023162062,0.000021802987,0.00006690268,0.0025850043,0.9971781,0.000002011596],"about_ca_topic_score_codex":0.0021648812,"about_ca_topic_score_gemma":0.0034529855,"teacher_disagreement_score":0.658623,"about_ca_system_score_codex":0.0012557147,"about_ca_system_score_gemma":0.0018773315,"threshold_uncertainty_score":0.48693287},"labels":[],"label_agreement":null}]}