{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004181437,0.0002688136,0.0003143267,0.0001742217,0.0004184904,0.0004880263,0.002760198,0.0001472424,0.00002710304],"category_scores_gemma":[0.00005411505,0.0002484622,0.00007503122,0.0005118416,0.0001058119,0.003877193,0.002794545,0.0002178258,0.000140364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001562122,"about_ca_system_score_gemma":0.0003653792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000844984,"about_ca_topic_score_gemma":0.00004426174,"domain_scores_codex":[0.9979772,0.00008153517,0.0002811709,0.0008291875,0.0003533839,0.0004775306],"domain_scores_gemma":[0.9981808,0.00007707997,0.0001687662,0.001138553,0.00006700491,0.000367804],"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.0002747681,0.00047943,0.00008715987,0.000110211,0.0002213262,0.0006605845,0.02238549,0.001846734,0.01567311,0.776288,0.05951975,0.1224534],"study_design_scores_gemma":[0.02485062,0.00126206,0.004801169,0.001795616,0.0001998869,0.0003598535,0.007183351,0.004709738,0.01064677,0.3851541,0.5561827,0.002854059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2376695,0.006266295,0.4743706,0.06372786,0.002903437,0.005206567,0.000140592,0.003648947,0.2060663],"genre_scores_gemma":[0.7619237,0.0009653628,0.1975989,0.002523004,0.0004937344,0.00002106047,0.00006685561,0.0000916137,0.03631575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5242543,"threshold_uncertainty_score":0.9999968,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002576771,0.0002881774,0.0004720342,0.0002293149,0.00012384,0.00003327451,0.0003776388,0.0001789722,0.0001678187],"category_scores_gemma":[0.00001226876,0.0003086001,0.0002351781,0.0003068899,0.0001284192,0.0005952317,0.00009713061,0.0001976845,0.0001108883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009216586,"about_ca_system_score_gemma":0.0000283558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003381674,"about_ca_topic_score_gemma":0.00006987939,"domain_scores_codex":[0.9985088,0.0000893494,0.0004239383,0.0002700246,0.0002548908,0.0004530335],"domain_scores_gemma":[0.9992814,0.00007707909,0.0001119983,0.0003507176,0.00008120925,0.00009757628],"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.002268787,0.0009422939,0.05886583,0.003009065,0.002674122,0.001272263,0.01725077,0.07276312,0.1732025,0.6180552,0.02653421,0.02316183],"study_design_scores_gemma":[0.02288925,0.003111923,0.103584,0.002740527,0.002939593,0.0005351747,0.08664183,0.04825369,0.2630098,0.02732101,0.4300839,0.008889251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.959007,0.0006736708,0.00276316,0.00006128537,0.0009600425,0.0002289723,0.0000463365,0.000433957,0.03582559],"genre_scores_gemma":[0.9985528,0.00003006278,0.000225011,0.0000164767,0.0002853895,0.000005554717,0.00003126873,0.00004478171,0.0008086746],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5907342,"threshold_uncertainty_score":0.9999366,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002209462,0.0003107645,0.000302959,0.000240569,0.0004086682,0.0002263672,0.001351206,0.0001292007,0.00005011095],"category_scores_gemma":[0.00002962683,0.0002854572,0.0001065947,0.000498697,0.0001580615,0.00322397,0.00100927,0.0002165716,0.0001441594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001648592,"about_ca_system_score_gemma":0.0001514345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002617978,"about_ca_topic_score_gemma":0.00002523597,"domain_scores_codex":[0.9981738,0.00006138221,0.0002110512,0.0006513809,0.0003667631,0.0005356128],"domain_scores_gemma":[0.9986898,0.0000657843,0.000120856,0.0008250356,0.00006871207,0.0002297717],"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.00006277844,0.0002045374,0.0007845218,0.0001239706,0.0002260535,0.0006279461,0.005728472,0.0006760379,0.01002139,0.849023,0.002223387,0.1302979],"study_design_scores_gemma":[0.03721415,0.00228742,0.2707901,0.0008904908,0.0007913474,0.002219621,0.01155762,0.09954476,0.01293544,0.4378492,0.1154275,0.008492362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8914729,0.000536816,0.08890583,0.005674516,0.00112222,0.0004301516,0.00003607749,0.001673646,0.01014789],"genre_scores_gemma":[0.9695046,0.0001133809,0.02874632,0.0006920003,0.0001111953,0.000001946782,0.00001433101,0.00002271999,0.0007935086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4111738,"threshold_uncertainty_score":0.9999598,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009305716,0.0002454194,0.0002542457,0.0001444121,0.0003409781,0.0001179944,0.0007851856,0.0001196376,0.0002069868],"category_scores_gemma":[0.0000236921,0.0002400253,0.00009161516,0.0003692872,0.0001604759,0.001980032,0.000601933,0.0002031011,0.000391269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006606345,"about_ca_system_score_gemma":0.00002758302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002058145,"about_ca_topic_score_gemma":0.000007922168,"domain_scores_codex":[0.9983142,0.00005977564,0.0001828683,0.0006117138,0.0003014444,0.0005300038],"domain_scores_gemma":[0.9990583,0.00006935123,0.00008950248,0.0004891623,0.00005736512,0.0002363345],"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.0001647856,0.0007178052,0.005457971,0.0001190539,0.0002442506,0.002230286,0.01145523,0.000308892,0.003728157,0.601226,0.02254062,0.3518069],"study_design_scores_gemma":[0.01002773,0.002488045,0.04386573,0.0001422589,0.0003784774,0.0009346593,0.005425989,0.158062,0.004382405,0.02796491,0.7418551,0.004472685],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7031816,0.002822398,0.2108268,0.009426309,0.001713494,0.0006622043,0.00002916658,0.001352641,0.0699854],"genre_scores_gemma":[0.9778801,0.0002099328,0.01724181,0.0004580977,0.0002159372,0.000003218787,0.000003197465,0.00001531428,0.003972414],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7193145,"threshold_uncertainty_score":0.9787949,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480786,0.0002017883,0.0002550519,0.0001306226,0.0003344709,0.0001057572,0.001936216,0.00008876422,0.00005523243],"category_scores_gemma":[0.00006959236,0.0001550862,0.0001553849,0.0005299656,0.0001530366,0.0009259757,0.0006714094,0.0002002213,0.0001002662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006833751,"about_ca_system_score_gemma":0.00009030953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001029872,"about_ca_topic_score_gemma":0.00001536063,"domain_scores_codex":[0.998382,0.000189054,0.0002413361,0.000411745,0.0003848526,0.0003910278],"domain_scores_gemma":[0.9983366,0.0002476554,0.0001969157,0.001015618,0.00009733855,0.0001059267],"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.00004286249,0.0001942426,0.0006146507,0.0000865975,0.0002265739,0.00005229785,0.01300448,0.003130556,0.02696,0.6586052,0.01707318,0.2800094],"study_design_scores_gemma":[0.00363019,0.0007188416,0.006215355,0.0002890119,0.0002662754,0.0001150901,0.01111188,0.7976811,0.01136307,0.01974935,0.1469983,0.001861527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5656314,0.0002836107,0.3955409,0.003849353,0.001192922,0.0003474024,0.000007857089,0.0004862906,0.03266023],"genre_scores_gemma":[0.9770265,0.00002748807,0.02028751,0.0008651865,0.0001859243,0.000002582417,0.000003460566,0.00001707757,0.001584254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7945505,"threshold_uncertainty_score":0.6324232,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002481864,0.00026593,0.0002765723,0.00019377,0.0003791231,0.0001978639,0.001337697,0.0001469043,0.00003751291],"category_scores_gemma":[0.00005061928,0.0002554684,0.00009781963,0.0003604208,0.0001518301,0.003542646,0.0009588839,0.0002029676,0.0001302759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000214672,"about_ca_system_score_gemma":0.0001483351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000319297,"about_ca_topic_score_gemma":0.0001905309,"domain_scores_codex":[0.9983641,0.00004294979,0.0002363831,0.0005241247,0.000353492,0.0004789546],"domain_scores_gemma":[0.9986187,0.00007896841,0.0001430498,0.0008449782,0.0001056562,0.0002086922],"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.00006601556,0.0001388973,0.0005828704,0.00005457503,0.0001055766,0.0001907601,0.007034525,0.0001111977,0.001826694,0.7679653,0.002906445,0.2190171],"study_design_scores_gemma":[0.05207362,0.003563057,0.09617838,0.00108835,0.0005585297,0.001386802,0.0570625,0.03231078,0.03623926,0.5178758,0.1945923,0.00707065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8285192,0.000764912,0.1532717,0.005530368,0.0005639314,0.000454557,0.00003110487,0.0006572522,0.01020699],"genre_scores_gemma":[0.9925663,0.00008503494,0.005299958,0.001505291,0.00006257545,0.000003709963,0.00001681064,0.00001785455,0.0004424534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2500895,"threshold_uncertainty_score":0.9999897,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000304077,0.000188491,0.0003883749,0.0001084745,0.0002897327,0.00008223995,0.00267589,0.00006782213,0.00004276971],"category_scores_gemma":[0.00004771606,0.0001827778,0.0001446133,0.0001460673,0.0006307847,0.001586819,0.0009715825,0.0001213144,0.00002312112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000614176,"about_ca_system_score_gemma":0.00009286319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005048505,"about_ca_topic_score_gemma":0.00008908303,"domain_scores_codex":[0.9985763,0.00007615747,0.000255879,0.0003877944,0.0003853172,0.0003185918],"domain_scores_gemma":[0.9974207,0.00006271542,0.0005021862,0.001762219,0.0001481915,0.0001040006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001535768,0.0004436901,0.007628063,0.0004765674,0.0002962936,0.0002181912,0.007892828,0.0001425348,0.02005513,0.9037238,0.002671745,0.05629753],"study_design_scores_gemma":[0.008358226,0.001232663,0.5850902,0.001157082,0.0003741184,0.00006468692,0.0091277,0.0383666,0.1695787,0.1528251,0.03097411,0.002850819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8567443,0.0005935581,0.1158491,0.0009637861,0.0003938805,0.000306729,0.0001786592,0.0002236186,0.02474635],"genre_scores_gemma":[0.9897357,0.00005550962,0.008429131,0.00003673425,0.00003081485,9.682024e-7,0.000007858388,0.00001181275,0.001691435],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7508987,"threshold_uncertainty_score":0.7453464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}