{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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","author_layer_release":"2026-06-26"},"query_hash":"a3871ff0ba0a","filters":{"venue":"International Conference on Implementation and application of automata"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Wojciech Frączak","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Wojciech Rytter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03602243854098058,"gpt":0.336521889736297,"spread":0.3004994511953165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001289386,0.00006981974,0.00009028045,0.000145419,0.00005173553,0.00004048119,0.0003873371,0.00002119305,0.0002318642],"category_scores_gemma":[0.000005248434,0.00007110001,0.00003389854,0.0001397403,0.00006222295,0.0001988069,0.00007013172,0.00003362586,0.000009010656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001010303,"about_ca_system_score_gemma":0.000008748131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001242597,"about_ca_topic_score_gemma":0.000004248406,"domain_scores_codex":[0.9992258,0.00003262047,0.0002758144,0.0001828977,0.0002164573,0.00006641085],"domain_scores_gemma":[0.999297,0.00004815586,0.0002227562,0.0002420362,0.0001577454,0.00003230163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004861893,0.00007875245,0.0002988441,0.000005662389,0.00001883666,8.238945e-8,0.0002211043,0.000003040223,0.01566019,0.8838255,0.0001207369,0.09976239],"study_design_scores_gemma":[0.003082794,0.0007980612,0.03139309,0.0001397792,0.00004309091,0.00002728989,0.001225454,0.3622709,0.2812233,0.3087309,0.01050188,0.0005634649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09139343,0.00003453598,0.8739926,0.005219958,0.0001276296,0.0004555576,0.0001401002,0.0001629548,0.02847324],"genre_scores_gemma":[0.9885858,0.00005061533,0.01115962,0.00008705245,0.000009743589,0.00003680529,0.00003735946,0.00000281799,0.00003021409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8971924,"threshold_uncertainty_score":0.2899374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Andrei Păun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03105199893235442,"gpt":0.3442500903936715,"spread":0.3131980914613171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004452764,0.0001107817,0.0001597023,0.00004343432,0.0001433598,0.00008863881,0.0005764863,0.00003766392,0.0003554703],"category_scores_gemma":[0.00007433326,0.0000770437,0.00004547385,0.0001327844,0.000359201,0.0002434364,0.0001862824,0.00007441983,0.00002455517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001365553,"about_ca_system_score_gemma":0.00002774502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004988711,"about_ca_topic_score_gemma":0.000006207532,"domain_scores_codex":[0.9986691,0.00009218074,0.0005502794,0.0002196425,0.0003649281,0.0001038544],"domain_scores_gemma":[0.9980217,0.0008060143,0.0005359912,0.0003895332,0.0002124944,0.0000342436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002835825,0.00006304561,0.002943187,0.00001311716,0.00003741211,1.577561e-7,0.0005438179,0.00000825184,0.0002648821,0.9421147,0.0005357452,0.0534474],"study_design_scores_gemma":[0.002564787,0.00005411009,0.03875389,0.00004426944,0.00003222392,0.00002439555,0.0006017441,0.8826917,0.001686211,0.07001762,0.003367015,0.0001619939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5929477,0.0001090574,0.3033932,0.03024009,0.0004478504,0.001915284,0.0007322454,0.0002481361,0.0699664],"genre_scores_gemma":[0.9970022,0.0001586231,0.002383149,0.0001595276,0.00001414625,0.00005501176,0.00002688616,0.000005268923,0.0001951678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8826835,"threshold_uncertainty_score":0.389215,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexander Okhotin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05152813767238627,"gpt":0.346102679070089,"spread":0.2945745413977027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001647446,0.00009556884,0.0001125871,0.0001102581,0.0000661104,0.00005811748,0.0002732257,0.00003361195,0.00008463553],"category_scores_gemma":[0.00002094177,0.00008932811,0.00003893157,0.00008550305,0.00003375767,0.00008016717,0.00002907754,0.00003393334,0.00003342874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002488616,"about_ca_system_score_gemma":0.0000214275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003450337,"about_ca_topic_score_gemma":0.000005507098,"domain_scores_codex":[0.9990757,0.00002968979,0.0002864177,0.0002630335,0.0002450309,0.0001001388],"domain_scores_gemma":[0.9991506,0.0001128525,0.0002370762,0.0001765341,0.0002817494,0.00004119496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000275969,0.0001643517,0.0001875468,0.00002809607,0.00003447683,3.902487e-7,0.0003208008,0.0002533748,0.003665596,0.652402,0.000673376,0.3422424],"study_design_scores_gemma":[0.001546336,0.000147831,0.001138508,0.00002003881,0.000006391468,0.000002038959,0.0003739043,0.9882256,0.003708438,0.003541334,0.001176837,0.0001127627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02581435,0.00002514478,0.9478279,0.00775298,0.0002024305,0.001118078,0.0002770251,0.000243894,0.01673815],"genre_scores_gemma":[0.9904291,0.000006595175,0.008634767,0.0004211026,0.00003682504,0.0003014699,0.0001186641,0.00000486698,0.00004661092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9879722,"threshold_uncertainty_score":0.3642695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}