{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419193,0.0004760905,0.0006883824,0.0015648,0.001251407,0.002392285,0.0005874147,0.0007054227,0.008816199],"category_scores_gemma":[0.003389585,0.0005613404,0.0008306215,0.0009585863,0.001699082,0.002808382,0.001934842,0.001573812,0.001397382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011326,"about_ca_system_score_gemma":0.0008928381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006686886,"about_ca_topic_score_gemma":0.0007718299,"domain_scores_codex":[0.9993273,0.0001463383,0.00005150654,0.0001180771,0.0001842326,0.0001726729],"domain_scores_gemma":[0.9979681,0.0008803933,0.0001869773,0.0003556001,0.0003201456,0.0002886895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008556152,0.00002110874,0.0001866696,0.00002075729,0.000005011608,0.00005615614,0.0001907673,0.002279461,0.00153551,0.9851022,0.00112368,0.009393143],"study_design_scores_gemma":[0.00001621793,0.00002353387,0.0001094523,0.00001152765,0.000007680611,0.0000699923,0.00006052028,0.01201783,0.001346078,0.983275,0.003051956,0.00001015073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4589841,0.000668467,0.4686506,0.001048887,0.0003300314,0.0001657976,0.000587642,0.000773675,0.06879069],"genre_scores_gemma":[0.8594021,0.0005379826,0.1023566,0.0003954719,0.000228865,0.0001977004,0.0008948232,0.0004504743,0.03553604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008816199,"threshold_uncertainty_score":0.02949315,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971123,0.0005318401,0.001913223,0.00209132,0.003241523,0.005183983,0.002746458,0.003118862,0.008704486],"category_scores_gemma":[0.0257877,0.00128418,0.001907796,0.001841109,0.004099976,0.009909397,0.002762275,0.002103728,0.0006900504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002317164,"about_ca_system_score_gemma":0.001629103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005910297,"about_ca_topic_score_gemma":0.000984838,"domain_scores_codex":[0.994231,0.001444144,0.0006658931,0.001395253,0.001536831,0.0007269631],"domain_scores_gemma":[0.9373088,0.04823504,0.004241183,0.004553207,0.002293139,0.003368627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002359893,0.0005495669,0.02333328,0.0008193445,0.0003839053,0.000566221,0.001682702,0.04509922,0.02621559,0.8347661,0.00524426,0.05897987],"study_design_scores_gemma":[0.000170924,0.0002093432,0.004524024,0.00006009745,0.000228858,0.000969256,0.0003849594,0.1039731,0.01366376,0.8721825,0.003553648,0.00007952012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8984618,0.0006063726,0.08177908,0.002179586,0.00008422713,0.0001311098,0.001094187,0.0004514742,0.01521224],"genre_scores_gemma":[0.9709024,0.0002156121,0.02447248,0.0001780603,0.0001121389,0.0001785531,0.0007480906,0.00009929336,0.003093242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008704486,"threshold_uncertainty_score":0.02911937,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640919,0.0005467967,0.0009981608,0.0007931382,0.000719855,0.002222376,0.001418573,0.0008510972,0.005920671],"category_scores_gemma":[0.00313932,0.000635158,0.001258041,0.0008202493,0.0007696383,0.002627152,0.001454021,0.001133295,0.002212216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008655916,"about_ca_system_score_gemma":0.001535903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005467854,"about_ca_topic_score_gemma":0.008980755,"domain_scores_codex":[0.9986318,0.0002722776,0.0001739272,0.0003028208,0.000421799,0.0001974359],"domain_scores_gemma":[0.9969175,0.001603705,0.0001558397,0.0006395241,0.0006125967,0.00007084617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001032785,0.0004451471,0.002651574,0.0006296406,0.0001895028,0.0005761461,0.0007327321,0.0942407,0.1002574,0.09082554,0.01543038,0.6929884],"study_design_scores_gemma":[0.00008546632,0.000145593,0.0004728684,0.00003724252,0.00007657769,0.000212337,0.0001576678,0.8668417,0.06135916,0.06422161,0.006322988,0.00006680129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03821792,0.0002431354,0.9469895,0.000169214,0.0001011217,0.0001267405,0.0003607173,0.01048522,0.003306476],"genre_scores_gemma":[0.485967,0.0001797938,0.5064875,0.0001681159,0.00003868481,0.0002644563,0.001597186,0.0005729239,0.004724351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005920671,"threshold_uncertainty_score":0.01980662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}