{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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","author_layer_release":"2026-06-26"},"query_hash":"54a97460abaa","filters":{"venue":"Proceedings/Proceedings - International Conference on Network Protocols"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08976932936101299,"gpt":0.3162120079074109,"spread":0.2264426785463979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934644,0.0003855764,0.0003757157,0.0006601401,0.0006086674,0.0005427017,0.0009916268,0.0004139703,0.0007816881],"category_scores_gemma":[0.002762995,0.0001833185,0.0002217589,0.0006059914,0.0007174665,0.001063009,0.001273248,0.0004223697,0.0001554763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006680797,"about_ca_system_score_gemma":0.001082525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00274487,"about_ca_topic_score_gemma":0.003980485,"domain_scores_codex":[0.9995735,0.0001389048,0.00001851972,0.00004048869,0.0001462836,0.00008223481],"domain_scores_gemma":[0.9989229,0.0005032049,0.0001447827,0.0001657654,0.0001979839,0.00006530672],"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.0007874815,0.000155582,0.001664893,0.0002660789,0.0001122755,0.0005486289,0.000407759,0.5247293,0.07069879,0.1117545,0.009365882,0.2795088],"study_design_scores_gemma":[0.00003871557,0.0001435847,0.0002283096,0.00001716953,0.00001822702,0.0001672979,0.00004339964,0.968228,0.008492636,0.01750299,0.005100186,0.00001952982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06901205,0.0005738616,0.9241226,0.0003227846,0.00009876656,0.0001867954,0.0001233522,0.00101692,0.004542809],"genre_scores_gemma":[0.8434294,0.000401509,0.1527034,0.0001678383,0.00005404999,0.0002942286,0.0002015628,0.00008478244,0.002663232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00274487,"threshold_uncertainty_score":0.005457759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Boaz Patt-Shamir","is_ca":false},{"name":"Gabriel Scalosub","is_ca":true},{"name":"Yuval Shavitt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07694593558326353,"gpt":0.3318369077999769,"spread":0.2548909722167134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006786994,0.002046923,0.002645355,0.001509546,0.001887153,0.005429757,0.003569907,0.002885346,0.01116949],"category_scores_gemma":[0.03579971,0.001041161,0.0011692,0.001845121,0.002995595,0.005983707,0.003015199,0.003227369,0.0008092067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005683071,"about_ca_system_score_gemma":0.00456754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006567323,"about_ca_topic_score_gemma":0.003425518,"domain_scores_codex":[0.9949945,0.002149968,0.0001362453,0.0005530096,0.0009269879,0.001239203],"domain_scores_gemma":[0.9664235,0.02629526,0.002221792,0.001204236,0.001831491,0.002023849],"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.0005513346,0.0002408904,0.0009959674,0.0002009851,0.0000807208,0.0001374894,0.0001797412,0.6834816,0.001224372,0.2956701,0.004223577,0.0130132],"study_design_scores_gemma":[0.00004472556,0.0000570566,0.00009902946,0.00001116622,0.00001249796,0.00002395039,0.00004375103,0.9402535,0.0002120719,0.05854815,0.0006822809,0.00001178523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850673,0.001608415,0.7487364,0.003748086,0.0002806191,0.0004646171,0.0005835189,0.0007028198,0.05880815],"genre_scores_gemma":[0.9530471,0.0007579427,0.03721345,0.0004477668,0.0002417978,0.0003399022,0.0002275499,0.0001955029,0.007529091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01116949,"threshold_uncertainty_score":0.04123372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}