{"meta":{"query_hash":"92db547c57fd","filters":{"venue":"Acta Cybernetica"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/92db547c57fd","api":"https://metacan.xera.ac/api/v1/cohort?venue=Acta+Cybernetica"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013487506600315502,"score_gpt":0.20321824248603676,"score_spread":0.18973073588572126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104936076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95730394,0.00028387253,0.018805102,0.00053702784,0.00016765403,0.00008147781,0.0000016141598,0.00016849431,0.022650829],"genre_scores_gemma":[0.9831659,0.00004371656,0.016100839,0.00013025277,0.00003156257,0.000001781629,0.0000010181068,0.00000756629,0.00051736063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992387,0.000036737387,0.00015018908,0.00020263111,0.00019194435,0.00017978418],"domain_scores_gemma":[0.9991157,0.00011290253,0.00006399371,0.00059713656,0.000049997714,0.00006026545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010763182,0.00008427444,0.00014185648,0.000048754908,0.00006710556,0.000020855216,0.00082755636,0.00004310134,0.00010072374],"category_scores_gemma":[0.00005320825,0.00007553171,0.000047714755,0.00017664336,0.00007947727,0.0001914653,0.00036293984,0.00006908574,0.00006166361],"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.000032221727,0.0005296222,0.005673871,0.00007738589,0.0001493757,0.00034433272,0.0060665198,0.00008608648,0.10407131,0.80873233,0.030790593,0.04344638],"study_design_scores_gemma":[0.0019767415,0.0007216734,0.2565869,0.00026240776,0.00007583439,0.0014942015,0.00012544094,0.10043597,0.41467836,0.14560114,0.076339364,0.0017019528],"about_ca_topic_score_codex":0.000050607465,"about_ca_topic_score_gemma":0.000002606704,"teacher_disagreement_score":0.6631312,"about_ca_system_score_codex":0.000007935333,"about_ca_system_score_gemma":0.000028591137,"threshold_uncertainty_score":0.30800936},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012780509155064247,"score_gpt":0.21787180460326577,"score_spread":0.20509129544820154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136331652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811173,0.00023344693,0.011675966,0.0011443556,0.00014266158,0.00010866259,0.000011169425,0.00013658362,0.0054298737],"genre_scores_gemma":[0.9883975,0.000011935368,0.011153657,0.00026988896,0.00003992436,0.0000024979647,0.0000027223407,0.000009848837,0.00011204474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989106,0.00009919216,0.00020145084,0.00031075385,0.00024082836,0.00023719255],"domain_scores_gemma":[0.9985266,0.00016149067,0.000095129835,0.0010745409,0.00003461496,0.00010763663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002284464,0.00013240926,0.00021067941,0.000061716724,0.000048516766,0.00006241247,0.00091873383,0.00005471157,0.000058886213],"category_scores_gemma":[0.00010437374,0.00011352282,0.00004783822,0.00014280096,0.0002692382,0.00014539258,0.0005605726,0.00008743601,0.000013513487],"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.000010285693,0.000114229326,0.0009858486,0.000048270143,0.000028325736,0.0000059959516,0.0023298291,0.0000017734866,0.026536927,0.91724205,0.00203861,0.050657846],"study_design_scores_gemma":[0.0030904629,0.0009272885,0.42451176,0.0002303673,0.00005443314,0.00007691933,0.00043471274,0.095190756,0.10431217,0.33601838,0.03373269,0.0014200538],"about_ca_topic_score_codex":0.00010207894,"about_ca_topic_score_gemma":0.000014757135,"teacher_disagreement_score":0.58122367,"about_ca_system_score_codex":0.000010551462,"about_ca_system_score_gemma":0.000014212273,"threshold_uncertainty_score":0.46293262},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011980022641201264,"score_gpt":0.25367416798842124,"score_spread":0.24169414534721997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537925488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108017,0.0005949449,0.040324353,0.0032238727,0.00011313598,0.00017056061,0.00006398448,0.00025261848,0.044454835],"genre_scores_gemma":[0.99645835,0.00003694674,0.0031478044,0.00009614462,0.000009410456,0.0000031797977,0.00000336241,0.0000034120726,0.00024138838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995918,0.000039774408,0.0000889314,0.00010910456,0.000079851954,0.00009050824],"domain_scores_gemma":[0.9994159,0.00022263546,0.00003982131,0.0002588432,0.000021669772,0.00004115547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047926962,0.00005370245,0.000081378865,0.000036631856,0.00005463985,0.000034062545,0.00022152314,0.000024038194,0.00018112465],"category_scores_gemma":[0.000045029803,0.00004871352,0.000017457196,0.00012249869,0.00008996564,0.00016112266,0.00009928811,0.00004592888,0.000014824061],"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":[6.595057e-7,0.00021649829,0.003200632,0.000019318495,0.000034375767,0.000007785729,0.004777535,0.0000054713696,0.01996719,0.9465969,0.0058712685,0.019302333],"study_design_scores_gemma":[0.0022410527,0.0005937828,0.5735973,0.00019275218,0.00010764835,0.00018610754,0.0013307375,0.18167773,0.052350942,0.15038264,0.035897005,0.0014422906],"about_ca_topic_score_codex":0.000021113221,"about_ca_topic_score_gemma":0.00000382495,"teacher_disagreement_score":0.7962143,"about_ca_system_score_codex":0.0000039492334,"about_ca_system_score_gemma":0.000003692068,"threshold_uncertainty_score":0.19864796},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019023756742540792,"score_gpt":0.25754122198324414,"score_spread":0.23851746524070336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610921159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94132644,0.0009816972,0.002147104,0.00508575,0.00022965421,0.0003069393,0.000040208302,0.00023254564,0.049649686],"genre_scores_gemma":[0.979353,0.000056953417,0.019767987,0.00012682396,0.000063237945,0.0000065369873,0.000003085669,0.000012674253,0.0006096966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871033,0.00007110121,0.00023346936,0.00041274683,0.0002811008,0.00029126435],"domain_scores_gemma":[0.99689275,0.00012005629,0.00023838601,0.002572962,0.00005430492,0.00012152128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031561186,0.00016991804,0.00027343645,0.00005388595,0.00024878207,0.00026350206,0.0023731727,0.00008454267,0.000071209164],"category_scores_gemma":[0.00019681896,0.00014155306,0.000059308113,0.000054043536,0.00061475515,0.00042326664,0.0013536152,0.00011937288,0.000015410988],"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.00002228444,0.00014835747,0.0018402319,0.00008591104,0.000070374845,0.000042888263,0.00088672654,6.1532666e-7,0.014488529,0.94586265,0.010732659,0.02581877],"study_design_scores_gemma":[0.0019960399,0.00032909907,0.42722255,0.00021845016,0.000059598042,0.000099735844,0.00008776451,0.0060540666,0.053246684,0.4841343,0.025823105,0.0007286196],"about_ca_topic_score_codex":0.00033765537,"about_ca_topic_score_gemma":0.000051107832,"teacher_disagreement_score":0.46172836,"about_ca_system_score_codex":0.000011995089,"about_ca_system_score_gemma":0.000028661805,"threshold_uncertainty_score":0.57723665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046735925933064644,"score_gpt":0.3035491491656458,"score_spread":0.25681322323258116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611921753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96831316,0.0000196759,0.000023822462,0.010360661,0.0002683186,0.00029973444,0.0000049333107,0.000021460599,0.020688212],"genre_scores_gemma":[0.998757,0.000006308986,0.00006096946,0.00031173686,0.000037144047,0.000037151895,4.5108348e-7,0.00002152415,0.00076769816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882203,0.00025092394,0.00029631518,0.00019684872,0.00016658648,0.00026729677],"domain_scores_gemma":[0.99708325,0.0012461032,0.000253591,0.0013556195,0.000030030391,0.00003138407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044116034,0.00014304984,0.00027280647,0.000030683066,0.0002556213,0.000021264876,0.0012407451,0.00015998399,0.00026902696],"category_scores_gemma":[0.0011455667,0.0000791625,0.00009429372,0.00005009779,0.0008678968,0.000032342286,0.00021044396,0.00035727516,0.0000341094],"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.00004476183,0.00016607813,0.0013084365,0.0000145270105,0.000034377863,0.0000095673795,0.0013610518,0.0000017700952,0.0016085483,0.99364066,0.0010824484,0.00072776503],"study_design_scores_gemma":[0.00065799576,0.00011192137,0.111678764,0.000045189714,0.00003909117,0.00002356058,0.00028035117,0.00017307138,0.008655544,0.8776486,0.00052521704,0.00016071694],"about_ca_topic_score_codex":0.00029033064,"about_ca_topic_score_gemma":0.00045000773,"teacher_disagreement_score":0.11599209,"about_ca_system_score_codex":0.000020255547,"about_ca_system_score_gemma":0.000047990172,"threshold_uncertainty_score":0.3228153},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0825713404205394,"score_gpt":0.34630335875625046,"score_spread":0.263732018335711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620910963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97140616,0.0016707042,0.02012242,0.00023074185,0.00010715742,0.0002187,0.0000035103033,0.00001551203,0.006225074],"genre_scores_gemma":[0.9201032,0.000013866138,0.07926178,0.00007743737,0.000089965186,0.000010835508,0.000011550255,0.000008195,0.000423185],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938935,0.00008739054,0.00015355108,0.00017623359,0.000045285477,0.00014820934],"domain_scores_gemma":[0.9995888,0.000036214748,0.00006118321,0.00014921576,0.00010793346,0.00005663702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041146218,0.00008117285,0.00012878289,0.0000125731785,0.000024920877,0.000008607032,0.00013392148,0.000096086034,0.000002300708],"category_scores_gemma":[0.0006966279,0.000057124096,0.000060232534,0.000036970487,0.00008777029,0.000001550111,0.000106851425,0.000038001603,0.0000012358561],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00007614181,0.000026279586,0.00044461357,0.000011808988,0.00002439214,8.655761e-8,0.000057205983,0.0000054106217,0.98549473,0.0004601281,0.00059675536,0.012802435],"study_design_scores_gemma":[0.00034876095,0.00054750004,0.00034610918,0.000020698635,0.00001784943,0.000004520813,0.00008470844,0.00042698704,0.90316886,0.00094438164,0.09396214,0.00012749109],"about_ca_topic_score_codex":0.0000065998834,"about_ca_topic_score_gemma":0.0000014898045,"teacher_disagreement_score":0.093365386,"about_ca_system_score_codex":0.0000042226116,"about_ca_system_score_gemma":0.00003380821,"threshold_uncertainty_score":0.2329453},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013552227123162258,"score_gpt":0.23519598568459182,"score_spread":0.22164375856142957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998629909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69761527,0.00010146228,0.29869843,0.002663429,0.00018459442,0.00017495736,0.0000016057838,0.00016273359,0.00039751828],"genre_scores_gemma":[0.99389756,0.00000647359,0.00561005,0.00034610328,0.000038603666,0.0000059370836,0.000007315386,0.000011971312,0.000075968164],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998929,0.00007866212,0.00026930447,0.00033058602,0.00020065285,0.0001917837],"domain_scores_gemma":[0.9994579,0.00014650011,0.000087420136,0.00022105518,0.000039277766,0.00004784252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094457326,0.00013014622,0.0001915322,0.000044455708,0.000057733967,0.00018386003,0.00028317326,0.00006635813,0.0000120712175],"category_scores_gemma":[0.00006960589,0.00011643981,0.000025403291,0.00019496468,0.00002391893,0.00033842082,0.00013598402,0.00013363764,0.000011002048],"study_design_candidate":"simulation_or_modeling","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.000087395,0.0005661397,0.44850874,0.0007782376,0.0003011511,0.0000759046,0.07350997,0.024391947,0.016611753,0.27325192,0.0021589058,0.15975796],"study_design_scores_gemma":[0.00045923784,0.000019111327,0.040086962,0.000035920188,0.0000035841822,0.0000019092354,0.000058450038,0.95821136,0.00006774816,0.0008519175,0.000068114314,0.0001356638],"about_ca_topic_score_codex":0.00026614623,"about_ca_topic_score_gemma":0.000076955424,"teacher_disagreement_score":0.9338194,"about_ca_system_score_codex":0.00005529272,"about_ca_system_score_gemma":0.00001583449,"threshold_uncertainty_score":0.47482777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056540594333578414,"score_gpt":0.2959740899431766,"score_spread":0.23943349560959817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081143976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032386236,0.000043007716,0.9640559,0.00076993497,0.00007904704,0.00025308094,0.0000020539374,0.0003304383,0.0020802922],"genre_scores_gemma":[0.9087113,7.07162e-7,0.09076364,0.00044303914,0.00004570599,0.0000041964777,0.0000011735284,0.0000146423035,0.000015554091],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998677,0.00013829583,0.00036808042,0.00032308005,0.0003029693,0.00019055445],"domain_scores_gemma":[0.9988683,0.0002129561,0.00018818074,0.0005059196,0.000118515985,0.00010615636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019862026,0.00013377759,0.00022843397,0.00007479377,0.000029433377,0.00005872111,0.00077345176,0.0000829169,0.000029261228],"category_scores_gemma":[0.0001647859,0.00013236089,0.00008203338,0.00036113444,0.000048773185,0.00023722465,0.00017822247,0.000108112225,0.000018264214],"study_design_candidate":"simulation_or_modeling","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.00014181183,0.00039981672,0.0027006532,0.00075981434,0.00016420933,0.000091698064,0.009989001,0.083528504,0.8142807,0.041240122,0.00427761,0.042426083],"study_design_scores_gemma":[0.00017147562,0.00015484684,0.00017396905,0.0000831566,0.000009059111,0.0000018789233,0.000008084669,0.93008745,0.06758137,0.0006625065,0.00092733285,0.00013888504],"about_ca_topic_score_codex":0.000044128632,"about_ca_topic_score_gemma":0.0000014535096,"teacher_disagreement_score":0.8763251,"about_ca_system_score_codex":0.000043844906,"about_ca_system_score_gemma":0.00007389095,"threshold_uncertainty_score":0.539752},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Library science; Political science; Philosophy; Computer science","score_opus":0.010602519344563018,"score_gpt":0.2262806912629306,"score_spread":0.21567817191836758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379535338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6474099,0.00019572684,0.09252324,0.01933416,0.0026460262,0.0005711457,0.000010023416,0.0053055924,0.23200414],"genre_scores_gemma":[0.99099773,0.000016333568,0.004259527,0.00022648818,0.000041351777,0.000008986881,0.0000016641209,0.000006541986,0.004441373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992392,0.00003866328,0.0000861632,0.00023311093,0.00015026642,0.00025258143],"domain_scores_gemma":[0.9993318,0.00009733612,0.000020216703,0.00045591837,0.0000184113,0.000076331184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018772788,0.00007431347,0.0000699432,0.00007027251,0.00007034114,0.00007880658,0.00072122185,0.000033037402,0.000051520245],"category_scores_gemma":[0.00003405723,0.000066143584,0.000040837713,0.0006008298,0.000038716786,0.00017047244,0.00024587786,0.00007627891,0.0014819703],"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.0000028166412,0.000042163327,0.00022704544,0.000007131996,0.00002077191,0.000051156854,0.0012560351,0.000030237024,0.004377318,0.9111837,0.021645805,0.06115582],"study_design_scores_gemma":[0.0006963988,0.0002132897,0.05092945,0.00003678071,0.000013345227,0.00004638655,0.00009251581,0.06550406,0.015158953,0.54399014,0.3225801,0.0007385663],"about_ca_topic_score_codex":0.0000030228746,"about_ca_topic_score_gemma":5.786316e-7,"teacher_disagreement_score":0.36719355,"about_ca_system_score_codex":0.0000048154284,"about_ca_system_score_gemma":0.0000148262225,"threshold_uncertainty_score":0.9992955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008254940453334412,"score_gpt":0.2102712785417305,"score_spread":0.20201633808839609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95660754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97433937,0.0011538606,0.0014073296,0.013320512,0.000029701496,0.00020158115,0.0000020456775,0.0002469424,0.009298649],"genre_scores_gemma":[0.9923858,0.000018749686,0.0052601323,0.0012334754,0.000036450852,0.000006179196,0.0000010719583,0.0000071065792,0.0010510286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992825,0.00004909282,0.000100648926,0.00027141414,0.00011271184,0.00018365258],"domain_scores_gemma":[0.9993818,0.00006486171,0.000029124047,0.00041017617,0.000029099348,0.00008498295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013220857,0.000119502416,0.00012189603,0.000062652674,0.00008517001,0.00013059094,0.00033705868,0.000038863043,0.000018362298],"category_scores_gemma":[0.000031758107,0.00007370957,0.000017317272,0.00019156211,0.000051080326,0.0002071623,0.00009375322,0.0000890253,0.000033261967],"study_design_candidate":"observational","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.00031720902,0.0004678308,0.0067106965,0.000046433357,0.0001471733,0.00024537093,0.04101469,0.00007988358,0.16473714,0.5520362,0.045665745,0.18853164],"study_design_scores_gemma":[0.0026171273,0.006428465,0.7279903,0.0008942821,0.00006332283,0.00066269265,0.00380099,0.015401267,0.084121406,0.047854483,0.107696496,0.0024691164],"about_ca_topic_score_codex":0.00001386383,"about_ca_topic_score_gemma":0.000004672143,"teacher_disagreement_score":0.7212797,"about_ca_system_score_codex":0.000011138595,"about_ca_system_score_gemma":0.000026806178,"threshold_uncertainty_score":0.3005789},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019033051428707426,"score_gpt":0.2841289702447476,"score_spread":0.26509591881604017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97986267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98496175,0.000098056655,0.008420134,0.00076042773,0.00007636132,0.0002759339,9.930086e-7,0.000050063984,0.0053562797],"genre_scores_gemma":[0.98529047,0.00007518221,0.0140101025,0.00030247399,0.000010969378,0.000024171411,4.582402e-7,0.000014969226,0.0002712278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983884,0.00017094657,0.00020318328,0.00052235456,0.00026118182,0.00045395168],"domain_scores_gemma":[0.9989366,0.0002443763,0.000046037527,0.00050823664,0.00002548942,0.00023926249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052421546,0.00015162778,0.00019545054,0.00023397959,0.0001799116,0.00023844227,0.0017373351,0.000045594832,0.000042471107],"category_scores_gemma":[0.00012700401,0.00014582697,0.000040362604,0.00041344017,0.0002373323,0.0008456219,0.00154657,0.00033651522,0.000013118775],"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.0003280782,0.00020382767,0.34496546,0.00007100437,0.00012409117,0.0019275743,0.04396439,0.0001504547,0.036798757,0.5062793,0.0014352509,0.06375182],"study_design_scores_gemma":[0.0048095253,0.000726781,0.43636113,0.00053019315,0.000015643998,0.0018405824,0.0013778852,0.01877086,0.0059200977,0.5224966,0.005323885,0.0018268224],"about_ca_topic_score_codex":0.00034958657,"about_ca_topic_score_gemma":0.000059698672,"teacher_disagreement_score":0.09139567,"about_ca_system_score_codex":0.00004511463,"about_ca_system_score_gemma":0.00006402342,"threshold_uncertainty_score":0.5946651},"labels":[],"label_agreement":null}]}