{"meta":{"query_hash":"a5a3cf480050","filters":{"venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a5a3cf480050","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0722334421260509,"score_gpt":0.3237108225046818,"score_spread":0.2514773803786309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229627031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01062151,0.000036726702,0.97871673,0.0038470414,0.00028551163,0.0055477074,0.000012431008,0.0005672914,0.00036504597],"genre_scores_gemma":[0.64968723,0.000040449817,0.3456503,0.0010688925,0.00012291576,0.0033494988,0.00003414648,0.0000282896,0.000018314999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971733,0.00014394811,0.00074650825,0.00075289543,0.0006176117,0.0005657177],"domain_scores_gemma":[0.99394816,0.00038804748,0.0005978665,0.0032966668,0.0015421236,0.00022711391],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008711228,0.00040068393,0.00034817928,0.00021554419,0.0019617197,0.00061973365,0.0068636118,0.0001744888,0.00000827926],"category_scores_gemma":[0.000074083975,0.0003555675,0.00017523402,0.0009375522,0.0005556568,0.0012051883,0.00047047858,0.00063968636,0.000070186245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003758165,0.0008748869,0.00038828477,0.000038075617,0.000037947593,9.602683e-7,0.0019195088,0.037204955,0.0007218074,0.95452577,0.0005786546,0.0036715467],"study_design_scores_gemma":[0.0007456308,0.0002269024,0.0014981757,0.00008640972,0.000013812818,0.000020343361,0.000047448026,0.98409605,0.0009320385,0.0088508455,0.0030655537,0.0004167757],"about_ca_topic_score_codex":0.000012596171,"about_ca_topic_score_gemma":0.000004169978,"teacher_disagreement_score":0.9468911,"about_ca_system_score_codex":0.0001500038,"about_ca_system_score_gemma":0.0002704974,"threshold_uncertainty_score":0.9998896},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027423203565521047,"score_gpt":0.235608443829142,"score_spread":0.20818524026362095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232643876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35639113,0.00018253164,0.6222031,0.016469175,0.00033535942,0.0028502434,0.000011264615,0.0002611387,0.0012960427],"genre_scores_gemma":[0.9843339,0.00034739514,0.012974205,0.0015120847,0.00007426457,0.0006764124,0.0000062730633,0.000020052788,0.00005542061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980997,0.00010527692,0.00057772466,0.00039315378,0.00038472627,0.00043940614],"domain_scores_gemma":[0.9961324,0.0013555209,0.0004332343,0.0013196656,0.0006798473,0.00007937792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008463,0.00032567963,0.00038899464,0.00015783946,0.0007734805,0.0001581877,0.0031343636,0.00011768423,0.0000055887845],"category_scores_gemma":[0.000037182253,0.00020441014,0.00009727057,0.0006197238,0.00053447485,0.00041498741,0.00020999154,0.0006905497,0.0000106610405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059453904,0.0006917152,0.0021182734,0.000043465305,0.00018735389,0.0000022261336,0.0024523332,0.086132735,0.00013461498,0.7795422,0.0034338778,0.12466668],"study_design_scores_gemma":[0.0014987383,0.00073616044,0.0029280805,0.00026118415,0.00001801488,0.000033683024,0.0000325918,0.99226564,0.000031200943,0.00043227035,0.001510805,0.00025160055],"about_ca_topic_score_codex":0.000010027464,"about_ca_topic_score_gemma":0.00003296825,"teacher_disagreement_score":0.90613294,"about_ca_system_score_codex":0.00007579706,"about_ca_system_score_gemma":0.0002334482,"threshold_uncertainty_score":0.83356035},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042961065387472124,"score_gpt":0.25804508803335147,"score_spread":0.21508402264587934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233163402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3107049,0.00010027686,0.68323594,0.0013842136,0.0003336599,0.0005843419,0.000012327056,0.00023442763,0.0034099082],"genre_scores_gemma":[0.99042356,0.0007912337,0.007528802,0.0009156002,0.00018327463,0.00006264232,0.000029490622,0.0000222525,0.00004314193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744606,0.00014178129,0.00075045926,0.000549634,0.0005634208,0.0005486727],"domain_scores_gemma":[0.9954591,0.0011823702,0.00060772704,0.0014270587,0.0011594032,0.00016436909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005324254,0.0004056324,0.0006764308,0.000591956,0.0012339434,0.0002513237,0.0036525696,0.00014275202,0.000014208249],"category_scores_gemma":[0.000034851633,0.00033869167,0.00031045327,0.003117591,0.00093637937,0.00058300316,0.0005693564,0.0007994528,0.000015487121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046857767,0.0028991825,0.05531263,0.00007564959,0.0050036134,0.00003121854,0.025353065,0.14409712,0.00037543013,0.3230119,0.008445273,0.43492633],"study_design_scores_gemma":[0.00057717465,0.00034900702,0.028607303,0.00024985135,0.00019912516,0.00002890763,0.00008117767,0.96896404,0.0002823098,0.00005796849,0.00021791353,0.0003852169],"about_ca_topic_score_codex":0.00004902889,"about_ca_topic_score_gemma":0.000031160183,"teacher_disagreement_score":0.8248669,"about_ca_system_score_codex":0.00008841472,"about_ca_system_score_gemma":0.00024751556,"threshold_uncertainty_score":0.99990654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12371046640362339,"score_gpt":0.29850440841706094,"score_spread":0.17479394201343756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241742544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058825044,0.0003517926,0.9772147,0.0074244253,0.00077748194,0.0010174445,0.000018187427,0.00037951648,0.006933952],"genre_scores_gemma":[0.9447617,0.001159106,0.051732074,0.0016371767,0.00036110138,0.00012959317,0.00007721773,0.000029975325,0.000112048205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996487,0.00018472438,0.0010158608,0.00084523874,0.0006029601,0.0008641693],"domain_scores_gemma":[0.9942868,0.0005886444,0.00040430986,0.0040451046,0.00037622222,0.00029895554],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011119545,0.00047027183,0.0005301597,0.00019175893,0.0015819768,0.00041636694,0.009735107,0.00022293488,0.00002061163],"category_scores_gemma":[0.000011821926,0.00037104127,0.00012123943,0.001365687,0.0005687779,0.0005032952,0.0019316176,0.0012846122,0.000056443914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018673384,0.002259417,0.0037633732,0.000050539915,0.00018321353,0.00007207445,0.011227461,0.32585475,0.00003457695,0.32330507,0.103758425,0.22930437],"study_design_scores_gemma":[0.0006639005,0.00011064271,0.0019930063,0.00029376816,0.000018306275,0.00013103733,0.000049374423,0.9876604,0.0000018932493,0.0010967643,0.0075353575,0.00044555918],"about_ca_topic_score_codex":0.00007733102,"about_ca_topic_score_gemma":0.00004601197,"teacher_disagreement_score":0.9388792,"about_ca_system_score_codex":0.00009265401,"about_ca_system_score_gemma":0.00032390913,"threshold_uncertainty_score":0.9998742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08872693697510635,"score_gpt":0.3015327213198537,"score_spread":0.21280578434474734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254037431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05210582,0.00039131267,0.4859047,0.031233596,0.0010906556,0.39178914,0.00053849607,0.0053929305,0.031553384],"genre_scores_gemma":[0.7136222,0.00015584382,0.051461812,0.0007695566,0.00038063928,0.23295733,0.00038067155,0.0001221973,0.00014975581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763906,0.00008963087,0.00079788105,0.00037060305,0.00051358005,0.0005892557],"domain_scores_gemma":[0.99535865,0.000489844,0.00029426804,0.0026654778,0.0010101172,0.00018163233],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005020289,0.0004615967,0.0003849606,0.00019336042,0.0016475664,0.00025205332,0.0044771163,0.00022325019,0.000034128265],"category_scores_gemma":[0.000059482627,0.00040784996,0.00020352824,0.00057836715,0.0006556052,0.0004708033,0.0006764553,0.0009759926,0.0000942061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007620418,0.0008395801,0.00039947455,0.0002592542,0.0003473153,0.0000017889349,0.00474613,0.70281494,0.0007611064,0.14640276,0.1404,0.0029514686],"study_design_scores_gemma":[0.0010275384,0.00009981722,0.0011067518,0.00019278015,0.000028903338,0.00004945378,0.00004098495,0.8359758,0.0002446942,0.0019270641,0.15891196,0.00039423097],"about_ca_topic_score_codex":0.00001329432,"about_ca_topic_score_gemma":0.000015333302,"teacher_disagreement_score":0.66151637,"about_ca_system_score_codex":0.00021500938,"about_ca_system_score_gemma":0.00018832299,"threshold_uncertainty_score":0.99983734},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021930018803815246,"score_gpt":0.22891164752782894,"score_spread":0.2069816287240137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254575280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09748641,0.00041572916,0.8912269,0.0008048033,0.00011316709,0.0016986821,0.000024071162,0.0002359541,0.007994289],"genre_scores_gemma":[0.99478644,0.00016391247,0.004679228,0.00015407467,0.000053857177,0.00011547628,0.0000031526938,0.000029939149,0.000013898575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987688,0.000045396326,0.0005180736,0.0001922529,0.0002346972,0.00024077045],"domain_scores_gemma":[0.99799174,0.00047263416,0.00019651745,0.00068097404,0.00054786843,0.00011027405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867109,0.0002305993,0.0004108216,0.00012820594,0.00017664333,0.000028749735,0.0009901477,0.00010433172,0.0000059787226],"category_scores_gemma":[0.00003330903,0.00017726385,0.000050093233,0.00028922746,0.00053965434,0.00013221032,0.000108665525,0.00035343334,0.000008910743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062838756,0.00072308985,0.008649449,0.00039148898,0.0012160211,0.0000035287676,0.022206906,0.096835144,0.052526042,0.76989555,0.0018145168,0.045109898],"study_design_scores_gemma":[0.00087998156,0.00030520573,0.0034964038,0.00030141557,0.000041399788,0.00006097542,0.00018575843,0.99326426,0.00052386924,0.00022312441,0.0004625399,0.00025506646],"about_ca_topic_score_codex":0.0000064471615,"about_ca_topic_score_gemma":0.000004364664,"teacher_disagreement_score":0.89730006,"about_ca_system_score_codex":0.000028437973,"about_ca_system_score_gemma":0.00004738712,"threshold_uncertainty_score":0.722861},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0744193789523344,"score_gpt":0.28634106221853967,"score_spread":0.21192168326620525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256585095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09789198,0.0010344676,0.86308295,0.011888566,0.0009789993,0.0022585597,0.000006795461,0.00064484717,0.022212863],"genre_scores_gemma":[0.96331346,0.006463241,0.028817687,0.0009931435,0.00014738458,0.00015714976,0.0000075791627,0.000022265922,0.000078086596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969498,0.0003634527,0.0010898892,0.00053783396,0.00044357928,0.0006154287],"domain_scores_gemma":[0.99422055,0.0009850923,0.00057825353,0.003136615,0.00093410705,0.00014536873],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015479296,0.0003845769,0.0005626071,0.00022197209,0.0011543011,0.0002178485,0.007816895,0.00016634115,0.000015410735],"category_scores_gemma":[0.0000780943,0.00032597905,0.00015525428,0.0019762889,0.0008397469,0.00073004194,0.002102883,0.0012202333,0.000023697385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058279755,0.0007883938,0.015502218,0.00004402644,0.00007398872,0.0000045091097,0.009117363,0.034196027,0.00027722208,0.8714247,0.015968412,0.052544884],"study_design_scores_gemma":[0.00053544407,0.00013072974,0.015396202,0.0003882028,0.000007119068,0.00003161617,0.000053632903,0.97775114,0.000116577015,0.002095881,0.0031081808,0.0003852729],"about_ca_topic_score_codex":0.00004453176,"about_ca_topic_score_gemma":0.00008166606,"teacher_disagreement_score":0.9435551,"about_ca_system_score_codex":0.0001473937,"about_ca_system_score_gemma":0.00023850442,"threshold_uncertainty_score":0.99991924},"labels":[],"label_agreement":null}]}