{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":182,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":182,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"f65248b65cd1","filters":{"venue":"International Journal of Foundations of Computer Science"}},"results":[{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","authors":[{"name":"Martin Charles Golumbic","is_ca":false},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02382651196834527,"gpt":0.3362367416029343,"spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054373,0.0003025955,0.0003901796,0.001149104,0.0008734639,0.001719584,0.0007539029,0.0004423125,0.002233714],"category_scores_gemma":[0.005601342,0.000364445,0.0003972832,0.00102498,0.001914187,0.003416607,0.0009721887,0.0009519958,0.0001659174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116865,"about_ca_system_score_gemma":0.0004120325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665839,"about_ca_topic_score_gemma":0.001488971,"domain_scores_codex":[0.9994237,0.0001160072,0.00002208215,0.0001877651,0.0001130298,0.0001373666],"domain_scores_gemma":[0.9944561,0.004009391,0.0005132034,0.0003940843,0.0002322555,0.0003950461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006772538,0.0001288361,0.01337403,0.0002293605,0.0000750141,0.0002823367,0.001550283,0.04251962,0.0139515,0.8888129,0.004676673,0.0337222],"study_design_scores_gemma":[0.00005984877,0.0000866476,0.006958581,0.00005306111,0.00004532424,0.0003992618,0.0004893121,0.1047257,0.00497028,0.8750736,0.007097122,0.00004123443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9390916,0.0007694262,0.04584203,0.0008202693,0.00002168014,0.0000229358,0.0005413171,0.0001227723,0.01276787],"genre_scores_gemma":[0.9876752,0.0002562794,0.01020359,0.0000970467,0.00005454397,0.00002885129,0.0003355907,0.00005943309,0.001289491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002233714,"threshold_uncertainty_score":0.00810349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","authors":[{"name":"Giovanni Pighizzini","is_ca":false},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02369577806896057,"gpt":0.2801950661256422,"spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931417,0.000906055,0.001200214,0.001565384,0.001228548,0.00352002,0.002052621,0.001188796,0.007256537],"category_scores_gemma":[0.009501645,0.0004306402,0.001028871,0.001858462,0.004324009,0.01199916,0.0022718,0.002351001,0.0009400007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942091,"about_ca_system_score_gemma":0.001626368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001122223,"about_ca_topic_score_gemma":0.001324844,"domain_scores_codex":[0.9977909,0.0003611724,0.0001305085,0.0002813637,0.0008775665,0.0005584907],"domain_scores_gemma":[0.9852825,0.01055906,0.0007553835,0.002351179,0.0006356636,0.0004162041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004055391,0.0001098505,0.001687902,0.0001879348,0.00002245298,0.0001146508,0.0002704202,0.04996889,0.004823766,0.8965191,0.002372849,0.04351666],"study_design_scores_gemma":[0.00003715778,0.0001253168,0.0006677863,0.0000346103,0.00004584376,0.0001418593,0.00009682226,0.1656391,0.01076936,0.8179304,0.004459183,0.00005266731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5543284,0.002273705,0.3890897,0.003117055,0.0002061894,0.0001441671,0.0005429266,0.001395308,0.04890245],"genre_scores_gemma":[0.9194372,0.0008728427,0.07064664,0.0001883037,0.0001388375,0.0001724647,0.0003019615,0.0003278701,0.007913838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007256537,"threshold_uncertainty_score":0.02427554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099641843","doi":"10.1142/s0129054103002011","title":"EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum error correction; Quantum; Computer science; Error detection and correction; Theoretical computer science; Mathematics; Topology (electrical circuits); Quantum mechanics; Algorithm; Physics; Combinatorics","authors":[{"name":"Markus Grassl","is_ca":false},{"name":"Martin Rötteler","is_ca":true},{"name":"Thomas Beth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02039125300906239,"gpt":0.3038096427327279,"spread":0.2834183897236655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101711,0.0007079051,0.0006925344,0.000677242,0.0007951304,0.001625185,0.00188564,0.00135775,0.007853623],"category_scores_gemma":[0.004244192,0.0003551385,0.0006276012,0.0006514641,0.001570083,0.002652401,0.001469939,0.001749792,0.00122328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258847,"about_ca_system_score_gemma":0.001073744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005023372,"about_ca_topic_score_gemma":0.001230954,"domain_scores_codex":[0.9984924,0.000418591,0.00007055356,0.0001316798,0.0007236572,0.0001630831],"domain_scores_gemma":[0.9980583,0.0009216173,0.0001285815,0.0005356042,0.0002892243,0.00006662299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001310382,0.0001199771,0.0001540495,0.0002546997,0.00003022142,0.00008044983,0.00009880326,0.04438265,0.01382349,0.8676872,0.003092615,0.07014473],"study_design_scores_gemma":[0.0001796117,0.0001874157,0.0002620567,0.0000599084,0.00004355321,0.0001919665,0.00003525876,0.4981947,0.03425913,0.4431403,0.02339224,0.00005388792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02787983,0.001101854,0.9540546,0.001040172,0.000319797,0.0001844239,0.0001286943,0.0008201932,0.01447041],"genre_scores_gemma":[0.4494069,0.001086739,0.5369763,0.0004263054,0.0002659911,0.000415689,0.000269596,0.0002311552,0.01092134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007853623,"threshold_uncertainty_score":0.02627301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Sylvie Hamel","is_ca":true},{"name":"Maurice Nivat","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03640076233099542,"gpt":0.301955305417043,"spread":0.2655545430860475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316542,0.0004778468,0.0009281465,0.001367556,0.001293887,0.003640761,0.001187078,0.001418074,0.004308236],"category_scores_gemma":[0.01328376,0.000660231,0.0008240293,0.001351218,0.003605915,0.006949874,0.001882669,0.001964067,0.0004917739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561082,"about_ca_system_score_gemma":0.0005630857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005779496,"about_ca_topic_score_gemma":0.0005203598,"domain_scores_codex":[0.9986225,0.0003461805,0.0001261686,0.0003197287,0.0004015906,0.0001838735],"domain_scores_gemma":[0.9851665,0.01219413,0.001103122,0.0006125353,0.000555089,0.0003685936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001776874,0.00008867344,0.001910393,0.0003330489,0.00002410232,0.0004597357,0.001612781,0.02608203,0.006284865,0.9439925,0.0008164374,0.0182178],"study_design_scores_gemma":[0.00003507749,0.00007488931,0.0006257821,0.00005044958,0.00001866287,0.0002558623,0.0002448566,0.03422474,0.002445436,0.9596136,0.002380346,0.00003017289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7932621,0.001697415,0.168922,0.002312523,0.00006894378,0.0001030328,0.000323506,0.0001848652,0.03312578],"genre_scores_gemma":[0.9617866,0.0007426891,0.03091213,0.000163393,0.0002109888,0.000136935,0.000388357,0.00006923293,0.005589597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004308236,"threshold_uncertainty_score":0.01441246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02637070741872171,"gpt":0.3423945622337794,"spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006285204,0.0009480452,0.0006959275,0.001480015,0.001951529,0.004305024,0.001702767,0.001531222,0.005449885],"category_scores_gemma":[0.01343328,0.001023704,0.001451682,0.00233618,0.0117636,0.01278266,0.002627136,0.004492398,0.0009879364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002443261,"about_ca_system_score_gemma":0.001641614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282418,"about_ca_topic_score_gemma":0.0006739059,"domain_scores_codex":[0.9939721,0.002323994,0.000564099,0.001302325,0.001392219,0.0004450853],"domain_scores_gemma":[0.985837,0.009533812,0.001107167,0.001804688,0.001398354,0.0003189734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005847624,0.000007816318,0.00005758181,0.00004747744,0.000002822125,0.00008797855,0.0003335796,0.0006810165,0.0003266375,0.9955654,0.0003471595,0.002536822],"study_design_scores_gemma":[0.00001825271,0.00004171875,0.0001177684,0.0001126129,0.00001781715,0.0004946262,0.0004157349,0.01048642,0.001985574,0.9107783,0.07550994,0.00002114673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02633624,0.003254746,0.905077,0.005541334,0.0003069598,0.0002196946,0.0002816281,0.0005745373,0.05840777],"genre_scores_gemma":[0.5367483,0.00394132,0.4287268,0.001731754,0.000957115,0.0007519803,0.0006275937,0.0004339858,0.02608118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006285204,"threshold_uncertainty_score":0.03323972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076994310","doi":"10.1142/s0129054103001741","title":"A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected dominating set; Dominating set; Mobile ad hoc network; Wireless ad hoc network; Computer science; Cluster analysis; Vertex (graph theory); Graph; Algorithm; Mathematics; Theoretical computer science; Computer network; Wireless; Artificial intelligence","authors":[{"name":"Yuanzhu Peter Chen","is_ca":true},{"name":"Arthur L. Liestman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01905439722890007,"gpt":0.3031961872650348,"spread":0.2841417900361347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159938,0.0009471163,0.0008994456,0.002124692,0.001514492,0.001536125,0.002006961,0.001156138,0.003899787],"category_scores_gemma":[0.00481925,0.0004840548,0.0006323527,0.003196181,0.001007938,0.002558502,0.001972164,0.001058805,0.001651431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161564,"about_ca_system_score_gemma":0.001643386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00652884,"about_ca_topic_score_gemma":0.009337933,"domain_scores_codex":[0.9987834,0.0003362316,0.0000772215,0.0002528796,0.0004569016,0.00009332912],"domain_scores_gemma":[0.998749,0.0003632198,0.0001139927,0.0002722428,0.0004406722,0.00006095467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002592399,0.00008714652,0.00105354,0.0003185551,0.0001223489,0.00009451486,0.0003143682,0.4105317,0.007602501,0.07206834,0.01486827,0.4926795],"study_design_scores_gemma":[0.00007720827,0.0001068123,0.0003356283,0.00003436764,0.00003579273,0.0001745058,0.00009351035,0.9031618,0.003227372,0.04767531,0.0450259,0.00005186668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003014972,0.0005630007,0.9933301,0.0001472515,0.00009383309,0.0001438389,0.00007132791,0.0006544783,0.001981223],"genre_scores_gemma":[0.05772071,0.0007958089,0.9350984,0.0001615378,0.00007998387,0.0003783588,0.0004238752,0.0001832769,0.005157963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00652884,"threshold_uncertainty_score":0.01304609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","authors":[{"name":"Émilie Charlier","is_ca":true},{"name":"Narad Rampersad","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02306499012198243,"gpt":0.278462639676021,"spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063018,0.0004625844,0.0003958074,0.0009485151,0.00109934,0.00191605,0.001175314,0.000693583,0.003677712],"category_scores_gemma":[0.006650012,0.0004289941,0.001078287,0.001032865,0.002540268,0.00432832,0.001426856,0.001836107,0.0004360247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141092,"about_ca_system_score_gemma":0.0007205314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006543523,"about_ca_topic_score_gemma":0.0008350373,"domain_scores_codex":[0.9984025,0.0003832766,0.0001598391,0.0004242983,0.0004063693,0.000223679],"domain_scores_gemma":[0.9915759,0.006455371,0.0006909456,0.0006815016,0.0004028467,0.0001934801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001446904,0.0001146228,0.002190377,0.0001970756,0.00002309192,0.0005229223,0.001124685,0.01685335,0.01634671,0.926371,0.001128522,0.03498292],"study_design_scores_gemma":[0.00002323124,0.00004880004,0.0005640399,0.00003732541,0.00001936742,0.0004065455,0.0001514284,0.05186465,0.01278738,0.9301479,0.003918521,0.00003082154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5097392,0.0005943916,0.4482947,0.0007935938,0.00007621153,0.00009015438,0.0004220656,0.00112332,0.03886637],"genre_scores_gemma":[0.936739,0.0002495025,0.05623218,0.0001156804,0.0001006048,0.0001224527,0.0004907629,0.0001163467,0.0058334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003677712,"threshold_uncertainty_score":0.01230323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091969952","doi":"10.1142/s0129054111008295","title":"UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Grid; Asynchronous communication; Occupancy grid mapping; Mobile robot; Constructive proof; Distributed computing; Artificial intelligence; Mathematics; Computer network; Geometry","authors":[{"name":"Lali Barrière","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Eduardo Mesa-Barrameda","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03563350950154959,"gpt":0.3052799339019074,"spread":0.2696464244003579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036005,0.0005446977,0.0007166595,0.0005201552,0.0007896157,0.0009861882,0.0009095047,0.0008086494,0.001173256],"category_scores_gemma":[0.004671213,0.0003570676,0.000605623,0.0005087425,0.001888493,0.001784521,0.003090679,0.0008122071,0.0002455581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007720289,"about_ca_system_score_gemma":0.0005269726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00223285,"about_ca_topic_score_gemma":0.001070181,"domain_scores_codex":[0.9991027,0.0003069184,0.00004306317,0.0001510922,0.0002020334,0.0001941573],"domain_scores_gemma":[0.9972423,0.001759614,0.0003182543,0.0002756045,0.0002301123,0.0001740876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003226356,0.00005263888,0.002513485,0.0001025206,0.00005400942,0.000832185,0.0003379622,0.7980113,0.00692476,0.1796085,0.0007593446,0.01048063],"study_design_scores_gemma":[0.00004366293,0.00006156903,0.0001622368,0.00000737077,0.000007988101,0.00005872437,0.0001054786,0.9213091,0.00145318,0.07617585,0.000606353,0.000008453869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.209561,0.0001922858,0.7839599,0.0004522172,0.00003716232,0.00007209156,0.00006116709,0.0001728285,0.005491308],"genre_scores_gemma":[0.9447655,0.0001945971,0.05182517,0.00007128674,0.00002276024,0.0001222946,0.00009300489,0.00004116352,0.002864237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00223285,"threshold_uncertainty_score":0.005601466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975121090","doi":"10.1142/s012905410200145x","title":"COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","authors":[{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false},{"name":"Grzegorz Rozenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01656679589912971,"gpt":0.2873662264388591,"spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612884,0.0005070872,0.0008074878,0.0005290686,0.002117482,0.002616085,0.001172513,0.001619908,0.003298513],"category_scores_gemma":[0.003147248,0.0003205417,0.0009597282,0.0007876224,0.003834594,0.008022271,0.002725874,0.001435257,0.0005799005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250893,"about_ca_system_score_gemma":0.000815495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001070149,"about_ca_topic_score_gemma":0.0007653423,"domain_scores_codex":[0.999079,0.0003641554,0.00004584213,0.0001725809,0.0001784323,0.0001599783],"domain_scores_gemma":[0.9989393,0.0005999972,0.00008920543,0.0002033155,0.00008730969,0.00008090704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002246769,0.000008639395,0.00006280467,0.00004533926,0.000006699017,0.00005016072,0.00007470333,0.01833706,0.0007761228,0.9775506,0.0003469138,0.002718591],"study_design_scores_gemma":[0.00001681881,0.00001378838,0.00004153416,0.00001292924,0.000006531396,0.00005629264,0.00004289953,0.06003025,0.0007148396,0.9350234,0.004029554,0.0000110701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2649757,0.005023587,0.6306723,0.006564207,0.0006644758,0.000143603,0.0001809397,0.0004497505,0.09132545],"genre_scores_gemma":[0.8965641,0.002680126,0.0889413,0.0004433755,0.0002877463,0.0002427642,0.00012233,0.00008098227,0.01063724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298513,"threshold_uncertainty_score":0.01103467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","authors":[{"name":"Janusz Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02001200027157618,"gpt":0.3211004986114298,"spread":0.3010884983398536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001866657,0.0007884946,0.001219034,0.002279284,0.0007150092,0.003333818,0.001083364,0.0008816142,0.003002575],"category_scores_gemma":[0.0115194,0.0007697021,0.00138356,0.001988752,0.001612241,0.004411703,0.001857539,0.001303066,0.0008935669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009645471,"about_ca_system_score_gemma":0.001172531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006855727,"about_ca_topic_score_gemma":0.0007644857,"domain_scores_codex":[0.9979324,0.0005036138,0.0001505986,0.0005805328,0.0006518752,0.0001809005],"domain_scores_gemma":[0.9924743,0.004991744,0.0009450942,0.000808412,0.0005649064,0.0002155219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002001089,0.0003361681,0.02072025,0.002984109,0.0004596819,0.002527007,0.002365127,0.1364291,0.04960427,0.4663493,0.00862449,0.3075994],"study_design_scores_gemma":[0.0001087758,0.0003859713,0.002437828,0.0001738336,0.000142439,0.001454511,0.000944577,0.4785227,0.01619657,0.4777402,0.02181,0.00008248621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2255992,0.001547799,0.7609836,0.0008504508,0.00006696692,0.0002515362,0.000882489,0.001278253,0.008539733],"genre_scores_gemma":[0.5550705,0.0013457,0.4327017,0.0003500005,0.0002428569,0.0004005947,0.002603388,0.000391908,0.006893323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003333818,"threshold_uncertainty_score":0.01004463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971882628","doi":"10.1142/s0129054111008738","title":"PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","authors":[{"name":"Honggang Hu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02546006147461441,"gpt":0.2705732151522423,"spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001360354,0.0002143524,0.0002287589,0.0004781871,0.0002850634,0.0006488263,0.0003539899,0.0004273564,0.001759297],"category_scores_gemma":[0.0006793765,0.0001522868,0.0002790023,0.0004118579,0.000693657,0.0008055001,0.0004203458,0.0004019578,0.0001497801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005167397,"about_ca_system_score_gemma":0.0002464999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001924771,"about_ca_topic_score_gemma":0.0002495266,"domain_scores_codex":[0.9998457,0.00002294039,0.00001133851,0.00003342873,0.00004278438,0.00004374914],"domain_scores_gemma":[0.9996952,0.0001154372,0.00008413011,0.00004999292,0.00002662259,0.00002866415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006221379,0.00004140304,0.001226422,0.0001378876,0.00003408031,0.0003368553,0.00039212,0.01669385,0.06670915,0.8809725,0.000982351,0.03185115],"study_design_scores_gemma":[0.0002259445,0.0005535793,0.005423706,0.00008831133,0.0000999371,0.001728892,0.0003738345,0.2682244,0.07876683,0.6262804,0.01810071,0.0001334457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8939945,0.0009949934,0.07693391,0.0003140293,0.0001017863,0.00003376254,0.0001683224,0.0001753601,0.02728342],"genre_scores_gemma":[0.9910591,0.0002136146,0.006504239,0.00003896715,0.00002535706,0.00002373099,0.00004475462,0.00001625242,0.002073862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001759297,"threshold_uncertainty_score":0.005885422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966140610","doi":"10.1142/s0129054107004838","title":"DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Chord (peer-to-peer); Chordal graph; Asynchronous communication; Computer science; Torus; Node (physics); Human decontamination; Upper and lower bounds; Visibility; Mathematics; Theoretical computer science; Computer network; Graph","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Miao Jun Huang","is_ca":true},{"name":"Flaminia L. Luccio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01931218671582376,"gpt":0.3218863398165222,"spread":0.3025741531006985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049295,0.0009975866,0.001024449,0.0006037618,0.001131066,0.00101277,0.001762565,0.0009704225,0.00161489],"category_scores_gemma":[0.00510588,0.0004228481,0.0009375245,0.0005621231,0.00155378,0.002357065,0.00268579,0.0008971564,0.0003650627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000734088,"about_ca_system_score_gemma":0.0008190114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00309501,"about_ca_topic_score_gemma":0.002401525,"domain_scores_codex":[0.9990253,0.0002672138,0.00005028044,0.0002300949,0.0001971907,0.0002298817],"domain_scores_gemma":[0.997452,0.001160568,0.0003895328,0.0006198107,0.0001741054,0.0002040908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003752697,0.00007182068,0.001129899,0.0002207487,0.0000623808,0.0004573489,0.0003912522,0.8970886,0.01314152,0.03919096,0.001165622,0.04670452],"study_design_scores_gemma":[0.00004872883,0.000162335,0.0002668151,0.00001493144,0.00002396038,0.0001630147,0.000262139,0.9682611,0.006183206,0.02136761,0.003225327,0.00002088805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.195187,0.0006897692,0.7966315,0.0003168646,0.0001256544,0.0002178069,0.0001015516,0.0008576534,0.005872224],"genre_scores_gemma":[0.7726598,0.0004286937,0.2231316,0.00007841225,0.00004271535,0.00014844,0.0001751508,0.0001058634,0.003229243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00309501,"threshold_uncertainty_score":0.006154001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011421072","doi":"10.1142/s0129054108006327","title":"USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Black hole (networking); Ring (chemistry); Security token; Mobile agent; Node (physics); Computer science; Ring network; Token ring; Combinatorics; Physics; Topology (electrical circuits); Mathematics; Computer network; Quantum mechanics; Network topology; Routing (electronic design automation)","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05176515794922026,"gpt":0.317240406160664,"spread":0.2654752482114437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264513,0.0007064898,0.00092553,0.0005491331,0.001195087,0.001233339,0.001902692,0.001076811,0.002019456],"category_scores_gemma":[0.004494071,0.0004531447,0.0005966605,0.0005224083,0.001484843,0.00323856,0.003256315,0.0006440261,0.0005558528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005691648,"about_ca_system_score_gemma":0.0009761815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159418,"about_ca_topic_score_gemma":0.001776623,"domain_scores_codex":[0.9993473,0.0002094151,0.00003978155,0.0001490756,0.0001053389,0.0001491557],"domain_scores_gemma":[0.9975615,0.001024143,0.0004812681,0.0004461934,0.000192227,0.0002947212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00127141,0.0002726203,0.00501083,0.0002570747,0.0001585862,0.001358813,0.0008686275,0.7516583,0.0334991,0.1299983,0.001698227,0.07394825],"study_design_scores_gemma":[0.0001093583,0.0002723996,0.0002300038,0.00002074388,0.00004972205,0.000213556,0.0002666458,0.9654189,0.01024609,0.02068502,0.002460409,0.00002709623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2319009,0.0002228198,0.7638613,0.0002546954,0.0000485249,0.0001194765,0.00003310259,0.0003814366,0.003177687],"genre_scores_gemma":[0.7704179,0.0001788996,0.2261145,0.00004146021,0.00001719821,0.00009492418,0.00005075734,0.00004293459,0.003041394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002019456,"threshold_uncertainty_score":0.006755769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067033580","doi":"10.1142/s0129054107004784","title":"NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Human decontamination; Vertex (graph theory); Upper and lower bounds; Computer science; Tree (set theory); Mathematical proof; Binary tree; Constructive; Node (physics); Protocol (science); Binary number; Theoretical computer science; Distributed computing; Graph; Mathematics; Combinatorics; Algorithm; Medicine; Arithmetic; Engineering; Process (computing)","authors":[{"name":"Fabrizio Luccio","is_ca":false},{"name":"Linda Pagli","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01411593980073721,"gpt":0.2913679085688274,"spread":0.2772519687680902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210652,0.0008644274,0.001221094,0.0005983921,0.0009472431,0.001303556,0.001666847,0.001395954,0.00270379],"category_scores_gemma":[0.00784232,0.0003280825,0.0006709782,0.0005507646,0.001672023,0.003210237,0.002335068,0.001193987,0.0002761829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009321243,"about_ca_system_score_gemma":0.0004704789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009585662,"about_ca_topic_score_gemma":0.0009475053,"domain_scores_codex":[0.9985396,0.0003481062,0.00007735145,0.0003502177,0.0002958724,0.0003887934],"domain_scores_gemma":[0.9902193,0.006252113,0.001533824,0.001041778,0.0004888828,0.0004640504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006545521,0.0002104416,0.003674137,0.0009321666,0.0001449679,0.0009856136,0.0005754161,0.8231801,0.03992195,0.08588507,0.001526058,0.04230952],"study_design_scores_gemma":[0.00003933013,0.0004671787,0.0009797179,0.00004523473,0.0001080651,0.0006477925,0.0004245746,0.9248556,0.02146525,0.04736042,0.003575685,0.0000310561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3434805,0.001859844,0.6429037,0.0008768648,0.00007252354,0.0001543677,0.0001156463,0.0004139661,0.01012262],"genre_scores_gemma":[0.9492893,0.0007791162,0.04708628,0.00009950039,0.00003766933,0.00009600303,0.00008636899,0.00004300225,0.002482777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00270379,"threshold_uncertainty_score":0.009045064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073495011","doi":"10.1142/s0129054110007441","title":"FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial; Time complexity; Context (archaeology); Context-free language; Context-free grammar; Rule-based machine translation; Mathematics; Square-free polynomial; Matrix polynomial; Monic polynomial; Order (exchange); Discrete mathematics; Combinatorics; Computer science; Artificial intelligence","authors":[{"name":"Paweł Gawrychowski","is_ca":false},{"name":"Dalia Krieger","is_ca":true},{"name":"Narad Rampersad","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009884880501276559,"gpt":0.2769687651552374,"spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818999,0.001086099,0.001159928,0.001139527,0.0009802983,0.003020677,0.001527284,0.001467666,0.005852648],"category_scores_gemma":[0.01545817,0.0008385541,0.002443934,0.00111827,0.001714309,0.005433528,0.001703531,0.002595261,0.001736963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001861973,"about_ca_system_score_gemma":0.002645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003424344,"about_ca_topic_score_gemma":0.004006115,"domain_scores_codex":[0.9973848,0.0004377186,0.0001964882,0.0008792274,0.0005713846,0.0005302693],"domain_scores_gemma":[0.9749961,0.02059214,0.001377345,0.001338074,0.001182288,0.0005141321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003945558,0.0007962399,0.02401802,0.002619886,0.0004187207,0.001460416,0.002114288,0.2589666,0.1999537,0.128629,0.02091262,0.3561649],"study_design_scores_gemma":[0.0003563035,0.0003747156,0.001933703,0.0001265755,0.0001873043,0.0009668149,0.0005562835,0.6661088,0.0611398,0.2627493,0.005368493,0.0001319171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2756659,0.0004794013,0.7033756,0.002234528,0.0001183281,0.0003736631,0.00130575,0.005863044,0.01058371],"genre_scores_gemma":[0.533092,0.0003660103,0.4585104,0.0003602784,0.0001017668,0.000405286,0.001761095,0.0009376723,0.004465559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005852648,"threshold_uncertainty_score":0.01957905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048819748","doi":"10.1142/s0129054102000947","title":"VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Bit array; String (physics); String searching algorithm; Matching (statistics); Automaton; Computation; Bounded function; Computer science; Focus (optics); Mathematics; Pattern matching; Theoretical computer science; Type (biology); Artificial intelligence","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Sylvie Hamel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04030689551270782,"gpt":0.3145119637821279,"spread":0.2742050682694201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833566,0.0008502128,0.001181756,0.00219884,0.000895671,0.00293931,0.002000088,0.001404988,0.007501835],"category_scores_gemma":[0.0115491,0.0005682281,0.0009782601,0.004243928,0.001345278,0.006132762,0.002413225,0.001627317,0.002449444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361693,"about_ca_system_score_gemma":0.001149675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009385233,"about_ca_topic_score_gemma":0.001012976,"domain_scores_codex":[0.9978005,0.0005957573,0.0002788439,0.0004571904,0.000668026,0.0001996923],"domain_scores_gemma":[0.9966797,0.001702604,0.0002510699,0.0008475048,0.0004592068,0.00005996921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002194911,0.00007756381,0.0005113123,0.000317372,0.00005123982,0.0000514998,0.0001566175,0.07639205,0.00297286,0.5523701,0.006046123,0.3608337],"study_design_scores_gemma":[0.00004115331,0.00007404932,0.0001124907,0.0000549822,0.00002375437,0.0001485618,0.00006073173,0.3770756,0.003911736,0.6039398,0.01453213,0.00002508921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004104448,0.0006587086,0.990841,0.0001371928,0.00007428574,0.00008377619,0.0001175722,0.0009551004,0.003027838],"genre_scores_gemma":[0.1355501,0.001707981,0.8536008,0.000201405,0.0001531517,0.0004932308,0.001089324,0.000403388,0.006800577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007501835,"threshold_uncertainty_score":0.02509618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993598446","doi":"10.1142/s0129054102000960","title":"AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Nondeterministic finite automaton; DFA minimization; Deterministic finite automaton; Quantum finite automata; Nested word; Regular language; Finite-state machine; Automaton; Deterministic automaton; ω-automaton; Computer science; Time complexity; Algorithm; Formal language; Timed automaton; Mathematics; Theoretical computer science; Automata theory; Two-way deterministic finite automaton","authors":[{"name":"Cezar Câmpeanu","is_ca":false},{"name":"Andrei Păun","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01962646832423218,"gpt":0.3115234385093699,"spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039121,0.0007939643,0.000806321,0.000920982,0.0008553406,0.0008279829,0.001200887,0.001083727,0.004397714],"category_scores_gemma":[0.002467923,0.0006007711,0.001522854,0.000737509,0.0007304216,0.001940207,0.001491876,0.001145013,0.001377264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007086364,"about_ca_system_score_gemma":0.001099837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009056765,"about_ca_topic_score_gemma":0.001253835,"domain_scores_codex":[0.9991192,0.0001509349,0.00007543315,0.0002195425,0.0003222389,0.0001126369],"domain_scores_gemma":[0.9988608,0.0006272778,0.0000636001,0.0002325226,0.0001761461,0.00003964589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004886574,0.0003010889,0.001525446,0.0007791431,0.0001411153,0.0006654818,0.0009257435,0.05304085,0.07415262,0.1579688,0.01321319,0.6967978],"study_design_scores_gemma":[0.0002078506,0.0003022801,0.0005626886,0.00008051448,0.000154715,0.00118545,0.0001881682,0.6407879,0.05879257,0.2577483,0.03989161,0.00009789594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009152484,0.0001151171,0.9857879,0.00009878543,0.0000300215,0.0001721846,0.0001264927,0.002801311,0.001715783],"genre_scores_gemma":[0.1090153,0.0001120022,0.8875093,0.00007677544,0.00002766218,0.000384911,0.0008226099,0.0002474983,0.00180391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004397714,"threshold_uncertainty_score":0.01471186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974278282","doi":"10.1142/s0129054107004917","title":"ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Nondeterministic algorithm; Computational complexity theory; Estimation; Computer science; Theoretical computer science; Class (philosophy); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02741647812262987,"gpt":0.2995984270744542,"spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004228685,0.001144086,0.001390147,0.002380206,0.0007671535,0.002741513,0.001780091,0.001228111,0.004175529],"category_scores_gemma":[0.04042499,0.0006638106,0.00162076,0.001923554,0.002652154,0.009001373,0.002688678,0.003083422,0.0003647837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001988011,"about_ca_system_score_gemma":0.001353216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001971883,"about_ca_topic_score_gemma":0.001102602,"domain_scores_codex":[0.995217,0.001351811,0.0002639705,0.001093163,0.001610036,0.000464114],"domain_scores_gemma":[0.9205492,0.06949817,0.003123339,0.003957358,0.002168026,0.0007039974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006174012,0.0001892455,0.008623551,0.0004760476,0.0002229292,0.0002402333,0.0003968481,0.6326538,0.01007574,0.2585298,0.00102319,0.08695128],"study_design_scores_gemma":[0.000007346825,0.00005071973,0.0009642043,0.00001904504,0.00002975875,0.00005195868,0.00002611979,0.8957388,0.002822525,0.09992038,0.000334048,0.00003511233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1043237,0.0005794219,0.8913317,0.0003074248,0.00003323723,0.00006725454,0.0002167052,0.0002400594,0.002900471],"genre_scores_gemma":[0.8382711,0.0006830705,0.1577166,0.00006666753,0.0001465308,0.0002989215,0.0005643608,0.0002134086,0.002039273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004228685,"threshold_uncertainty_score":0.02236366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074221742","doi":"10.1142/s0129054108005838","title":"STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Finite-state machine; Deterministic finite automaton; Alphabet; Intersection (aeronautics); Regular language; Nondeterministic finite automaton; Mathematics; Upper and lower bounds; Automaton; State (computer science); Discrete mathematics; Finite state; Quantum finite automata; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm","authors":[{"name":"Yo-Sub Han","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02956932046349621,"gpt":0.2988042262286668,"spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00334302,0.0006863284,0.001859343,0.001953779,0.002374834,0.008321833,0.003299003,0.001828953,0.008323002],"category_scores_gemma":[0.03480097,0.001047799,0.002351647,0.002752813,0.004277855,0.01943999,0.004625292,0.004233334,0.0005032936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005017387,"about_ca_system_score_gemma":0.003073303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004215403,"about_ca_topic_score_gemma":0.003322111,"domain_scores_codex":[0.992782,0.001442467,0.000651435,0.001523549,0.002177737,0.001422881],"domain_scores_gemma":[0.924574,0.06247458,0.003975939,0.00485176,0.002640398,0.001483446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001977541,0.000482972,0.01298316,0.0006730125,0.0001874259,0.0003299548,0.002375179,0.2792881,0.01198568,0.630232,0.003727709,0.05575735],"study_design_scores_gemma":[0.00004450223,0.00009671303,0.00139266,0.00003560416,0.00006656175,0.0001221475,0.0002264114,0.5385932,0.01085973,0.4474168,0.001074271,0.0000715556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7953647,0.0006299017,0.1871463,0.001960556,0.00006635665,0.0001560672,0.001660471,0.001011364,0.0120042],"genre_scores_gemma":[0.9712154,0.0002268556,0.02506663,0.00008116447,0.00007483143,0.0001360405,0.001035376,0.0001906904,0.001973136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008323002,"threshold_uncertainty_score":0.03640383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003022262","doi":"10.1142/s0129054108005620","title":"AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; String (physics); Combinatorics; Mathematics; Sequence (biology); Function (biology); Discrete mathematics; Mathematical analysis; Mathematical physics","authors":[{"name":"František Franěk","is_ca":true},{"name":"Qian Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02601152134161641,"gpt":0.3290096093632813,"spread":0.3029980880216649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006673026,0.002279333,0.002355898,0.00340741,0.00191231,0.00347441,0.004404855,0.002882236,0.01300124],"category_scores_gemma":[0.04451863,0.0009149052,0.001750043,0.00270633,0.004327225,0.01225664,0.00454299,0.006902838,0.004085361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0036527,"about_ca_system_score_gemma":0.002456286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006689685,"about_ca_topic_score_gemma":0.0008828785,"domain_scores_codex":[0.994495,0.001183569,0.0002948063,0.001208449,0.001777297,0.001040813],"domain_scores_gemma":[0.9535819,0.03500751,0.001523044,0.005095503,0.003054695,0.001737393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001740812,0.0004216231,0.00561612,0.001218277,0.0001634039,0.0005809314,0.0006165107,0.08621162,0.03604279,0.6853142,0.02272664,0.159347],"study_design_scores_gemma":[0.00006094921,0.0003773308,0.002165114,0.0004299468,0.0001901479,0.001680241,0.0001537009,0.3551569,0.0236794,0.5932949,0.02266662,0.000144741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07282528,0.007512227,0.8548208,0.004823113,0.0005932392,0.0001412375,0.0008438426,0.003324765,0.05511551],"genre_scores_gemma":[0.6466753,0.005619146,0.3095509,0.003200029,0.002216242,0.001160316,0.002291263,0.002725666,0.02656102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01300124,"threshold_uncertainty_score":0.04349345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060731856","doi":"10.1142/s0129054104002443","title":"SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Binary number; Mathematics; Combinatorics; Hierarchy; Cube (algebra); Word (group theory); Discrete mathematics; Arithmetic; Computer science; Geometry","authors":[{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00849638401482924,"gpt":0.2899285919874882,"spread":0.2814322079726589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095907,0.0004457306,0.0006764089,0.0005501148,0.002574843,0.002367905,0.0008219559,0.001287817,0.005098142],"category_scores_gemma":[0.003997889,0.0006380691,0.0007721345,0.0006798367,0.003473971,0.006454411,0.003225339,0.002099719,0.0009705057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007295475,"about_ca_system_score_gemma":0.0004213332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004048435,"about_ca_topic_score_gemma":0.000623295,"domain_scores_codex":[0.9992135,0.0001587982,0.00006762215,0.0001703692,0.0001960158,0.0001936894],"domain_scores_gemma":[0.9978186,0.001262824,0.0002443967,0.0003051464,0.0001685968,0.00020044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002234628,0.00003853698,0.0006572711,0.0001305476,0.0000108252,0.001058407,0.001728133,0.002626045,0.01674928,0.9591421,0.001008905,0.01662645],"study_design_scores_gemma":[0.0000393232,0.00006530896,0.0002754544,0.00003118315,0.00001896053,0.000783301,0.0005094829,0.008521404,0.01008959,0.9682372,0.0113931,0.00003565058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7738141,0.001011682,0.1544182,0.00166597,0.0002712918,0.00005238789,0.00009100174,0.0003501721,0.06832523],"genre_scores_gemma":[0.9589022,0.0002891354,0.02558848,0.0001991617,0.00009284111,0.00005623992,0.00006398145,0.0001067295,0.01470129],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005098142,"threshold_uncertainty_score":0.01705498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1501444314","doi":"10.1142/s0129054112400515","title":"QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Pumping lemma for regular languages; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton; Programming language","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Bo Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03215229918022616,"gpt":0.3184217059545243,"spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319606,0.0004989587,0.0009564428,0.001266052,0.001137389,0.003862151,0.001292387,0.0006495583,0.007458239],"category_scores_gemma":[0.01132986,0.0004444755,0.001518337,0.0009304893,0.003000559,0.009828074,0.003411592,0.002014488,0.0006038087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717918,"about_ca_system_score_gemma":0.001545002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716991,"about_ca_topic_score_gemma":0.001157263,"domain_scores_codex":[0.9971182,0.0004054478,0.0003420369,0.0006044745,0.001012274,0.0005174677],"domain_scores_gemma":[0.9869133,0.00870308,0.0007560884,0.00126007,0.001431249,0.0009361838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005879871,0.0001146772,0.004291371,0.0002565702,0.00005118778,0.0003889027,0.001851682,0.03484719,0.01442012,0.9191266,0.001945352,0.02211845],"study_design_scores_gemma":[0.00002852342,0.00005935308,0.0009609214,0.00001557776,0.00002978705,0.0002144122,0.0001397637,0.09238071,0.00658934,0.8972252,0.002320244,0.00003611579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7802786,0.0005343276,0.1933372,0.0010749,0.00005571221,0.0001273832,0.001042873,0.0006091062,0.02294001],"genre_scores_gemma":[0.9747672,0.0002503167,0.0186701,0.000120429,0.00007803678,0.0001324782,0.0008737184,0.0001490985,0.004958532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007458239,"threshold_uncertainty_score":0.02495033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062377295","doi":"10.1142/s0129054111008970","title":"THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Simple (philosophy); Automaton; Mathematics; Scheme (mathematics); Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Theoretical computer science; Epistemology; Philosophy","authors":[{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01441121656554072,"gpt":0.2536581839400586,"spread":0.2392469673745178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004565338,0.0005173906,0.001543419,0.001127088,0.002525253,0.003080028,0.001275538,0.002348892,0.006514504],"category_scores_gemma":[0.01653277,0.0005153033,0.001555258,0.00113161,0.008638177,0.01427944,0.004295499,0.004637283,0.00109499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001530234,"about_ca_system_score_gemma":0.001064343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009032919,"about_ca_topic_score_gemma":0.0006999069,"domain_scores_codex":[0.995828,0.001152132,0.0002542569,0.001112248,0.0009928432,0.0006605063],"domain_scores_gemma":[0.9914697,0.005001771,0.0005705415,0.001783287,0.0009008821,0.0002738728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001950348,0.000006678032,0.0001515779,0.00003442843,0.000004742113,0.00004653971,0.00008561104,0.0003974176,0.0001864459,0.9941803,0.001411566,0.003475294],"study_design_scores_gemma":[0.000008116732,0.000005579378,0.00009251384,0.00001236657,0.000004526107,0.00005627024,0.00002256803,0.002153299,0.0003727399,0.9934474,0.003816094,0.000008612631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1615074,0.006886817,0.4900088,0.03175587,0.00325034,0.00008303735,0.0003497186,0.001573012,0.304585],"genre_scores_gemma":[0.9444965,0.002074251,0.03051378,0.004864109,0.001794522,0.00008751598,0.000219845,0.0002983122,0.01565115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006514504,"threshold_uncertainty_score":0.02414411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099378738","doi":"10.1142/s0129054105003467","title":"BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01543495050001134,"gpt":0.3606698463397361,"spread":0.3452348958397248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003837388,0.001048785,0.0007021825,0.001288566,0.001189452,0.003011179,0.002935264,0.001465676,0.004387895],"category_scores_gemma":[0.009299863,0.00128112,0.00239147,0.001571694,0.007583271,0.008656438,0.002874356,0.004615746,0.001097752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487294,"about_ca_system_score_gemma":0.001593395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009092145,"about_ca_topic_score_gemma":0.000702324,"domain_scores_codex":[0.9962196,0.001122743,0.0004840948,0.0009228354,0.0009408554,0.0003099926],"domain_scores_gemma":[0.9921968,0.005465785,0.0006559805,0.0009598845,0.0005077651,0.0002138589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001280853,0.00001635543,0.0001115739,0.0001002228,0.000005892722,0.00004018037,0.0002977514,0.004798805,0.001284007,0.9838915,0.0004131247,0.009027801],"study_design_scores_gemma":[0.00001525131,0.00002167768,0.0000380861,0.00005441013,0.00001318161,0.0001582411,0.00009775991,0.02420735,0.004993729,0.9611112,0.009261652,0.00002741134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031982,0.0005542471,0.981185,0.0004966009,0.00004460609,0.00008423526,0.000126417,0.0004248814,0.006764083],"genre_scores_gemma":[0.3563732,0.001423494,0.6301095,0.0005098231,0.0002209852,0.001049596,0.0005965875,0.0007785537,0.008938221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004387895,"threshold_uncertainty_score":0.02029431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046033718","doi":"10.1142/s0129054103002151","title":"LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Concatenation (mathematics); Prefix; Prime (order theory); Mathematics; Discrete mathematics; Regular language; Combinatorics; Linear code; Automaton; Computer science; Algorithm; Theoretical computer science; Block code; Decoding methods","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Wojciech Frączak","is_ca":true},{"name":"Andrzej Pelc","is_ca":true},{"name":"Wojciech Rytter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009870597442700342,"gpt":0.2953084454662966,"spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652393,0.0004142174,0.0006386714,0.000620059,0.0006277499,0.001349812,0.0005687317,0.0004646132,0.003079185],"category_scores_gemma":[0.004437581,0.0003598117,0.0006097499,0.000606771,0.001269331,0.002581938,0.00126482,0.000898827,0.0007923907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018986,"about_ca_system_score_gemma":0.001223296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165299,"about_ca_topic_score_gemma":0.00129792,"domain_scores_codex":[0.9992494,0.0001457253,0.00006783449,0.0002387242,0.0001818787,0.0001164347],"domain_scores_gemma":[0.9976752,0.001310842,0.0002088113,0.0004421521,0.0002557653,0.0001070802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001087141,0.0002010579,0.003378849,0.00056982,0.00005556472,0.000550952,0.001196026,0.1035355,0.05299265,0.4915439,0.006425318,0.3384632],"study_design_scores_gemma":[0.00005338733,0.0001439581,0.0003550221,0.00003353768,0.0000372816,0.0003583632,0.000192837,0.4210829,0.03446213,0.5355828,0.007668386,0.00002934768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.111299,0.0002692683,0.8803105,0.0003226206,0.00003454743,0.0001118839,0.0002220088,0.001958105,0.005472058],"genre_scores_gemma":[0.545537,0.0002028933,0.4468922,0.0001239746,0.00003941951,0.0001335512,0.0008812104,0.0002220715,0.005967649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003079185,"threshold_uncertainty_score":0.01030087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053288014","doi":"10.1142/s0129054109007005","title":"AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Strong","keywords":"Indeterminate; Algorithm; Matching (statistics); Computer science; String searching algorithm; Pattern matching; Hybrid algorithm (constraint satisfaction); Successor cardinal; Mathematics; Artificial intelligence","authors":[{"name":"W.F. Smyth","is_ca":true},{"name":"Shu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0150100370285392,"gpt":0.3052397887745584,"spread":0.2902297517460192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004868024,0.0003660287,0.0005476868,0.00117085,0.0004354533,0.0008007807,0.001652946,0.0006320347,0.00278028],"category_scores_gemma":[0.002008452,0.0002416566,0.0003122322,0.001678933,0.0004586313,0.001463533,0.0009604343,0.0005582034,0.001207913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003208099,"about_ca_system_score_gemma":0.0005556581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001128545,"about_ca_topic_score_gemma":0.001352741,"domain_scores_codex":[0.9994414,0.00006987173,0.00005098798,0.0001522446,0.0002415728,0.00004377],"domain_scores_gemma":[0.9993292,0.0001783307,0.00004986712,0.0001834223,0.0002273147,0.00003190482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003775931,0.00007387095,0.001104225,0.000085336,0.00003393438,0.0001631905,0.0001454076,0.02682238,0.05159342,0.02128406,0.004053189,0.8942634],"study_design_scores_gemma":[0.00009908651,0.0001950336,0.0008431378,0.00001793271,0.00002921457,0.0006604007,0.00007794154,0.8827962,0.06550475,0.0306379,0.01909533,0.00004308053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02488876,0.0001339722,0.9719203,0.00007733519,0.0000546123,0.0000517016,0.00006793597,0.001350489,0.001454903],"genre_scores_gemma":[0.1305445,0.00008247371,0.8645102,0.00009214727,0.00002606018,0.00009392987,0.0002637599,0.0001707183,0.004216266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00278028,"threshold_uncertainty_score":0.009301007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972572665","doi":"10.1142/s0129054113400315","title":"THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Context-free language; Regular language; Computer science; String (physics); Nondeterministic finite automaton; Regular expression; Deterministic pushdown automaton; Unary operation; Formal language; Automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Programming language; Rule-based machine translation; Artificial intelligence; Automata theory","authors":[{"name":"Yo-Sub Han","is_ca":false},{"name":"Sang‐Ki Ko","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007283888517623,"gpt":0.2653929551883784,"spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730747,0.0004505674,0.0007396928,0.001385636,0.0007333395,0.001727537,0.001478047,0.001102835,0.002970509],"category_scores_gemma":[0.01386045,0.0004325472,0.001056004,0.00137649,0.001424002,0.003977367,0.001666333,0.001021299,0.0008203834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008900894,"about_ca_system_score_gemma":0.001154645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007885773,"about_ca_topic_score_gemma":0.0009295758,"domain_scores_codex":[0.9973102,0.0006741135,0.0003352671,0.0008981749,0.0006385337,0.0001437809],"domain_scores_gemma":[0.9901959,0.006564322,0.0005562268,0.001615656,0.0007722158,0.000295641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009922911,0.0003682357,0.007895268,0.001416197,0.0003122808,0.001649305,0.002122933,0.06287746,0.06040868,0.4875824,0.008355695,0.3660194],"study_design_scores_gemma":[0.0001066978,0.0006354415,0.00342208,0.0001413319,0.000174762,0.002580002,0.0005927664,0.2123548,0.03699781,0.7083342,0.03452136,0.0001387751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1256721,0.0005273111,0.8655131,0.0005038406,0.0002105031,0.000154475,0.0009105117,0.001616437,0.004891709],"genre_scores_gemma":[0.3888957,0.0003667476,0.6061407,0.0001468375,0.0001128011,0.0001698555,0.00101247,0.0003046851,0.002850229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002970509,"threshold_uncertainty_score":0.009937346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057447340","doi":"10.1142/s0129054107005145","title":"INVOLUTIVELY BORDERED WORDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01718857657105889,"gpt":0.3233007750085465,"spread":0.3061121984374877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310475,0.0003646999,0.0004709317,0.00100343,0.001016321,0.001821459,0.0006728089,0.0006342065,0.004133279],"category_scores_gemma":[0.002396617,0.0002532037,0.0006790697,0.0007456974,0.002781358,0.003297968,0.001294851,0.0009617694,0.0007713057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731357,"about_ca_system_score_gemma":0.0003671763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006587317,"about_ca_topic_score_gemma":0.0005107754,"domain_scores_codex":[0.9990519,0.0001335824,0.0001005606,0.0003298155,0.0002124238,0.0001717043],"domain_scores_gemma":[0.9984073,0.0005979789,0.0003580461,0.0002486395,0.0002640008,0.0001240799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004564161,0.00001769956,0.0004650339,0.00004407183,0.000008798946,0.0002740466,0.0004513584,0.001648168,0.004136835,0.9837617,0.0003156081,0.008830954],"study_design_scores_gemma":[0.00001563209,0.00007537513,0.000461221,0.00002448029,0.00001667169,0.0004865658,0.0002948805,0.009382949,0.005252752,0.9690468,0.01491457,0.0000281678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6663595,0.001718001,0.271816,0.0005751912,0.0003231305,0.00007304831,0.0003882266,0.0004366638,0.0583103],"genre_scores_gemma":[0.9567713,0.0004399154,0.02668952,0.0002387059,0.0001882059,0.00006799836,0.0003011034,0.0001139089,0.01518927],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004133279,"threshold_uncertainty_score":0.0138272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964048382","doi":"10.1142/s0129054112400655","title":"THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Mathematics; Critical exponent; Rational number; Computation; Constant (computer programming); Discrete mathematics; Sequence (biology); Diophantine equation; Diophantine approximation; Combinatorics; Computer science; Algorithm","authors":[{"name":"Luke Schaeffer","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02862647734812847,"gpt":0.3462912195548554,"spread":0.317664742206727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190196,0.0005742991,0.000556795,0.001861738,0.0007914229,0.002712048,0.000488253,0.0004328829,0.002903847],"category_scores_gemma":[0.01121515,0.000346533,0.0003937116,0.001325948,0.002297212,0.005363385,0.00143142,0.001576693,0.0005326049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001499775,"about_ca_system_score_gemma":0.0007774134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009254964,"about_ca_topic_score_gemma":0.0008818599,"domain_scores_codex":[0.9993485,0.00009026827,0.00005947563,0.000195201,0.0001938544,0.0001127772],"domain_scores_gemma":[0.9943227,0.003822151,0.000395316,0.0006565859,0.0005994719,0.0002039077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003773021,0.00005618936,0.008525268,0.000310175,0.00003274644,0.0004912154,0.001207261,0.01106598,0.0156491,0.9051342,0.002658965,0.05449165],"study_design_scores_gemma":[0.00004669807,0.00004180722,0.001592126,0.00009456248,0.00003410371,0.0003065797,0.000164719,0.04897714,0.01498088,0.9282649,0.005446892,0.00004950853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7795151,0.001273539,0.1828075,0.0007424261,0.0001044292,0.00006562615,0.0003910311,0.0008944694,0.03420598],"genre_scores_gemma":[0.9799424,0.0003229912,0.01714893,0.00006540061,0.00008539565,0.00003842775,0.0002156388,0.00011982,0.002061064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002903847,"threshold_uncertainty_score":0.01088166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077220764","doi":"10.1142/s0129054110007155","title":"SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Ambiguity; Word (group theory); Matrix (chemical analysis); Alphabet; Image (mathematics); Combinatorics; Binary number; Mathematics; Palindrome; Variance (accounting); Logical matrix; Characterization (materials science); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Arithmetic; Linguistics; Geometry","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008635601422458672,"gpt":0.2860126926709665,"spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311011,0.000449489,0.0008360581,0.002331519,0.001254167,0.002578094,0.001066606,0.001015326,0.004644795],"category_scores_gemma":[0.01212818,0.0004293789,0.0005672173,0.001805073,0.00322499,0.0065238,0.001805302,0.001072701,0.0007092212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007732924,"about_ca_system_score_gemma":0.000339612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003067027,"about_ca_topic_score_gemma":0.0002610721,"domain_scores_codex":[0.9975212,0.0005006687,0.0002722885,0.0007230099,0.0006546849,0.0003280301],"domain_scores_gemma":[0.9894577,0.006424924,0.001841996,0.0009649853,0.0006580252,0.0006523894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008343564,0.0001430476,0.01051521,0.0003887123,0.00006089815,0.001287055,0.002547123,0.004741656,0.02730664,0.8536134,0.001142294,0.09741958],"study_design_scores_gemma":[0.00003335968,0.0002719368,0.004571778,0.00007263889,0.00006009772,0.001690327,0.001054044,0.02335816,0.01521403,0.9454548,0.008133173,0.00008558169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7529564,0.001306978,0.2267024,0.000471388,0.0001573268,0.00007376593,0.000305018,0.0002609321,0.01776583],"genre_scores_gemma":[0.9528251,0.0004327042,0.04169648,0.0000760589,0.0001699777,0.0001155734,0.0002235154,0.000094646,0.004366009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004644795,"threshold_uncertainty_score":0.01553833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570765932","doi":"10.1142/s0129054111008052","title":"CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Mathematics; Complement (music); Separation axiom; Axiom; Discrete mathematics; Regular language; Partition (number theory); Formal language; Abstract family of languages; Concatenation (mathematics); Topological space; Pure mathematics; Combinatorics; Computer science; Algorithm; Theoretical computer science; Second-generation programming language","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Elyot Grant","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01872716622195174,"gpt":0.3057454771416453,"spread":0.2870183109196935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003220036,0.0004399851,0.0008846873,0.00163495,0.002562706,0.003051468,0.001077811,0.0008239104,0.003487378],"category_scores_gemma":[0.006295922,0.0006463049,0.001698117,0.001225578,0.009768791,0.0123444,0.003575181,0.002688006,0.0006025827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003027461,"about_ca_system_score_gemma":0.001601111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002201656,"about_ca_topic_score_gemma":0.001236076,"domain_scores_codex":[0.9973116,0.0006343951,0.0002793201,0.0006397846,0.0007250203,0.0004099783],"domain_scores_gemma":[0.9955032,0.002714907,0.0005178211,0.000504488,0.0004968799,0.0002627357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007146678,0.00002140461,0.0004018888,0.00007817372,0.000008883872,0.0001304356,0.0009196085,0.001153269,0.001414715,0.988696,0.0006077313,0.006496408],"study_design_scores_gemma":[0.0000519132,0.00003774919,0.0003817448,0.00003255301,0.00001482564,0.0002198881,0.0002670267,0.00303023,0.001838069,0.9830619,0.01103368,0.00003045209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4941294,0.004082335,0.4177072,0.006866171,0.0002533027,0.0002104025,0.0008669122,0.001302645,0.07458155],"genre_scores_gemma":[0.9336241,0.0009144556,0.05591238,0.0005367375,0.0002111226,0.000242731,0.0003415878,0.0001252775,0.008091462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003487378,"threshold_uncertainty_score":0.0219658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001923775","doi":"10.1142/s0129054106004467","title":"A SIMPLE ALPHABET-INDEPENDENT FM-INDEX","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Huffman coding; Substring; Alphabet; Algorithm; Computer science; Mathematics; Entropy (arrow of time); Simple (philosophy); Combinatorics; Order (exchange); Index (typography); Discrete mathematics; Data structure; Data compression; Physics","authors":[{"name":"Szymon Grabowski","is_ca":false},{"name":"Gonzalo Navarro","is_ca":false},{"name":"Rafal Przywarski","is_ca":false},{"name":"Alejandro Salinger","is_ca":true},{"name":"Veli Mäkinen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01057454723675103,"gpt":0.2872282731876885,"spread":0.2766537259509374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004628678,0.0005383075,0.0008380006,0.001781661,0.0005801533,0.00105112,0.001764257,0.0007459781,0.004575191],"category_scores_gemma":[0.002938642,0.0003353877,0.0004052433,0.002580415,0.0005287235,0.003227794,0.001489498,0.0005760394,0.002659181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005739738,"about_ca_system_score_gemma":0.001128392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007077584,"about_ca_topic_score_gemma":0.001176236,"domain_scores_codex":[0.9994099,0.00006233055,0.00008030115,0.0001006927,0.0002954465,0.00005129177],"domain_scores_gemma":[0.9981407,0.000302877,0.0002088915,0.0007563484,0.0004723575,0.0001188094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009510927,0.0003383084,0.002737371,0.000731593,0.00007161537,0.0003296286,0.0002114875,0.02582268,0.1280529,0.04250424,0.01943781,0.7788113],"study_design_scores_gemma":[0.000418428,0.00188275,0.002821103,0.0001866889,0.0001816927,0.002550028,0.0001771676,0.6018674,0.2507631,0.0476859,0.09123279,0.000233033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03656772,0.001140812,0.9508692,0.0003056613,0.0002297488,0.0003017331,0.001325609,0.004010192,0.00524927],"genre_scores_gemma":[0.1742404,0.0004626725,0.8152066,0.0003334535,0.0001911546,0.0002961676,0.002729691,0.000257907,0.006281927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004575191,"threshold_uncertainty_score":0.01530552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169267790","doi":"10.1142/s0129054111009045","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","authors":[{"name":"Bo Cui","is_ca":true},{"name":"Yuan Gao","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04102082880490474,"gpt":0.2955954996665427,"spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200915,0.0006234145,0.000952146,0.001380884,0.00182212,0.005691414,0.001690011,0.001359824,0.01162253],"category_scores_gemma":[0.02205699,0.0006251745,0.001886676,0.001364942,0.002790143,0.01293034,0.003337112,0.002968328,0.0007182237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003059121,"about_ca_system_score_gemma":0.003216955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001933558,"about_ca_topic_score_gemma":0.001928409,"domain_scores_codex":[0.9956329,0.0008042256,0.0003178159,0.0009132637,0.001471472,0.0008601541],"domain_scores_gemma":[0.9673524,0.02480895,0.001849733,0.003391028,0.001825672,0.0007722439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001816028,0.0005018369,0.01223743,0.0008018567,0.0002566645,0.0004944705,0.001416153,0.1208498,0.02320194,0.7716984,0.003197071,0.06352846],"study_design_scores_gemma":[0.00009901859,0.0003254789,0.003795389,0.00006275293,0.000299448,0.0004776261,0.000649473,0.4202792,0.04635218,0.5219293,0.005559968,0.0001701358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6778296,0.0005595358,0.2931658,0.001492642,0.0001103047,0.0002708629,0.001167933,0.0009481279,0.02445524],"genre_scores_gemma":[0.9596211,0.000225321,0.03503901,0.00006815096,0.00004602336,0.0002259556,0.0006715088,0.0002301919,0.003872717],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01162253,"threshold_uncertainty_score":0.03888118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996179839","doi":"10.1142/s012905410600398x","title":"PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Centre National de la Recherche Scientifique","keywords":"Corollary; Mathematics; Combinatorics; Property (philosophy); Square lattice; Lattice (music); Reentrancy; Hexagonal lattice; Hexagonal crystal system; Discrete valuation; Polyomino; Salient; Discrete mathematics; Pure mathematics; Geometry; Computer science; Statistical physics","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Annie Lacasse","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01818290402632325,"gpt":0.2840745121671717,"spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422132,0.0002813525,0.000314378,0.001370205,0.000964497,0.001977847,0.0005522805,0.0005355965,0.004463123],"category_scores_gemma":[0.002619584,0.0002264402,0.0003482547,0.0008832419,0.001898951,0.003057985,0.0008762443,0.0008751633,0.0003746693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000543933,"about_ca_system_score_gemma":0.0002201834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003163669,"about_ca_topic_score_gemma":0.0001918157,"domain_scores_codex":[0.9997868,0.0000281857,0.00001224641,0.00005736891,0.00007429195,0.00004114204],"domain_scores_gemma":[0.998861,0.0004680702,0.0002173381,0.0001068759,0.0001299995,0.0002167877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006103027,0.00002344728,0.001561147,0.00004071709,0.000005663268,0.0003020286,0.0003349145,0.002797088,0.004469532,0.9779007,0.0002918926,0.01221193],"study_design_scores_gemma":[0.00003524589,0.00009889924,0.001497409,0.00003422765,0.000008865461,0.0007931078,0.0002335245,0.02754143,0.004242914,0.9601904,0.005300715,0.00002331094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8628781,0.0003004467,0.1065622,0.0002096854,0.00007409925,0.00003908977,0.0001426378,0.0001204043,0.02967345],"genre_scores_gemma":[0.9767734,0.0002573459,0.01798277,0.0000386352,0.00004759168,0.00003903459,0.0001233448,0.0000485697,0.004689301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004463123,"threshold_uncertainty_score":0.01493067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010556217","doi":"10.1142/s0129054111008556","title":"BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Speedup; Matrix multiplication; Computation; Computer science; Parallel computing; Univariate; Multiplication algorithm; Symbolic computation; Bivariate analysis; Polynomial; Fast Fourier transform; Mathematics; Arithmetic; Algorithm; Combinatorics; Multivariate statistics","authors":[{"name":"Marc Moreno Maza","is_ca":true},{"name":"Yuzhen Xie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0428232199411026,"gpt":0.3180081989553516,"spread":0.275184979014249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006249007,0.0006919397,0.0006625032,0.000420674,0.0006065152,0.0007466172,0.001177161,0.0003199007,0.005926185],"category_scores_gemma":[0.002527495,0.0003053256,0.0003957595,0.001006966,0.0005316379,0.002222308,0.00158582,0.0008258334,0.001422855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004389562,"about_ca_system_score_gemma":0.0009135911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001076411,"about_ca_topic_score_gemma":0.002815114,"domain_scores_codex":[0.9993348,0.0001294928,0.00005738849,0.0001011592,0.0002624042,0.0001146733],"domain_scores_gemma":[0.9989793,0.0002880278,0.00006517949,0.0003246068,0.0002803853,0.00006257655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001450729,0.0003268749,0.0028187,0.0006822249,0.00007382426,0.0006645755,0.0004989698,0.1531812,0.1022257,0.157078,0.02084431,0.560155],"study_design_scores_gemma":[0.000147849,0.0002994595,0.0005263,0.0000506894,0.00002814453,0.0002221772,0.0001083799,0.848828,0.05619984,0.07721204,0.01634695,0.00003019937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08829249,0.0003844613,0.896916,0.0002572548,0.0001281452,0.000091421,0.000160594,0.002843347,0.01092629],"genre_scores_gemma":[0.5071961,0.0002132878,0.485792,0.0001544167,0.0000558334,0.0002376887,0.0005789775,0.0003345436,0.005437175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005926185,"threshold_uncertainty_score":0.0198251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071427315","doi":"10.1142/s0129054103002023","title":"QUANTUM SOFTWARE REUSABILITY","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Computer science; Quantum circuit; Quantum Fourier transform; Quantum algorithm; Quantum phase estimation algorithm; Quantum network; Theoretical computer science; Quantum gate; Quantum; Quantum computer; Quantum error correction; Algorithm; Mathematics; Topology (electrical circuits); Quantum mechanics; Physics","authors":[{"name":"Andreas Klappenecker","is_ca":false},{"name":"Martin Rötteler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01462380469152812,"gpt":0.2890170193050417,"spread":0.2743932146135136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00233313,0.0006930121,0.00070223,0.0008517291,0.0008933771,0.002621133,0.002090738,0.001416621,0.006567394],"category_scores_gemma":[0.01198762,0.0004768798,0.001223502,0.0007831193,0.003057,0.006558083,0.003599616,0.002503901,0.001204015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001168812,"about_ca_system_score_gemma":0.001442564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007650108,"about_ca_topic_score_gemma":0.0007017095,"domain_scores_codex":[0.9970162,0.000698566,0.0002507995,0.0006174493,0.0011027,0.0003143073],"domain_scores_gemma":[0.9925822,0.002057615,0.0003530495,0.004275329,0.0005781383,0.0001536758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005229919,0.00006550786,0.0004224078,0.0001513558,0.00003394849,0.0001465383,0.0003323282,0.01552937,0.007988079,0.8911067,0.001818904,0.08235252],"study_design_scores_gemma":[0.00003544186,0.0000865444,0.0002284257,0.00006834112,0.00005710626,0.0002574051,0.00007112305,0.1077218,0.01915984,0.8312148,0.04106043,0.0000387761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02992631,0.0004746935,0.942874,0.001086966,0.0001221884,0.0001647036,0.00008708639,0.001766309,0.02349773],"genre_scores_gemma":[0.6253503,0.0009393896,0.3512945,0.000502715,0.0002132037,0.0006062451,0.0003741311,0.000893206,0.01982635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006567394,"threshold_uncertainty_score":0.02197009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2590512199","doi":"10.1142/s0129054116500386","title":"Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Enumeration; Abelian group; Representation (politics); Mathematics; Word (group theory); Combinatorics; Discrete mathematics; Class (philosophy); State (computer science); Function (biology); Algorithm; Computer science; Artificial intelligence","authors":[{"name":"Chen Fei Du","is_ca":true},{"name":"Hamoon Mousavi","is_ca":true},{"name":"Luke Schaeffer","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02227528627460695,"gpt":0.2935118611464839,"spread":0.271236574871877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131131,0.0004825263,0.0008091222,0.001246289,0.001320608,0.003151291,0.001974295,0.001152351,0.004641852],"category_scores_gemma":[0.01080751,0.0005066067,0.001094571,0.001312201,0.002208087,0.005888367,0.002749627,0.001932609,0.0007675158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002055614,"about_ca_system_score_gemma":0.001486963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083691,"about_ca_topic_score_gemma":0.00164598,"domain_scores_codex":[0.99722,0.0008124341,0.0003254967,0.0006110268,0.0007098296,0.0003211387],"domain_scores_gemma":[0.9891977,0.008313451,0.0005484398,0.0009130351,0.0007672785,0.0002601103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002634597,0.0001436272,0.001884551,0.0002417025,0.00004117209,0.0001013721,0.0004697251,0.01852245,0.006753152,0.8453655,0.003294972,0.1229182],"study_design_scores_gemma":[0.00006786335,0.00006252622,0.0003450832,0.00004266782,0.00002164449,0.0001073422,0.0001398498,0.1632006,0.006500926,0.8260787,0.003400307,0.00003256172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1126356,0.000488108,0.8720171,0.001001374,0.00009982479,0.0002156584,0.0002486733,0.0006502675,0.01264356],"genre_scores_gemma":[0.5549859,0.0002702293,0.4346247,0.0004025741,0.0001581291,0.0004518516,0.0006641909,0.0002063624,0.008236056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004641852,"threshold_uncertainty_score":0.01552856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146148441","doi":"10.1142/s0129054112400059","title":"FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Decidability; Property (philosophy); Formal language; Computer science; Regular language; Programming language; Code (set theory); Coding (social sciences); Mathematics; Theoretical computer science; Automaton","authors":[{"name":"Krystian Dudzinski","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07281263454795484,"gpt":0.3521866772893369,"spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005098226,0.0007184442,0.0007396537,0.001579038,0.001577538,0.00554235,0.002842976,0.001374782,0.005610653],"category_scores_gemma":[0.02119462,0.0009729489,0.002420762,0.00148214,0.007499056,0.01311627,0.002773626,0.004883807,0.0006987879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003500081,"about_ca_system_score_gemma":0.003021423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002311581,"about_ca_topic_score_gemma":0.002810785,"domain_scores_codex":[0.9950802,0.001333836,0.0006031625,0.0007887824,0.001775109,0.0004188848],"domain_scores_gemma":[0.9762787,0.01774593,0.00102651,0.003386139,0.001266346,0.0002964775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003140982,0.00004818664,0.0003667296,0.0001591405,0.00001476085,0.00008344642,0.0004232909,0.01421732,0.001524888,0.9619117,0.001087985,0.0201312],"study_design_scores_gemma":[0.00002507631,0.00001309436,0.0000835054,0.00003865648,0.00001557494,0.0000748654,0.000098972,0.07288582,0.003728015,0.9183004,0.004717576,0.0000183921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550821,0.0002844905,0.9747447,0.002088636,0.00004922787,0.0001258667,0.0002379761,0.0007459295,0.006214914],"genre_scores_gemma":[0.3855388,0.0007629092,0.6051461,0.0005534714,0.0002820306,0.0007573618,0.001124258,0.000548837,0.00528633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005610653,"threshold_uncertainty_score":0.02696228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994383533","doi":"10.1142/s0129054105003157","title":"STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Set (abstract data type); Root (linguistics); Mathematics; Free monoid; Regular language; Finite-state machine; Finite set; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","authors":[{"name":"Bryan Krawetz","is_ca":true},{"name":"John Lawrence","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02362928073566646,"gpt":0.2931312758776484,"spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001862129,0.0003974497,0.0007355476,0.001879712,0.001390473,0.005117709,0.001022299,0.001109246,0.005876777],"category_scores_gemma":[0.01177458,0.000410622,0.001230105,0.001539156,0.003300089,0.01077787,0.002431877,0.002433428,0.0004580493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00274539,"about_ca_system_score_gemma":0.001304053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001676373,"about_ca_topic_score_gemma":0.001278348,"domain_scores_codex":[0.9966621,0.0007230427,0.0003015255,0.0007278666,0.001100453,0.0004850554],"domain_scores_gemma":[0.9751559,0.01954172,0.001461803,0.002127021,0.00101044,0.0007031008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000398514,0.0001155998,0.004117202,0.000220367,0.00005229785,0.0001872404,0.001242841,0.03064742,0.007334491,0.9318249,0.0007990925,0.02306],"study_design_scores_gemma":[0.00003581499,0.0001252077,0.002127531,0.00003135871,0.00005059575,0.0001897474,0.0002205466,0.09965368,0.007670817,0.8866048,0.003231109,0.00005876811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7149848,0.001159473,0.2595547,0.002041038,0.00006530368,0.0001182302,0.0008379758,0.0004579186,0.02078054],"genre_scores_gemma":[0.9715837,0.0003863452,0.02391035,0.00009530913,0.00008877046,0.0001126846,0.0004734093,0.00007189879,0.003277605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005876777,"threshold_uncertainty_score":0.01991928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952369254","doi":"10.1142/s0129054103002047","title":"ANALYSIS OF QUANTUM FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Quantum algorithm; Quantum; Quantum operation; Quantum computer; Quantum capacity; Mathematics; Oracle; Computer science; Theoretical computer science; Quantum network; Open quantum system; Quantum mechanics; Physics","authors":[{"name":"Tomoyuki Yamakami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01346643962724772,"gpt":0.2863128427988463,"spread":0.2728464031715986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662832,0.0006174731,0.0008835891,0.001820798,0.001688116,0.002466962,0.001326716,0.001240566,0.005917674],"category_scores_gemma":[0.007693623,0.0003262684,0.001094976,0.0009545438,0.004650237,0.007279668,0.002044121,0.00260578,0.0006017903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002105195,"about_ca_system_score_gemma":0.001154162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001138296,"about_ca_topic_score_gemma":0.0005244056,"domain_scores_codex":[0.998505,0.0004081321,0.00006014864,0.0002056294,0.0005878069,0.0002333664],"domain_scores_gemma":[0.9966004,0.002040703,0.0002423995,0.0005118777,0.0004655251,0.0001391097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000449945,0.000005382057,0.00007378218,0.00001935899,0.000003025205,0.00001214873,0.0000407563,0.003533693,0.0002572968,0.9943936,0.0002239114,0.001432695],"study_design_scores_gemma":[0.000003642978,0.00001120279,0.0001571159,0.00001545831,0.000003883274,0.00002797149,0.00003555673,0.03887163,0.0004531676,0.9579979,0.002413164,0.000009237207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1703554,0.001940509,0.7474238,0.003447638,0.0001846731,0.0001230744,0.0003206333,0.0001906956,0.07601359],"genre_scores_gemma":[0.9290754,0.001882135,0.05814042,0.0004276612,0.0004741206,0.0001707619,0.0002222777,0.0001772445,0.00942994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005917674,"threshold_uncertainty_score":0.01979655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802228513","doi":"10.1142/s0129054118420017","title":"Rigidity and Substitutive Dendric Words","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Aperiodic graph; Rigidity (electromagnetism); Algebraic number; Word (group theory); Extension (predicate logic); Discrete mathematics; Class (philosophy); Graph; Computer science; Artificial intelligence","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Francesco Dolce","is_ca":true},{"name":"Fabien Durand","is_ca":false},{"name":"Julien Leroy","is_ca":false},{"name":"Dominique Perrin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01495877571196648,"gpt":0.2995764434481059,"spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372379,0.0003620359,0.0003533384,0.0008584379,0.001344798,0.001146481,0.0004738268,0.00072668,0.004954246],"category_scores_gemma":[0.001411403,0.0003726375,0.0004921476,0.0005275878,0.002735819,0.001938765,0.00137472,0.0009183335,0.001044655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005943723,"about_ca_system_score_gemma":0.0002878142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005306473,"about_ca_topic_score_gemma":0.000538271,"domain_scores_codex":[0.9993167,0.0001151405,0.00006018433,0.0002100922,0.0001931083,0.0001048048],"domain_scores_gemma":[0.9989391,0.0003634068,0.0002073204,0.0001962548,0.0001715151,0.0001224437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006873215,0.00001171079,0.0004109913,0.00004575685,0.000005588266,0.0003000071,0.0005266576,0.002113674,0.009373027,0.9809065,0.000371549,0.005865678],"study_design_scores_gemma":[0.0000202727,0.0000777711,0.001291154,0.00003491235,0.00001714057,0.001145835,0.0004699784,0.01124355,0.01043097,0.9629101,0.01230546,0.00005285532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7858821,0.00083492,0.140505,0.0004811409,0.0001380986,0.00004718186,0.0003486054,0.0003272603,0.07143565],"genre_scores_gemma":[0.9720518,0.0002087875,0.01746547,0.0001166533,0.00006167797,0.00003522751,0.0002091124,0.00005597274,0.009795223],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004954246,"threshold_uncertainty_score":0.01657361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131225295","doi":"10.1142/s0129054107004905","title":"INFORMATION DISTANCE AND ITS APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Universality (dynamical systems); Computer science; Information theory; Theoretical computer science; Tracing; Range (aeronautics); Triangle inequality; Mathematics; Discrete mathematics; Programming language","authors":[{"name":"Ming Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01218228403692906,"gpt":0.2975188154901351,"spread":0.285336531453206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004783448,0.001075572,0.001460949,0.006052646,0.002108198,0.004394247,0.002073923,0.00334243,0.004633902],"category_scores_gemma":[0.02046118,0.0006465039,0.00153541,0.007491138,0.007118283,0.009331764,0.004999558,0.005363327,0.001227139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003916373,"about_ca_system_score_gemma":0.001480769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001998794,"about_ca_topic_score_gemma":0.0006875202,"domain_scores_codex":[0.9944675,0.001914644,0.0004755881,0.001127748,0.00176455,0.0002499857],"domain_scores_gemma":[0.9855414,0.01021075,0.0005245791,0.001513084,0.001821846,0.0003883619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001140971,0.00001319092,0.0003377953,0.0001640443,0.00001966392,0.00006535141,0.0001374128,0.003259616,0.0001819435,0.9621615,0.00201876,0.03162927],"study_design_scores_gemma":[0.000004197368,0.00001712723,0.0001797725,0.00007064635,0.00001001801,0.0001812952,0.00005746433,0.01078424,0.0002552031,0.9704236,0.01800128,0.00001508364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01051545,0.06202008,0.8258931,0.01347987,0.001108351,0.0001177972,0.0004180608,0.0002725627,0.0861747],"genre_scores_gemma":[0.49226,0.06829939,0.4092544,0.004246503,0.006260126,0.0005896534,0.0007843907,0.0002317341,0.01807389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006052646,"threshold_uncertainty_score":0.02841538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967415065","doi":"10.1142/s0129054112400709","title":"BOUNDED PARIKH AUTOMATA","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounded function; Class (philosophy); Automaton; Set (abstract data type); Discrete mathematics; Affine transformation; Mathematics; Word (group theory); Regular language; Pure mathematics; Computer science; Theoretical computer science; Programming language; Artificial intelligence; Mathematical analysis","authors":[{"name":"Michaël Cadilhac","is_ca":true},{"name":"Alain Finkel","is_ca":false},{"name":"Pierre McKenzie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01829245612019108,"gpt":0.3058326623659386,"spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009223779,0.0004156687,0.0006386751,0.0005036987,0.0008695804,0.002378264,0.001329008,0.0009393848,0.004793854],"category_scores_gemma":[0.003870825,0.0003678062,0.001164208,0.0006526032,0.003018994,0.004216888,0.002316564,0.002029819,0.0009472742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001092381,"about_ca_system_score_gemma":0.0008078156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001206088,"about_ca_topic_score_gemma":0.0006087921,"domain_scores_codex":[0.9982723,0.0004159118,0.0001219975,0.0005216277,0.0004497551,0.0002184585],"domain_scores_gemma":[0.997438,0.001069944,0.0001792182,0.0009262005,0.0002622653,0.0001243829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009199326,0.00002163331,0.0003600109,0.0000787095,0.00001289347,0.0001519162,0.0004381209,0.009937205,0.006476675,0.9693621,0.0006929264,0.01237575],"study_design_scores_gemma":[0.00002454428,0.00007214837,0.0002273756,0.00002657592,0.00002111825,0.0002503618,0.00007693921,0.09707017,0.005723462,0.8827312,0.01374688,0.00002919467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1191743,0.0008446265,0.8242143,0.000845272,0.0001827262,0.0001188394,0.0007152052,0.002140478,0.05176423],"genre_scores_gemma":[0.9169998,0.0003556959,0.07187138,0.0002406776,0.0001431798,0.0001946226,0.0004479539,0.0001579233,0.009588693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004793854,"threshold_uncertainty_score":0.01603705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975431188","doi":"10.1142/s0129054113400285","title":"COMPLEXITY OF ATOMS OF REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Atom (system on chip); Intersection (aeronautics); Mathematics; Regular language; State (computer science); Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Computer science; Algorithm; Mathematical analysis","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Hellis Tamm","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02073960704499473,"gpt":0.2991157101043507,"spread":0.278376103059356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803242,0.0002952812,0.000600111,0.001032878,0.000851435,0.002892194,0.00116438,0.0006323737,0.005539994],"category_scores_gemma":[0.008914998,0.0003830503,0.001122286,0.0006445706,0.001994859,0.005156347,0.001636167,0.001037201,0.0003664969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002235796,"about_ca_system_score_gemma":0.001114023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155036,"about_ca_topic_score_gemma":0.001912137,"domain_scores_codex":[0.9979118,0.0003547607,0.0001925995,0.0004284294,0.0007643191,0.0003481071],"domain_scores_gemma":[0.990091,0.00711718,0.0008415249,0.0007074149,0.0007730439,0.0004697695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001406664,0.0002203639,0.01732503,0.0005849195,0.000146837,0.0008136465,0.003406176,0.08638927,0.04687717,0.7984136,0.003977078,0.0404392],"study_design_scores_gemma":[0.0000561511,0.0001260162,0.003934862,0.00002822451,0.00006064617,0.0005051831,0.0003439475,0.2466551,0.01269333,0.7304646,0.005073473,0.00005848951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8916582,0.0002631194,0.09409056,0.0007204808,0.00002280328,0.0001131484,0.001245815,0.0003862378,0.01149949],"genre_scores_gemma":[0.9724609,0.00011913,0.02238623,0.00007002595,0.00004585971,0.0001444318,0.0008640567,0.00009882289,0.003810521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005539994,"threshold_uncertainty_score":0.01853311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001444496","doi":"10.1142/s0129054105003030","title":"APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McMaster University","keywords":"Job shop scheduling; Job shop; Mathematical optimization; Generalization; Approximation algorithm; Scheduling (production processes); Computer science; Scheme (mathematics); Flow shop scheduling; Algorithm; Process (computing); Mathematics","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Monaldo Mastrolilli","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0273347959252601,"gpt":0.2993553875880289,"spread":0.2720205916627688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002861777,0.001592089,0.001807144,0.00117736,0.001005288,0.002354629,0.002817925,0.001771689,0.004120077],"category_scores_gemma":[0.01173604,0.000741696,0.001421366,0.002328497,0.001224649,0.002934444,0.001997944,0.002951231,0.001012986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233733,"about_ca_system_score_gemma":0.001711455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004457215,"about_ca_topic_score_gemma":0.004005881,"domain_scores_codex":[0.9979088,0.0007487927,0.0001032378,0.000264518,0.0005917752,0.0003827758],"domain_scores_gemma":[0.9950984,0.003317385,0.0003571668,0.0005954784,0.0003935904,0.0002379845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001989417,0.0001213045,0.0004493026,0.0001801276,0.00006143573,0.00007579408,0.0001204844,0.8462582,0.0006598526,0.08692036,0.005962395,0.05899179],"study_design_scores_gemma":[0.00003216859,0.00002281308,0.00005456272,0.00001458904,0.000008667956,0.00002624262,0.00002332429,0.9498129,0.0001322582,0.04853842,0.001328317,0.000005750966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01210301,0.001726877,0.9791965,0.0005481791,0.0001407757,0.00007571248,0.0001347808,0.0007339673,0.005340162],"genre_scores_gemma":[0.4186392,0.002550504,0.5692236,0.0004085563,0.0003137718,0.0004072585,0.0009648096,0.0004222386,0.007070107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457215,"threshold_uncertainty_score":0.01695865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888233883","doi":"10.1142/s012905411842008x","title":"Operations on Unambiguous Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Concatenation (mathematics); Mathematics; Combinatorics; Nondeterministic finite automaton; Quotient; Closure (psychology); Discrete mathematics; String (physics); Regular language; Deterministic finite automaton; Upper and lower bounds; Alphabet; Finite-state machine; Automaton; Computer science; Automata theory; Algorithm","authors":[{"name":"Jozef Jirásek","is_ca":true},{"name":"Galina Jirásková","is_ca":false},{"name":"Juraj Šebej","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01799966834057566,"gpt":0.3097499118820159,"spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661482,0.0009474881,0.0009867371,0.001520068,0.001696369,0.004495133,0.001584776,0.001127121,0.007290174],"category_scores_gemma":[0.01644306,0.0008377687,0.001488806,0.00187397,0.003590039,0.01230885,0.003717319,0.00256708,0.001074552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441559,"about_ca_system_score_gemma":0.001076812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001086292,"about_ca_topic_score_gemma":0.0008954117,"domain_scores_codex":[0.9946138,0.001013108,0.0007012525,0.001189837,0.001693925,0.0007880022],"domain_scores_gemma":[0.9795297,0.01405702,0.0015612,0.002543891,0.001527741,0.0007804788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001823185,0.00006564662,0.0008875286,0.0002134198,0.00001668381,0.0002025013,0.0006214637,0.02086425,0.005156367,0.9464365,0.001151916,0.02420144],"study_design_scores_gemma":[0.00002179368,0.00005513489,0.0002391921,0.00003002207,0.00001825435,0.0001067679,0.0001133841,0.03574936,0.004407694,0.9551646,0.00405928,0.00003458749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3608298,0.001599259,0.5958172,0.0009868598,0.0002697806,0.000191471,0.001316219,0.001522579,0.0374669],"genre_scores_gemma":[0.8828743,0.0009173214,0.1088983,0.0001964886,0.0003006982,0.000292021,0.0007733971,0.0003046551,0.005442862],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007290174,"threshold_uncertainty_score":0.02438807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091155243","doi":"10.1142/s0129054112400679","title":"UNARY PATTERNS WITH INVOLUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","authors":[{"name":"Bastian Bischoff","is_ca":false},{"name":"James D. Currie","is_ca":true},{"name":"Dirk Nowotka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01414582211363474,"gpt":0.2763654520099963,"spread":0.2622196298963616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182649,0.0008213589,0.0007121979,0.001137639,0.001287909,0.002594472,0.0009806878,0.00102984,0.004180919],"category_scores_gemma":[0.003612891,0.0005068262,0.0008693827,0.001119971,0.002643216,0.004005259,0.001893717,0.001539297,0.001843326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006032009,"about_ca_system_score_gemma":0.000648123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000360037,"about_ca_topic_score_gemma":0.0004211702,"domain_scores_codex":[0.9979895,0.0002537038,0.0003158058,0.000525052,0.0005415668,0.0003742601],"domain_scores_gemma":[0.9969236,0.0008634485,0.000451355,0.00091225,0.0006338205,0.0002154844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001778999,0.00006653029,0.001282185,0.0001918617,0.0000261224,0.0008626616,0.001164309,0.001564009,0.01602851,0.9166179,0.002465993,0.05955197],"study_design_scores_gemma":[0.00003698488,0.0001418159,0.0006422414,0.00007070132,0.00005409661,0.001688609,0.0002511667,0.01052661,0.01947593,0.9249534,0.04210017,0.00005829191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2192665,0.001547285,0.6992473,0.0006370681,0.0008190858,0.0002187855,0.0006144479,0.002176591,0.07547288],"genre_scores_gemma":[0.8173382,0.0007829503,0.1560403,0.0003754903,0.0004446636,0.0003060693,0.0006095018,0.0005793244,0.02352346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004180919,"threshold_uncertainty_score":0.01398653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168854371","doi":"10.1142/s0129054107005443","title":"STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Quantum finite automata; Automaton; Mathematics; Regular language; DFA minimization; ω-automaton; Simple (philosophy); Upper and lower bounds; State (computer science); Discrete mathematics; Finite state; Automata theory; Combinatorics; Theoretical computer science; Computer science; Algorithm","authors":[{"name":"Kai Salomaa","is_ca":true},{"name":"Paul N. Schofield","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02620600082371652,"gpt":0.3086807984164208,"spread":0.2824747975927043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368192,0.0003598974,0.0007154795,0.0007560793,0.0006161703,0.002729634,0.001447784,0.0007222693,0.00346908],"category_scores_gemma":[0.005836512,0.0003712677,0.001244367,0.0007309156,0.001408922,0.004610156,0.002055467,0.001492424,0.0003586091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040429,"about_ca_system_score_gemma":0.0005767219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00131109,"about_ca_topic_score_gemma":0.001144474,"domain_scores_codex":[0.9980693,0.0003704614,0.0002379879,0.0005063876,0.0006041907,0.0002116637],"domain_scores_gemma":[0.9944383,0.003552095,0.000507168,0.0008410027,0.0004262887,0.0002351866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004791306,0.0001741547,0.003689709,0.0002936354,0.0001089799,0.0004711314,0.001047498,0.183979,0.02699163,0.7376876,0.001096572,0.043981],"study_design_scores_gemma":[0.00002530543,0.00008852349,0.0008342102,0.00001598445,0.000062353,0.0001351925,0.0001097701,0.3734566,0.0128381,0.6109838,0.001413765,0.00003652618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6778781,0.0002034867,0.3122821,0.0004695729,0.00003981297,0.00006315156,0.000502984,0.0006286646,0.007932081],"genre_scores_gemma":[0.9656636,0.0001199545,0.03037706,0.00005368302,0.00002298447,0.0001004489,0.000452908,0.00005959909,0.003149797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00346908,"threshold_uncertainty_score":0.0116052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089455626","doi":"10.1142/s0129054112400047","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; Continuation; State (computer science); Star (game theory); Computer science; Mathematics; Algorithm; Programming language; History","authors":[{"name":"Bo Cui","is_ca":true},{"name":"Yuan Gao","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03211804920181332,"gpt":0.3122282846005669,"spread":0.2801102353987536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134057,0.0005579232,0.0008057437,0.001015934,0.001358563,0.004679887,0.001593754,0.001178328,0.0144514],"category_scores_gemma":[0.01140285,0.000446575,0.001864963,0.001172966,0.002125061,0.01012667,0.002898839,0.002950327,0.0007080974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00205776,"about_ca_system_score_gemma":0.002164203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001746823,"about_ca_topic_score_gemma":0.00204854,"domain_scores_codex":[0.9973657,0.0005085741,0.0002171096,0.0005327944,0.0007713436,0.0006045013],"domain_scores_gemma":[0.9807896,0.01377836,0.001197677,0.002472268,0.001090254,0.0006717524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001463032,0.0004152935,0.007145211,0.0005433115,0.0001359368,0.0004642388,0.00108448,0.09672843,0.01761264,0.8164917,0.003483825,0.05443184],"study_design_scores_gemma":[0.00008434532,0.0002483297,0.002128559,0.00004097383,0.0001685227,0.0003434916,0.0004296909,0.3088624,0.02250241,0.6613394,0.003743085,0.0001088127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.755695,0.0003709313,0.2132387,0.001274838,0.00009423871,0.0002273187,0.001079839,0.0006280209,0.02739104],"genre_scores_gemma":[0.9689066,0.0001844488,0.02524994,0.00006334748,0.00004385383,0.0001540985,0.0006478578,0.000168472,0.004581465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0144514,"threshold_uncertainty_score":0.04834479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","authors":[{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0312662277924988,"gpt":0.3391405770950674,"spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305949,0.0003577421,0.0008479709,0.001152388,0.0008354839,0.001270093,0.0007899867,0.000698704,0.001310891],"category_scores_gemma":[0.007514371,0.0004901502,0.000713127,0.001335985,0.001169624,0.003139948,0.002115852,0.0007259194,0.0004015654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005374326,"about_ca_system_score_gemma":0.0008707838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008968936,"about_ca_topic_score_gemma":0.001471307,"domain_scores_codex":[0.9991053,0.0001831729,0.00008059832,0.0002886034,0.0002465841,0.0000957641],"domain_scores_gemma":[0.9926467,0.003962079,0.0009970465,0.00130274,0.0007238968,0.0003675758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007899396,0.0002321083,0.0145573,0.001224423,0.0001046924,0.001479457,0.004150942,0.06888961,0.09739385,0.3059584,0.0150916,0.4901277],"study_design_scores_gemma":[0.0000522996,0.0002602719,0.004738577,0.00008890202,0.00007220049,0.001941052,0.001143702,0.2043543,0.03479042,0.7340223,0.01848585,0.0000502443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3230009,0.0004981269,0.6699647,0.0004971035,0.00003102637,0.0001663034,0.000835826,0.001133398,0.003872631],"genre_scores_gemma":[0.5946152,0.0004285689,0.3992307,0.0001631267,0.00006766197,0.0001582169,0.002644846,0.000347212,0.002344516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001310891,"threshold_uncertainty_score":0.004921496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}