{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"8a0651cf6f4f","filters":{"venue":"Synthesis lectures on distributed computing theory"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Mobile robot; Robotics; Robot; Artificial intelligence; Distributed computing; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.01118725042215,"gpt":0.2538542189076905,"spread":0.2426669684855405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002381861,0.000580209,0.000581112,0.000228337,0.0008789849,0.0005149517,0.00189891,0.0002610869,0.0001213663],"category_scores_gemma":[0.001191908,0.0005245631,0.0002535307,0.001191539,0.0001817766,0.0003922298,0.0006739539,0.0006520518,0.0001764764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002714751,"about_ca_system_score_gemma":0.00008779723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268366,"about_ca_topic_score_gemma":7.189345e-7,"domain_scores_codex":[0.9947594,0.001374896,0.0006749162,0.000852093,0.0007488757,0.001589846],"domain_scores_gemma":[0.9943663,0.003378731,0.0003642892,0.001145264,0.000201746,0.0005436568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001692004,0.002355155,0.001598406,0.0001414478,0.0005165609,0.00003181702,0.002486845,0.4552949,0.002142116,0.1756277,0.05642716,0.3032086],"study_design_scores_gemma":[0.002211187,0.0007209655,0.005480874,0.0007357742,0.0001602914,0.0001850366,0.00048695,0.8843901,0.05185901,0.01544295,0.03428577,0.004041072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01320329,0.0008867284,0.9818522,0.0004404587,0.00061876,0.0005422882,0.0002306137,0.001291894,0.0009337459],"genre_scores_gemma":[0.9898599,0.00001917458,0.008726035,0.0007384748,0.0002271854,0.0000333243,0.0002954233,0.00005514934,0.00004526603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766567,"threshold_uncertainty_score":0.9997206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009257801723203448,"gpt":0.2502785384484939,"spread":0.2410207367252905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004159677,0.0002301541,0.0001794315,0.000100268,0.0009134074,0.0006755745,0.002557836,0.0001035571,0.00002092691],"category_scores_gemma":[0.001003869,0.000128125,0.0001110404,0.0006783449,0.0001628494,0.00009406786,0.0003017921,0.0008692647,0.00003489634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000536243,"about_ca_system_score_gemma":0.00008089968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000122389,"about_ca_topic_score_gemma":0.00003338343,"domain_scores_codex":[0.9969621,0.001109352,0.0003613434,0.0004675273,0.0004910581,0.0006086201],"domain_scores_gemma":[0.9936168,0.004977156,0.0001486355,0.001097556,0.00007914006,0.00008068337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000411558,0.0002167396,0.00008601043,0.00001599602,0.00004111373,0.00002453884,0.002152017,0.05937321,0.0004858601,0.6204184,0.001554251,0.3155907],"study_design_scores_gemma":[0.001136297,0.0004409212,0.006227405,0.0002987187,0.00003846196,0.0001645155,0.001076589,0.509304,0.01156768,0.3789071,0.0893532,0.001485139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03099917,0.000312587,0.9498494,0.005410093,0.0008608391,0.001436271,0.00002093432,0.0006379668,0.01047269],"genre_scores_gemma":[0.9937104,0.00001703524,0.005490917,0.0005252968,0.00009079885,0.0001078325,0.000006198576,0.00001598098,0.00003555527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9627112,"threshold_uncertainty_score":0.7025284,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Impossibility; Computer science; Distributed computing; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01218715117223645,"gpt":0.2546020771523029,"spread":0.2424149259800665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005930768,0.0007940175,0.001046573,0.0001928962,0.001178049,0.0007087586,0.002731848,0.0003761682,0.000007092546],"category_scores_gemma":[0.007927983,0.0006994369,0.0005596271,0.001003817,0.0002244879,0.0002355847,0.0004846261,0.0005714851,0.00004901411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003052618,"about_ca_system_score_gemma":0.0001376173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000221089,"about_ca_topic_score_gemma":0.000005818262,"domain_scores_codex":[0.9930766,0.00145063,0.001423387,0.001892544,0.0007055207,0.001451287],"domain_scores_gemma":[0.98616,0.009830131,0.0008328009,0.002326449,0.0004605113,0.0003900829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001532398,0.0009847136,0.0003150862,0.0003666904,0.0004704814,0.00002547809,0.0008626253,0.06135841,0.001093111,0.5254176,0.02795085,0.3796225],"study_design_scores_gemma":[0.003732617,0.0006986086,0.009232253,0.0008761833,0.0001153396,0.00006417121,0.0001290016,0.8343353,0.01672064,0.08597296,0.04588002,0.002242874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02061599,0.0001290292,0.9715298,0.001094801,0.001072497,0.0008384692,0.002096669,0.001338885,0.001283846],"genre_scores_gemma":[0.9882842,0.000001935245,0.009931463,0.0005328055,0.0005336903,0.00004367559,0.0005931309,0.00005204286,0.00002711016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9676682,"threshold_uncertainty_score":0.9995457,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Computer science; Distributed computing; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01257254796326442,"gpt":0.2417935549493368,"spread":0.2292210069860724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.007154026,0.001770035,0.002069155,0.0005415542,0.001636209,0.0009391973,0.005425275,0.001077407,0.00001195306],"category_scores_gemma":[0.004939905,0.001599314,0.001396431,0.0006493394,0.0004075319,0.00003503385,0.002156447,0.001654785,0.00009943255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240129,"about_ca_system_score_gemma":0.0005005053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009202014,"about_ca_topic_score_gemma":0.000004902341,"domain_scores_codex":[0.9895037,0.001601553,0.002160173,0.003468886,0.001273286,0.001992338],"domain_scores_gemma":[0.9744035,0.01849389,0.002010768,0.004100098,0.0005106089,0.0004811414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001044485,0.000569167,0.000007756288,0.0009877717,0.001374722,0.00007644702,0.0006430208,0.1630452,0.00001876867,0.2170325,0.2996885,0.3155117],"study_design_scores_gemma":[0.002482601,0.0007845114,0.0002982916,0.003048224,0.0004936722,0.00005213821,0.00004036114,0.5071813,0.0008116295,0.1797151,0.3016229,0.003469261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007877419,0.0003984336,0.9513431,0.001186937,0.001833629,0.001766141,0.001807972,0.002610142,0.03826596],"genre_scores_gemma":[0.9043896,0.00001302043,0.02704082,0.003238817,0.006966033,0.0001480291,0.005144001,0.0006839311,0.05237573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9243022,"threshold_uncertainty_score":0.9999558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Mutual exclusion; Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01359175138905108,"gpt":0.2350745560832588,"spread":0.2214828046942078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002342366,0.001128803,0.00135906,0.0004737374,0.0008356858,0.000699646,0.0036655,0.001002091,0.0001086017],"category_scores_gemma":[0.001480636,0.00103402,0.0006793209,0.0007648143,0.0001633035,0.0001882488,0.001128573,0.001407188,0.001936852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008567973,"about_ca_system_score_gemma":0.0006651071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009657729,"about_ca_topic_score_gemma":0.000005801724,"domain_scores_codex":[0.9936733,0.0008699113,0.00107103,0.001922761,0.001215174,0.001247864],"domain_scores_gemma":[0.9907748,0.005354795,0.0008412325,0.002455774,0.0002584553,0.000314931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001400302,0.0001522077,0.000002431753,0.0002621385,0.0004476974,0.0003330412,0.0002510104,0.006996132,0.00004712138,0.318851,0.5285243,0.1439929],"study_design_scores_gemma":[0.0007254211,0.0003359668,0.0001269444,0.004709594,0.0001674636,0.0001094681,0.00003231583,0.03582197,0.001086078,0.3617947,0.5920796,0.003010486],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00009214249,0.001059864,0.7893198,0.00061284,0.004472403,0.0008978185,0.001934604,0.003767459,0.197843],"genre_scores_gemma":[0.1155717,0.0002636818,0.003198116,0.002245448,0.004283614,0.0002047445,0.003423194,0.0007948128,0.8700147],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7861217,"threshold_uncertainty_score":0.999211,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01326650864660777,"gpt":0.2260198588641306,"spread":0.2127533502175229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003901446,0.001499976,0.001686161,0.0004576738,0.0007019864,0.0005875643,0.004926133,0.001030737,0.0003520866],"category_scores_gemma":[0.005651888,0.001396512,0.0009291613,0.0002764441,0.0005764884,0.00007931807,0.001995907,0.001863356,0.0004455213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007527799,"about_ca_system_score_gemma":0.0003090338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001054665,"about_ca_topic_score_gemma":0.000006165259,"domain_scores_codex":[0.9924366,0.001037003,0.001301313,0.002760018,0.001264849,0.001200194],"domain_scores_gemma":[0.9816549,0.0123156,0.001060339,0.004090849,0.0004572833,0.0004210497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004915262,0.00009681693,0.00001631326,0.0001210714,0.0002059957,0.00004879165,0.0001175568,0.001661152,0.00000553758,0.7156461,0.002516514,0.279515],"study_design_scores_gemma":[0.0003047339,0.0003040412,0.0006094354,0.0006861089,0.0001428614,0.00007286325,0.00000485766,0.01971968,0.0005125071,0.9037691,0.07180594,0.002067861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001499956,0.0003678948,0.8265127,0.0005243455,0.001556868,0.0007160698,0.000260238,0.002049403,0.1678625],"genre_scores_gemma":[0.9533052,0.00001895725,0.02782398,0.001985659,0.002857236,0.0000582487,0.0003385505,0.0004002714,0.01321187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9531552,"threshold_uncertainty_score":0.9997749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.07121839519085539,"gpt":0.2726603288641758,"spread":0.2014419336733205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000891088,0.0009129426,0.0008523614,0.0003522519,0.0006945392,0.000142624,0.001184703,0.0006197976,0.001145885],"category_scores_gemma":[0.003629977,0.0008046557,0.0008868079,0.0001516765,0.0002913445,0.00004202603,0.0003673066,0.001262308,0.002234852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001917103,"about_ca_system_score_gemma":0.00008431457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.150153e-7,"about_ca_topic_score_gemma":8.05639e-7,"domain_scores_codex":[0.9956521,0.0005749097,0.0006024051,0.001529327,0.0008482157,0.0007930388],"domain_scores_gemma":[0.9901413,0.007940741,0.000481674,0.001123376,0.00005664963,0.0002562054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007725197,0.0001171978,1.314844e-7,0.0002443198,0.0002691196,0.001022202,0.0002117475,0.003624743,0.04503446,0.8663583,0.008748008,0.07359726],"study_design_scores_gemma":[0.0002561325,0.0003186094,0.000002917762,0.001095937,0.0002936161,0.0001292453,0.00003948893,0.0006917975,0.7068949,0.281254,0.007649569,0.001373725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007998526,0.0004231453,0.004148308,0.001410218,0.006851338,0.002102941,0.002991413,0.005252013,0.9688221],"genre_scores_gemma":[0.7347142,0.0001109609,0.00004931186,0.002980873,0.001018557,0.00003570026,0.0001250759,0.0004720901,0.2604932],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7267157,"threshold_uncertainty_score":0.9997672,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01719796446084723,"gpt":0.2291635329587464,"spread":0.2119655684978991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001621212,0.001145458,0.001277879,0.0004056721,0.0006246642,0.0006087074,0.003382463,0.0008923386,0.000124354],"category_scores_gemma":[0.0008623541,0.001042348,0.0007141577,0.0004820431,0.0002062047,0.0001125187,0.0007788343,0.001284976,0.001978082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314922,"about_ca_system_score_gemma":0.0002124024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004146145,"about_ca_topic_score_gemma":0.000002238672,"domain_scores_codex":[0.9947686,0.000332941,0.001014811,0.001768203,0.001059853,0.001055619],"domain_scores_gemma":[0.9921602,0.004009039,0.0008041306,0.00247516,0.0002363699,0.000315118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007005452,0.00004349248,0.0000023127,0.00007897535,0.000334971,0.0001962271,0.00009560453,0.001519593,0.000005665945,0.8046848,0.02749843,0.1654699],"study_design_scores_gemma":[0.0007339466,0.0002491342,0.0005115502,0.006814455,0.0002697638,0.00009044549,0.00002414502,0.004692338,0.0006939443,0.5311378,0.4506757,0.004106705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00006025157,0.001183083,0.7198936,0.001036523,0.003524597,0.001001598,0.001216404,0.004488643,0.2675953],"genre_scores_gemma":[0.5796927,0.0002313314,0.005552815,0.002481264,0.003732268,0.0001912929,0.0013433,0.001141139,0.4056339],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7143407,"threshold_uncertainty_score":0.9992027,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Crash; Algorithm; Distributed computing; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02329756247213819,"gpt":0.2371842651728391,"spread":0.2138867027007009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001528213,0.001193509,0.001316558,0.0004309265,0.0005788245,0.0004731392,0.003135434,0.0008819909,0.00009635769],"category_scores_gemma":[0.0005803194,0.001093496,0.0007163181,0.0003604066,0.0002384148,0.0001370627,0.0007642084,0.001314627,0.001558949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000361156,"about_ca_system_score_gemma":0.0002353634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001040591,"about_ca_topic_score_gemma":0.000003895711,"domain_scores_codex":[0.9946463,0.0003625827,0.0009724073,0.001856255,0.001118238,0.001044238],"domain_scores_gemma":[0.9926588,0.003730913,0.0008131996,0.002170595,0.000306375,0.0003201285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005259784,0.00004097872,3.928643e-7,0.00004470539,0.0003977495,0.0002301598,0.0000907343,0.002087774,0.000005561258,0.8252636,0.01513299,0.1566528],"study_design_scores_gemma":[0.0006460039,0.0004302511,0.0001152208,0.003759858,0.0002383712,0.0001262432,0.00004856657,0.0563531,0.000731751,0.7678054,0.1662318,0.003513441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000005921399,0.0006492769,0.7976982,0.0003865467,0.001976342,0.0005882923,0.001773826,0.002435561,0.194486],"genre_scores_gemma":[0.5126136,0.0004183623,0.01786611,0.003393083,0.006387855,0.0003328813,0.002464199,0.001768973,0.4547549],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7798321,"threshold_uncertainty_score":0.9992185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Fetch; Computer science; Upper and lower bounds; Parallel computing; Algorithm; Mathematics; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01550364574922725,"gpt":0.230194060985531,"spread":0.2146904152363037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001465337,0.001184165,0.001262596,0.0004383625,0.0006453544,0.0008355979,0.003281476,0.0009163055,0.0002088886],"category_scores_gemma":[0.0006856759,0.001069925,0.0007522154,0.0003568798,0.0002638884,0.0001676214,0.0007545343,0.001247834,0.002589434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003322371,"about_ca_system_score_gemma":0.000241677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007919866,"about_ca_topic_score_gemma":0.000006228199,"domain_scores_codex":[0.9947743,0.0002458024,0.0009920229,0.001801089,0.001115396,0.001071432],"domain_scores_gemma":[0.9932252,0.002931739,0.0007802647,0.002512017,0.0002834976,0.0002673379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006092492,0.00005848224,9.592114e-7,0.00008633977,0.0003258369,0.0003041096,0.00005016108,0.0008799156,0.0000163674,0.9168057,0.04173575,0.03967539],"study_design_scores_gemma":[0.0003832373,0.0001762328,0.0000922601,0.002331282,0.0001443381,0.00007732384,0.000008280985,0.005966973,0.0004370647,0.4898568,0.4983159,0.00221029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00006449965,0.001182961,0.5224351,0.001068623,0.005640503,0.0008702663,0.001656352,0.003879085,0.4632026],"genre_scores_gemma":[0.5806686,0.0002128301,0.002168654,0.003757946,0.004908585,0.0001513341,0.001536601,0.001112478,0.405483],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5806041,"threshold_uncertainty_score":0.9991751,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03270902441127518,"gpt":0.2575149012246038,"spread":0.2248058768133286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001221085,0.001182056,0.001388171,0.0006169524,0.0006270685,0.0003308415,0.004424606,0.0008217917,0.0001181985],"category_scores_gemma":[0.00205834,0.0010979,0.0004947307,0.0003786953,0.001158344,0.0001635591,0.002312376,0.001634805,0.0007012943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004872563,"about_ca_system_score_gemma":0.0002081606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005576497,"about_ca_topic_score_gemma":0.000004840914,"domain_scores_codex":[0.9948629,0.0002847029,0.0009429926,0.001895245,0.000965861,0.00104827],"domain_scores_gemma":[0.9898314,0.005505071,0.0009315968,0.003305036,0.0002219554,0.0002049149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003094309,0.00002741995,2.53208e-7,0.00002769953,0.00021823,0.0002833528,0.00002525009,0.0003130076,0.00001530372,0.7314507,0.003727325,0.2638806],"study_design_scores_gemma":[0.0002683823,0.00011223,0.00001579457,0.0006326743,0.00008785103,0.00006102673,0.00001777366,0.009958175,0.001445243,0.9675218,0.01862067,0.001258363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000007691881,0.000388779,0.942665,0.0005212375,0.0009397467,0.0005736755,0.002571193,0.007636225,0.04469638],"genre_scores_gemma":[0.1147005,0.001043677,0.788525,0.004263485,0.002333686,0.000332725,0.005684646,0.00212501,0.08099131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2626222,"threshold_uncertainty_score":0.9991471,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01886671574293328,"gpt":0.2362235927124786,"spread":0.2173568769695453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001759442,0.001223042,0.001357487,0.0004999544,0.0006123637,0.0006175353,0.003512105,0.0009893049,0.0001190804],"category_scores_gemma":[0.0006936364,0.00113291,0.0007361356,0.0003771739,0.0002432874,0.0001383535,0.0007983749,0.001413838,0.001656651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003580181,"about_ca_system_score_gemma":0.0002467609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001223117,"about_ca_topic_score_gemma":0.00000498208,"domain_scores_codex":[0.9944085,0.0003512063,0.001058275,0.001918867,0.00113425,0.001128862],"domain_scores_gemma":[0.9927277,0.003430305,0.0007996167,0.002421824,0.0002902831,0.0003302705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003637459,0.00004899508,0.000001089313,0.00008189489,0.0003735317,0.0002916233,0.00007464169,0.001404833,0.00001238685,0.8442473,0.01791673,0.1355106],"study_design_scores_gemma":[0.0007634566,0.0003058722,0.0001856083,0.00340778,0.0002446921,0.0002018465,0.00002660439,0.03503716,0.0009330733,0.654645,0.3005346,0.003714316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00002082951,0.0008026616,0.7948292,0.00077089,0.003052637,0.0008014617,0.00201462,0.003684373,0.1940233],"genre_scores_gemma":[0.416097,0.0005662154,0.01346219,0.004007679,0.007010264,0.0003574361,0.003949014,0.001975378,0.5525748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.781367,"threshold_uncertainty_score":0.9991207,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01693060431566782,"gpt":0.2322325904871304,"spread":0.2153019861714626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001439944,0.0009107196,0.0009621698,0.0003849974,0.0005234666,0.0004903726,0.002139551,0.0007432276,0.00006702462],"category_scores_gemma":[0.0004150076,0.0008297779,0.0005286965,0.0003019222,0.00009343913,0.0001663696,0.0005013473,0.0008932345,0.0009374692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003086111,"about_ca_system_score_gemma":0.0001664768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006355166,"about_ca_topic_score_gemma":0.000004493306,"domain_scores_codex":[0.9956942,0.0002329073,0.0009417208,0.001391921,0.0009185338,0.0008207594],"domain_scores_gemma":[0.9946009,0.00242736,0.0007981405,0.001701677,0.0002550073,0.0002169334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003463819,0.00002917493,0.000001261486,0.00009355197,0.0001797926,0.00005705222,0.00008069137,0.003339822,0.00001498593,0.8783638,0.009045511,0.1087597],"study_design_scores_gemma":[0.0003677132,0.0001639068,0.0001261966,0.00240184,0.0001114647,0.00004700354,0.000009936965,0.020982,0.0005501856,0.8172303,0.1562861,0.001723291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00002171957,0.0003344371,0.7460496,0.0005020357,0.001129463,0.0007868246,0.0008276517,0.002547803,0.2478004],"genre_scores_gemma":[0.7979547,0.0001236013,0.007572769,0.001187266,0.002129477,0.0001660226,0.002071466,0.0007238402,0.1880708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.797933,"threshold_uncertainty_score":0.9998404,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Algorithm; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01668194475266698,"gpt":0.2302262427778367,"spread":0.2135442980251697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001688295,0.0009964006,0.001095906,0.0003006869,0.0005232324,0.0005132645,0.001807406,0.0007350331,0.00005432739],"category_scores_gemma":[0.0007046619,0.0009082919,0.0003989357,0.0002500131,0.0002584313,0.0001003265,0.0005022986,0.0009733719,0.0002716986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003708992,"about_ca_system_score_gemma":0.0003569812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001310563,"about_ca_topic_score_gemma":0.000006127515,"domain_scores_codex":[0.995438,0.0002965505,0.0007514198,0.001633006,0.001072892,0.0008081596],"domain_scores_gemma":[0.9937819,0.003355126,0.0005912815,0.001671766,0.0002909759,0.0003089251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007769268,0.00005887889,0.000003681974,0.0001981963,0.0003409376,0.0002850075,0.0001264594,0.002533987,0.00001806259,0.7532778,0.01384671,0.2292326],"study_design_scores_gemma":[0.001753982,0.0005806967,0.0005857044,0.007345405,0.0004087074,0.0001639018,0.00004828354,0.1976446,0.001204422,0.3978183,0.3869047,0.00554129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005169806,0.001632365,0.9174779,0.000907238,0.001724318,0.0007336619,0.001972167,0.002399082,0.07310159],"genre_scores_gemma":[0.8221427,0.0003432247,0.0160686,0.004631578,0.003717421,0.0002380828,0.001891613,0.001364541,0.1496023],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9014093,"threshold_uncertainty_score":0.9993368,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01606183671958233,"gpt":0.230215265144554,"spread":0.2141534284249717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00197087,0.001135862,0.001322654,0.0004325275,0.0008478165,0.0006343616,0.002907572,0.000939829,0.0002365776],"category_scores_gemma":[0.0008226066,0.001053569,0.0006267115,0.000414188,0.0001555521,0.0002054428,0.0009033465,0.001268016,0.00178749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004249158,"about_ca_system_score_gemma":0.0002964062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002060926,"about_ca_topic_score_gemma":0.000009836331,"domain_scores_codex":[0.9944113,0.0003587573,0.001079816,0.001858303,0.001145481,0.001146335],"domain_scores_gemma":[0.9928045,0.003418619,0.0008387301,0.002335325,0.0002888153,0.000313999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009772625,0.00006837596,0.000002121737,0.000122717,0.0003263373,0.0001912316,0.0001168963,0.005050998,0.00005397115,0.854865,0.05320859,0.0858961],"study_design_scores_gemma":[0.000636383,0.0002914263,0.0001076931,0.003922519,0.0001719684,0.00009477296,0.00002474063,0.02468987,0.001346115,0.4551544,0.5107117,0.002848355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00009648411,0.001182934,0.5851729,0.0006551038,0.004026521,0.0009502221,0.002230737,0.003510098,0.402175],"genre_scores_gemma":[0.3310824,0.0006437817,0.004577117,0.002368519,0.003544305,0.0001659853,0.002588613,0.001062263,0.653967],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5805958,"threshold_uncertainty_score":0.9991915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01736741323199327,"gpt":0.251215567287363,"spread":0.2338481540553697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001064501,0.0003669435,0.0004255765,0.00008709253,0.0002740468,0.0001399205,0.0003712671,0.0003831154,0.0007662609],"category_scores_gemma":[0.000980675,0.0003402963,0.000166992,0.00004432545,0.000582158,0.00006079385,0.0001276361,0.0003955053,0.000115417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001358133,"about_ca_system_score_gemma":0.0001061444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001305185,"about_ca_topic_score_gemma":0.00001996788,"domain_scores_codex":[0.998203,0.0001545129,0.0002603544,0.0004190679,0.0004123536,0.0005507115],"domain_scores_gemma":[0.9970008,0.002114995,0.0002285753,0.000299285,0.00006416212,0.0002922384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002751769,0.00001329937,0.00001085421,0.00002405154,0.00007568156,0.000007269421,0.001013507,0.00001023817,0.000005953588,0.5681402,0.0004890918,0.4301823],"study_design_scores_gemma":[0.00006667785,0.0000282432,0.0001030737,0.0005237178,0.0001037633,0.000003940707,0.000214793,0.00001147745,0.0001425513,0.06168546,0.9365941,0.0005222519],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0007021327,0.00376785,0.001580745,0.0002295491,0.0007309848,0.0002824483,0.000178323,0.0002940984,0.9922339],"genre_scores_gemma":[0.8713461,0.0008505008,0.0001058483,0.0003656349,0.001204751,0.000007219522,0.00004602623,0.00009595868,0.125978],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.936105,"threshold_uncertainty_score":0.9999049,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01971622825857412,"gpt":0.238038602137131,"spread":0.2183223738785569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00143124,0.0006717882,0.0006304701,0.0003617815,0.0004812182,0.0003711997,0.001968257,0.0005118059,0.0006154264],"category_scores_gemma":[0.0005397213,0.0006095496,0.000355646,0.0001490752,0.0001439895,0.0001432249,0.0006400242,0.000969251,0.0005469695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002305399,"about_ca_system_score_gemma":0.0001400694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001647908,"about_ca_topic_score_gemma":7.483783e-7,"domain_scores_codex":[0.9967118,0.0003431526,0.0005433766,0.0008745768,0.0007173117,0.0008098013],"domain_scores_gemma":[0.9952846,0.002459131,0.0004147771,0.001369316,0.0001811383,0.0002910576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001817088,0.00003527718,0.000001385422,0.00003378123,0.0001350491,0.00001516309,0.0001229662,0.004879784,0.00001121576,0.8064903,0.002735783,0.1855211],"study_design_scores_gemma":[0.0004619324,0.0001844366,0.00006066305,0.001703273,0.0001736158,0.00008298215,0.00001298337,0.04432984,0.002284344,0.5916538,0.3563747,0.002677447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000004859692,0.001118772,0.7592539,0.0004189988,0.0005566028,0.000317986,0.00007998897,0.0008625635,0.2373863],"genre_scores_gemma":[0.8152509,0.0007023331,0.05599596,0.005978442,0.003859051,0.00008499638,0.0008057331,0.0008264366,0.1164961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.815246,"threshold_uncertainty_score":0.9996356,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Object (grammar); Computer science; Value (mathematics); Process (computing); Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0168191493174915,"gpt":0.2493695182061919,"spread":0.2325503688887004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002162627,0.0007618486,0.0007530859,0.0003167837,0.0004010218,0.0003267307,0.002620743,0.0005605873,0.0001261299],"category_scores_gemma":[0.001412371,0.0007319038,0.0003602414,0.000124596,0.0001642051,0.0001012881,0.0006212302,0.0008864604,0.0004367016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003780983,"about_ca_system_score_gemma":0.00009264029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000185411,"about_ca_topic_score_gemma":3.789998e-7,"domain_scores_codex":[0.9962931,0.0004953015,0.0006840033,0.001162846,0.0007388623,0.000625879],"domain_scores_gemma":[0.9943799,0.002490875,0.00075515,0.002054935,0.0001397977,0.0001793653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000343932,0.00001710893,9.121147e-7,0.0000472896,0.0001237724,0.000009730714,0.00004631753,0.001600505,0.00003799212,0.8161931,0.001091721,0.1807972],"study_design_scores_gemma":[0.0003705118,0.00026594,0.0001434487,0.001769964,0.0001737375,0.00006593555,0.000005281587,0.04335243,0.01376757,0.7103975,0.2274624,0.002225308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000035113,0.0001868134,0.8386906,0.00009375928,0.0009669242,0.0002817052,0.00006847609,0.0007237086,0.1589529],"genre_scores_gemma":[0.5427616,0.0001489248,0.3826939,0.003755745,0.002525521,0.00009770598,0.0004415257,0.0006945896,0.06688044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5427265,"threshold_uncertainty_score":0.9995132,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reliability engineering; Distributed computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01318638515507029,"gpt":0.217300778410676,"spread":0.2041143932556057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001839584,0.001309727,0.001544809,0.0005035432,0.000707551,0.0007401829,0.003653653,0.0009653663,0.00005262156],"category_scores_gemma":[0.0008982123,0.001182088,0.0007992659,0.0003690117,0.0001785333,0.0001452661,0.0007830871,0.001240806,0.001694591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005493745,"about_ca_system_score_gemma":0.0002352152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000191998,"about_ca_topic_score_gemma":0.00000985073,"domain_scores_codex":[0.9940075,0.0004606375,0.00121796,0.001931988,0.001243799,0.001138081],"domain_scores_gemma":[0.9903883,0.005288154,0.0009916432,0.00267797,0.0003033475,0.0003506198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004795069,0.00002842937,0.000001635313,0.0002720855,0.0004113325,0.0003233303,0.00007496569,0.003048175,0.000008721814,0.9431151,0.0254099,0.0272584],"study_design_scores_gemma":[0.001051299,0.0003919402,0.000219825,0.01499848,0.0004966445,0.0003237892,0.0001561334,0.03905438,0.001503287,0.3207088,0.6152214,0.005874071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000295361,0.0008983846,0.7029294,0.0007763327,0.002504353,0.0009021309,0.001349441,0.005802964,0.2848074],"genre_scores_gemma":[0.9118855,0.00005967253,0.001796257,0.0007644006,0.001669977,0.0001212846,0.0007748299,0.00060601,0.08232207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9118559,"threshold_uncertainty_score":0.9999654,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01291335742405408,"gpt":0.2221833199105396,"spread":0.2092699624864855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001532861,0.0009131327,0.0009977767,0.0004045404,0.0004966811,0.0004678644,0.002238644,0.0007064334,0.0001816881],"category_scores_gemma":[0.0008578882,0.000847666,0.0005236988,0.000322044,0.0001677191,0.0001329466,0.0005001073,0.001077114,0.001993938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003150048,"about_ca_system_score_gemma":0.0001467521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000446769,"about_ca_topic_score_gemma":0.00000251301,"domain_scores_codex":[0.9955177,0.0002929019,0.0008489322,0.001675991,0.000873826,0.0007906892],"domain_scores_gemma":[0.9947193,0.001959779,0.0006853629,0.002171606,0.0002463331,0.0002176522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003821523,0.00003030687,3.806914e-7,0.0000614495,0.0002304246,0.00007053663,0.0000506094,0.002186275,0.00002069372,0.8368127,0.0782434,0.08225496],"study_design_scores_gemma":[0.0002798061,0.0001538749,0.00006941687,0.001071493,0.0001232875,0.00008557212,0.00001357729,0.007066746,0.0008952401,0.3875558,0.6009821,0.001703087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00002054358,0.0005620029,0.8122469,0.003081252,0.004935602,0.0006605072,0.0009723504,0.003668278,0.1738526],"genre_scores_gemma":[0.3060545,0.0003388021,0.00483135,0.002235599,0.01955742,0.0001887741,0.003048246,0.001190783,0.6625545],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8074155,"threshold_uncertainty_score":0.9993974,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queue; Theoretical computer science; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02412501973216737,"gpt":0.2499984181994353,"spread":0.2258733984672679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001762024,0.0008865062,0.001145992,0.0002606042,0.0006504072,0.001315633,0.003633178,0.0006017642,0.00004896422],"category_scores_gemma":[0.0004635775,0.0006082511,0.0002631706,0.000233233,0.0001976649,0.0002196052,0.002410263,0.0008552113,0.000264053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001605969,"about_ca_system_score_gemma":0.0001458538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001465846,"about_ca_topic_score_gemma":0.00000926476,"domain_scores_codex":[0.9958447,0.0003194568,0.0007921942,0.001659404,0.0006610245,0.0007232128],"domain_scores_gemma":[0.9955275,0.001715053,0.0006592835,0.001671975,0.0001416894,0.0002844672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004259769,0.00004010819,0.000002776501,0.0001328043,0.000203889,0.00006944775,0.0001602887,0.0007280511,0.0000184756,0.8222538,0.01045418,0.1658936],"study_design_scores_gemma":[0.0006056529,0.0002388147,0.0002347246,0.005595225,0.0001256412,0.00008532781,0.00003138419,0.01054643,0.0002485237,0.7471002,0.2331313,0.002056791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00004690879,0.001394828,0.6914362,0.003941103,0.002264666,0.002752797,0.002182914,0.002745464,0.2932352],"genre_scores_gemma":[0.5615126,0.0005692726,0.005066227,0.002085742,0.001761462,0.000352714,0.001698592,0.0009939221,0.4259594],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6863699,"threshold_uncertainty_score":0.9997211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}