{"meta":{"query_hash":"30c536a68c34","filters":{"venue":"Developments in Language Theory"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/30c536a68c34","api":"https://metacan.xera.ac/api/v1/cohort?venue=Developments+in+Language+Theory"},"results":[{"id":"W161833311","doi":"10.1142/9789812792464_0016","title":"NEW PROBLEMS OF PATTERN AVOIDANCE","year":2000,"lang":"en","type":"article","venue":"Developments in Language Theory","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.006026744003686442,"score_gpt":0.22835435823147676,"score_spread":0.22232761422779032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161833311","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.15524326,0.00054416736,0.814861,0.00021983177,0.00007740153,0.0002894603,0.000004572711,0.00010811703,0.028652193],"genre_scores_gemma":[0.84257174,0.000028451483,0.15045641,0.0002474618,0.000027557862,0.000031725805,0.000006243576,0.0000072158086,0.0066231764],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99932647,0.000040740175,0.0001849453,0.0001788454,0.00012404213,0.00014493997],"domain_scores_gemma":[0.99960876,0.00004116597,0.00003831009,0.00026180674,0.000011780648,0.000038154707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023585543,0.00007064471,0.00008361094,0.000055615783,0.000031240546,0.000011657659,0.0005010807,0.000026789363,0.00036026794],"category_scores_gemma":[0.0000061933815,0.00006566061,0.000016265554,0.00028945995,0.000020800724,0.0001562184,0.00006406577,0.00006707394,0.00011357048],"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.0000018518938,0.000053649117,0.00088235753,0.000009787716,0.0000061649193,0.000006005291,0.006426719,0.00010216152,0.0003254375,0.032549433,0.00018766982,0.95944875],"study_design_scores_gemma":[0.0041455925,0.00013471067,0.61724156,0.0010907988,0.000010651965,0.000106301304,0.0012521574,0.009231119,0.019713791,0.29901552,0.04616449,0.0018932994],"about_ca_topic_score_codex":0.00005594644,"about_ca_topic_score_gemma":0.000012307337,"teacher_disagreement_score":0.9575555,"about_ca_system_score_codex":0.000023910483,"about_ca_system_score_gemma":0.00007368659,"threshold_uncertainty_score":0.39446813},"labels":[],"label_agreement":null},{"id":"W2408319280","doi":"","title":"Input-Driven Pushdown Automata with Limited Nondeterminism (Invited Paper)","year":2014,"lang":"en","type":"article","venue":"Developments in Language Theory","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","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Automaton; Path (computing); Computer science; Algorithm; Computation; Mathematics; Combinatorics; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Rule-based machine translation; Artificial intelligence; Programming language","score_opus":0.005016240646057672,"score_gpt":0.2126898059308322,"score_spread":0.20767356528477451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408319280","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.78732806,0.0001319005,0.18985178,0.00060058053,0.00054261286,0.0004900891,0.0000081358185,0.001240947,0.019805884],"genre_scores_gemma":[0.9264811,0.000008678663,0.067573205,0.0052944133,0.00005009927,0.00005217294,0.00004231243,0.00003812049,0.00045989023],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976155,0.0003927641,0.0003978722,0.0006236967,0.0004025822,0.0005675709],"domain_scores_gemma":[0.9982527,0.000364906,0.00015042376,0.0010571892,0.000039621522,0.00013515979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012266393,0.00032091953,0.0003290177,0.0003534393,0.00011782566,0.00015845326,0.0015352755,0.00012161285,0.00007135789],"category_scores_gemma":[0.00014906113,0.00025455392,0.00004310444,0.0006852111,0.00011467759,0.0006352589,0.0005197156,0.00024733442,0.0001524382],"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.00015054141,0.0004554943,0.003954654,0.00009377848,0.00014553613,0.0007919896,0.03709445,0.00009563902,0.013992606,0.22002535,0.0006042301,0.72259575],"study_design_scores_gemma":[0.028618649,0.0018513509,0.50041294,0.0034533269,0.00013752445,0.0015308671,0.008141404,0.14918047,0.057888847,0.14008291,0.09781253,0.010889166],"about_ca_topic_score_codex":0.0000137014285,"about_ca_topic_score_gemma":0.000021667776,"teacher_disagreement_score":0.7117066,"about_ca_system_score_codex":0.00008162884,"about_ca_system_score_gemma":0.000073794654,"threshold_uncertainty_score":0.99999064},"labels":[],"label_agreement":null}]}