{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"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":"92db547c57fd","filters":{"venue":"Acta Cybernetica"}},"results":[{"id":"W1537925488","doi":"","title":"Factorizations of languages and commutativity conditions","year":2002,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Prime (order theory); Prime factor; Factorization; Commutative property; Product (mathematics); Mathematics; Section (typography); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Algorithm; Geometry","authors":[{"name":"Alexandru Mateescu","is_ca":false},{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198002264120126,"gpt":0.2536741679884212,"spread":0.24169414534722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003190541,0.0005620278,0.0007103677,0.001204784,0.001906747,0.002866698,0.0005637739,0.001117494,0.0114245],"category_scores_gemma":[0.006685317,0.0006708624,0.00136214,0.0006654485,0.00486068,0.007419437,0.00221774,0.001727333,0.00165406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00108484,"about_ca_system_score_gemma":0.000842566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008480905,"about_ca_topic_score_gemma":0.0006128305,"domain_scores_codex":[0.9967271,0.0007695644,0.0004033504,0.001116165,0.0004820318,0.0005016877],"domain_scores_gemma":[0.9948806,0.002563098,0.0004208595,0.0008737152,0.0008770311,0.0003846648],"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.00004253276,0.00001404797,0.0001945115,0.0000396711,0.000005776128,0.0001452817,0.0006089502,0.0004953532,0.00184349,0.9908886,0.0005944418,0.00512729],"study_design_scores_gemma":[0.00001759927,0.0000369545,0.0001524935,0.00002511254,0.000008376448,0.0002514529,0.0002111273,0.003463253,0.001985502,0.9874169,0.006413568,0.00001768269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2293893,0.001580953,0.6862778,0.001334258,0.0003589119,0.0002493357,0.0007416091,0.0006571753,0.07941069],"genre_scores_gemma":[0.8554912,0.0007582799,0.1245261,0.0004065109,0.0003260189,0.0003557409,0.0009354139,0.0001612002,0.01703953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0114245,"threshold_uncertainty_score":0.0382188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W95660754","doi":"","title":"Languages convex with respect to binary relations, and their closure properties","year":2009,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Closure (psychology); Suffix; Mathematics; Regular language; Prefix code; Abstract family of languages; Set (abstract data type); Regular polygon; Combinatorics; Discrete mathematics; Computer science; Linguistics; Theoretical computer science; Programming language; Algorithm; Second-generation programming language; Decoding methods; Block code; Linear code","authors":[{"name":"Thomas Ang","is_ca":true},{"name":"Janusz Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008254940453334412,"gpt":0.2102712785417305,"spread":0.2020163380883961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688792,0.0006193671,0.0006827852,0.002225659,0.002046388,0.004431027,0.0007949686,0.0007916662,0.004100391],"category_scores_gemma":[0.008576796,0.0006280839,0.001109791,0.001536513,0.006097137,0.006056979,0.002287034,0.001594582,0.0006257617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001477605,"about_ca_system_score_gemma":0.001445352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002216518,"about_ca_topic_score_gemma":0.001185304,"domain_scores_codex":[0.9968622,0.0006912898,0.0003724862,0.0006955675,0.0009789253,0.0003995596],"domain_scores_gemma":[0.9924768,0.004071242,0.0008615886,0.0008113362,0.001169698,0.0006093727],"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.00004692277,0.00001847784,0.0003383314,0.00004101976,0.00001115779,0.0002557425,0.0009956768,0.00180118,0.002517887,0.9866819,0.0005026961,0.006788984],"study_design_scores_gemma":[0.00002406657,0.00004641697,0.0005593818,0.0000396406,0.00001581315,0.0007780615,0.000577419,0.01164862,0.002557293,0.9741779,0.009541263,0.00003402817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5207175,0.00164776,0.3871422,0.001595156,0.0002406319,0.0002063465,0.001452674,0.0006352557,0.08636247],"genre_scores_gemma":[0.9152223,0.0008587485,0.06764612,0.0003010779,0.0003837628,0.0003654142,0.001337513,0.0002275082,0.01365767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004431027,"threshold_uncertainty_score":0.01371717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W136331652","doi":"10.14232/actacyb.21.4.2014.1","title":"Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language","year":2014,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Regular language; Quotient; Prefix; Suffix; Mathematics; Discrete mathematics; Concatenation (mathematics); Combinatorics; Computer science; Automaton; Theoretical computer science; Linguistics","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Galina Jirásková","is_ca":true},{"name":"Baiyu Li","is_ca":true},{"name":"Joshua Smith","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01278050915506425,"gpt":0.2178718046032658,"spread":0.2050912954482015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007573633,0.0004153803,0.0007441895,0.001079966,0.0009770641,0.002502407,0.001167128,0.0006270595,0.005607007],"category_scores_gemma":[0.007128185,0.0002608071,0.001222788,0.0007891569,0.002084417,0.005659799,0.001877935,0.001129602,0.0003757661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002542516,"about_ca_system_score_gemma":0.001962367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002971047,"about_ca_topic_score_gemma":0.001801619,"domain_scores_codex":[0.9981315,0.0002031397,0.0002115734,0.0004944071,0.0004672219,0.0004922336],"domain_scores_gemma":[0.9926045,0.004474961,0.0005900767,0.0007903847,0.0008413682,0.0006987051],"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.001538624,0.0002387737,0.01727074,0.0004826522,0.000102736,0.0006493173,0.003323606,0.08102396,0.04132326,0.7978188,0.004230615,0.0519969],"study_design_scores_gemma":[0.00005285344,0.0001389266,0.003297716,0.00002617603,0.00006514702,0.0004257695,0.0003357001,0.2250519,0.01544225,0.7521912,0.002888958,0.00008351722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9195275,0.0004144994,0.06911574,0.0005876043,0.00003477052,0.00007280236,0.001022287,0.0004139651,0.008810855],"genre_scores_gemma":[0.9817146,0.0001708715,0.01432138,0.00007039467,0.00003829957,0.0000936327,0.0009664284,0.00008140002,0.002543073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005607007,"threshold_uncertainty_score":0.01875734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2610921159","doi":"10.14232/actacyb.23.1.2017.3","title":"Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages","year":2017,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Prefix code; Concatenation (mathematics); Ideal (ethics); Mathematics; Quotient; Combinatorics; Discrete mathematics; Alphabet; Computer science; Automaton; Algorithm; Theoretical computer science","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Corwin Sinnamon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01902375674254079,"gpt":0.2575412219832441,"spread":0.2385174652407034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348562,0.0004712842,0.001001921,0.00133695,0.001047631,0.004900336,0.001522137,0.0009488043,0.003741883],"category_scores_gemma":[0.01788009,0.0005784983,0.001373283,0.001064855,0.003491989,0.008757094,0.002406621,0.001569163,0.0003570523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002496655,"about_ca_system_score_gemma":0.001734214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001384193,"about_ca_topic_score_gemma":0.000900762,"domain_scores_codex":[0.9962697,0.0007558232,0.0004551382,0.0007956679,0.001167756,0.0005559268],"domain_scores_gemma":[0.966653,0.02530011,0.00233154,0.002302848,0.001765037,0.001647437],"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.0009562509,0.0001875822,0.009948878,0.000379634,0.000114204,0.0005835252,0.002794122,0.1045252,0.0187056,0.8373746,0.001990649,0.02243986],"study_design_scores_gemma":[0.00004615451,0.00008822669,0.002137473,0.00002733662,0.00004692293,0.0004118409,0.0003398478,0.2970959,0.009117002,0.6889752,0.001649859,0.00006435785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8564758,0.0004103441,0.1292708,0.001240307,0.00002832684,0.00007972518,0.001088804,0.0003788871,0.01102696],"genre_scores_gemma":[0.9725558,0.0001860817,0.02372886,0.00008928912,0.0000702987,0.0001191385,0.0007999166,0.000102276,0.002348329],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004900336,"threshold_uncertainty_score":0.01811463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W97986267","doi":"","title":"Splitters and barriers in open graphs having a perfect internal matching","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Strong perfect graph theorem; Matching (statistics); Combinatorics; Perfect graph; Mathematics; Context (archaeology); Chordal graph; Discrete mathematics; Computer science; Graph; Pathwidth; Line graph; 1-planar graph; Statistics","authors":[{"name":"Miklós Bartha","is_ca":true},{"name":"Miklós Krész","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01903305142870743,"gpt":0.2841289702447476,"spread":0.2650959188160402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433555,0.0002931757,0.0004786982,0.001380794,0.0007695419,0.001808119,0.0006412269,0.0006133941,0.004243017],"category_scores_gemma":[0.00311171,0.0003828586,0.0004297753,0.0008490996,0.001567691,0.003043548,0.001646174,0.0007706999,0.0004079754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004065531,"about_ca_system_score_gemma":0.0002697496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005486983,"about_ca_topic_score_gemma":0.0005970428,"domain_scores_codex":[0.9996897,0.00004585829,0.0000185509,0.0000808046,0.00007099624,0.00009406828],"domain_scores_gemma":[0.9980348,0.00104287,0.0003549703,0.0001640971,0.0001523392,0.0002509592],"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.0002608639,0.0000414445,0.002113701,0.0001460171,0.00002565876,0.0004512872,0.0006993376,0.006855023,0.01244442,0.9581814,0.001240389,0.01754046],"study_design_scores_gemma":[0.0000529714,0.00009023002,0.001700515,0.00004816454,0.00004543718,0.0007694511,0.0007184937,0.03107531,0.008218973,0.9518927,0.005361465,0.00002631012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.832287,0.0007642182,0.1461694,0.0003170635,0.00005536036,0.00004616039,0.0002245711,0.0002995941,0.0198367],"genre_scores_gemma":[0.9768529,0.0003204095,0.01846404,0.00005322048,0.0000313139,0.00004428532,0.0002264366,0.00005058593,0.003956803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004243017,"threshold_uncertainty_score":0.01419431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998629909","doi":"10.14232/actacyb.24.3.2020.4","title":"Another Multibody Dynamics in Natural Coordinates through Automatic Differentiation and High-Index DAE Solving","year":2020,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Modeling and Simulation Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Automatic differentiation; Context (archaeology); Applied mathematics; Simple (philosophy); Computer science; Lagrangian; Algebraic equation; Differential algebraic equation; Differential equation; Matrix (chemical analysis); Mathematics; Mathematical optimization; Algorithm; Ordinary differential equation; Mathematical analysis; Physics","authors":[{"name":"John D. Pryce","is_ca":false},{"name":"Nedialko S. Nedialkov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01355222712316226,"gpt":0.2351959856845918,"spread":0.2216437585614296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003506008,0.0003904523,0.0003922683,0.0004557401,0.0004600817,0.0007404216,0.0007364738,0.0005753055,0.004483674],"category_scores_gemma":[0.0008127367,0.0002095835,0.0005960609,0.000320051,0.0008342126,0.0008448275,0.001202923,0.000858453,0.0006962963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000429347,"about_ca_system_score_gemma":0.0006219945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002291158,"about_ca_topic_score_gemma":0.002814942,"domain_scores_codex":[0.9998042,0.00005946339,0.000008672207,0.00002587732,0.00009042095,0.00001130043],"domain_scores_gemma":[0.9998259,0.00005520793,0.00002404741,0.00003965329,0.00003751417,0.00001759524],"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.00004712256,0.00005943465,0.001117029,0.0002283019,0.00005289767,0.0002763586,0.0004303397,0.3858103,0.01427266,0.5232201,0.003871869,0.07061357],"study_design_scores_gemma":[0.00001498863,0.00002829508,0.000152279,0.00001555331,0.000004455571,0.00008318997,0.00003254039,0.9419722,0.001110265,0.04415058,0.01242455,0.00001107311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01169851,0.0001510662,0.9743381,0.0002470496,0.000103523,0.00004810125,0.00006525526,0.0001947063,0.01315368],"genre_scores_gemma":[0.3073543,0.0003376964,0.6750832,0.0001788926,0.00007639457,0.0001672329,0.0001599014,0.0002112865,0.01643112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004483674,"threshold_uncertainty_score":0.01499939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W104936076","doi":"","title":"Homomorphisms Preserving Types of Density.","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Homomorphism; Endomorphism; Mathematics; Hierarchy; Relation (database); Pure mathematics; Monoid; Equivalence relation; Algebra over a field; Discrete mathematics; Computer science","authors":[{"name":"Helmut Jürgensen","is_ca":true},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0134875066003155,"gpt":0.2032182424860368,"spread":0.1897307358857213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003800763,0.0003736047,0.000517233,0.001965129,0.002132726,0.002680082,0.0009064923,0.0009273399,0.003648836],"category_scores_gemma":[0.01308427,0.0005706956,0.001335642,0.0009994983,0.004874217,0.008926979,0.003262305,0.001933331,0.0005838661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001235217,"about_ca_system_score_gemma":0.0009621672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133571,"about_ca_topic_score_gemma":0.0008205978,"domain_scores_codex":[0.9969718,0.0007065345,0.0003413456,0.0006634737,0.0009705284,0.0003462374],"domain_scores_gemma":[0.9886874,0.006159245,0.0007737441,0.002318128,0.001276544,0.0007849468],"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.00009082099,0.00003714539,0.002135538,0.0001042437,0.00002400349,0.0001957204,0.001172492,0.001047533,0.004787478,0.9497957,0.0006464387,0.03996289],"study_design_scores_gemma":[0.00002029073,0.000101628,0.001712286,0.00007357823,0.00006556352,0.001277644,0.0007847446,0.009974878,0.01412373,0.9584267,0.01338526,0.00005381204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2171967,0.0007707963,0.7463548,0.0006055695,0.0002369181,0.0003142666,0.0004316762,0.0008687144,0.03322051],"genre_scores_gemma":[0.8493812,0.0003937827,0.1422759,0.0002101088,0.0001460344,0.0002305939,0.0003675478,0.0001492752,0.006845512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003800763,"threshold_uncertainty_score":0.02010059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081143976","doi":"10.14232/actacyb.285246","title":"Interval-Based Simulation of Zélus IVPs using DynIbex","year":2020,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Executable; Computer science; Compiler; Programming language; Interval (graph theory); Extension (predicate logic); Workflow; Task (project management); Scripting language; Theoretical computer science; Algorithm; Database; Mathematics","authors":[{"name":"J.G. Brown","is_ca":true},{"name":"François Pessaux","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05654059433357841,"gpt":0.2959740899431766,"spread":0.2394334956095982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368466,0.000332656,0.0003097919,0.0003061211,0.0002129265,0.0004589987,0.0006886661,0.0003671407,0.005689556],"category_scores_gemma":[0.001045348,0.0002293208,0.0003887459,0.0001474447,0.0003396513,0.0003584004,0.0006027668,0.0005104252,0.0004415677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003350255,"about_ca_system_score_gemma":0.0005480836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001965285,"about_ca_topic_score_gemma":0.001517994,"domain_scores_codex":[0.9998253,0.00004176876,0.00001266441,0.00002418216,0.00006950001,0.00002660971],"domain_scores_gemma":[0.9995933,0.000239795,0.00003718059,0.00005083569,0.00005779383,0.00002104445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001334284,0.00003213491,0.001719668,0.0001531129,0.00002297527,0.000132946,0.0001645781,0.9628179,0.007226851,0.01203854,0.001211908,0.01434601],"study_design_scores_gemma":[0.00001937766,0.00004268629,0.0002721662,0.00001663125,0.000006571994,0.00003204919,0.00001888341,0.9888827,0.005419058,0.002022695,0.003259063,0.00000813232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1771554,0.0001711656,0.789167,0.0001303038,0.0001039454,0.0001243266,0.001029558,0.01252762,0.01959068],"genre_scores_gemma":[0.8332311,0.0001259939,0.1610024,0.00004232067,0.000009545822,0.0002584181,0.0007155357,0.0008857795,0.003728882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005689556,"threshold_uncertainty_score":0.01903349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4379535338","doi":"10.14232/actacyb.303531","title":"Preface","year":2023,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Czech; Library science; Political science; Philosophy; Computer science","authors":[{"name":"Andreas Rauh","is_ca":false},{"name":"Balázs Bánhelyi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01060251934456302,"gpt":0.2262806912629306,"spread":0.2156781719183676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002041936,0.001331718,0.001081401,0.002949232,0.002925958,0.005136963,0.001967892,0.002029169,0.5579938],"category_scores_gemma":[0.01468184,0.0004212316,0.0009082062,0.002534922,0.0009307572,0.004507539,0.002907777,0.003478938,0.4257901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002575172,"about_ca_system_score_gemma":0.002958025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002893073,"about_ca_topic_score_gemma":0.002930815,"domain_scores_codex":[0.9983479,0.0002460076,0.0001480894,0.0003306973,0.0007581333,0.0001692591],"domain_scores_gemma":[0.9934478,0.0008809004,0.000266947,0.0006481479,0.003675585,0.00108065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002752379,0.00001333478,0.00009022009,0.0001081011,0.000002493937,0.00004371842,0.00008185556,0.00005005267,0.00007261524,0.003639089,0.9647797,0.03109134],"study_design_scores_gemma":[0.000004122357,0.00001315317,0.0002102284,0.0001116084,0.000001518138,0.00006292756,0.00008501693,0.00002531799,0.00004694248,0.001651782,0.9977829,0.00000451229],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.001810855,0.01211765,0.008382005,0.04344912,0.2078906,0.0007142028,0.01931284,0.003027989,0.7032948],"genre_scores_gemma":[0.01009888,0.008725048,0.004225066,0.009570042,0.03669656,0.0004998863,0.02104334,0.001972134,0.907169],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.5579938,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620910963","doi":"10.14232/actacyb.22.2.2015.3","title":"Methods for Relativizing Properties of Codes","year":2015,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decidability; Alphabet; Class (philosophy); Computer science; Set (abstract data type); Realm; Property (philosophy); Code (set theory); Simplicity; Discrete mathematics; Theoretical computer science; Mathematics; Linguistics; Artificial intelligence; Programming language; Philosophy; Epistemology","authors":[{"name":"Helmut Jürgensen","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Steffen Kopecki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0825713404205394,"gpt":0.3463033587562505,"spread":0.263732018335711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01961749,0.00163332,0.001701338,0.006605166,0.002671034,0.007646681,0.003911623,0.00303059,0.005189091],"category_scores_gemma":[0.05352531,0.001519775,0.007743719,0.003215277,0.0142783,0.01823257,0.01101917,0.009065188,0.001252947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005321814,"about_ca_system_score_gemma":0.00211809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001390088,"about_ca_topic_score_gemma":0.0007988022,"domain_scores_codex":[0.9760833,0.009895924,0.002196833,0.00524172,0.004899092,0.001683097],"domain_scores_gemma":[0.9340982,0.04304843,0.003373127,0.01523978,0.003577113,0.0006634013],"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.00003469092,0.00001644491,0.0002814826,0.0001074244,0.00003604679,0.00004452602,0.0006608865,0.005021638,0.0005972693,0.9821062,0.0006418569,0.01045168],"study_design_scores_gemma":[0.00001396045,0.0000281811,0.00008372885,0.00005118368,0.00003610548,0.00006843585,0.0001282264,0.01284221,0.001584458,0.9795938,0.005533476,0.00003636334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01175393,0.0006069512,0.9758142,0.0009112443,0.0001411654,0.0001250762,0.0001791633,0.0005319835,0.009936345],"genre_scores_gemma":[0.3453029,0.001712879,0.6401407,0.0009199432,0.001388116,0.001180551,0.001044881,0.0009462843,0.007363866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01961749,"threshold_uncertainty_score":0.1037484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611921753","doi":"10.14232/actacyb.23.1.2017.18","title":"On the Completeness of the Traced Monoidal Category Axioms in (Rel,+)","year":2017,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Symmetric monoidal category; Closed monoidal category; Axiom; Enriched category; Mathematics; Higher category theory; Simple (philosophy); Monoidal category; Extension (predicate logic); Completeness (order theory); Pure mathematics; Algebra over a field; TRACE (psycholinguistics); Interpretation (philosophy); Discrete mathematics; Computer science; Linguistics; Functor; Mathematical analysis","authors":[{"name":"Miklós Bartha","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04673592593306464,"gpt":0.3035491491656458,"spread":0.2568132232325812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007070973,0.0006771526,0.001304077,0.002406883,0.002562755,0.003797124,0.00154104,0.001434371,0.00544431],"category_scores_gemma":[0.008482777,0.0007528462,0.001762095,0.001620186,0.006328607,0.01613997,0.005416481,0.003167216,0.001082004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001469664,"about_ca_system_score_gemma":0.002542846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003186268,"about_ca_topic_score_gemma":0.003600892,"domain_scores_codex":[0.996666,0.0009507944,0.000386766,0.0007054238,0.0009395332,0.000351437],"domain_scores_gemma":[0.9879589,0.005700052,0.0005919047,0.002080743,0.003193816,0.0004745937],"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.00004318745,0.0000394716,0.0006104229,0.0001482125,0.000023607,0.000126137,0.0007460967,0.001100759,0.0009401708,0.9868951,0.001033637,0.008293158],"study_design_scores_gemma":[0.00002408188,0.00005595067,0.001090584,0.00003972051,0.00002856735,0.0002728208,0.0003464447,0.0059849,0.002674931,0.980755,0.008689495,0.00003759551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2827607,0.001553294,0.6257382,0.002558666,0.0002225153,0.0002279476,0.002185504,0.0009308735,0.08382228],"genre_scores_gemma":[0.8637487,0.0009001419,0.1183705,0.0006094941,0.0002536704,0.000264083,0.002762147,0.0002525858,0.01283864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007070973,"threshold_uncertainty_score":0.03739536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}