{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Elena Czeizler","is_ca":true},{"name":"Eugen Czeizler","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016939,0.0002920503,0.0005333315,0.000925944,0.0007715079,0.002340648,0.0008450091,0.001071976,0.001776014],"category_scores_gemma":[0.008460014,0.0003176105,0.0004834597,0.0008467283,0.003202326,0.004115459,0.001145767,0.001737245,0.0001891486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001832563,"about_ca_system_score_gemma":0.0008422767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638766,"about_ca_topic_score_gemma":0.0009131074,"domain_scores_codex":[0.9987745,0.000236199,0.00008514208,0.0003164819,0.0004241614,0.0001635794],"domain_scores_gemma":[0.9928344,0.005472582,0.0005653652,0.0004601314,0.000469858,0.000197638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004129027,0.00001241562,0.0005565467,0.00006203572,0.000008090979,0.0000611191,0.0002103224,0.02267012,0.002380248,0.9665815,0.0002255076,0.007190844],"study_design_scores_gemma":[0.000006833603,0.00001475284,0.0003090053,0.00001427737,0.000005451404,0.00006121955,0.00004329746,0.08249808,0.001942808,0.9134406,0.001645303,0.00001828781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3856324,0.00481838,0.559808,0.002887431,0.0001150357,0.0001044135,0.0005660196,0.000292595,0.04577575],"genre_scores_gemma":[0.9558871,0.001291547,0.03847955,0.0001018488,0.0001016686,0.0001490922,0.0001924958,0.00003695743,0.003759811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002340648,"threshold_uncertainty_score":0.01329619,"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","authors":[{"name":"Alexander Okhotin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009746389,0.0004032193,0.0004629945,0.001500728,0.0008365414,0.002500985,0.0008679599,0.0007810363,0.003440358],"category_scores_gemma":[0.004703068,0.0003818097,0.000860023,0.001306614,0.002612866,0.004756816,0.001819965,0.002488592,0.000531494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00142982,"about_ca_system_score_gemma":0.0008002871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218977,"about_ca_topic_score_gemma":0.001097164,"domain_scores_codex":[0.9989966,0.00021979,0.00007459722,0.0002244347,0.0003258394,0.0001588784],"domain_scores_gemma":[0.9977298,0.001315039,0.0002350267,0.0002218044,0.0003383765,0.0001599587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001839818,0.00001394384,0.0003272889,0.00004901556,0.000006860763,0.00007440505,0.0003897849,0.001517513,0.002445764,0.9872103,0.001017697,0.006929122],"study_design_scores_gemma":[0.0000155586,0.00002454186,0.0004451929,0.00004212078,0.0000140471,0.0002569799,0.0001218651,0.02830181,0.001386006,0.9593229,0.01004942,0.00001960727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213973,0.002806581,0.705888,0.002738577,0.0002351434,0.0001826865,0.001522449,0.0006128408,0.07204071],"genre_scores_gemma":[0.8182074,0.001037282,0.1686742,0.0006030189,0.000371317,0.0002041245,0.00123736,0.0001106887,0.009554544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003440358,"threshold_uncertainty_score":0.01150912,"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","authors":[{"name":"Zoltán Ésik","is_ca":false},{"name":"Yuan Gao","is_ca":true},{"name":"Guangwu Liu","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085514,0.0006335546,0.0006917169,0.001760609,0.0006780002,0.001795217,0.001384348,0.0008575215,0.005278111],"category_scores_gemma":[0.01703134,0.0004467547,0.00108774,0.001134926,0.001323945,0.006232115,0.00179765,0.001804568,0.0007013619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001494269,"about_ca_system_score_gemma":0.0009403806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012794,"about_ca_topic_score_gemma":0.001384121,"domain_scores_codex":[0.9979247,0.0003296857,0.0001432864,0.0005149461,0.0008264351,0.0002609825],"domain_scores_gemma":[0.9782369,0.01618629,0.001230164,0.002668352,0.001264176,0.0004141589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009381616,0.0003245308,0.025104,0.001097951,0.000307432,0.0005246944,0.0008264121,0.438352,0.05504692,0.3160513,0.003333642,0.1580929],"study_design_scores_gemma":[0.00001092486,0.0001229635,0.004026638,0.00004061804,0.00005272713,0.0003025784,0.000102075,0.8121631,0.02335577,0.1576426,0.002122215,0.00005772074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2864598,0.0009931109,0.6981195,0.0003314732,0.00005655473,0.0001701183,0.0008696547,0.0005154163,0.01248431],"genre_scores_gemma":[0.9142921,0.0003897173,0.08175637,0.0000337629,0.00004185211,0.0002085278,0.001052022,0.0001212271,0.00210441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005278111,"threshold_uncertainty_score":0.01765704,"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","authors":[{"name":"Michael Domaratzki","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00388999,0.0006223998,0.001002675,0.001520376,0.001212282,0.004500304,0.001778377,0.001316128,0.009074363],"category_scores_gemma":[0.04381387,0.0005738378,0.002300585,0.001479362,0.00321059,0.01318185,0.002529372,0.00293046,0.0006909664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00267535,"about_ca_system_score_gemma":0.001664652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001144787,"about_ca_topic_score_gemma":0.001047119,"domain_scores_codex":[0.9919234,0.002015822,0.0008494525,0.001737773,0.002668832,0.0008047165],"domain_scores_gemma":[0.9048542,0.0770862,0.005290869,0.007379022,0.00330838,0.002081249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006353945,0.0002410049,0.008566965,0.000575543,0.0001828509,0.0002982905,0.001015944,0.0914923,0.01189296,0.8281242,0.001895947,0.05507852],"study_design_scores_gemma":[0.00004899038,0.0002078761,0.002727673,0.00004187621,0.0000871505,0.0005092748,0.0002887074,0.1925829,0.0103486,0.788762,0.004317657,0.00007733369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4479338,0.001342922,0.5181642,0.002198726,0.000209159,0.0003571822,0.002187833,0.0008750176,0.02673121],"genre_scores_gemma":[0.9330035,0.0005073858,0.06043847,0.0001809387,0.0001391948,0.000323827,0.001147128,0.0002127794,0.00404695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009074363,"threshold_uncertainty_score":0.03035676,"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","authors":[{"name":"Xiaoxue Piao","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003250771,0.001537908,0.001641138,0.001985809,0.001847477,0.005802639,0.00412884,0.001729508,0.01388825],"category_scores_gemma":[0.02716089,0.001053546,0.002870446,0.001894641,0.003752393,0.01810086,0.004365987,0.007750353,0.001885307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004447362,"about_ca_system_score_gemma":0.002611753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00282334,"about_ca_topic_score_gemma":0.002885431,"domain_scores_codex":[0.9932575,0.0009935761,0.0005512597,0.001450667,0.002559481,0.001187442],"domain_scores_gemma":[0.9582348,0.03216284,0.00164519,0.004554735,0.002223512,0.001178968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003866084,0.0002983109,0.002660235,0.0004682892,0.00009881904,0.0002161247,0.0009153071,0.07368003,0.01488351,0.8610468,0.00447249,0.04087351],"study_design_scores_gemma":[0.00002241112,0.00006514577,0.000442092,0.00003529108,0.00005588583,0.0001174435,0.0000830662,0.223953,0.006725053,0.765282,0.003183454,0.00003520126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1479186,0.001534218,0.8118414,0.002493127,0.0002708949,0.0002689204,0.001969988,0.00152322,0.03217952],"genre_scores_gemma":[0.8495799,0.001129427,0.1357702,0.0005268311,0.0003536997,0.0006939357,0.002577473,0.0006734032,0.008695088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01388825,"threshold_uncertainty_score":0.04646081,"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","authors":[{"name":"Franziska Biegler","is_ca":true},{"name":"Ian McQuillan","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138758,0.0003207667,0.0004469403,0.001531381,0.001472792,0.002135804,0.0007842178,0.0006853852,0.003994733],"category_scores_gemma":[0.007412326,0.000553736,0.0007071287,0.0009288516,0.002684442,0.003884587,0.001864196,0.001747832,0.0008180041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081847,"about_ca_system_score_gemma":0.001278694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095824,"about_ca_topic_score_gemma":0.002013222,"domain_scores_codex":[0.9983469,0.0002277493,0.0001289697,0.0003565522,0.0006630965,0.0002766497],"domain_scores_gemma":[0.9922998,0.003807043,0.0007403179,0.0007982055,0.001501801,0.0008528059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004790406,0.00002038854,0.001056841,0.00007322527,0.00001052946,0.0002317045,0.0005466338,0.00188959,0.0107624,0.9700228,0.001036864,0.01430114],"study_design_scores_gemma":[0.00003031164,0.0000469642,0.001219093,0.00004039331,0.00002325364,0.0006038503,0.0001535174,0.02908417,0.008571488,0.9462121,0.01397127,0.00004367929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3369568,0.0008427132,0.5986488,0.001043457,0.0001223424,0.0001076911,0.00119084,0.001856826,0.0592305],"genre_scores_gemma":[0.8895893,0.0003439562,0.09374828,0.000373828,0.0001049107,0.0001512085,0.0006203546,0.0003123643,0.01475579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003994733,"threshold_uncertainty_score":0.01510489,"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","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112885,0.0003853901,0.0004858919,0.001230422,0.00127872,0.00296203,0.0008533412,0.0006865342,0.003898836],"category_scores_gemma":[0.01044355,0.0005626909,0.0009576405,0.001088895,0.001827975,0.00508347,0.001349378,0.001486828,0.0003146278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003166659,"about_ca_system_score_gemma":0.001055265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002566162,"about_ca_topic_score_gemma":0.002916132,"domain_scores_codex":[0.9985335,0.0002505254,0.0001178588,0.0002869277,0.0005032045,0.0003080129],"domain_scores_gemma":[0.9859813,0.01008067,0.001548803,0.0009031849,0.0008007584,0.0006852288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002206441,0.00010836,0.007762665,0.0002470974,0.0000516766,0.0003033078,0.00217035,0.04121142,0.01478155,0.9128953,0.001639056,0.01860863],"study_design_scores_gemma":[0.00003803773,0.0001086476,0.006082507,0.00004457732,0.00005192284,0.0005503869,0.000399355,0.1951848,0.008431294,0.7814103,0.007624126,0.00007408961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7997781,0.001161766,0.169456,0.001136741,0.0000335789,0.000116917,0.001048815,0.0005583747,0.02670966],"genre_scores_gemma":[0.9715298,0.0002506053,0.02486498,0.00007265049,0.0000445911,0.000116856,0.0004366061,0.00006799532,0.002615884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003898836,"threshold_uncertainty_score":0.02297586,"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","authors":[{"name":"Franziska Biegler","is_ca":true},{"name":"Michael J. Burrell","is_ca":true},{"name":"Mark Daley","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075702,0.0005558713,0.0005246714,0.0004428869,0.0004437218,0.0009722455,0.001429732,0.001691284,0.002699927],"category_scores_gemma":[0.001251929,0.0003759237,0.001004213,0.0004289412,0.00131541,0.0008379607,0.0007523212,0.0008280483,0.0004733101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004669,"about_ca_system_score_gemma":0.0005410033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004063876,"about_ca_topic_score_gemma":0.002937033,"domain_scores_codex":[0.9997529,0.00008724257,0.00001282281,0.00004643916,0.00006920001,0.00003124007],"domain_scores_gemma":[0.9994168,0.0003620022,0.00008750868,0.00005106975,0.0000330091,0.00004956406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004177877,0.00003287862,0.0003033012,0.00005115026,0.00001795526,0.0002075466,0.000106987,0.8708243,0.008314588,0.1164181,0.0003271641,0.003354211],"study_design_scores_gemma":[0.00001076554,0.00001504304,0.00004427602,0.00000245661,0.000004115112,0.00003523494,0.00000776956,0.9825915,0.0006903412,0.01550698,0.001086426,0.000005209361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1671027,0.0007167431,0.7986662,0.0005936475,0.0001195056,0.0001417241,0.0004219449,0.0008815915,0.03135599],"genre_scores_gemma":[0.8423508,0.0005391185,0.1436086,0.00009928668,0.00003953934,0.0002607236,0.0003016327,0.0002088782,0.01259137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004063876,"threshold_uncertainty_score":0.00903219,"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","authors":[{"name":"Charlotte L. Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704444,0.0008572045,0.0004837271,0.001925881,0.001181972,0.003063068,0.00132172,0.001190577,0.007943152],"category_scores_gemma":[0.007099997,0.0006549887,0.001113296,0.001729354,0.003764802,0.006020477,0.002479149,0.003301713,0.003544499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001333629,"about_ca_system_score_gemma":0.001249376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338345,"about_ca_topic_score_gemma":0.001482763,"domain_scores_codex":[0.9970375,0.0007063227,0.0002670496,0.0006268503,0.001219771,0.0001424793],"domain_scores_gemma":[0.9971349,0.001463876,0.0001573569,0.0006233358,0.0005167,0.0001037117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000184797,0.00001759941,0.0001374669,0.00008386944,0.000009630247,0.0001372251,0.000301615,0.002159027,0.001298973,0.9212418,0.002209896,0.07238446],"study_design_scores_gemma":[0.00001222733,0.00001261444,0.00007375302,0.0000435595,0.00000998232,0.0002918686,0.00005832075,0.008086578,0.002715515,0.9518455,0.03683452,0.00001553931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008100898,0.001149868,0.9522653,0.0005793729,0.0001897283,0.0001633808,0.0003082416,0.001733883,0.03550934],"genre_scores_gemma":[0.1809567,0.001791768,0.7905689,0.0005913172,0.0003133823,0.000533822,0.001586238,0.0007676315,0.02289033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007943152,"threshold_uncertainty_score":0.02657247,"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","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Ian McQuillan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380421,0.0002465131,0.0002846859,0.0003071123,0.0003097538,0.0007354512,0.0005560655,0.0006465868,0.003606274],"category_scores_gemma":[0.0009184631,0.0001195661,0.000346776,0.0003755281,0.0005820104,0.0006539991,0.0005673,0.0006646427,0.001669917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004523458,"about_ca_system_score_gemma":0.0002534822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005031356,"about_ca_topic_score_gemma":0.0004167155,"domain_scores_codex":[0.9998063,0.00002717956,0.000008146864,0.00005219776,0.00007908657,0.00002703139],"domain_scores_gemma":[0.9997527,0.00008104014,0.00004434446,0.00006205497,0.0000247112,0.00003523872],"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.0001573334,0.0001103534,0.001120924,0.0006660275,0.00003690615,0.000396435,0.0002638299,0.01184197,0.2040121,0.5695959,0.009303886,0.2024945],"study_design_scores_gemma":[0.00008521945,0.0003552595,0.00136949,0.00008792503,0.00004530588,0.004644207,0.0001833959,0.164015,0.3198035,0.1997219,0.3096143,0.00007439582],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1307569,0.01508947,0.7509825,0.001200817,0.0007393553,0.0003908283,0.0007429225,0.003124503,0.09697269],"genre_scores_gemma":[0.7940464,0.006304475,0.1504107,0.0004738747,0.00007870874,0.0001996223,0.001504029,0.0002211356,0.04676102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003606274,"threshold_uncertainty_score":0.01206416,"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","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"Sheng Yü","is_ca":true},{"name":"Kaizhong Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009736133,0.0007602775,0.000828248,0.003215726,0.001224815,0.003491642,0.001280473,0.001024621,0.007971077],"category_scores_gemma":[0.009430016,0.0005126499,0.001628452,0.002504958,0.003016303,0.008953893,0.00266646,0.002145706,0.001703303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00187492,"about_ca_system_score_gemma":0.0007817918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016813,"about_ca_topic_score_gemma":0.0008097513,"domain_scores_codex":[0.9970271,0.0004171083,0.0003352133,0.0008325353,0.001099077,0.0002890661],"domain_scores_gemma":[0.9921172,0.004663631,0.0008030253,0.001319033,0.000796552,0.0003005363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001200165,0.00004036679,0.001257082,0.0003023366,0.0000350806,0.0002617326,0.0007468195,0.01352639,0.006516626,0.9223896,0.003129411,0.05167459],"study_design_scores_gemma":[0.0000134779,0.00006651566,0.0004950982,0.00004308724,0.00002459766,0.0005711109,0.00009651602,0.04071249,0.004260723,0.9377522,0.01591971,0.00004441598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1560273,0.004997267,0.7842126,0.002093303,0.0005225553,0.0002946823,0.001928618,0.001266042,0.0486576],"genre_scores_gemma":[0.7221694,0.002392719,0.2456894,0.0007287498,0.0009695027,0.0006893219,0.002144842,0.0005783426,0.02463766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007971077,"threshold_uncertainty_score":0.02666593,"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","authors":[{"name":"Michael Domaratzki","is_ca":true},{"name":"Keith Ellul","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Ming‐Wei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006565634247570317,"gpt":0.2289848860190896,"spread":0.2224192517715192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691208,0.0002451221,0.0006579452,0.0008251455,0.001340235,0.001544164,0.000999396,0.0008062357,0.002713673],"category_scores_gemma":[0.01171411,0.0004109415,0.0007849744,0.0004188364,0.002647266,0.004075693,0.001359323,0.001137692,0.0005122806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008777485,"about_ca_system_score_gemma":0.0004360645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004560254,"about_ca_topic_score_gemma":0.0003800877,"domain_scores_codex":[0.9978828,0.00052309,0.0002091102,0.0007299304,0.0004707132,0.0001843748],"domain_scores_gemma":[0.9895191,0.007056413,0.001361299,0.0009447375,0.0007624743,0.0003559706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001737952,0.00002224175,0.003912006,0.0002615821,0.00003928803,0.0003976616,0.001481884,0.008849423,0.02982032,0.9359272,0.0004676412,0.01864699],"study_design_scores_gemma":[0.00003329939,0.0001984746,0.003000393,0.00006989462,0.00008477639,0.002586017,0.0008035911,0.08016302,0.04030887,0.8594973,0.01316484,0.00008954368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5903465,0.001951087,0.3840559,0.0005193589,0.00006514652,0.00007906414,0.0001999019,0.0003878804,0.02239523],"genre_scores_gemma":[0.9566798,0.0002383903,0.03957583,0.00006193091,0.00003931248,0.00008478679,0.00008288876,0.00009551279,0.00314165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002713673,"threshold_uncertainty_score":0.009078145,"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)","authors":[{"name":"Ian McQuillan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064631,0.000451673,0.0006226535,0.001403329,0.0009678644,0.002675525,0.00120707,0.0009665978,0.003230204],"category_scores_gemma":[0.01179386,0.000492275,0.001429717,0.001553528,0.002423421,0.007248356,0.002090983,0.001685393,0.0003327495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00279465,"about_ca_system_score_gemma":0.001415917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003190458,"about_ca_topic_score_gemma":0.002033447,"domain_scores_codex":[0.997268,0.00072218,0.0002521587,0.0004488445,0.0009503221,0.0003584887],"domain_scores_gemma":[0.9880795,0.009015081,0.0007713225,0.0009617077,0.0008039439,0.0003685785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001406775,0.0000620099,0.004235602,0.0002331819,0.00007146579,0.0003667286,0.001097994,0.07379334,0.006005689,0.8886526,0.001551264,0.02378951],"study_design_scores_gemma":[0.00001773364,0.00002510588,0.0006931752,0.00001739477,0.00002726109,0.0001992042,0.0001569098,0.1444151,0.003488298,0.8482965,0.002629932,0.00003334682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5087847,0.0008198612,0.4729989,0.001914495,0.00003591715,0.0001554961,0.001859868,0.0003932393,0.01303754],"genre_scores_gemma":[0.9286476,0.0005258507,0.06483537,0.0001924325,0.00005044314,0.0002527871,0.001918687,0.0001490641,0.003427817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003230204,"threshold_uncertainty_score":0.02027673,"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","authors":[{"name":"Michael Domaratzki","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727129,0.0005623078,0.0006924489,0.001242281,0.001751762,0.00351455,0.001911807,0.001392903,0.004112657],"category_scores_gemma":[0.01103284,0.0008485779,0.002618693,0.0009130164,0.004195529,0.01084865,0.003174169,0.004504008,0.0004629155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002363117,"about_ca_system_score_gemma":0.001620643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002667014,"about_ca_topic_score_gemma":0.002240713,"domain_scores_codex":[0.9971494,0.0004820912,0.0002863499,0.0009785515,0.0006303817,0.0004733045],"domain_scores_gemma":[0.9857706,0.009794872,0.001024595,0.001973825,0.0007023325,0.0007337359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002351563,0.0001645099,0.002945477,0.0001933196,0.00007556524,0.0005108753,0.00133016,0.02576139,0.007590591,0.9378499,0.001403547,0.0219395],"study_design_scores_gemma":[0.00003828153,0.00004270907,0.0004143666,0.00004293433,0.00003106923,0.0002320302,0.0003246384,0.05761512,0.009470557,0.9283595,0.003400602,0.00002821664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3455375,0.0008094439,0.6336351,0.001700699,0.000093645,0.00022602,0.001240399,0.001305452,0.01545181],"genre_scores_gemma":[0.9126367,0.000458879,0.0753289,0.0002880289,0.00008590712,0.0003167626,0.002234672,0.000207653,0.008442348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004112657,"threshold_uncertainty_score":0.01714569,"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)","authors":[{"name":"Franziska Biegler","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038183,0.001102397,0.001115056,0.003224035,0.001249188,0.003351097,0.002173546,0.001724468,0.004812949],"category_scores_gemma":[0.03285407,0.0009402059,0.001406066,0.002587373,0.004556968,0.01373655,0.004796148,0.003998772,0.0005703198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003255205,"about_ca_system_score_gemma":0.001405863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092249,"about_ca_topic_score_gemma":0.001099722,"domain_scores_codex":[0.9961551,0.0008802252,0.0002276979,0.0008405374,0.001308548,0.0005879542],"domain_scores_gemma":[0.9268563,0.06114376,0.003852803,0.003709867,0.002073176,0.002364086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002115294,0.00007807826,0.002849174,0.0002460576,0.00006807016,0.0002116297,0.0008829334,0.05864404,0.008019265,0.8969887,0.001012594,0.03078798],"study_design_scores_gemma":[0.00001935946,0.00008602025,0.00104933,0.0000474179,0.00003867096,0.000229502,0.00009920766,0.1522776,0.004370736,0.8393646,0.00237106,0.00004638374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2268468,0.002959662,0.7458402,0.001275095,0.00009232434,0.000181163,0.0005432385,0.0005413998,0.02172009],"genre_scores_gemma":[0.8787686,0.001552674,0.1138259,0.0002690619,0.0002542895,0.0002380308,0.000396396,0.0003694408,0.004325747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004812949,"threshold_uncertainty_score":0.02361828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}