{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"03f934e0ceba","filters":{"venue":"Networked Systems Design and Implementation"}},"results":[{"id":"W1896211881","doi":"10.5555/2616448.2616460","title":"NetCheck: network diagnoses from blackbox traces","year":2014,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Tracing; BitTorrent tracker; TRACE (psycholinguistics); Software portability; Python (programming language); Network monitoring; Set (abstract data type); Distributed computing; Programming language; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01567279936918847,"gpt":0.2607560305500837,"spread":0.2450832311808952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453248,0.0002046402,0.0002994055,0.00004464812,0.0002833277,0.0003789237,0.00033845,0.00009890321,0.00001866323],"category_scores_gemma":[0.00001966117,0.0001685542,0.00004811304,0.0002738942,0.00003572266,0.0006184394,0.00007680168,0.00009463551,0.00003238646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004138982,"about_ca_system_score_gemma":0.00003799756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004953275,"about_ca_topic_score_gemma":0.00003460402,"domain_scores_codex":[0.9976599,0.0006382498,0.0005312032,0.0004711931,0.0002854957,0.0004139339],"domain_scores_gemma":[0.9984505,0.0006803717,0.0002391832,0.0004335643,0.00007353922,0.0001229064],"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.00007922367,0.00009625421,0.165755,0.0002286555,0.0002343183,0.000006719826,0.005873028,0.09861953,0.0003033468,0.01581754,0.1128332,0.6001531],"study_design_scores_gemma":[0.001788314,0.0004733249,0.04899498,0.000196033,0.00004888435,0.00001562248,0.0005997184,0.8912355,0.0002152125,0.003696447,0.05212396,0.0006120444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08809178,0.001349505,0.9076648,0.0001384473,0.0016249,0.0007669498,0.000002472516,0.0002324906,0.0001286216],"genre_scores_gemma":[0.9835485,0.0001823259,0.0146678,0.0001933446,0.001167657,0.0001488558,0.00002868606,0.00001387247,0.00004892267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8954567,"threshold_uncertainty_score":0.6873442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1807555227","doi":"","title":"Tardigrade: leveraging lightweight virtual machines to easily and efficiently construct fault-tolerant services","year":2015,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Sandbox (software development); Computer science; Fault tolerance; Service (business); Replication (statistics); Virtual machine; Distributed computing; Process (computing); Operating system; Embedded system; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02524427186349118,"gpt":0.2749679163606518,"spread":0.2497236444971606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009536943,0.0002687043,0.000360427,0.0001272198,0.00026307,0.0008034775,0.0003230337,0.00006913298,0.000002209234],"category_scores_gemma":[0.000005600466,0.0002300935,0.00003211588,0.0003960419,0.00003075724,0.0005930749,0.0001331385,0.00008992606,0.00001262035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006106238,"about_ca_system_score_gemma":0.00006484126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000509148,"about_ca_topic_score_gemma":0.00002723559,"domain_scores_codex":[0.997667,0.0003499023,0.0005577289,0.0005650591,0.0004359048,0.000424373],"domain_scores_gemma":[0.9988804,0.00008855405,0.0002091525,0.0002933987,0.0001669869,0.000361504],"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.000461849,0.0002351559,0.05376907,0.0008950377,0.0005934751,0.0001795728,0.06981566,0.1478655,0.005466179,0.0850426,0.05474605,0.5809299],"study_design_scores_gemma":[0.00251512,0.0004641767,0.003456538,0.0002614744,0.00002938662,0.0002227451,0.003148358,0.9589892,0.0001602671,0.0001743695,0.03000945,0.0005689325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1927663,0.001455218,0.8030484,0.0002553484,0.001175425,0.001012618,0.0000223332,0.0001363543,0.0001280104],"genre_scores_gemma":[0.993486,0.00001870554,0.005777874,0.0002576689,0.0002361616,0.00008254297,0.00003470945,0.00001517565,0.0000910864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8111237,"threshold_uncertainty_score":0.9382942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W48887007","doi":"","title":"Remus: High Availability via Asynchronous Virtual Machine Replication. (Best Paper)","year":2008,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Replication (statistics); Asynchronous communication; Virtual machine; High availability; Operating system; Distributed computing; Computer network; Biology; Virology","retraction":null,"screen_n_in":null,"score":{"opus":0.02913179046244142,"gpt":0.2679496919519316,"spread":0.2388179014894902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360469,0.000245197,0.0003214691,0.0000756922,0.0005279341,0.0002203743,0.0004589494,0.00009446017,0.00002967015],"category_scores_gemma":[0.00002122487,0.0002290535,0.00005313739,0.0003936537,0.00005678588,0.0005457081,0.0001094205,0.000127471,0.00007202085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259725,"about_ca_system_score_gemma":0.00009550532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000886362,"about_ca_topic_score_gemma":0.00001728161,"domain_scores_codex":[0.997023,0.0006859007,0.000759103,0.0007570856,0.0003727085,0.0004022192],"domain_scores_gemma":[0.9981769,0.0002349625,0.0003490902,0.0009261817,0.0001563945,0.0001564428],"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.0003125919,0.0009511135,0.04307681,0.0006343488,0.0006876041,0.0001573667,0.01152349,0.1675559,0.00756292,0.08032813,0.124883,0.5623267],"study_design_scores_gemma":[0.00260105,0.00123616,0.0134891,0.0001270187,0.00003986821,0.0007224733,0.000274101,0.9434388,0.0001877231,0.0005604448,0.0364641,0.0008591373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02721438,0.001014021,0.9692618,0.0001467492,0.0008556627,0.001036358,0.00001320919,0.0002526001,0.0002051765],"genre_scores_gemma":[0.9907634,0.0001255106,0.008111566,0.0001355188,0.0003484057,0.0001129615,0.0001466259,0.00001650116,0.000239503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.963549,"threshold_uncertainty_score":0.9340531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011415141","doi":"","title":"{FLAIR}: Accelerating Reads with Consistency-Aware Network Routing","year":2020,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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; Routing (electronic design automation); Consistency (knowledge bases); Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06289443451404012,"gpt":0.2629196290944399,"spread":0.2000251945803998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005667986,0.0001801715,0.0002340561,0.00002753497,0.000431343,0.0005582083,0.000224629,0.00004528541,0.000005579028],"category_scores_gemma":[0.000008275996,0.0001540241,0.00003232008,0.0003245903,0.00001970078,0.000482052,0.00008609626,0.0001295478,0.000005660512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003435286,"about_ca_system_score_gemma":0.00007109996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001666049,"about_ca_topic_score_gemma":0.00001636033,"domain_scores_codex":[0.9982259,0.0003369478,0.0003972672,0.0004198079,0.0002538556,0.0003662018],"domain_scores_gemma":[0.9991758,0.0001702144,0.0002257221,0.0001911159,0.00009258119,0.0001445589],"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.0004446186,0.00006801949,0.05298154,0.0004363179,0.0006702429,0.0002169394,0.02003353,0.3897389,0.00409381,0.09390275,0.07593593,0.3614773],"study_design_scores_gemma":[0.0008235846,0.00035884,0.0003822206,0.0001200949,0.00002549511,0.00004113715,0.001523531,0.9957246,0.00003323738,0.00004190757,0.0006746708,0.000250664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01282234,0.0004650337,0.9847832,0.0005177964,0.0002801701,0.000621233,0.000001520642,0.0002367112,0.0002719406],"genre_scores_gemma":[0.9899086,0.00002501811,0.008634069,0.0008094696,0.000504482,0.00005039089,0.00001751581,0.00001517021,0.00003532926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9770862,"threshold_uncertainty_score":0.6280922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}