{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004792696,0.00005370245,0.00008137886,0.00003663186,0.00005463985,0.00003406254,0.0002215231,0.00002403819,0.0001811246],"category_scores_gemma":[0.0000450298,0.00004871352,0.0000174572,0.0001224987,0.00008996564,0.0001611227,0.00009928811,0.00004592888,0.00001482406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003949233,"about_ca_system_score_gemma":0.000003692068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002111322,"about_ca_topic_score_gemma":0.00000382495,"domain_scores_codex":[0.9995918,0.00003977441,0.0000889314,0.0001091046,0.00007985195,0.00009050824],"domain_scores_gemma":[0.9994159,0.0002226355,0.00003982131,0.0002588432,0.00002166977,0.00004115547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[6.595057e-7,0.0002164983,0.003200632,0.0000193185,0.00003437577,0.000007785729,0.004777535,0.00000547137,0.01996719,0.9465969,0.005871268,0.01930233],"study_design_scores_gemma":[0.002241053,0.0005937828,0.5735973,0.0001927522,0.0001076484,0.0001861075,0.001330737,0.1816777,0.05235094,0.1503826,0.03589701,0.001442291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9108017,0.0005949449,0.04032435,0.003223873,0.000113136,0.0001705606,0.00006398448,0.0002526185,0.04445484],"genre_scores_gemma":[0.9964584,0.00003694674,0.003147804,0.00009614462,0.000009410456,0.000003179798,0.00000336241,0.000003412073,0.0002413884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7962143,"threshold_uncertainty_score":0.198648,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001322086,0.0001195024,0.000121896,0.00006265267,0.00008517001,0.0001305909,0.0003370587,0.00003886304,0.0000183623],"category_scores_gemma":[0.00003175811,0.00007370957,0.00001731727,0.0001915621,0.00005108033,0.0002071623,0.00009375322,0.0000890253,0.00003326197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000111386,"about_ca_system_score_gemma":0.00002680618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001386383,"about_ca_topic_score_gemma":0.000004672143,"domain_scores_codex":[0.9992825,0.00004909282,0.0001006489,0.0002714141,0.0001127118,0.0001836526],"domain_scores_gemma":[0.9993818,0.00006486171,0.00002912405,0.0004101762,0.00002909935,0.00008498295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000317209,0.0004678308,0.006710696,0.00004643336,0.0001471733,0.0002453709,0.04101469,0.00007988358,0.1647371,0.5520362,0.04566574,0.1885316],"study_design_scores_gemma":[0.002617127,0.006428465,0.7279903,0.0008942821,0.00006332283,0.0006626926,0.00380099,0.01540127,0.08412141,0.04785448,0.1076965,0.002469116],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9743394,0.001153861,0.00140733,0.01332051,0.0000297015,0.0002015811,0.000002045678,0.0002469424,0.009298649],"genre_scores_gemma":[0.9923858,0.00001874969,0.005260132,0.001233475,0.00003645085,0.000006179196,0.000001071958,0.000007106579,0.001051029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7212797,"threshold_uncertainty_score":0.3005789,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002284464,0.0001324093,0.0002106794,0.00006171672,0.00004851677,0.00006241247,0.0009187338,0.00005471157,0.00005888621],"category_scores_gemma":[0.0001043737,0.0001135228,0.00004783822,0.000142801,0.0002692382,0.0001453926,0.0005605726,0.00008743601,0.00001351349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001055146,"about_ca_system_score_gemma":0.00001421227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001020789,"about_ca_topic_score_gemma":0.00001475714,"domain_scores_codex":[0.9989106,0.00009919216,0.0002014508,0.0003107539,0.0002408284,0.0002371926],"domain_scores_gemma":[0.9985266,0.0001614907,0.00009512984,0.001074541,0.00003461496,0.0001076366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001028569,0.0001142293,0.0009858486,0.00004827014,0.00002832574,0.000005995952,0.002329829,0.000001773487,0.02653693,0.9172421,0.00203861,0.05065785],"study_design_scores_gemma":[0.003090463,0.0009272885,0.4245118,0.0002303673,0.00005443314,0.00007691933,0.0004347127,0.09519076,0.1043122,0.3360184,0.03373269,0.001420054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811173,0.0002334469,0.01167597,0.001144356,0.0001426616,0.0001086626,0.00001116943,0.0001365836,0.005429874],"genre_scores_gemma":[0.9883975,0.00001193537,0.01115366,0.000269889,0.00003992436,0.000002497965,0.000002722341,0.000009848837,0.0001120447],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5812237,"threshold_uncertainty_score":0.4629326,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003156119,0.000169918,0.0002734365,0.00005388595,0.0002487821,0.0002635021,0.002373173,0.00008454267,0.00007120916],"category_scores_gemma":[0.000196819,0.0001415531,0.00005930811,0.00005404354,0.0006147551,0.0004232666,0.001353615,0.0001193729,0.00001541099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001199509,"about_ca_system_score_gemma":0.00002866181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003376554,"about_ca_topic_score_gemma":0.00005110783,"domain_scores_codex":[0.9987103,0.00007110121,0.0002334694,0.0004127468,0.0002811008,0.0002912644],"domain_scores_gemma":[0.9968928,0.0001200563,0.000238386,0.002572962,0.00005430492,0.0001215213],"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.00002228444,0.0001483575,0.001840232,0.00008591104,0.00007037484,0.00004288826,0.0008867265,6.153267e-7,0.01448853,0.9458627,0.01073266,0.02581877],"study_design_scores_gemma":[0.00199604,0.0003290991,0.4272225,0.0002184502,0.00005959804,0.00009973584,0.00008776451,0.006054067,0.05324668,0.4841343,0.02582311,0.0007286196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9413264,0.0009816972,0.002147104,0.00508575,0.0002296542,0.0003069393,0.0000402083,0.0002325456,0.04964969],"genre_scores_gemma":[0.979353,0.00005695342,0.01976799,0.000126824,0.00006323795,0.000006536987,0.000003085669,0.00001267425,0.0006096966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4617284,"threshold_uncertainty_score":0.5772367,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242155,0.0001516278,0.0001954505,0.0002339796,0.0001799116,0.0002384423,0.001737335,0.00004559483,0.00004247111],"category_scores_gemma":[0.000127004,0.000145827,0.0000403626,0.0004134402,0.0002373323,0.0008456219,0.00154657,0.0003365152,0.00001311878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004511463,"about_ca_system_score_gemma":0.00006402342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003495866,"about_ca_topic_score_gemma":0.00005969867,"domain_scores_codex":[0.9983884,0.0001709466,0.0002031833,0.0005223546,0.0002611818,0.0004539517],"domain_scores_gemma":[0.9989366,0.0002443763,0.00004603753,0.0005082366,0.00002548942,0.0002392625],"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.0003280782,0.0002038277,0.3449655,0.00007100437,0.0001240912,0.001927574,0.04396439,0.0001504547,0.03679876,0.5062793,0.001435251,0.06375182],"study_design_scores_gemma":[0.004809525,0.000726781,0.4363611,0.0005301932,0.000015644,0.001840582,0.001377885,0.01877086,0.005920098,0.5224966,0.005323885,0.001826822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849617,0.00009805665,0.008420134,0.0007604277,0.00007636132,0.0002759339,9.930086e-7,0.00005006398,0.00535628],"genre_scores_gemma":[0.9852905,0.00007518221,0.0140101,0.000302474,0.00001096938,0.00002417141,4.582402e-7,0.00001496923,0.0002712278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09139567,"threshold_uncertainty_score":0.5946651,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009445733,0.0001301462,0.0001915322,0.00004445571,0.00005773397,0.00018386,0.0002831733,0.00006635813,0.00001207122],"category_scores_gemma":[0.00006960589,0.0001164398,0.00002540329,0.0001949647,0.00002391893,0.0003384208,0.000135984,0.0001336376,0.00001100205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005529272,"about_ca_system_score_gemma":0.00001583449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002661462,"about_ca_topic_score_gemma":0.00007695542,"domain_scores_codex":[0.998929,0.00007866212,0.0002693045,0.000330586,0.0002006529,0.0001917837],"domain_scores_gemma":[0.9994579,0.0001465001,0.00008742014,0.0002210552,0.00003927777,0.00004784252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000087395,0.0005661397,0.4485087,0.0007782376,0.0003011511,0.0000759046,0.07350997,0.02439195,0.01661175,0.2732519,0.002158906,0.159758],"study_design_scores_gemma":[0.0004592378,0.00001911133,0.04008696,0.00003592019,0.000003584182,0.000001909235,0.00005845004,0.9582114,0.00006774816,0.0008519175,0.00006811431,0.0001356638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6976153,0.0001014623,0.2986984,0.002663429,0.0001845944,0.0001749574,0.000001605784,0.0001627336,0.0003975183],"genre_scores_gemma":[0.9938976,0.00000647359,0.00561005,0.0003461033,0.00003860367,0.000005937084,0.000007315386,0.00001197131,0.00007596816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9338194,"threshold_uncertainty_score":0.4748278,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001076318,0.00008427444,0.0001418565,0.00004875491,0.00006710556,0.00002085522,0.0008275564,0.00004310134,0.0001007237],"category_scores_gemma":[0.00005320825,0.00007553171,0.00004771476,0.0001766434,0.00007947727,0.0001914653,0.0003629398,0.00006908574,0.00006166361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007935333,"about_ca_system_score_gemma":0.00002859114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005060746,"about_ca_topic_score_gemma":0.000002606704,"domain_scores_codex":[0.9992387,0.00003673739,0.0001501891,0.0002026311,0.0001919443,0.0001797842],"domain_scores_gemma":[0.9991157,0.0001129025,0.00006399371,0.0005971366,0.00004999771,0.00006026545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003222173,0.0005296222,0.005673871,0.00007738589,0.0001493757,0.0003443327,0.00606652,0.00008608648,0.1040713,0.8087323,0.03079059,0.04344638],"study_design_scores_gemma":[0.001976741,0.0007216734,0.2565869,0.0002624078,0.00007583439,0.001494201,0.0001254409,0.100436,0.4146784,0.1456011,0.07633936,0.001701953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573039,0.0002838725,0.0188051,0.0005370278,0.000167654,0.00008147781,0.00000161416,0.0001684943,0.02265083],"genre_scores_gemma":[0.9831659,0.00004371656,0.01610084,0.0001302528,0.00003156257,0.000001781629,0.000001018107,0.00000756629,0.0005173606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6631312,"threshold_uncertainty_score":0.3080094,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001986203,0.0001337776,0.000228434,0.00007479377,0.00002943338,0.00005872111,0.0007734518,0.0000829169,0.00002926123],"category_scores_gemma":[0.0001647859,0.0001323609,0.00008203338,0.0003611344,0.00004877318,0.0002372247,0.0001782225,0.0001081122,0.00001826421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004384491,"about_ca_system_score_gemma":0.00007389095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004412863,"about_ca_topic_score_gemma":0.00000145351,"domain_scores_codex":[0.998677,0.0001382958,0.0003680804,0.0003230801,0.0003029693,0.0001905544],"domain_scores_gemma":[0.9988683,0.0002129561,0.0001881807,0.0005059196,0.000118516,0.0001061564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001418118,0.0003998167,0.002700653,0.0007598143,0.0001642093,0.00009169806,0.009989001,0.0835285,0.8142807,0.04124012,0.00427761,0.04242608],"study_design_scores_gemma":[0.0001714756,0.0001548468,0.000173969,0.0000831566,0.000009059111,0.000001878923,0.000008084669,0.9300874,0.06758137,0.0006625065,0.0009273328,0.000138885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03238624,0.00004300772,0.9640559,0.000769935,0.00007904704,0.0002530809,0.000002053937,0.0003304383,0.002080292],"genre_scores_gemma":[0.9087113,7.07162e-7,0.09076364,0.0004430391,0.00004570599,0.000004196478,0.000001173528,0.0000146423,0.00001555409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8763251,"threshold_uncertainty_score":0.539752,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001877279,0.00007431347,0.0000699432,0.00007027251,0.00007034114,0.00007880658,0.0007212218,0.0000330374,0.00005152024],"category_scores_gemma":[0.00003405723,0.00006614358,0.00004083771,0.0006008298,0.00003871679,0.0001704724,0.0002458779,0.00007627891,0.00148197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004815428,"about_ca_system_score_gemma":0.00001482622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003022875,"about_ca_topic_score_gemma":5.786316e-7,"domain_scores_codex":[0.9992392,0.00003866328,0.0000861632,0.0002331109,0.0001502664,0.0002525814],"domain_scores_gemma":[0.9993318,0.00009733612,0.0000202167,0.0004559184,0.0000184113,0.00007633118],"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.000002816641,0.00004216333,0.0002270454,0.000007131996,0.00002077191,0.00005115685,0.001256035,0.00003023702,0.004377318,0.9111837,0.0216458,0.06115582],"study_design_scores_gemma":[0.0006963988,0.0002132897,0.05092945,0.00003678071,0.00001334523,0.00004638655,0.00009251581,0.06550406,0.01515895,0.5439901,0.3225801,0.0007385663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6474099,0.0001957268,0.09252324,0.01933416,0.002646026,0.0005711457,0.00001002342,0.005305592,0.2320041],"genre_scores_gemma":[0.9909977,0.00001633357,0.004259527,0.0002264882,0.00004135178,0.000008986881,0.000001664121,0.000006541986,0.004441373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3671935,"threshold_uncertainty_score":0.9992955,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114622,0.00008117285,0.0001287829,0.00001257318,0.00002492088,0.000008607032,0.0001339215,0.00009608603,0.000002300708],"category_scores_gemma":[0.0006966279,0.0000571241,0.00006023253,0.00003697049,0.00008777029,0.000001550111,0.0001068514,0.0000380016,0.000001235856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004222612,"about_ca_system_score_gemma":0.00003380821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006599883,"about_ca_topic_score_gemma":0.000001489805,"domain_scores_codex":[0.9993894,0.00008739054,0.0001535511,0.0001762336,0.00004528548,0.0001482093],"domain_scores_gemma":[0.9995888,0.00003621475,0.00006118321,0.0001492158,0.0001079335,0.00005663702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007614181,0.00002627959,0.0004446136,0.00001180899,0.00002439214,8.655761e-8,0.00005720598,0.000005410622,0.9854947,0.0004601281,0.0005967554,0.01280244],"study_design_scores_gemma":[0.000348761,0.0005475,0.0003461092,0.00002069864,0.00001784943,0.000004520813,0.00008470844,0.000426987,0.9031689,0.0009443816,0.09396214,0.0001274911],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714062,0.001670704,0.02012242,0.0002307418,0.0001071574,0.0002187,0.000003510303,0.00001551203,0.006225074],"genre_scores_gemma":[0.9201032,0.00001386614,0.07926178,0.00007743737,0.00008996519,0.00001083551,0.00001155026,0.000008195,0.000423185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09336539,"threshold_uncertainty_score":0.2329453,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004411603,0.0001430498,0.0002728065,0.00003068307,0.0002556213,0.00002126488,0.001240745,0.000159984,0.000269027],"category_scores_gemma":[0.001145567,0.0000791625,0.00009429372,0.00005009779,0.0008678968,0.00003234229,0.000210444,0.0003572752,0.0000341094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002025555,"about_ca_system_score_gemma":0.00004799017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002903306,"about_ca_topic_score_gemma":0.0004500077,"domain_scores_codex":[0.998822,0.0002509239,0.0002963152,0.0001968487,0.0001665865,0.0002672968],"domain_scores_gemma":[0.9970832,0.001246103,0.000253591,0.00135562,0.00003003039,0.00003138407],"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.00004476183,0.0001660781,0.001308437,0.00001452701,0.00003437786,0.000009567379,0.001361052,0.000001770095,0.001608548,0.9936407,0.001082448,0.000727765],"study_design_scores_gemma":[0.0006579958,0.0001119214,0.1116788,0.00004518971,0.00003909117,0.00002356058,0.0002803512,0.0001730714,0.008655544,0.8776486,0.000525217,0.0001607169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9683132,0.0000196759,0.00002382246,0.01036066,0.0002683186,0.0002997344,0.000004933311,0.0000214606,0.02068821],"genre_scores_gemma":[0.998757,0.000006308986,0.00006096946,0.0003117369,0.00003714405,0.00003715189,4.510835e-7,0.00002152415,0.0007676982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1159921,"threshold_uncertainty_score":0.3228153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}