{"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":"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.072194815,0.0068126083,0.7292293,0.02683076,0.002037722,0.000069473324,0.00022302112,0.0006017707,0.16200061],"genre_scores_gemma":[0.7254106,0.00581879,0.18319425,0.0044295145,0.0039273645,0.0003279354,0.00057925703,0.00065106066,0.075661175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986708,0.00035084182,0.00007814486,0.00032297982,0.0004486787,0.00012860465],"domain_scores_gemma":[0.9956092,0.0024974768,0.00028573835,0.000880597,0.0005067696,0.00022010999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015849242,0.000567733,0.0009985756,0.001517367,0.0023393678,0.0036938968,0.0023102236,0.0027597672,0.011015726],"category_scores_gemma":[0.011225608,0.000536906,0.0011386729,0.001859292,0.006049488,0.012052298,0.00407222,0.0054347883,0.0013547719],"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.000019104762,0.0000129942055,0.00016755618,0.0000431361,0.000010166872,0.000042430456,0.00022429941,0.0009978251,0.00033986996,0.9751281,0.004279805,0.018734692],"study_design_scores_gemma":[0.0000069459006,0.0000039029396,0.000052825126,0.000007022055,0.0000040460286,0.00006854286,0.000057495385,0.0033329038,0.00012276565,0.98991233,0.0064267456,0.000004522711],"about_ca_topic_score_codex":0.00041984656,"about_ca_topic_score_gemma":0.00045929034,"teacher_disagreement_score":0.011015726,"about_ca_system_score_codex":0.0008735317,"about_ca_system_score_gemma":0.00064257893,"threshold_uncertainty_score":0.036851227},"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":"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.08338616,0.0066663935,0.8758779,0.0073822034,0.0030524626,0.00020881789,0.0007217183,0.002556082,0.0201482],"genre_scores_gemma":[0.68583167,0.0051188264,0.27499968,0.001220966,0.002020309,0.00034761705,0.0015572445,0.00050759915,0.028396111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00023173254,0.000089617846,0.0004939414,0.00021659504,0.00012727018],"domain_scores_gemma":[0.9961371,0.0028918674,0.000107332475,0.00034091264,0.00032716626,0.00019565786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153196,0.0005780559,0.00078204804,0.00038573123,0.00082115654,0.0019787268,0.0011524821,0.00086695317,0.0054529924],"category_scores_gemma":[0.0051228786,0.0006064227,0.0010721285,0.00081860146,0.0013028434,0.0030795918,0.0012930207,0.0019753953,0.0012273344],"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.0012575712,0.00038573772,0.0028526688,0.0025111171,0.00021191794,0.001781802,0.001312255,0.099415705,0.035275456,0.46030593,0.056400236,0.33828962],"study_design_scores_gemma":[0.00019555079,0.0003604882,0.0011648603,0.00015507567,0.0001610044,0.00087958295,0.00019539645,0.23392893,0.030085681,0.64084995,0.091919184,0.00010426829],"about_ca_topic_score_codex":0.0011211984,"about_ca_topic_score_gemma":0.0010500066,"teacher_disagreement_score":0.0054529924,"about_ca_system_score_codex":0.0010480888,"about_ca_system_score_gemma":0.0010304658,"threshold_uncertainty_score":0.018242061},"labels":[],"label_agreement":null}]}