{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001652467,0.0008063948,0.0008235904,0.0003521981,0.001061442,0.001128789,0.003431164,0.0002774626,0.0001452365],"category_scores_gemma":[0.0001446009,0.000760299,0.0001429149,0.002092281,0.0002892253,0.001707674,0.001107019,0.00139812,0.00003118421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004828518,"about_ca_system_score_gemma":0.0003714325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008491967,"about_ca_topic_score_gemma":0.00002123998,"domain_scores_codex":[0.9945478,0.00005300409,0.00125772,0.001456331,0.001239407,0.00144578],"domain_scores_gemma":[0.9961883,0.0001771898,0.0009712044,0.0004101265,0.00185242,0.000400793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003322356,0.0002071098,0.04056981,0.00003603576,0.00009440529,0.00003790928,0.0006742564,0.0006908235,0.0003346191,0.9472737,0.005726256,0.004022846],"study_design_scores_gemma":[0.002719935,0.0006887888,0.005810969,0.003598193,0.0000170526,0.000244356,0.0002262632,0.9796234,0.0002125945,0.002306412,0.003203073,0.001348963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04637968,0.00008334381,0.3656337,0.009281252,0.002003716,0.0819049,0.00002141846,0.00388831,0.4908037],"genre_scores_gemma":[0.9673276,0.0004690644,0.009994652,0.00115417,0.001033797,0.01931573,0.00002868566,0.000083657,0.0005926429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9789326,"threshold_uncertainty_score":0.9999081,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910662,0.0004041254,0.0006351798,0.0007637483,0.0003338031,0.0004584562,0.001937286,0.0001293484,0.0002475358],"category_scores_gemma":[0.00007886896,0.0003385762,0.0001773899,0.00241935,0.000318829,0.001172773,0.0004188789,0.0003905252,0.00002492443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001375293,"about_ca_system_score_gemma":0.0001861228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000267048,"about_ca_topic_score_gemma":0.00000715899,"domain_scores_codex":[0.9965214,0.00001462258,0.0006782427,0.0007726105,0.001418984,0.0005942017],"domain_scores_gemma":[0.9958004,0.00006514134,0.0006646176,0.0001936695,0.003047885,0.0002282823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001861206,0.0002623274,0.04464384,0.0000359397,0.000707569,0.00000352369,0.001446185,0.0007735601,0.0003161872,0.9492935,0.002032462,0.0002987908],"study_design_scores_gemma":[0.008669197,0.006353906,0.1308856,0.002976534,0.0004876185,0.0001779079,0.001828185,0.7397127,0.009787164,0.02183239,0.07391604,0.003372697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02408431,0.00001268058,0.02622784,0.003749718,0.0002118645,0.03142332,0.00004845731,0.0006925747,0.9135492],"genre_scores_gemma":[0.9556198,0.00004355009,0.02713823,0.0006742936,0.0001842437,0.01519029,0.0000242561,0.00003307586,0.001092327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9315354,"threshold_uncertainty_score":0.9999066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}