{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"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":"3cc0852b7b1e","filters":{"venue":"IEEE International Conference on Performance, Computing, and Communications, 2004"}},"results":[{"id":"W2149949310","doi":"10.1109/pccc.2004.1395119","title":"A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Wireless ad hoc network; Computer network; Distributed computing; Source-specific multicast; Protocol Independent Multicast; Heuristic; Tree (set theory); Xcast; Energy consumption; Algorithm; Wireless; Telecommunications; Mathematics; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02943791755416059,"gpt":0.2944425630698798,"spread":0.2650046455157192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045838,0.0002915372,0.0002985276,0.0003021371,0.0003712419,0.0002896789,0.001943289,0.0001537253,0.000009072201],"category_scores_gemma":[0.00002151417,0.0003129439,0.00007757885,0.0002982155,0.0002089627,0.0006344446,0.0003830042,0.0004497062,0.000009784334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002391372,"about_ca_system_score_gemma":0.00011234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002108626,"about_ca_topic_score_gemma":0.0003885295,"domain_scores_codex":[0.9979173,0.0001125827,0.0007065553,0.0005559323,0.0002768256,0.0004307926],"domain_scores_gemma":[0.9978259,0.0003716229,0.000359933,0.0009713391,0.0003577525,0.0001134525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002426046,0.0001691125,0.0002628113,0.00000677086,0.00002718785,8.206159e-7,0.0002630001,0.008060401,0.00004830578,0.01229264,0.00006857067,0.9787761],"study_design_scores_gemma":[0.001283806,0.0001393738,0.001222543,0.0003367467,0.000007303577,0.00005826918,0.00008413761,0.9940459,0.00004725251,0.0002757924,0.002171422,0.0003274526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07362249,0.0006967215,0.9205409,0.001249012,0.000893775,0.0003890785,0.00001056675,0.0001647636,0.002432745],"genre_scores_gemma":[0.8334042,0.0027961,0.1630586,0.0002891542,0.0001350595,0.00009547024,0.00004254425,0.00001865935,0.0001602521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9859855,"threshold_uncertainty_score":0.9999323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133902375","doi":"10.1109/pccc.2004.1394944","title":"Connection-level performance analysis for adaptive bandwidth allocation in multimedia wireless cellular networks","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Handover; Call blocking; Call Admission Control; Computer network; Quality of service; Blocking (statistics); Bandwidth (computing); Bandwidth allocation; Markov chain; Wireless network; Channel allocation schemes; Wireless; Markov process; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.08533060811652754,"gpt":0.3257202407468269,"spread":0.2403896326302994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001110984,0.0003083281,0.0003848976,0.0008129474,0.0005920854,0.000330002,0.003540944,0.0001678823,0.00002357602],"category_scores_gemma":[0.00003529256,0.0003263579,0.0001167395,0.001096999,0.0002527705,0.0008988557,0.0005674179,0.0006575532,0.00002743392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003027592,"about_ca_system_score_gemma":0.0001990844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009389901,"about_ca_topic_score_gemma":0.0004048818,"domain_scores_codex":[0.9974296,0.0002333102,0.0007698963,0.0005878535,0.0005121879,0.0004671644],"domain_scores_gemma":[0.9963053,0.0005795487,0.0003920113,0.00176108,0.0008204856,0.0001415634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001789176,0.0006888671,0.02399047,0.00002918247,0.0004080959,6.96674e-7,0.001565928,0.4243026,0.0001616213,0.07760149,0.0004806486,0.4705914],"study_design_scores_gemma":[0.000990585,0.0001372775,0.0241057,0.000133741,0.00002330197,0.000003788553,0.00008793938,0.9722031,0.0003439514,0.000108102,0.001522749,0.0003397918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2384947,0.0004255205,0.7538012,0.002888399,0.0003514987,0.0006553183,0.00001477637,0.0001506115,0.003217937],"genre_scores_gemma":[0.9615174,0.003615479,0.03368576,0.000315442,0.000172829,0.0001853986,0.000175315,0.00001992596,0.0003124727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7230226,"threshold_uncertainty_score":0.9999188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165290294","doi":"10.1109/pccc.2004.1395018","title":"Adaptive gossip-based routing algorithm","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Ad hoc On-Demand Distance Vector Routing; Dynamic Source Routing; Computer network; Gossip; Distance-vector routing protocol; Multipath routing; Static routing; Optimized Link State Routing Protocol; Algorithm; Distributed computing; Routing (electronic design automation); Routing protocol; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04607843156584731,"gpt":0.303006085752787,"spread":0.2569276541869397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004819903,0.0002639604,0.0002224214,0.0001975029,0.0005313909,0.0003774633,0.00300187,0.0001013059,0.00004149526],"category_scores_gemma":[0.00001598377,0.0002675265,0.00007026628,0.0002692765,0.0002069905,0.0006166016,0.0005043965,0.0005296622,0.00013454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001703921,"about_ca_system_score_gemma":0.0002122659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003395631,"about_ca_topic_score_gemma":0.00002382338,"domain_scores_codex":[0.9981108,0.0001191368,0.0004948396,0.0004663842,0.0004548755,0.0003539484],"domain_scores_gemma":[0.9976212,0.0001994105,0.000315663,0.001347214,0.0003879903,0.000128558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001527368,0.000211061,0.0005017664,0.000004546099,0.00004010905,0.00000150935,0.000469288,0.009774892,0.00002694015,0.1523514,0.0007217585,0.8358815],"study_design_scores_gemma":[0.0005837607,0.0001361344,0.001363425,0.0001714996,0.000005743625,0.00001673056,0.00005192048,0.9829748,0.0002087345,0.0003895083,0.01380514,0.0002926256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01934061,0.0004869233,0.923975,0.004469912,0.000863082,0.0003716239,0.00001338705,0.0004162911,0.0500632],"genre_scores_gemma":[0.8719592,0.0004914509,0.1257874,0.001207664,0.0002569446,0.0000291739,0.00002278167,0.00001381641,0.0002315742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9731999,"threshold_uncertainty_score":0.9999777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167124731","doi":"10.1109/pccc.2004.1395006","title":"Differentiated caching of dynamic content using effective page classification","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Dynamic web page; Server; Web page; Web server; Cache; Static web page; Scalability; Proxy server; Computer network; Database; Operating system; World Wide Web; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.09508429031117291,"gpt":0.3267462558231591,"spread":0.2316619655119862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003601513,0.0002007863,0.0002340777,0.0002696582,0.0003341146,0.0001681736,0.001530411,0.00007310892,0.000007769881],"category_scores_gemma":[0.0000253547,0.0001942675,0.00007803721,0.0001666552,0.0001486621,0.0004807975,0.0003216688,0.0003480593,0.00001431965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001757187,"about_ca_system_score_gemma":0.00007601952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001213208,"about_ca_topic_score_gemma":0.00003585208,"domain_scores_codex":[0.9984932,0.0001538983,0.0004830745,0.0003353181,0.0003336206,0.0002008792],"domain_scores_gemma":[0.9981219,0.000145709,0.0003902107,0.0008829387,0.0003911509,0.00006815181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001655185,0.001268357,0.01846455,0.0000914195,0.00039234,0.000002270289,0.002996428,0.006838246,0.09074304,0.1819621,0.0001384833,0.6969373],"study_design_scores_gemma":[0.0005815297,0.00009486447,0.03103348,0.0002577377,0.00001433088,0.00001614628,0.0001058072,0.9668075,0.0005956966,0.0001497435,0.0001472804,0.0001958724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9007545,0.0002517299,0.09502307,0.0007834657,0.0003785157,0.0002408825,0.0000096285,0.0001047924,0.002453484],"genre_scores_gemma":[0.9952279,0.0005595669,0.003796708,0.0001927978,0.00004558399,0.00001312482,0.00003035754,0.00001030595,0.000123636],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9599693,"threshold_uncertainty_score":0.7921999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125442200","doi":"10.1109/pccc.2004.1395056","title":"QoS differentiation in switching-based Web caching","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Cache; Server; Router; Quality of service; Differentiated service; The Internet; Enhanced Data Rates for GSM Evolution; Differentiated services; Service (business); Distributed computing; Service provider; World Wide Web; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04308686393570588,"gpt":0.297312541009238,"spread":0.2542256770735321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403729,0.0002090593,0.0001902726,0.0004080194,0.0003367191,0.0003459507,0.001875054,0.0000750495,0.00001531647],"category_scores_gemma":[0.00002386782,0.0002110068,0.00006075921,0.0001999045,0.00005782855,0.0005883028,0.0002786527,0.0005042042,0.0000495757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001629656,"about_ca_system_score_gemma":0.0001496925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001140265,"about_ca_topic_score_gemma":0.0002255135,"domain_scores_codex":[0.9984365,0.000124157,0.0004540294,0.0003665087,0.0003665424,0.0002522222],"domain_scores_gemma":[0.9985072,0.000136856,0.0002174514,0.0008920057,0.0001707676,0.00007571314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001396229,0.001596002,0.07798336,0.00006507894,0.0001173709,0.000006741466,0.002760251,0.06968348,0.006018101,0.2558826,0.001427012,0.5843204],"study_design_scores_gemma":[0.0008093659,0.00006363453,0.01169714,0.0002213903,0.000004237508,0.000008320474,0.0000348641,0.9845946,0.0001961502,0.0002110338,0.001923533,0.0002357116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9100689,0.0002438939,0.07358003,0.00578288,0.0007487809,0.0001922831,0.000005286581,0.000207206,0.009170692],"genre_scores_gemma":[0.9951668,0.0004325838,0.002940286,0.001132882,0.0001479061,0.00001693439,0.00002635359,0.00001038447,0.0001258314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9149112,"threshold_uncertainty_score":0.8604608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117755518","doi":"10.1109/pccc.2004.1394988","title":"Compositional layered performance modeling of peer-to-peer routing software","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Component (thermodynamics); Traverse; Software deployment; Distributed computing; Component-based software engineering; Peer-to-peer; Software; Software system; Software architecture; Routing (electronic design automation); Generator (circuit theory); Software engineering; Embedded system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05246783063088079,"gpt":0.3175604485567992,"spread":0.2650926179259184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001102979,0.000310192,0.0003603875,0.0003342602,0.0005922072,0.0002217273,0.002768453,0.0001305262,0.00002849064],"category_scores_gemma":[0.00008627817,0.0002978618,0.0001025207,0.000355562,0.000158953,0.0008685341,0.0006760769,0.0004735295,0.0001103275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001759799,"about_ca_system_score_gemma":0.0002352909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004657223,"about_ca_topic_score_gemma":0.00001391154,"domain_scores_codex":[0.9970285,0.00009283185,0.0008801369,0.0005160572,0.001097942,0.0003845387],"domain_scores_gemma":[0.9961347,0.0001556153,0.0003424046,0.001368785,0.001837943,0.0001605242],"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.0002880145,0.001373628,0.09962599,0.0003060017,0.0003072653,0.000002163992,0.008630825,0.4842373,0.001040724,0.06716932,0.004224312,0.3327945],"study_design_scores_gemma":[0.0006133437,0.0001861675,0.008452498,0.0004445914,0.000007929863,0.00003267788,0.00008898181,0.9858402,0.0006055415,0.0001858437,0.003195599,0.0003466046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7844978,0.0001095441,0.1996645,0.006558178,0.0007013169,0.0003414003,0.00002450101,0.0002557438,0.007846952],"genre_scores_gemma":[0.9399031,0.0002466214,0.05850359,0.0006972936,0.0001654234,0.00002804194,0.00005302657,0.00001676237,0.000386177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5016029,"threshold_uncertainty_score":0.9999474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096077520","doi":"10.1109/pccc.2004.1395026","title":"Position-based routing with a power-aware weighted forwarding function in MANETs","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Routing protocol; Energy consumption; Wireless Routing Protocol; Link-state routing protocol; Virtual routing and forwarding; Destination-Sequenced Distance Vector routing; Hop (telecommunications); Routing (electronic design automation); Static routing; Geographic routing; Distributed computing; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02220944207126624,"gpt":0.2723973866518,"spread":0.2501879445805337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003897506,0.000237272,0.0002054517,0.0003144297,0.0003664783,0.000308041,0.001502816,0.00009059292,0.00003544046],"category_scores_gemma":[0.000006641736,0.0002271091,0.0000425072,0.0003616067,0.0001064716,0.0006591816,0.0002229936,0.0004627227,0.00004016101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002125551,"about_ca_system_score_gemma":0.0001668575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004050411,"about_ca_topic_score_gemma":0.000119049,"domain_scores_codex":[0.9983059,0.0001016842,0.0004507355,0.0004248349,0.0004009869,0.0003158352],"domain_scores_gemma":[0.9982678,0.0001513118,0.0002711513,0.0009342122,0.0002893256,0.00008623168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004116674,0.001149645,0.05340085,0.00005599927,0.0001861209,0.00001537184,0.00220817,0.1075304,0.0002375552,0.4097782,0.001162393,0.4238637],"study_design_scores_gemma":[0.0009561355,0.0002395439,0.01178549,0.0004264548,0.000006599555,0.00002510567,0.00006052147,0.9839427,0.0001311893,0.0002795654,0.00187411,0.0002725433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3747437,0.0001939849,0.5947193,0.004925756,0.0004853648,0.0004984332,0.000007021059,0.0003234224,0.02410298],"genre_scores_gemma":[0.9844034,0.0001400631,0.0141993,0.0009807515,0.00009229165,0.00003934159,0.00004633128,0.00001505139,0.00008344595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8764124,"threshold_uncertainty_score":0.9261242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}