{"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":"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.19043097,0.0024436791,0.72569364,0.0034567702,0.0005999821,0.00011373368,0.001599574,0.0020158433,0.07364574],"genre_scores_gemma":[0.9061062,0.00093143963,0.07305036,0.000991519,0.0005170639,0.00019533887,0.0012817363,0.00067443633,0.01625187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978764,0.0006929389,0.00026161055,0.0004008751,0.00048638307,0.00028185273],"domain_scores_gemma":[0.9956916,0.0023066038,0.00032689242,0.00077071605,0.00068971666,0.00021443343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018496106,0.000501612,0.0009719539,0.0026714695,0.002643983,0.004823583,0.0011037319,0.0015004514,0.0074565094],"category_scores_gemma":[0.0050623347,0.0010668768,0.0013330544,0.003177571,0.003788757,0.011346764,0.0032119406,0.0022319527,0.0016113396],"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.000027181046,0.000006228485,0.00016011564,0.000035558984,0.000007352932,0.000049715738,0.0002991688,0.0003230282,0.00062293105,0.991384,0.0008288027,0.0062558455],"study_design_scores_gemma":[0.000009966491,0.000013852578,0.00016411992,0.000019767069,0.0000159928,0.00011574003,0.00008457907,0.0025031457,0.0008866864,0.9888732,0.007289653,0.000023187622],"about_ca_topic_score_codex":0.0011038571,"about_ca_topic_score_gemma":0.00088293053,"teacher_disagreement_score":0.0074565094,"about_ca_system_score_codex":0.0014331029,"about_ca_system_score_gemma":0.0012497874,"threshold_uncertainty_score":0.024944544},"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":"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.63389874,0.00096599525,0.25351638,0.0018511978,0.0007440717,0.00011846309,0.0005720424,0.0006770638,0.10765597],"genre_scores_gemma":[0.91510355,0.00045562835,0.034249537,0.000509942,0.00035234497,0.00017805962,0.00048460148,0.00023865605,0.04842767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.00030147558,0.00010656091,0.0002721546,0.00031098523,0.0003005423],"domain_scores_gemma":[0.99673444,0.0019012089,0.0003813883,0.00042283608,0.0002931991,0.00026683122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007223268,0.00075857353,0.0009568066,0.0017446248,0.0018117875,0.0027582769,0.0010807357,0.0014601634,0.012422773],"category_scores_gemma":[0.0038275295,0.00070404256,0.00087502075,0.0018641728,0.0021288483,0.0051849536,0.002955326,0.0017633036,0.0015329001],"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.00012879616,0.000034147837,0.0003857065,0.000068354544,0.00001043538,0.00039301204,0.0005920791,0.0009634569,0.0024984926,0.9820694,0.0012700093,0.011586124],"study_design_scores_gemma":[0.000024115283,0.000024302544,0.00020429627,0.000015301746,0.000007885187,0.00036632738,0.00012812178,0.0034830435,0.0007331534,0.9921744,0.002824854,0.00001431496],"about_ca_topic_score_codex":0.00049844343,"about_ca_topic_score_gemma":0.00049697043,"teacher_disagreement_score":0.012422773,"about_ca_system_score_codex":0.000725772,"about_ca_system_score_gemma":0.00047918645,"threshold_uncertainty_score":0.041558325},"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":"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.07113798,0.003672008,0.66576827,0.0100623,0.0037847713,0.00032517064,0.0061185714,0.12271823,0.11641283],"genre_scores_gemma":[0.46712098,0.0011924163,0.4302823,0.005438549,0.0016557091,0.00022003207,0.01186816,0.02583499,0.05638696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935644,0.002466763,0.00041046055,0.0016618129,0.0011318474,0.00076478504],"domain_scores_gemma":[0.9820886,0.0053523476,0.000279265,0.010534719,0.0014607803,0.00028440473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029746748,0.002422023,0.0024720046,0.0015669902,0.0016263919,0.0059293127,0.0028960055,0.0036515568,0.06876382],"category_scores_gemma":[0.01280018,0.0014982468,0.002664708,0.0025015124,0.0021074614,0.01492674,0.0056798095,0.0047373446,0.030633977],"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.0012999086,0.0003391422,0.0014608966,0.0016500223,0.00030619928,0.0009872202,0.0012357642,0.010836348,0.042493522,0.28229097,0.22360569,0.4334943],"study_design_scores_gemma":[0.00023496423,0.0001318617,0.001183155,0.00022470855,0.00040827217,0.0011566018,0.0006420787,0.098333284,0.037831094,0.7239553,0.13566932,0.00022937095],"about_ca_topic_score_codex":0.002236115,"about_ca_topic_score_gemma":0.004418231,"teacher_disagreement_score":0.06876382,"about_ca_system_score_codex":0.0013422711,"about_ca_system_score_gemma":0.0022795363,"threshold_uncertainty_score":0.23003793},"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":"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.018368147,0.0006741803,0.9722053,0.00026610374,0.00011384237,0.00017664414,0.0007908507,0.0035157753,0.0038891337],"genre_scores_gemma":[0.20102648,0.0003964143,0.78709495,0.0002812185,0.00009645784,0.00051167025,0.0022927807,0.00056108856,0.0077389097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785775,0.0005266558,0.00023984064,0.00032290653,0.0007265023,0.00032643034],"domain_scores_gemma":[0.99405056,0.0027911875,0.0002512995,0.0016040008,0.0010496407,0.00025321898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022039728,0.0008178362,0.0020092318,0.0017664983,0.0016116258,0.0020306024,0.0035253912,0.0015501744,0.012990009],"category_scores_gemma":[0.0105914455,0.00085018855,0.0009545448,0.0032069907,0.00091509614,0.003880775,0.00430724,0.0015190447,0.0035985457],"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.002549252,0.00041349354,0.002082944,0.0008723914,0.00012763483,0.00021717671,0.00031987592,0.20779175,0.007596912,0.075417094,0.029284881,0.67332655],"study_design_scores_gemma":[0.00022464791,0.0002933221,0.00028831887,0.00007081377,0.00006889961,0.00012959374,0.000078875906,0.8929481,0.00398152,0.094604105,0.007252585,0.000059122838],"about_ca_topic_score_codex":0.0043357466,"about_ca_topic_score_gemma":0.007821101,"teacher_disagreement_score":0.012990009,"about_ca_system_score_codex":0.001101098,"about_ca_system_score_gemma":0.0038513348,"threshold_uncertainty_score":0.0434559},"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":"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.06536133,0.0022958408,0.8921192,0.0056108916,0.00029745782,0.00052166707,0.0020302744,0.0012879077,0.030475277],"genre_scores_gemma":[0.49735004,0.0024293286,0.47409755,0.0013077708,0.0010698469,0.0009995583,0.0063379053,0.0013531117,0.015054885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965019,0.0010607053,0.00016225076,0.00053666084,0.0012391775,0.0004993759],"domain_scores_gemma":[0.9751152,0.020826364,0.00086333614,0.0014900462,0.0010521619,0.0006529058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032783647,0.0019648364,0.0022618985,0.0033239897,0.0017605142,0.004355611,0.004013218,0.0032256194,0.013888481],"category_scores_gemma":[0.02314342,0.00093282486,0.002620809,0.004267665,0.0020181101,0.0067149377,0.003138945,0.0038792805,0.0013164531],"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.0013636291,0.0006716929,0.0030338971,0.0013660729,0.00025636412,0.00036959798,0.00035097808,0.42156178,0.006524265,0.24554415,0.062350392,0.25660717],"study_design_scores_gemma":[0.00013761366,0.00017083494,0.00054552447,0.000098145116,0.00010316739,0.00029734816,0.00010197111,0.79943,0.0027268617,0.19151054,0.0048500965,0.000027869162],"about_ca_topic_score_codex":0.002555561,"about_ca_topic_score_gemma":0.003686264,"teacher_disagreement_score":0.013888481,"about_ca_system_score_codex":0.0031445024,"about_ca_system_score_gemma":0.0025362317,"threshold_uncertainty_score":0.046461582},"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":"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.6447857,0.0017575664,0.2765168,0.0034771205,0.00058378297,0.00020876473,0.00097640854,0.0012408072,0.07045307],"genre_scores_gemma":[0.93618983,0.0009935832,0.04556175,0.00070011296,0.0007833411,0.0003087015,0.0014276543,0.0006802087,0.013354877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918507,0.002109459,0.0007973684,0.0019502011,0.0019342223,0.0013579575],"domain_scores_gemma":[0.97400236,0.01614425,0.0025271275,0.0018102656,0.0030547797,0.0024612392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075916233,0.0009325214,0.002575401,0.0034093913,0.005215161,0.009536231,0.002313422,0.00239034,0.0072893086],"category_scores_gemma":[0.020577244,0.0015178077,0.00362409,0.0025641834,0.008687785,0.021196691,0.0069881994,0.00549254,0.0008850115],"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.00059404,0.0001306428,0.0012044262,0.00008907146,0.000042814747,0.0005798774,0.00262038,0.0010200719,0.002696719,0.98196584,0.00082374376,0.008232372],"study_design_scores_gemma":[0.000083062936,0.0001444904,0.00063740916,0.00005770152,0.00005219718,0.00069218286,0.00083715725,0.0065080556,0.0024331529,0.9853477,0.0031558946,0.000050894952],"about_ca_topic_score_codex":0.001360908,"about_ca_topic_score_gemma":0.00059806457,"teacher_disagreement_score":0.009536231,"about_ca_system_score_codex":0.0024365229,"about_ca_system_score_gemma":0.002166436,"threshold_uncertainty_score":0.040148795},"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":"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.0704647,0.0013205128,0.9087593,0.001459317,0.00021153034,0.00014917861,0.0031087045,0.010925627,0.0036010928],"genre_scores_gemma":[0.54970384,0.001711243,0.43199223,0.00081180036,0.0003010142,0.00036221056,0.00953503,0.0013815024,0.0042010886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946826,0.0013076131,0.000847019,0.0009031165,0.0020281249,0.000231546],"domain_scores_gemma":[0.98557496,0.01011354,0.00040362845,0.0024420351,0.001252808,0.000213032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028850136,0.0009708696,0.00212637,0.004277317,0.0009631425,0.0049363337,0.0020102703,0.0025796904,0.0033851792],"category_scores_gemma":[0.021847224,0.0010513954,0.001749378,0.006537326,0.001852539,0.011695066,0.0034993594,0.0020354774,0.0018100567],"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.0021983138,0.0004377683,0.007917009,0.0015434622,0.00041388805,0.0016883725,0.0021676049,0.0926416,0.04412044,0.28672206,0.025404362,0.53474516],"study_design_scores_gemma":[0.00011944233,0.00016496284,0.0005637764,0.00013606339,0.00017657198,0.0009291783,0.00063169753,0.510396,0.044734467,0.42190766,0.02014661,0.00009356567],"about_ca_topic_score_codex":0.0022701079,"about_ca_topic_score_gemma":0.0019968324,"teacher_disagreement_score":0.0049363337,"about_ca_system_score_codex":0.0011234061,"about_ca_system_score_gemma":0.001574625,"threshold_uncertainty_score":0.015257597},"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":"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.13657421,0.0027484964,0.7897645,0.0019884584,0.0003748416,0.00010783501,0.0013823984,0.0015288286,0.06553044],"genre_scores_gemma":[0.75599253,0.0018069892,0.20726672,0.00044606975,0.00024454147,0.00023131358,0.0018138418,0.00058382977,0.031614188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979651,0.0006034965,0.00015709776,0.00047125982,0.00050663296,0.00029635293],"domain_scores_gemma":[0.9962291,0.002018114,0.0002674843,0.00051105197,0.0006466861,0.0003275424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016100132,0.00070206105,0.000926008,0.0036167195,0.0027939966,0.0061556604,0.0012272917,0.002111823,0.0113571575],"category_scores_gemma":[0.0053257807,0.0009876315,0.0016920988,0.004476658,0.0038352185,0.009324581,0.0036391113,0.0027318501,0.0025579967],"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.00001555457,0.0000072457397,0.00018767896,0.000029095008,0.0000077822815,0.000071509065,0.00025674922,0.00071916747,0.0003903397,0.9936227,0.0006387998,0.004053328],"study_design_scores_gemma":[0.000011289173,0.0000074652544,0.0001506497,0.000014530188,0.000011068351,0.00010243871,0.00008768325,0.0038156654,0.00035338776,0.9887061,0.006726654,0.000013058158],"about_ca_topic_score_codex":0.0023713692,"about_ca_topic_score_gemma":0.0022328321,"teacher_disagreement_score":0.0113571575,"about_ca_system_score_codex":0.0020810014,"about_ca_system_score_gemma":0.0008083558,"threshold_uncertainty_score":0.03799349},"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":"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.11077315,0.0069055855,0.78137124,0.0041640825,0.0007792591,0.0000675887,0.00026782195,0.00042923636,0.095242],"genre_scores_gemma":[0.7442316,0.005030313,0.2064157,0.00070900423,0.00095583266,0.00019008639,0.00042904107,0.00037500352,0.041663364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877423,0.00047761807,0.00009804578,0.0003252643,0.00021005949,0.000114815964],"domain_scores_gemma":[0.9973425,0.0015340289,0.00013499318,0.00043888003,0.00033723007,0.00021240326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018556126,0.00090262294,0.00095181935,0.002408763,0.0020696013,0.0026957172,0.0012442239,0.0016485096,0.009295611],"category_scores_gemma":[0.005373682,0.00076289417,0.0013559309,0.003119765,0.004067533,0.009802089,0.004515227,0.0039059585,0.0011339238],"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.00002086074,0.000016428636,0.000096126285,0.000031085732,0.0000065874706,0.000059368143,0.00027662425,0.00074302574,0.000357799,0.98338425,0.00094137946,0.014066513],"study_design_scores_gemma":[0.0000034091006,0.000005059066,0.000032633692,0.000006091845,0.0000037657685,0.000047755173,0.00005977902,0.0017944152,0.00014101877,0.99540883,0.0024938816,0.0000033770268],"about_ca_topic_score_codex":0.000433189,"about_ca_topic_score_gemma":0.00046590314,"teacher_disagreement_score":0.009295611,"about_ca_system_score_codex":0.0008602213,"about_ca_system_score_gemma":0.00041202028,"threshold_uncertainty_score":0.031096935},"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":"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.081089996,0.0011663163,0.8813997,0.0013439168,0.0002862532,0.00007911362,0.0009963948,0.0030890384,0.03054933],"genre_scores_gemma":[0.68459696,0.0013078089,0.25776616,0.0011371705,0.00023261279,0.00034065027,0.0019029288,0.0027577507,0.049958017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844533,0.00031553686,0.00020693848,0.00026026915,0.00053599646,0.00023591614],"domain_scores_gemma":[0.9958105,0.0019373568,0.00025902147,0.0012807235,0.00046312905,0.00024933452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016802626,0.0005451161,0.000632405,0.0009566306,0.0010647598,0.002686517,0.0014519693,0.0011099746,0.008376155],"category_scores_gemma":[0.005474428,0.0005508282,0.0009531217,0.0015662906,0.0022003686,0.007443583,0.002858897,0.002561162,0.0017887343],"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.00019553424,0.000024404015,0.00023804155,0.00013897174,0.0000125495135,0.00011146807,0.0005258138,0.006780759,0.0051122336,0.93932974,0.0029910863,0.044539474],"study_design_scores_gemma":[0.000028399056,0.0000408041,0.0001078768,0.00004450461,0.000021138992,0.000215751,0.0001393865,0.019499792,0.010848425,0.9453318,0.023674343,0.000047767975],"about_ca_topic_score_codex":0.0006535414,"about_ca_topic_score_gemma":0.00077772833,"teacher_disagreement_score":0.008376155,"about_ca_system_score_codex":0.00081314344,"about_ca_system_score_gemma":0.0011278964,"threshold_uncertainty_score":0.028021038},"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":"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.05127667,0.00068186794,0.8460914,0.002538695,0.0007371977,0.00019116428,0.002124063,0.067181915,0.029176971],"genre_scores_gemma":[0.45520943,0.00069300196,0.47787666,0.0014095941,0.0005457345,0.00014461455,0.0029116946,0.026692774,0.034516487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531806,0.0012355224,0.00046256397,0.0010933597,0.0013306058,0.00055993174],"domain_scores_gemma":[0.9841287,0.011414105,0.00039850784,0.0021478508,0.0016859657,0.00022481277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067261653,0.0017617816,0.0021041126,0.0020829777,0.0018198184,0.005298122,0.0035684078,0.0037506127,0.02514048],"category_scores_gemma":[0.014692061,0.0032334987,0.0014556181,0.0026649425,0.002303035,0.011147766,0.004176717,0.0042699026,0.007914979],"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.001984278,0.00025699276,0.004191349,0.0010334189,0.00013212173,0.0031029484,0.004551397,0.010465204,0.03406305,0.49617627,0.06395022,0.3800928],"study_design_scores_gemma":[0.0002847592,0.00022638825,0.0017961946,0.00038749693,0.0005580411,0.0016133632,0.00094605505,0.16095303,0.17154051,0.5073641,0.15387776,0.0004522679],"about_ca_topic_score_codex":0.0063484376,"about_ca_topic_score_gemma":0.006265264,"teacher_disagreement_score":0.02514048,"about_ca_system_score_codex":0.0019370302,"about_ca_system_score_gemma":0.003475239,"threshold_uncertainty_score":0.084103346},"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":"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.031808272,0.0011264489,0.90146184,0.0026398555,0.00022568814,0.00015781257,0.0007019891,0.00062457606,0.06125361],"genre_scores_gemma":[0.7483772,0.0012655105,0.21215077,0.0005871494,0.00043567168,0.00047173066,0.00082987116,0.00021117451,0.035670944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752945,0.0007141878,0.000197839,0.00048804298,0.00083687465,0.00023360492],"domain_scores_gemma":[0.9961392,0.0017754043,0.00031254208,0.000888764,0.00063581637,0.0002483222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019961323,0.00071027596,0.0008538309,0.0017694648,0.0017945998,0.0065984614,0.0019769375,0.0016517799,0.008959395],"category_scores_gemma":[0.0070844106,0.00088006683,0.0013437733,0.0019310501,0.004625521,0.009971851,0.0021706212,0.0026777668,0.0016035822],"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.000007948645,0.0000064129163,0.000057356683,0.000007998864,0.0000045979937,0.00003500224,0.00010983382,0.0025649392,0.00014661258,0.9954745,0.00022296578,0.001361788],"study_design_scores_gemma":[0.00001759397,0.000009288416,0.000039940354,0.0000111869285,0.000018994686,0.000046193265,0.000055881967,0.021518111,0.00030169718,0.9726389,0.005331967,0.000010320655],"about_ca_topic_score_codex":0.006414923,"about_ca_topic_score_gemma":0.0038027707,"teacher_disagreement_score":0.008959395,"about_ca_system_score_codex":0.0023566375,"about_ca_system_score_gemma":0.0022582426,"threshold_uncertainty_score":0.029972136},"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":"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.021518592,0.00041790513,0.9690532,0.00037339522,0.00026349985,0.00018534031,0.0001370562,0.0026471904,0.0054038926],"genre_scores_gemma":[0.3261665,0.00027865474,0.6596407,0.00032923245,0.00014254679,0.00030670947,0.00044626006,0.00033264022,0.0123567665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989981,0.0002705244,0.00006133834,0.0001678445,0.00035612233,0.00014610437],"domain_scores_gemma":[0.9982048,0.0007449167,0.00007186186,0.000329397,0.0004953708,0.00015364589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014907484,0.00052392023,0.0011881153,0.0008326141,0.0017885877,0.001720566,0.002521074,0.0011890609,0.006368653],"category_scores_gemma":[0.003479497,0.00038315973,0.0005028814,0.0011394481,0.0004924792,0.0017755115,0.0017857958,0.001265827,0.0014429415],"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.0023163198,0.00115815,0.0016629356,0.00031293737,0.00019032144,0.00014500612,0.00034078606,0.16510174,0.023873795,0.1399551,0.02383465,0.6411082],"study_design_scores_gemma":[0.0004103238,0.00031614426,0.00032772787,0.00001953884,0.00007455212,0.00010778479,0.000041019524,0.9378672,0.00814158,0.040025193,0.012623289,0.000045617326],"about_ca_topic_score_codex":0.003272413,"about_ca_topic_score_gemma":0.0044504306,"teacher_disagreement_score":0.006368653,"about_ca_system_score_codex":0.00097155396,"about_ca_system_score_gemma":0.0025795996,"threshold_uncertainty_score":0.021305323},"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":"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.34247634,0.004884756,0.62160397,0.0015649347,0.00009310107,0.00023043682,0.000626948,0.00095389015,0.027565656],"genre_scores_gemma":[0.915819,0.0010255575,0.07644429,0.00020225877,0.00008586027,0.00016768274,0.000613148,0.00036730806,0.005274963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.0007420895,0.00006780638,0.00017900944,0.0006197612,0.0002693043],"domain_scores_gemma":[0.9674063,0.02882425,0.0009856876,0.0010066222,0.0012342617,0.00054284156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031181579,0.00046620614,0.001363084,0.0024796615,0.0008384466,0.0014717865,0.0022133433,0.0014120102,0.0071821604],"category_scores_gemma":[0.034355145,0.0006409947,0.00094418484,0.0020867675,0.0014468093,0.0028238425,0.002022168,0.0010456712,0.00061041483],"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.00040646965,0.00012720992,0.003172997,0.0003070215,0.00007199606,0.00012592682,0.00017167795,0.8144604,0.0018987883,0.13795568,0.0043909587,0.036910895],"study_design_scores_gemma":[0.000017034667,0.000032086853,0.00030288688,0.0000202861,0.000011770549,0.000061861356,0.000031746797,0.97761494,0.0003355547,0.021182692,0.00038128268,0.000007842776],"about_ca_topic_score_codex":0.0021629918,"about_ca_topic_score_gemma":0.0020817826,"teacher_disagreement_score":0.0071821604,"about_ca_system_score_codex":0.0015590725,"about_ca_system_score_gemma":0.0011186599,"threshold_uncertainty_score":0.024026692},"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":"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.036547083,0.00045899782,0.9146314,0.0011703987,0.00025219723,0.0003196261,0.0033608358,0.035827775,0.0074316673],"genre_scores_gemma":[0.15964986,0.00049376924,0.8175924,0.00039240214,0.0001179027,0.00027491178,0.008401017,0.006201248,0.0068764114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877053,0.00028639208,0.00009655934,0.00027655708,0.00044387823,0.00012607532],"domain_scores_gemma":[0.9951504,0.0036226935,0.00010968242,0.00046274788,0.000576194,0.00007826204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835605,0.0011304973,0.0016740797,0.0014850292,0.0010697468,0.002212041,0.0015080208,0.0015141071,0.0092424955],"category_scores_gemma":[0.006677561,0.0011991292,0.002228941,0.0018801544,0.0010184117,0.004365948,0.0024492654,0.0025654205,0.0056803375],"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.0006726094,0.00038647035,0.0024169018,0.002081222,0.00021888637,0.002095241,0.001672525,0.038255952,0.04938561,0.1205101,0.09405928,0.6882452],"study_design_scores_gemma":[0.0002501465,0.00022735645,0.0010279133,0.00026293396,0.00033837202,0.0011570081,0.0008379933,0.5001781,0.061229847,0.36092028,0.073418096,0.00015199232],"about_ca_topic_score_codex":0.0017894384,"about_ca_topic_score_gemma":0.003449479,"teacher_disagreement_score":0.0092424955,"about_ca_system_score_codex":0.00070811826,"about_ca_system_score_gemma":0.002172488,"threshold_uncertainty_score":0.030919254},"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":"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.31209928,0.0013951424,0.59956723,0.005592315,0.00037667964,0.00028979752,0.003072188,0.006049828,0.07155762],"genre_scores_gemma":[0.6470575,0.0005848004,0.3299653,0.00054603047,0.00021693217,0.00019409528,0.00407248,0.0009512243,0.016411647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986847,0.00041702116,0.00005634066,0.0002851093,0.00027597242,0.0002808886],"domain_scores_gemma":[0.99526274,0.003729399,0.0001732357,0.00051819044,0.00018230191,0.00013411332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079022656,0.0011787938,0.0009998627,0.000989345,0.000998929,0.002698715,0.0020268625,0.0014016037,0.0117957825],"category_scores_gemma":[0.005361162,0.0009294452,0.0019534773,0.0019135197,0.00098095,0.0043803942,0.0026048298,0.0026377435,0.0017949278],"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.0014272318,0.00048634797,0.0041804025,0.0012597197,0.00039726566,0.00042942984,0.0006126569,0.27195597,0.013961632,0.21801846,0.04130205,0.44596896],"study_design_scores_gemma":[0.00022819254,0.00015790292,0.00092030776,0.000086613734,0.00018909825,0.00020455252,0.0002789052,0.5210271,0.0111104185,0.4515659,0.014199962,0.000031133106],"about_ca_topic_score_codex":0.0043334253,"about_ca_topic_score_gemma":0.008359846,"teacher_disagreement_score":0.0117957825,"about_ca_system_score_codex":0.0013544371,"about_ca_system_score_gemma":0.0016029655,"threshold_uncertainty_score":0.039460838},"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":"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.005364931,0.00017223042,0.9893919,0.00014202067,0.00005361621,0.0001229798,0.000117702555,0.0008081601,0.0038264138],"genre_scores_gemma":[0.05889463,0.00018426853,0.9380245,0.000056400822,0.00003181663,0.00022165725,0.00029391237,0.00015440531,0.0021384638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987902,0.0003308609,0.000070140544,0.00022928974,0.00040668537,0.0001727559],"domain_scores_gemma":[0.9978637,0.0013033368,0.00015261234,0.0002819747,0.00030085488,0.00009758474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021066775,0.0013141143,0.0014016764,0.0023761424,0.0014306675,0.0015341735,0.002137554,0.0011439627,0.008423164],"category_scores_gemma":[0.0071519525,0.0010171211,0.0011642544,0.0024367906,0.0012057843,0.0024386703,0.0020219234,0.0015786609,0.0017675633],"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.0007201703,0.00025452356,0.00067799847,0.00038856908,0.000080611375,0.00015159356,0.0002985477,0.46671164,0.004388608,0.11475431,0.016287519,0.39528582],"study_design_scores_gemma":[0.00018041047,0.00013382199,0.00013659276,0.00003817536,0.0000386065,0.00012405461,0.000085568834,0.891627,0.0022363258,0.09842807,0.006944782,0.000026695567],"about_ca_topic_score_codex":0.0028942588,"about_ca_topic_score_gemma":0.0044170064,"teacher_disagreement_score":0.008423164,"about_ca_system_score_codex":0.0016923186,"about_ca_system_score_gemma":0.0038232158,"threshold_uncertainty_score":0.028178215},"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":"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.39311495,0.0028700093,0.5726547,0.0026003367,0.00031223884,0.00009628805,0.0011346766,0.0009021804,0.026314674],"genre_scores_gemma":[0.8792141,0.0016160536,0.09685416,0.00052814453,0.00053541735,0.0001665158,0.0015246905,0.00052927446,0.019031757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983668,0.0005406999,0.000077223085,0.0002623759,0.0004680676,0.00028479059],"domain_scores_gemma":[0.9836909,0.01141921,0.00111337,0.0014250713,0.0010007092,0.001350727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023275444,0.00061512145,0.0014434336,0.0031510317,0.0013869954,0.0031783143,0.0024541472,0.0019910622,0.00845368],"category_scores_gemma":[0.021699982,0.0009766202,0.00091397733,0.0029254993,0.0019643072,0.0054092035,0.0026089263,0.0024437145,0.0011020892],"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.00022865973,0.00005726817,0.0015914973,0.00017533053,0.00006020266,0.00013290167,0.00025472083,0.06176869,0.0021785235,0.8979176,0.0052053784,0.030429171],"study_design_scores_gemma":[0.00003437914,0.000041671818,0.00061246514,0.00003134474,0.00003426507,0.00014593135,0.000056472374,0.1850951,0.0006357037,0.81074303,0.0025489903,0.000020638532],"about_ca_topic_score_codex":0.0015511025,"about_ca_topic_score_gemma":0.0024904038,"teacher_disagreement_score":0.00845368,"about_ca_system_score_codex":0.0017871079,"about_ca_system_score_gemma":0.0008843725,"threshold_uncertainty_score":0.028280318},"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":"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.03661511,0.00050905073,0.9502811,0.0006563758,0.00034112198,0.00009358988,0.00012579432,0.0011078934,0.010270014],"genre_scores_gemma":[0.3455736,0.00027055797,0.63247216,0.0002189964,0.00014824695,0.00020653859,0.00034859506,0.00044617613,0.020315161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926704,0.00020602373,0.00003890657,0.00013159816,0.00021677674,0.00013960138],"domain_scores_gemma":[0.99886405,0.00044739168,0.00008249311,0.00028014416,0.00018488325,0.00014098467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014142232,0.0006262652,0.0014555834,0.0009157709,0.0012091646,0.0022593322,0.0025207624,0.0012757089,0.010685951],"category_scores_gemma":[0.0034728947,0.0005691248,0.0005167774,0.0014264949,0.0008478198,0.0030822677,0.0027176049,0.0022510053,0.0015276545],"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.0030996094,0.00090975256,0.0008421912,0.00053497613,0.00010786063,0.00016196663,0.0002553146,0.18164687,0.00849532,0.42217895,0.017135039,0.36463222],"study_design_scores_gemma":[0.00040015293,0.00023925123,0.00020743572,0.000036494064,0.000038374532,0.00011016502,0.0000772939,0.814858,0.0053234873,0.17107758,0.00760159,0.00003013942],"about_ca_topic_score_codex":0.0012426049,"about_ca_topic_score_gemma":0.0023248938,"teacher_disagreement_score":0.010685951,"about_ca_system_score_codex":0.0011295408,"about_ca_system_score_gemma":0.0025448569,"threshold_uncertainty_score":0.035748065},"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":"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.14339982,0.0006988019,0.817077,0.00086230575,0.00025068925,0.00006792622,0.00048813812,0.0012080175,0.03594732],"genre_scores_gemma":[0.88281643,0.0005384885,0.09877397,0.0002876788,0.0003883914,0.00015285268,0.00084920094,0.00036908122,0.015823897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643964,0.0010218264,0.00043627428,0.0010091899,0.0005332567,0.0005598143],"domain_scores_gemma":[0.9946339,0.0021763793,0.000445837,0.0014113272,0.0010139227,0.00031871014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026547306,0.00060505467,0.0010086289,0.0020549626,0.0015992594,0.004900941,0.0016936436,0.0010735103,0.0070968787],"category_scores_gemma":[0.0058809184,0.00072554033,0.0017855272,0.0025248239,0.0038901174,0.009858115,0.0050416575,0.0029295147,0.00093625736],"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.00004360062,0.000022854601,0.00013224233,0.000025728683,0.000007071651,0.00003808659,0.0003681275,0.0008065908,0.0010196127,0.9876802,0.00038742725,0.009468535],"study_design_scores_gemma":[0.000019247616,0.000041910283,0.00024487224,0.000016965581,0.0000239901,0.00010062867,0.00017336276,0.009851759,0.0020164456,0.9833213,0.004167173,0.000022210588],"about_ca_topic_score_codex":0.00079821976,"about_ca_topic_score_gemma":0.00061555253,"teacher_disagreement_score":0.0070968787,"about_ca_system_score_codex":0.0014198769,"about_ca_system_score_gemma":0.00070870563,"threshold_uncertainty_score":0.023741424},"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":"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.60642135,0.0011027124,0.3286216,0.0013104196,0.00021211596,0.0001163489,0.0011815279,0.000394562,0.06063941],"genre_scores_gemma":[0.9401403,0.0003101624,0.050961837,0.00030255996,0.00021322232,0.00019106254,0.0011484012,0.00012399015,0.006608366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702924,0.00068666204,0.0003365968,0.0008776387,0.0007536661,0.00031618687],"domain_scores_gemma":[0.98652786,0.009351639,0.0009572219,0.0010501007,0.0012475024,0.0008657025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023923158,0.0004572039,0.00093190983,0.0026641376,0.0029509165,0.006603005,0.0016274877,0.0010559014,0.0054361834],"category_scores_gemma":[0.010744819,0.0009263592,0.0014585666,0.0022892524,0.0053875255,0.008095648,0.0026404508,0.0023694388,0.0005547524],"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.00017474838,0.000039025785,0.0012735028,0.000085265514,0.000032737415,0.00032270083,0.0013079895,0.00102054,0.0036493181,0.9856793,0.0004830694,0.0059319017],"study_design_scores_gemma":[0.000039845072,0.000041557843,0.0008463837,0.000027271253,0.00003131887,0.0005447295,0.00046926635,0.006810581,0.0029346957,0.98463124,0.003595738,0.000027404085],"about_ca_topic_score_codex":0.0005175235,"about_ca_topic_score_gemma":0.00042693372,"teacher_disagreement_score":0.006603005,"about_ca_system_score_codex":0.0010325103,"about_ca_system_score_gemma":0.00046692684,"threshold_uncertainty_score":0.018185854},"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":"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.6657583,0.0009059437,0.111597225,0.0029710091,0.0028465872,0.00023645365,0.0010132996,0.0022597234,0.2124114],"genre_scores_gemma":[0.85103995,0.00024134267,0.060130194,0.0007077799,0.00030030342,0.00017590115,0.0009640137,0.0003592208,0.08608134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949896,0.00007401086,0.00005041185,0.00013269903,0.00009064896,0.00015319473],"domain_scores_gemma":[0.99895084,0.00033976612,0.00015756338,0.00015667663,0.00024426106,0.00015089358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031051695,0.00064723723,0.00055153976,0.0006220802,0.002327446,0.0016058198,0.0005719289,0.0016672696,0.014228316],"category_scores_gemma":[0.0011531195,0.0003580794,0.0007672431,0.0007398831,0.0016637675,0.0016790264,0.0010763438,0.0011270597,0.004438358],"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.00089165824,0.00015984311,0.0011203232,0.00050468545,0.000059240232,0.006856649,0.0039137797,0.0008077358,0.08630811,0.82652664,0.011838215,0.061013058],"study_design_scores_gemma":[0.00012895856,0.0007783697,0.0025139744,0.00027004117,0.00012035734,0.0062496513,0.0027565316,0.005099197,0.05570849,0.76571316,0.16048914,0.00017212366],"about_ca_topic_score_codex":0.00038408532,"about_ca_topic_score_gemma":0.00051617634,"teacher_disagreement_score":0.014228316,"about_ca_system_score_codex":0.0005681769,"about_ca_system_score_gemma":0.0007603807,"threshold_uncertainty_score":0.04759848},"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":"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.04101315,0.0003712907,0.9503887,0.00074320234,0.000115265364,0.00026068513,0.00015389123,0.0016611278,0.0052926484],"genre_scores_gemma":[0.16332667,0.00015782441,0.83043844,0.00024245746,0.0000532805,0.00026879067,0.00045504438,0.00040838082,0.0046490924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986449,0.00033768287,0.000099061144,0.00028693423,0.00043130116,0.0002001531],"domain_scores_gemma":[0.9983639,0.000775673,0.00008399516,0.00036761304,0.0003404748,0.00006830582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831536,0.0005766241,0.0008737235,0.0012249418,0.0007771679,0.0011945405,0.0018141235,0.001144915,0.005252604],"category_scores_gemma":[0.005602912,0.00046192607,0.00075432047,0.0021949501,0.0010281291,0.0028522727,0.0022866542,0.001716859,0.0012422345],"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.00073787867,0.00016136198,0.0012948945,0.00022361163,0.00007696641,0.00030232154,0.00058594183,0.10704378,0.014244047,0.22507657,0.014437625,0.635815],"study_design_scores_gemma":[0.00029507477,0.00015273775,0.0004306451,0.00004794163,0.0000469446,0.00020466617,0.00017285928,0.71160114,0.010274248,0.25873965,0.017986337,0.000047824593],"about_ca_topic_score_codex":0.0039226185,"about_ca_topic_score_gemma":0.004886625,"teacher_disagreement_score":0.005252604,"about_ca_system_score_codex":0.0011612423,"about_ca_system_score_gemma":0.0020404642,"threshold_uncertainty_score":0.017571688},"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":"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.6280048,0.002756074,0.29334185,0.026297152,0.00042896526,0.0001382051,0.0015375504,0.00081879954,0.046676617],"genre_scores_gemma":[0.96681446,0.0007128111,0.023761362,0.00059923955,0.0005105106,0.00014465665,0.00051269296,0.00029500923,0.006649255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994303,0.002655575,0.000353188,0.0009702125,0.0011302446,0.00058774883],"domain_scores_gemma":[0.8226803,0.16184728,0.0032241764,0.005868383,0.0027256394,0.0036542474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167137,0.0007354239,0.0030784265,0.0021608677,0.0022172388,0.0076216348,0.0036875168,0.0036699746,0.011612464],"category_scores_gemma":[0.066039644,0.001196097,0.0012999307,0.002782556,0.008592311,0.028557686,0.0047593107,0.0051600146,0.0005973342],"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.00038724084,0.00011896588,0.0016831832,0.00016199399,0.00003491089,0.00015331038,0.00060641393,0.011627595,0.0013779367,0.966771,0.0032783614,0.01379918],"study_design_scores_gemma":[0.000036886704,0.000023376238,0.00023662092,0.000016502827,0.000012204159,0.00007754236,0.00009931231,0.027686408,0.00041287535,0.9707618,0.0006174907,0.000018928797],"about_ca_topic_score_codex":0.0012521555,"about_ca_topic_score_gemma":0.00082611706,"teacher_disagreement_score":0.011612464,"about_ca_system_score_codex":0.002740684,"about_ca_system_score_gemma":0.0017261197,"threshold_uncertainty_score":0.043192446},"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":"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.46212548,0.00083207246,0.42918634,0.0024506832,0.00036499943,0.00020189543,0.0013404978,0.00038883902,0.1031092],"genre_scores_gemma":[0.8153333,0.0014278537,0.12503177,0.00042125199,0.00026424453,0.00019486438,0.0018863708,0.00036377,0.055076577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958354,0.000103603845,0.000020683157,0.00010635629,0.00006927756,0.00011654748],"domain_scores_gemma":[0.99872416,0.00071854005,0.00014399027,0.0001520933,0.00009942707,0.00016185617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059693755,0.0010450782,0.0012338844,0.0009027721,0.0011017632,0.0020441378,0.0014597136,0.0021709679,0.013430586],"category_scores_gemma":[0.0029196674,0.0005474866,0.00082155375,0.0018919223,0.0010988384,0.003248504,0.0013985623,0.0020514843,0.0010737445],"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.00051794556,0.00029760165,0.0009842613,0.00048545987,0.000072510295,0.0010335924,0.00034985444,0.31336647,0.007505259,0.55879855,0.024132008,0.09245649],"study_design_scores_gemma":[0.00007747914,0.00012480843,0.00061810977,0.00005404625,0.000035029658,0.00043287897,0.00028429725,0.43699598,0.0038215828,0.54767686,0.00984686,0.00003205031],"about_ca_topic_score_codex":0.0024045396,"about_ca_topic_score_gemma":0.001732359,"teacher_disagreement_score":0.013430586,"about_ca_system_score_codex":0.00090507267,"about_ca_system_score_gemma":0.0006070226,"threshold_uncertainty_score":0.044929802},"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":"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.07198087,0.00069601904,0.91449255,0.0007265194,0.00008840871,0.00010093646,0.0012192935,0.0066382056,0.0040571783],"genre_scores_gemma":[0.4401804,0.00073513674,0.5529102,0.00014907659,0.000046809288,0.00023954426,0.0019276534,0.0012531815,0.0025579631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915314,0.00033725495,0.000046573885,0.00016378505,0.00018607591,0.00011321951],"domain_scores_gemma":[0.9972615,0.0014211251,0.0002513291,0.00040036708,0.00039148724,0.00027416856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877047,0.0009957502,0.0010923418,0.001336397,0.0005667712,0.001751958,0.0010773763,0.00070050545,0.004870236],"category_scores_gemma":[0.0050369953,0.0005712615,0.0007449637,0.0014798575,0.0004524776,0.0025565384,0.0019709836,0.0011142764,0.0007793033],"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.002187032,0.00029524567,0.0029979746,0.0010258252,0.0001775269,0.00097195304,0.0011194272,0.49242595,0.111455835,0.10540829,0.032806717,0.24912822],"study_design_scores_gemma":[0.00009084436,0.0000895224,0.00085858675,0.0000657391,0.000023822751,0.00018197615,0.00020121805,0.8961655,0.015541069,0.07646335,0.010283497,0.00003485525],"about_ca_topic_score_codex":0.0026487466,"about_ca_topic_score_gemma":0.0026786574,"teacher_disagreement_score":0.004870236,"about_ca_system_score_codex":0.0010039887,"about_ca_system_score_gemma":0.0005153202,"threshold_uncertainty_score":0.016292572},"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":"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.008179506,0.00015246168,0.98468137,0.0001257962,0.000034240456,0.0001347632,0.0001574274,0.002023056,0.0045113536],"genre_scores_gemma":[0.13054013,0.00012691836,0.8659161,0.00013864244,0.000017008668,0.00023949464,0.00045158796,0.0005543751,0.002015726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990507,0.00027228636,0.00007103975,0.00017395407,0.00033337492,0.000098788776],"domain_scores_gemma":[0.9981981,0.0012406346,0.00011056464,0.00014804625,0.0002434512,0.000059200407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012589392,0.001033788,0.00069072674,0.001286382,0.000446145,0.001044203,0.0012978844,0.0010810832,0.011000724],"category_scores_gemma":[0.005354581,0.0005760792,0.0012262668,0.0009693312,0.000855341,0.0011193025,0.0013474636,0.0011144748,0.0020225055],"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.00021600636,0.00014064317,0.0017946974,0.00053815974,0.000093548995,0.0002778265,0.00022962881,0.5115232,0.012143508,0.0800471,0.008295622,0.3847],"study_design_scores_gemma":[0.000047031204,0.00004047451,0.000060473063,0.00002915798,0.00001542858,0.000042890206,0.000022951628,0.9787724,0.0026698369,0.014468586,0.003824124,0.000006631258],"about_ca_topic_score_codex":0.0035513802,"about_ca_topic_score_gemma":0.006956123,"teacher_disagreement_score":0.011000724,"about_ca_system_score_codex":0.0010494286,"about_ca_system_score_gemma":0.0027549788,"threshold_uncertainty_score":0.0368011},"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":"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.7609815,0.0016332311,0.13252509,0.0020723422,0.000135522,0.00010923636,0.001180442,0.00038059248,0.10098202],"genre_scores_gemma":[0.93006533,0.0017466111,0.045336675,0.00072663627,0.00020739768,0.00009617819,0.001722163,0.000314094,0.0197849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995926,0.000102616425,0.0000142106965,0.00007944753,0.00010788244,0.00010337797],"domain_scores_gemma":[0.9981177,0.0009293847,0.00026947373,0.00016423501,0.00024937867,0.00026984766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045634725,0.0005267516,0.0010658548,0.0019009464,0.0012803327,0.0027389093,0.0011335916,0.0013942331,0.009690197],"category_scores_gemma":[0.0032458184,0.0006401163,0.0006647735,0.0020124307,0.0015474587,0.0035742077,0.0016851777,0.0020842003,0.0016549007],"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.00023309578,0.00006811335,0.0008947302,0.0001498276,0.000022830047,0.00019813585,0.00065164745,0.008172369,0.003545736,0.9606991,0.0075370856,0.01782732],"study_design_scores_gemma":[0.000029497747,0.000028388218,0.0007437497,0.000048306065,0.000017753648,0.00014984478,0.00024076657,0.027573407,0.00078864186,0.966556,0.0038129443,0.000010800333],"about_ca_topic_score_codex":0.0036390545,"about_ca_topic_score_gemma":0.004288491,"teacher_disagreement_score":0.009690197,"about_ca_system_score_codex":0.0009253853,"about_ca_system_score_gemma":0.000537294,"threshold_uncertainty_score":0.03241694},"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":"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.7714636,0.0006367267,0.18542846,0.0032554714,0.00009766201,0.000092326,0.0015163111,0.00040669652,0.037102763],"genre_scores_gemma":[0.9850449,0.00026675564,0.007471853,0.000114960494,0.00008498486,0.000075680444,0.0007106831,0.000087019886,0.006143149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978758,0.0005167701,0.00014432351,0.00036870624,0.0006331259,0.0004612889],"domain_scores_gemma":[0.9713109,0.02270707,0.0014043171,0.0017039209,0.0015345755,0.0013393251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019772593,0.0005958198,0.0015187996,0.0016626534,0.0019211153,0.006321935,0.0019652075,0.001961641,0.014221417],"category_scores_gemma":[0.01759791,0.0007156732,0.0015946947,0.0021402196,0.0030412509,0.011277941,0.003026035,0.0033019327,0.00067513407],"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.00035286488,0.00007381876,0.0016854971,0.00012260088,0.000028470036,0.00017133956,0.00070241676,0.025189044,0.0014957007,0.95916206,0.0016402098,0.009376048],"study_design_scores_gemma":[0.000038546008,0.000024260637,0.0006424452,0.000014599055,0.000026363443,0.000103631115,0.00016559716,0.07766016,0.00087914657,0.9196923,0.00072622305,0.000026850543],"about_ca_topic_score_codex":0.0027703529,"about_ca_topic_score_gemma":0.0019264687,"teacher_disagreement_score":0.014221417,"about_ca_system_score_codex":0.0023379305,"about_ca_system_score_gemma":0.001601212,"threshold_uncertainty_score":0.047575414},"labels":[],"label_agreement":null}]}