{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21719673,0.0007707963,0.74635476,0.00060556945,0.00023691813,0.00031426657,0.00043167625,0.00086871436,0.033220507],"genre_scores_gemma":[0.8493812,0.00039378268,0.14227587,0.00021010877,0.00014603444,0.0002305939,0.00036754776,0.00014927516,0.0068455124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697185,0.0007065345,0.00034134559,0.0006634737,0.0009705284,0.00034623744],"domain_scores_gemma":[0.9886874,0.0061592446,0.00077374413,0.0023181278,0.001276544,0.00078494684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038007626,0.00037360468,0.000517233,0.001965129,0.0021327264,0.0026800819,0.0009064923,0.0009273399,0.0036488357],"category_scores_gemma":[0.013084275,0.00057069556,0.001335642,0.0009994983,0.004874217,0.008926979,0.0032623052,0.0019333315,0.0005838661],"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.00009082099,0.000037145393,0.0021355385,0.00010424373,0.000024003486,0.00019572038,0.001172492,0.0010475327,0.004787478,0.9497957,0.0006464387,0.039962888],"study_design_scores_gemma":[0.00002029073,0.00010162796,0.001712286,0.00007357823,0.00006556352,0.0012776437,0.0007847446,0.009974878,0.014123733,0.95842665,0.013385262,0.000053812044],"about_ca_topic_score_codex":0.0011335711,"about_ca_topic_score_gemma":0.00082059775,"teacher_disagreement_score":0.0038007626,"about_ca_system_score_codex":0.0012352166,"about_ca_system_score_gemma":0.00096216716,"threshold_uncertainty_score":0.020100594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9195275,0.00041449937,0.06911574,0.0005876043,0.000034770525,0.00007280236,0.0010222867,0.0004139651,0.008810855],"genre_scores_gemma":[0.9817146,0.00017087148,0.014321378,0.00007039467,0.00003829957,0.0000936327,0.0009664284,0.000081400016,0.002543073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813145,0.00020313969,0.00021157338,0.0004944071,0.00046722192,0.00049223355],"domain_scores_gemma":[0.9926045,0.004474961,0.00059007667,0.00079038466,0.00084136816,0.0006987051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075736333,0.00041538032,0.00074418954,0.0010799658,0.0009770641,0.0025024072,0.0011671281,0.00062705955,0.005607007],"category_scores_gemma":[0.007128185,0.0002608071,0.0012227881,0.0007891569,0.0020844173,0.0056597986,0.0018779347,0.0011296016,0.00037576607],"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.001538624,0.00023877367,0.01727074,0.00048265222,0.00010273604,0.0006493173,0.0033236057,0.08102396,0.04132326,0.7978188,0.004230615,0.0519969],"study_design_scores_gemma":[0.000052853444,0.00013892663,0.003297716,0.000026176032,0.00006514702,0.00042576948,0.00033570008,0.22505188,0.015442255,0.75219125,0.0028889577,0.000083517225],"about_ca_topic_score_codex":0.0029710466,"about_ca_topic_score_gemma":0.0018016187,"teacher_disagreement_score":0.005607007,"about_ca_system_score_codex":0.0025425158,"about_ca_system_score_gemma":0.0019623674,"threshold_uncertainty_score":0.018757343},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22938927,0.0015809529,0.6862778,0.001334258,0.00035891193,0.0002493357,0.0007416091,0.00065717526,0.079410695],"genre_scores_gemma":[0.8554912,0.0007582799,0.12452611,0.00040651092,0.0003260189,0.00035574092,0.0009354139,0.00016120018,0.01703953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967271,0.00076956436,0.0004033504,0.0011161652,0.00048203184,0.0005016877],"domain_scores_gemma":[0.99488056,0.0025630982,0.00042085952,0.0008737152,0.0008770311,0.0003846648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031905412,0.0005620278,0.0007103677,0.0012047844,0.001906747,0.002866698,0.0005637739,0.0011174941,0.011424503],"category_scores_gemma":[0.0066853166,0.00067086244,0.0013621398,0.00066544855,0.00486068,0.007419437,0.0022177398,0.001727333,0.0016540595],"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.000042532756,0.00001404797,0.00019451154,0.0000396711,0.0000057761276,0.00014528172,0.00060895015,0.00049535325,0.0018434899,0.9908886,0.0005944418,0.0051272903],"study_design_scores_gemma":[0.000017599272,0.0000369545,0.00015249352,0.000025112538,0.000008376448,0.0002514529,0.00021112734,0.0034632527,0.0019855022,0.98741686,0.0064135683,0.000017682685],"about_ca_topic_score_codex":0.00084809045,"about_ca_topic_score_gemma":0.0006128305,"teacher_disagreement_score":0.011424503,"about_ca_system_score_codex":0.0010848396,"about_ca_system_score_gemma":0.000842566,"threshold_uncertainty_score":0.038218796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85647583,0.0004103441,0.12927082,0.0012403071,0.000028326838,0.00007972518,0.0010888036,0.00037888714,0.011026955],"genre_scores_gemma":[0.9725558,0.00018608171,0.02372886,0.00008928912,0.0000702987,0.00011913853,0.0007999166,0.00010227602,0.0023483294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962697,0.0007558232,0.00045513822,0.00079566793,0.0011677562,0.0005559268],"domain_scores_gemma":[0.966653,0.025300113,0.0023315402,0.0023028478,0.001765037,0.0016474373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023485615,0.00047128418,0.0010019214,0.0013369495,0.0010476311,0.0049003363,0.0015221374,0.0009488043,0.0037418832],"category_scores_gemma":[0.017880086,0.0005784983,0.0013732826,0.0010648551,0.0034919889,0.008757094,0.002406621,0.0015691633,0.0003570523],"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.00095625094,0.0001875822,0.009948878,0.00037963397,0.00011420397,0.0005835252,0.0027941219,0.104525216,0.018705599,0.83737457,0.0019906494,0.022439862],"study_design_scores_gemma":[0.00004615451,0.00008822669,0.0021374729,0.00002733662,0.000046922934,0.0004118409,0.00033984784,0.29709587,0.009117002,0.68897516,0.0016498588,0.000064357846],"about_ca_topic_score_codex":0.0013841927,"about_ca_topic_score_gemma":0.00090076204,"teacher_disagreement_score":0.0049003363,"about_ca_system_score_codex":0.0024966553,"about_ca_system_score_gemma":0.0017342139,"threshold_uncertainty_score":0.018114626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2827607,0.0015532938,0.6257382,0.002558666,0.00022251529,0.0002279476,0.0021855042,0.0009308735,0.08382228],"genre_scores_gemma":[0.86374867,0.0009001419,0.118370526,0.0006094941,0.00025367038,0.00026408304,0.0027621468,0.00025258577,0.012838641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996666,0.0009507944,0.000386766,0.00070542376,0.0009395332,0.00035143702],"domain_scores_gemma":[0.9879589,0.0057000523,0.00059190474,0.0020807425,0.003193816,0.00047459366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007070973,0.0006771526,0.0013040769,0.0024068833,0.0025627546,0.0037971241,0.0015410396,0.0014343706,0.00544431],"category_scores_gemma":[0.008482777,0.0007528462,0.0017620953,0.0016201856,0.0063286074,0.016139966,0.0054164813,0.0031672162,0.0010820043],"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.000043187454,0.000039471597,0.0006104229,0.00014821251,0.000023607,0.00012613696,0.00074609666,0.0011007593,0.00094017084,0.9868951,0.0010336372,0.008293158],"study_design_scores_gemma":[0.000024081875,0.00005595067,0.0010905842,0.00003972051,0.000028567352,0.00027282085,0.00034644466,0.0059849,0.0026749312,0.980755,0.008689495,0.000037595506],"about_ca_topic_score_codex":0.0031862676,"about_ca_topic_score_gemma":0.0036008921,"teacher_disagreement_score":0.007070973,"about_ca_system_score_codex":0.001469664,"about_ca_system_score_gemma":0.002542846,"threshold_uncertainty_score":0.037395358},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011753934,0.00060695125,0.97581416,0.0009112443,0.00014116542,0.00012507624,0.00017916327,0.0005319835,0.009936345],"genre_scores_gemma":[0.34530288,0.0017128787,0.64014065,0.00091994315,0.0013881158,0.0011805508,0.0010448812,0.0009462843,0.007363866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9760833,0.009895924,0.0021968333,0.0052417195,0.0048990916,0.0016830972],"domain_scores_gemma":[0.9340982,0.04304843,0.0033731274,0.0152397845,0.0035771134,0.0006634013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019617489,0.0016333199,0.001701338,0.0066051665,0.0026710338,0.007646681,0.003911623,0.0030305898,0.0051890905],"category_scores_gemma":[0.053525314,0.0015197746,0.007743719,0.0032152766,0.014278302,0.01823257,0.011019167,0.009065188,0.0012529471],"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.000034690922,0.000016444912,0.00028148261,0.00010742438,0.00003604679,0.00004452602,0.00066088646,0.005021638,0.0005972693,0.9821062,0.00064185687,0.010451678],"study_design_scores_gemma":[0.000013960452,0.0000281811,0.000083728846,0.000051183684,0.00003610548,0.000068435846,0.00012822644,0.012842214,0.0015844584,0.97959375,0.0055334764,0.000036363337],"about_ca_topic_score_codex":0.0013900878,"about_ca_topic_score_gemma":0.00079880224,"teacher_disagreement_score":0.019617489,"about_ca_system_score_codex":0.0053218137,"about_ca_system_score_gemma":0.0021180897,"threshold_uncertainty_score":0.10374838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011698513,0.00015106624,0.9743381,0.0002470496,0.00010352295,0.00004810125,0.000065255255,0.00019470626,0.0131536815],"genre_scores_gemma":[0.30735427,0.00033769643,0.67508316,0.00017889259,0.00007639457,0.00016723291,0.00015990136,0.0002112865,0.016431125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998042,0.000059463393,0.000008672207,0.000025877318,0.00009042095,0.000011300425],"domain_scores_gemma":[0.9998259,0.00005520793,0.000024047406,0.000039653292,0.00003751417,0.000017595237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035060084,0.00039045233,0.00039226832,0.00045574014,0.00046008173,0.00074042164,0.0007364738,0.0005753055,0.004483674],"category_scores_gemma":[0.0008127367,0.00020958354,0.0005960609,0.00032005104,0.00083421264,0.0008448275,0.0012029232,0.00085845304,0.00069629634],"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.000047122565,0.000059434646,0.0011170289,0.00022830194,0.00005289767,0.00027635857,0.00043033974,0.3858103,0.014272664,0.52322006,0.0038718686,0.07061357],"study_design_scores_gemma":[0.00001498863,0.00002829508,0.00015227898,0.00001555331,0.0000044555713,0.00008318997,0.000032540393,0.9419722,0.0011102647,0.044150576,0.012424554,0.000011073107],"about_ca_topic_score_codex":0.002291158,"about_ca_topic_score_gemma":0.0028149423,"teacher_disagreement_score":0.004483674,"about_ca_system_score_codex":0.000429347,"about_ca_system_score_gemma":0.00062199455,"threshold_uncertainty_score":0.01499939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17715539,0.00017116556,0.78916705,0.00013030384,0.00010394536,0.0001243266,0.0010295578,0.01252762,0.019590683],"genre_scores_gemma":[0.8332311,0.00012599386,0.16100241,0.00004232067,0.000009545822,0.0002584181,0.00071553566,0.0008857795,0.0037288817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998253,0.00004176876,0.000012664413,0.000024182158,0.000069500005,0.00002660971],"domain_scores_gemma":[0.9995933,0.00023979496,0.000037180587,0.000050835686,0.000057793834,0.000021044447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036846596,0.00033265597,0.0003097919,0.00030612107,0.00021292653,0.00045899866,0.0006886661,0.00036714075,0.005689556],"category_scores_gemma":[0.001045348,0.0002293208,0.00038874592,0.00014744469,0.00033965133,0.00035840043,0.00060276676,0.00051042525,0.00044156765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00013342845,0.000032134914,0.0017196679,0.00015311294,0.000022975273,0.00013294602,0.00016457807,0.9628179,0.0072268513,0.012038539,0.0012119076,0.014346011],"study_design_scores_gemma":[0.000019377661,0.00004268629,0.00027216622,0.000016631246,0.000006571994,0.00003204919,0.000018883415,0.9888827,0.0054190583,0.002022695,0.0032590625,0.00000813232],"about_ca_topic_score_codex":0.0019652853,"about_ca_topic_score_gemma":0.0015179941,"teacher_disagreement_score":0.005689556,"about_ca_system_score_codex":0.00033502548,"about_ca_system_score_gemma":0.0005480836,"threshold_uncertainty_score":0.019033492},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001810855,0.012117647,0.008382005,0.043449115,0.20789056,0.0007142028,0.019312838,0.003027989,0.7032948],"genre_scores_gemma":[0.010098883,0.008725048,0.0042250664,0.009570042,0.03669656,0.00049988634,0.021043338,0.0019721342,0.907169],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983479,0.0002460076,0.00014808938,0.00033069734,0.0007581333,0.00016925907],"domain_scores_gemma":[0.99344784,0.00088090036,0.000266947,0.0006481479,0.003675585,0.0010806498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020419357,0.0013317182,0.001081401,0.0029492318,0.0029259583,0.0051369634,0.0019678916,0.002029169,0.55799377],"category_scores_gemma":[0.01468184,0.00042123164,0.0009082062,0.002534922,0.0009307572,0.004507539,0.0029077774,0.0034789382,0.42579007],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000027523785,0.000013334777,0.00009022009,0.00010810109,0.0000024939372,0.00004371842,0.00008185556,0.000050052673,0.000072615236,0.0036390887,0.9647797,0.031091338],"study_design_scores_gemma":[0.0000041223566,0.000013153165,0.00021022838,0.00011160843,0.000001518138,0.00006292756,0.00008501693,0.00002531799,0.000046942478,0.0016517821,0.9977829,0.00000451229],"about_ca_topic_score_codex":0.002893073,"about_ca_topic_score_gemma":0.0029308146,"teacher_disagreement_score":0.55799377,"about_ca_system_score_codex":0.0025751719,"about_ca_system_score_gemma":0.002958025,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5207175,0.00164776,0.38714218,0.0015951558,0.00024063187,0.00020634652,0.0014526739,0.0006352557,0.086362466],"genre_scores_gemma":[0.9152223,0.0008587485,0.06764612,0.00030107787,0.00038376282,0.00036541422,0.0013375134,0.00022750818,0.013657672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968622,0.00069128984,0.00037248625,0.0006955675,0.0009789253,0.0003995596],"domain_scores_gemma":[0.99247676,0.0040712417,0.0008615886,0.00081133615,0.0011696981,0.0006093727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016887916,0.0006193671,0.00068278523,0.0022256593,0.0020463879,0.0044310275,0.0007949686,0.00079166616,0.0041003907],"category_scores_gemma":[0.008576796,0.0006280839,0.0011097905,0.0015365126,0.006097137,0.0060569793,0.002287034,0.0015945815,0.0006257617],"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.000046922767,0.000018477844,0.00033833142,0.00004101976,0.00001115779,0.00025574255,0.0009956768,0.0018011796,0.0025178867,0.98668194,0.0005026961,0.006788984],"study_design_scores_gemma":[0.000024066574,0.00004641697,0.0005593818,0.000039640603,0.000015813152,0.00077806145,0.000577419,0.011648617,0.0025572928,0.9741779,0.009541263,0.000034028173],"about_ca_topic_score_codex":0.0022165184,"about_ca_topic_score_gemma":0.0011853041,"teacher_disagreement_score":0.0044310275,"about_ca_system_score_codex":0.0014776052,"about_ca_system_score_gemma":0.0014453522,"threshold_uncertainty_score":0.0137171745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83228695,0.0007642182,0.14616938,0.0003170635,0.00005536036,0.00004616039,0.00022457112,0.0002995941,0.019836701],"genre_scores_gemma":[0.9768529,0.00032040948,0.018464036,0.000053220483,0.000031313903,0.000044285316,0.00022643665,0.00005058593,0.003956803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996897,0.00004585829,0.000018550898,0.000080804595,0.00007099624,0.00009406828],"domain_scores_gemma":[0.9980348,0.0010428703,0.0003549703,0.00016409706,0.0001523392,0.00025095922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034335547,0.00029317572,0.00047869817,0.0013807939,0.00076954195,0.0018081194,0.00064122694,0.00061339414,0.004243017],"category_scores_gemma":[0.0031117096,0.00038285865,0.00042977527,0.0008490996,0.0015676909,0.0030435477,0.0016461735,0.00077069993,0.00040797543],"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.00026086386,0.000041444502,0.0021137006,0.00014601715,0.000025658757,0.00045128717,0.00069933763,0.0068550226,0.012444418,0.9581814,0.001240389,0.017540459],"study_design_scores_gemma":[0.000052971398,0.000090230016,0.0017005146,0.000048164544,0.000045437184,0.00076945114,0.00071849365,0.031075314,0.008218973,0.95189273,0.0053614653,0.000026310117],"about_ca_topic_score_codex":0.0005486983,"about_ca_topic_score_gemma":0.0005970428,"teacher_disagreement_score":0.004243017,"about_ca_system_score_codex":0.00040655312,"about_ca_system_score_gemma":0.00026974958,"threshold_uncertainty_score":0.01419431},"labels":[],"label_agreement":null}]}