{"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":"ce7709b5824d","filters":{"venue":"International Journal of Networking and Computing"}},"results":[{"id":"W1880498013","doi":"10.15803/ijnc.4.1_88","title":"Supporting Decentralized SPARQL Queries in an Ad-Hoc Semantic Web Data Sharing System","year":2014,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Ottawa; China Postdoctoral Science Foundation; National High-tech Research and Development Program; National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; SPARQL; Named graph; RDF; Scalability; Semantic Web; Information retrieval; World Wide Web; Query optimization; RDF query language; Database; Web search query; Web query classification; Search engine","authors":[{"name":"Jing Zhou","is_ca":false},{"name":"Gregor von Bochmann","is_ca":true},{"name":"Zhongzhi Shi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04229164176653147,"gpt":0.3304502073818049,"spread":0.2881585656152734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006425852,0.0004792654,0.001155425,0.0009629879,0.002163318,0.003077976,0.002941752,0.001264318,0.001928331],"category_scores_gemma":[0.005671363,0.0005875052,0.0006163412,0.00140213,0.001113876,0.005444183,0.002998128,0.001022717,0.0007012195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001411256,"about_ca_system_score_gemma":0.002970826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004993947,"about_ca_topic_score_gemma":0.004214645,"domain_scores_codex":[0.9959291,0.00105399,0.0004602612,0.0007335315,0.001525643,0.0002974679],"domain_scores_gemma":[0.9957087,0.001583748,0.0002659716,0.001305561,0.0007576653,0.0003783273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002899346,0.002624813,0.01108238,0.0004506967,0.0004165722,0.002800765,0.003073608,0.4641165,0.125045,0.1062088,0.0168973,0.2643841],"study_design_scores_gemma":[0.0001616469,0.000100867,0.0004380588,0.000008582609,0.0000416867,0.0001371841,0.0003661908,0.956363,0.01938669,0.01833829,0.004618822,0.00003890631],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1466273,0.0001143521,0.8384718,0.0007356453,0.00005347265,0.0005389689,0.0002779491,0.009008215,0.004172381],"genre_scores_gemma":[0.691721,0.0001253431,0.3034783,0.0002133688,0.00005638171,0.0003038962,0.0008982845,0.0003029482,0.002900416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006425852,"threshold_uncertainty_score":0.03398359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022105839","doi":"10.15803/ijnc.5.1_61","title":"Handling Non-determinism with Description Logics using a Fork/Join Approach","year":2015,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Computer science; Cardinality (data modeling); Semantic reasoner; Laptop; Theoretical computer science; Description logic; Determinism; Fork (system call); Programming language; Join (topology); Ontology; Ontology language; Artificial intelligence; Semantic Web; Database","authors":[{"name":"Jocelyne Faddoul","is_ca":true},{"name":"Wendy MacCaull","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08842439412181259,"gpt":0.2880373433046703,"spread":0.1996129491828578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008697223,0.0007737749,0.00102797,0.001262142,0.002342847,0.004911133,0.003012764,0.00130459,0.003857445],"category_scores_gemma":[0.009151916,0.001166297,0.003874811,0.00119171,0.004193426,0.00924741,0.005015652,0.003726652,0.0006132196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002630629,"about_ca_system_score_gemma":0.004286673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00667473,"about_ca_topic_score_gemma":0.008336741,"domain_scores_codex":[0.9935603,0.001724085,0.0007498252,0.001207944,0.002233183,0.000524617],"domain_scores_gemma":[0.9919186,0.004608349,0.0005408736,0.001807334,0.0008025461,0.000322335],"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.0003093486,0.0002346186,0.001728544,0.0005802167,0.0002457451,0.0007847503,0.001983782,0.1174008,0.01044389,0.7619729,0.002691149,0.1016242],"study_design_scores_gemma":[0.00009862189,0.00005830334,0.0001108412,0.00006994486,0.0001374837,0.0002317774,0.0002041804,0.3340698,0.0140254,0.6290043,0.02192795,0.00006140098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003899038,0.00006877634,0.9942499,0.0002243844,0.00001974256,0.00009593639,0.00006684377,0.0005267397,0.0008486405],"genre_scores_gemma":[0.09458923,0.0002548824,0.9018397,0.0002049697,0.00006278227,0.000206326,0.0003243535,0.0002875299,0.002230264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008697223,"threshold_uncertainty_score":0.04599589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4315432722","doi":"10.15803/ijnc.13.1_18","title":"Dynamic Line Maintenance by Hybrid Programmable Matter","year":2023,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Line (geometry)","authors":[{"name":"Nooshin Nokhanji","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008137259009869035,"gpt":0.2381708704409412,"spread":0.2300336114310721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002526662,0.0002384744,0.000394337,0.0004498531,0.0005708539,0.0007748068,0.000830912,0.0006689102,0.002156003],"category_scores_gemma":[0.0007891839,0.0002297158,0.0003389773,0.000266502,0.001081176,0.001000829,0.001168329,0.0003772162,0.0003074026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004720184,"about_ca_system_score_gemma":0.0001795283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004875043,"about_ca_topic_score_gemma":0.0003436243,"domain_scores_codex":[0.9998208,0.00003282952,0.000008557584,0.00006552895,0.00004068933,0.00003162147],"domain_scores_gemma":[0.9995253,0.00017308,0.0001046125,0.0001015184,0.00004211998,0.00005339419],"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.0005884098,0.0001756541,0.002002344,0.0002725119,0.00009519557,0.001149741,0.0005459007,0.5023023,0.1586286,0.2630727,0.003456362,0.06771038],"study_design_scores_gemma":[0.00005260096,0.0001566333,0.0003025738,0.00001110323,0.00001469279,0.0001924849,0.00006577936,0.9222378,0.01600661,0.05721976,0.0037117,0.00002835012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5034245,0.0007554389,0.4800944,0.0004401518,0.0002025726,0.00006277227,0.00007117916,0.001553758,0.01339512],"genre_scores_gemma":[0.9780475,0.0001096569,0.01870376,0.00006875624,0.00002002791,0.00004995992,0.00003586938,0.00004621356,0.002918204],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002156003,"threshold_uncertainty_score":0.00721252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412965319","doi":"10.15803/ijnc.15.2_199","title":"Asynchronous Separation of Unconscious Colored Robots","year":2025,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Colored; Asynchronous communication; Unconscious mind; Separation (statistics); Robot; Artificial intelligence; Machine learning; Computer network; Psychology","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Debasish Pattanayak","is_ca":true},{"name":"Francesco Piselli","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Yukiko Yamauchi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01047754543498274,"gpt":0.3124047701585097,"spread":0.301927224723527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009664987,0.0007488828,0.0006829252,0.0002716517,0.0009145466,0.00140041,0.002069363,0.0008688176,0.003629802],"category_scores_gemma":[0.003009967,0.000349373,0.0006730132,0.0004818088,0.00193293,0.003057876,0.002872782,0.001867003,0.0005604166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114376,"about_ca_system_score_gemma":0.001225542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001768666,"about_ca_topic_score_gemma":0.001617628,"domain_scores_codex":[0.998675,0.0003910903,0.00004745427,0.0003577826,0.0002698863,0.000258703],"domain_scores_gemma":[0.997889,0.0007465105,0.0003233539,0.0005410538,0.0002371578,0.0002628911],"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.0005578873,0.0001236607,0.0009113346,0.0001067066,0.00004481829,0.0005830651,0.0005075593,0.3632957,0.01167798,0.6043306,0.001811849,0.01604884],"study_design_scores_gemma":[0.00009038052,0.000107102,0.0001238683,0.000006763422,0.00001835026,0.00007531042,0.00007282384,0.859959,0.003177094,0.1326576,0.003691318,0.00002032141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06393994,0.0001041361,0.9277775,0.0004437891,0.00009724098,0.00007141711,0.0000700905,0.0002376125,0.007258296],"genre_scores_gemma":[0.8694748,0.0001539629,0.1190583,0.0001885644,0.00008407657,0.000136365,0.0001022403,0.00007187371,0.01072975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003629802,"threshold_uncertainty_score":0.0121429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2739312141","doi":"10.15803/ijnc.7.2_336","title":"On the Cost of Waking Up","year":2017,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Asynchronous communication; Hypercube; Bipartite graph; Broadcasting (networking); Enhanced Data Rates for GSM Evolution; Task (project management); Interconnection; Flooding (psychology); Computer network; Theoretical computer science; Distributed computing; Parallel computing; Graph; Telecommunications","authors":[{"name":"Stefan Dobrev","is_ca":false},{"name":"Rastislav Kráľovič","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03430785495083603,"gpt":0.3046563901249861,"spread":0.2703485351741501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466046,0.001150346,0.001169567,0.0008884379,0.001768143,0.002731714,0.002242119,0.002228201,0.07681492],"category_scores_gemma":[0.01690529,0.0005945117,0.0008319998,0.001053616,0.001201593,0.007175658,0.002945639,0.002720624,0.01397565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008722624,"about_ca_system_score_gemma":0.001349604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00276046,"about_ca_topic_score_gemma":0.00330817,"domain_scores_codex":[0.9984843,0.00036137,0.00007796162,0.000205563,0.0004928745,0.0003778959],"domain_scores_gemma":[0.9889008,0.005049813,0.0004297254,0.0033233,0.001447565,0.0008488487],"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.002803207,0.0006231483,0.005039897,0.000772821,0.0001826607,0.001596432,0.0007325872,0.05009869,0.03607234,0.1480701,0.09458448,0.6594236],"study_design_scores_gemma":[0.0004999632,0.002439653,0.01458749,0.0007535781,0.0008873129,0.007093648,0.005368208,0.3040768,0.03461341,0.3394076,0.2898907,0.0003817121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3601918,0.009766054,0.2641848,0.04009343,0.007651594,0.0007394888,0.00161892,0.01272234,0.3030316],"genre_scores_gemma":[0.8493043,0.001857632,0.04878015,0.004180898,0.0004793265,0.0002250027,0.0008335378,0.001559749,0.09277948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07681492,"threshold_uncertainty_score":0.2569715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2916341396","doi":"10.15803/ijnc.9.1_1","title":"Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2018","year":2019,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Editorial board; Field (mathematics); Process (computing); Library science; Engineering ethics; Operations research; Data science","authors":[{"name":"Akihiro Fujiwara","is_ca":false},{"name":"Susumu Matsumae","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01471315946404307,"gpt":0.2664811575749874,"spread":0.2517679981109443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003923105,0.001827371,0.001719421,0.003692634,0.002017281,0.006743195,0.002221337,0.002931799,0.1340556],"category_scores_gemma":[0.01047588,0.0005936142,0.001683929,0.001883004,0.0008406935,0.00504111,0.002944258,0.006106619,0.07659683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002165633,"about_ca_system_score_gemma":0.003088464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008318428,"about_ca_topic_score_gemma":0.001375412,"domain_scores_codex":[0.9974534,0.0003622847,0.0002458683,0.0004483267,0.001250534,0.000239517],"domain_scores_gemma":[0.9878156,0.002065053,0.0005792053,0.0007725209,0.005979365,0.002788266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003614925,0.00003338678,0.00007732069,0.000241791,0.000009481777,0.00005211781,0.00004269289,0.0001153551,0.0002888678,0.002060389,0.9718819,0.02516064],"study_design_scores_gemma":[0.000009068633,0.00004383078,0.0002722667,0.0002622326,0.00001146974,0.0001252617,0.00005040992,0.0003590138,0.0001970655,0.002953999,0.9957027,0.00001267479],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0008942572,0.01630803,0.007612935,0.03230775,0.8977754,0.0002881452,0.00124403,0.0005590845,0.04301041],"genre_scores_gemma":[0.007343388,0.02705979,0.005936713,0.008156325,0.7094054,0.0003848337,0.004668109,0.001612218,0.2354333],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1340556,"threshold_uncertainty_score":0.4484607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235539439","doi":"10.15803/ijnc.6.2_149","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2016,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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":"Torus; Embedding; Computer science; Time complexity; Implementation; Exponential function; Graph embedding; Algorithm; Graph; Theoretical computer science; Exponential growth; Mathematics; Artificial intelligence","authors":[{"name":"Jiahua Yu","is_ca":true},{"name":"Qian‐Ping Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04362782216819385,"gpt":0.382500242558034,"spread":0.3388724203898402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284046,0.001239253,0.0006743756,0.0009859509,0.001050036,0.0009639532,0.001379939,0.001132711,0.01114713],"category_scores_gemma":[0.002593036,0.0004567727,0.0008435594,0.001662303,0.0006672131,0.003233469,0.002645074,0.001250707,0.003901653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000822574,"about_ca_system_score_gemma":0.001699878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002073423,"about_ca_topic_score_gemma":0.002791164,"domain_scores_codex":[0.9989373,0.0001004171,0.00008967986,0.0003161177,0.0003348614,0.0002215727],"domain_scores_gemma":[0.9989023,0.0002332724,0.00008033649,0.0003724261,0.000328312,0.00008328981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00047644,0.0003987557,0.001281858,0.0005462174,0.00008079185,0.0006315474,0.0005738348,0.06878576,0.0389308,0.0688847,0.07231209,0.7470973],"study_design_scores_gemma":[0.0003566248,0.0004768871,0.0008881839,0.00005331251,0.0001153444,0.002001046,0.000734861,0.6739894,0.03476473,0.1845171,0.1019739,0.0001287511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01719128,0.000197637,0.9661648,0.0006110665,0.0002061611,0.0002204802,0.0002984133,0.006394194,0.00871596],"genre_scores_gemma":[0.158306,0.0003276622,0.8279419,0.000236745,0.0001001404,0.0003559938,0.002209166,0.0006640177,0.009858336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01114713,"threshold_uncertainty_score":0.03729093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}