{"meta":{"query_hash":"6f385c39db7e","filters":{"venue":"Acta Informatica"},"cohort_total":29,"direct_labels_cover":0,"predictions_cover":29,"exported":29,"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/6f385c39db7e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Acta+Informatica"},"results":[{"id":"W1966644481","doi":"10.1007/s00236-007-0041-4","title":"The syntactic monoid of hairpin-free languages","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA computing; String (physics); Formal language; Computer science; Rewriting; DNA; Free monoid; Alphabet; Context (archaeology); Characterization (materials science); Mathematics; Discrete mathematics; Monoid; Physics; Algorithm; Biology; Genetics; Programming language; Linguistics; Theoretical physics","score_opus":0.005987572387986165,"score_gpt":0.24978094973339865,"score_spread":0.24379337734541248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966644481","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.9512791,0.00020442331,0.0008404809,0.0002501838,0.000068062414,0.00008897275,0.0000028024194,0.000012353597,0.047253612],"genre_scores_gemma":[0.9986999,0.000041791827,0.0007821446,0.00024173752,0.00007027303,0.0000014296824,0.000011330063,0.0000033768088,0.00014800463],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941653,0.000012574319,0.00023654649,0.000059904523,0.00008340685,0.00019103875],"domain_scores_gemma":[0.9994063,0.00008686449,0.0001016082,0.0003274016,0.00003959714,0.000038233622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039021528,0.000070281305,0.00007410707,0.000013322977,0.000087312,0.000022014761,0.00033124315,0.0000711143,0.0000064998444],"category_scores_gemma":[0.0004885424,0.000040141036,0.000053566728,0.00004912591,0.00007444649,0.00000540809,0.00019300237,0.00006229796,0.000008036785],"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.0004209355,0.00013593203,0.006778725,0.00016560267,0.00025000895,0.0000073294987,0.00061692996,0.000015561309,0.82105225,0.007914195,0.014683615,0.1479589],"study_design_scores_gemma":[0.0008202824,0.0009348248,0.029540591,0.000043319607,0.000032625758,0.000046698893,0.0032255156,0.00028632267,0.6382055,0.0005826581,0.32587242,0.00040924628],"about_ca_topic_score_codex":0.0000046499913,"about_ca_topic_score_gemma":0.0000095507085,"teacher_disagreement_score":0.3111888,"about_ca_system_score_codex":0.0000038884573,"about_ca_system_score_gemma":0.000014455478,"threshold_uncertainty_score":0.1636904},"labels":[],"label_agreement":null},{"id":"W1982010621","doi":"10.1007/s00236-006-0030-z","title":"On Abelian 2-avoidable binary patterns","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Theory of computation; Binary number; Abelian group; Computer science; Mathematics; Combinatorics; Algorithm; Arithmetic","score_opus":0.00457864365006878,"score_gpt":0.19233578705940937,"score_spread":0.1877571434093406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982010621","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.80007297,0.000025051733,0.05108546,0.0024407313,0.0005223607,0.000288657,0.000014705925,0.0008117633,0.14473833],"genre_scores_gemma":[0.9937164,0.0000034625507,0.003795652,0.0019208629,0.000043111457,0.000013129284,0.000010234164,0.0000066937237,0.00049042475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904597,0.000017676182,0.0002685966,0.00012496016,0.00023846042,0.00030435916],"domain_scores_gemma":[0.9991037,0.00011881403,0.00008569308,0.0006097972,0.000021801912,0.000060183378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018093073,0.00012682348,0.00012211404,0.00011276854,0.00012586698,0.00021749857,0.00077281316,0.000049594528,0.00010353771],"category_scores_gemma":[0.000017411336,0.00010185787,0.000049805763,0.00020254575,0.000021124772,0.0010584595,0.0001828047,0.00011198844,0.00082791504],"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.0000118294065,0.00028681254,0.00066267897,0.000119978045,0.000024108322,0.000046098576,0.0012722188,0.00032279786,0.0010570384,0.84796965,0.1172798,0.030946985],"study_design_scores_gemma":[0.002405277,0.0011868158,0.04789502,0.0004997273,0.000024074254,0.0001617741,0.00040436297,0.568207,0.015306435,0.18305925,0.17890681,0.0019434388],"about_ca_topic_score_codex":0.000050895127,"about_ca_topic_score_gemma":0.0000024968488,"teacher_disagreement_score":0.6649104,"about_ca_system_score_codex":0.000029049277,"about_ca_system_score_gemma":0.000025451198,"threshold_uncertainty_score":0.99995005},"labels":[],"label_agreement":null},{"id":"W1984007424","doi":"10.1007/pl00013319","title":"Even faster generalized LR parsing","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parsing; LR parser; Parsing expression grammar; Computer science; Property (philosophy); Top-down parsing; Parser combinator; Constant (computer programming); Grammar; Theory of computation; Rule-based machine translation; Symbol (formal); Algorithm; Artificial intelligence; Natural language processing; Programming language; Context-free grammar; L-attributed grammar","score_opus":0.013972496769763204,"score_gpt":0.22945046893613433,"score_spread":0.21547797216637113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984007424","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.559592,0.000071323855,0.32984674,0.003860339,0.0006257072,0.00026007995,0.0000023941834,0.0006537932,0.105087616],"genre_scores_gemma":[0.9622141,0.000021774342,0.033679143,0.0034769236,0.000064052096,0.000009047437,0.0000044662934,0.0000068798486,0.0005236041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990576,0.000026400245,0.00028853086,0.00010983395,0.00020997267,0.00030768447],"domain_scores_gemma":[0.9991853,0.00006440959,0.00008615831,0.0005465903,0.000028114817,0.00008942796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023594385,0.00011435683,0.00014072128,0.00007569585,0.00010830789,0.0002471168,0.00073087064,0.000046424917,0.0001358577],"category_scores_gemma":[0.000029086625,0.00009240111,0.000055513363,0.00022214167,0.000026682317,0.0016868247,0.00022979299,0.00008611847,0.00045545347],"study_design_candidate":"design_other","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.00003790629,0.00016808684,0.0010962901,0.00010486184,0.00011585867,0.0000752243,0.019905189,0.00013273682,0.0037241378,0.27891597,0.0523417,0.643382],"study_design_scores_gemma":[0.0013095462,0.00011296999,0.003368207,0.000109265726,0.000015953796,0.00039217994,0.00032951712,0.5096484,0.0020913635,0.022708356,0.45920095,0.0007132968],"about_ca_topic_score_codex":0.00000723215,"about_ca_topic_score_gemma":7.434633e-7,"teacher_disagreement_score":0.6426687,"about_ca_system_score_codex":0.000022653054,"about_ca_system_score_gemma":0.000026579626,"threshold_uncertainty_score":0.5854085},"labels":[],"label_agreement":null},{"id":"W1984054760","doi":"10.1007/s00236-004-0157-8","title":"A deterministic skip list for k-dimensional range search","year":2005,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Nova Scotia Community College","funders":"","keywords":"Range (aeronautics); Data structure; Commutative property; Mathematics; Set (abstract data type); Theory of computation; Discrete mathematics; Combinatorics; Cartesian product; Extension (predicate logic); Associative property; Computer science; Algorithm; Pure mathematics","score_opus":0.021941126642092315,"score_gpt":0.26816769603582175,"score_spread":0.24622656939372944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984054760","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.013929379,0.000032230826,0.91831046,0.011350224,0.00064983947,0.0013639069,0.00008533199,0.0004959948,0.05378261],"genre_scores_gemma":[0.6267565,0.0000057313805,0.3671941,0.0034859045,0.000280281,0.00007569116,0.0000654791,0.000010671446,0.002125692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990036,0.000009999969,0.00025855136,0.00013363906,0.00027910358,0.0003151084],"domain_scores_gemma":[0.9991957,0.00014774984,0.000052165688,0.00046097423,0.000053067906,0.00009032492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033105508,0.00010510844,0.00011517617,0.00010323139,0.00014690153,0.000325624,0.00089954917,0.000029361365,0.0000614528],"category_scores_gemma":[0.00005692045,0.00008949316,0.00005435193,0.00015625378,0.000034522833,0.002028773,0.00041194088,0.000071153765,0.0003906628],"study_design_candidate":"design_other","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.000027502992,0.00016218047,0.00005989338,0.00022577634,0.00006066952,0.0000066681414,0.0018471992,0.0001251507,0.00004164601,0.08853278,0.18664901,0.72226155],"study_design_scores_gemma":[0.0005131248,0.000076558055,0.00024318858,0.000016181293,0.00000703854,0.0000058374503,0.000019929961,0.7006685,0.000109402376,0.00033945296,0.29784715,0.0001535841],"about_ca_topic_score_codex":0.0000032015962,"about_ca_topic_score_gemma":0.000002894811,"teacher_disagreement_score":0.72210795,"about_ca_system_score_codex":0.000023717288,"about_ca_system_score_gemma":0.000038610764,"threshold_uncertainty_score":0.50213104},"labels":[],"label_agreement":null},{"id":"W1984586534","doi":"10.1007/s002360000042","title":"The class Steiner minimal tree problem: a lower bound and test problem generation","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Linear programming relaxation; Theory of computation; Subgradient method; k-minimum spanning tree; Combinatorics; Discrete mathematics; Approximation algorithm; Time complexity; Integer programming; Tree (set theory); Heuristic; K-ary tree; Mathematical optimization; Algorithm; Binary tree; Tree structure","score_opus":0.007904042051019923,"score_gpt":0.19120084342983149,"score_spread":0.18329680137881157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984586534","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.523075,0.00037304658,0.0010763952,0.0013614185,0.00012033166,0.0015194709,0.00001947223,0.0013025374,0.47115234],"genre_scores_gemma":[0.9940793,0.00027022706,0.00413308,0.00012875773,0.00008149973,0.00011229175,0.000011420564,0.000020814685,0.0011626455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924004,0.000008122824,0.0003140474,0.0000667221,0.0001321091,0.00023896505],"domain_scores_gemma":[0.9996155,0.00008816999,0.000028413293,0.00018627764,0.000024955867,0.000056704273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015672075,0.00014035063,0.00010871695,0.000035105073,0.00015170002,0.0002411721,0.00012686111,0.00008192207,0.00008892612],"category_scores_gemma":[0.000017529988,0.000095738775,0.000027059159,0.00009230849,0.000053764885,0.0005356526,0.00001716446,0.00013240689,0.000065159606],"study_design_candidate":"not_applicable","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.000035114892,0.000092602124,0.00024523528,0.00038724838,0.00012161951,0.0000066630496,0.004076261,0.00023581862,0.028218692,0.0035015068,0.23360524,0.729474],"study_design_scores_gemma":[0.0007558152,0.0005757498,0.0008173962,0.00010411658,0.00005495672,0.00008255637,0.00012924308,0.20729996,0.010709154,0.0013735659,0.77740216,0.00069533853],"about_ca_topic_score_codex":0.0000037066316,"about_ca_topic_score_gemma":0.000019443773,"teacher_disagreement_score":0.72877866,"about_ca_system_score_codex":0.000027163353,"about_ca_system_score_gemma":0.000014842808,"threshold_uncertainty_score":0.3904114},"labels":[],"label_agreement":null},{"id":"W1995220817","doi":"10.1007/s00236-009-0090-y","title":"On the closure of pattern expressions languages under intersection with regular languages","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Abstract family of languages; Intersection (aeronautics); Closure (psychology); Complement (music); Theory of computation; Language family; Cone (formal languages); Computer science; Second-generation programming language; Regular language; Mathematics; Linguistics; Programming language; Artificial intelligence; Fifth-generation programming language; Philosophy","score_opus":0.005861879333243367,"score_gpt":0.22553346134852395,"score_spread":0.2196715820152806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995220817","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.871696,0.000034035107,0.09592893,0.0057476964,0.000052178217,0.00020011391,0.000004770813,0.00019111935,0.026145173],"genre_scores_gemma":[0.99673223,0.0000028307068,0.00094132614,0.0022203617,0.000016697482,0.000004460438,0.0000027507206,0.0000032186638,0.00007612431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993998,0.000034040935,0.00015897247,0.000077935656,0.00019889632,0.00013039247],"domain_scores_gemma":[0.99915713,0.0001557205,0.00010851993,0.0005237734,0.000025435305,0.000029405155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016110465,0.00009032618,0.00009814963,0.000056428056,0.00007030698,0.00006523928,0.00048594785,0.00003488502,0.00004469393],"category_scores_gemma":[0.000030234052,0.000046588855,0.00003594027,0.000111698304,0.000035484773,0.00041835647,0.000060072853,0.00010902343,0.000019161818],"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.00005774196,0.00029975025,0.00027484904,0.00009875704,0.00013486051,0.000023535722,0.03589805,0.00032216974,0.012271047,0.77165425,0.023588601,0.15537637],"study_design_scores_gemma":[0.006399761,0.00880624,0.16134357,0.0064112213,0.00021883035,0.0007447284,0.16571121,0.11088646,0.3887028,0.1353283,0.011792856,0.0036540353],"about_ca_topic_score_codex":0.000008902917,"about_ca_topic_score_gemma":0.0000025601191,"teacher_disagreement_score":0.63632596,"about_ca_system_score_codex":0.000011117611,"about_ca_system_score_gemma":0.00001355844,"threshold_uncertainty_score":0.18998383},"labels":[],"label_agreement":null},{"id":"W2000098237","doi":"10.1007/s002360050001","title":"Querying sequence databases with transducers","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datalog; Computer science; Ackermann function; Subroutine; Theory of computation; Theoretical computer science; Hierarchy; Programming language; Sequence (biology); Database; P; Query language; Workstation; Transducer; Time complexity; Algorithm; Mathematics","score_opus":0.026321469654806775,"score_gpt":0.25187368100628554,"score_spread":0.22555221135147877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000098237","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.1063875,0.000050949424,0.81794983,0.0015945322,0.00014968972,0.0003757466,0.00006561795,0.0006207116,0.07280545],"genre_scores_gemma":[0.7161655,0.000080981416,0.28206024,0.0013443597,0.00003487543,0.000017079594,0.00005576751,0.000008225936,0.00023299895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914354,0.000013271308,0.00019694766,0.00014178548,0.00026430277,0.00024012584],"domain_scores_gemma":[0.99913335,0.00005212207,0.000044406814,0.00064981455,0.00002370922,0.000096599266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010566365,0.00011238813,0.000107469044,0.000044085697,0.00014882114,0.00015956981,0.00070585887,0.000019573272,0.00030679005],"category_scores_gemma":[0.000007832563,0.00007755527,0.000020782187,0.00021828213,0.000044985994,0.0039917193,0.000074856674,0.000105570725,0.00018927963],"study_design_candidate":"design_other","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.000033686614,0.000061105835,0.00010594975,0.000079422825,0.000029729654,0.000037407408,0.004251197,0.00036890537,0.00040022066,0.012346693,0.0068206284,0.97546506],"study_design_scores_gemma":[0.00091374526,0.0002268535,0.000976856,0.00032415122,0.000016482021,0.00029569928,0.0002166365,0.43876135,0.0027084323,0.00034923368,0.55449915,0.0007114382],"about_ca_topic_score_codex":0.00006135127,"about_ca_topic_score_gemma":0.0000036210972,"teacher_disagreement_score":0.9747536,"about_ca_system_score_codex":0.000016679007,"about_ca_system_score_gemma":0.00006792666,"threshold_uncertainty_score":0.3359136},"labels":[],"label_agreement":null},{"id":"W2007676477","doi":"10.1007/s002360100072","title":"Tree-systems of morphisms","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Morphism; Theory of computation; Tree (set theory); Alphabet; Mathematics; Regular language; Hierarchy; Substring; Root (linguistics); Discrete mathematics; Computer science; Combinatorics; Automaton; Theoretical computer science; Algorithm; Data structure; Programming language","score_opus":0.013829491109477622,"score_gpt":0.2309483918935203,"score_spread":0.21711890078404267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007676477","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.9461776,0.00008094969,0.001000183,0.000057913767,0.00008657499,0.00008273367,0.0000031023512,0.000010961559,0.052499983],"genre_scores_gemma":[0.9988705,0.000047764694,0.0004579856,0.00016206158,0.00008019706,0.0000034977215,0.000035118235,0.0000034719048,0.00033938608],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944866,0.000014027978,0.00024616023,0.00006941693,0.000074748765,0.0001469785],"domain_scores_gemma":[0.99963224,0.000011627817,0.000092215705,0.00018003274,0.00004110851,0.00004278879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011326665,0.00007416395,0.00010764683,0.000019774747,0.000029122182,0.000012291317,0.000157499,0.00008472752,0.000026171212],"category_scores_gemma":[0.00006619077,0.000053031108,0.000051680912,0.00006161702,0.000042836324,0.000004181584,0.00008361236,0.00003939855,0.000018402528],"study_design_candidate":"bench_or_experimental","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.0001773821,0.00015656007,0.018344833,0.00012307597,0.00013186478,0.0000062095314,0.00023029959,0.00015262245,0.9139272,0.0015762006,0.015938098,0.04923568],"study_design_scores_gemma":[0.0014689437,0.0018971919,0.017565822,0.00008516372,0.000038627913,0.0001908397,0.0008456737,0.007704801,0.12884682,0.00017381212,0.84047514,0.0007071404],"about_ca_topic_score_codex":0.0000073545298,"about_ca_topic_score_gemma":0.0000012486889,"teacher_disagreement_score":0.82453704,"about_ca_system_score_codex":0.0000023061612,"about_ca_system_score_gemma":0.000013171153,"threshold_uncertainty_score":0.21625458},"labels":[],"label_agreement":null},{"id":"W2012307294","doi":"10.1007/s00236-009-0109-4","title":"Embedding mappings and splittings with applications","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Embedding; Equivalence relation; Injective function; Axiom; Algebraic number; Relation algebra; Mathematics; Relation (database); Theory of computation; Equivalence (formal languages); Algebra over a field; Isomorphism (crystallography); Algebraic analysis; Discrete mathematics; Theoretical computer science; Computer science; Pure mathematics; Algorithm","score_opus":0.005333039337177925,"score_gpt":0.22375549677563328,"score_spread":0.21842245743845534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012307294","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.022519032,0.000021193913,0.9549217,0.0020128575,0.000009576347,0.00019493011,3.461855e-7,0.00019223186,0.020128123],"genre_scores_gemma":[0.7935231,0.000007388228,0.20469408,0.0016979726,0.000013133788,0.000013879292,0.0000010278844,0.0000016276307,0.00004780642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947256,0.0000033005124,0.00014460787,0.00010210219,0.000106262705,0.0001711933],"domain_scores_gemma":[0.9995353,0.000038489303,0.00007308596,0.00025700146,0.00002753869,0.00006857702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006932207,0.00007907588,0.000083629144,0.00004768594,0.000130342,0.00012591695,0.00028366165,0.000022813207,0.0000037702387],"category_scores_gemma":[0.000011565179,0.000058288653,0.000011486044,0.00019330771,0.000028638815,0.0011486964,0.00006139013,0.00007705178,0.000026587115],"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.0000040921673,0.000031237312,0.00015351798,0.00004275204,0.000010526016,0.0000027188164,0.0038021381,0.00006682728,0.00029407212,0.72911847,0.0004924618,0.2659812],"study_design_scores_gemma":[0.0022523608,0.0012391106,0.024213377,0.0002798228,0.00004230495,0.0007672638,0.0015794263,0.2886449,0.002199281,0.30489022,0.3719674,0.0019245271],"about_ca_topic_score_codex":4.050934e-7,"about_ca_topic_score_gemma":7.269573e-8,"teacher_disagreement_score":0.771004,"about_ca_system_score_codex":0.000009188374,"about_ca_system_score_gemma":0.0000139272015,"threshold_uncertainty_score":0.23769423},"labels":[],"label_agreement":null},{"id":"W2025553490","doi":"10.1007/s00236-003-0118-7","title":"Sticky-free and overhang-free DNA languages","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Theory of computation; Computer science; Computation; DNA; Theoretical computer science; Set (abstract data type); Algorithm; Programming language; Genetics; Biology","score_opus":0.0067281666595720956,"score_gpt":0.2258984392369812,"score_spread":0.2191702725774091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025553490","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.9171472,0.0002361092,0.00031708038,0.00018802144,0.000055502474,0.000096972166,0.000013083762,0.000022357026,0.081923634],"genre_scores_gemma":[0.9958327,0.000051763996,0.0027535341,0.0009317757,0.00005948732,0.0000038325206,0.000026918024,0.0000056152035,0.00033436215],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994167,0.000024156352,0.00016328717,0.000111747795,0.00007792685,0.00020617622],"domain_scores_gemma":[0.99942315,0.00002845526,0.000051591673,0.00039969716,0.000025155576,0.00007196227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015139864,0.00010796533,0.0000999534,0.000018343955,0.00006750847,0.000038248585,0.00023860918,0.00010271909,0.00004337633],"category_scores_gemma":[0.00091951806,0.00007965577,0.00003552805,0.00004292066,0.000060513536,0.0000073200713,0.00026298812,0.00006387734,0.000011277162],"study_design_candidate":"bench_or_experimental","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.00020927157,0.00030094286,0.016548587,0.00047887556,0.00038886277,0.00003149986,0.0013329389,0.000014528591,0.7261154,0.035963047,0.1688535,0.049762554],"study_design_scores_gemma":[0.0032522627,0.0013444043,0.015688637,0.00006740274,0.000064682616,0.000199709,0.0016604661,0.00028642887,0.21342468,0.0046104686,0.7583234,0.0010775093],"about_ca_topic_score_codex":0.0000026158627,"about_ca_topic_score_gemma":0.000003515768,"teacher_disagreement_score":0.58946985,"about_ca_system_score_codex":0.0000037352443,"about_ca_system_score_gemma":0.000016758848,"threshold_uncertainty_score":0.3248268},"labels":[],"label_agreement":null},{"id":"W2036780516","doi":"10.1007/s00236-009-0107-6","title":"Early action in an Earley parser","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Software Engineering Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Parsing; Compiler; Natural language processing; Artificial intelligence; Programming language; Action (physics); Theory of computation; LR parser; Top-down parsing","score_opus":0.027492417611835438,"score_gpt":0.2901093124590566,"score_spread":0.2626168948472211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036780516","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.97218156,0.000004893072,0.025565427,0.00052321225,0.00009689803,0.000113421855,2.569091e-7,0.00025752248,0.0012568291],"genre_scores_gemma":[0.98762286,0.0000038644057,0.012093872,0.00021415038,0.000021050022,0.000006496504,0.0000012904077,0.0000031172779,0.000033313983],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991445,0.000015919113,0.00018769321,0.00009714925,0.00027571872,0.0002790255],"domain_scores_gemma":[0.99926573,0.00010701186,0.000026705353,0.00046730624,0.00003628909,0.00009698077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023936653,0.00007607848,0.00008270854,0.00018698114,0.000032641718,0.00021464945,0.0006207324,0.000051146417,0.000014401473],"category_scores_gemma":[0.00018541486,0.00007143824,0.000018563116,0.000398867,0.000009780714,0.0030391829,0.00006161152,0.00019306688,0.00018743759],"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.000039732953,0.00035486982,0.034202747,0.00008761362,0.000019815847,0.000053267162,0.024340346,0.0017979407,0.0029468248,0.021624753,0.0042958474,0.91023624],"study_design_scores_gemma":[0.000307329,0.00028570087,0.9289567,0.000025768992,8.220369e-7,0.000011124682,0.00003861176,0.065965675,0.00089541794,0.00088460837,0.0024353794,0.00019288628],"about_ca_topic_score_codex":0.000014728947,"about_ca_topic_score_gemma":0.0000024150147,"teacher_disagreement_score":0.91004336,"about_ca_system_score_codex":0.00004964215,"about_ca_system_score_gemma":0.000035597466,"threshold_uncertainty_score":0.29131672},"labels":[],"label_agreement":null},{"id":"W2043947609","doi":"10.1007/s00236-008-0071-6","title":"Relational structures model of concurrency","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Concurrency; Computer science; Theory of computation; Programming language; Theoretical computer science","score_opus":0.06551122478231355,"score_gpt":0.25221918263215987,"score_spread":0.1867079578498463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043947609","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.07891888,0.000039059083,0.8955398,0.00010411233,0.00016451949,0.0000909731,0.000008553453,0.00007974444,0.02505433],"genre_scores_gemma":[0.8561803,0.000010324535,0.14364514,0.00009105416,0.000013230104,0.0000031676964,0.0000027913109,0.0000025111547,0.000051498533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989066,0.000012491471,0.00045678395,0.00008530917,0.00038936795,0.00014944788],"domain_scores_gemma":[0.9991597,0.000083994986,0.00018555592,0.00040894092,0.00011037588,0.000051421266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013278493,0.000084396765,0.00014206031,0.00010463075,0.00008742216,0.000016296017,0.00061846577,0.00005168713,0.000013402901],"category_scores_gemma":[0.000090889574,0.00007277526,0.00004426195,0.00019646899,0.000054144784,0.0011827756,0.00016865184,0.00009627275,0.00002285937],"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.0000051167513,0.00002632497,0.00057614053,0.000098390075,0.00003276163,0.0000020089587,0.012208705,0.06681771,0.0005878377,0.9103592,0.0051710177,0.004114768],"study_design_scores_gemma":[0.00015290137,0.000013562138,0.00023230708,0.0000145345475,0.0000016040888,0.000039011873,0.000010386914,0.99323696,0.00042226017,0.005312474,0.0004788231,0.00008520351],"about_ca_topic_score_codex":0.0000027954932,"about_ca_topic_score_gemma":1.6169315e-7,"teacher_disagreement_score":0.9264192,"about_ca_system_score_codex":0.000022106298,"about_ca_system_score_gemma":0.00015532173,"threshold_uncertainty_score":0.2967689},"labels":[],"label_agreement":null},{"id":"W2045395233","doi":"10.1007/s00236-008-0086-z","title":"A queue based mutual exclusion algorithm","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Theory of computation; Computer science; Concurrency; Algorithm; Critical section; Conjecture; Semaphore; Automaton; Atomicity; Queue; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.012789053925545775,"score_gpt":0.21507667957268187,"score_spread":0.2022876256471361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045395233","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.007774894,0.000022362226,0.9700917,0.00068547146,0.00032353346,0.0001815991,0.000017401242,0.0002546674,0.020648368],"genre_scores_gemma":[0.91415,0.000007484738,0.08415147,0.0012793617,0.000058826085,0.000022357364,0.000021027437,0.0000058787555,0.00030360694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879974,0.000023739272,0.00036951323,0.00013806605,0.00037771417,0.00029124753],"domain_scores_gemma":[0.9990527,0.000058306956,0.000114086186,0.0005625848,0.00008522412,0.0001271024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018145642,0.00013174204,0.00017307866,0.00007477695,0.00023919965,0.00009645836,0.00073450344,0.00006948506,0.000035518973],"category_scores_gemma":[0.000040177823,0.00010948204,0.000065760694,0.0003384534,0.000045711742,0.0012023543,0.00016980871,0.0001212584,0.00045402834],"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.000032485324,0.0005802315,0.00060462917,0.00029154026,0.000085792315,0.00035457432,0.01877241,0.0004946711,0.00055395666,0.032998536,0.30930132,0.6359298],"study_design_scores_gemma":[0.00047737797,0.00006435815,0.0009638853,0.00003865435,0.0000016758352,0.00011546888,0.00003716432,0.81237423,0.00031460455,0.00007580943,0.18534032,0.00019646979],"about_ca_topic_score_codex":0.000023803796,"about_ca_topic_score_gemma":0.0000010777999,"teacher_disagreement_score":0.9063751,"about_ca_system_score_codex":0.00003722595,"about_ca_system_score_gemma":0.0001287695,"threshold_uncertainty_score":0.5835767},"labels":[],"label_agreement":null},{"id":"W2065795466","doi":"10.1007/s002360000044","title":"Analysis of range search for random k-d trees","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypercube; Combinatorics; Mathematics; Range (aeronautics); Binary search tree; Nearest neighbor search; Range tree; Conjecture; Theory of computation; Search tree; Regular polygon; Tree (set theory); Probabilistic logic; k-nearest neighbors algorithm; Discrete mathematics; Search algorithm; Algorithm; Computer science; Interval tree; Binary tree; Statistics; Data mining; Artificial intelligence","score_opus":0.02391396967433926,"score_gpt":0.27985544992381073,"score_spread":0.25594148024947144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065795466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12647341,0.000016454262,0.8692681,0.0005028269,0.000055502773,0.00016762003,0.0000056266886,0.000027285314,0.0034831672],"genre_scores_gemma":[0.9779598,0.00001573398,0.021601165,0.00018980066,0.00002678431,0.000017047732,0.000032692133,0.0000015435523,0.00015542496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992957,0.000017633867,0.00027543947,0.00007444091,0.00021249996,0.00012428242],"domain_scores_gemma":[0.9992024,0.00031712404,0.00007191489,0.00021878835,0.00014792738,0.00004189156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037433565,0.000056228557,0.000168353,0.00039232092,0.00006374319,0.00005697194,0.00030017857,0.000024949864,0.00003607429],"category_scores_gemma":[0.000056098026,0.000047925572,0.00012351802,0.0012548491,0.000015514499,0.0005981223,0.000052090483,0.000028774246,0.000008541562],"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.0005125296,0.00039636224,0.009913599,0.0002141176,0.0027496186,0.000002543338,0.017431708,0.18267335,0.0018276488,0.15105844,0.008654566,0.62456554],"study_design_scores_gemma":[0.0008577061,0.00006281076,0.008137691,0.0000040804493,0.00008682165,0.000001470657,0.00004028732,0.980004,0.0009935846,0.00028199516,0.009453805,0.00007575035],"about_ca_topic_score_codex":0.0000063986395,"about_ca_topic_score_gemma":0.0000076194874,"teacher_disagreement_score":0.8514864,"about_ca_system_score_codex":0.000010448227,"about_ca_system_score_gemma":0.000038699873,"threshold_uncertainty_score":0.19543481},"labels":[],"label_agreement":null},{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","score_opus":0.005874499761680074,"score_gpt":0.20309901389285406,"score_spread":0.19722451413117398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071685823","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.916049,0.000059764352,0.063829556,0.0004145597,0.000143947,0.00015270902,0.000006173874,0.00041525465,0.018929036],"genre_scores_gemma":[0.9343826,0.000012887642,0.06448846,0.0008451972,0.0000467446,0.000013251264,0.000007370376,0.0000073263145,0.00019614829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988283,0.00003486835,0.00033426457,0.00018309956,0.00030902438,0.0003104743],"domain_scores_gemma":[0.998804,0.0001407363,0.000086614564,0.00083574705,0.000018289888,0.00011465584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022213178,0.00014500479,0.0001677138,0.00007011356,0.00014508757,0.00025736084,0.0010464472,0.00006607582,0.0004719384],"category_scores_gemma":[0.00003556237,0.00011521944,0.000069968424,0.00023597541,0.000037144437,0.0013897397,0.00020059802,0.000114208495,0.00048158006],"study_design_candidate":"design_other","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.00003801852,0.00016499948,0.000051382005,0.000035599387,0.000035306937,0.000029616103,0.012803109,0.000253675,0.02544765,0.022015782,0.015847227,0.9232776],"study_design_scores_gemma":[0.0014761004,0.00014443274,0.0019677873,0.00045172844,0.000020402911,0.00004784707,0.0003342541,0.7297812,0.06331852,0.022391582,0.17927754,0.0007886083],"about_ca_topic_score_codex":0.000014437778,"about_ca_topic_score_gemma":4.6960076e-7,"teacher_disagreement_score":0.92248905,"about_ca_system_score_codex":0.000022861324,"about_ca_system_score_gemma":0.0000259382,"threshold_uncertainty_score":0.6189898},"labels":[],"label_agreement":null},{"id":"W2093939144","doi":"10.1007/s00236-007-0056-x","title":"Solving #SAT using vertex covers","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Cluster analysis; Vertex (graph theory); Time complexity; Graph; Pathwidth; Line graph","score_opus":0.0258547673811828,"score_gpt":0.30543294107014124,"score_spread":0.27957817368895843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093939144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10442662,0.000016546406,0.8634289,0.00012319541,0.00022712279,0.00015030906,9.277121e-7,0.0001552744,0.031471096],"genre_scores_gemma":[0.91210264,0.0000045823745,0.08733039,0.00047839517,0.000016722017,0.0000012935151,0.0000012431392,0.0000066652938,0.00005805234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859256,0.000018683313,0.0002975571,0.00012428997,0.0004195947,0.0005473287],"domain_scores_gemma":[0.99869317,0.00042036478,0.0000853987,0.00056827907,0.00007596191,0.0001567985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646733,0.00011071254,0.00012063212,0.00020890485,0.00020285543,0.00016067475,0.00093566783,0.000050888084,0.00003366382],"category_scores_gemma":[0.00029801682,0.00010165168,0.0000522069,0.0005267265,0.00008132228,0.002640533,0.00041920692,0.00019412632,0.00020446944],"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.00014999436,0.00012641464,0.0018266217,0.00019212694,0.00012994805,0.00011284617,0.01577614,0.0012930229,0.023902534,0.73487014,0.002733651,0.21888655],"study_design_scores_gemma":[0.0014948808,0.00032978322,0.002791373,0.00016969757,0.000014918581,0.00024902137,0.0014581607,0.857229,0.019978108,0.068296745,0.04692291,0.0010653964],"about_ca_topic_score_codex":0.000005305632,"about_ca_topic_score_gemma":0.000001948988,"teacher_disagreement_score":0.855936,"about_ca_system_score_codex":0.000094632196,"about_ca_system_score_gemma":0.00007007971,"threshold_uncertainty_score":0.4145235},"labels":[],"label_agreement":null},{"id":"W2095614028","doi":"10.1007/s00236-011-0146-7","title":"An efficient algorithm for finding ideal schedules","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Theory of computation; Schedule; Computer science; Scheduling (production processes); Algorithm; Time complexity; Mathematics; Mathematical optimization","score_opus":0.021974009486994895,"score_gpt":0.2399925613728733,"score_spread":0.2180185518858784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095614028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398907,0.000027463619,0.95306045,0.000009692807,0.000407039,0.00021823886,0.00002135181,0.0005321331,0.005832953],"genre_scores_gemma":[0.2856219,0.0000075857774,0.7141602,0.00005555741,0.00005671687,0.000035568177,0.000032559015,0.000020650587,0.000009221515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.0000049722235,0.0002759759,0.00007114104,0.00011327769,0.0002592492],"domain_scores_gemma":[0.9995559,0.000037692123,0.00003603215,0.0002051081,0.000051280127,0.0001140291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016762222,0.00012474069,0.000122521,0.000106127634,0.0000934993,0.00005418044,0.0001803395,0.00007620065,0.000107140404],"category_scores_gemma":[0.00003165492,0.00011810498,0.00004561905,0.00011646659,0.000021376458,0.00028628932,0.00001408906,0.00008999883,0.0000727317],"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.00002874472,0.00023453862,0.00016535821,0.00040564776,0.00024264779,0.000004031439,0.023387574,0.35079202,0.00018313786,0.010783197,0.0010710667,0.6127021],"study_design_scores_gemma":[0.00028737308,0.00004524246,0.00011770428,0.000020832313,0.000012049347,0.00000371963,0.0005499217,0.9964714,0.0017469614,0.00008764974,0.00048825456,0.00016886105],"about_ca_topic_score_codex":0.0000025548009,"about_ca_topic_score_gemma":3.4715936e-7,"teacher_disagreement_score":0.6456794,"about_ca_system_score_codex":0.000026713647,"about_ca_system_score_gemma":0.000014511373,"threshold_uncertainty_score":0.48161814},"labels":[],"label_agreement":null},{"id":"W2112729204","doi":"10.1007/s00236-008-0069-0","title":"Weighted height of random trees","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Weight-balanced tree; Combinatorics; Binary search tree; Theory of computation; Extension (predicate logic); Tree (set theory); Set (abstract data type); Random binary tree; Binary logarithm; Discrete mathematics; Ternary search tree; Constant (computer programming); Binary tree; Algorithm; Tree structure; Computer science; Interval tree","score_opus":0.012954597852491713,"score_gpt":0.20640523636354366,"score_spread":0.19345063851105196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112729204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05508727,0.00008651767,0.63630253,0.0022772327,0.0005801659,0.0005414004,0.000017949795,0.0004240253,0.30468288],"genre_scores_gemma":[0.9117178,0.00012854833,0.086613156,0.00044591594,0.000036884776,0.000010032095,0.000023558463,0.000004681769,0.0010194541],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991951,0.00001207002,0.0003028599,0.00007841755,0.00024764816,0.00016388866],"domain_scores_gemma":[0.9992496,0.000060727896,0.00011042288,0.00049614004,0.000035664936,0.00004744183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013185211,0.000083747036,0.00015480387,0.00010593508,0.000076291944,0.000045226305,0.00088346214,0.000023055212,0.000058682333],"category_scores_gemma":[0.000022768005,0.00006331052,0.00005015631,0.00027442916,0.00005378665,0.0020734812,0.00027708858,0.000050653493,0.00014002265],"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.00009744929,0.00050085154,0.0015085154,0.00030390965,0.00038007557,0.00008173556,0.014544386,0.000020224155,0.00037679443,0.2512127,0.4203132,0.31066015],"study_design_scores_gemma":[0.0054580793,0.00026117696,0.009328156,0.00007638707,0.000029239087,0.00006900748,0.00014588475,0.371096,0.0062221442,0.0030481413,0.6036345,0.0006313222],"about_ca_topic_score_codex":0.00000654346,"about_ca_topic_score_gemma":7.721592e-7,"teacher_disagreement_score":0.8566305,"about_ca_system_score_codex":0.000005930881,"about_ca_system_score_gemma":0.000021309292,"threshold_uncertainty_score":0.2581728},"labels":[],"label_agreement":null},{"id":"W2138502430","doi":"10.1007/s00236-011-0132-0","title":"Nonatomic dual bakery algorithm with bounded tokens","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Theory of computation; Bounded function; Dual (grammatical number); Computer science; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.011188192693208738,"score_gpt":0.17994344259313597,"score_spread":0.16875524989992724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138502430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18904129,0.000102396225,0.46515596,0.00012346837,0.0013083955,0.0006075913,0.0000527319,0.0028916376,0.34071654],"genre_scores_gemma":[0.40843013,0.000033564844,0.5909478,0.00025289544,0.000068387744,0.000024802035,0.000036116155,0.000041166593,0.00016510967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992339,0.000005491567,0.0002589831,0.000068661626,0.00016860358,0.00026435038],"domain_scores_gemma":[0.9995452,0.0000249172,0.000036297824,0.00023225794,0.00004947114,0.000111825546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000852717,0.00015423833,0.0001448873,0.0000944469,0.000066086446,0.00005632648,0.00012434441,0.00007619799,0.00039063496],"category_scores_gemma":[0.000013029284,0.00012908338,0.000032230397,0.00017298502,0.00004356563,0.0005017427,0.0000226171,0.00016187428,0.00033787053],"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.00041435388,0.0009128179,0.002642078,0.0017405404,0.0036427714,0.00039578092,0.17305596,0.0722566,0.00035316663,0.014156968,0.050083164,0.6803458],"study_design_scores_gemma":[0.0007325524,0.00007267327,0.0006013357,0.00003828766,0.000031670254,0.00010629334,0.0007822238,0.9906002,0.0016921016,0.00011407743,0.0048388215,0.00038972357],"about_ca_topic_score_codex":0.000006454407,"about_ca_topic_score_gemma":0.0000019762242,"teacher_disagreement_score":0.91834366,"about_ca_system_score_codex":0.000034365912,"about_ca_system_score_gemma":0.000031435622,"threshold_uncertainty_score":0.5263867},"labels":[],"label_agreement":null},{"id":"W2141718869","doi":"10.1007/s00236-006-0027-7","title":"Representation and uniformization of algebraic transductions","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo; Saint Mary's University","funders":"","keywords":"Algebraic number; Formalism (music); Computer science; Representation (politics); Stack (abstract data type); Theory of computation; Context (archaeology); Mathematics; Algebra over a field; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004762714598113413,"score_gpt":0.19911530751033274,"score_spread":0.19435259291221932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141718869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4608587,0.000030054824,0.5228857,0.0008749043,0.00010846755,0.0001414412,0.0000030750014,0.0001319344,0.014965746],"genre_scores_gemma":[0.98559797,0.000010330732,0.014253618,0.000058653142,0.000012586883,0.0000036192653,0.000010554988,0.0000018676569,0.000050812214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.000011179863,0.00021800995,0.000056759483,0.000099495126,0.00007527497],"domain_scores_gemma":[0.9996292,0.000046758032,0.000080034115,0.00019583649,0.0000302384,0.000017962899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010024341,0.0000448802,0.000071157345,0.00007581962,0.000050825256,0.000045086064,0.00014403288,0.000023295312,0.000010618529],"category_scores_gemma":[0.000015100384,0.000039454688,0.000019394083,0.00024925408,0.000034921206,0.0012521114,0.000031190542,0.0000278578,0.0000057874627],"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.0000032076978,0.000040881983,0.00045371844,0.000059934722,0.00001148751,5.613657e-7,0.0024416298,0.00021716277,0.0024148286,0.9531176,0.0013120978,0.039926898],"study_design_scores_gemma":[0.0013422427,0.00016938221,0.07451053,0.000085800515,0.000038533075,0.00017560553,0.0009589911,0.6040679,0.04078922,0.27024278,0.0071309633,0.0004880485],"about_ca_topic_score_codex":0.000033732664,"about_ca_topic_score_gemma":0.0000026949679,"teacher_disagreement_score":0.6828748,"about_ca_system_score_codex":0.0000054217353,"about_ca_system_score_gemma":0.000012004094,"threshold_uncertainty_score":0.16089155},"labels":[],"label_agreement":null},{"id":"W2273670553","doi":"10.1007/s00236-016-0258-1","title":"Disjunctivity and other properties of sets of pseudo-bordered words","year":2016,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics on words; Mathematics; Combinatorics; Morphism; Suffix; Theta function; Prefix; Word (group theory); Discrete mathematics; Pure mathematics; Geometry; Linguistics","score_opus":0.01445349805396633,"score_gpt":0.21664548021450866,"score_spread":0.20219198216054232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273670553","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.977722,0.000036717276,0.01842481,0.00048151237,0.000053679716,0.00010171582,0.0000069067937,0.000046846526,0.0031258473],"genre_scores_gemma":[0.9964294,0.0000093559165,0.0033635995,0.00013457857,0.000004629477,0.000004455728,9.710378e-8,0.0000033481115,0.00005057292],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938375,0.00002143081,0.00024914133,0.000071620096,0.00014779596,0.00012623805],"domain_scores_gemma":[0.99934226,0.00007877342,0.00014249858,0.00036721473,0.000033499484,0.000035741643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002246472,0.000077160905,0.00015915431,0.00005192286,0.000024226923,0.000021106518,0.0003304395,0.000031741445,0.000021379834],"category_scores_gemma":[0.000076661905,0.000041074443,0.000027394866,0.00009834223,0.00013023736,0.0008300245,0.00020518959,0.000027040187,0.000007737766],"study_design_candidate":"bench_or_experimental","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.00010036304,0.00025670562,0.006552206,0.00090519653,0.00015411354,0.0000012659622,0.025526682,0.0000018773943,0.15664235,0.15239051,0.0015559811,0.65591276],"study_design_scores_gemma":[0.005419992,0.0011745043,0.055265248,0.003196276,0.00007254402,0.000115621406,0.0020683687,0.089932725,0.77528685,0.044249017,0.021580061,0.0016388142],"about_ca_topic_score_codex":0.000013580861,"about_ca_topic_score_gemma":0.0000014961383,"teacher_disagreement_score":0.6542739,"about_ca_system_score_codex":0.000005815142,"about_ca_system_score_gemma":0.000027215065,"threshold_uncertainty_score":0.16749673},"labels":[],"label_agreement":null},{"id":"W266933206","doi":"10.1007/s00236-003-0110-2","title":"A word on 7 letters which is non-repetitive up to mod 5","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mod; Theory of computation; Construct (python library); Word (group theory); Combinatorics; Mathematics; Plane (geometry); Discrete mathematics; Arithmetic; Computer science; Algorithm; Programming language","score_opus":0.008311424531101974,"score_gpt":0.22354343087930634,"score_spread":0.21523200634820436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266933206","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.6200605,0.000005935935,0.2209545,0.01219405,0.000978689,0.00057684846,0.000010529477,0.0003544805,0.14486444],"genre_scores_gemma":[0.95649904,0.0000025716631,0.01389343,0.02926181,0.000022067326,0.000028927045,0.0000015522959,0.000008126384,0.00028249348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988531,0.000026597276,0.00026929684,0.00018772771,0.00030362752,0.000359638],"domain_scores_gemma":[0.9988617,0.0001276395,0.000075755706,0.0007299481,0.000054894837,0.0001500973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002919183,0.00016086637,0.00016398064,0.0001383039,0.00011001106,0.00022201416,0.00072350155,0.00004469065,0.000118306365],"category_scores_gemma":[0.0001326581,0.00013556471,0.000051549294,0.0005099042,0.000019268404,0.0008952962,0.00014592095,0.00013884756,0.0015438377],"study_design_candidate":"not_applicable","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.000058020458,0.00019062244,0.00014155715,0.0001375711,0.00016131879,0.000027417713,0.107898735,0.00033948853,0.0046600346,0.5302857,0.26949224,0.08660727],"study_design_scores_gemma":[0.0043388684,0.0014502971,0.007451352,0.0011297697,0.00005829566,0.00022787326,0.0045244195,0.18273434,0.14036556,0.024092348,0.6297071,0.003919758],"about_ca_topic_score_codex":0.000006002117,"about_ca_topic_score_gemma":0.0000012323926,"teacher_disagreement_score":0.50619334,"about_ca_system_score_codex":0.000043079282,"about_ca_system_score_gemma":0.000045493493,"threshold_uncertainty_score":0.9992336},"labels":[],"label_agreement":null},{"id":"W2908903570","doi":"10.1007/s00236-021-00411-z","title":"On Huang and Wong’s algorithm for generalized binary split trees","year":2022,"lang":"en","type":"preprint","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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; Canada Research Chairs; Hong Kong University of Science and Technology; University of Waterloo; Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Algorithm; Mathematics; Binary number; Dynamic programming; Property (philosophy); Time complexity; Optimal binary search tree; Binary tree; Computer science; Tree structure; Interval tree","score_opus":0.02943207565423358,"score_gpt":0.31377478604262427,"score_spread":0.2843427103883907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908903570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0388743,0.00043335086,0.9382555,0.002932037,0.0014795589,0.0037267252,0.00038516443,0.00066768617,0.013245687],"genre_scores_gemma":[0.026334902,0.00035424094,0.9666672,0.0017956417,0.0001400492,0.0019636254,0.00028505412,0.000067302455,0.0023919814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788314,0.00009762428,0.000483704,0.00043860154,0.00057207525,0.0005248668],"domain_scores_gemma":[0.9975522,0.0006168978,0.00023836775,0.0013311711,0.00008725964,0.00017407766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007593385,0.000320856,0.00041005155,0.00043521912,0.0003412148,0.00036337567,0.0019226084,0.0001484724,0.00010847311],"category_scores_gemma":[0.00015965373,0.0002950059,0.00016193937,0.00026388216,0.00011127202,0.0006938629,0.004229287,0.00071713753,0.000019048948],"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.00010967611,0.00013691507,0.000011122721,0.0006351577,0.00019918964,0.000024597293,0.003994562,0.0015444861,0.00006536029,0.41331008,0.011267944,0.5687009],"study_design_scores_gemma":[0.0009789303,0.0004866908,0.00018807873,0.00009213983,0.000020576927,0.000017246113,0.00015790734,0.70575744,0.00013706178,0.25460994,0.03696222,0.00059174007],"about_ca_topic_score_codex":0.000008644566,"about_ca_topic_score_gemma":0.0000011120135,"teacher_disagreement_score":0.70421296,"about_ca_system_score_codex":0.00011130717,"about_ca_system_score_gemma":0.0001483019,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W3183377724","doi":"10.1007/s00236-021-00399-6","title":"On the size of partial derivatives and the word membership problem","year":2021,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Word (group theory); Computer science; Mathematics; Linguistics; Algorithm; Philosophy","score_opus":0.011602762286817978,"score_gpt":0.21218272425894133,"score_spread":0.20057996197212336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183377724","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.8168854,0.0001742591,0.014370631,0.056087844,0.00023384247,0.0006620389,0.000004961023,0.00015521386,0.11142579],"genre_scores_gemma":[0.9941646,0.000014178964,0.003447635,0.002267126,0.000011832594,0.000015844184,3.8445708e-7,0.0000023345253,0.000076085766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928993,0.00010374455,0.00022087504,0.00007263113,0.00017867557,0.00013416095],"domain_scores_gemma":[0.99702233,0.0023638865,0.000110464665,0.0004401008,0.000036787358,0.000026432923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056091626,0.00007463815,0.00012080045,0.0000114908125,0.000112538895,0.00013584587,0.0004749204,0.000022681214,0.00008430855],"category_scores_gemma":[0.0005007284,0.000034692177,0.000038827828,0.0001825592,0.00018967708,0.0003685356,0.00025972287,0.000099525554,0.000012018889],"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.000013126026,0.000013219654,0.0000106837715,0.000023521021,0.000022610539,8.137813e-7,0.00999752,0.0000045838588,0.00008927456,0.9824948,0.0008771376,0.0064527183],"study_design_scores_gemma":[0.0029383264,0.00018161316,0.0035894606,0.00039116296,0.00004473634,0.00009021196,0.007463969,0.116394676,0.054844268,0.7953657,0.018184029,0.0005118837],"about_ca_topic_score_codex":0.0000026219825,"about_ca_topic_score_gemma":7.221756e-7,"teacher_disagreement_score":0.18712912,"about_ca_system_score_codex":0.00000431788,"about_ca_system_score_gemma":0.000039270606,"threshold_uncertainty_score":0.14147058},"labels":[],"label_agreement":null},{"id":"W4408882635","doi":"10.1007/s00236-025-00486-y","title":"The thief orienteering problem on 2-terminal series–parallel graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Terminal (telecommunication); Theory of computation; Computer science; Series (stratigraphy); GRASP; Mathematics; Combinatorics; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Programming language","score_opus":0.0049465465877099315,"score_gpt":0.20476321264141212,"score_spread":0.19981666605370219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408882635","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006875002,0.000083371815,0.012593312,0.0015692652,0.0011021273,0.00060801074,0.0000070455717,0.00088762946,0.97627425],"genre_scores_gemma":[0.98362726,0.00045455323,0.00919801,0.0007741087,0.000032171836,0.00012789272,0.000023280321,0.00003099612,0.005731726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992762,0.000008241188,0.00029434694,0.00005697987,0.00012572843,0.00023847989],"domain_scores_gemma":[0.99957067,0.0000672014,0.000032128097,0.00025697093,0.000032468375,0.000040537405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013880015,0.00012966493,0.00010064053,0.000085430416,0.00022517388,0.00017040629,0.00021956112,0.000055582415,0.000035844354],"category_scores_gemma":[0.000027140808,0.00009327379,0.0000425799,0.00026078182,0.000040717747,0.0003336033,0.000038613383,0.00018886897,0.00008249615],"study_design_candidate":"not_applicable","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.00010302314,0.000047299465,0.00030858244,0.0010015861,0.00026305186,0.0000050299013,0.005764617,0.3040604,0.00009486004,0.5601162,0.094568565,0.03366682],"study_design_scores_gemma":[0.00056592823,0.00008686281,0.00032274268,0.00028760414,0.000021356995,0.000016500451,0.0003914193,0.15080236,0.00041163064,0.0040173773,0.8427519,0.00032428122],"about_ca_topic_score_codex":0.0000013494932,"about_ca_topic_score_gemma":0.0000038445955,"teacher_disagreement_score":0.9767523,"about_ca_system_score_codex":0.000029939954,"about_ca_system_score_gemma":0.000020708356,"threshold_uncertainty_score":0.38035947},"labels":[],"label_agreement":null},{"id":"W4409157006","doi":"10.1007/s00236-025-00483-1","title":"Visualization of bipartite graphs in limited window size","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Visualization and Analytics","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":"Technische Universität München","keywords":"Bipartite graph; Theory of computation; Window (computing); Computer science; Visualization; Graph drawing; Theoretical computer science; Combinatorics; Mathematics; Algorithm; Graph; Artificial intelligence; World Wide Web","score_opus":0.012323274879951525,"score_gpt":0.28795044292069366,"score_spread":0.2756271680407421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409157006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09610902,0.0000462392,0.8291143,0.0021394547,0.00044968296,0.00054126343,0.000017240627,0.00031785152,0.07126493],"genre_scores_gemma":[0.99508965,0.000039066617,0.003270946,0.0013829125,0.0000026512641,0.000004401558,0.000020003172,0.0000024130302,0.00018795407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911165,0.000027400754,0.0004685648,0.000084374,0.00017101044,0.00013699895],"domain_scores_gemma":[0.9992657,0.00013383904,0.0001268772,0.00035294113,0.000087942186,0.000032725835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021685059,0.00007524508,0.00014018928,0.00033637678,0.000031255207,0.000087051056,0.00047546506,0.000043570864,0.000022207216],"category_scores_gemma":[0.00038097578,0.00006995811,0.00003261839,0.0017571296,0.000031960495,0.0010235723,0.00016046221,0.000046373803,0.000017486449],"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.00000616933,0.00012550465,0.009716414,0.00016732365,0.000024046018,8.6627506e-7,0.0017587997,0.00013733089,0.0004477908,0.9774454,0.004934125,0.0052362154],"study_design_scores_gemma":[0.0013664702,0.00008835125,0.045150124,0.00034463787,0.000019366624,0.0000019096917,0.00026196902,0.8977397,0.0073707304,0.01143755,0.03590746,0.00031171442],"about_ca_topic_score_codex":0.000008749196,"about_ca_topic_score_gemma":0.00000736356,"teacher_disagreement_score":0.9660079,"about_ca_system_score_codex":0.000015119785,"about_ca_system_score_gemma":0.00006817404,"threshold_uncertainty_score":0.28528088},"labels":[],"label_agreement":null},{"id":"W4412934941","doi":"10.1007/s00236-025-00495-x","title":"Novel tree-search method for synthesizing SMT strategies","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"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":"Alliance de recherche numérique du Canada; Georg-August-Universität Göttingen","keywords":"Computer science; Theory of computation; Tree (set theory); Search tree; Theoretical computer science; Programming language; Parallel computing; Search algorithm; Mathematics; Combinatorics","score_opus":0.030245868436263517,"score_gpt":0.3359139184326752,"score_spread":0.3056680499964117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412934941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012005783,0.000021176687,0.9888698,0.0011444169,0.00016067705,0.0003158998,0.000003324857,0.00030654517,0.007977566],"genre_scores_gemma":[0.1558188,0.000003901316,0.8435434,0.00019544526,0.000022818373,0.00009551168,0.0000020614893,0.00000791294,0.00031016776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987879,0.000018965791,0.00028545392,0.00016298535,0.00030222296,0.0004424957],"domain_scores_gemma":[0.99559104,0.003569851,0.00003155581,0.0006009692,0.00013251566,0.00007406137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009473382,0.00012481703,0.00017223971,0.00030854673,0.00013154201,0.0005239904,0.0012515987,0.000068454334,0.000007653503],"category_scores_gemma":[0.0013380656,0.00011176655,0.00006918611,0.0005639333,0.000029638282,0.0012698598,0.000356154,0.00018639662,0.000028891971],"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.000021695987,0.000083124556,0.00010788213,0.0009786948,0.00015189376,0.0000022458878,0.0036932605,0.002346895,0.009394422,0.48161167,0.005445162,0.49616304],"study_design_scores_gemma":[0.00066219625,0.00010478197,0.0024257433,0.00018188769,0.000012111481,0.000013861056,0.0007215659,0.9372982,0.022058662,0.0032823326,0.03290372,0.0003349857],"about_ca_topic_score_codex":0.000022971191,"about_ca_topic_score_gemma":0.0000021281407,"teacher_disagreement_score":0.93495125,"about_ca_system_score_codex":0.000068065645,"about_ca_system_score_gemma":0.0003210447,"threshold_uncertainty_score":0.50528514},"labels":[],"label_agreement":null},{"id":"W4413297002","doi":"10.1007/s00236-025-00503-0","title":"On the 3-tree core of plane graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Theory of computation; Core (optical fiber); Tree (set theory); Combinatorics; Mathematics; Computer science; Plane (geometry); Discrete mathematics; Algorithm; Geometry; Telecommunications","score_opus":0.02111892525438423,"score_gpt":0.2857842315970918,"score_spread":0.2646653063427076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413297002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23258331,0.000053358337,0.12310242,0.008271416,0.00040193248,0.0009184903,0.000015488433,0.0002442017,0.63440937],"genre_scores_gemma":[0.9957093,0.000009429232,0.0028977327,0.0010475147,0.000002300979,0.000015265,0.000001465344,0.0000021342626,0.00031486253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991937,0.00002734473,0.00022747752,0.000078539415,0.00027467764,0.00019823085],"domain_scores_gemma":[0.9980624,0.0009644598,0.00007164578,0.00080742314,0.000060728664,0.000033358636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035518443,0.00007799948,0.00010817695,0.00017955681,0.00009977388,0.00004204346,0.0013905528,0.0000307534,0.00003124029],"category_scores_gemma":[0.00030688415,0.000047374004,0.00004752221,0.00067132496,0.00013340708,0.00035074184,0.00029664976,0.0001731314,0.00005720795],"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.000011908391,0.000014662606,0.000056400553,0.000022836171,0.000014712721,6.2426403e-7,0.00038308263,0.000010669085,0.00012964726,0.9855483,0.0049721003,0.008835013],"study_design_scores_gemma":[0.0002914296,0.0001521762,0.0016271046,0.00009812783,0.0000038135247,0.0000037236514,0.0001816589,0.013239758,0.0055704773,0.97132874,0.0073928884,0.00011013578],"about_ca_topic_score_codex":0.0000021093556,"about_ca_topic_score_gemma":0.0000017389665,"teacher_disagreement_score":0.76312596,"about_ca_system_score_codex":0.000011019897,"about_ca_system_score_gemma":0.00004842043,"threshold_uncertainty_score":0.25840163},"labels":[],"label_agreement":null},{"id":"W796701085","doi":"10.1007/s00236-015-0245-y","title":"State complexity of deletion and bipolar deletion","year":2015,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Deterministic finite automaton; Theory of computation; Combinatorics; State (computer science); Regular language; Matching (statistics); Mathematics; Finite-state machine; Nondeterministic finite automaton; Discrete mathematics; Computational complexity theory; Time complexity; DFA minimization; Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.03540657342730158,"score_gpt":0.23946816796394238,"score_spread":0.2040615945366408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W796701085","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.7561382,0.00010730695,0.24040966,0.00061059813,0.000109857705,0.0001272677,0.0000068188265,0.00012258785,0.0023677216],"genre_scores_gemma":[0.974381,0.00002190353,0.025332788,0.00023481662,0.000007795197,0.0000023038651,0.000005838792,0.000002433434,0.0000111197905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993509,0.000028047256,0.00024058275,0.00006754003,0.00018510273,0.00012781726],"domain_scores_gemma":[0.9994232,0.00003813763,0.00011998429,0.0002559233,0.00007677392,0.00008598984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042165926,0.00006758806,0.00011305282,0.000066246415,0.000037478083,0.0000607808,0.0002616176,0.00002602402,0.0000052192354],"category_scores_gemma":[0.000053867574,0.000056881847,0.000017711545,0.00013283263,0.00009207311,0.0010508421,0.00016541209,0.000054163735,0.000026242631],"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.00004970587,0.00014580434,0.0019229033,0.00030564016,0.000060156515,0.0000042903334,0.023347992,0.00008632259,0.002498644,0.5699022,0.007910532,0.39376587],"study_design_scores_gemma":[0.0011415915,0.0003898352,0.012047145,0.00008013201,0.000012656114,0.00008348327,0.0005015793,0.7887721,0.0076217344,0.14705458,0.041905515,0.00038966179],"about_ca_topic_score_codex":0.00002733623,"about_ca_topic_score_gemma":0.000002316469,"teacher_disagreement_score":0.78868574,"about_ca_system_score_codex":0.000016128026,"about_ca_system_score_gemma":0.000031864573,"threshold_uncertainty_score":0.23195745},"labels":[],"label_agreement":null}]}