{"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":"d7a78aca0323","filters":{"venue":"Justus-Liebig-Universität Gießen"}},"results":[{"id":"W1539025858","doi":"10.25596/jalc-2004-233","title":"Regular Expressions: New Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":140,"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":"Sketch; Computer science; Regular expression; Theoretical computer science; Programming language; Algorithm","authors":[{"name":"Keith Ellul","is_ca":true},{"name":"Bryan Krawetz","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Ming‐Wei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0232650438718394,"gpt":0.2315811275553838,"spread":0.2083160836835445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01179476,0.002285093,0.003587921,0.005758942,0.003095748,0.01068407,0.004864434,0.004214255,0.01202063],"category_scores_gemma":[0.02184083,0.001772349,0.00408311,0.008186156,0.0182804,0.06214674,0.006444599,0.01372869,0.004393344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003469535,"about_ca_system_score_gemma":0.00186638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00138949,"about_ca_topic_score_gemma":0.0008320215,"domain_scores_codex":[0.9921013,0.002720006,0.0006770656,0.001840731,0.002124104,0.0005368211],"domain_scores_gemma":[0.9600866,0.03203243,0.0009151997,0.003498547,0.002408289,0.001058922],"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.00006005435,0.0000856823,0.000310946,0.0007497186,0.00004016239,0.000182595,0.000648583,0.001342274,0.000264825,0.9322502,0.01101349,0.05305145],"study_design_scores_gemma":[0.00001048322,0.00001572059,0.00008308865,0.0001358326,0.00001407567,0.0001672933,0.0002211187,0.002105755,0.0001508296,0.977573,0.01949794,0.00002483344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02881624,0.2569432,0.5118285,0.07534999,0.005908687,0.0001351839,0.001142599,0.001635612,0.1182399],"genre_scores_gemma":[0.3002919,0.2934745,0.3051217,0.01480765,0.0437234,0.0004673426,0.003087578,0.002410041,0.03661603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01202063,"threshold_uncertainty_score":0.06237739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W88699973","doi":"10.25596/jalc-2006-399","title":"Intervals of Partial Clones Containing Maximal Clones","year":2006,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Combinatorics; clone (Java method); Mathematics; Bounded function; Permutation (music); Order (exchange); Equivalence relation; Discrete mathematics; Prime (order theory); Biology; Physics; Genetics; Gene; Mathematical analysis","authors":[{"name":"Lucien Haddad","is_ca":true},{"name":"Dietlinde Lau","is_ca":false},{"name":"Ivo G. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007721498035841037,"gpt":0.180193418547502,"spread":0.172471920511661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159997,0.0004798193,0.0007168576,0.001856474,0.001450588,0.002676671,0.0008357216,0.0005926475,0.004988865],"category_scores_gemma":[0.004178627,0.0005015827,0.0008041239,0.001490529,0.001485248,0.002272801,0.001473389,0.000799869,0.000623593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588262,"about_ca_system_score_gemma":0.0004816566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001362432,"about_ca_topic_score_gemma":0.0007433614,"domain_scores_codex":[0.9990404,0.0001110436,0.00009483091,0.0003077548,0.0002425131,0.0002034143],"domain_scores_gemma":[0.9967849,0.00149533,0.0004786492,0.0003678169,0.0005047547,0.0003685444],"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.0007703967,0.00008605701,0.01185269,0.0002697317,0.00008624886,0.001404433,0.002603806,0.007458379,0.02374276,0.9081463,0.001583916,0.04199528],"study_design_scores_gemma":[0.0001825774,0.0004198504,0.0169496,0.0001871593,0.0002008834,0.003928058,0.002119699,0.04724995,0.0499701,0.8388214,0.03983154,0.0001392697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9136204,0.0007379045,0.05701244,0.0001578723,0.00003689944,0.00006311671,0.0007126959,0.0003272313,0.02733151],"genre_scores_gemma":[0.9751,0.0003225386,0.01560275,0.0000631018,0.00005308467,0.0001416728,0.001116322,0.00008352889,0.007516919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004988865,"threshold_uncertainty_score":0.01668948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144860383","doi":"10.25596/jalc-2004-121","title":"Bimachines and Structurally-Reversed Automata","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Rational function; Nondeterministic algorithm; Computer science; Finite-state machine; Automaton; Function (biology); Word (group theory); Simple (philosophy); Trigonometric functions; Point (geometry); Range (aeronautics); Preprocessor; Power (physics); Algorithm; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Engineering","authors":[{"name":"Nicolae Sântean","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004140554167445769,"gpt":0.1824994164630846,"spread":0.1783588622956389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008499054,0.0003879971,0.0003259534,0.0005275279,0.0007403673,0.001587875,0.0007181577,0.001081772,0.004554972],"category_scores_gemma":[0.002506841,0.0003490271,0.0008357239,0.0003524109,0.004676135,0.003589935,0.00175184,0.001824928,0.001054945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006515696,"about_ca_system_score_gemma":0.0005437487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003994649,"about_ca_topic_score_gemma":0.0003823437,"domain_scores_codex":[0.9983194,0.0004564416,0.0001651523,0.0005278112,0.0003744013,0.0001566345],"domain_scores_gemma":[0.9983401,0.0006872142,0.0001947532,0.0004682011,0.00021944,0.0000902393],"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.0000141869,0.000007309008,0.0001304967,0.00002264956,0.000003659765,0.00007769636,0.0002165279,0.001532837,0.002409371,0.9908125,0.0001711077,0.004601628],"study_design_scores_gemma":[0.00001308644,0.00006408284,0.0001336882,0.00002130602,0.00001156987,0.0002800433,0.000121785,0.01628257,0.007742497,0.9624857,0.01282268,0.00002077761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09221281,0.0007401626,0.8730214,0.0006029798,0.0001906814,0.0001043856,0.0001555907,0.000806212,0.03216564],"genre_scores_gemma":[0.7556779,0.0006768864,0.2261056,0.0005428276,0.0001846929,0.00029156,0.0002879086,0.0001830374,0.01604948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004554972,"threshold_uncertainty_score":0.01523787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12813696","doi":"10.25596/jalc-2002-083","title":"Maximal and Minimal Partial Clones","year":2002,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Intersection (aeronautics); Combinatorics; Mathematics; Set (abstract data type); Partial function; clone (Java method); Element (criminal law); Discrete mathematics; Computer science; Biology; Genetics; Gene","authors":[{"name":"Lucien Haddad","is_ca":true},{"name":"Hajime Machida","is_ca":false},{"name":"Ivo G. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02140608690727834,"gpt":0.2008499410797931,"spread":0.1794438541725148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002925604,0.0004177293,0.001333814,0.0009553627,0.003017919,0.003082731,0.001074945,0.001714215,0.007250109],"category_scores_gemma":[0.01305317,0.000749344,0.001221475,0.001182054,0.004220789,0.009532007,0.004432921,0.00179923,0.0006222118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001612079,"about_ca_system_score_gemma":0.001018193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008568598,"about_ca_topic_score_gemma":0.0007274952,"domain_scores_codex":[0.9963356,0.0007611146,0.0003475593,0.001261577,0.0008023318,0.0004918115],"domain_scores_gemma":[0.9891967,0.006187916,0.0008734329,0.001847476,0.0009450738,0.0009494678],"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.000260901,0.00003034679,0.004858945,0.0001995017,0.00003279062,0.00025906,0.001453651,0.001361663,0.003605373,0.963362,0.002167198,0.02240852],"study_design_scores_gemma":[0.00004086592,0.00007749283,0.002501035,0.00008105789,0.00005488894,0.001258361,0.001360504,0.003972219,0.004647581,0.9596743,0.02629016,0.00004165946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.649285,0.003213493,0.2745287,0.005085614,0.0001539212,0.0001254074,0.001805203,0.0007082401,0.06509448],"genre_scores_gemma":[0.9284992,0.0007912726,0.05908263,0.0005997983,0.0002049188,0.0001964296,0.001571672,0.0001154908,0.008938482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007250109,"threshold_uncertainty_score":0.02425402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402226617","doi":"10.25596/jalc-2014-157","title":"Generating the Pseudo-Powers of a Word","year":2014,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Word (group theory); Abelian group; Computer science; Closure (psychology); Power (physics); Connection (principal bundle); Arithmetic; Mathematics; Pure mathematics; Physics; Geometry","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Manasi S. Kulkarni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008362743079370773,"gpt":0.198234710501128,"spread":0.1898719674217572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265999,0.0003433524,0.0004107131,0.0009436525,0.001212583,0.001850473,0.0005524839,0.0004629256,0.004295988],"category_scores_gemma":[0.003974098,0.0003455423,0.0008361147,0.0003710212,0.003791326,0.005161745,0.002341929,0.0008423397,0.0008667599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004264155,"about_ca_system_score_gemma":0.0003987403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001284544,"about_ca_topic_score_gemma":0.0001351735,"domain_scores_codex":[0.9987013,0.000383079,0.0001100098,0.000346884,0.0003123468,0.0001462279],"domain_scores_gemma":[0.9968441,0.001449612,0.0002887061,0.0007302228,0.0004365733,0.0002507657],"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.00008062388,0.00002302205,0.0006197902,0.00006589881,0.00001228012,0.0004541008,0.001415141,0.0008096982,0.01746048,0.9660274,0.0003930316,0.01263856],"study_design_scores_gemma":[0.00002964599,0.0001550438,0.0006481016,0.00004616099,0.00002933041,0.0009928071,0.0007918176,0.01101199,0.02366411,0.9446346,0.01794288,0.00005358201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6094183,0.0004508177,0.324885,0.0006373903,0.0003165151,0.000108589,0.0001458961,0.000550464,0.06348708],"genre_scores_gemma":[0.9500117,0.0001924971,0.03865526,0.000152227,0.0001391979,0.0001088302,0.00009491458,0.0002082839,0.01043717],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004295988,"threshold_uncertainty_score":0.01437145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W40576911","doi":"10.25596/jalc-2004-333","title":"Context Derivation Sets and Context-Free Normal Forms","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Terminal and nonterminal symbols; Symbol (formal); Context-free grammar; Context-sensitive grammar; Computer science; Tree-adjoining grammar; Context (archaeology); Grammar; Mildly context-sensitive grammar formalism; Indexed grammar; Extended Affix Grammar; Mathematics; Combinatory categorial grammar; Rule-based machine translation; Algorithm; Natural language processing; Artificial intelligence; Generative grammar; Programming language; Linguistics; Phrase structure rules","authors":[{"name":"Charlotte L. Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009273650047310978,"gpt":0.1958674978940053,"spread":0.1865938478466943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657816,0.0007691684,0.0004970794,0.001566438,0.001145239,0.002840434,0.001177551,0.0009794057,0.006948449],"category_scores_gemma":[0.005397999,0.0005185471,0.00103094,0.001204001,0.003967002,0.005261274,0.002405033,0.002747009,0.002173076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178098,"about_ca_system_score_gemma":0.000937207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007082715,"about_ca_topic_score_gemma":0.0007353244,"domain_scores_codex":[0.997256,0.0007100048,0.0002636485,0.0006097361,0.0009857197,0.0001748185],"domain_scores_gemma":[0.9970668,0.001537694,0.0001539696,0.0005904808,0.000514737,0.0001362939],"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.00002179495,0.00001584473,0.0001241211,0.00004585053,0.000007625448,0.0001338742,0.0003550731,0.002773905,0.001685248,0.9562154,0.0009261466,0.0376952],"study_design_scores_gemma":[0.000009690169,0.00001361649,0.00005355528,0.00002150547,0.000006006604,0.0001403059,0.00005036583,0.007516434,0.002217743,0.9775422,0.01241586,0.00001277367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032699,0.0008673227,0.9279304,0.0006425014,0.0001734875,0.0001510999,0.0002669462,0.001820685,0.03782063],"genre_scores_gemma":[0.4403833,0.001054928,0.5352294,0.0004449035,0.000226686,0.0003930748,0.001019882,0.0006727183,0.0205752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006948449,"threshold_uncertainty_score":0.02324486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2758996273","doi":"10.25596/jalc-2017-169","title":"State Complexity of Prefix Distance of Subregular Languages","year":2017,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Mathematics; Regular language; Combinatorics; Deterministic finite automaton; Finite-state machine; Alphabet; Neighbourhood (mathematics); Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","authors":[{"name":"Timothy Ng","is_ca":true},{"name":"David Rappaport","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02465598739733126,"gpt":0.2523142439967095,"spread":0.2276582565993783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103585,0.0003123373,0.0008573079,0.0006845617,0.0008437994,0.002585429,0.001429367,0.0008595695,0.007931719],"category_scores_gemma":[0.01143927,0.0004283989,0.001010571,0.0005900062,0.001839046,0.004954688,0.002058825,0.001372576,0.0006947612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001666724,"about_ca_system_score_gemma":0.0008029194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001464442,"about_ca_topic_score_gemma":0.001246249,"domain_scores_codex":[0.9979343,0.0003745006,0.0002176951,0.0006229961,0.0005671673,0.0002832525],"domain_scores_gemma":[0.9849166,0.0110105,0.00101793,0.001523137,0.0008758533,0.0006558978],"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.001963583,0.0001950914,0.01090763,0.0006704191,0.00009805806,0.0007040125,0.002299797,0.2789464,0.04288077,0.6127722,0.002427031,0.04613505],"study_design_scores_gemma":[0.00005434671,0.0001638962,0.001822936,0.00002715883,0.0000488604,0.000249793,0.0001828027,0.5615246,0.01560781,0.4187521,0.001512009,0.00005378588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8718284,0.0002672388,0.1168997,0.0006273829,0.00002480174,0.00005732833,0.0007981686,0.0006671557,0.008829783],"genre_scores_gemma":[0.982834,0.00007675822,0.01387157,0.00004341214,0.00002177365,0.00007248732,0.0005187606,0.00008460251,0.002476738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007931719,"threshold_uncertainty_score":0.0265342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}