{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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"},"query_hash":"30c536a68c34","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006026744003686442,"gpt":0.2283543582314768,"spread":0.2223276142277903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002358554,0.00007064471,0.00008361094,0.00005561578,0.00003124055,0.00001165766,0.0005010807,0.00002678936,0.0003602679],"category_scores_gemma":[0.000006193382,0.00006566061,0.00001626555,0.0002894599,0.00002080072,0.0001562184,0.00006406577,0.00006707394,0.0001135705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002391048,"about_ca_system_score_gemma":0.00007368659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005594644,"about_ca_topic_score_gemma":0.00001230734,"domain_scores_codex":[0.9993265,0.00004074017,0.0001849453,0.0001788454,0.0001240421,0.00014494],"domain_scores_gemma":[0.9996088,0.00004116597,0.00003831009,0.0002618067,0.00001178065,0.00003815471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001851894,0.00005364912,0.0008823575,0.000009787716,0.000006164919,0.000006005291,0.006426719,0.0001021615,0.0003254375,0.03254943,0.0001876698,0.9594488],"study_design_scores_gemma":[0.004145592,0.0001347107,0.6172416,0.001090799,0.00001065196,0.0001063013,0.001252157,0.009231119,0.01971379,0.2990155,0.04616449,0.001893299],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1552433,0.0005441674,0.814861,0.0002198318,0.00007740153,0.0002894603,0.000004572711,0.000108117,0.02865219],"genre_scores_gemma":[0.8425717,0.00002845148,0.1504564,0.0002474618,0.00002755786,0.00003172581,0.000006243576,0.000007215809,0.006623176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9575555,"threshold_uncertainty_score":0.3944681,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005016240646057672,"gpt":0.2126898059308322,"spread":0.2076735652847745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001226639,0.0003209195,0.0003290177,0.0003534393,0.0001178257,0.0001584533,0.001535275,0.0001216129,0.00007135789],"category_scores_gemma":[0.0001490611,0.0002545539,0.00004310444,0.0006852111,0.0001146776,0.0006352589,0.0005197156,0.0002473344,0.0001524382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008162884,"about_ca_system_score_gemma":0.00007379465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001370143,"about_ca_topic_score_gemma":0.00002166778,"domain_scores_codex":[0.9976155,0.0003927641,0.0003978722,0.0006236967,0.0004025822,0.0005675709],"domain_scores_gemma":[0.9982527,0.000364906,0.0001504238,0.001057189,0.00003962152,0.0001351598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001505414,0.0004554943,0.003954654,0.00009377848,0.0001455361,0.0007919896,0.03709445,0.00009563902,0.01399261,0.2200253,0.0006042301,0.7225958],"study_design_scores_gemma":[0.02861865,0.001851351,0.5004129,0.003453327,0.0001375244,0.001530867,0.008141404,0.1491805,0.05788885,0.1400829,0.09781253,0.01088917],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7873281,0.0001319005,0.1898518,0.0006005805,0.0005426129,0.0004900891,0.000008135818,0.001240947,0.01980588],"genre_scores_gemma":[0.9264811,0.000008678663,0.0675732,0.005294413,0.00005009927,0.00005217294,0.00004231243,0.00003812049,0.0004598902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7117066,"threshold_uncertainty_score":0.9999906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}