{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"C. Zhang","is_ca":true},{"name":"Rick Xing Ze Lu","is_ca":true},{"name":"Xiaona Lin","is_ca":true},{"name":"P.-H. Ho","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958221,0.0006074101,0.0009553222,0.0005290028,0.001126434,0.001132805,0.002535263,0.0008802485,0.001534681],"category_scores_gemma":[0.00366409,0.0003387326,0.0005426006,0.0007994621,0.0008825711,0.002864542,0.002142805,0.001283361,0.0007251042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00135898,"about_ca_system_score_gemma":0.002469942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001897725,"about_ca_topic_score_gemma":0.00138274,"domain_scores_codex":[0.997543,0.000530807,0.0002354731,0.0004897923,0.0009005166,0.0003004125],"domain_scores_gemma":[0.9976079,0.0004900091,0.0003466738,0.0008895355,0.0005251003,0.0001408],"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.002937586,0.0002888957,0.001797167,0.0003831899,0.0001224382,0.0006961327,0.0006659966,0.1667266,0.1797034,0.2804669,0.009285078,0.3569266],"study_design_scores_gemma":[0.000150825,0.00043623,0.0003809083,0.00002094372,0.00005228149,0.0003806337,0.0000603816,0.9051923,0.05211521,0.02972902,0.01138423,0.0000971096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02216095,0.0003023825,0.9739702,0.0001793446,0.0001365195,0.0001719831,0.0001189268,0.0009209108,0.002038755],"genre_scores_gemma":[0.7806017,0.0002552893,0.2131464,0.0001203128,0.0001032986,0.0002277542,0.0004378962,0.00004461404,0.005062767],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002535263,"threshold_uncertainty_score":0.01035619,"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","authors":[{"name":"R. Lu","is_ca":true},{"name":"X. Lin","is_ca":true},{"name":"Haojin Zhu","is_ca":true},{"name":"P.-H. Ho","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792621,0.0005401382,0.0004863963,0.0006201344,0.0008554563,0.001161246,0.001687887,0.0008188125,0.001656084],"category_scores_gemma":[0.003296156,0.000265244,0.0003947425,0.001005637,0.001074397,0.002865362,0.003574476,0.001603921,0.0004971992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005116211,"about_ca_system_score_gemma":0.001511656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007547055,"about_ca_topic_score_gemma":0.0006423536,"domain_scores_codex":[0.9983445,0.0004348836,0.000122956,0.000189938,0.0006780915,0.0002295562],"domain_scores_gemma":[0.9982802,0.0004655443,0.0001747959,0.0006253571,0.0003659253,0.00008824606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009483095,0.0002150522,0.001763705,0.0008245974,0.0001538582,0.001478043,0.0009959395,0.1281961,0.07509923,0.4499928,0.01947087,0.3208614],"study_design_scores_gemma":[0.0001880388,0.0008964013,0.001137332,0.000112879,0.0001831899,0.002973861,0.0003196137,0.6583207,0.1007748,0.136634,0.09825709,0.0002020442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01314213,0.0004544692,0.9808475,0.0003318606,0.0001378399,0.0002393063,0.0001597094,0.0009365953,0.003750514],"genre_scores_gemma":[0.769824,0.0007594911,0.2207091,0.0003818882,0.0001259667,0.0005033636,0.0007448026,0.000108283,0.006843117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001792621,"threshold_uncertainty_score":0.009480417,"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","authors":[{"name":"M. Ghaderi","is_ca":true},{"name":"Don Towsley","is_ca":false},{"name":"J. Kurose","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127286,0.0005786794,0.0005280016,0.0008243973,0.000360139,0.001060458,0.0007800886,0.0006730843,0.0008612133],"category_scores_gemma":[0.01785033,0.000282044,0.0002213719,0.0007627059,0.001622796,0.002278533,0.001046866,0.001161794,0.0001862217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271738,"about_ca_system_score_gemma":0.0006324219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008996633,"about_ca_topic_score_gemma":0.0005855751,"domain_scores_codex":[0.9986871,0.0004360686,0.00003472877,0.0001157814,0.0005561507,0.0001701639],"domain_scores_gemma":[0.9844781,0.01204485,0.001083053,0.001043794,0.00118097,0.0001691742],"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.0001900397,0.0000550377,0.001541262,0.0001881237,0.00004746777,0.00017888,0.0002689858,0.6886225,0.01592555,0.2424514,0.001073625,0.04945713],"study_design_scores_gemma":[0.00001314624,0.0001203167,0.0007028075,0.00003729709,0.00002610883,0.000197765,0.00006151696,0.879589,0.004919631,0.1129363,0.001372895,0.00002327628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088764,0.004858915,0.7703411,0.001143643,0.0001166338,0.00004160178,0.0001056856,0.0004807398,0.01403525],"genre_scores_gemma":[0.9743904,0.00191226,0.02237313,0.00008796999,0.0001036167,0.00004516852,0.0000430598,0.00004905358,0.0009953739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002127286,"threshold_uncertainty_score":0.01125032,"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","authors":[{"name":"Brent Ishibashi","is_ca":true},{"name":"N. Bouabdallah","is_ca":false},{"name":"Raouf Boutaba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199646,0.0006839621,0.0004906997,0.0007115904,0.0004708863,0.00139839,0.0009554119,0.0005654419,0.0008564073],"category_scores_gemma":[0.006980339,0.0002793393,0.0002661701,0.0004338664,0.001244367,0.0009872472,0.0008427455,0.000632879,0.0001620818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180041,"about_ca_system_score_gemma":0.0008998815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599727,"about_ca_topic_score_gemma":0.001329882,"domain_scores_codex":[0.9988913,0.0003751444,0.00002337369,0.00008800533,0.0003853153,0.0002368558],"domain_scores_gemma":[0.996089,0.002559484,0.0002798827,0.0002107409,0.0006843247,0.0001766036],"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.0001737572,0.00004178202,0.0006562002,0.00004490947,0.00002531857,0.00009779344,0.00007936332,0.9386256,0.005273599,0.0452229,0.0003361421,0.009422606],"study_design_scores_gemma":[0.000003342755,0.00002508884,0.0001335479,0.000003957244,0.000004521142,0.00002609172,0.00001066902,0.9946687,0.0005507004,0.004431394,0.0001365903,0.000005433081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3762326,0.002218396,0.6037022,0.0004263864,0.0001506091,0.00005813181,0.00008163883,0.0002711238,0.01685902],"genre_scores_gemma":[0.9948607,0.0002771171,0.004283323,0.00003163791,0.00002194924,0.00001574068,0.00001644727,0.00001082984,0.0004823789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003599727,"threshold_uncertainty_score":0.01306289,"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","authors":[{"name":"Y. Lin","is_ca":true},{"name":"B. Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649613,0.0004059771,0.0004093186,0.0006830638,0.0005535642,0.0007028077,0.0009852246,0.0006544708,0.0005759776],"category_scores_gemma":[0.007175876,0.0002511446,0.0001942991,0.00106247,0.001359532,0.001450107,0.001082151,0.0006773036,0.0001608734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114121,"about_ca_system_score_gemma":0.001025414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001769189,"about_ca_topic_score_gemma":0.001640606,"domain_scores_codex":[0.9990645,0.0003451678,0.00004143331,0.00007874217,0.0003808438,0.00008932004],"domain_scores_gemma":[0.9967001,0.002187149,0.0003604013,0.0003679066,0.000319562,0.00006488484],"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.0002068435,0.0000624974,0.0005831107,0.0001941,0.00002237261,0.0002342228,0.0003232241,0.7555389,0.02346359,0.1612295,0.001419799,0.05672181],"study_design_scores_gemma":[0.0000262082,0.00007146958,0.0001342884,0.0000253205,0.00001070936,0.0001620179,0.00005081212,0.9405276,0.007183123,0.04897641,0.002808793,0.00002327671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03810901,0.0005036005,0.9573622,0.000269478,0.00004895102,0.00008146269,0.00005543333,0.0002564667,0.003313372],"genre_scores_gemma":[0.7829704,0.0007103969,0.2138532,0.0001220771,0.0000392838,0.0002170868,0.00008218929,0.00005182209,0.001953525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001769189,"threshold_uncertainty_score":0.008724093,"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","authors":[{"name":"Ke Ma","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":false},{"name":"J. Luo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01344874,0.001628014,0.001381995,0.001252102,0.001209392,0.002439101,0.001227036,0.001287622,0.002118614],"category_scores_gemma":[0.02630625,0.0005236366,0.0004328421,0.0009465818,0.00289754,0.002296657,0.0023801,0.001998841,0.000210669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997883,"about_ca_system_score_gemma":0.002364443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004493014,"about_ca_topic_score_gemma":0.002290023,"domain_scores_codex":[0.9972172,0.001656306,0.0000777175,0.0002007752,0.0004825198,0.0003654841],"domain_scores_gemma":[0.981164,0.01544174,0.0009744223,0.0005920771,0.001287954,0.000539689],"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.001138777,0.0002296835,0.0006422158,0.0001006258,0.0000454412,0.0000294269,0.0001094509,0.9351091,0.001353023,0.03701423,0.0008850673,0.02334281],"study_design_scores_gemma":[0.00002412127,0.00008833046,0.00005704936,0.00001083143,0.000006645381,0.000007147617,0.00001485393,0.9947405,0.0003252331,0.004632171,0.00008745938,0.000005702122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3278776,0.004834637,0.6444692,0.001723724,0.0004182299,0.0002415104,0.0001086667,0.000513637,0.01981285],"genre_scores_gemma":[0.9616938,0.0007599353,0.0358379,0.0001307866,0.00006083817,0.00007976493,0.00004111354,0.00005645843,0.001339376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01344874,"threshold_uncertainty_score":0.07112461,"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","authors":[{"name":"Q. Zhu","is_ca":true},{"name":"Lacra Pavel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001859702,0.001680733,0.001067228,0.0009037206,0.0008076375,0.001935921,0.001627053,0.001881153,0.00636115],"category_scores_gemma":[0.00422935,0.000566847,0.001178042,0.001206042,0.003455168,0.002582841,0.001936359,0.003321882,0.0006487781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002284561,"about_ca_system_score_gemma":0.001734219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003801333,"about_ca_topic_score_gemma":0.003221673,"domain_scores_codex":[0.9984177,0.0008530976,0.00005577769,0.0001586893,0.0003597515,0.0001549018],"domain_scores_gemma":[0.9979546,0.001491096,0.0001818503,0.00007060014,0.000184843,0.0001168832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009837693,0.00001834155,0.00005010832,0.00004371684,0.00001426865,0.00005198197,0.00006456749,0.05705916,0.0002385658,0.9365595,0.001190258,0.004699697],"study_design_scores_gemma":[0.00002103811,0.00003209092,0.00003926727,0.00002606096,0.000006675522,0.00003228295,0.0000318152,0.2453544,0.0001169904,0.7504008,0.003922233,0.00001627067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004856613,0.00104512,0.9636891,0.001551811,0.0001974312,0.0000698739,0.00009757294,0.00007180526,0.02842075],"genre_scores_gemma":[0.7424118,0.005350763,0.2138305,0.002169504,0.001349072,0.001100859,0.0002391671,0.0001558075,0.03339257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00636115,"threshold_uncertainty_score":0.02128017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}