{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004304701,0.00008314037,0.0001012411,0.00006355051,0.000166053,0.00009232022,0.000249002,0.0000274225,0.000006766156],"category_scores_gemma":[0.0003673942,0.0000568971,0.0000460052,0.0003774323,0.0000597709,0.0002670478,0.00006124746,0.00008798152,0.000009842095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001131277,"about_ca_system_score_gemma":0.0001375002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007276547,"about_ca_topic_score_gemma":4.877219e-7,"domain_scores_codex":[0.9990529,0.00004991669,0.0003166193,0.0001150219,0.0003468338,0.0001187502],"domain_scores_gemma":[0.99903,0.0001803654,0.0002583353,0.000328287,0.0001736465,0.00002938187],"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.000002675771,0.00002009439,0.0001199123,0.000009259514,0.000007712092,0.00002283038,0.0005345757,0.0554034,0.00000919795,0.9411874,0.001235114,0.001447858],"study_design_scores_gemma":[0.0002091587,0.0002284365,0.005579181,0.00003355985,0.000004996066,0.001838426,0.0001284766,0.6097672,0.001675035,0.3370685,0.04321099,0.0002560334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2096513,0.00002322904,0.7832735,0.00158204,0.000457389,0.0001426502,0.000003233721,0.00008797733,0.004778681],"genre_scores_gemma":[0.9728563,0.000001672769,0.02670216,0.0003120853,0.0000132395,0.00000441488,0.000005748651,0.000003397685,0.0001009279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7632051,"threshold_uncertainty_score":0.2320196,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001380245,0.0001343022,0.0001744329,0.00003985386,0.00008042291,0.00002116339,0.0001028803,0.00007902226,0.00002855696],"category_scores_gemma":[0.00008857226,0.0001350896,0.00006005544,0.0001064582,0.00006450908,0.000001011012,0.0001416109,0.00005042007,0.00001928491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009926194,"about_ca_system_score_gemma":0.00001625431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003056078,"about_ca_topic_score_gemma":0.0001241778,"domain_scores_codex":[0.9990696,0.0000197814,0.000302104,0.0003012766,0.00008951114,0.000217766],"domain_scores_gemma":[0.9994888,0.000007679258,0.0001117949,0.0002989563,0.00005349751,0.00003929854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000363161,0.0001417994,0.0522184,0.00002219653,0.000105978,0.0004917444,0.0003952428,0.0006282363,0.9300671,0.0001312342,0.01034478,0.005417021],"study_design_scores_gemma":[0.001092148,0.0006302299,0.2605281,0.00004528783,0.00004473674,0.002647498,0.0003037459,0.001058,0.1116186,0.0005361275,0.6203679,0.001127603],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9867423,0.00177566,0.00004183441,0.0003054698,0.0001224918,0.00008964245,0.000004355826,0.000007981889,0.01091027],"genre_scores_gemma":[0.989441,0.0003413921,0.0009715108,0.0001010878,0.000149492,0.000006008823,0.00003048274,0.00001832762,0.008940722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8184484,"threshold_uncertainty_score":0.5508794,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469813,0.0001609522,0.0002693546,0.00008900241,0.0001228141,0.0001643276,0.0005594884,0.00004609321,0.00002007792],"category_scores_gemma":[0.00006945268,0.000139639,0.00009215062,0.0004884587,0.00006245675,0.0001987862,0.0002145102,0.0001050503,0.00001745463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001958841,"about_ca_system_score_gemma":0.0000881376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006873928,"about_ca_topic_score_gemma":0.00000523265,"domain_scores_codex":[0.9985768,0.00003437855,0.0003330797,0.0003945505,0.0003815391,0.0002797099],"domain_scores_gemma":[0.9987737,0.00004894452,0.0001438898,0.0007891594,0.000112648,0.0001316541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001213968,0.0007615088,0.005094209,0.0003260084,0.0002880015,0.006277496,0.01065804,0.01713659,0.005082878,0.09229197,0.02562254,0.8363394],"study_design_scores_gemma":[0.0003945947,0.0008633977,0.01017359,0.0001246873,0.00001788697,0.003238974,0.00009408747,0.1887804,0.0161409,0.00794447,0.7714632,0.0007637834],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6222881,0.0001788036,0.3601962,0.01390156,0.0008373345,0.0003894068,0.000008755355,0.0003647909,0.001835054],"genre_scores_gemma":[0.9134675,0.00002588022,0.0779736,0.0004988403,0.0001281809,0.00001604685,0.000006034992,0.00001844338,0.007865499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8355756,"threshold_uncertainty_score":0.5694314,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004697356,0.0001492096,0.0001735135,0.00008819236,0.0001736577,0.0002754543,0.000614042,0.00007091727,0.00001975302],"category_scores_gemma":[0.0002079303,0.0001379324,0.00004154979,0.0003897105,0.0001032533,0.000841903,0.0005000912,0.00009633446,0.00000675908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002523972,"about_ca_system_score_gemma":0.00006854098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008225392,"about_ca_topic_score_gemma":0.00002508979,"domain_scores_codex":[0.9987604,0.00002942117,0.000275345,0.0003838437,0.0002335257,0.0003174479],"domain_scores_gemma":[0.9986844,0.00006942073,0.0001526091,0.0008977305,0.00005814863,0.0001377058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005534403,0.0003448164,0.4452361,0.0001997008,0.0001912639,0.02706409,0.00725709,0.00007406736,0.03241344,0.3696623,0.03381592,0.08368588],"study_design_scores_gemma":[0.0007854755,0.0002516877,0.2716251,0.0001194985,0.00005693817,0.06912927,0.0007585056,0.009604534,0.02084492,0.2861862,0.3392064,0.001431537],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9125395,0.001187045,0.07546341,0.002666765,0.0003552891,0.0001115879,0.000004165156,0.0005998437,0.007072445],"genre_scores_gemma":[0.9555918,0.0007362356,0.03855904,0.0007126608,0.0001728288,0.00001672421,0.000006510841,0.00002564208,0.004178587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3053905,"threshold_uncertainty_score":0.562472,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001188052,0.0001037022,0.000124434,0.00003207376,0.0001391166,0.0001182899,0.0006210165,0.00004071499,0.0001912268],"category_scores_gemma":[0.00007184166,0.0000907869,0.00004648336,0.0002846218,0.00005888522,0.0009368773,0.0001509105,0.00007507555,0.00008555327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001240447,"about_ca_system_score_gemma":0.00004289392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001455847,"about_ca_topic_score_gemma":0.00001218237,"domain_scores_codex":[0.9989975,0.00001383282,0.000230035,0.0003129386,0.0002285946,0.000217097],"domain_scores_gemma":[0.9988965,0.0000260516,0.0000882856,0.0008738411,0.00004718975,0.0000680796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003095202,0.0002262221,0.01101144,0.0000567402,0.00006777552,0.012877,0.001757896,0.001085749,0.000716025,0.4991683,0.01622296,0.4567789],"study_design_scores_gemma":[0.0001784749,0.0001017728,0.01946677,0.00001192363,0.000007242262,0.00445513,0.00003595079,0.000634068,0.00204978,0.2361461,0.7365136,0.0003992363],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3822426,0.001508524,0.2718608,0.005984937,0.001497508,0.0003405968,0.000007405487,0.001755751,0.3348019],"genre_scores_gemma":[0.7366382,0.0003144201,0.1880463,0.001253544,0.0003305254,0.00003231332,0.00001144595,0.00002701584,0.07334626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7202906,"threshold_uncertainty_score":0.3702182,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395508,0.00009274262,0.0001376072,0.00009771492,0.00007786955,0.00005692374,0.0001993966,0.00002355605,0.000003647476],"category_scores_gemma":[0.00002609332,0.00008459758,0.00003319553,0.0008580898,0.00006094675,0.0003465557,0.00002918848,0.00004534519,0.000003366066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001086123,"about_ca_system_score_gemma":0.0001484564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005467108,"about_ca_topic_score_gemma":0.00006654087,"domain_scores_codex":[0.9989463,0.00002580034,0.000282094,0.0002856078,0.000323423,0.0001367607],"domain_scores_gemma":[0.9991618,0.0000324093,0.00007495467,0.0004106945,0.0002407778,0.00007935552],"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.00004427486,0.0001667743,0.007577625,0.0000416265,0.00002666168,0.0001252111,0.001591141,0.007270025,0.0003647128,0.9809802,0.0003893809,0.00142237],"study_design_scores_gemma":[0.00197821,0.002037406,0.1883279,0.00009218753,0.00007321366,0.00722079,0.0006098399,0.02248902,0.0288838,0.5213243,0.2249798,0.001983549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1626421,0.00002731291,0.8364439,0.0001260098,0.00005443315,0.000193581,0.00002094912,0.00005577744,0.0004359508],"genre_scores_gemma":[0.9196861,0.000006175844,0.08015311,0.00007367996,0.000004680005,0.00002533283,0.00002826248,0.000005544633,0.0000171045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.757044,"threshold_uncertainty_score":0.3449789,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005161203,0.0001471845,0.0001935864,0.0001027197,0.0003457452,0.0005069819,0.0004673469,0.00007347736,0.000003467715],"category_scores_gemma":[0.0002366147,0.0001338571,0.00001809166,0.0003293019,0.0001630467,0.0008613926,0.0006865498,0.0001101507,7.244622e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816936,"about_ca_system_score_gemma":0.000225661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003711842,"about_ca_topic_score_gemma":0.0004399262,"domain_scores_codex":[0.9984514,0.00002509261,0.0002823146,0.0006217288,0.0003163225,0.0003032132],"domain_scores_gemma":[0.9986654,0.00007599103,0.00007487665,0.0007885834,0.0002279608,0.0001672064],"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.0002311909,0.00123787,0.1256266,0.001839326,0.0009455397,0.007807418,0.03124575,0.03589704,0.002325874,0.3286922,0.01245689,0.4516943],"study_design_scores_gemma":[0.005879823,0.001944083,0.3068171,0.0003029736,0.0001461209,0.03460127,0.001263893,0.4288435,0.004919858,0.07519338,0.1365788,0.003509276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04224288,0.0008835564,0.9505098,0.004074891,0.0003577931,0.0009334203,0.0001197212,0.0003861292,0.0004918353],"genre_scores_gemma":[0.483314,0.001049673,0.513637,0.0002196402,0.0001290827,0.00004799982,0.0004357102,0.00004214853,0.001124763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4481851,"threshold_uncertainty_score":0.5458533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}