{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":15,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":15,"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"},"query_hash":"7d8c86881a2d","filters":{"venue":"DCFS"}},"results":[{"id":"W2399631585","doi":"","title":"Watson-Crick automata: determinism and state complexity","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Automaton; Watson; Unary operation; Determinism; Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Philosophy; DNA; Epistemology; Base pair","retraction":null,"screen_n_in":null,"score":{"opus":0.04379430995703225,"gpt":0.2559104416936314,"spread":0.2121161317365991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006696699,0.00009029093,0.00009565618,0.00001041373,0.0001158209,0.0000107478,0.00008871964,0.00005916731,0.000007318734],"category_scores_gemma":[0.00002520132,0.00006925345,0.00003449287,0.00002830468,0.0001512998,0.000001526328,0.0001486988,0.00004997849,0.00001313436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000281144,"about_ca_system_score_gemma":0.00001253074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001251674,"about_ca_topic_score_gemma":0.00000506832,"domain_scores_codex":[0.9994204,0.00003039352,0.0001034405,0.0002200957,0.00005028237,0.0001753605],"domain_scores_gemma":[0.9997398,0.000008389514,0.00003066954,0.0001377278,0.00002076383,0.00006261686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001437897,0.0001646969,0.05664932,0.00004677967,0.00007920097,0.000156619,0.0003392096,0.00001138015,0.8426726,0.0003375149,0.007245664,0.09215324],"study_design_scores_gemma":[0.001928846,0.001487162,0.4234367,0.00002086345,0.00001837409,0.0006493174,0.00005815422,0.001614598,0.2107675,0.002182446,0.3569165,0.0009195297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972316,0.0002140535,0.0004986936,0.0001066559,0.00006869296,0.00005642239,0.000009421863,0.00002693735,0.001787505],"genre_scores_gemma":[0.9973472,0.0001188862,0.00146403,0.000352875,0.0001297811,0.000002109568,0.00003646861,0.000005941788,0.0005426559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6319051,"threshold_uncertainty_score":0.2824074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401899815","doi":"","title":"A characterization of the arithmetical hierarchy by language equations.","year":2004,"lang":"en","type":"article","venue":"DCFS","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":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Mathematics; Concatenation (mathematics); Hierarchy; Expressive power; Class (philosophy); Axiom; Second-order arithmetic; Property (philosophy); Characterization (materials science); Analytical hierarchy; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.00519566250757594,"gpt":0.2101366202119873,"spread":0.2049409577044113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001031332,0.00003927527,0.00004949475,0.00002098261,0.00004063281,0.00002889743,0.0003635491,0.00002150405,0.00001187159],"category_scores_gemma":[0.0000374025,0.00002687727,0.00002804543,0.0002012192,0.00003815643,0.0001273654,0.00008857084,0.00004476789,0.00001648019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001264934,"about_ca_system_score_gemma":0.0000244302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001424873,"about_ca_topic_score_gemma":8.702508e-7,"domain_scores_codex":[0.9995837,0.000027858,0.00008953142,0.00009439079,0.0001253467,0.00007921449],"domain_scores_gemma":[0.9996243,0.00003054348,0.00003919308,0.0002710591,0.00001559658,0.00001936559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[9.173527e-7,0.0000483869,0.00004269754,0.000004980072,0.000004250093,0.000001152227,0.001556932,0.000008295728,0.474588,0.5013263,0.00004039484,0.02237765],"study_design_scores_gemma":[0.0009454874,0.00008537687,0.01505022,0.00008116632,0.00001199204,0.00001559933,0.00009956722,0.02332537,0.8989403,0.05620525,0.004949539,0.0002901597],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4265438,0.00002837707,0.5707166,0.002145841,0.0001003948,0.00006036351,0.000008310876,0.00004475095,0.0003516664],"genre_scores_gemma":[0.997246,0.000001786043,0.002175027,0.0004233898,0.00002646281,0.000004240432,0.000007583421,0.000002868848,0.0001126684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5707022,"threshold_uncertainty_score":0.1096023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406664471","doi":"","title":"Estimation of State Complexity of Combined Operations.","year":2008,"lang":"en","type":"article","venue":"DCFS","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; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Automaton; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03663116717581648,"gpt":0.2526408769094715,"spread":0.216009709733655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107805,0.00003994733,0.00009829813,0.0000382716,0.00004453157,0.000006973134,0.0002409027,0.00001177039,0.00001463824],"category_scores_gemma":[0.00001916882,0.00003616945,0.00002325326,0.0001432444,0.000108833,0.0001892866,0.00005957764,0.00002431892,0.00001006292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000586249,"about_ca_system_score_gemma":0.00002891971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006671706,"about_ca_topic_score_gemma":0.000003544504,"domain_scores_codex":[0.9995518,0.00002903665,0.0001634606,0.00008226846,0.0001123637,0.00006108383],"domain_scores_gemma":[0.9996114,0.00002925629,0.00004886587,0.0002446432,0.00004697197,0.0000188117],"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.00001631577,0.0002505629,0.0009164282,0.00005351233,0.00002543836,0.000007575482,0.004646303,0.02256161,0.01451636,0.9066924,0.0009764952,0.04933693],"study_design_scores_gemma":[0.0002945177,0.00007800513,0.01873393,0.00001328215,0.000001494829,0.00000719933,0.000009162548,0.8986973,0.05843501,0.02362455,0.00004361149,0.0000619096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6475559,0.00001736198,0.3517852,0.0001370674,0.00004984092,0.00004702208,0.000004982156,0.00003457572,0.0003680935],"genre_scores_gemma":[0.9531761,0.000004687351,0.04670675,0.00004239269,0.000004167771,0.000001655993,0.000005640746,0.000001901366,0.00005665648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8830679,"threshold_uncertainty_score":0.1474947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403784750","doi":"","title":"Transition Complexity of Language Operations.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","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":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Regular language; Computer science; Deterministic finite automaton; State (computer science); Regular expression; Finite-state machine; Automaton; Mathematics; Theoretical computer science; Programming language; Automata theory","retraction":null,"screen_n_in":null,"score":{"opus":0.01385649125563036,"gpt":0.233511927603605,"spread":0.2196554363479746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007992967,0.00003330526,0.00005323561,0.00002540348,0.00003235955,0.00002277892,0.0001663165,0.00001444279,0.00003264566],"category_scores_gemma":[0.000002057046,0.00002995599,0.00002361654,0.00009551347,0.00003628346,0.0001449913,0.00001745843,0.00002235507,0.00001826194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000532919,"about_ca_system_score_gemma":0.000008011032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003062591,"about_ca_topic_score_gemma":0.00003946518,"domain_scores_codex":[0.9996808,0.00002150081,0.00008482157,0.00008106475,0.00007109057,0.00006067677],"domain_scores_gemma":[0.9997779,0.00001056074,0.00001280245,0.0001722211,0.00001601448,0.00001046806],"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.000001259853,0.00005092389,0.00002532355,0.000008880815,0.000002600943,0.000004815425,0.001300412,0.0005277494,0.03930215,0.9499993,0.0005915034,0.00818509],"study_design_scores_gemma":[0.0009799965,0.0001123209,0.02999721,0.00004633255,0.00001095792,0.00003462034,0.0004067514,0.5968422,0.2529487,0.1160229,0.00220013,0.0003979167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4669541,0.00008993768,0.5284825,0.0006685391,0.00006106551,0.00004374123,0.000007806638,0.00009037922,0.003601965],"genre_scores_gemma":[0.9808871,5.814962e-7,0.01885009,0.0001305004,0.00004501527,0.000001711005,0.00001229865,0.000001785283,0.00007091332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8339764,"threshold_uncertainty_score":0.122157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395596657","doi":"","title":"Operational State Complexity of Nested Word Automata.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Nested word; Quantum finite automata; Finite-state machine; Mathematics; Discrete mathematics; Constant (computer programming); Upper and lower bounds; Automaton; Word (group theory); Deterministic finite automaton; Automata theory; Combinatorics; Computer science; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04680536913484907,"gpt":0.2496788406865612,"spread":0.2028734715517122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394079,0.00007428086,0.0001217004,0.00004837392,0.00009840808,0.00002573127,0.0004791999,0.00002030176,0.00005393152],"category_scores_gemma":[0.00001551752,0.0000658986,0.00003706438,0.0002142518,0.0001442433,0.0002944828,0.0001394355,0.00005213771,0.00007080836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001222176,"about_ca_system_score_gemma":0.00006515109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004810817,"about_ca_topic_score_gemma":0.000004640305,"domain_scores_codex":[0.9992597,0.00004564134,0.0001780896,0.0001709286,0.000206431,0.0001391946],"domain_scores_gemma":[0.9994321,0.00004965576,0.00005779848,0.0003552389,0.00005747638,0.00004774281],"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.00002953163,0.0004058037,0.004610642,0.00004719352,0.00006245312,0.0001490737,0.005488909,0.000965712,0.009362623,0.8801394,0.01328927,0.08544943],"study_design_scores_gemma":[0.001468722,0.0001570262,0.3674957,0.00004980118,0.000005327863,0.0002794924,0.00004179589,0.5250733,0.01795651,0.06800146,0.01892385,0.0005470523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720783,0.00006316872,0.1244575,0.0008532256,0.0002334195,0.00009571611,0.00001731291,0.0002752666,0.001926113],"genre_scores_gemma":[0.970152,0.000008783701,0.02911369,0.0003132338,0.00003505387,0.000003816809,0.00001050325,0.000004689077,0.0003582383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8121379,"threshold_uncertainty_score":0.2687267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405146722","doi":"","title":"An Infinite Hierarchy Induced by Depth Synchronization.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Bounded function; Context (archaeology); Grammar; Constant (computer programming); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Programming language; Data mining; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.009276167141911087,"gpt":0.2451326274002813,"spread":0.2358564602583702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006900275,0.00008668636,0.00006564868,0.00001505402,0.00006927711,0.00002735406,0.0001292692,0.0001188165,0.00001773522],"category_scores_gemma":[0.00002159386,0.00007157143,0.00002965484,0.0000744258,0.00002874645,0.000002422302,0.00004483027,0.00005360656,0.00001372277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005871221,"about_ca_system_score_gemma":0.00001750365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003791333,"about_ca_topic_score_gemma":0.00001929736,"domain_scores_codex":[0.999405,0.00004242675,0.0001130001,0.0002172396,0.00005603367,0.0001662745],"domain_scores_gemma":[0.999719,0.00000592469,0.0000353371,0.0001605007,0.00003565265,0.00004356065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009544312,0.00004780341,0.00914024,0.000002596688,0.000005930789,0.000001131672,0.000004121472,0.00004976452,0.9740156,0.0001853733,0.002312716,0.01422519],"study_design_scores_gemma":[0.001014203,0.001358943,0.04932633,0.00001285964,0.00001636879,0.00001283297,0.00003281737,0.001557717,0.6554351,0.000912749,0.2895984,0.0007216617],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9887078,0.0002224558,0.005343143,0.00006768875,0.00005930096,0.00005886218,0.000008138637,0.00002795009,0.005504681],"genre_scores_gemma":[0.9978248,0.000008369921,0.0004880579,0.0003673744,0.000418619,0.000003410659,0.0006376443,0.000008899804,0.0002428422],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3185805,"threshold_uncertainty_score":0.2918598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407962255","doi":"","title":"State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.","year":2008,"lang":"en","type":"article","venue":"DCFS","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":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Combinatorics; State (computer science); Class (philosophy); Hierarchy; Discrete mathematics; Formal language; Complexity class; Simple (philosophy); Pumping lemma for regular languages; Set (abstract data type); Automaton; Time complexity; Computer science; Theoretical computer science; Algorithm; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02179248935497502,"gpt":0.2469051806248609,"spread":0.2251126912698859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001745115,0.00009133048,0.0002029694,0.0000665362,0.00005281798,0.000008738602,0.0006043424,0.00002553402,0.00004249782],"category_scores_gemma":[0.00004755664,0.00007673192,0.0000652785,0.000216669,0.0002462546,0.0002145174,0.0001780008,0.00006772316,0.00001138759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000116703,"about_ca_system_score_gemma":0.00004934167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001800579,"about_ca_topic_score_gemma":0.000011381,"domain_scores_codex":[0.9991967,0.00004135624,0.0002227989,0.0001584285,0.0002068301,0.0001738854],"domain_scores_gemma":[0.9991471,0.0001961002,0.0001164842,0.0004495937,0.00004770409,0.00004304048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006488782,0.0004234581,0.01215172,0.0003200489,0.0001743444,0.0001475024,0.02807578,0.0002199603,0.03734702,0.7558483,0.004105835,0.1611211],"study_design_scores_gemma":[0.002064701,0.0006811554,0.330532,0.0001725351,0.00002011559,0.0001573786,0.001040705,0.02149833,0.4407691,0.1928432,0.00932257,0.0008981961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806172,0.0002794882,0.0135513,0.0001569649,0.00008492625,0.00006781013,0.0000260934,0.0001047328,0.00511152],"genre_scores_gemma":[0.9751512,0.00005894629,0.02435809,0.00007467991,0.00002475733,0.000001978543,0.000002631718,0.000005890883,0.0003217855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5630051,"threshold_uncertainty_score":0.3129037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402932091","doi":"","title":"Regulated RNA rewriting: modelling RNA editing with guided insertion.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"RNA regulation and disease","field":"Biochemistry, Genetics and Molecular Biology","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":"RNA editing; Rewriting; String (physics); RNA; Computer science; Hierarchy; Computational biology; Programming language; Theoretical computer science; Biology; Genetics; Gene; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01292252746455459,"gpt":0.2293625100470769,"spread":0.2164399825825223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008156255,0.0001159112,0.00008452136,0.00003931805,0.00010559,0.0000359777,0.00008030464,0.00008633592,0.0000268547],"category_scores_gemma":[0.00001935196,0.0001055478,0.00005078343,0.0001049105,0.00004000926,0.000005943554,0.00002599789,0.00004412863,0.00001007883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001147868,"about_ca_system_score_gemma":0.00004228982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008592477,"about_ca_topic_score_gemma":0.00001605291,"domain_scores_codex":[0.9992055,0.00002505899,0.0001950799,0.0002504957,0.0001360515,0.0001877777],"domain_scores_gemma":[0.9994841,0.000003757291,0.00008578323,0.0002339636,0.0001195179,0.0000728481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002215007,0.0001090491,0.004797902,0.00003682398,0.00004979069,0.00002474794,0.00002655136,0.1636638,0.8012018,0.00161645,0.02534978,0.002901745],"study_design_scores_gemma":[0.005175027,0.0003163555,0.0152468,0.0001808663,0.0001117472,0.00008103427,0.0002159311,0.1481016,0.6932262,0.002102046,0.1339549,0.00128751],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9623958,0.0002120815,0.01727191,0.0004210133,0.00005831148,0.0001038109,0.000006246653,0.00004751943,0.01948329],"genre_scores_gemma":[0.9939261,0.00001163936,0.002295888,0.0002142157,0.0007472372,0.000008548124,0.0002709885,0.00002338175,0.002502003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1086051,"threshold_uncertainty_score":0.4304114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399228482","doi":"","title":"Context Derivation Sets and Context-Free Normal Forms.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"Natural Language Processing Techniques","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; Context-free grammar; Symbol (formal); Context-sensitive grammar; Tree-adjoining grammar; Mathematics; Grammar; Context (archaeology); Mildly context-sensitive grammar formalism; Computer science; Indexed grammar; Rule-based machine translation; Natural language processing; Linguistics; Generative grammar; Artificial intelligence; Phrase structure rules; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01591446828257888,"gpt":0.2380189876566181,"spread":0.2221045193740392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000983641,0.00009014501,0.0000926229,0.00005887551,0.0000913638,0.0001487701,0.0005526001,0.00005812889,0.00002663605],"category_scores_gemma":[0.00009588547,0.00007614687,0.0000198176,0.000139884,0.0000393706,0.0007755883,0.000264922,0.0001049654,0.00002118984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002026587,"about_ca_system_score_gemma":0.000006372029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003158113,"about_ca_topic_score_gemma":0.00003185092,"domain_scores_codex":[0.9993581,0.00001498636,0.0001202642,0.0001967359,0.000142989,0.0001669511],"domain_scores_gemma":[0.9994367,0.00003752865,0.00005838993,0.0003624455,0.00005500282,0.00004993319],"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.000002295877,0.00001279219,0.0003437894,0.00001589212,0.000004589924,0.0000136474,0.001077618,9.203561e-8,0.0009811553,0.07832374,0.008232377,0.910992],"study_design_scores_gemma":[0.004549406,0.0007907463,0.005683677,0.0003830362,0.00003328498,0.0006821018,0.0003823518,0.1322051,0.2501452,0.4684676,0.1344945,0.002182964],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1460661,0.02626959,0.800815,0.0155175,0.0004080802,0.0005950014,0.00001328147,0.002473945,0.007841526],"genre_scores_gemma":[0.9099042,0.00002561046,0.08847474,0.001354353,0.00002764762,0.000008150466,0.000001595409,0.000005589105,0.0001981115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9088091,"threshold_uncertainty_score":0.3105179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394530209","doi":"","title":"Template-Guided DNA Recombination.","year":2003,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genetics; Process (computing); Computer science; Genome; Computational biology; Biology; Homologous recombination; Theoretical computer science; Evolutionary biology; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02480202743808408,"gpt":0.2664438342051604,"spread":0.2416418067670763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000148142,0.00006825549,0.00005988478,0.0000120893,0.00005898407,0.00001318496,0.00008042726,0.00008691794,0.00005879158],"category_scores_gemma":[0.0001450185,0.00005478483,0.00004411215,0.00005127276,0.00002120564,9.404688e-7,0.00002979259,0.00003895694,0.00004510704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004538289,"about_ca_system_score_gemma":0.00001795053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002085734,"about_ca_topic_score_gemma":9.477473e-7,"domain_scores_codex":[0.9994901,0.00004814826,0.0001024637,0.0001794674,0.00004172852,0.0001380995],"domain_scores_gemma":[0.9997593,0.000007675306,0.00002978645,0.0001299288,0.00003503374,0.00003832544],"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.0000116627,0.00006375535,0.007056236,0.000007365501,0.00002784429,0.000005113393,0.00001366692,0.00001823139,0.957817,0.004520648,0.02263395,0.007824588],"study_design_scores_gemma":[0.0003662056,0.0001727709,0.002799093,0.000004057987,0.000004180205,0.00002144123,0.00001765764,0.00001740661,0.4114634,0.001470954,0.5834929,0.0001700293],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9503366,0.0001473299,0.0007651695,0.0001153826,0.0001921532,0.00006017317,0.000001524993,0.00001794079,0.04836369],"genre_scores_gemma":[0.9964125,0.00001605403,0.0008624497,0.0003551877,0.00008885615,0.000003394163,0.00003800644,0.000005708054,0.002217829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5608589,"threshold_uncertainty_score":0.2234061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404946359","doi":"","title":"Repetition Complexity of Words.","year":2002,"lang":"en","type":"article","venue":"DCFS","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":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Mathematics; Logarithm; Computational complexity theory; Iterated function; Time complexity; Complexity class; Combinatorics; Prefix; Discrete mathematics; Morphism; Combinatorics on words; Arithmetic; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04814744801460979,"gpt":0.2303528403070573,"spread":0.1822053922924475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009830947,0.00003838141,0.0000660129,0.00002922298,0.00002776152,0.00001761917,0.000284129,0.00001728337,0.0002455043],"category_scores_gemma":[0.00001213291,0.00003486071,0.00002963861,0.0001344579,0.00005468255,0.0001378532,0.00006907992,0.0000330896,0.0001077898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006716226,"about_ca_system_score_gemma":0.000002155543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000012332,"about_ca_topic_score_gemma":0.000001359678,"domain_scores_codex":[0.999588,0.00002237549,0.00009418034,0.0001134453,0.00009831574,0.00008372247],"domain_scores_gemma":[0.9995776,0.00002302349,0.00004282785,0.0003165419,0.00001679312,0.00002315439],"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":[9.711932e-7,0.00005560367,0.0002005168,0.00001150563,0.000004767623,0.000005943904,0.0006589178,0.000005220595,0.001902692,0.9165763,0.00422625,0.07635134],"study_design_scores_gemma":[0.0009644838,0.0002345203,0.02720987,0.000128654,0.00001008537,0.00006980413,0.0001144883,0.3690687,0.03924097,0.4917406,0.07065261,0.0005651429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3332233,0.0008007139,0.5358206,0.006135734,0.0009152193,0.0002031363,0.00001285321,0.0006965438,0.1221919],"genre_scores_gemma":[0.9850406,0.000009954359,0.01437763,0.0001953292,0.00003894056,0.000001469003,0.000001045524,0.00000219114,0.0003328277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6518173,"threshold_uncertainty_score":0.26881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405494927","doi":"","title":"Non-Uniqueness and Radius of Cyclic Unary NFAs.","year":2004,"lang":"es","type":"article","venue":"DCFS","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":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Artificial intelligence; Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.006565634247570317,"gpt":0.2289848860190896,"spread":0.2224192517715192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002644013,0.0001766772,0.0002748571,0.0001069409,0.0000868576,0.0001083511,0.0005464463,0.0001040126,0.00001548563],"category_scores_gemma":[0.00001411848,0.0001645775,0.00006790944,0.000300877,0.0002063112,0.000300587,0.0002971138,0.0001226819,0.0000349383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002785043,"about_ca_system_score_gemma":0.00009306466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001882386,"about_ca_topic_score_gemma":0.000002613244,"domain_scores_codex":[0.9988877,0.00004101804,0.0002573966,0.0003578502,0.0001873346,0.0002687551],"domain_scores_gemma":[0.9991071,0.00007112106,0.0001272445,0.0005478898,0.00003843639,0.000108246],"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.00004720681,0.000412706,0.008895773,0.0006373274,0.0001232281,0.0003088747,0.006693937,0.0004593008,0.04802643,0.7264449,0.0004529739,0.2074974],"study_design_scores_gemma":[0.005651767,0.001343516,0.3789166,0.002644991,0.0001466915,0.0006079556,0.0005030988,0.02533582,0.3022428,0.2677045,0.01283899,0.002063301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9755481,0.001904417,0.01886215,0.0008777539,0.0003802344,0.0001419982,0.00001124439,0.00007437007,0.002199761],"genre_scores_gemma":[0.9955457,0.0002918935,0.003640759,0.0003062959,0.0001203174,0.000004469559,0.000002322361,0.0000144492,0.00007373176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4587404,"threshold_uncertainty_score":0.6711277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394623614","doi":"","title":"Descriptional Complexity of Block-Synchronization Context-Free Grammars.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Context-sensitive grammar; Tree-adjoining grammar; Symbol (formal); Indexed grammar; Context-free grammar; Abstract family of languages; Synchronization (alternating current); Computer science; L-attributed grammar; Context (archaeology); Rule-based machine translation; Block (permutation group theory); Mathematics; Theoretical computer science; Programming language; Natural language processing; Combinatorics; Second-generation programming language; Topology (electrical circuits)","retraction":null,"screen_n_in":null,"score":{"opus":0.05291241192464367,"gpt":0.2336597088743505,"spread":0.1807472969497068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006882725,0.00007199039,0.00008784785,0.00001346155,0.00004743117,0.000007538257,0.0001664072,0.0000809114,0.0001214706],"category_scores_gemma":[0.0001038093,0.00006074998,0.00005534907,0.00005294514,0.0001424512,0.000001429476,0.0001131165,0.00004061994,0.00001096967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006215311,"about_ca_system_score_gemma":0.00000615445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001197916,"about_ca_topic_score_gemma":0.00001649416,"domain_scores_codex":[0.9994726,0.00003344332,0.0001407606,0.0001576332,0.000075124,0.0001204257],"domain_scores_gemma":[0.9996448,0.000006931637,0.0000578094,0.0001853887,0.00007097959,0.0000341374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001093768,0.0003891231,0.02906654,0.00005316283,0.0001059914,0.000005301877,0.00008241933,0.0001356771,0.8666218,0.01605899,0.02492059,0.06245106],"study_design_scores_gemma":[0.006995166,0.004798861,0.09063613,0.0001221446,0.0001058686,0.0001477525,0.0002837754,0.0249275,0.4465792,0.02516148,0.3984248,0.001817308],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.98989,0.0007935907,0.00541109,0.0003409754,0.0001290176,0.00009383968,0.00003008292,0.00001758834,0.003293789],"genre_scores_gemma":[0.9978055,0.00002938033,0.001420692,0.0002124312,0.0001877015,0.000001924079,0.00008599782,0.00000480417,0.0002516226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4200426,"threshold_uncertainty_score":0.2477312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401586919","doi":"","title":"Restricted sets of trajectories and decidability of shuffle decompositions.","year":2004,"lang":"en","type":"article","venue":"DCFS","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; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Combinatorics; Automaton; Computer science; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.008540758322706883,"gpt":0.2390265918184794,"spread":0.2304858334957726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001032396,0.00005187299,0.0001151681,0.0000456724,0.00003270425,0.00001345259,0.0002124682,0.00002875479,0.000004714605],"category_scores_gemma":[0.00003767169,0.00004614929,0.00002730608,0.0002354368,0.00008581811,0.0001523027,0.00007367235,0.00003422874,0.000001082356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001352419,"about_ca_system_score_gemma":0.00004289785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001017759,"about_ca_topic_score_gemma":0.000009849809,"domain_scores_codex":[0.9994981,0.00002650551,0.000160639,0.0001338109,0.00009941634,0.00008158193],"domain_scores_gemma":[0.9994848,0.0001019401,0.00006061895,0.0002730084,0.00004689006,0.00003276083],"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.00006078376,0.0006851283,0.02965258,0.000225593,0.00007024124,0.00001906375,0.007037519,0.0004402965,0.1175384,0.784207,0.0003000295,0.05976336],"study_design_scores_gemma":[0.001033926,0.0002945485,0.5537557,0.00008657802,0.00001372108,0.00002849148,0.0001188686,0.002203876,0.2176739,0.2243048,0.0002759443,0.0002096183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9661678,0.0001610563,0.03301312,0.0001785899,0.00007975441,0.00006288208,0.000008539981,0.00004306339,0.0002851953],"genre_scores_gemma":[0.9732677,0.000008557835,0.02668166,0.00002309717,0.000009826047,0.000002476139,0.000001590035,0.000002131369,0.000002911436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5599023,"threshold_uncertainty_score":0.1881913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406034771","doi":"","title":"On the Synchronized Derivation Depth of Context-Free Grammars.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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; Western University","funders":"","keywords":"Tree-adjoining grammar; Indexed grammar; Rule-based machine translation; L-attributed grammar; Context-free grammar; Measure (data warehouse); Embedded pushdown automaton; Context (archaeology); Context-sensitive grammar; Mathematics; Synchronization (alternating current); Tree (set theory); Deterministic context-free grammar; Computer science; Combinatorics; Artificial intelligence; Geography; Topology (electrical circuits)","retraction":null,"screen_n_in":null,"score":{"opus":0.02304809789915491,"gpt":0.228789765466021,"spread":0.2057416675668661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009100889,0.00006263906,0.00007217073,0.000008021657,0.00006835075,0.000003295222,0.0001864736,0.00006369928,0.00001705306],"category_scores_gemma":[0.0002956917,0.00003660583,0.00005407085,0.0000415987,0.0000852282,6.34575e-7,0.00007915411,0.00004488933,0.000005792122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003749993,"about_ca_system_score_gemma":0.0000157276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100985,"about_ca_topic_score_gemma":0.000008515217,"domain_scores_codex":[0.9995697,0.00004262468,0.0001046125,0.0001212434,0.00006297565,0.00009883783],"domain_scores_gemma":[0.9996146,0.00003940029,0.00005255089,0.000239243,0.00003626334,0.00001792999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00021962,0.0001076391,0.01064389,0.00001249722,0.00006594175,0.000006674265,0.00006941727,0.00004664464,0.9329581,0.01054122,0.0140266,0.03130179],"study_design_scores_gemma":[0.001962421,0.001655404,0.05283334,0.00003718423,0.00001783395,0.00003757238,0.0001098508,0.000477032,0.8909685,0.004304657,0.0472176,0.0003785751],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954852,0.0001992795,0.001520058,0.0003216084,0.00005012937,0.00008321449,0.000003097688,0.000007663032,0.002329726],"genre_scores_gemma":[0.9988614,0.00003158708,0.000256283,0.0005855754,0.00009314514,0.000003754403,0.00002536744,0.000004215956,0.0001387239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04218945,"threshold_uncertainty_score":0.1492742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}