{"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":"a5a3cf480050","filters":{"venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications"}},"results":[{"id":"W4229627031","doi":"10.1109/infocom.2007.58","title":"An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scalability; Overhead (engineering); Authentication (law); Scheme (mathematics); Wireless sensor network; Tamper resistance; Transmission (telecommunications); Digital signature; Dedicated short-range communications; Computer security; Wireless; Hash function; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0722334421260509,"gpt":0.3237108225046818,"spread":0.2514773803786309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008711228,0.0004006839,0.0003481793,0.0002155442,0.00196172,0.0006197336,0.006863612,0.0001744888,0.00000827926],"category_scores_gemma":[0.00007408398,0.0003555675,0.000175234,0.0009375522,0.0005556568,0.001205188,0.0004704786,0.0006396864,0.00007018624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001500038,"about_ca_system_score_gemma":0.0002704974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001259617,"about_ca_topic_score_gemma":0.000004169978,"domain_scores_codex":[0.9971733,0.0001439481,0.0007465082,0.0007528954,0.0006176117,0.0005657177],"domain_scores_gemma":[0.9939482,0.0003880475,0.0005978665,0.003296667,0.001542124,0.0002271139],"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.00003758165,0.0008748869,0.0003882848,0.00003807562,0.00003794759,9.602683e-7,0.001919509,0.03720495,0.0007218074,0.9545258,0.0005786546,0.003671547],"study_design_scores_gemma":[0.0007456308,0.0002269024,0.001498176,0.00008640972,0.00001381282,0.00002034336,0.00004744803,0.9840961,0.0009320385,0.008850846,0.003065554,0.0004167757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01062151,0.0000367267,0.9787167,0.003847041,0.0002855116,0.005547707,0.00001243101,0.0005672914,0.000365046],"genre_scores_gemma":[0.6496872,0.00004044982,0.3456503,0.001068893,0.0001229158,0.003349499,0.00003414648,0.0000282896,0.000018315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468911,"threshold_uncertainty_score":0.9998896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4254037431","doi":"10.1109/infocom.2007.179","title":"ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Traceability; Authentication (law); Protocol (science); Computer security; Authentication protocol; Computer network; Wireless ad hoc network; Vehicular ad hoc network; Message authentication code; Cryptographic protocol; Cryptography; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.08872693697510635,"gpt":0.3015327213198537,"spread":0.2128057843447473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005020289,0.0004615967,0.0003849606,0.0001933604,0.001647566,0.0002520533,0.004477116,0.0002232502,0.00003412826],"category_scores_gemma":[0.00005948263,0.00040785,0.0002035282,0.0005783672,0.0006556052,0.0004708033,0.0006764553,0.0009759926,0.0000942061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002150094,"about_ca_system_score_gemma":0.000188323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329432,"about_ca_topic_score_gemma":0.0000153333,"domain_scores_codex":[0.9976391,0.00008963087,0.000797881,0.0003706031,0.00051358,0.0005892557],"domain_scores_gemma":[0.9953586,0.000489844,0.000294268,0.002665478,0.001010117,0.0001816323],"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.00007620418,0.0008395801,0.0003994745,0.0002592542,0.0003473153,0.000001788935,0.00474613,0.7028149,0.0007611064,0.1464028,0.1404,0.002951469],"study_design_scores_gemma":[0.001027538,0.00009981722,0.001106752,0.0001927801,0.00002890334,0.00004945378,0.00004098495,0.8359758,0.0002446942,0.001927064,0.158912,0.000394231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05210582,0.0003913127,0.4859047,0.0312336,0.001090656,0.3917891,0.0005384961,0.00539293,0.03155338],"genre_scores_gemma":[0.7136222,0.0001558438,0.05146181,0.0007695566,0.0003806393,0.2329573,0.0003806716,0.0001221973,0.0001497558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6615164,"threshold_uncertainty_score":0.9998373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256585095","doi":"10.1109/infocom.2007.284","title":"Reliability Gain of Network Coding in Lossy Wireless Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Defense Advanced Research Projects Agency","keywords":"Linear network coding; Computer science; Computer network; Lossy compression; Multicast; Network packet; Wireless network; Hybrid automatic repeat request; Automatic repeat request; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0744193789523344,"gpt":0.2863410622185397,"spread":0.2119216832662053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00154793,0.0003845769,0.0005626071,0.0002219721,0.001154301,0.0002178485,0.007816895,0.0001663412,0.00001541073],"category_scores_gemma":[0.0000780943,0.0003259791,0.0001552543,0.001976289,0.0008397469,0.0007300419,0.002102883,0.001220233,0.00002369738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001473937,"about_ca_system_score_gemma":0.0002385044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004453176,"about_ca_topic_score_gemma":0.00008166606,"domain_scores_codex":[0.9969498,0.0003634527,0.001089889,0.000537834,0.0004435793,0.0006154287],"domain_scores_gemma":[0.9942206,0.0009850923,0.0005782535,0.003136615,0.0009341071,0.0001453687],"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.00005827975,0.0007883938,0.01550222,0.00004402644,0.00007398872,0.00000450911,0.009117363,0.03419603,0.0002772221,0.8714247,0.01596841,0.05254488],"study_design_scores_gemma":[0.0005354441,0.0001307297,0.0153962,0.0003882028,0.000007119068,0.00003161617,0.0000536329,0.9777511,0.000116577,0.002095881,0.003108181,0.0003852729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09789198,0.001034468,0.8630829,0.01188857,0.0009789993,0.00225856,0.000006795461,0.0006448472,0.02221286],"genre_scores_gemma":[0.9633135,0.006463241,0.02881769,0.0009931435,0.0001473846,0.0001571498,0.000007579163,0.00002226592,0.0000780866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9435551,"threshold_uncertainty_score":0.9999192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233163402","doi":"10.1109/infocom.2007.312","title":"QoS Performance Analysis of Cognitive Radio-Based Virtual Wireless Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cognitive radio; Computer science; Computer network; Quality of service; Wireless; Wireless network; Reliability (semiconductor); Bandwidth (computing); Radio resource management; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04296106538747212,"gpt":0.2580450880333515,"spread":0.2150840226458793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005324254,0.0004056324,0.0006764308,0.000591956,0.001233943,0.0002513237,0.00365257,0.000142752,0.00001420825],"category_scores_gemma":[0.00003485163,0.0003386917,0.0003104533,0.003117591,0.0009363794,0.0005830032,0.0005693564,0.0007994528,0.00001548712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008841472,"about_ca_system_score_gemma":0.0002475156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004902889,"about_ca_topic_score_gemma":0.00003116018,"domain_scores_codex":[0.9974461,0.0001417813,0.0007504593,0.000549634,0.0005634208,0.0005486727],"domain_scores_gemma":[0.9954591,0.00118237,0.000607727,0.001427059,0.001159403,0.0001643691],"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.0004685777,0.002899182,0.05531263,0.00007564959,0.005003613,0.00003121854,0.02535306,0.1440971,0.0003754301,0.3230119,0.008445273,0.4349263],"study_design_scores_gemma":[0.0005771747,0.000349007,0.0286073,0.0002498513,0.0001991252,0.00002890763,0.00008117767,0.968964,0.0002823098,0.00005796849,0.0002179135,0.0003852169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3107049,0.0001002769,0.6832359,0.001384214,0.0003336599,0.0005843419,0.00001232706,0.0002344276,0.003409908],"genre_scores_gemma":[0.9904236,0.0007912337,0.007528802,0.0009156002,0.0001832746,0.00006264232,0.00002949062,0.0000222525,0.00004314193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8248669,"threshold_uncertainty_score":0.9999065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241742544","doi":"10.1109/infocom.2007.210","title":"Efficient Network Coded Data Transmissions in Disruption Tolerant Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","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":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Routing protocol; Erasure code; Network packet; Delay-tolerant networking; Data transmission; Zone Routing Protocol; Distributed computing; Wireless Routing Protocol; Decoding methods; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1237104664036234,"gpt":0.2985044084170609,"spread":0.1747939420134376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001111954,0.0004702718,0.0005301597,0.0001917589,0.001581977,0.0004163669,0.009735107,0.0002229349,0.00002061163],"category_scores_gemma":[0.00001182193,0.0003710413,0.0001212394,0.001365687,0.0005687779,0.0005032952,0.001931618,0.001284612,0.00005644391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009265401,"about_ca_system_score_gemma":0.0003239091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007733102,"about_ca_topic_score_gemma":0.00004601197,"domain_scores_codex":[0.996487,0.0001847244,0.001015861,0.0008452387,0.0006029601,0.0008641693],"domain_scores_gemma":[0.9942868,0.0005886444,0.0004043099,0.004045105,0.0003762222,0.0002989555],"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.0001867338,0.002259417,0.003763373,0.00005053991,0.0001832135,0.00007207445,0.01122746,0.3258547,0.00003457695,0.3233051,0.1037584,0.2293044],"study_design_scores_gemma":[0.0006639005,0.0001106427,0.001993006,0.0002937682,0.00001830627,0.0001310373,0.00004937442,0.9876604,0.000001893249,0.001096764,0.007535357,0.0004455592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005882504,0.0003517926,0.9772147,0.007424425,0.0007774819,0.001017445,0.00001818743,0.0003795165,0.006933952],"genre_scores_gemma":[0.9447617,0.001159106,0.05173207,0.001637177,0.0003611014,0.0001295932,0.00007721773,0.00002997532,0.0001120482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9388792,"threshold_uncertainty_score":0.9998742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232643876","doi":"10.1109/infocom.2007.74","title":"On the Performance of Primal/Dual Schemes for Congestion Control in Networks with Dynamic Flows","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Network Traffic and Congestion Control","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 Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; FIFO (computing and electronics); Queueing theory; Stability (learning theory); Dual (grammatical number); Maximization; Utility maximization; Network congestion; Flow control (data); Class (philosophy); Function (biology); Mathematics; Mathematical economics; Network packet; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02742320356552105,"gpt":0.235608443829142,"spread":0.208185240263621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008463,0.0003256796,0.0003889946,0.0001578395,0.0007734805,0.0001581877,0.003134364,0.0001176842,0.000005588784],"category_scores_gemma":[0.00003718225,0.0002044101,0.00009727057,0.0006197238,0.0005344748,0.0004149874,0.0002099915,0.0006905497,0.00001066104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007579706,"about_ca_system_score_gemma":0.0002334482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001002746,"about_ca_topic_score_gemma":0.00003296825,"domain_scores_codex":[0.9980997,0.0001052769,0.0005777247,0.0003931538,0.0003847263,0.0004394061],"domain_scores_gemma":[0.9961324,0.001355521,0.0004332343,0.001319666,0.0006798473,0.00007937792],"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.000594539,0.0006917152,0.002118273,0.0000434653,0.0001873539,0.000002226134,0.002452333,0.08613274,0.000134615,0.7795422,0.003433878,0.1246667],"study_design_scores_gemma":[0.001498738,0.0007361604,0.002928081,0.0002611841,0.00001801488,0.00003368302,0.0000325918,0.9922656,0.00003120094,0.0004322703,0.001510805,0.0002516005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3563911,0.0001825316,0.6222031,0.01646917,0.0003353594,0.002850243,0.00001126461,0.0002611387,0.001296043],"genre_scores_gemma":[0.9843339,0.0003473951,0.01297421,0.001512085,0.00007426457,0.0006764124,0.000006273063,0.00002005279,0.00005542061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9061329,"threshold_uncertainty_score":0.8335603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4254575280","doi":"10.1109/infocom.2007.263","title":"Theory of Linear Games with Constraints and Its Application to Power Control of Optical Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Extremum Seeking Control Systems","field":"Engineering","cited_by":0,"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; Control (management); Power (physics); Game theory; Power control; Mathematical optimization; Control theory (sociology); Mathematical economics; Mathematics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02193001880381525,"gpt":0.2289116475278289,"spread":0.2069816287240137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867109,0.0002305993,0.0004108216,0.0001282059,0.0001766433,0.00002874974,0.0009901477,0.0001043317,0.000005978723],"category_scores_gemma":[0.00003330903,0.0001772638,0.00005009323,0.0002892275,0.0005396543,0.0001322103,0.0001086655,0.0003534333,0.000008910743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002843797,"about_ca_system_score_gemma":0.00004738712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006447161,"about_ca_topic_score_gemma":0.000004364664,"domain_scores_codex":[0.9987688,0.00004539633,0.0005180736,0.0001922529,0.0002346972,0.0002407704],"domain_scores_gemma":[0.9979917,0.0004726342,0.0001965174,0.000680974,0.0005478684,0.000110274],"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.0006283876,0.0007230898,0.008649449,0.000391489,0.001216021,0.000003528768,0.02220691,0.09683514,0.05252604,0.7698956,0.001814517,0.0451099],"study_design_scores_gemma":[0.0008799816,0.0003052057,0.003496404,0.0003014156,0.00004139979,0.00006097542,0.0001857584,0.9932643,0.0005238692,0.0002231244,0.0004625399,0.0002550665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09748641,0.0004157292,0.8912269,0.0008048033,0.0001131671,0.001698682,0.00002407116,0.0002359541,0.007994289],"genre_scores_gemma":[0.9947864,0.0001639125,0.004679228,0.0001540747,0.00005385718,0.0001154763,0.000003152694,0.00002993915,0.00001389858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8973001,"threshold_uncertainty_score":0.722861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}