{"meta":{"query_hash":"54a97460abaa","filters":{"venue":"Proceedings/Proceedings - International Conference on Network Protocols"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/54a97460abaa","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings%2FProceedings+-+International+Conference+on+Network+Protocols"},"results":[{"id":"W2096909102","doi":"10.1109/icnp.2008.4697038","title":"Competitive analysis of buffer policies with SLA commitments","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Conference on Network Protocols","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"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 Toronto","funders":"","keywords":"Network packet; Computer science; Competitive analysis; Computer network; Revenue; Abstraction; Bandwidth (computing); Task (project management); Online algorithm; Algorithm; Upper and lower bounds; Business; Engineering","score_opus":0.07694593558326353,"score_gpt":0.3318369077999769,"score_spread":0.25489097221671336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096909102","genre_codex":"other","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.024084307,0.000012680578,0.026227836,0.003749718,0.00021186449,0.031423315,0.00004845731,0.0006925747,0.91354924],"genre_scores_gemma":[0.95561975,0.00004355009,0.027138228,0.0006742936,0.00018424372,0.015190291,0.0000242561,0.00003307586,0.0010923273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652135,0.000014622576,0.0006782427,0.0007726105,0.0014189841,0.00059420173],"domain_scores_gemma":[0.9958004,0.000065141336,0.0006646176,0.00019366946,0.0030478851,0.00022828234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910662,0.0004041254,0.0006351798,0.0007637483,0.00033380312,0.0004584562,0.0019372863,0.00012934844,0.0002475358],"category_scores_gemma":[0.00007886896,0.0003385762,0.00017738994,0.0024193497,0.000318829,0.0011727733,0.00041887886,0.00039052515,0.000024924428],"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.00018612057,0.00026232743,0.04464384,0.0000359397,0.00070756895,0.0000035236903,0.0014461849,0.00077356014,0.00031618716,0.9492935,0.0020324623,0.00029879075],"study_design_scores_gemma":[0.008669197,0.0063539064,0.13088562,0.0029765337,0.00048761847,0.00017790786,0.0018281853,0.7397127,0.009787164,0.021832393,0.07391604,0.0033726967],"about_ca_topic_score_codex":0.000026704798,"about_ca_topic_score_gemma":0.0000071589902,"teacher_disagreement_score":0.9315354,"about_ca_system_score_codex":0.00013752929,"about_ca_system_score_gemma":0.0001861228,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W2117554110","doi":"10.1109/icnp.2008.4697020","title":"CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Conference on Network Protocols","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":143,"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 Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Unicast; Wireless mesh network; Network packet; Routing protocol; Wireless network; Hazy Sighted Link State Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing; Scheduling (production processes); Wireless; Telecommunications","score_opus":0.08976932936101299,"score_gpt":0.3162120079074109,"score_spread":0.22644267854639788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117554110","genre_codex":"other","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.046379678,0.00008334381,0.3656337,0.009281252,0.002003716,0.081904896,0.00002141846,0.0038883102,0.4908037],"genre_scores_gemma":[0.9673276,0.00046906437,0.009994652,0.0011541697,0.001033797,0.019315727,0.00002868566,0.000083657,0.00059264293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945478,0.000053004085,0.0012577199,0.001456331,0.0012394072,0.0014457803],"domain_scores_gemma":[0.9961883,0.00017718978,0.0009712044,0.0004101265,0.0018524199,0.00040079304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016524672,0.00080639485,0.0008235904,0.00035219814,0.0010614418,0.0011287894,0.003431164,0.0002774626,0.00014523648],"category_scores_gemma":[0.00014460088,0.000760299,0.00014291491,0.0020922807,0.0002892253,0.0017076737,0.0011070195,0.0013981203,0.000031184212],"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.0003322356,0.00020710981,0.040569812,0.000036035763,0.00009440529,0.00003790928,0.00067425636,0.00069082354,0.00033461914,0.9472737,0.005726256,0.0040228455],"study_design_scores_gemma":[0.002719935,0.0006887888,0.005810969,0.0035981932,0.000017052598,0.00024435596,0.00022626318,0.9796234,0.00021259449,0.0023064124,0.0032030726,0.0013489627],"about_ca_topic_score_codex":0.000008491967,"about_ca_topic_score_gemma":0.000021239983,"teacher_disagreement_score":0.97893256,"about_ca_system_score_codex":0.00048285178,"about_ca_system_score_gemma":0.00037143254,"threshold_uncertainty_score":0.99990815},"labels":[],"label_agreement":null}]}