{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030999174,0.00031258704,0.9498494,0.005410093,0.0008608391,0.0014362715,0.000020934322,0.00063796685,0.010472687],"genre_scores_gemma":[0.9937104,0.000017035238,0.005490917,0.0005252968,0.00009079885,0.00010783252,0.0000061985756,0.000015980982,0.00003555527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969621,0.0011093515,0.00036134338,0.00046752728,0.0004910581,0.00060862006],"domain_scores_gemma":[0.9936168,0.0049771564,0.00014863552,0.0010975564,0.00007914006,0.00008068337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041596773,0.00023015405,0.0001794315,0.00010026798,0.0009134074,0.00067557447,0.0025578358,0.00010355711,0.00002092691],"category_scores_gemma":[0.0010038692,0.000128125,0.00011104037,0.0006783449,0.00016284936,0.00009406786,0.00030179214,0.00086926465,0.00003489634],"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.000041155796,0.00021673959,0.000086010434,0.000015996018,0.000041113726,0.000024538836,0.0021520166,0.059373215,0.0004858601,0.62041837,0.0015542508,0.31559074],"study_design_scores_gemma":[0.0011362968,0.0004409212,0.006227405,0.00029871872,0.000038461963,0.00016451548,0.0010765892,0.509304,0.011567679,0.3789071,0.089353204,0.001485139],"about_ca_topic_score_codex":0.000012238904,"about_ca_topic_score_gemma":0.000033383432,"teacher_disagreement_score":0.9627112,"about_ca_system_score_codex":0.000053624295,"about_ca_system_score_gemma":0.000080899685,"threshold_uncertainty_score":0.70252836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020615987,0.00012902924,0.97152984,0.0010948005,0.0010724975,0.0008384692,0.0020966688,0.0013388846,0.0012838456],"genre_scores_gemma":[0.9882842,0.0000019352447,0.009931463,0.0005328055,0.0005336903,0.000043675587,0.0005931309,0.00005204286,0.000027110158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930766,0.0014506301,0.001423387,0.0018925439,0.00070552074,0.0014512866],"domain_scores_gemma":[0.98616004,0.009830131,0.00083280087,0.0023264494,0.0004605113,0.00039008292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0059307683,0.0007940175,0.0010465727,0.00019289623,0.0011780488,0.0007087586,0.0027318483,0.00037616817,0.000007092546],"category_scores_gemma":[0.007927983,0.0006994369,0.00055962714,0.0010038167,0.00022448787,0.00023558467,0.00048462613,0.00057148514,0.00004901411],"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.001532398,0.0009847136,0.0003150862,0.00036669036,0.0004704814,0.000025478086,0.00086262525,0.061358407,0.0010931108,0.5254176,0.02795085,0.37962252],"study_design_scores_gemma":[0.003732617,0.00069860864,0.009232253,0.0008761833,0.000115339615,0.00006417121,0.00012900161,0.8343353,0.01672064,0.085972965,0.045880023,0.0022428744],"about_ca_topic_score_codex":0.000022108898,"about_ca_topic_score_gemma":0.0000058182623,"teacher_disagreement_score":0.9676682,"about_ca_system_score_codex":0.00030526178,"about_ca_system_score_gemma":0.00013761735,"threshold_uncertainty_score":0.9995457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013203289,0.0008867284,0.98185223,0.00044045874,0.00061875995,0.0005422882,0.00023061373,0.0012918945,0.00093374593],"genre_scores_gemma":[0.98985994,0.000019174578,0.008726035,0.00073847483,0.0002271854,0.000033324304,0.00029542332,0.000055149343,0.000045266028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947594,0.0013748956,0.0006749162,0.000852093,0.00074887567,0.0015898456],"domain_scores_gemma":[0.9943663,0.0033787314,0.00036428924,0.0011452644,0.00020174602,0.00054365676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023818612,0.000580209,0.000581112,0.00022833704,0.0008789849,0.0005149517,0.00189891,0.0002610869,0.00012136631],"category_scores_gemma":[0.0011919076,0.00052456313,0.00025353074,0.0011915391,0.00018177663,0.00039222985,0.0006739539,0.00065205176,0.00017647636],"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.00016920036,0.0023551548,0.0015984062,0.00014144785,0.0005165609,0.000031817017,0.0024868452,0.45529494,0.0021421164,0.1756277,0.05642716,0.30320865],"study_design_scores_gemma":[0.0022111866,0.0007209655,0.0054808743,0.0007357742,0.00016029138,0.00018503662,0.00048695,0.8843901,0.05185901,0.015442953,0.034285765,0.0040410724],"about_ca_topic_score_codex":0.000012683662,"about_ca_topic_score_gemma":7.1893453e-7,"teacher_disagreement_score":0.9766567,"about_ca_system_score_codex":0.00027147515,"about_ca_system_score_gemma":0.000087797234,"threshold_uncertainty_score":0.9997206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014999564,0.00036789477,0.8265127,0.0005243455,0.0015568684,0.0007160698,0.00026023795,0.0020494035,0.1678625],"genre_scores_gemma":[0.95330524,0.000018957255,0.027823977,0.0019856591,0.0028572364,0.0000582487,0.0003385505,0.0004002714,0.013211868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99243665,0.0010370035,0.0013013134,0.0027600178,0.0012648492,0.0012001941],"domain_scores_gemma":[0.9816549,0.012315599,0.0010603386,0.004090849,0.0004572833,0.00042104968],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0039014465,0.0014999761,0.0016861609,0.00045767383,0.00070198637,0.00058756425,0.0049261325,0.0010307374,0.00035208656],"category_scores_gemma":[0.0056518884,0.001396512,0.00092916127,0.00027644413,0.00057648844,0.00007931807,0.0019959074,0.0018633556,0.0004455213],"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.00004915262,0.000096816926,0.00001631326,0.00012107142,0.00020599566,0.000048791655,0.00011755685,0.0016611518,0.00000553758,0.71564615,0.0025165137,0.27951497],"study_design_scores_gemma":[0.00030473393,0.0003040412,0.00060943543,0.0006861089,0.00014286139,0.00007286325,0.00000485766,0.01971968,0.0005125071,0.90376914,0.07180594,0.0020678614],"about_ca_topic_score_codex":0.0000105466515,"about_ca_topic_score_gemma":0.0000061652595,"teacher_disagreement_score":0.9531552,"about_ca_system_score_codex":0.00075277995,"about_ca_system_score_gemma":0.00030903379,"threshold_uncertainty_score":0.99977493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007021327,0.0037678496,0.0015807451,0.00022954913,0.00073098484,0.00028244834,0.00017832301,0.00029409843,0.9922339],"genre_scores_gemma":[0.87134606,0.00085050083,0.00010584828,0.00036563494,0.0012047511,0.0000072195216,0.000046026227,0.000095958676,0.12597798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998203,0.00015451293,0.00026035443,0.00041906786,0.00041235363,0.0005507115],"domain_scores_gemma":[0.99700075,0.0021149947,0.00022857531,0.00029928496,0.000064162115,0.00029223843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010645005,0.00036694354,0.00042557652,0.00008709253,0.0002740468,0.00013992049,0.00037126715,0.00038311537,0.0007662609],"category_scores_gemma":[0.000980675,0.00034029633,0.000166992,0.00004432545,0.000582158,0.000060793845,0.00012763613,0.00039550534,0.00011541702],"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.000027517688,0.000013299368,0.000010854208,0.000024051536,0.000075681564,0.000007269421,0.0010135071,0.000010238173,0.000005953588,0.5681402,0.0004890918,0.4301823],"study_design_scores_gemma":[0.00006667785,0.000028243205,0.00010307365,0.0005237178,0.00010376329,0.000003940707,0.00021479305,0.000011477449,0.00014255127,0.061685458,0.93659407,0.00052225194],"about_ca_topic_score_codex":0.000013051854,"about_ca_topic_score_gemma":0.000019967876,"teacher_disagreement_score":0.93610495,"about_ca_system_score_codex":0.00013581332,"about_ca_system_score_gemma":0.00010614438,"threshold_uncertainty_score":0.99990493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007877419,0.00039843356,0.95134306,0.0011869365,0.0018336291,0.0017661409,0.0018079717,0.0026101423,0.038265962],"genre_scores_gemma":[0.9043896,0.000013020427,0.027040822,0.0032388165,0.0069660335,0.0001480291,0.005144001,0.00068393105,0.052375726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98950374,0.0016015529,0.0021601731,0.0034688863,0.0012732857,0.0019923376],"domain_scores_gemma":[0.9744035,0.018493893,0.0020107676,0.0041000983,0.0005106089,0.00048114138],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0071540256,0.0017700352,0.0020691545,0.0005415542,0.0016362092,0.00093919726,0.0054252753,0.0010774066,0.000011953059],"category_scores_gemma":[0.004939905,0.0015993137,0.001396431,0.0006493394,0.00040753194,0.000035033852,0.0021564467,0.0016547852,0.00009943255],"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.0010444853,0.000569167,0.000007756288,0.0009877717,0.001374722,0.00007644702,0.0006430208,0.16304517,0.000018768666,0.21703252,0.2996885,0.3155117],"study_design_scores_gemma":[0.0024826007,0.00078451145,0.00029829165,0.0030482241,0.0004936722,0.000052138206,0.000040361138,0.5071813,0.00081162946,0.17971513,0.30162293,0.0034692609],"about_ca_topic_score_codex":0.000009202014,"about_ca_topic_score_gemma":0.0000049023406,"teacher_disagreement_score":0.9243022,"about_ca_system_score_codex":0.0012401287,"about_ca_system_score_gemma":0.00050050527,"threshold_uncertainty_score":0.99995583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035113004,0.00018681335,0.8386906,0.00009375928,0.0009669242,0.00028170517,0.00006847609,0.0007237086,0.1589529],"genre_scores_gemma":[0.5427616,0.00014892484,0.3826939,0.0037557455,0.0025255205,0.00009770598,0.00044152568,0.00069458963,0.06688044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962931,0.0004953015,0.00068400335,0.0011628465,0.0007388623,0.000625879],"domain_scores_gemma":[0.9943799,0.0024908746,0.00075515,0.0020549349,0.00013979775,0.00017936526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021626272,0.0007618486,0.00075308594,0.00031678367,0.0004010218,0.0003267307,0.002620743,0.00056058733,0.00012612987],"category_scores_gemma":[0.001412371,0.00073190377,0.0003602414,0.00012459596,0.0001642051,0.00010128808,0.0006212302,0.0008864604,0.0004367016],"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.000034393204,0.00001710893,9.1211473e-7,0.000047289603,0.00012377242,0.000009730714,0.00004631753,0.001600505,0.00003799212,0.8161931,0.0010917215,0.18079716],"study_design_scores_gemma":[0.0003705118,0.00026593998,0.00014344872,0.0017699644,0.00017373747,0.00006593555,0.0000052815867,0.04335243,0.013767567,0.7103975,0.2274624,0.002225308],"about_ca_topic_score_codex":0.0000018541101,"about_ca_topic_score_gemma":3.789998e-7,"teacher_disagreement_score":0.5427265,"about_ca_system_score_codex":0.0003780983,"about_ca_system_score_gemma":0.00009264029,"threshold_uncertainty_score":0.9995132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004859692,0.0011187717,0.7592539,0.00041899877,0.0005566028,0.00031798598,0.00007998897,0.0008625635,0.23738632],"genre_scores_gemma":[0.81525093,0.0007023331,0.05599596,0.0059784423,0.0038590508,0.00008499638,0.0008057331,0.00082643656,0.116496116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967118,0.00034315255,0.0005433766,0.0008745768,0.00071731175,0.0008098013],"domain_scores_gemma":[0.99528456,0.0024591314,0.00041477714,0.0013693158,0.00018113827,0.0002910576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014312398,0.00067178824,0.00063047005,0.00036178148,0.0004812182,0.00037119968,0.0019682571,0.0005118059,0.0006154264],"category_scores_gemma":[0.00053972134,0.0006095496,0.00035564599,0.00014907517,0.00014398954,0.00014322491,0.0006400242,0.00096925104,0.0005469695],"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.000018170884,0.000035277182,0.0000013854225,0.00003378123,0.00013504911,0.000015163087,0.00012296622,0.004879784,0.000011215765,0.8064903,0.0027357833,0.18552114],"study_design_scores_gemma":[0.00046193245,0.0001844366,0.000060663046,0.001703273,0.00017361584,0.00008298215,0.000012983374,0.044329844,0.002284344,0.5916538,0.35637465,0.0026774472],"about_ca_topic_score_codex":0.0000016479081,"about_ca_topic_score_gemma":7.483783e-7,"teacher_disagreement_score":0.81524605,"about_ca_system_score_codex":0.00023053985,"about_ca_system_score_gemma":0.00014006936,"threshold_uncertainty_score":0.9996356},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092142494,0.0010598637,0.7893198,0.00061284,0.004472403,0.0008978185,0.0019346045,0.0037674594,0.19784303],"genre_scores_gemma":[0.11557174,0.00026368178,0.0031981163,0.0022454483,0.0042836145,0.00020474449,0.0034231937,0.0007948128,0.87001467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99367326,0.00086991134,0.0010710303,0.0019227612,0.0012151737,0.0012478636],"domain_scores_gemma":[0.9907748,0.0053547947,0.00084123254,0.0024557745,0.00025845531,0.00031493098],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002342366,0.0011288025,0.0013590603,0.00047373743,0.00083568576,0.00069964596,0.0036655,0.0010020905,0.00010860171],"category_scores_gemma":[0.0014806357,0.0010340203,0.0006793209,0.00076481426,0.00016330347,0.00018824877,0.0011285727,0.0014071884,0.0019368525],"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.00014003018,0.0001522077,0.0000024317528,0.00026213846,0.00044769744,0.00033304124,0.0002510104,0.0069961324,0.00004712138,0.31885096,0.52852434,0.14399293],"study_design_scores_gemma":[0.0007254211,0.00033596685,0.00012694442,0.004709594,0.0001674636,0.00010946812,0.000032315827,0.03582197,0.0010860784,0.36179468,0.59207964,0.0030104858],"about_ca_topic_score_codex":0.000009657729,"about_ca_topic_score_gemma":0.0000058017245,"teacher_disagreement_score":0.7861217,"about_ca_system_score_codex":0.00085679727,"about_ca_system_score_gemma":0.0006651071,"threshold_uncertainty_score":0.999211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007691881,0.00038877898,0.94266504,0.0005212375,0.00093974674,0.0005736755,0.002571193,0.007636225,0.044696383],"genre_scores_gemma":[0.114700474,0.0010436765,0.788525,0.004263485,0.0023336858,0.00033272503,0.0056846463,0.00212501,0.080991305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948629,0.00028470292,0.0009429926,0.0018952452,0.00096586096,0.0010482699],"domain_scores_gemma":[0.98983145,0.0055050706,0.00093159685,0.0033050359,0.00022195543,0.00020491488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012210845,0.0011820561,0.0013881706,0.0006169524,0.00062706845,0.00033084152,0.004424606,0.0008217917,0.00011819849],"category_scores_gemma":[0.0020583402,0.0010978995,0.0004947307,0.00037869526,0.0011583443,0.00016355907,0.002312376,0.001634805,0.0007012943],"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.00003094309,0.000027419948,2.5320796e-7,0.000027699525,0.00021822998,0.0002833528,0.000025250092,0.00031300756,0.00001530372,0.7314507,0.0037273255,0.26388055],"study_design_scores_gemma":[0.0002683823,0.00011223002,0.00001579457,0.00063267426,0.00008785103,0.00006102673,0.000017773664,0.009958175,0.0014452433,0.9675218,0.018620674,0.0012583626],"about_ca_topic_score_codex":0.0000055764967,"about_ca_topic_score_gemma":0.000004840914,"teacher_disagreement_score":0.26262218,"about_ca_system_score_codex":0.00048725627,"about_ca_system_score_gemma":0.00020816056,"threshold_uncertainty_score":0.9991471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046908786,0.0013948276,0.6914362,0.0039411034,0.0022646664,0.0027527967,0.0021829144,0.0027454642,0.29323518],"genre_scores_gemma":[0.56151265,0.0005692726,0.0050662267,0.0020857418,0.0017614618,0.000352714,0.0016985923,0.0009939221,0.4259594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958447,0.0003194568,0.00079219416,0.0016594038,0.00066102453,0.00072321284],"domain_scores_gemma":[0.9955275,0.0017150532,0.00065928354,0.0016719755,0.00014168936,0.00028446724],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017620238,0.0008865062,0.0011459921,0.00026060417,0.0006504072,0.0013156331,0.0036331778,0.00060176424,0.00004896422],"category_scores_gemma":[0.00046357748,0.0006082511,0.00026317057,0.00023323302,0.0001976649,0.0002196052,0.002410263,0.0008552113,0.000264053],"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.00004259769,0.000040108192,0.0000027765007,0.00013280429,0.00020388897,0.00006944775,0.00016028868,0.0007280511,0.0000184756,0.82225376,0.010454182,0.16589358],"study_design_scores_gemma":[0.0006056529,0.00023881465,0.00023472463,0.005595225,0.00012564116,0.00008532781,0.000031384192,0.010546432,0.00024852375,0.7471002,0.23313127,0.0020567912],"about_ca_topic_score_codex":0.000014658455,"about_ca_topic_score_gemma":0.00000926476,"teacher_disagreement_score":0.6863699,"about_ca_system_score_codex":0.0001605969,"about_ca_system_score_gemma":0.00014585379,"threshold_uncertainty_score":0.9997211},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007998526,0.00042314533,0.004148308,0.0014102184,0.006851338,0.002102941,0.002991413,0.0052520134,0.9688221],"genre_scores_gemma":[0.7347142,0.000110960944,0.000049311864,0.0029808732,0.0010185568,0.000035700265,0.00012507587,0.00047209015,0.26049325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956521,0.00057490973,0.00060240505,0.0015293274,0.0008482157,0.00079303875],"domain_scores_gemma":[0.99014133,0.007940741,0.00048167404,0.001123376,0.000056649627,0.00025620544],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00089108804,0.0009129426,0.0008523614,0.00035225193,0.00069453917,0.00014262403,0.0011847026,0.00061979756,0.0011458845],"category_scores_gemma":[0.003629977,0.00080465566,0.00088680786,0.00015167653,0.00029134448,0.000042026026,0.00036730664,0.0012623077,0.0022348524],"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.0007725197,0.000117197764,1.314844e-7,0.0002443198,0.0002691196,0.0010222018,0.00021174751,0.0036247433,0.045034464,0.8663583,0.008748008,0.07359726],"study_design_scores_gemma":[0.00025613254,0.0003186094,0.0000029177625,0.0010959374,0.00029361615,0.00012924527,0.00003948893,0.0006917975,0.70689493,0.28125402,0.0076495693,0.0013737252],"about_ca_topic_score_codex":6.1501527e-7,"about_ca_topic_score_gemma":8.05639e-7,"teacher_disagreement_score":0.7267157,"about_ca_system_score_codex":0.00019171028,"about_ca_system_score_gemma":0.00008431457,"threshold_uncertainty_score":0.9997672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029536104,0.0008983846,0.7029294,0.0007763327,0.0025043534,0.0009021309,0.001349441,0.005802964,0.28480744],"genre_scores_gemma":[0.9118855,0.00005967253,0.0017962568,0.00076440064,0.0016699766,0.000121284625,0.00077482994,0.00060601,0.08232207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940075,0.0004606375,0.00121796,0.0019319877,0.0012437993,0.0011380807],"domain_scores_gemma":[0.9903883,0.0052881544,0.0009916432,0.0026779699,0.00030334748,0.0003506198],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0018395835,0.0013097265,0.0015448094,0.00050354324,0.00070755096,0.0007401829,0.003653653,0.00096536626,0.000052621563],"category_scores_gemma":[0.00089821225,0.0011820884,0.00079926586,0.0003690117,0.00017853329,0.00014526611,0.0007830871,0.0012408062,0.001694591],"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.00004795069,0.000028429367,0.0000016353127,0.00027208548,0.00041133253,0.0003233303,0.00007496569,0.0030481752,0.000008721814,0.94311506,0.0254099,0.027258398],"study_design_scores_gemma":[0.001051299,0.00039194024,0.00021982501,0.0149984835,0.00049664447,0.0003237892,0.0001561334,0.039054383,0.0015032873,0.32070878,0.6152214,0.005874071],"about_ca_topic_score_codex":0.000019199804,"about_ca_topic_score_gemma":0.00000985073,"teacher_disagreement_score":0.91185594,"about_ca_system_score_codex":0.0005493745,"about_ca_system_score_gemma":0.0002352152,"threshold_uncertainty_score":0.9999654},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009648411,0.0011829339,0.5851729,0.0006551038,0.0040265205,0.00095022214,0.002230737,0.0035100977,0.402175],"genre_scores_gemma":[0.33108243,0.00064378174,0.0045771166,0.002368519,0.0035443052,0.00016598534,0.0025886132,0.001062263,0.65396696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944113,0.0003587573,0.0010798165,0.0018583034,0.0011454815,0.0011463352],"domain_scores_gemma":[0.9928045,0.0034186186,0.0008387301,0.0023353249,0.00028881527,0.000313999],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019708697,0.0011358619,0.0013226537,0.0004325275,0.0008478165,0.0006343616,0.002907572,0.00093982904,0.00023657756],"category_scores_gemma":[0.00082260655,0.0010535687,0.0006267115,0.00041418802,0.00015555207,0.00020544276,0.00090334646,0.0012680164,0.0017874901],"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.00009772625,0.000068375964,0.000002121737,0.00012271697,0.0003263373,0.00019123161,0.00011689631,0.0050509977,0.00005397115,0.85486495,0.053208593,0.085896105],"study_design_scores_gemma":[0.000636383,0.00029142632,0.00010769311,0.003922519,0.00017196844,0.000094772964,0.000024740628,0.024689872,0.0013461146,0.45515442,0.5107117,0.002848355],"about_ca_topic_score_codex":0.000020609265,"about_ca_topic_score_gemma":0.000009836331,"teacher_disagreement_score":0.5805958,"about_ca_system_score_codex":0.00042491584,"about_ca_system_score_gemma":0.00029640622,"threshold_uncertainty_score":0.99919146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060251572,0.0011830827,0.7198936,0.0010365231,0.0035245966,0.0010015976,0.0012164044,0.004488643,0.26759532],"genre_scores_gemma":[0.5796927,0.00023133136,0.0055528153,0.0024812643,0.0037322685,0.0001912929,0.0013432999,0.0011411388,0.40563387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476856,0.00033294104,0.0010148112,0.0017682032,0.0010598534,0.0010556186],"domain_scores_gemma":[0.9921602,0.0040090387,0.0008041306,0.0024751602,0.0002363699,0.00031511803],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016212119,0.0011454576,0.0012778788,0.00040567206,0.00062466424,0.00060870737,0.0033824635,0.00089233863,0.00012435396],"category_scores_gemma":[0.00086235406,0.0010423479,0.0007141577,0.00048204308,0.00020620473,0.000112518675,0.0007788343,0.0012849764,0.0019780821],"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.00007005452,0.00004349248,0.0000023126997,0.00007897535,0.00033497097,0.00019622706,0.000095604526,0.0015195927,0.0000056659446,0.80468476,0.027498433,0.1654699],"study_design_scores_gemma":[0.0007339466,0.00024913423,0.00051155017,0.006814455,0.00026976378,0.000090445494,0.000024145022,0.0046923384,0.00069394434,0.5311378,0.45067573,0.0041067046],"about_ca_topic_score_codex":0.000004146145,"about_ca_topic_score_gemma":0.0000022386719,"teacher_disagreement_score":0.71434075,"about_ca_system_score_codex":0.000314922,"about_ca_system_score_gemma":0.00021240236,"threshold_uncertainty_score":0.99920267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006449965,0.0011829613,0.52243507,0.0010686226,0.0056405035,0.0008702663,0.0016563516,0.0038790852,0.46320263],"genre_scores_gemma":[0.58066857,0.0002128301,0.0021686538,0.0037579464,0.004908585,0.0001513341,0.0015366015,0.0011124782,0.40548298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947743,0.0002458024,0.0009920229,0.0018010894,0.0011153959,0.0010714318],"domain_scores_gemma":[0.99322516,0.0029317387,0.0007802647,0.002512017,0.00028349765,0.0002673379],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014653375,0.0011841654,0.0012625965,0.0004383625,0.00064535445,0.00083559786,0.0032814764,0.00091630546,0.00020888857],"category_scores_gemma":[0.00068567594,0.0010699255,0.00075221545,0.00035687978,0.00026388836,0.00016762136,0.0007545343,0.0012478337,0.002589434],"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.000060924922,0.000058482237,9.592114e-7,0.000086339765,0.00032583685,0.00030410956,0.000050161085,0.0008799156,0.000016367403,0.91680574,0.04173575,0.039675392],"study_design_scores_gemma":[0.0003832373,0.00017623283,0.0000922601,0.0023312825,0.00014433815,0.00007732384,0.000008280985,0.005966973,0.0004370647,0.48985684,0.49831587,0.0022102897],"about_ca_topic_score_codex":0.000007919866,"about_ca_topic_score_gemma":0.0000062281993,"teacher_disagreement_score":0.5806041,"about_ca_system_score_codex":0.0003322371,"about_ca_system_score_gemma":0.00024167699,"threshold_uncertainty_score":0.9991751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005169806,0.0016323654,0.9174779,0.00090723805,0.0017243177,0.00073366193,0.001972167,0.002399082,0.07310159],"genre_scores_gemma":[0.82214266,0.0003432247,0.016068596,0.004631578,0.0037174213,0.00023808276,0.001891613,0.0013645405,0.14960231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995438,0.0002965505,0.0007514198,0.0016330064,0.0010728925,0.00080815965],"domain_scores_gemma":[0.9937819,0.0033551264,0.00059128145,0.0016717659,0.00029097594,0.00030892505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016882948,0.0009964006,0.0010959062,0.0003006869,0.00052323245,0.0005132645,0.0018074061,0.0007350331,0.000054327385],"category_scores_gemma":[0.00070466194,0.0009082919,0.00039893572,0.00025001305,0.00025843133,0.00010032647,0.00050229864,0.0009733719,0.00027169858],"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.00007769268,0.000058878886,0.0000036819738,0.00019819633,0.00034093758,0.0002850075,0.00012645943,0.002533987,0.000018062588,0.7532778,0.013846713,0.22923262],"study_design_scores_gemma":[0.0017539823,0.0005806967,0.0005857044,0.007345405,0.00040870742,0.00016390179,0.000048283542,0.1976446,0.0012044222,0.39781833,0.3869047,0.0055412897],"about_ca_topic_score_codex":0.000013105633,"about_ca_topic_score_gemma":0.0000061275146,"teacher_disagreement_score":0.90140927,"about_ca_system_score_codex":0.00037089924,"about_ca_system_score_gemma":0.00035698124,"threshold_uncertainty_score":0.9993368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021719568,0.00033443706,0.74604964,0.00050203566,0.0011294626,0.00078682456,0.0008276517,0.0025478029,0.24780041],"genre_scores_gemma":[0.79795474,0.00012360128,0.0075727687,0.0011872661,0.0021294774,0.00016602258,0.0020714658,0.0007238402,0.18807083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569416,0.00023290727,0.00094172085,0.0013919208,0.00091853377,0.0008207594],"domain_scores_gemma":[0.9946009,0.00242736,0.00079814054,0.0017016773,0.0002550073,0.00021693339],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014399443,0.0009107196,0.0009621698,0.0003849974,0.0005234666,0.0004903726,0.002139551,0.0007432276,0.000067024615],"category_scores_gemma":[0.00041500764,0.0008297779,0.00052869646,0.00030192223,0.00009343913,0.00016636956,0.0005013473,0.0008932345,0.0009374692],"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.00003463819,0.000029174926,0.0000012614864,0.00009355197,0.00017979262,0.000057052217,0.000080691374,0.0033398217,0.000014985927,0.8783638,0.0090455115,0.1087597],"study_design_scores_gemma":[0.00036771322,0.00016390678,0.0001261966,0.0024018402,0.00011146465,0.000047003537,0.000009936965,0.020982001,0.0005501856,0.81723034,0.1562861,0.0017232907],"about_ca_topic_score_codex":0.000006355166,"about_ca_topic_score_gemma":0.0000044933063,"teacher_disagreement_score":0.797933,"about_ca_system_score_codex":0.00030861105,"about_ca_system_score_gemma":0.00016647676,"threshold_uncertainty_score":0.99984044},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020829508,0.00080266164,0.7948292,0.00077089,0.0030526365,0.0008014617,0.0020146202,0.0036843726,0.19402331],"genre_scores_gemma":[0.416097,0.00056621537,0.013462189,0.004007679,0.0070102643,0.0003574361,0.0039490145,0.0019753785,0.5525748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440855,0.00035120625,0.0010582746,0.0019188668,0.0011342502,0.0011288624],"domain_scores_gemma":[0.9927277,0.0034303053,0.0007996167,0.0024218245,0.00029028315,0.00033027053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001759442,0.0012230424,0.0013574866,0.00049995445,0.00061236374,0.0006175353,0.003512105,0.0009893049,0.00011908038],"category_scores_gemma":[0.0006936364,0.0011329101,0.00073613564,0.00037717394,0.00024328739,0.00013835351,0.0007983749,0.0014138381,0.0016566509],"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.000036374593,0.000048995083,0.0000010893128,0.00008189489,0.00037353174,0.00029162335,0.00007464169,0.0014048334,0.000012386847,0.8442473,0.017916726,0.13551064],"study_design_scores_gemma":[0.0007634566,0.0003058722,0.00018560833,0.00340778,0.00024469206,0.00020184646,0.000026604388,0.035037164,0.00093307334,0.65464497,0.30053464,0.003714316],"about_ca_topic_score_codex":0.00001223117,"about_ca_topic_score_gemma":0.0000049820796,"teacher_disagreement_score":0.781367,"about_ca_system_score_codex":0.00035801806,"about_ca_system_score_gemma":0.00024676087,"threshold_uncertainty_score":0.99912065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059213994,0.00064927695,0.7976982,0.0003865467,0.0019763424,0.00058829226,0.0017738263,0.002435561,0.19448604],"genre_scores_gemma":[0.5126136,0.00041836232,0.017866114,0.0033930829,0.006387855,0.00033288135,0.0024641987,0.0017689727,0.45475495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464625,0.00036258265,0.0009724073,0.0018562552,0.0011182382,0.0010442379],"domain_scores_gemma":[0.9926588,0.0037309127,0.0008131996,0.002170595,0.000306375,0.00032012846],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015282135,0.0011935089,0.0013165579,0.00043092648,0.0005788245,0.00047313923,0.003135434,0.0008819909,0.00009635769],"category_scores_gemma":[0.0005803194,0.0010934965,0.0007163181,0.00036040662,0.00023841481,0.00013706267,0.00076420844,0.0013146271,0.0015589485],"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.00005259784,0.000040978717,3.9286428e-7,0.000044705394,0.00039774954,0.0002301598,0.0000907343,0.0020877745,0.0000055612577,0.82526356,0.0151329925,0.1566528],"study_design_scores_gemma":[0.0006460039,0.0004302511,0.00011522081,0.003759858,0.00023837117,0.00012624318,0.00004856657,0.0563531,0.00073175103,0.7678054,0.16623178,0.0035134407],"about_ca_topic_score_codex":0.000010405909,"about_ca_topic_score_gemma":0.0000038957114,"teacher_disagreement_score":0.77983207,"about_ca_system_score_codex":0.00036115595,"about_ca_system_score_gemma":0.00023536343,"threshold_uncertainty_score":0.99921846},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020543584,0.0005620029,0.81224686,0.0030812519,0.0049356017,0.00066050724,0.00097235036,0.0036682785,0.17385261],"genre_scores_gemma":[0.3060545,0.00033880206,0.0048313504,0.0022355986,0.01955742,0.00018877411,0.0030482463,0.0011907835,0.6625545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955177,0.0002929019,0.0008489322,0.0016759913,0.000873826,0.0007906892],"domain_scores_gemma":[0.99471927,0.0019597788,0.0006853629,0.0021716063,0.00024633307,0.00021765218],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015328607,0.0009131327,0.0009977767,0.00040454045,0.0004966811,0.00046786442,0.0022386438,0.00070643343,0.00018168808],"category_scores_gemma":[0.0008578882,0.000847666,0.0005236988,0.00032204404,0.00016771909,0.00013294657,0.0005001073,0.001077114,0.0019939377],"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.000038215232,0.000030306872,3.806914e-7,0.0000614495,0.00023042459,0.000070536626,0.000050609404,0.0021862749,0.000020693724,0.83681273,0.078243405,0.08225496],"study_design_scores_gemma":[0.00027980606,0.00015387495,0.00006941687,0.0010714934,0.00012328754,0.00008557212,0.000013577287,0.0070667462,0.0008952401,0.38755578,0.6009821,0.001703087],"about_ca_topic_score_codex":0.0000044676904,"about_ca_topic_score_gemma":0.0000025130105,"teacher_disagreement_score":0.8074155,"about_ca_system_score_codex":0.0003150048,"about_ca_system_score_gemma":0.00014675212,"threshold_uncertainty_score":0.9993974},"labels":[],"label_agreement":null}]}