{"meta":{"query_hash":"7d8c86881a2d","filters":{"venue":"DCFS"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7d8c86881a2d","api":"https://metacan.xera.ac/api/v1/cohort?venue=DCFS"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024802027438084077,"score_gpt":0.2664438342051604,"score_spread":0.2416418067670763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394530209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95033664,0.00014732992,0.0007651695,0.000115382645,0.00019215322,0.00006017317,0.0000015249932,0.00001794079,0.04836369],"genre_scores_gemma":[0.9964125,0.000016054031,0.0008624497,0.00035518775,0.00008885615,0.0000033941628,0.00003800644,0.000005708054,0.0022178285],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994901,0.000048148257,0.000102463724,0.00017946737,0.000041728523,0.00013809952],"domain_scores_gemma":[0.99975926,0.000007675306,0.000029786446,0.00012992875,0.000035033736,0.00003832544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014814196,0.00006825549,0.000059884776,0.000012089298,0.00005898407,0.000013184958,0.000080427264,0.00008691794,0.000058791582],"category_scores_gemma":[0.00014501848,0.000054784832,0.00004411215,0.000051272764,0.000021205644,9.404688e-7,0.000029792594,0.00003895694,0.000045107037],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011662702,0.000063755346,0.007056236,0.0000073655006,0.000027844293,0.0000051133934,0.000013666917,0.000018231394,0.95781696,0.004520648,0.022633947,0.007824588],"study_design_scores_gemma":[0.00036620558,0.00017277093,0.002799093,0.000004057987,0.0000041802055,0.00002144123,0.00001765764,0.000017406606,0.41146335,0.0014709543,0.5834929,0.00017002926],"about_ca_topic_score_codex":0.0000020857344,"about_ca_topic_score_gemma":9.477473e-7,"teacher_disagreement_score":0.5608589,"about_ca_system_score_codex":0.0000045382894,"about_ca_system_score_gemma":0.000017950533,"threshold_uncertainty_score":0.22340606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.05291241192464367,"score_gpt":0.23365970887435047,"score_spread":0.18074729694970681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394623614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98989004,0.00079359073,0.00541109,0.00034097536,0.0001290176,0.000093839684,0.000030082922,0.000017588336,0.0032937892],"genre_scores_gemma":[0.9978055,0.000029380331,0.0014206918,0.0002124312,0.00018770149,0.0000019240788,0.00008599782,0.0000048041697,0.00025162258],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994726,0.00003344332,0.00014076056,0.00015763317,0.000075124,0.000120425655],"domain_scores_gemma":[0.99964476,0.000006931637,0.0000578094,0.00018538868,0.000070979586,0.000034137403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006882725,0.00007199039,0.000087847846,0.000013461548,0.000047431167,0.000007538257,0.00016640725,0.0000809114,0.00012147059],"category_scores_gemma":[0.00010380929,0.000060749982,0.000055349068,0.000052945135,0.00014245116,0.0000014294756,0.00011311648,0.00004061994,0.000010969673],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001093768,0.00038912307,0.029066544,0.00005316283,0.0001059914,0.0000053018766,0.000082419334,0.00013567714,0.8666218,0.016058989,0.024920588,0.06245106],"study_design_scores_gemma":[0.0069951657,0.004798861,0.090636134,0.00012214456,0.00010586862,0.00014775251,0.00028377544,0.024927502,0.4465792,0.025161482,0.39842483,0.001817308],"about_ca_topic_score_codex":0.00001197916,"about_ca_topic_score_gemma":0.000016494158,"teacher_disagreement_score":0.42004257,"about_ca_system_score_codex":0.000006215311,"about_ca_system_score_gemma":0.0000061544497,"threshold_uncertainty_score":0.24773124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04680536913484907,"score_gpt":0.24967884068656124,"score_spread":0.20287347155171218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395596657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720783,0.00006316872,0.124457456,0.00085322565,0.0002334195,0.00009571611,0.00001731291,0.00027526665,0.0019261129],"genre_scores_gemma":[0.970152,0.000008783701,0.02911369,0.00031323376,0.000035053872,0.000003816809,0.000010503251,0.0000046890773,0.00035823832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992597,0.000045641336,0.00017808964,0.00017092863,0.00020643104,0.00013919456],"domain_scores_gemma":[0.9994321,0.00004965576,0.000057798483,0.00035523885,0.000057476384,0.000047742815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013940789,0.00007428086,0.000121700425,0.00004837392,0.000098408076,0.00002573127,0.0004791999,0.000020301763,0.00005393152],"category_scores_gemma":[0.000015517522,0.0000658986,0.000037064383,0.00021425182,0.00014424331,0.0002944828,0.00013943552,0.00005213771,0.00007080836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002953163,0.0004058037,0.0046106423,0.000047193524,0.000062453124,0.00014907373,0.0054889093,0.00096571195,0.009362623,0.88013935,0.01328927,0.085449435],"study_design_scores_gemma":[0.0014687219,0.00015702621,0.36749566,0.000049801176,0.0000053278627,0.00027949244,0.000041795895,0.5250733,0.017956508,0.068001464,0.018923854,0.0005470523],"about_ca_topic_score_codex":0.000048108173,"about_ca_topic_score_gemma":0.0000046403047,"teacher_disagreement_score":0.8121379,"about_ca_system_score_codex":0.000012221757,"about_ca_system_score_gemma":0.000065151085,"threshold_uncertainty_score":0.2687267},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01591446828257888,"score_gpt":0.23801898765661814,"score_spread":0.22210451937403924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399228482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14606605,0.026269594,0.800815,0.015517504,0.00040808017,0.0005950014,0.000013281466,0.0024739455,0.007841526],"genre_scores_gemma":[0.9099042,0.000025610463,0.088474736,0.001354353,0.000027647618,0.000008150466,0.0000015954089,0.000005589105,0.00019811148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935806,0.000014986362,0.000120264245,0.00019673585,0.00014298897,0.00016695113],"domain_scores_gemma":[0.9994367,0.000037528647,0.000058389927,0.00036244548,0.00005500282,0.000049933187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000983641,0.00009014501,0.0000926229,0.000058875507,0.0000913638,0.00014877011,0.0005526001,0.000058128888,0.000026636051],"category_scores_gemma":[0.00009588547,0.00007614687,0.0000198176,0.000139884,0.000039370603,0.0007755883,0.00026492198,0.000104965395,0.000021189837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022958773,0.000012792193,0.0003437894,0.000015892125,0.0000045899237,0.000013647404,0.001077618,9.203561e-8,0.0009811553,0.078323744,0.0082323775,0.910992],"study_design_scores_gemma":[0.0045494055,0.0007907463,0.005683677,0.00038303618,0.000033284985,0.00068210176,0.00038235178,0.13220514,0.25014523,0.46846756,0.13449451,0.0021829645],"about_ca_topic_score_codex":0.000031581134,"about_ca_topic_score_gemma":0.000031850923,"teacher_disagreement_score":0.90880907,"about_ca_system_score_codex":0.000020265868,"about_ca_system_score_gemma":0.0000063720295,"threshold_uncertainty_score":0.31051794},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04379430995703225,"score_gpt":0.25591044169363136,"score_spread":0.2121161317365991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399631585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972316,0.00021405348,0.0004986936,0.00010665593,0.00006869296,0.000056422392,0.000009421863,0.00002693735,0.0017875048],"genre_scores_gemma":[0.99734724,0.00011888617,0.00146403,0.00035287504,0.00012978114,0.000002109568,0.00003646861,0.0000059417875,0.0005426559],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994204,0.000030393521,0.00010344048,0.00022009567,0.00005028237,0.00017536055],"domain_scores_gemma":[0.9997398,0.000008389514,0.00003066954,0.00013772784,0.000020763826,0.00006261686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006696699,0.00009029093,0.00009565618,0.000010413732,0.00011582087,0.000010747803,0.00008871964,0.000059167305,0.000007318734],"category_scores_gemma":[0.000025201321,0.00006925345,0.000034492867,0.000028304685,0.00015129984,0.0000015263275,0.00014869877,0.000049978487,0.000013134356],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001437897,0.00016469693,0.05664932,0.000046779667,0.000079200974,0.00015661897,0.0003392096,0.000011380153,0.8426726,0.0003375149,0.0072456645,0.092153236],"study_design_scores_gemma":[0.0019288465,0.0014871616,0.42343673,0.00002086345,0.000018374087,0.0006493174,0.000058154223,0.0016145975,0.2107675,0.0021824464,0.3569165,0.0009195297],"about_ca_topic_score_codex":0.000012516743,"about_ca_topic_score_gemma":0.0000050683198,"teacher_disagreement_score":0.6319051,"about_ca_system_score_codex":0.00000281144,"about_ca_system_score_gemma":0.000012530736,"threshold_uncertainty_score":0.28240737},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008540758322706883,"score_gpt":0.23902659181847943,"score_spread":0.23048583349577256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401586919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661678,0.00016105633,0.03301312,0.00017858991,0.000079754405,0.00006288208,0.000008539981,0.000043063388,0.0002851953],"genre_scores_gemma":[0.97326773,0.000008557835,0.026681658,0.000023097173,0.000009826047,0.0000024761387,0.0000015900351,0.0000021313688,0.0000029114356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99949807,0.000026505513,0.00016063897,0.00013381093,0.00009941634,0.00008158193],"domain_scores_gemma":[0.9994848,0.00010194011,0.000060618946,0.00027300837,0.000046890058,0.00003276083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010323961,0.000051872987,0.00011516807,0.0000456724,0.000032704254,0.000013452594,0.00021246819,0.00002875479,0.0000047146054],"category_scores_gemma":[0.000037671693,0.00004614929,0.00002730608,0.00023543676,0.00008581811,0.00015230275,0.000073672345,0.00003422874,0.0000010823563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060783765,0.00068512827,0.029652584,0.00022559303,0.00007024124,0.000019063747,0.0070375195,0.00044029648,0.11753838,0.78420705,0.00030002947,0.05976336],"study_design_scores_gemma":[0.0010339256,0.0002945485,0.5537557,0.000086578024,0.000013721078,0.000028491482,0.00011886858,0.0022038764,0.21767394,0.22430477,0.00027594433,0.00020961826],"about_ca_topic_score_codex":0.00010177594,"about_ca_topic_score_gemma":0.000009849809,"teacher_disagreement_score":0.55990225,"about_ca_system_score_codex":0.000013524192,"about_ca_system_score_gemma":0.000042897846,"threshold_uncertainty_score":0.18819134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00519566250757594,"score_gpt":0.21013662021198726,"score_spread":0.20494095770441131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401899815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42654377,0.000028377068,0.57071656,0.0021458413,0.000100394755,0.000060363505,0.000008310876,0.000044750952,0.00035166641],"genre_scores_gemma":[0.99724597,0.0000017860428,0.0021750268,0.00042338984,0.000026462814,0.0000042404317,0.0000075834214,0.0000028688485,0.00011266844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958366,0.000027858001,0.000089531415,0.000094390794,0.0001253467,0.00007921449],"domain_scores_gemma":[0.99962425,0.00003054348,0.00003919308,0.0002710591,0.000015596577,0.000019365585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010313318,0.00003927527,0.000049494745,0.000020982607,0.000040632807,0.00002889743,0.00036354913,0.000021504055,0.000011871585],"category_scores_gemma":[0.000037402504,0.00002687727,0.000028045431,0.00020121921,0.00003815643,0.00012736545,0.000088570836,0.00004476789,0.000016480193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.173527e-7,0.0000483869,0.00004269754,0.000004980072,0.000004250093,0.0000011522267,0.001556932,0.000008295728,0.474588,0.5013263,0.00004039484,0.02237765],"study_design_scores_gemma":[0.0009454874,0.000085376865,0.015050218,0.00008116632,0.000011992039,0.000015599328,0.00009956722,0.023325372,0.89894027,0.05620525,0.004949539,0.00029015972],"about_ca_topic_score_codex":0.0000142487315,"about_ca_topic_score_gemma":8.702508e-7,"teacher_disagreement_score":0.5707022,"about_ca_system_score_codex":0.000012649336,"about_ca_system_score_gemma":0.000024430205,"threshold_uncertainty_score":0.10960232},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01292252746455459,"score_gpt":0.22936251004707692,"score_spread":0.21643998258252234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402932091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96239585,0.00021208149,0.017271906,0.0004210133,0.000058311478,0.00010381095,0.0000062466534,0.00004751943,0.019483292],"genre_scores_gemma":[0.9939261,0.000011639357,0.0022958878,0.00021421566,0.00074723724,0.000008548124,0.00027098853,0.000023381748,0.002502003],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992055,0.000025058993,0.00019507992,0.00025049565,0.00013605147,0.0001877777],"domain_scores_gemma":[0.9994841,0.000003757291,0.00008578323,0.00023396355,0.000119517936,0.000072848095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081562546,0.00011591123,0.00008452136,0.00003931805,0.000105590036,0.000035977704,0.000080304635,0.000086335924,0.000026854701],"category_scores_gemma":[0.000019351959,0.000105547784,0.00005078343,0.00010491053,0.000040009265,0.000005943554,0.00002599789,0.000044128632,0.000010078835],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022150073,0.00010904906,0.004797902,0.000036823978,0.000049790688,0.00002474794,0.000026551355,0.16366383,0.8012018,0.0016164504,0.025349779,0.0029017446],"study_design_scores_gemma":[0.005175027,0.00031635552,0.015246797,0.00018086628,0.0001117472,0.00008103427,0.00021593113,0.1481016,0.69322616,0.002102046,0.13395493,0.0012875097],"about_ca_topic_score_codex":0.000085924774,"about_ca_topic_score_gemma":0.000016052909,"teacher_disagreement_score":0.10860515,"about_ca_system_score_codex":0.000011478684,"about_ca_system_score_gemma":0.000042289816,"threshold_uncertainty_score":0.43041137},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013856491255630364,"score_gpt":0.233511927603605,"score_spread":0.21965543634797463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403784750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46695408,0.000089937676,0.5284825,0.00066853914,0.00006106551,0.000043741235,0.000007806638,0.00009037922,0.0036019646],"genre_scores_gemma":[0.9808871,5.814962e-7,0.018850094,0.00013050043,0.000045015273,0.0000017110048,0.0000122986485,0.0000017852825,0.000070913324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996808,0.000021500806,0.00008482157,0.000081064754,0.000071090566,0.000060676768],"domain_scores_gemma":[0.9997779,0.000010560738,0.000012802447,0.00017222106,0.00001601448,0.000010468058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007992967,0.000033305263,0.00005323561,0.00002540348,0.000032359552,0.000022778919,0.00016631652,0.000014442795,0.000032645665],"category_scores_gemma":[0.0000020570465,0.000029955989,0.000023616542,0.000095513475,0.00003628346,0.00014499131,0.000017458427,0.000022355074,0.000018261937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012598528,0.000050923885,0.000025323547,0.000008880815,0.0000026009434,0.000004815425,0.0013004115,0.00052774936,0.03930215,0.9499993,0.0005915034,0.00818509],"study_design_scores_gemma":[0.0009799965,0.00011232087,0.02999721,0.000046332552,0.000010957915,0.00003462034,0.00040675138,0.59684217,0.25294873,0.11602286,0.0022001297,0.00039791674],"about_ca_topic_score_codex":0.00030625914,"about_ca_topic_score_gemma":0.000039465176,"teacher_disagreement_score":0.83397645,"about_ca_system_score_codex":0.00000532919,"about_ca_system_score_gemma":0.000008011032,"threshold_uncertainty_score":0.12215698},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048147448014609795,"score_gpt":0.23035284030705733,"score_spread":0.18220539229244753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404946359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33322328,0.0008007139,0.5358206,0.006135734,0.0009152193,0.00020313631,0.00001285321,0.00069654384,0.12219189],"genre_scores_gemma":[0.9850406,0.0000099543595,0.014377626,0.00019532915,0.00003894056,0.0000014690033,0.0000010455236,0.00000219114,0.0003328277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958795,0.000022375487,0.000094180345,0.000113445334,0.000098315744,0.00008372247],"domain_scores_gemma":[0.99957764,0.000023023485,0.00004282785,0.0003165419,0.00001679312,0.000023154387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009830947,0.000038381415,0.0000660129,0.000029222976,0.00002776152,0.000017619172,0.00028412903,0.000017283368,0.00024550428],"category_scores_gemma":[0.000012132906,0.000034860706,0.00002963861,0.00013445786,0.00005468255,0.0001378532,0.00006907992,0.0000330896,0.000107789776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.711932e-7,0.000055603672,0.00020051682,0.000011505633,0.0000047676226,0.000005943904,0.0006589178,0.000005220595,0.0019026921,0.91657627,0.0042262496,0.076351345],"study_design_scores_gemma":[0.0009644838,0.00023452027,0.027209869,0.00012865399,0.000010085368,0.00006980413,0.00011448835,0.36906874,0.039240967,0.49174064,0.07065261,0.0005651429],"about_ca_topic_score_codex":0.000012332003,"about_ca_topic_score_gemma":0.0000013596784,"teacher_disagreement_score":0.6518173,"about_ca_system_score_codex":0.000006716226,"about_ca_system_score_gemma":0.0000021555434,"threshold_uncertainty_score":0.26880997},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009276167141911087,"score_gpt":0.2451326274002813,"score_spread":0.2358564602583702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405146722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887078,0.00022245578,0.0053431434,0.00006768875,0.000059300964,0.000058862177,0.000008138637,0.000027950095,0.0055046813],"genre_scores_gemma":[0.9978248,0.0000083699215,0.00048805794,0.00036737442,0.00041861902,0.0000034106592,0.00063764426,0.000008899804,0.00024284216],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999405,0.000042426753,0.00011300007,0.00021723963,0.000056033667,0.0001662745],"domain_scores_gemma":[0.999719,0.0000059246895,0.000035337103,0.00016050074,0.000035652647,0.00004356065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006900275,0.00008668636,0.00006564868,0.000015054021,0.000069277114,0.000027354065,0.00012926916,0.00011881646,0.000017735218],"category_scores_gemma":[0.000021593858,0.00007157143,0.000029654835,0.0000744258,0.00002874645,0.0000024223018,0.00004483027,0.00005360656,0.0000137227735],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009544312,0.000047803405,0.00914024,0.000002596688,0.0000059307895,0.0000011316718,0.0000041214716,0.000049764516,0.9740156,0.00018537325,0.0023127156,0.014225193],"study_design_scores_gemma":[0.0010142028,0.0013589431,0.049326327,0.000012859636,0.00001636879,0.000012832973,0.00003281737,0.0015577174,0.6554351,0.00091274903,0.28959844,0.0007216617],"about_ca_topic_score_codex":0.00003791333,"about_ca_topic_score_gemma":0.000019297357,"teacher_disagreement_score":0.3185805,"about_ca_system_score_codex":0.0000058712208,"about_ca_system_score_gemma":0.000017503655,"threshold_uncertainty_score":0.2918598},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006565634247570317,"score_gpt":0.22898488601908956,"score_spread":0.22241925177151925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405494927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755481,0.0019044166,0.018862147,0.0008777539,0.00038023436,0.00014199817,0.000011244389,0.000074370066,0.0021997606],"genre_scores_gemma":[0.99554574,0.00029189355,0.003640759,0.0003062959,0.00012031737,0.000004469559,0.000002322361,0.000014449199,0.00007373176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888766,0.000041018044,0.0002573966,0.00035785022,0.00018733456,0.00026875507],"domain_scores_gemma":[0.99910706,0.00007112106,0.00012724446,0.0005478898,0.000038436392,0.000108245964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026440134,0.00017667719,0.0002748571,0.00010694092,0.0000868576,0.00010835111,0.0005464463,0.00010401258,0.000015485626],"category_scores_gemma":[0.000014118482,0.00016457753,0.000067909445,0.000300877,0.0002063112,0.000300587,0.0002971138,0.00012268194,0.0000349383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206813,0.000412706,0.0088957725,0.00063732744,0.00012322809,0.00030887467,0.006693937,0.00045930076,0.04802643,0.7264449,0.0004529739,0.20749737],"study_design_scores_gemma":[0.005651767,0.0013435163,0.3789166,0.0026449913,0.00014669151,0.00060795556,0.00050309877,0.025335819,0.3022428,0.26770452,0.012838986,0.002063301],"about_ca_topic_score_codex":0.00018823857,"about_ca_topic_score_gemma":0.0000026132439,"teacher_disagreement_score":0.45874038,"about_ca_system_score_codex":0.00002785043,"about_ca_system_score_gemma":0.000093064664,"threshold_uncertainty_score":0.67112774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023048097899154907,"score_gpt":0.228789765466021,"score_spread":0.2057416675668661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406034771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99548525,0.00019927953,0.0015200581,0.00032160844,0.000050129365,0.00008321449,0.000003097688,0.000007663032,0.002329726],"genre_scores_gemma":[0.9988614,0.00003158708,0.00025628298,0.00058557536,0.00009314514,0.0000037544032,0.000025367443,0.000004215956,0.00013872389],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995697,0.000042624684,0.0001046125,0.00012124337,0.00006297565,0.00009883783],"domain_scores_gemma":[0.9996146,0.000039400293,0.000052550888,0.00023924296,0.000036263344,0.000017929991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009100889,0.00006263906,0.000072170726,0.000008021657,0.00006835075,0.0000032952219,0.00018647358,0.000063699285,0.000017053058],"category_scores_gemma":[0.00029569175,0.000036605827,0.00005407085,0.0000415987,0.0000852282,6.3457503e-7,0.00007915411,0.00004488933,0.0000057921216],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021962002,0.00010763915,0.01064389,0.000012497217,0.00006594175,0.0000066742646,0.00006941727,0.000046644636,0.93295807,0.01054122,0.014026604,0.031301793],"study_design_scores_gemma":[0.0019624212,0.0016554043,0.05283334,0.00003718423,0.000017833947,0.000037572383,0.00010985077,0.00047703198,0.8909685,0.004304657,0.047217604,0.0003785751],"about_ca_topic_score_codex":0.000011009851,"about_ca_topic_score_gemma":0.000008515217,"teacher_disagreement_score":0.04218945,"about_ca_system_score_codex":0.000003749993,"about_ca_system_score_gemma":0.000015727595,"threshold_uncertainty_score":0.14927423},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03663116717581648,"score_gpt":0.2526408769094715,"score_spread":0.21600970973365502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406664471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475559,0.000017361976,0.35178518,0.00013706737,0.00004984092,0.000047022077,0.0000049821565,0.00003457572,0.00036809346],"genre_scores_gemma":[0.95317614,0.000004687351,0.046706747,0.00004239269,0.000004167771,0.0000016559926,0.000005640746,0.0000019013657,0.000056656485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995518,0.000029036646,0.00016346056,0.00008226846,0.00011236368,0.00006108383],"domain_scores_gemma":[0.99961144,0.000029256287,0.00004886587,0.0002446432,0.000046971974,0.0000188117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107805026,0.000039947332,0.00009829813,0.0000382716,0.000044531575,0.000006973134,0.00024090266,0.000011770388,0.000014638237],"category_scores_gemma":[0.000019168818,0.000036169455,0.00002325326,0.0001432444,0.000108832995,0.00018928661,0.00005957764,0.000024318919,0.000010062924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016315771,0.00025056285,0.00091642817,0.000053512333,0.000025438356,0.0000075754815,0.004646303,0.02256161,0.014516359,0.90669245,0.0009764952,0.049336933],"study_design_scores_gemma":[0.00029451767,0.000078005134,0.01873393,0.000013282154,0.0000014948292,0.0000071993295,0.000009162548,0.8986973,0.05843501,0.023624552,0.000043611486,0.000061909595],"about_ca_topic_score_codex":0.00006671706,"about_ca_topic_score_gemma":0.0000035445037,"teacher_disagreement_score":0.8830679,"about_ca_system_score_codex":0.00000586249,"about_ca_system_score_gemma":0.000028919714,"threshold_uncertainty_score":0.14749475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021792489354975023,"score_gpt":0.24690518062486091,"score_spread":0.2251126912698859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407962255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98061717,0.0002794882,0.013551298,0.00015696495,0.00008492625,0.00006781013,0.000026093403,0.00010473278,0.00511152],"genre_scores_gemma":[0.97515124,0.000058946294,0.024358094,0.00007467991,0.00002475733,0.0000019785432,0.0000026317184,0.000005890883,0.00032178548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991967,0.000041356245,0.00022279893,0.00015842852,0.00020683011,0.0001738854],"domain_scores_gemma":[0.99914706,0.0001961002,0.00011648415,0.00044959367,0.000047704092,0.000043040476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017451154,0.00009133048,0.00020296937,0.0000665362,0.000052817984,0.0000087386015,0.00060434244,0.000025534022,0.00004249782],"category_scores_gemma":[0.00004755664,0.00007673192,0.0000652785,0.00021666902,0.0002462546,0.00021451738,0.00017800083,0.00006772316,0.000011387587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006488782,0.00042345806,0.012151717,0.00032004892,0.00017434442,0.00014750242,0.02807578,0.00021996029,0.037347022,0.75584835,0.004105835,0.16112109],"study_design_scores_gemma":[0.0020647014,0.00068115536,0.33053204,0.00017253506,0.000020115593,0.00015737864,0.0010407045,0.02149833,0.44076908,0.19284321,0.00932257,0.0008981961],"about_ca_topic_score_codex":0.00018005789,"about_ca_topic_score_gemma":0.000011380996,"teacher_disagreement_score":0.56300515,"about_ca_system_score_codex":0.000011670302,"about_ca_system_score_gemma":0.00004934167,"threshold_uncertainty_score":0.31290367},"labels":[],"label_agreement":null}]}