{"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":"0edcf82d4ad5","filters":{"venue":"BRICS Report Series"}},"results":[{"id":"W2725746804","doi":"10.7146/brics.v10i3.21774","title":"On the Computational Collapse of Quantum Information","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Oblivious transfer; Commitment scheme; Computer science; Quantum; Theoretical computer science; Communication source; Quantum capacity; String (physics); Quantum computer; Predicate (mathematical logic); Mathematics; Discrete mathematics; Computation; Quantum network; Cryptography; Algorithm; Quantum mechanics; Physics; Computer network","authors":[{"name":"Claude Crépeau","is_ca":true},{"name":"Paul Dumais","is_ca":true},{"name":"Dominic Mayers","is_ca":true},{"name":"Louis Salvail","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009961743944809205,"gpt":0.2203831740741499,"spread":0.2104214301293407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00372824,0.0007096261,0.0009378046,0.001111642,0.002523772,0.002962318,0.00169251,0.002292256,0.005181591],"category_scores_gemma":[0.01173882,0.0005772749,0.001360123,0.0007280966,0.01132876,0.007369089,0.007907277,0.006617198,0.0009695191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002026211,"about_ca_system_score_gemma":0.001269585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121776,"about_ca_topic_score_gemma":0.000435966,"domain_scores_codex":[0.9951441,0.00188764,0.0001330616,0.000460624,0.00142673,0.0009477423],"domain_scores_gemma":[0.9922743,0.004906313,0.000485479,0.001647069,0.0003513624,0.0003354401],"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.00005853839,0.00002270547,0.0001405568,0.0000198295,0.00001116419,0.0000948571,0.0002936733,0.01202628,0.001334694,0.9832737,0.0003748601,0.002349127],"study_design_scores_gemma":[0.00002575828,0.00005808594,0.0001386108,0.00001993093,0.0000134201,0.00007613788,0.00009305284,0.1181633,0.002860349,0.8765224,0.001999316,0.00002963409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2046056,0.0003192213,0.7352799,0.004719264,0.0001265795,0.0002657232,0.000140046,0.0005621018,0.05398148],"genre_scores_gemma":[0.9609836,0.0002641743,0.03040691,0.0004493161,0.00008427518,0.0001911567,0.0000731718,0.0001244829,0.007422882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005181591,"threshold_uncertainty_score":0.01971704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2486243297","doi":"10.7146/brics.v9i51.21766","title":"Computing Refined Buneman Trees in Cubic Time","year":2002,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"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":"Mathematics; Tree (set theory); Pairwise comparison; Measure (data warehouse); Algorithm; Set (abstract data type); Combinatorics; Binary tree; Weight-balanced tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Running time; Computer science; Data mining; Binary search tree; Artificial intelligence; Statistics","authors":[{"name":"Gerth Stølting Brodal","is_ca":false},{"name":"Rolf Fagerberg","is_ca":false},{"name":"Anna Östlin","is_ca":false},{"name":"Christian N. S. Pedersen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375843978592752,"gpt":0.2229741537553361,"spread":0.2092157139694085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008352077,0.0006804901,0.00107951,0.001051141,0.0008256744,0.00198617,0.001398655,0.0007668059,0.008944589],"category_scores_gemma":[0.007975588,0.0004796784,0.0009085022,0.001918672,0.0006672136,0.004278016,0.002240222,0.001184569,0.002205493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007198,"about_ca_system_score_gemma":0.00163265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004333043,"about_ca_topic_score_gemma":0.01040328,"domain_scores_codex":[0.9988664,0.0001986538,0.00009960334,0.0002474515,0.0004345495,0.0001533762],"domain_scores_gemma":[0.9954832,0.002740518,0.0002400951,0.0007675258,0.0006072081,0.0001614448],"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.0007288617,0.0001601014,0.003751159,0.0006159626,0.0001099424,0.0003040604,0.0006755078,0.1968486,0.01227841,0.09668995,0.0181834,0.669654],"study_design_scores_gemma":[0.0001585417,0.0001016891,0.001287287,0.00004209602,0.00003545774,0.000239265,0.000372221,0.720564,0.005326471,0.254753,0.01707711,0.00004297115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1092109,0.0005758347,0.8720232,0.0007217493,0.00007084123,0.0001884028,0.001094344,0.005410429,0.01070425],"genre_scores_gemma":[0.1953073,0.0002934253,0.7955607,0.000131102,0.00003206269,0.0002161149,0.003402741,0.0005604837,0.00449609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008944589,"threshold_uncertainty_score":0.02992266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403742698","doi":"10.7146/brics.v7i52.20219","title":"How to Convert a Flavor of Quantum Bit Commitment","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","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":"McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Scheme (mathematics); Commitment scheme; Quantum; Bit (key); Computer science; Theoretical computer science; Mathematics; Arithmetic; Algorithm; Discrete mathematics; Computer security; Cryptography; Quantum mechanics; Physics","authors":[{"name":"Claude Crépeau","is_ca":true},{"name":"Frédéric Légaré","is_ca":true},{"name":"Louis Salvail","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198394321092525,"gpt":0.2296793519396509,"spread":0.2176954087287256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437484,0.0005854029,0.0006058655,0.0005403285,0.001795775,0.002887915,0.002123891,0.0026947,0.01666994],"category_scores_gemma":[0.01163506,0.0006664149,0.001100946,0.0007219686,0.004611997,0.009312481,0.005242001,0.008411498,0.004982192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008432809,"about_ca_system_score_gemma":0.001827328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111457,"about_ca_topic_score_gemma":0.0004648846,"domain_scores_codex":[0.9969555,0.0007197467,0.000156168,0.0005006807,0.001320974,0.0003469679],"domain_scores_gemma":[0.9959404,0.001418492,0.00014714,0.001887013,0.0004583392,0.0001486695],"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.0000535012,0.00003290981,0.00008433721,0.00005366436,0.00001253416,0.00006418258,0.0001747746,0.004658188,0.002265473,0.9700243,0.001754259,0.02082183],"study_design_scores_gemma":[0.00004294266,0.00005946643,0.00008636816,0.00005922533,0.00001592255,0.0001891117,0.0001055012,0.04051218,0.007854568,0.9232874,0.02773684,0.00005054798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008974019,0.0001757945,0.9601601,0.002925683,0.0007699031,0.0001819716,0.0001121506,0.0008178602,0.0258824],"genre_scores_gemma":[0.3592749,0.0007909915,0.6033473,0.002835084,0.0004459063,0.000503566,0.0003627344,0.001002594,0.03143694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666994,"threshold_uncertainty_score":0.05576646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213316062","doi":"10.7146/brics.v8i38.21698","title":"Free De Morgan Bisemigroups and Bisemilattices","year":2001,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science","authors":[{"name":"Zoltán Ésik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01178393089036073,"gpt":0.233127898357875,"spread":0.2213439674675143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209335,0.0007345942,0.0003305864,0.001671445,0.001304146,0.002659139,0.0008929852,0.0006573654,0.007848207],"category_scores_gemma":[0.0008396471,0.0003323105,0.0005111778,0.001129531,0.001876093,0.004115994,0.00192434,0.001196314,0.001217929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008062422,"about_ca_system_score_gemma":0.0004926526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106718,"about_ca_topic_score_gemma":0.001357789,"domain_scores_codex":[0.9993675,0.0001301458,0.00003882427,0.0001298287,0.0002260885,0.0001075642],"domain_scores_gemma":[0.9996036,0.00009594554,0.00006942882,0.00005221092,0.0001033582,0.00007554115],"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.00001421582,0.000007544867,0.0000570646,0.00002485928,0.000003462868,0.00006340483,0.0002377846,0.0008447378,0.000889523,0.9896253,0.0006526373,0.007579561],"study_design_scores_gemma":[0.00001026213,0.00001801271,0.0000933872,0.00001651247,0.000008549401,0.0001454528,0.0002682183,0.004088143,0.001498311,0.9612743,0.0325656,0.00001337657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09029114,0.002503788,0.7983177,0.001748618,0.0009094907,0.0001941512,0.0005885172,0.000909848,0.1045368],"genre_scores_gemma":[0.6680755,0.001795293,0.2814466,0.0006729361,0.0004864231,0.0003337864,0.0008515646,0.0002626762,0.04607518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007848207,"threshold_uncertainty_score":0.02625483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2726927860","doi":"10.7146/brics.v7i28.20161","title":"Free mu-lattices","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Unary operation; Decidability; Combinatorics; Equivalence relation; Mathematics; Lattice (music); Partially ordered set; Discrete mathematics; Physics","authors":[{"name":"Luigi Santocanale","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01541366673359561,"gpt":0.2429280225979744,"spread":0.2275143558643788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332363,0.0004595433,0.000602419,0.001421402,0.002241754,0.003596968,0.001037849,0.0005734551,0.008613776],"category_scores_gemma":[0.002557877,0.0005128583,0.0009586329,0.001023844,0.003521591,0.006034737,0.002804978,0.001609298,0.0008726165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001982269,"about_ca_system_score_gemma":0.001090468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001917057,"about_ca_topic_score_gemma":0.00161767,"domain_scores_codex":[0.9982793,0.000283882,0.0001103886,0.0004371742,0.0005826291,0.0003066017],"domain_scores_gemma":[0.9980541,0.0006789977,0.0001988858,0.0004116531,0.0003554304,0.0003009143],"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.00004076822,0.0000109435,0.0002581193,0.00003871569,0.000008293884,0.00004836832,0.0001788708,0.0006433482,0.001054219,0.9909443,0.0005739261,0.006200206],"study_design_scores_gemma":[0.00002344251,0.00004185257,0.0004000093,0.0000302418,0.00001530214,0.000232449,0.0002409465,0.004539877,0.002574588,0.957352,0.03452539,0.00002382712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2776759,0.003476435,0.5744346,0.001654149,0.0003945612,0.0002374508,0.002563118,0.001437372,0.1381263],"genre_scores_gemma":[0.8915539,0.0007251942,0.07933464,0.0003726549,0.0002323559,0.000215285,0.001144968,0.0001837741,0.02623719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008613776,"threshold_uncertainty_score":0.02881593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465446327","doi":"10.7146/brics.v10i37.21805","title":"Computational Collapse of Quantum State with Application to Oblivious Transfer","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Oblivious transfer; Commitment scheme; Quantum; Reduction (mathematics); State (computer science); String (physics); Security parameter; Quantum state; Quantum computer; Mathematics; Computer science; Discrete mathematics; Cryptography; Physics; Theoretical computer science; Quantum mechanics; Algorithm","authors":[{"name":"Claude Crépeau","is_ca":true},{"name":"Paul Dumais","is_ca":true},{"name":"Dominic Mayers","is_ca":false},{"name":"Louis Salvail","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008778372300756532,"gpt":0.2292207450426902,"spread":0.2204423727419337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348491,0.0006355037,0.001132538,0.001087511,0.001834937,0.002730404,0.00205402,0.001661831,0.004490899],"category_scores_gemma":[0.0118568,0.0006325033,0.001748366,0.0009491795,0.008500706,0.004678442,0.009045612,0.006597868,0.0006420623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002978896,"about_ca_system_score_gemma":0.002143399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001608977,"about_ca_topic_score_gemma":0.0006661187,"domain_scores_codex":[0.9959013,0.001498215,0.0001921534,0.0005171855,0.00134619,0.0005449877],"domain_scores_gemma":[0.9942801,0.003179612,0.0003703129,0.001476931,0.0003640648,0.0003289522],"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.00004220328,0.00001782353,0.00009647279,0.00003028653,0.000007687693,0.00006346661,0.0002327343,0.01172099,0.00101203,0.9835324,0.000243456,0.003000558],"study_design_scores_gemma":[0.00001766651,0.00003789445,0.000098529,0.00001298213,0.000006367019,0.00003341301,0.0000395615,0.1316485,0.00240034,0.8639709,0.001709464,0.00002448337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1200839,0.0003678482,0.83368,0.002847982,0.0001640115,0.0003209104,0.0001356519,0.0006573586,0.04174228],"genre_scores_gemma":[0.9271325,0.0002903356,0.06396608,0.0002954442,0.0001536745,0.0002879806,0.00007798739,0.000154886,0.00764114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004490899,"threshold_uncertainty_score":0.02161348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2944999878","doi":"10.7146/brics.v11i2.21827","title":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","year":2004,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Optimization and Search Problems","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":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Combinatorics; Data structure; Algorithm; Theoretical computer science; Mathematics","authors":[{"name":"Gerth Stølting Brodal","is_ca":false},{"name":"Rolf Fagerberg","is_ca":false},{"name":"Ulrich Meyer","is_ca":false},{"name":"Norbert Zeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07440722122927845,"gpt":0.3161123087104155,"spread":0.2417050874811371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767694,0.001537374,0.001328478,0.002455743,0.001573093,0.002531303,0.004815597,0.001528462,0.008883283],"category_scores_gemma":[0.009330384,0.001023823,0.001519602,0.005905655,0.001674228,0.008901916,0.003865683,0.003663701,0.00348104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003156041,"about_ca_system_score_gemma":0.004903646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00604635,"about_ca_topic_score_gemma":0.00792418,"domain_scores_codex":[0.9967906,0.0005127493,0.0003389603,0.0006754614,0.001251238,0.0004309148],"domain_scores_gemma":[0.9931114,0.001890052,0.0005555378,0.003070696,0.001191753,0.0001806105],"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.0009574224,0.0004778558,0.001937757,0.001190945,0.0002233769,0.000154146,0.0007408225,0.1626842,0.01592791,0.2499149,0.0414631,0.5243275],"study_design_scores_gemma":[0.0003275164,0.0003133347,0.0004387932,0.0001688459,0.0001292509,0.00023771,0.0001993596,0.5895755,0.02274154,0.3469763,0.03876438,0.0001274617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01440079,0.001228353,0.9704945,0.0006554595,0.0001364442,0.0001847959,0.001032744,0.006501222,0.005365586],"genre_scores_gemma":[0.1347246,0.0007986458,0.8523794,0.0004499176,0.000154371,0.0007574197,0.003329877,0.001288346,0.006117458],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008883283,"threshold_uncertainty_score":0.0297175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}