{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984618,0.0006063726,0.08177908,0.0021795859,0.000084227126,0.00013110982,0.0010941866,0.00045147422,0.01521224],"genre_scores_gemma":[0.97090244,0.00021561206,0.024472475,0.0001780603,0.00011213887,0.00017855309,0.0007480906,0.000099293364,0.0030932417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994231,0.0014441444,0.0006658931,0.0013952533,0.0015368308,0.0007269631],"domain_scores_gemma":[0.9373088,0.048235036,0.004241183,0.004553207,0.002293139,0.0033686266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029711232,0.0005318401,0.001913223,0.0020913202,0.0032415234,0.0051839827,0.0027464584,0.0031188622,0.008704486],"category_scores_gemma":[0.025787704,0.0012841803,0.0019077965,0.0018411095,0.004099976,0.009909397,0.0027622748,0.0021037282,0.00069005036],"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.0023598934,0.00054956693,0.023333276,0.00081934454,0.00038390534,0.000566221,0.0016827016,0.045099217,0.02621559,0.8347661,0.0052442597,0.058979865],"study_design_scores_gemma":[0.00017092403,0.00020934323,0.004524024,0.000060097453,0.000228858,0.00096925604,0.00038495942,0.103973135,0.013663763,0.87218255,0.0035536475,0.00007952012],"about_ca_topic_score_codex":0.0005910297,"about_ca_topic_score_gemma":0.000984838,"teacher_disagreement_score":0.008704486,"about_ca_system_score_codex":0.0023171636,"about_ca_system_score_gemma":0.0016291025,"threshold_uncertainty_score":0.029119372},"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":"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.4589841,0.00066846696,0.4686506,0.0010488873,0.00033003144,0.00016579758,0.000587642,0.00077367504,0.06879069],"genre_scores_gemma":[0.85940206,0.00053798256,0.1023566,0.0003954719,0.00022886498,0.00019770043,0.0008948232,0.00045047433,0.03553604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993273,0.0001463383,0.000051506537,0.00011807708,0.0001842326,0.00017267285],"domain_scores_gemma":[0.99796814,0.0008803933,0.00018697734,0.00035560012,0.00032014563,0.0002886895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419193,0.00047609047,0.00068838237,0.0015647999,0.0012514067,0.002392285,0.0005874147,0.0007054227,0.008816199],"category_scores_gemma":[0.0033895853,0.0005613404,0.00083062146,0.0009585863,0.0016990822,0.002808382,0.001934842,0.0015738118,0.001397382],"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.00008556152,0.000021108737,0.0001866696,0.000020757292,0.000005011608,0.000056156136,0.00019076731,0.0022794611,0.0015355097,0.9851022,0.0011236799,0.0093931435],"study_design_scores_gemma":[0.000016217931,0.000023533867,0.0001094523,0.000011527653,0.000007680611,0.000069992304,0.000060520284,0.012017833,0.0013460778,0.983275,0.0030519562,0.000010150733],"about_ca_topic_score_codex":0.0006686886,"about_ca_topic_score_gemma":0.0007718299,"teacher_disagreement_score":0.008816199,"about_ca_system_score_codex":0.0010113255,"about_ca_system_score_gemma":0.00089283806,"threshold_uncertainty_score":0.029493153},"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":"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.03821792,0.00024313542,0.9469895,0.00016921399,0.000101121725,0.0001267405,0.0003607173,0.010485216,0.0033064762],"genre_scores_gemma":[0.485967,0.0001797938,0.50648755,0.00016811595,0.00003868481,0.00026445626,0.001597186,0.0005729239,0.004724351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986318,0.00027227757,0.00017392724,0.00030282084,0.00042179905,0.00019743587],"domain_scores_gemma":[0.9969175,0.0016037053,0.00015583966,0.00063952414,0.00061259675,0.000070846174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640919,0.00054679665,0.0009981608,0.00079313817,0.00071985496,0.0022223757,0.0014185733,0.00085109717,0.005920671],"category_scores_gemma":[0.0031393198,0.000635158,0.0012580412,0.0008202493,0.0007696383,0.002627152,0.0014540206,0.0011332952,0.0022122157],"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.0010327853,0.00044514707,0.0026515739,0.0006296406,0.00018950277,0.00057614606,0.00073273206,0.0942407,0.10025735,0.09082554,0.015430377,0.6929884],"study_design_scores_gemma":[0.000085466316,0.00014559303,0.0004728684,0.000037242517,0.000076577686,0.000212337,0.00015766776,0.8668417,0.061359156,0.06422161,0.0063229883,0.000066801294],"about_ca_topic_score_codex":0.0054678535,"about_ca_topic_score_gemma":0.008980755,"teacher_disagreement_score":0.005920671,"about_ca_system_score_codex":0.00086559163,"about_ca_system_score_gemma":0.0015359026,"threshold_uncertainty_score":0.019806623},"labels":[],"label_agreement":null}]}