{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18506731,0.0016084147,0.74873644,0.0037480863,0.00028061913,0.00046461707,0.0005835189,0.0007028198,0.05880815],"genre_scores_gemma":[0.9530471,0.0007579427,0.03721345,0.0004477668,0.00024179777,0.00033990215,0.00022754994,0.00019550293,0.007529091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949945,0.0021499677,0.00013624533,0.00055300957,0.0009269879,0.001239203],"domain_scores_gemma":[0.96642345,0.026295261,0.0022217922,0.0012042356,0.0018314908,0.0020238487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067869937,0.0020469227,0.0026453552,0.0015095464,0.0018871535,0.005429757,0.0035699068,0.0028853458,0.011169491],"category_scores_gemma":[0.03579971,0.0010411612,0.0011692,0.0018451209,0.0029955946,0.005983707,0.0030151987,0.0032273694,0.0008092067],"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.00055133464,0.00024089038,0.0009959674,0.00020098506,0.0000807208,0.00013748945,0.00017974123,0.68348163,0.0012243717,0.29567012,0.0042235767,0.013013199],"study_design_scores_gemma":[0.00004472556,0.000057056604,0.00009902946,0.000011166216,0.000012497961,0.000023950393,0.00004375103,0.9402535,0.0002120719,0.05854815,0.0006822809,0.000011785227],"about_ca_topic_score_codex":0.0065673226,"about_ca_topic_score_gemma":0.0034255176,"teacher_disagreement_score":0.011169491,"about_ca_system_score_codex":0.0056830714,"about_ca_system_score_gemma":0.0045675403,"threshold_uncertainty_score":0.04123372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06901205,0.00057386165,0.9241226,0.00032278456,0.00009876656,0.00018679538,0.00012335216,0.0010169201,0.004542809],"genre_scores_gemma":[0.8434294,0.00040150897,0.15270339,0.00016783834,0.000054049986,0.00029422855,0.0002015628,0.00008478244,0.0026632324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00013890478,0.000018519719,0.000040488685,0.00014628364,0.00008223481],"domain_scores_gemma":[0.9989229,0.00050320494,0.00014478267,0.00016576538,0.00019798391,0.00006530672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079346437,0.00038557642,0.00037571572,0.00066014007,0.0006086674,0.00054270175,0.0009916268,0.0004139703,0.00078168814],"category_scores_gemma":[0.002762995,0.0001833185,0.00022175888,0.0006059914,0.00071746646,0.0010630095,0.0012732483,0.00042236975,0.0001554763],"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.00078748155,0.00015558202,0.0016648932,0.00026607886,0.00011227547,0.00054862886,0.00040775904,0.52472925,0.07069879,0.11175454,0.009365882,0.27950883],"study_design_scores_gemma":[0.000038715574,0.00014358471,0.00022830964,0.00001716953,0.00001822702,0.00016729794,0.000043399643,0.968228,0.008492636,0.017502988,0.0051001855,0.00001952982],"about_ca_topic_score_codex":0.0027448705,"about_ca_topic_score_gemma":0.0039804853,"teacher_disagreement_score":0.0027448705,"about_ca_system_score_codex":0.00066807965,"about_ca_system_score_gemma":0.0010825245,"threshold_uncertainty_score":0.005457759},"labels":[],"label_agreement":null}]}