{"meta":{"query_hash":"49e819bf2a45","filters":{"venue":"Automata and Formal Languages"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/49e819bf2a45","api":"https://metacan.xera.ac/api/v1/cohort?venue=Automata+and+Formal+Languages"},"results":[{"id":"W32599491","doi":"10.1016/j.media.2020.101758","title":"Operational State Complexity of Prefix-Free Regular Languages.","year":2009,"lang":"en","type":"article","venue":"Automata and Formal Languages","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Prefix; Computer science; Regular language; Programming language; State (computer science); Theoretical computer science; Arithmetic; Automaton; Mathematics; Linguistics","score_opus":0.012214209482492586,"score_gpt":0.25001553398118254,"score_spread":0.23780132449868996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32599491","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.9297104,0.002809972,0.04603039,0.0024644707,0.000113649985,0.00029491488,0.00016797702,0.0007379465,0.01767027],"genre_scores_gemma":[0.97398734,0.000037637226,0.024967203,0.0006232478,0.00003792625,0.000002983662,0.000032041884,0.0000055755495,0.00030605306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990082,0.00003876122,0.00022948993,0.00022699458,0.00023565107,0.00026093],"domain_scores_gemma":[0.99915177,0.000037576498,0.000086228014,0.00061144086,0.000038408692,0.00007455238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028859364,0.0001354126,0.00019467247,0.000074286814,0.00010885095,0.0001004998,0.00068579486,0.000044093926,0.000039434883],"category_scores_gemma":[0.000032175612,0.00010940938,0.000046147732,0.00013261233,0.00011359499,0.00093245704,0.00028280978,0.00007854982,0.000007563517],"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.000016635204,0.00010888101,0.00024526543,0.000042145835,0.000025607227,0.00004525787,0.0020452212,0.000014273783,0.005314669,0.81206244,0.0016853539,0.17839427],"study_design_scores_gemma":[0.0056473333,0.0016662006,0.5126088,0.00029177548,0.000060341412,0.0007126624,0.001953262,0.14380547,0.08212306,0.24230652,0.0070887133,0.0017358554],"about_ca_topic_score_codex":0.000056003933,"about_ca_topic_score_gemma":0.000008804394,"teacher_disagreement_score":0.5697559,"about_ca_system_score_codex":0.000008829437,"about_ca_system_score_gemma":0.00002545811,"threshold_uncertainty_score":0.44615853},"labels":[],"label_agreement":null}]}