{"meta":{"query_hash":"03f934e0ceba","filters":{"venue":"Networked Systems Design and Implementation"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/03f934e0ceba","api":"https://metacan.xera.ac/api/v1/cohort?venue=Networked+Systems+Design+and+Implementation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025244271863491183,"score_gpt":0.2749679163606518,"score_spread":0.24972364449716064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807555227","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.19276631,0.0014552181,0.8030484,0.00025534842,0.0011754251,0.0010126176,0.000022333197,0.0001363543,0.00012801045],"genre_scores_gemma":[0.99348605,0.000018705536,0.0057778736,0.00025766893,0.00023616158,0.000082542974,0.000034709454,0.000015175649,0.0000910864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997667,0.00034990226,0.00055772887,0.00056505913,0.0004359048,0.00042437302],"domain_scores_gemma":[0.9988804,0.00008855405,0.00020915248,0.0002933987,0.00016698687,0.00036150403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095369434,0.0002687043,0.00036042696,0.00012721978,0.00026306996,0.00080347754,0.00032303366,0.000069132984,0.0000022092336],"category_scores_gemma":[0.0000056004665,0.00023009353,0.000032115877,0.00039604193,0.000030757237,0.00059307495,0.00013313853,0.000089926056,0.000012620349],"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.000461849,0.00023515591,0.053769067,0.0008950377,0.0005934751,0.00017957282,0.06981566,0.14786547,0.0054661785,0.085042596,0.05474605,0.5809299],"study_design_scores_gemma":[0.0025151204,0.00046417673,0.0034565378,0.00026147437,0.00002938662,0.00022274506,0.0031483583,0.9589892,0.00016026705,0.00017436946,0.030009447,0.0005689325],"about_ca_topic_score_codex":0.000509148,"about_ca_topic_score_gemma":0.000027235588,"teacher_disagreement_score":0.8111237,"about_ca_system_score_codex":0.000061062376,"about_ca_system_score_gemma":0.00006484126,"threshold_uncertainty_score":0.93829423},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015672799369188473,"score_gpt":0.2607560305500837,"score_spread":0.2450832311808952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896211881","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.088091776,0.0013495048,0.90766484,0.00013844734,0.0016248998,0.00076694984,0.0000024725157,0.00023249062,0.00012862158],"genre_scores_gemma":[0.9835485,0.00018232588,0.014667802,0.00019334463,0.0011676574,0.00014885579,0.00002868606,0.00001387247,0.000048922666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976599,0.0006382498,0.0005312032,0.00047119308,0.00028549574,0.00041393386],"domain_scores_gemma":[0.99845046,0.00068037165,0.00023918315,0.00043356433,0.00007353922,0.00012290638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453248,0.0002046402,0.00029940545,0.000044648117,0.0002833277,0.0003789237,0.00033845005,0.00009890321,0.000018663228],"category_scores_gemma":[0.000019661173,0.00016855424,0.000048113037,0.00027389417,0.000035722656,0.0006184394,0.00007680168,0.000094635514,0.000032386455],"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.00007922367,0.00009625421,0.16575505,0.00022865545,0.00023431834,0.0000067198257,0.005873028,0.09861953,0.00030334678,0.015817542,0.112833224,0.6001531],"study_design_scores_gemma":[0.0017883136,0.0004733249,0.048994984,0.00019603301,0.00004888435,0.000015622478,0.00059971836,0.8912355,0.00021521247,0.0036964468,0.052123964,0.00061204436],"about_ca_topic_score_codex":0.00049532746,"about_ca_topic_score_gemma":0.00003460402,"teacher_disagreement_score":0.89545673,"about_ca_system_score_codex":0.000041389823,"about_ca_system_score_gemma":0.000037997565,"threshold_uncertainty_score":0.6873442},"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,"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; Routing (electronic design automation); Consistency (knowledge bases); Computer network; Artificial intelligence","score_opus":0.06289443451404012,"score_gpt":0.2629196290944399,"score_spread":0.20002519458039977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011415141","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.0128223365,0.00046503372,0.98478323,0.0005177964,0.00028017006,0.00062123296,0.0000015206421,0.00023671116,0.00027194063],"genre_scores_gemma":[0.9899086,0.000025018107,0.008634069,0.0008094696,0.00050448196,0.000050390885,0.000017515815,0.000015170209,0.000035329263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982259,0.00033694782,0.00039726717,0.00041980785,0.00025385563,0.00036620177],"domain_scores_gemma":[0.9991758,0.00017021439,0.00022572206,0.00019111592,0.00009258119,0.00014455886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005667986,0.00018017154,0.00023405615,0.000027534967,0.00043134295,0.0005582083,0.00022462902,0.00004528541,0.0000055790283],"category_scores_gemma":[0.000008275996,0.00015402412,0.00003232008,0.00032459034,0.000019700778,0.00048205198,0.00008609626,0.0001295478,0.000005660512],"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.00044461858,0.00006801949,0.052981537,0.00043631793,0.00067024294,0.00021693936,0.020033533,0.38973895,0.0040938095,0.09390275,0.07593593,0.36147735],"study_design_scores_gemma":[0.0008235846,0.00035884004,0.0003822206,0.00012009487,0.000025495106,0.00004113715,0.0015235312,0.9957246,0.00003323738,0.000041907566,0.0006746708,0.00025066404],"about_ca_topic_score_codex":0.00016660486,"about_ca_topic_score_gemma":0.00001636033,"teacher_disagreement_score":0.97708625,"about_ca_system_score_codex":0.000034352863,"about_ca_system_score_gemma":0.00007109996,"threshold_uncertainty_score":0.62809217},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02913179046244142,"score_gpt":0.2679496919519316,"score_spread":0.23881790148949017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48887007","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.027214378,0.0010140206,0.9692618,0.00014674915,0.00085566274,0.0010363584,0.000013209191,0.00025260015,0.00020517649],"genre_scores_gemma":[0.9907634,0.00012551059,0.008111566,0.00013551876,0.00034840568,0.00011296146,0.00014662591,0.000016501157,0.000239503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997023,0.00068590074,0.000759103,0.00075708557,0.00037270845,0.00040221916],"domain_scores_gemma":[0.99817693,0.00023496247,0.0003490902,0.00092618173,0.00015639448,0.0001564428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013604689,0.000245197,0.0003214691,0.0000756922,0.0005279341,0.00022037432,0.0004589494,0.00009446017,0.00002967015],"category_scores_gemma":[0.000021224867,0.00022905352,0.000053137388,0.00039365367,0.00005678588,0.0005457081,0.000109420485,0.00012747104,0.00007202085],"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.0003125919,0.00095111347,0.043076813,0.0006343488,0.00068760413,0.00015736665,0.01152349,0.1675559,0.0075629195,0.08032813,0.124883,0.5623267],"study_design_scores_gemma":[0.0026010498,0.0012361603,0.013489098,0.00012701875,0.00003986821,0.00072247325,0.00027410098,0.9434388,0.00018772311,0.0005604448,0.036464095,0.0008591373],"about_ca_topic_score_codex":0.00088636205,"about_ca_topic_score_gemma":0.000017281605,"teacher_disagreement_score":0.963549,"about_ca_system_score_codex":0.00012597245,"about_ca_system_score_gemma":0.00009550532,"threshold_uncertainty_score":0.9340531},"labels":[],"label_agreement":null}]}