{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07172173,0.0005006667,0.9077579,0.0014542841,0.0001490226,0.00022605415,0.0017167673,0.0019503594,0.014523154],"genre_scores_gemma":[0.6935817,0.00048638266,0.28903514,0.0006922963,0.00027083253,0.0006537676,0.0037904726,0.0006915252,0.010797855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941825,0.0013688044,0.00078873656,0.0013755738,0.0014629848,0.0008214612],"domain_scores_gemma":[0.9789346,0.012990189,0.0015411812,0.0036299592,0.0024059343,0.0004980403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042563668,0.00081473024,0.00097544293,0.0016909601,0.0013427889,0.0053989566,0.0021406584,0.0014633554,0.0105262995],"category_scores_gemma":[0.025040226,0.00056842936,0.001788621,0.002079272,0.0027546147,0.01054417,0.0033858567,0.0031116356,0.0020795213],"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":[0.00035391867,0.00011668138,0.0010035754,0.00025678097,0.00004766901,0.00024179665,0.0006163904,0.084564395,0.0019591898,0.8371114,0.004620107,0.069108106],"study_design_scores_gemma":[0.000026429047,0.000047194466,0.00011223581,0.000033729975,0.000017281129,0.00012288569,0.00009635011,0.2308758,0.0015545143,0.7636568,0.003433307,0.000023442386],"about_ca_topic_score_codex":0.0018964903,"about_ca_topic_score_gemma":0.0016973458,"teacher_disagreement_score":0.0105262995,"about_ca_system_score_codex":0.0021231328,"about_ca_system_score_gemma":0.0025572097,"threshold_uncertainty_score":0.035214007},"labels":[],"label_agreement":null}]}