{"meta":{"query_hash":"a3871ff0ba0a","filters":{"venue":"International Conference on Implementation and application of automata"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/a3871ff0ba0a","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Implementation+and+application+of+automata"},"results":[{"id":"W1971074104","doi":"10.5555/1756384.1756392","title":"The number of similarity relations and the number of minimal deterministic finite cover automata","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Mathematics; Combinatorics; Unary operation; Quantum finite automata; Nondeterministic finite automaton; Upper and lower bounds; Discrete mathematics; Cover (algebra); Equivalence relation; Finite-state machine; DFA minimization; Integer (computer science); Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.031051998932354417,"score_gpt":0.34425009039367155,"score_spread":0.3131980914613171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971074104","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.59294766,0.000109057364,0.30339324,0.030240089,0.0004478504,0.0019152836,0.00073224545,0.00024813606,0.0699664],"genre_scores_gemma":[0.99700224,0.00015862308,0.0023831495,0.0001595276,0.000014146251,0.000055011762,0.00002688616,0.000005268923,0.00019516784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986691,0.000092180744,0.0005502794,0.00021964253,0.0003649281,0.000103854414],"domain_scores_gemma":[0.9980217,0.0008060143,0.0005359912,0.00038953323,0.00021249439,0.0000342436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044527635,0.00011078166,0.00015970228,0.00004343432,0.00014335981,0.00008863881,0.0005764863,0.000037663922,0.00035547029],"category_scores_gemma":[0.000074333264,0.000077043704,0.000045473847,0.0001327844,0.00035920105,0.00024343636,0.00018628236,0.00007441983,0.000024555167],"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.000028358252,0.00006304561,0.0029431866,0.000013117156,0.00003741211,1.5775612e-7,0.00054381794,0.00000825184,0.00026488205,0.94211465,0.00053574523,0.0534474],"study_design_scores_gemma":[0.0025647867,0.000054110093,0.03875389,0.00004426944,0.000032223925,0.000024395553,0.0006017441,0.88269174,0.0016862106,0.07001762,0.0033670147,0.00016199388],"about_ca_topic_score_codex":0.00004988711,"about_ca_topic_score_gemma":0.0000062075324,"teacher_disagreement_score":0.8826835,"about_ca_system_score_codex":0.000013655525,"about_ca_system_score_gemma":0.000027745018,"threshold_uncertainty_score":0.38921502},"labels":[],"label_agreement":null},{"id":"W2026608328","doi":"10.5555/1756384.1756394","title":"Prime decompositions of regular prefix codes","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Prefix; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Linear code; Combinatorics; Block code; Programming language; Decoding methods","score_opus":0.03602243854098058,"score_gpt":0.33652188973629704,"score_spread":0.30049945119531646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026608328","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.09139343,0.000034535977,0.87399256,0.005219958,0.0001276296,0.00045555757,0.00014010018,0.00016295478,0.028473245],"genre_scores_gemma":[0.98858577,0.00005061533,0.011159625,0.00008705245,0.000009743589,0.000036805286,0.000037359456,0.0000028179904,0.000030214085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.00003262047,0.00027581435,0.00018289771,0.00021645734,0.00006641085],"domain_scores_gemma":[0.999297,0.000048155864,0.00022275618,0.00024203617,0.00015774541,0.00003230163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012893857,0.00006981974,0.00009028045,0.00014541898,0.00005173553,0.000040481194,0.00038733715,0.000021193053,0.0002318642],"category_scores_gemma":[0.0000052484343,0.00007110001,0.00003389854,0.00013974027,0.00006222295,0.00019880688,0.00007013172,0.000033625864,0.000009010656],"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.0000048618926,0.00007875245,0.0002988441,0.000005662389,0.00001883666,8.238945e-8,0.0002211043,0.0000030402232,0.015660195,0.8838255,0.00012073691,0.09976239],"study_design_scores_gemma":[0.003082794,0.0007980612,0.03139309,0.00013977924,0.000043090913,0.000027289887,0.0012254538,0.36227092,0.28122333,0.30873087,0.010501878,0.0005634649],"about_ca_topic_score_codex":0.0000124259695,"about_ca_topic_score_gemma":0.0000042484057,"teacher_disagreement_score":0.89719236,"about_ca_system_score_codex":0.000010103035,"about_ca_system_score_gemma":0.000008748131,"threshold_uncertainty_score":0.28993744},"labels":[],"label_agreement":null},{"id":"W2052735146","doi":"10.5555/1756384.1756402","title":"Efficient automaton-based recognition for linear conjunctive languages","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Computer science; Theoretical computer science; Rule-based machine translation; Nondeterministic finite automaton; Automata theory; Finite-state machine; Algorithm; Artificial intelligence","score_opus":0.05152813767238627,"score_gpt":0.34610267907008896,"score_spread":0.29457454139770267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052735146","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.025814349,0.00002514478,0.94782794,0.0077529796,0.00020243054,0.0011180777,0.0002770251,0.00024389398,0.01673815],"genre_scores_gemma":[0.9904291,0.0000065951754,0.0086347675,0.00042110262,0.000036825037,0.0003014699,0.000118664095,0.00000486698,0.00004661092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990757,0.00002968979,0.00028641766,0.0002630335,0.0002450309,0.00010013878],"domain_scores_gemma":[0.9991506,0.00011285255,0.00023707618,0.00017653407,0.00028174938,0.00004119496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016474465,0.00009556884,0.000112587084,0.000110258086,0.0000661104,0.000058117483,0.0002732257,0.000033611952,0.000084635525],"category_scores_gemma":[0.000020941772,0.00008932811,0.00003893157,0.00008550305,0.00003375767,0.00008016717,0.00002907754,0.000033933342,0.00003342874],"study_design_candidate":"simulation_or_modeling","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.0000275969,0.00016435172,0.0001875468,0.000028096067,0.000034476827,3.9024874e-7,0.00032080075,0.00025337483,0.0036655958,0.652402,0.000673376,0.34224242],"study_design_scores_gemma":[0.0015463358,0.00014783099,0.0011385082,0.00002003881,0.000006391468,0.0000020389589,0.00037390433,0.9882256,0.003708438,0.003541334,0.0011768372,0.00011276266],"about_ca_topic_score_codex":0.000034503366,"about_ca_topic_score_gemma":0.000005507098,"teacher_disagreement_score":0.9879722,"about_ca_system_score_codex":0.000024886162,"about_ca_system_score_gemma":0.000021427504,"threshold_uncertainty_score":0.36426947},"labels":[],"label_agreement":null}]}