{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022160945,0.00030238254,0.97397023,0.0001793446,0.00013651952,0.00017198308,0.00011892679,0.0009209108,0.0020387555],"genre_scores_gemma":[0.78060174,0.00025528925,0.2131464,0.000120312805,0.00010329856,0.00022775424,0.0004378962,0.00004461404,0.0050627673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997543,0.000530807,0.0002354731,0.00048979226,0.00090051664,0.0003004125],"domain_scores_gemma":[0.99760795,0.00049000914,0.00034667383,0.0008895355,0.00052510033,0.0001408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019582214,0.0006074101,0.00095532223,0.0005290028,0.0011264338,0.0011328052,0.0025352633,0.0008802485,0.0015346806],"category_scores_gemma":[0.0036640898,0.00033873264,0.0005426006,0.0007994621,0.0008825711,0.0028645424,0.0021428047,0.0012833611,0.0007251042],"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.0029375858,0.00028889568,0.0017971665,0.00038318985,0.00012243817,0.00069613266,0.0006659966,0.16672662,0.17970338,0.28046694,0.009285078,0.35692662],"study_design_scores_gemma":[0.000150825,0.00043622998,0.00038090826,0.000020943722,0.00005228149,0.00038063375,0.0000603816,0.9051923,0.05211521,0.029729016,0.011384228,0.0000971096],"about_ca_topic_score_codex":0.0018977247,"about_ca_topic_score_gemma":0.0013827401,"teacher_disagreement_score":0.0025352633,"about_ca_system_score_codex":0.0013589801,"about_ca_system_score_gemma":0.002469942,"threshold_uncertainty_score":0.010356188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32787755,0.0048346366,0.6444692,0.0017237243,0.00041822993,0.00024151037,0.00010866671,0.000513637,0.019812852],"genre_scores_gemma":[0.9616938,0.0007599353,0.0358379,0.00013078658,0.00006083817,0.000079764926,0.00004111354,0.000056458433,0.0013393759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972172,0.001656306,0.0000777175,0.00020077516,0.0004825198,0.0003654841],"domain_scores_gemma":[0.98116404,0.015441742,0.0009744223,0.0005920771,0.0012879536,0.00053968903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0134487385,0.0016280139,0.0013819949,0.0012521019,0.0012093921,0.0024391005,0.0012270357,0.0012876224,0.0021186138],"category_scores_gemma":[0.026306245,0.00052363664,0.00043284206,0.0009465818,0.0028975399,0.0022966573,0.0023800998,0.0019988413,0.00021066902],"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.0011387767,0.00022968352,0.0006422158,0.00010062582,0.000045441204,0.000029426896,0.000109450906,0.93510914,0.0013530235,0.037014235,0.00088506733,0.023342807],"study_design_scores_gemma":[0.000024121275,0.00008833046,0.000057049365,0.000010831431,0.0000066453813,0.0000071476165,0.000014853928,0.99474055,0.00032523312,0.004632171,0.000087459375,0.0000057021216],"about_ca_topic_score_codex":0.0044930144,"about_ca_topic_score_gemma":0.0022900226,"teacher_disagreement_score":0.0134487385,"about_ca_system_score_codex":0.0029978827,"about_ca_system_score_gemma":0.002364443,"threshold_uncertainty_score":0.07112461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37623256,0.002218396,0.6037022,0.00042638637,0.00015060912,0.000058131805,0.00008163883,0.00027112383,0.01685902],"genre_scores_gemma":[0.9948607,0.00027711707,0.004283323,0.00003163791,0.000021949241,0.000015740678,0.000016447268,0.000010829837,0.0004823789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988913,0.00037514436,0.000023373686,0.000088005334,0.0003853153,0.00023685582],"domain_scores_gemma":[0.996089,0.0025594842,0.00027988266,0.00021074091,0.0006843247,0.00017660364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021996463,0.0006839621,0.0004906997,0.0007115904,0.00047088633,0.0013983899,0.00095541193,0.0005654419,0.0008564073],"category_scores_gemma":[0.0069803386,0.00027933926,0.00026617013,0.00043386637,0.0012443673,0.0009872472,0.00084274553,0.000632879,0.00016208181],"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.0001737572,0.000041782023,0.00065620017,0.000044909473,0.000025318574,0.00009779344,0.000079363315,0.93862563,0.005273599,0.045222897,0.00033614208,0.009422606],"study_design_scores_gemma":[0.0000033427546,0.000025088837,0.00013354789,0.000003957244,0.0000045211423,0.000026091722,0.00001066902,0.99466866,0.0005507004,0.004431394,0.0001365903,0.000005433081],"about_ca_topic_score_codex":0.0035997273,"about_ca_topic_score_gemma":0.0013298817,"teacher_disagreement_score":0.0035997273,"about_ca_system_score_codex":0.0018004101,"about_ca_system_score_gemma":0.0008998815,"threshold_uncertainty_score":0.013062894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810901,0.0005036005,0.95736223,0.00026947798,0.00004895102,0.00008146269,0.000055433335,0.00025646665,0.0033133717],"genre_scores_gemma":[0.7829704,0.00071039685,0.21385315,0.00012207712,0.000039283805,0.00021708684,0.00008218929,0.000051822095,0.0019535252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990645,0.00034516782,0.000041433308,0.00007874217,0.0003808438,0.00008932004],"domain_scores_gemma":[0.9967001,0.0021871491,0.00036040135,0.00036790658,0.00031956204,0.000064884836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496128,0.00040597707,0.00040931863,0.0006830638,0.0005535642,0.00070280774,0.0009852246,0.00065447076,0.0005759776],"category_scores_gemma":[0.0071758763,0.00025114464,0.0001942991,0.0010624704,0.0013595324,0.0014501067,0.0010821507,0.0006773036,0.00016087345],"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.00020684347,0.0000624974,0.00058311067,0.00019409996,0.00002237261,0.00023422281,0.00032322406,0.75553894,0.023463592,0.1612295,0.0014197989,0.056721807],"study_design_scores_gemma":[0.0000262082,0.00007146958,0.00013428845,0.000025320496,0.000010709365,0.00016201787,0.000050812123,0.9405276,0.007183123,0.048976406,0.0028087934,0.00002327671],"about_ca_topic_score_codex":0.0017691887,"about_ca_topic_score_gemma":0.0016406063,"teacher_disagreement_score":0.0017691887,"about_ca_system_score_codex":0.0011412101,"about_ca_system_score_gemma":0.0010254141,"threshold_uncertainty_score":0.008724093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013142133,0.0004544692,0.9808475,0.00033186065,0.00013783993,0.00023930626,0.00015970937,0.0009365953,0.003750514],"genre_scores_gemma":[0.76982397,0.00075949106,0.22070909,0.00038188824,0.00012596672,0.00050336355,0.0007448026,0.00010828296,0.006843117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834454,0.00043488358,0.00012295596,0.00018993801,0.00067809154,0.00022955623],"domain_scores_gemma":[0.99828017,0.00046554432,0.00017479586,0.0006253571,0.00036592534,0.00008824606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017926208,0.0005401382,0.00048639634,0.0006201344,0.0008554563,0.0011612462,0.0016878874,0.00081881246,0.0016560843],"category_scores_gemma":[0.0032961564,0.00026524396,0.0003947425,0.0010056371,0.0010743974,0.0028653624,0.0035744759,0.0016039213,0.00049719925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00094830955,0.00021505216,0.0017637052,0.00082459743,0.00015385817,0.0014780432,0.0009959395,0.12819612,0.07509923,0.44999284,0.019470872,0.32086143],"study_design_scores_gemma":[0.00018803879,0.0008964013,0.0011373322,0.00011287897,0.00018318991,0.0029738613,0.00031961367,0.65832067,0.10077481,0.13663404,0.098257095,0.00020204425],"about_ca_topic_score_codex":0.0007547055,"about_ca_topic_score_gemma":0.0006423536,"teacher_disagreement_score":0.0017926208,"about_ca_system_score_codex":0.00051162107,"about_ca_system_score_gemma":0.001511656,"threshold_uncertainty_score":0.009480417},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048566135,0.0010451197,0.9636891,0.0015518111,0.00019743125,0.0000698739,0.00009757294,0.00007180526,0.028420746],"genre_scores_gemma":[0.7424118,0.0053507625,0.21383047,0.0021695043,0.0013490722,0.0011008591,0.0002391671,0.00015580749,0.033392575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841774,0.0008530976,0.000055777688,0.00015868929,0.00035975146,0.00015490183],"domain_scores_gemma":[0.9979546,0.0014910965,0.00018185031,0.00007060014,0.00018484304,0.00011688317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018597019,0.0016807329,0.001067228,0.00090372056,0.00080763747,0.0019359215,0.0016270533,0.0018811532,0.0063611497],"category_scores_gemma":[0.00422935,0.00056684704,0.0011780423,0.0012060421,0.0034551683,0.0025828406,0.0019363592,0.0033218816,0.0006487781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000009837693,0.000018341547,0.000050108323,0.000043716842,0.000014268646,0.00005198197,0.00006456749,0.05705916,0.00023856584,0.9365595,0.0011902577,0.004699697],"study_design_scores_gemma":[0.000021038113,0.000032090917,0.000039267274,0.000026060958,0.000006675522,0.00003228295,0.0000318152,0.24535438,0.00011699042,0.75040084,0.003922233,0.000016270673],"about_ca_topic_score_codex":0.003801333,"about_ca_topic_score_gemma":0.0032216727,"teacher_disagreement_score":0.0063611497,"about_ca_system_score_codex":0.002284561,"about_ca_system_score_gemma":0.0017342187,"threshold_uncertainty_score":0.02128017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20887636,0.004858915,0.7703411,0.0011436433,0.00011663381,0.000041601783,0.00010568557,0.00048073978,0.014035247],"genre_scores_gemma":[0.97439045,0.0019122597,0.022373127,0.000087969995,0.00010361673,0.000045168515,0.000043059797,0.00004905358,0.0009953739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986871,0.00043606857,0.000034728768,0.00011578144,0.0005561507,0.00017016385],"domain_scores_gemma":[0.9844781,0.012044851,0.0010830528,0.0010437936,0.0011809696,0.00016917424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127286,0.0005786794,0.0005280016,0.0008243973,0.00036013898,0.001060458,0.0007800886,0.00067308435,0.00086121325],"category_scores_gemma":[0.017850326,0.00028204403,0.00022137185,0.0007627059,0.0016227963,0.0022785326,0.0010468658,0.0011617944,0.00018622169],"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.00019003975,0.000055037697,0.0015412625,0.00018812367,0.000047467773,0.00017887997,0.00026898584,0.68862253,0.015925545,0.2424514,0.0010736247,0.04945713],"study_design_scores_gemma":[0.000013146236,0.00012031672,0.0007028075,0.000037297094,0.000026108832,0.00019776504,0.00006151696,0.87958896,0.004919631,0.112936296,0.001372895,0.000023276285],"about_ca_topic_score_codex":0.00089966325,"about_ca_topic_score_gemma":0.0005855751,"teacher_disagreement_score":0.002127286,"about_ca_system_score_codex":0.0012717376,"about_ca_system_score_gemma":0.0006324219,"threshold_uncertainty_score":0.011250317},"labels":[],"label_agreement":null}]}