{"meta":{"query_hash":"f65248b65cd1","filters":{"venue":"International Journal of Foundations of Computer Science"},"cohort_total":182,"direct_labels_cover":0,"predictions_cover":182,"exported":182,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f65248b65cd1","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Foundations+of+Computer+Science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032152299180226156,"score_gpt":0.31842170595452435,"score_spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501444314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78027856,0.0005343276,0.19333716,0.0010748999,0.00005571221,0.00012738319,0.0010428726,0.00060910615,0.022940008],"genre_scores_gemma":[0.9747672,0.00025031666,0.018670095,0.00012042898,0.00007803678,0.00013247819,0.0008737184,0.00014909846,0.0049585323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711823,0.0004054478,0.0003420369,0.00060447445,0.0010122743,0.00051746774],"domain_scores_gemma":[0.98691326,0.00870308,0.0007560884,0.0012600699,0.0014312491,0.0009361838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196064,0.00049895875,0.00095644285,0.0012660525,0.0011373889,0.0038621507,0.0012923867,0.0006495583,0.007458239],"category_scores_gemma":[0.011329857,0.0004444755,0.0015183367,0.00093048933,0.003000559,0.009828074,0.003411592,0.0020144877,0.0006038087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005879871,0.00011467724,0.004291371,0.00025657017,0.00005118778,0.00038890267,0.0018516822,0.03484719,0.014420119,0.9191266,0.0019453518,0.022118455],"study_design_scores_gemma":[0.00002852342,0.000059353082,0.0009609214,0.00001557776,0.000029787048,0.00021441217,0.0001397637,0.09238071,0.0065893396,0.8972252,0.002320244,0.000036115795],"about_ca_topic_score_codex":0.0017169906,"about_ca_topic_score_gemma":0.0011572626,"teacher_disagreement_score":0.007458239,"about_ca_system_score_codex":0.0027179178,"about_ca_system_score_gemma":0.0015450021,"threshold_uncertainty_score":0.024950325},"labels":[],"label_agreement":null},{"id":"W1645602948","doi":"10.1142/s0129054114400097","title":"SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Complexity class; Abstract family of languages; Cone (formal languages); Class (philosophy); Descriptive complexity theory; Formal language","score_opus":0.019917248690145807,"score_gpt":0.3049048066592412,"score_spread":0.28498755796909536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645602948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284471,0.0003683808,0.049001306,0.0013655572,0.000034466673,0.000041706782,0.00058967044,0.00024637213,0.019905465],"genre_scores_gemma":[0.99104404,0.00015687718,0.006324801,0.0000927714,0.00008764333,0.000058243237,0.0004140458,0.000054038148,0.0017675635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771833,0.00036575657,0.00019342802,0.00053431565,0.00074249937,0.00044571998],"domain_scores_gemma":[0.97487575,0.019610604,0.0019723787,0.0015082395,0.001148516,0.0008844242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016604475,0.00035770342,0.00080125243,0.0013717323,0.001191019,0.0035515185,0.0011397983,0.0007177968,0.0032259875],"category_scores_gemma":[0.011164125,0.0005351571,0.0012862796,0.00075982476,0.0028304388,0.0058935545,0.0022727565,0.0018484471,0.00023794519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060827733,0.00017205226,0.013040112,0.0003231322,0.00008990317,0.00041975718,0.0019525009,0.024467211,0.022483949,0.91277516,0.002282079,0.021385854],"study_design_scores_gemma":[0.00003625513,0.000061412866,0.011100848,0.0000406588,0.000071489405,0.0005773314,0.00038284995,0.10924939,0.009394135,0.8665793,0.0024206997,0.00008563835],"about_ca_topic_score_codex":0.0009919141,"about_ca_topic_score_gemma":0.00094566314,"teacher_disagreement_score":0.0035515185,"about_ca_system_score_codex":0.0019522373,"about_ca_system_score_gemma":0.001098382,"threshold_uncertainty_score":0.014164507},"labels":[],"label_agreement":null},{"id":"W1670403172","doi":"10.1142/s0129054116500088","title":"Remarks on Privileged Words","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Linguistics; Context (archaeology); Word length; Computer science; Natural language processing; Arithmetic; Mathematics; History; Philosophy","score_opus":0.016328615167978063,"score_gpt":0.30530616625986967,"score_spread":0.2889775510918916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670403172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063066445,0.033664808,0.31958935,0.23141871,0.022696543,0.00031118808,0.0016806105,0.0022452944,0.325327],"genre_scores_gemma":[0.72925633,0.018114438,0.08315398,0.07512052,0.023760986,0.0005810196,0.0011041682,0.0009713837,0.06793721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447495,0.0017317116,0.00033927648,0.0014840266,0.0013601203,0.00060987065],"domain_scores_gemma":[0.9805407,0.013734839,0.00067485747,0.0021488385,0.0020879065,0.00081297144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160233,0.0012767824,0.0013589723,0.0017050058,0.004379186,0.0033907646,0.003647624,0.0034621223,0.01988008],"category_scores_gemma":[0.020674132,0.0005399722,0.0017339893,0.001683808,0.010753941,0.021519816,0.0057693883,0.009511689,0.003861032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010296994,0.000034554483,0.00056280114,0.00025926568,0.000016322834,0.00036467722,0.0008613785,0.0013748619,0.0005990404,0.9528689,0.02800448,0.014950775],"study_design_scores_gemma":[0.000024226805,0.000043567677,0.0003357649,0.0001044165,0.000012253672,0.00027165734,0.00033749864,0.0013375339,0.0006931822,0.9078182,0.08898865,0.000032974134],"about_ca_topic_score_codex":0.0024608406,"about_ca_topic_score_gemma":0.00100046,"teacher_disagreement_score":0.01988008,"about_ca_system_score_codex":0.0019650813,"about_ca_system_score_gemma":0.0008272841,"threshold_uncertainty_score":0.06650549},"labels":[],"label_agreement":null},{"id":"W1854120094","doi":"10.1142/s0129054111008131","title":"PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Catenation; Mathematics; Involution (esoterism); Palindrome; Word (group theory); Combinatorics; Combinatorics on words; Commutative property; Primitive root modulo n; Arithmetic; Discrete mathematics; Modulo; Geometry","score_opus":0.03143803747516207,"score_gpt":0.25822805487195344,"score_spread":0.22679001739679136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854120094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38839772,0.003570358,0.53184134,0.0014094978,0.00049451634,0.00013428938,0.00032913202,0.00056091516,0.073262244],"genre_scores_gemma":[0.87889045,0.0012357556,0.108236864,0.0003071633,0.00047902451,0.0001363774,0.000281633,0.00017252119,0.010260073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989442,0.00029427317,0.00014705696,0.00024287667,0.00028458756,0.000087019995],"domain_scores_gemma":[0.99667066,0.0016612053,0.00038148428,0.0005226118,0.00057541305,0.0001886693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083709,0.00041475255,0.00047824573,0.0009569911,0.0010121915,0.0015201913,0.0006677299,0.0007218668,0.00547094],"category_scores_gemma":[0.0047256523,0.00043536798,0.00072626566,0.00096762326,0.0023044464,0.0038930047,0.001888563,0.001146207,0.0007782269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006648932,0.000019319774,0.00048032144,0.0001476394,0.0000071310556,0.00035719454,0.00052068586,0.002090884,0.0058522276,0.9653847,0.00051723747,0.024556149],"study_design_scores_gemma":[0.0000118887165,0.000054888107,0.00020110849,0.000034776127,0.00000915727,0.0006521199,0.00016144392,0.011847552,0.0049475897,0.97222465,0.009833209,0.000021589673],"about_ca_topic_score_codex":0.0002169185,"about_ca_topic_score_gemma":0.00024680753,"teacher_disagreement_score":0.00547094,"about_ca_system_score_codex":0.000552097,"about_ca_system_score_gemma":0.0004490521,"threshold_uncertainty_score":0.018302083},"labels":[],"label_agreement":null},{"id":"W1965531865","doi":"10.1142/s0129054105003364","title":"RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Context-free language; Combinatorics; Computer science; Automaton; Theoretical computer science; Programming language; Artificial intelligence; Rule-based machine translation","score_opus":0.01234376465392803,"score_gpt":0.30105796547958724,"score_spread":0.28871420082565924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965531865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341905,0.00053462485,0.45050403,0.0012509455,0.00006002021,0.00015482421,0.0009356995,0.0013138814,0.011055556],"genre_scores_gemma":[0.9365505,0.00032325948,0.054603677,0.00020452724,0.000056626966,0.00022619595,0.0016025451,0.00021340998,0.0062192236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967625,0.0005480944,0.00033536335,0.0010808986,0.0006679051,0.000605267],"domain_scores_gemma":[0.9856397,0.009448631,0.0010495345,0.0022231808,0.00076155673,0.00087749364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028397916,0.0005608356,0.0008453159,0.0012848293,0.0016392347,0.0040454655,0.002099799,0.0013140147,0.0037440672],"category_scores_gemma":[0.010804231,0.0010047699,0.0024294008,0.0009735943,0.004072665,0.010983808,0.0036071215,0.0045076786,0.00040291925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043670562,0.00024713384,0.004376527,0.00022672913,0.00009768271,0.0006241477,0.0017474407,0.04103273,0.012629226,0.91263306,0.001267715,0.024680937],"study_design_scores_gemma":[0.000055370427,0.000054868015,0.00054578343,0.000042981297,0.00003544076,0.00024156067,0.00042577714,0.075545296,0.013437827,0.90685105,0.0027273027,0.00003676434],"about_ca_topic_score_codex":0.001998192,"about_ca_topic_score_gemma":0.0016796195,"teacher_disagreement_score":0.0040454655,"about_ca_system_score_codex":0.0022243846,"about_ca_system_score_gemma":0.0015136517,"threshold_uncertainty_score":0.01613915},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019312186715823756,"score_gpt":0.3218863398165222,"score_spread":0.30257415310069846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966140610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19518703,0.0006897692,0.79663146,0.0003168646,0.00012565442,0.00021780694,0.00010155165,0.00085765345,0.005872224],"genre_scores_gemma":[0.77265984,0.00042869366,0.22313164,0.00007841225,0.00004271535,0.00014844003,0.00017515081,0.00010586336,0.003229243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902534,0.00026721382,0.00005028044,0.00023009494,0.00019719072,0.00022988174],"domain_scores_gemma":[0.99745196,0.0011605681,0.00038953283,0.0006198107,0.00017410539,0.00020409077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492952,0.0009975866,0.0010244489,0.00060376176,0.001131066,0.0010127699,0.0017625651,0.00097042246,0.00161489],"category_scores_gemma":[0.0051058796,0.00042284813,0.0009375245,0.00056212314,0.0015537796,0.0023570645,0.0026857902,0.0008971564,0.0003650627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037526968,0.00007182068,0.0011298989,0.00022074868,0.0000623808,0.00045734885,0.0003912522,0.8970886,0.013141522,0.039190955,0.0011656224,0.046704523],"study_design_scores_gemma":[0.000048728834,0.00016233498,0.0002668151,0.0000149314355,0.000023960376,0.00016301466,0.000262139,0.96826106,0.006183206,0.021367611,0.003225327,0.000020888052],"about_ca_topic_score_codex":0.0030950103,"about_ca_topic_score_gemma":0.0024015252,"teacher_disagreement_score":0.0030950103,"about_ca_system_score_codex":0.00073408795,"about_ca_system_score_gemma":0.00081901136,"threshold_uncertainty_score":0.0061540008},"labels":[],"label_agreement":null},{"id":"W1967301683","doi":"10.1142/s0129054111008623","title":"SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Self-stabilization; Time complexity; Asynchronous communication; Computer science; Connected component; Distributed algorithm; Node (physics); Spanning tree; Enhanced Data Rates for GSM Evolution; Computation; Strongly connected component; State (computer science); Upper and lower bounds; Binary logarithm; Identifier; Degree (music); Computational complexity theory; Algorithm; Mathematics; Discrete mathematics; Distributed computing; Computer network","score_opus":0.03714620429616353,"score_gpt":0.290319023698489,"score_spread":0.25317281940232544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967301683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1631915,0.00009417829,0.83098596,0.00012997001,0.000032628323,0.00007751861,0.000081742866,0.0015506207,0.003855906],"genre_scores_gemma":[0.79128414,0.000063334606,0.20599735,0.000047898964,0.000011838584,0.00010957304,0.00018081191,0.000100894336,0.0022041511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996939,0.000056663812,0.000024770598,0.000075967146,0.000099082295,0.000049737962],"domain_scores_gemma":[0.9989981,0.0003392965,0.00011932188,0.00020978821,0.00027350243,0.00005998159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036126375,0.00031621795,0.00035565777,0.000738457,0.0006046422,0.00085873326,0.00090924476,0.0005592134,0.0022437603],"category_scores_gemma":[0.0028915985,0.00022153888,0.0003286864,0.0006713853,0.0006432278,0.0013379107,0.0012358881,0.00034671987,0.00044047146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007409836,0.00011353126,0.0043086167,0.00022426056,0.00007712681,0.00049916515,0.0008585426,0.5395557,0.050738193,0.17159696,0.0038859623,0.22740088],"study_design_scores_gemma":[0.000027582324,0.000045184406,0.00039996844,0.000012500832,0.000015453656,0.00008527107,0.00005435383,0.9281698,0.015332366,0.053542975,0.0023008299,0.0000137973775],"about_ca_topic_score_codex":0.0012561394,"about_ca_topic_score_gemma":0.0014281927,"teacher_disagreement_score":0.0022437603,"about_ca_system_score_codex":0.0005917354,"about_ca_system_score_gemma":0.00058317924,"threshold_uncertainty_score":0.007506132},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018292456120191078,"score_gpt":0.3058326623659386,"score_spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967415065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11917433,0.00084462645,0.82421434,0.00084527204,0.0001827262,0.00011883941,0.0007152052,0.0021404785,0.051764227],"genre_scores_gemma":[0.9169998,0.00035569587,0.07187138,0.00024067759,0.00014317984,0.00019462264,0.00044795388,0.00015792334,0.009588693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.0004159118,0.00012199749,0.0005216277,0.00044975508,0.00021845853],"domain_scores_gemma":[0.99743795,0.0010699445,0.0001792182,0.0009262005,0.0002622653,0.00012438293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009223779,0.00041566868,0.00063867506,0.00050369865,0.00086958037,0.002378264,0.001329008,0.0009393848,0.0047938544],"category_scores_gemma":[0.0038708248,0.00036780618,0.0011642078,0.00065260316,0.0030189941,0.0042168875,0.0023165639,0.002029819,0.0009472742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009199326,0.000021633306,0.0003600109,0.0000787095,0.000012893469,0.00015191619,0.0004381209,0.009937205,0.0064766747,0.96936214,0.0006929264,0.012375753],"study_design_scores_gemma":[0.000024544275,0.00007214837,0.00022737564,0.000026575919,0.000021118249,0.00025036183,0.00007693921,0.09707017,0.0057234615,0.8827312,0.013746883,0.000029194674],"about_ca_topic_score_codex":0.0012060881,"about_ca_topic_score_gemma":0.0006087921,"teacher_disagreement_score":0.0047938544,"about_ca_system_score_codex":0.0010923814,"about_ca_system_score_gemma":0.00080781564,"threshold_uncertainty_score":0.016037047},"labels":[],"label_agreement":null},{"id":"W1967770912","doi":"10.1142/s0129054112400205","title":"EXACT PARALLEL ALIGNMENT OF MEGABASE GENOMIC SEQUENCES WITH TUNABLE WORK DISTRIBUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Speedup; Computer science; Pairwise comparison; Quadratic equation; Heuristic; Multiple sequence alignment; Sequence (biology); Distribution (mathematics); Basis (linear algebra); Algorithm; Space (punctuation); Parallel computing; Theoretical computer science; Sequence alignment; Mathematics; Artificial intelligence; Biology","score_opus":0.017949975043012115,"score_gpt":0.28140875808261534,"score_spread":0.26345878303960324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967770912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40014434,0.0008569146,0.5869625,0.0002441602,0.00009944598,0.00020099063,0.00023733219,0.008000243,0.0032541284],"genre_scores_gemma":[0.5581478,0.00037870518,0.43742055,0.00009168757,0.000028876182,0.00033870048,0.00094108057,0.0005187781,0.0021338046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896336,0.00020605995,0.000094397816,0.00028210296,0.0003407458,0.00011329174],"domain_scores_gemma":[0.9986241,0.00041787743,0.00015208722,0.0005093373,0.00022917466,0.00006745136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010454691,0.0007439637,0.00078140927,0.00082590734,0.0007767214,0.0009402435,0.0016750386,0.0006139293,0.0015196074],"category_scores_gemma":[0.0033635134,0.00044695823,0.00034202205,0.0021203212,0.00057448685,0.0018324814,0.0011164906,0.00058094494,0.0008597333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028135416,0.0006384684,0.0093869455,0.00060345326,0.00017540618,0.00048700342,0.0008090313,0.14465274,0.37430468,0.013823709,0.0061661247,0.4461388],"study_design_scores_gemma":[0.00029580394,0.0005376533,0.0038664306,0.000020548552,0.0000555496,0.00030714672,0.00023881574,0.72394824,0.25097585,0.012477165,0.0072097303,0.00006706442],"about_ca_topic_score_codex":0.0010833757,"about_ca_topic_score_gemma":0.0014961881,"teacher_disagreement_score":0.0016750386,"about_ca_system_score_codex":0.0006733548,"about_ca_system_score_gemma":0.0007508136,"threshold_uncertainty_score":0.0055289865},"labels":[],"label_agreement":null},{"id":"W1968593409","doi":"10.1142/s0129054112400540","title":"DE BRUIJN SEQUENCES REVISITED","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Integer (computer science); Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.019679544085339343,"score_gpt":0.31379569095218235,"score_spread":0.294116146866843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968593409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38008007,0.0055922573,0.49008164,0.0027978944,0.0011214254,0.00032346524,0.0009871481,0.0012282726,0.117787726],"genre_scores_gemma":[0.7605224,0.0014769193,0.1955486,0.00056014437,0.0005272228,0.00023530613,0.0006192938,0.00027467238,0.040235505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861324,0.00026932612,0.00013580202,0.0004252445,0.00037911625,0.00017721098],"domain_scores_gemma":[0.99607396,0.002161767,0.00039830376,0.0005718648,0.0005518273,0.0002423403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082632416,0.0005024677,0.0005182958,0.0011214707,0.001683756,0.0014596302,0.00074826716,0.00092341506,0.007519459],"category_scores_gemma":[0.0048856144,0.00037552326,0.0005420199,0.0013181668,0.002298464,0.0039512296,0.001239581,0.001721994,0.0016882416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019697007,0.000059985687,0.00094712863,0.00025844382,0.000011993443,0.00037807238,0.00073202525,0.004826502,0.01381503,0.9074422,0.0025814096,0.06875014],"study_design_scores_gemma":[0.00003372814,0.00013323972,0.0010361971,0.000109009794,0.000020397325,0.0016374511,0.0003027988,0.025705015,0.017685007,0.8749367,0.07835743,0.00004317517],"about_ca_topic_score_codex":0.00084331224,"about_ca_topic_score_gemma":0.0011108514,"teacher_disagreement_score":0.007519459,"about_ca_system_score_codex":0.0010691987,"about_ca_system_score_gemma":0.000979696,"threshold_uncertainty_score":0.025155067},"labels":[],"label_agreement":null},{"id":"W1968754294","doi":"10.1142/s012905410500342x","title":"A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Concatenation (mathematics); Mathematics; Second-order arithmetic; Expressive power; Hierarchy; Class (philosophy); Analytical hierarchy; Discrete mathematics; Characterization (materials science); Property (philosophy); Axiom; Order (exchange); Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process","score_opus":0.008621856616376914,"score_gpt":0.27510471527781283,"score_spread":0.2664828586614359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968754294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27923557,0.0013691148,0.6765638,0.0019985933,0.00010648115,0.00013077247,0.000880847,0.0005005144,0.039214272],"genre_scores_gemma":[0.8299405,0.00077290036,0.16001377,0.00033907496,0.00024875486,0.0001695455,0.00084604684,0.000105117884,0.0075644045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880636,0.00026473388,0.000091495,0.0002576467,0.00038978586,0.0001899813],"domain_scores_gemma":[0.9979236,0.0012175819,0.00025346508,0.00020080838,0.00027636948,0.00012812052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010624491,0.00044711764,0.00057133095,0.0014911154,0.0007630083,0.0028347299,0.0011088823,0.0006970074,0.0027255933],"category_scores_gemma":[0.0040564104,0.00041758237,0.0010095956,0.001399659,0.0025743123,0.0048406343,0.0018886179,0.0023739778,0.00043718665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023673962,0.000015220546,0.00033471157,0.000047803616,0.000008033954,0.00008532463,0.0003981542,0.0028191202,0.0031155662,0.98520166,0.00054774823,0.0074028675],"study_design_scores_gemma":[0.000016980455,0.000024901972,0.00041317084,0.00003305967,0.0000138191335,0.00020454435,0.00011384141,0.04399127,0.0018032789,0.94786197,0.0054998607,0.000023334836],"about_ca_topic_score_codex":0.000892622,"about_ca_topic_score_gemma":0.00083573547,"teacher_disagreement_score":0.0028347299,"about_ca_system_score_codex":0.0013739943,"about_ca_system_score_gemma":0.00076247915,"threshold_uncertainty_score":0.009969056},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","score_opus":0.025460061474614406,"score_gpt":0.2705732151522423,"score_spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971882628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8939945,0.0009949934,0.076933905,0.0003140293,0.00010178625,0.00003376254,0.00016832238,0.00017536007,0.027283419],"genre_scores_gemma":[0.9910591,0.00021361456,0.0065042386,0.000038967155,0.000025357063,0.000023730989,0.000044754615,0.000016252417,0.0020738621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984574,0.00002294039,0.000011338506,0.000033428725,0.00004278438,0.00004374914],"domain_scores_gemma":[0.9996952,0.00011543722,0.00008413011,0.000049992923,0.000026622592,0.000028664148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013603544,0.00021435242,0.0002287589,0.00047818714,0.00028506343,0.0006488263,0.00035398992,0.00042735637,0.001759297],"category_scores_gemma":[0.00067937654,0.00015228678,0.0002790023,0.00041185794,0.000693657,0.0008055001,0.00042034575,0.0004019578,0.00014978011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062213786,0.000041403036,0.001226422,0.00013788765,0.00003408031,0.00033685527,0.00039212004,0.016693853,0.06670915,0.8809725,0.000982351,0.031851154],"study_design_scores_gemma":[0.00022594447,0.0005535793,0.005423706,0.00008831133,0.0000999371,0.0017288921,0.00037383445,0.2682244,0.07876683,0.6262804,0.018100712,0.00013344575],"about_ca_topic_score_codex":0.00019247712,"about_ca_topic_score_gemma":0.00024952664,"teacher_disagreement_score":0.001759297,"about_ca_system_score_codex":0.00051673973,"about_ca_system_score_gemma":0.00024649993,"threshold_uncertainty_score":0.005885422},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007283888517623,"score_gpt":0.2653929551883784,"score_spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972572665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12567209,0.0005273111,0.8655131,0.0005038406,0.00021050315,0.00015447501,0.0009105117,0.0016164366,0.004891709],"genre_scores_gemma":[0.38889572,0.00036674764,0.60614073,0.00014683754,0.00011280113,0.00016985551,0.00101247,0.00030468506,0.0028502294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731016,0.0006741135,0.00033526708,0.00089817494,0.00063853373,0.00014378091],"domain_scores_gemma":[0.99019593,0.0065643224,0.0005562268,0.0016156564,0.0007722158,0.00029564096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017307469,0.00045056743,0.00073969277,0.0013856357,0.00073333946,0.0017275368,0.0014780471,0.0011028354,0.0029705088],"category_scores_gemma":[0.013860455,0.00043254715,0.0010560041,0.0013764899,0.0014240023,0.0039773667,0.0016663333,0.0010212988,0.00082038343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009922911,0.00036823566,0.007895268,0.001416197,0.00031228084,0.0016493053,0.0021229326,0.06287746,0.060408678,0.4875824,0.008355695,0.36601937],"study_design_scores_gemma":[0.00010669781,0.00063544145,0.00342208,0.00014133194,0.000174762,0.0025800024,0.00059276645,0.21235481,0.036997806,0.7083342,0.03452136,0.00013877505],"about_ca_topic_score_codex":0.0007885773,"about_ca_topic_score_gemma":0.00092957576,"teacher_disagreement_score":0.0029705088,"about_ca_system_score_codex":0.0008900894,"about_ca_system_score_gemma":0.0011546451,"threshold_uncertainty_score":0.009937346},"labels":[],"label_agreement":null},{"id":"W1972659920","doi":"10.1142/s0129054103002059","title":"QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Turing machine; Quantum computer; Quantum Turing machine; Time hierarchy theorem; NSPACE; Polynomial; Bounded function; Super-recursive algorithm; Discrete mathematics; Computation; Quantum algorithm; Mathematics; Quantum; Computer science; Amplitude; Limit (mathematics); Algorithm; Universal Turing machine; Quantum error correction; Quantum mechanics; Mathematical analysis","score_opus":0.014772172591988519,"score_gpt":0.2881933680008781,"score_spread":0.27342119540888954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972659920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23523264,0.0022713563,0.6636759,0.0040043117,0.00050310727,0.00015141672,0.00015894115,0.0007454059,0.09325688],"genre_scores_gemma":[0.9520967,0.0008334836,0.043155264,0.00036649505,0.00024897765,0.00009994875,0.00006385286,0.000069167545,0.0030660236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815255,0.000703874,0.00009124425,0.00030242224,0.00051839324,0.00023137439],"domain_scores_gemma":[0.9962268,0.0021702722,0.00014122095,0.0010821018,0.00024136071,0.000138379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014324418,0.00041030705,0.00072962954,0.0005688353,0.0008068144,0.0017582136,0.00092158816,0.0010108622,0.004259292],"category_scores_gemma":[0.008316958,0.0002713491,0.000896747,0.00042418207,0.004950907,0.0072211353,0.0027416497,0.0021746268,0.0007386802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030500765,0.000013333033,0.00010200173,0.000043775988,0.00000748093,0.000047303438,0.00007858118,0.005903909,0.0015927015,0.98795915,0.00025844428,0.003962718],"study_design_scores_gemma":[0.000014493552,0.000025747058,0.000056557135,0.000014412465,0.000007746823,0.000055420343,0.000021280424,0.031183247,0.0011064325,0.96516,0.0023436584,0.000010959218],"about_ca_topic_score_codex":0.0004201114,"about_ca_topic_score_gemma":0.00023570395,"teacher_disagreement_score":0.004259292,"about_ca_system_score_codex":0.00051335327,"about_ca_system_score_gemma":0.000625041,"threshold_uncertainty_score":0.014248729},"labels":[],"label_agreement":null},{"id":"W1972680079","doi":"10.1142/s0129054107004930","title":"REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Deterministic context-free grammar; Computer science; Concatenation (mathematics); Time complexity; Embedded pushdown automaton; Stateless protocol; Context-free grammar; Reduction (mathematics); Theoretical computer science; Simple (philosophy); Regular expression; Automaton; Algorithm; Rule-based machine translation; Artificial intelligence; State (computer science); Mathematics; Tree-adjoining grammar; Programming language; Arithmetic","score_opus":0.012144565599661167,"score_gpt":0.30976415250553546,"score_spread":0.2976195869058743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972680079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26132545,0.0026739188,0.6745232,0.0057706516,0.0004208707,0.00070458045,0.002026065,0.025964392,0.026590884],"genre_scores_gemma":[0.5926849,0.00094527495,0.38960248,0.0009200949,0.00016726748,0.0005199598,0.0027213378,0.003401825,0.0090368865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883221,0.0033837375,0.000692481,0.0017980648,0.0047041085,0.0010995303],"domain_scores_gemma":[0.9522758,0.031319182,0.0012742546,0.012529532,0.002115806,0.0004854033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037982622,0.0012332204,0.0011548062,0.0011534118,0.0011446871,0.0038228398,0.0024025,0.0019295913,0.011355412],"category_scores_gemma":[0.032750286,0.00065436505,0.0014730849,0.002476068,0.0028706016,0.0074875336,0.0030724867,0.0027629975,0.0036207598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028116826,0.0010608578,0.0049023563,0.0021028416,0.00021069174,0.00063374056,0.0017209349,0.19495346,0.039897256,0.14177664,0.036730703,0.57319885],"study_design_scores_gemma":[0.0004658788,0.00029637697,0.0010702314,0.000112504225,0.0001459753,0.0006034459,0.00059179706,0.5541814,0.046133026,0.3765655,0.01975612,0.000077737895],"about_ca_topic_score_codex":0.0028548748,"about_ca_topic_score_gemma":0.004500813,"teacher_disagreement_score":0.011355412,"about_ca_system_score_codex":0.0025880334,"about_ca_system_score_gemma":0.0052984105,"threshold_uncertainty_score":0.03798759},"labels":[],"label_agreement":null},{"id":"W1973982376","doi":"10.1142/s0129054103002205","title":"EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Deterministic context-free grammar; Computer science; Theoretical computer science; Finite-state machine; Discrete mathematics; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Probabilistic automaton; Mathematics; Algorithm; Tree-adjoining grammar; Context-free grammar; Artificial intelligence","score_opus":0.018836019442561434,"score_gpt":0.310194326532439,"score_spread":0.2913583070898776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973982376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034307234,0.000157236,0.956253,0.00016190695,0.00007237868,0.00011790659,0.00019035122,0.004746158,0.0039938325],"genre_scores_gemma":[0.43107536,0.00022332014,0.5628228,0.0001608454,0.00003868541,0.00018886039,0.0009866619,0.00041246612,0.004090983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.00026796828,0.00013466211,0.0002659324,0.00032895536,0.00012803238],"domain_scores_gemma":[0.9962192,0.0023677796,0.00019437226,0.0006853979,0.00046840185,0.00006484078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710719,0.00034730192,0.0006760464,0.00046051134,0.00059257355,0.0017014957,0.0013305678,0.00066806504,0.0049662823],"category_scores_gemma":[0.005213489,0.00037731964,0.0010874014,0.0005845705,0.0010633948,0.0021742492,0.0009193556,0.0009954296,0.0013328957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006711261,0.0003156771,0.001993123,0.0005150828,0.00011716927,0.0008739422,0.0011540726,0.1488141,0.08282178,0.31673843,0.009413467,0.43657213],"study_design_scores_gemma":[0.000057069905,0.0001288376,0.00034695072,0.000030169585,0.00004489094,0.00026994842,0.00015831477,0.8025744,0.046969537,0.14128938,0.008078629,0.0000519614],"about_ca_topic_score_codex":0.0036042898,"about_ca_topic_score_gemma":0.0045440276,"teacher_disagreement_score":0.0049662823,"about_ca_system_score_codex":0.0008360513,"about_ca_system_score_gemma":0.0010005197,"threshold_uncertainty_score":0.0166139},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027416478122629866,"score_gpt":0.29959842707445417,"score_spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974278282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104323715,0.00057942193,0.89133173,0.00030742478,0.000033237233,0.00006725454,0.00021670524,0.00024005941,0.0029004714],"genre_scores_gemma":[0.83827114,0.0006830705,0.15771656,0.00006666753,0.00014653079,0.0002989215,0.0005643608,0.00021340855,0.0020392728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521697,0.0013518113,0.00026397052,0.0010931627,0.0016100355,0.00046411404],"domain_scores_gemma":[0.92054915,0.06949817,0.0031233395,0.0039573577,0.002168026,0.0007039974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004228685,0.0011440858,0.0013901475,0.002380206,0.00076715345,0.0027415128,0.0017800913,0.0012281114,0.004175529],"category_scores_gemma":[0.04042499,0.0006638106,0.0016207603,0.0019235545,0.0026521538,0.009001373,0.0026886784,0.0030834223,0.0003647837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006174012,0.00018924547,0.008623551,0.00047604763,0.00022292919,0.00024023328,0.00039684807,0.6326538,0.010075741,0.2585298,0.0010231904,0.08695128],"study_design_scores_gemma":[0.0000073468245,0.000050719733,0.0009642043,0.00001904504,0.000029758752,0.000051958676,0.000026119786,0.8957388,0.0028225249,0.099920385,0.000334048,0.000035112334],"about_ca_topic_score_codex":0.0019718832,"about_ca_topic_score_gemma":0.0011026022,"teacher_disagreement_score":0.004228685,"about_ca_system_score_codex":0.0019880107,"about_ca_system_score_gemma":0.0013532161,"threshold_uncertainty_score":0.022363663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","score_opus":0.016566795899129714,"score_gpt":0.2873662264388591,"score_spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975121090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26497567,0.0050235875,0.63067234,0.0065642074,0.00066447584,0.00014360296,0.0001809397,0.00044975049,0.091325454],"genre_scores_gemma":[0.8965641,0.0026801259,0.0889413,0.00044337552,0.00028774634,0.0002427642,0.00012232998,0.000080982274,0.010637242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999079,0.00036415536,0.000045842127,0.00017258088,0.00017843231,0.00015997833],"domain_scores_gemma":[0.99893934,0.0005999972,0.00008920543,0.00020331555,0.00008730969,0.00008090704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612884,0.00050708716,0.0008074878,0.0005290686,0.002117482,0.0026160853,0.0011725131,0.0016199079,0.0032985134],"category_scores_gemma":[0.0031472477,0.00032054173,0.0009597282,0.0007876224,0.0038345938,0.008022271,0.002725874,0.0014352568,0.00057990046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022467688,0.000008639395,0.00006280467,0.000045339257,0.0000066990174,0.000050160717,0.000074703334,0.018337062,0.0007761228,0.97755057,0.0003469138,0.0027185907],"study_design_scores_gemma":[0.000016818809,0.0000137883835,0.000041534156,0.000012929242,0.0000065313957,0.00005629264,0.000042899534,0.060030248,0.00071483955,0.93502337,0.0040295543,0.0000110700985],"about_ca_topic_score_codex":0.0010701494,"about_ca_topic_score_gemma":0.00076534227,"teacher_disagreement_score":0.0032985134,"about_ca_system_score_codex":0.0012508925,"about_ca_system_score_gemma":0.000815495,"threshold_uncertainty_score":0.0110346675},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02073960704499473,"score_gpt":0.2991157101043507,"score_spread":0.27837610305935595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975431188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916582,0.0002631194,0.09409056,0.0007204808,0.000022803282,0.00011314843,0.0012458151,0.0003862378,0.011499485],"genre_scores_gemma":[0.97246087,0.00011912997,0.022386229,0.00007002595,0.000045859713,0.00014443183,0.0008640567,0.000098822886,0.003810521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791175,0.0003547607,0.00019259955,0.00042842943,0.0007643191,0.0003481071],"domain_scores_gemma":[0.99009097,0.00711718,0.0008415249,0.0007074149,0.0007730439,0.00046976953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803242,0.00029528124,0.000600111,0.0010328778,0.000851435,0.002892194,0.0011643803,0.00063237373,0.0055399938],"category_scores_gemma":[0.008914998,0.00038305033,0.0011222856,0.00064457057,0.0019948587,0.005156347,0.0016361666,0.0010372013,0.00036649694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014066638,0.00022036389,0.017325033,0.0005849195,0.00014683699,0.0008136465,0.0034061759,0.08638927,0.04687717,0.79841363,0.003977078,0.040439196],"study_design_scores_gemma":[0.000056151104,0.00012601617,0.0039348616,0.000028224506,0.00006064617,0.0005051831,0.00034394753,0.24665508,0.012693333,0.7304646,0.0050734733,0.00005848951],"about_ca_topic_score_codex":0.0021550357,"about_ca_topic_score_gemma":0.0019121369,"teacher_disagreement_score":0.0055399938,"about_ca_system_score_codex":0.002235796,"about_ca_system_score_gemma":0.0011140232,"threshold_uncertainty_score":0.01853311},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02382651196834527,"score_gpt":0.33623674160293426,"score_spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976120600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9390916,0.0007694262,0.045842033,0.00082026934,0.000021680144,0.000022935796,0.0005413171,0.00012277227,0.012767868],"genre_scores_gemma":[0.9876752,0.00025627943,0.010203594,0.0000970467,0.00005454397,0.000028851295,0.00033559068,0.000059433092,0.0012894911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.000116007155,0.000022082153,0.00018776508,0.00011302984,0.00013736662],"domain_scores_gemma":[0.9944561,0.004009391,0.00051320344,0.00039408426,0.00023225552,0.00039504605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543725,0.00030259552,0.0003901796,0.001149104,0.00087346387,0.0017195841,0.00075390295,0.0004423125,0.002233714],"category_scores_gemma":[0.0056013423,0.00036444498,0.00039728318,0.0010249795,0.0019141866,0.003416607,0.00097218866,0.0009519958,0.0001659174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067725376,0.00012883611,0.0133740315,0.00022936046,0.000075014104,0.00028233672,0.0015502832,0.04251962,0.013951498,0.8888129,0.004676673,0.033722203],"study_design_scores_gemma":[0.000059848768,0.000086647604,0.0069585806,0.000053061107,0.000045324236,0.00039926183,0.0004893121,0.10472572,0.00497028,0.8750736,0.0070971223,0.000041234434],"about_ca_topic_score_codex":0.0016658392,"about_ca_topic_score_gemma":0.0014889714,"teacher_disagreement_score":0.002233714,"about_ca_system_score_codex":0.0011168651,"about_ca_system_score_gemma":0.00041203247,"threshold_uncertainty_score":0.00810349},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03640076233099542,"score_gpt":0.30195530541704296,"score_spread":0.26555454308604753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980577621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79326206,0.0016974149,0.16892196,0.002312523,0.00006894378,0.00010303283,0.00032350596,0.00018486525,0.033125777],"genre_scores_gemma":[0.9617866,0.0007426891,0.030912125,0.00016339301,0.0002109888,0.000136935,0.00038835697,0.000069232934,0.005589597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862254,0.00034618055,0.00012616861,0.00031972866,0.0004015906,0.00018387349],"domain_scores_gemma":[0.9851665,0.0121941315,0.0011031219,0.0006125353,0.00055508903,0.00036859364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316542,0.0004778468,0.0009281465,0.0013675563,0.0012938874,0.0036407611,0.0011870781,0.0014180737,0.004308236],"category_scores_gemma":[0.013283758,0.000660231,0.0008240293,0.001351218,0.0036059152,0.006949874,0.0018826687,0.0019640669,0.0004917739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017768741,0.00008867344,0.0019103934,0.00033304893,0.000024102319,0.0004597357,0.0016127812,0.026082031,0.0062848646,0.9439925,0.00081643736,0.018217798],"study_design_scores_gemma":[0.000035077486,0.00007488931,0.00062578206,0.000050449577,0.000018662873,0.00025586225,0.0002448566,0.034224745,0.0024454356,0.95961356,0.002380346,0.000030172892],"about_ca_topic_score_codex":0.00057794957,"about_ca_topic_score_gemma":0.0005203598,"teacher_disagreement_score":0.004308236,"about_ca_system_score_codex":0.0015610824,"about_ca_system_score_gemma":0.0005630857,"threshold_uncertainty_score":0.014412463},"labels":[],"label_agreement":null},{"id":"W1983758508","doi":"10.1142/s012905411450018x","title":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adjacency list; Combinatorics; Graph factorization; Computer science; Subgraph isomorphism problem; Vertex (graph theory); Mathematics; Adjacency matrix; Degeneracy (biology); Algorithm; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.02168548651430138,"score_gpt":0.27394579617006065,"score_spread":0.2522603096557593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983758508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032284003,0.00031543564,0.9613422,0.00019531789,0.000030939875,0.00023688162,0.0003391442,0.0012859835,0.003970113],"genre_scores_gemma":[0.121877596,0.00042092334,0.87259996,0.00014354997,0.00005034635,0.00028497452,0.0020208145,0.00021521593,0.002386544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992422,0.00019338066,0.000055271867,0.00016021519,0.00024343755,0.00010550345],"domain_scores_gemma":[0.9974348,0.00133111,0.00031737486,0.0004119312,0.00039617077,0.000108599554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794342,0.0012004765,0.00086388807,0.0022267236,0.0010120884,0.0008058528,0.0013997756,0.0009982588,0.0039308397],"category_scores_gemma":[0.0054809796,0.0005167629,0.00082615967,0.0037800756,0.0010187611,0.0031562827,0.002045464,0.00081940327,0.0013112251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003407538,0.00048463102,0.0031499518,0.0009681987,0.0001325202,0.0007061926,0.000688251,0.23824875,0.024877202,0.10025673,0.018602926,0.61154395],"study_design_scores_gemma":[0.000111495916,0.00026290087,0.0014363227,0.00010987228,0.000093281014,0.00102594,0.0003609406,0.71495813,0.017898936,0.25023833,0.013433939,0.0000698999],"about_ca_topic_score_codex":0.0026145156,"about_ca_topic_score_gemma":0.0038672597,"teacher_disagreement_score":0.0039308397,"about_ca_system_score_codex":0.00067596784,"about_ca_system_score_gemma":0.0010395631,"threshold_uncertainty_score":0.013149977},"labels":[],"label_agreement":null},{"id":"W1984147068","doi":"10.1142/s0129054103002163","title":"SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Computer science; Electronic circuit; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Programming language; Pure mathematics","score_opus":0.038866793631586294,"score_gpt":0.3409278260135017,"score_spread":0.3020610323819154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984147068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107624665,0.00006064288,0.8882801,0.00009323415,0.00003085039,0.000068607835,0.00009979554,0.0010959979,0.002646216],"genre_scores_gemma":[0.8990574,0.00010821723,0.098472536,0.000057576326,0.000020679005,0.00015637201,0.00015388193,0.00009416882,0.0018791372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988576,0.0002953176,0.000107006934,0.00023994065,0.0003587599,0.00014125575],"domain_scores_gemma":[0.9976921,0.0015194839,0.00023097474,0.00022713264,0.00022666891,0.000103679056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012642394,0.0005067144,0.000630738,0.0005714976,0.00054070354,0.0010847951,0.0010620716,0.00065284886,0.002193242],"category_scores_gemma":[0.00380912,0.00032688485,0.0013115067,0.00044549734,0.0017537101,0.0021738985,0.0009550087,0.0009043993,0.00022768982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039799087,0.00010056232,0.001338567,0.00010723543,0.000052063435,0.00021623359,0.00028038575,0.581968,0.018003227,0.3812331,0.0003623202,0.015940255],"study_design_scores_gemma":[0.000033846893,0.00006758357,0.00010235702,0.000009802945,0.000014986656,0.000029787052,0.000014942787,0.8954327,0.012369691,0.09114674,0.0007623246,0.000015124366],"about_ca_topic_score_codex":0.002032621,"about_ca_topic_score_gemma":0.0014808367,"teacher_disagreement_score":0.002193242,"about_ca_system_score_codex":0.0012083391,"about_ca_system_score_gemma":0.0009793241,"threshold_uncertainty_score":0.008767128},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02369577806896057,"score_gpt":0.28019506612564216,"score_spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988560957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5543284,0.002273705,0.38908973,0.0031170547,0.00020618945,0.00014416709,0.0005429266,0.0013953078,0.04890245],"genre_scores_gemma":[0.9194372,0.0008728427,0.07064664,0.00018830375,0.00013883747,0.00017246467,0.00030196153,0.00032787008,0.007913838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779093,0.00036117242,0.00013050855,0.00028136373,0.0008775665,0.00055849075],"domain_scores_gemma":[0.98528254,0.010559061,0.0007553835,0.0023511788,0.00063566363,0.00041620413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931417,0.000906055,0.0012002136,0.0015653841,0.0012285478,0.00352002,0.002052621,0.0011887964,0.007256537],"category_scores_gemma":[0.009501645,0.0004306402,0.0010288708,0.0018584622,0.0043240087,0.011999156,0.0022717998,0.0023510007,0.0009400007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004055391,0.00010985049,0.0016879021,0.00018793481,0.000022452978,0.000114650764,0.00027042025,0.04996889,0.0048237657,0.89651906,0.0023728488,0.043516662],"study_design_scores_gemma":[0.000037157784,0.0001253168,0.0006677863,0.000034610297,0.00004584376,0.00014185933,0.00009682226,0.16563907,0.010769357,0.8179304,0.004459183,0.000052667307],"about_ca_topic_score_codex":0.0011222226,"about_ca_topic_score_gemma":0.0013248437,"teacher_disagreement_score":0.007256537,"about_ca_system_score_codex":0.0029420909,"about_ca_system_score_gemma":0.0016263678,"threshold_uncertainty_score":0.024275541},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0312662277924988,"score_gpt":0.3391405770950674,"score_spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992434757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32300088,0.0004981269,0.66996473,0.0004971035,0.000031026375,0.00016630338,0.00083582604,0.0011333976,0.0038726311],"genre_scores_gemma":[0.59461516,0.0004285689,0.39923066,0.00016312671,0.00006766197,0.00015821688,0.0026448462,0.00034721202,0.0023445163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991053,0.00018317286,0.00008059832,0.00028860342,0.00024658407,0.000095764095],"domain_scores_gemma":[0.9926467,0.003962079,0.0009970465,0.0013027396,0.0007238968,0.00036757585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305949,0.0003577421,0.0008479709,0.0011523882,0.0008354839,0.0012700931,0.00078998675,0.00069870404,0.001310891],"category_scores_gemma":[0.007514371,0.0004901502,0.00071312697,0.0013359848,0.0011696239,0.0031399482,0.0021158515,0.0007259194,0.00040156543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007899396,0.0002321083,0.014557302,0.0012244226,0.00010469237,0.0014794569,0.0041509415,0.06888961,0.09739385,0.30595836,0.015091597,0.49012774],"study_design_scores_gemma":[0.000052299598,0.0002602719,0.004738577,0.000088902016,0.00007220049,0.0019410516,0.0011437023,0.20435427,0.03479042,0.73402226,0.018485848,0.000050244304],"about_ca_topic_score_codex":0.00089689356,"about_ca_topic_score_gemma":0.0014713067,"teacher_disagreement_score":0.001310891,"about_ca_system_score_codex":0.0005374326,"about_ca_system_score_gemma":0.0008707838,"threshold_uncertainty_score":0.004921496},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.019626468324232184,"score_gpt":0.3115234385093699,"score_spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993598446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009152484,0.00011511712,0.98578787,0.00009878543,0.000030021503,0.00017218465,0.00012649268,0.0028013105,0.0017157833],"genre_scores_gemma":[0.10901529,0.000112002235,0.88750935,0.00007677544,0.000027662176,0.000384911,0.0008226099,0.00024749828,0.0018039099],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991192,0.00015093485,0.00007543315,0.00021954253,0.00032223886,0.00011263691],"domain_scores_gemma":[0.99886084,0.0006272778,0.0000636001,0.00023252262,0.0001761461,0.000039645893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039121,0.0007939643,0.00080632104,0.00092098204,0.0008553406,0.0008279829,0.001200887,0.0010837271,0.0043977136],"category_scores_gemma":[0.002467923,0.0006007711,0.0015228543,0.00073750905,0.00073042157,0.0019402067,0.001491876,0.0011450126,0.0013772643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004886574,0.00030108893,0.001525446,0.0007791431,0.00014111534,0.0006654818,0.0009257435,0.05304085,0.07415262,0.15796883,0.013213188,0.69679785],"study_design_scores_gemma":[0.0002078506,0.00030228012,0.00056268857,0.00008051448,0.00015471502,0.0011854501,0.00018816817,0.6407879,0.058792572,0.2577483,0.03989161,0.00009789594],"about_ca_topic_score_codex":0.0009056765,"about_ca_topic_score_gemma":0.0012538353,"teacher_disagreement_score":0.0043977136,"about_ca_system_score_codex":0.0007086364,"about_ca_system_score_gemma":0.0010998369,"threshold_uncertainty_score":0.014711857},"labels":[],"label_agreement":null},{"id":"W1993821074","doi":"10.1142/s0129054107004826","title":"OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Torus; Computer science; Enhanced Data Rates for GSM Evolution; Security token; Compass; Computation; Property (philosophy); Sense (electronics); Orientation (vector space); Task (project management); Mathematics; Algorithm; Artificial intelligence; Geometry; Computer network","score_opus":0.012770053744457445,"score_gpt":0.3117274546573193,"score_spread":0.2989574009128619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993821074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12807094,0.00011470108,0.86483234,0.0002846706,0.00008331935,0.00009011736,0.00006585573,0.0006269664,0.005831083],"genre_scores_gemma":[0.4988293,0.0002014233,0.49626082,0.000060795483,0.00002940183,0.00016175328,0.00017861479,0.0001445464,0.0041334406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936634,0.0002206273,0.000039961244,0.00013695743,0.000093694995,0.00014253751],"domain_scores_gemma":[0.99855024,0.00044716327,0.0002234351,0.00039978774,0.0001729694,0.00020634574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954121,0.0005085529,0.0007542702,0.0004058221,0.0009374745,0.0012180436,0.000925466,0.00066781294,0.0018072132],"category_scores_gemma":[0.0032032733,0.00043546074,0.00053891685,0.0005874122,0.0014399044,0.0025296176,0.002420999,0.000906818,0.00056319364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001153622,0.00019036264,0.0030704138,0.000338579,0.00006204702,0.0006005696,0.001004238,0.33886346,0.03683522,0.43269813,0.0067715584,0.17841181],"study_design_scores_gemma":[0.00015441526,0.00044131113,0.0008018859,0.000049288,0.000059275473,0.0003322997,0.0009743104,0.73369056,0.021211792,0.21818875,0.023999592,0.0000964968],"about_ca_topic_score_codex":0.0010153706,"about_ca_topic_score_gemma":0.0013092029,"teacher_disagreement_score":0.0018072132,"about_ca_system_score_codex":0.0006877961,"about_ca_system_score_gemma":0.0010593069,"threshold_uncertainty_score":0.0060457587},"labels":[],"label_agreement":null},{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994122595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70964694,0.00069176685,0.2780497,0.0004798714,0.000062235835,0.00025402862,0.0008341997,0.0011916403,0.0087896185],"genre_scores_gemma":[0.7345933,0.00029095728,0.2591752,0.00010468331,0.000046925175,0.00049777946,0.0017051019,0.00025423773,0.0033317707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681324,0.000681677,0.0004129032,0.000577409,0.0010902865,0.00042444828],"domain_scores_gemma":[0.9836263,0.011398967,0.0011728731,0.0017801403,0.0014719082,0.00054979266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018522419,0.0005531352,0.0009718668,0.0015917275,0.0016130797,0.001396129,0.0018825971,0.0012524639,0.0038569225],"category_scores_gemma":[0.01648417,0.00052606297,0.00126444,0.0015468282,0.0011764326,0.0038480875,0.0016259389,0.00069765205,0.0005452465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027124302,0.00068840495,0.06066976,0.0023126057,0.00051147206,0.0015740932,0.0014529327,0.21932179,0.1395146,0.14375564,0.006098439,0.42138788],"study_design_scores_gemma":[0.00012045482,0.0006287336,0.010815355,0.00018619224,0.0005764631,0.002694991,0.000514516,0.5923606,0.17852198,0.19762306,0.015797867,0.00015970628],"about_ca_topic_score_codex":0.0008024979,"about_ca_topic_score_gemma":0.0016140145,"teacher_disagreement_score":0.0038569225,"about_ca_system_score_codex":0.0011829789,"about_ca_system_score_gemma":0.0012584045,"threshold_uncertainty_score":0.012902677},"labels":[],"label_agreement":null},{"id":"W1994343490","doi":"10.1142/s0129054111008945","title":"SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Schema (genetic algorithms); Computer science; Tuple; Inverse; Regular language; Theoretical computer science; Mathematics; Algorithm; Programming language; Discrete mathematics; Automaton","score_opus":0.0348316647130958,"score_gpt":0.2930144194345859,"score_spread":0.2581827547214901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994343490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008428863,0.0005288794,0.9784864,0.0009959632,0.00020225788,0.00024348752,0.00026540444,0.00086010806,0.009988687],"genre_scores_gemma":[0.09984468,0.00086066604,0.88775086,0.00056928693,0.00012842922,0.0003192769,0.0008614338,0.000517291,0.009148123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952988,0.001168812,0.00053430477,0.0013646369,0.0012680179,0.0003655496],"domain_scores_gemma":[0.99539447,0.0013621856,0.00034150324,0.0017592655,0.00096134393,0.00018125772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003991977,0.0008620979,0.0010831708,0.001475579,0.0019458585,0.0046159783,0.0039363233,0.002179631,0.008531587],"category_scores_gemma":[0.008255638,0.0010354439,0.0030149794,0.0026357912,0.0047445623,0.0144769335,0.004259076,0.0044472925,0.0027688502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007155366,0.00005342751,0.0005863212,0.00020851927,0.000021117701,0.00029156287,0.0006700567,0.0039660963,0.0036345103,0.9390764,0.0026941318,0.04872642],"study_design_scores_gemma":[0.00006282044,0.000107571504,0.00026097838,0.00015014954,0.000074619755,0.0018259288,0.0005770822,0.05710298,0.016004093,0.83187556,0.09187748,0.00008070059],"about_ca_topic_score_codex":0.0027811907,"about_ca_topic_score_gemma":0.0017931175,"teacher_disagreement_score":0.008531587,"about_ca_system_score_codex":0.0018327641,"about_ca_system_score_gemma":0.0039358856,"threshold_uncertainty_score":0.028541028},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02362928073566646,"score_gpt":0.2931312758776484,"score_spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994383533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7149848,0.0011594726,0.25955474,0.0020410377,0.00006530368,0.000118230164,0.00083797576,0.00045791865,0.020780543],"genre_scores_gemma":[0.9715837,0.00038634523,0.023910347,0.00009530913,0.00008877046,0.00011268459,0.00047340928,0.000071898794,0.003277605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666214,0.0007230427,0.0003015255,0.0007278666,0.0011004527,0.0004850554],"domain_scores_gemma":[0.9751559,0.019541718,0.0014618034,0.002127021,0.0010104399,0.00070310076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018621294,0.00039744965,0.0007355476,0.0018797125,0.0013904725,0.005117709,0.0010222986,0.0011092463,0.0058767768],"category_scores_gemma":[0.01177458,0.00041062204,0.0012301046,0.0015391558,0.0033000894,0.010777875,0.0024318772,0.002433428,0.0004580493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039851404,0.00011559976,0.0041172025,0.00022036704,0.000052297848,0.00018724044,0.0012428405,0.030647418,0.007334491,0.93182486,0.0007990925,0.023060003],"study_design_scores_gemma":[0.000035814992,0.00012520766,0.0021275308,0.00003135871,0.00005059575,0.00018974737,0.0002205466,0.09965368,0.0076708174,0.88660485,0.003231109,0.000058768106],"about_ca_topic_score_codex":0.0016763732,"about_ca_topic_score_gemma":0.0012783483,"teacher_disagreement_score":0.0058767768,"about_ca_system_score_codex":0.0027453902,"about_ca_system_score_gemma":0.0013040527,"threshold_uncertainty_score":0.019919276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018182904026323252,"score_gpt":0.28407451216717167,"score_spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996179839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8628781,0.00030044673,0.106562205,0.00020968544,0.00007409925,0.000039089773,0.00014263783,0.0001204043,0.029673453],"genre_scores_gemma":[0.9767734,0.00025734594,0.017982772,0.000038635204,0.000047591682,0.000039034592,0.00012334483,0.000048569702,0.004689301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997868,0.000028185703,0.000012246412,0.000057368907,0.00007429195,0.000041142044],"domain_scores_gemma":[0.99886096,0.00046807024,0.00021733809,0.00010687594,0.00012999949,0.00021678767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422132,0.00028135246,0.000314378,0.0013702046,0.00096449704,0.0019778467,0.00055228046,0.00053559645,0.0044631227],"category_scores_gemma":[0.002619584,0.00022644021,0.00034825466,0.00088324194,0.0018989507,0.0030579853,0.0008762443,0.0008751633,0.00037466933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061030274,0.000023447283,0.0015611472,0.00004071709,0.0000056632684,0.0003020286,0.00033491445,0.002797088,0.0044695316,0.9779007,0.0002918926,0.01221193],"study_design_scores_gemma":[0.000035245892,0.00009889924,0.0014974091,0.000034227654,0.000008865461,0.00079310784,0.00023352446,0.027541425,0.004242914,0.96019036,0.005300715,0.000023310937],"about_ca_topic_score_codex":0.00031636693,"about_ca_topic_score_gemma":0.00019181572,"teacher_disagreement_score":0.0044631227,"about_ca_system_score_codex":0.00054393295,"about_ca_system_score_gemma":0.00022018336,"threshold_uncertainty_score":0.0149306655},"labels":[],"label_agreement":null},{"id":"W1998843387","doi":"10.1142/s0129054108006157","title":"COMPUTATION BY ANNOTATION: MODELLING EPIGENETIC REGULATION","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Genomics and Chromatin Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Modulo; Annotation; Substring; Set (abstract data type); Epigenetics; Theoretical computer science; Computation; Artificial intelligence; Programming language; Biology; Gene; Mathematics; Genetics; Discrete mathematics","score_opus":0.014117441606460578,"score_gpt":0.26748335123122624,"score_spread":0.2533659096247657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998843387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032474242,0.00026041083,0.95552266,0.0009135502,0.000057253732,0.000050618648,0.00012098846,0.0003937839,0.010206431],"genre_scores_gemma":[0.68129545,0.00050897844,0.30699643,0.00028833048,0.000083802835,0.00029200118,0.0002824316,0.0002715639,0.009981084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.0003699126,0.00004750021,0.00015956977,0.00019074649,0.00009559648],"domain_scores_gemma":[0.9979942,0.001324287,0.00015067737,0.00029781417,0.00014605612,0.00008691436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013142921,0.00045102896,0.0004720933,0.00055637624,0.0007372301,0.0018326079,0.0015665359,0.0012770924,0.0030580247],"category_scores_gemma":[0.0042015696,0.00034321117,0.0011147865,0.0007810839,0.0039803036,0.0034888778,0.0016778678,0.0014650946,0.0005241413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038705482,0.000022314087,0.00043708598,0.000052645828,0.000009901532,0.00011594819,0.0003211839,0.101915024,0.002426215,0.8869751,0.00040524176,0.007280571],"study_design_scores_gemma":[0.000027522141,0.00002204265,0.000087799555,0.000015273943,0.000012999893,0.000063023384,0.00004025522,0.37842068,0.0022426625,0.6125594,0.0064889104,0.000019446561],"about_ca_topic_score_codex":0.0025560218,"about_ca_topic_score_gemma":0.0022245315,"teacher_disagreement_score":0.0030580247,"about_ca_system_score_codex":0.0011059842,"about_ca_system_score_gemma":0.0011904592,"threshold_uncertainty_score":0.010230064},"labels":[],"label_agreement":null},{"id":"W1999219034","doi":"10.1142/s0129054110007118","title":"APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Polynomial-time approximation scheme; Approximation algorithm; Job shop scheduling; Time complexity; Mathematics; Algorithm","score_opus":0.01225638514331587,"score_gpt":0.2719652398540387,"score_spread":0.2597088547107228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999219034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046891183,0.0009739573,0.9460057,0.0004957797,0.00016214812,0.000121025725,0.00021495194,0.0009879334,0.004147345],"genre_scores_gemma":[0.47202983,0.0010882133,0.5198931,0.00036620177,0.00024237281,0.00027012223,0.0010410282,0.00043353287,0.004635635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976858,0.00059252867,0.00016142412,0.00037785427,0.0007018948,0.00048047048],"domain_scores_gemma":[0.99339867,0.003826599,0.0005068186,0.001518487,0.00042297877,0.00032641625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003194839,0.0011624536,0.0014259361,0.00090316014,0.0010960903,0.0020728833,0.00258866,0.0014374432,0.0042506657],"category_scores_gemma":[0.0126657905,0.0007588172,0.0011308241,0.0024611438,0.0011643809,0.004061746,0.0020449823,0.0024154086,0.00095002865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013822163,0.0002546727,0.001143551,0.0003078852,0.0000885245,0.0001378021,0.000411303,0.7809461,0.006770462,0.084794715,0.008829021,0.11493375],"study_design_scores_gemma":[0.000082426115,0.00007915073,0.00015395966,0.000017552027,0.000023143148,0.000054480806,0.00003752755,0.94586873,0.0014376021,0.0500701,0.0021611953,0.00001416216],"about_ca_topic_score_codex":0.0052295583,"about_ca_topic_score_gemma":0.0041453876,"teacher_disagreement_score":0.0052295583,"about_ca_system_score_codex":0.002560654,"about_ca_system_score_gemma":0.0024056048,"threshold_uncertainty_score":0.018579006},"labels":[],"label_agreement":null},{"id":"W1999567003","doi":"10.1142/s0129054103001790","title":"Interconnection Networks and Their Eigenvalues","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Interconnection; Hypercube; Eigenvalues and eigenvectors; Computer science; Graph; Line graph; Graph theory; Spectral graph theory; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics; Voltage graph; Physics; Computer network","score_opus":0.015123795068053699,"score_gpt":0.26573969360016186,"score_spread":0.25061589853210814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999567003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2932543,0.012168819,0.5330763,0.0034182386,0.0006760887,0.000099682584,0.00058727333,0.00075988745,0.15595943],"genre_scores_gemma":[0.9370481,0.0043710466,0.046617072,0.00025654686,0.00047956358,0.00015805877,0.00018216931,0.00013063516,0.010756939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996517,0.00006536347,0.000016361608,0.000080099504,0.00013748997,0.000049006077],"domain_scores_gemma":[0.99905246,0.00046609915,0.0001711551,0.0000739936,0.0001681433,0.00006807534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034930086,0.00050096196,0.00031097495,0.0018683838,0.0008014075,0.0015680328,0.00038490235,0.00082006765,0.005781466],"category_scores_gemma":[0.0029736639,0.0003044693,0.00025556915,0.0009974355,0.001448163,0.0026412057,0.00083333673,0.0008652775,0.0007270859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002017983,0.000016282327,0.00041105482,0.00007441654,0.000010033307,0.00007918005,0.0001941702,0.0118234465,0.0033776576,0.96304387,0.0017986011,0.01915101],"study_design_scores_gemma":[0.000005753312,0.000015855227,0.0006121275,0.000027406975,0.0000038446715,0.00014918909,0.00010693723,0.029726518,0.00067757105,0.96176594,0.006894938,0.000013977797],"about_ca_topic_score_codex":0.00037805142,"about_ca_topic_score_gemma":0.00020374493,"teacher_disagreement_score":0.005781466,"about_ca_system_score_codex":0.00049896515,"about_ca_system_score_gemma":0.00022056661,"threshold_uncertainty_score":0.019340932},"labels":[],"label_agreement":null},{"id":"W2001273190","doi":"10.1142/s0129054112400461","title":"STATE COMPLEXITY AND APPROXIMATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computational complexity theory; Computer science; Theoretical computer science; Quantum complexity theory; Mathematics; Algorithm; Quantum computer","score_opus":0.0314267423021446,"score_gpt":0.3057200336348058,"score_spread":0.2742932913326612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001273190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031670846,0.0051270747,0.89461625,0.00887022,0.00048492683,0.00012030777,0.00034942394,0.00067387376,0.058087118],"genre_scores_gemma":[0.71068984,0.007099994,0.25723925,0.001539963,0.0012060526,0.00041877266,0.0009793773,0.00048460596,0.020342067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935323,0.0017415435,0.00044369543,0.0011659812,0.002230863,0.0008856057],"domain_scores_gemma":[0.9714982,0.020635165,0.0011354503,0.0046592494,0.0015656232,0.00050628034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044674575,0.0010620266,0.0016997181,0.0018555236,0.0015432246,0.005691355,0.002944446,0.001969339,0.010598653],"category_scores_gemma":[0.026524935,0.00061688165,0.0029405707,0.0029264744,0.0056410334,0.017192945,0.004891564,0.007311034,0.00122414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037571466,0.00002511864,0.0004364412,0.000107728105,0.00001880006,0.00003213946,0.00014260798,0.011610646,0.00027515396,0.9715863,0.0014211618,0.0143064195],"study_design_scores_gemma":[0.0000068825348,0.000019374582,0.00014229133,0.000037032853,0.000013502261,0.000050610422,0.000049506354,0.030753301,0.00045747988,0.96364313,0.0048157917,0.000011041622],"about_ca_topic_score_codex":0.0023879886,"about_ca_topic_score_gemma":0.0014815652,"teacher_disagreement_score":0.010598653,"about_ca_system_score_codex":0.004402008,"about_ca_system_score_gemma":0.0016562792,"threshold_uncertainty_score":0.03545606},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.027334795925260096,"score_gpt":0.2993553875880289,"score_spread":0.27202059166276876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001444496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012103009,0.0017268774,0.9791965,0.0005481791,0.0001407757,0.00007571248,0.00013478081,0.00073396735,0.0053401617],"genre_scores_gemma":[0.4186392,0.002550504,0.56922364,0.00040855625,0.00031377177,0.00040725849,0.00096480956,0.00042223858,0.0070701074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790883,0.0007487927,0.0001032378,0.00026451796,0.00059177517,0.00038277576],"domain_scores_gemma":[0.9950984,0.0033173847,0.00035716678,0.0005954784,0.00039359037,0.00023798451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028617773,0.001592089,0.0018071437,0.0011773597,0.0010052875,0.0023546293,0.0028179246,0.0017716889,0.004120077],"category_scores_gemma":[0.011736036,0.00074169604,0.0014213665,0.002328497,0.001224649,0.002934444,0.0019979437,0.0029512306,0.001012986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001989417,0.00012130448,0.00044930264,0.00018012764,0.00006143573,0.00007579408,0.000120484394,0.8462582,0.0006598526,0.08692036,0.0059623946,0.058991794],"study_design_scores_gemma":[0.000032168587,0.000022813076,0.000054562715,0.000014589037,0.000008667956,0.00002624262,0.000023324292,0.9498129,0.00013225822,0.048538417,0.0013283168,0.0000057509665],"about_ca_topic_score_codex":0.0044572153,"about_ca_topic_score_gemma":0.004005881,"teacher_disagreement_score":0.0044572153,"about_ca_system_score_codex":0.0023373298,"about_ca_system_score_gemma":0.0017114548,"threshold_uncertainty_score":0.016958654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010574547236751025,"score_gpt":0.28722827318768845,"score_spread":0.2766537259509374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001923775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036567718,0.0011408116,0.9508692,0.00030566132,0.00022974882,0.00030173312,0.0013256092,0.004010192,0.00524927],"genre_scores_gemma":[0.17424037,0.00046267247,0.8152066,0.00033345347,0.0001911546,0.00029616756,0.0027296909,0.00025790703,0.006281927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994099,0.00006233055,0.00008030115,0.00010069274,0.00029544652,0.00005129177],"domain_scores_gemma":[0.9981407,0.00030287702,0.00020889155,0.0007563484,0.00047235747,0.00011880939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046286779,0.0005383075,0.00083800056,0.0017816613,0.0005801533,0.0010511201,0.0017642573,0.00074597815,0.004575191],"category_scores_gemma":[0.002938642,0.00033538768,0.00040524334,0.0025804145,0.00052872347,0.003227794,0.0014894982,0.00057603937,0.002659181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095109275,0.0003383084,0.0027373713,0.000731593,0.00007161537,0.00032962856,0.00021148751,0.025822679,0.12805294,0.042504236,0.019437809,0.77881134],"study_design_scores_gemma":[0.00041842804,0.0018827504,0.0028211027,0.00018668886,0.00018169273,0.0025500276,0.00017716757,0.60186744,0.25076306,0.0476859,0.09123279,0.00023303302],"about_ca_topic_score_codex":0.00070775836,"about_ca_topic_score_gemma":0.0011762364,"teacher_disagreement_score":0.004575191,"about_ca_system_score_codex":0.00057397375,"about_ca_system_score_gemma":0.0011283917,"threshold_uncertainty_score":0.015305519},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; String (physics); Combinatorics; Mathematics; Sequence (biology); Function (biology); Discrete mathematics; Mathematical analysis; Mathematical physics","score_opus":0.026011521341616408,"score_gpt":0.32900960936328133,"score_spread":0.30299808802166495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003022262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07282528,0.007512227,0.8548208,0.0048231133,0.0005932392,0.00014123748,0.00084384263,0.0033247648,0.055115514],"genre_scores_gemma":[0.64667535,0.005619146,0.3095509,0.0032000293,0.0022162416,0.0011603164,0.0022912628,0.0027256662,0.026561016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994495,0.0011835687,0.00029480632,0.001208449,0.0017772969,0.0010408127],"domain_scores_gemma":[0.95358187,0.035007507,0.0015230442,0.005095503,0.0030546947,0.0017373932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066730264,0.0022793326,0.0023558976,0.00340741,0.0019123099,0.00347441,0.0044048554,0.002882236,0.013001239],"category_scores_gemma":[0.04451863,0.0009149052,0.0017500435,0.0027063296,0.0043272246,0.012256638,0.00454299,0.006902838,0.0040853606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017408116,0.0004216231,0.0056161196,0.0012182775,0.00016340388,0.00058093143,0.0006165107,0.08621162,0.036042787,0.68531424,0.022726642,0.15934704],"study_design_scores_gemma":[0.000060949213,0.00037733084,0.0021651143,0.00042994675,0.00019014788,0.0016802406,0.00015370092,0.3551569,0.023679402,0.5932949,0.022666618,0.00014474105],"about_ca_topic_score_codex":0.0006689685,"about_ca_topic_score_gemma":0.0008828785,"teacher_disagreement_score":0.013001239,"about_ca_system_score_codex":0.0036527,"about_ca_system_score_gemma":0.0024562855,"threshold_uncertainty_score":0.04349345},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0428232199411026,"score_gpt":0.3180081989553516,"score_spread":0.275184979014249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010556217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08829249,0.00038446134,0.89691603,0.00025725475,0.00012814516,0.000091420996,0.00016059398,0.0028433474,0.010926292],"genre_scores_gemma":[0.50719607,0.00021328776,0.48579198,0.00015441666,0.000055833396,0.00023768873,0.0005789775,0.00033454364,0.0054371753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933475,0.00012949282,0.00005738849,0.00010115918,0.0002624042,0.000114673305],"domain_scores_gemma":[0.9989793,0.00028802783,0.00006517949,0.00032460678,0.00028038525,0.000062576546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062490074,0.00069193967,0.00066250324,0.00042067404,0.0006065152,0.00074661715,0.0011771607,0.00031990066,0.0059261853],"category_scores_gemma":[0.0025274951,0.00030532564,0.00039575947,0.0010069655,0.00053163787,0.0022223082,0.0015858202,0.0008258334,0.0014228548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014507292,0.00032687493,0.0028186997,0.00068222487,0.00007382426,0.00066457555,0.0004989698,0.15318115,0.10222573,0.15707798,0.02084431,0.56015503],"study_design_scores_gemma":[0.000147849,0.0002994595,0.00052630005,0.0000506894,0.000028144532,0.00022217719,0.00010837991,0.848828,0.056199837,0.077212036,0.016346952,0.000030199371],"about_ca_topic_score_codex":0.0010764115,"about_ca_topic_score_gemma":0.0028151136,"teacher_disagreement_score":0.0059261853,"about_ca_system_score_codex":0.0004389562,"about_ca_system_score_gemma":0.0009135911,"threshold_uncertainty_score":0.0198251},"labels":[],"label_agreement":null},{"id":"W2011276709","doi":"10.1142/s0129054114400152","title":"DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Axiom; Mathematics; Descriptive complexity theory; Complexity class; Quantum complexity theory; Discrete mathematics; Theoretical computer science; Computer science; Time complexity; Quantum; Quantum information","score_opus":0.07310804458958418,"score_gpt":0.33139587111233093,"score_spread":0.25828782652274673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011276709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104417466,0.0010321862,0.8695471,0.002094779,0.00009657787,0.00009144149,0.00078539643,0.00035906857,0.021575963],"genre_scores_gemma":[0.87582886,0.00094259786,0.11358826,0.0005418439,0.00023496828,0.00033897895,0.0010639892,0.000156799,0.0073036975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943218,0.0014913331,0.0005095956,0.0009795828,0.0020469872,0.0006507455],"domain_scores_gemma":[0.9847007,0.009560692,0.0010805876,0.0024336025,0.0017167774,0.0005076837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029723055,0.00072514947,0.0009850763,0.0026073114,0.0016544824,0.006085152,0.0016632511,0.001698491,0.0037931437],"category_scores_gemma":[0.015708383,0.0005323328,0.0021597955,0.002625768,0.0065338397,0.014654473,0.0042539244,0.004437336,0.00047733053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014243801,0.000008404549,0.00019280014,0.000031129486,0.000007407325,0.000036256384,0.00013743386,0.004566379,0.00030794513,0.99125004,0.00020859277,0.0032394344],"study_design_scores_gemma":[0.0000040617983,0.000013162738,0.00011215151,0.0000134989605,0.000008113078,0.00004754444,0.000046902554,0.024644755,0.00066958315,0.97267085,0.0017537752,0.000015510424],"about_ca_topic_score_codex":0.0015651262,"about_ca_topic_score_gemma":0.0007359781,"teacher_disagreement_score":0.006085152,"about_ca_system_score_codex":0.0043604462,"about_ca_system_score_gemma":0.0016021874,"threshold_uncertainty_score":0.03163743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.051765157949220264,"score_gpt":0.317240406160664,"score_spread":0.26547524821144375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011421072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23190093,0.00022281977,0.7638613,0.00025469542,0.000048524897,0.00011947653,0.000033102595,0.0003814366,0.0031776868],"genre_scores_gemma":[0.7704179,0.00017889959,0.22611454,0.00004146021,0.000017198214,0.00009492418,0.00005075734,0.00004293459,0.0030413943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.0002094151,0.000039781546,0.00014907563,0.0001053389,0.00014915569],"domain_scores_gemma":[0.99756145,0.0010241432,0.00048126813,0.00044619336,0.00019222702,0.00029472125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012645129,0.0007064898,0.00092553,0.0005491331,0.0011950874,0.0012333386,0.0019026924,0.0010768115,0.002019456],"category_scores_gemma":[0.0044940705,0.00045314466,0.00059666054,0.0005224083,0.0014848433,0.0032385604,0.003256315,0.00064402615,0.0005558528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012714098,0.00027262032,0.0050108302,0.0002570747,0.00015858625,0.0013588133,0.0008686275,0.7516583,0.033499096,0.12999825,0.0016982275,0.07394825],"study_design_scores_gemma":[0.000109358305,0.00027239963,0.00023000385,0.00002074388,0.000049722046,0.00021355604,0.00026664583,0.96541893,0.0102460915,0.020685019,0.0024604094,0.00002709623],"about_ca_topic_score_codex":0.0015941801,"about_ca_topic_score_gemma":0.0017766232,"teacher_disagreement_score":0.002019456,"about_ca_system_score_codex":0.00056916475,"about_ca_system_score_gemma":0.00097618153,"threshold_uncertainty_score":0.0067557693},"labels":[],"label_agreement":null},{"id":"W2017338196","doi":"10.1142/s0129054111007964","title":"ORTHOGONAL SHUFFLE ON TRAJECTORIES","year":2011,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Corollary; Catenation; Set (abstract data type); Orthogonal array; Computer science; Literal (mathematical logic); Trajectory; Combinatorics; Mathematics; Arithmetic; Algorithm; Geometry; Programming language","score_opus":0.03615053148239461,"score_gpt":0.30310088824732984,"score_spread":0.2669503567649352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017338196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33698362,0.00044974746,0.6100947,0.00076467893,0.0002728093,0.00018783529,0.0006696959,0.00045370474,0.050123185],"genre_scores_gemma":[0.8524499,0.0006893714,0.108156025,0.0004396197,0.00021719895,0.00028138232,0.0009503168,0.00034546875,0.03647071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985869,0.00027771422,0.00016507554,0.00034780387,0.00031789148,0.00030472619],"domain_scores_gemma":[0.9980233,0.0006513491,0.0003274602,0.00029706827,0.000528652,0.00017236153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747572,0.00038482822,0.00041977974,0.0011651363,0.0013025637,0.0017648326,0.00060775725,0.0007426196,0.005877774],"category_scores_gemma":[0.0036251352,0.00029738375,0.0012058676,0.0008793008,0.0024278979,0.0060539255,0.0020179679,0.0012713076,0.001056642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044363132,0.000012192383,0.00028458942,0.00003376643,0.0000060653088,0.00015121856,0.000294405,0.0020913354,0.0030943388,0.98666024,0.000391137,0.006936313],"study_design_scores_gemma":[0.000021093912,0.00009639899,0.00029787765,0.000026673037,0.000012859573,0.0003474092,0.00030632058,0.018869808,0.010826523,0.9565475,0.012600839,0.000046606565],"about_ca_topic_score_codex":0.0013741239,"about_ca_topic_score_gemma":0.0009732604,"teacher_disagreement_score":0.005877774,"about_ca_system_score_codex":0.0009528533,"about_ca_system_score_gemma":0.0010782608,"threshold_uncertainty_score":0.019663095},"labels":[],"label_agreement":null},{"id":"W2017404547","doi":"10.1142/s0129054108006200","title":"WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID","year":2008,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Watson; Alphabet; Monoid; Prefix; Suffix; Combinatorics; Mathematics; Word (group theory); DNA; Discrete mathematics; Computer science; Base pair; Linguistics; Biology; Genetics; Philosophy; Natural language processing","score_opus":0.018994772658084556,"score_gpt":0.2844391777177993,"score_spread":0.2654444050597147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017404547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36390144,0.009046627,0.48518533,0.0037822209,0.00088510773,0.00020757508,0.0012066141,0.00043551635,0.13534948],"genre_scores_gemma":[0.8403552,0.0033739347,0.1278972,0.00073950086,0.000758074,0.00038223682,0.00072730036,0.00011131239,0.025655182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896693,0.0002307077,0.00011066753,0.00024238817,0.00030649125,0.00014279969],"domain_scores_gemma":[0.9985606,0.0006133578,0.00023528234,0.00014017135,0.0003224376,0.0001280288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723841,0.00055315864,0.00068751856,0.0024981247,0.0019601935,0.0026528363,0.0008441717,0.0012970243,0.0041429573],"category_scores_gemma":[0.0027840133,0.00048669433,0.0010710664,0.001950203,0.004442264,0.005889751,0.0019814218,0.0016053788,0.0011605573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011046751,0.000005625226,0.000076176504,0.000022762966,0.0000022818815,0.000056694287,0.0001903936,0.00037609242,0.00044868124,0.9959188,0.0002635201,0.002627998],"study_design_scores_gemma":[0.0000072917583,0.000030998854,0.00014874569,0.000024791752,0.0000075188123,0.00017921736,0.00010215978,0.0040084794,0.0006112606,0.9850168,0.009843123,0.000019593925],"about_ca_topic_score_codex":0.0011944091,"about_ca_topic_score_gemma":0.0009403201,"teacher_disagreement_score":0.0041429573,"about_ca_system_score_codex":0.0016845312,"about_ca_system_score_gemma":0.0011548646,"threshold_uncertainty_score":0.01385963},"labels":[],"label_agreement":null},{"id":"W2021056221","doi":"10.1142/s0129054108005863","title":"AVOIDING APPROXIMATE SQUARES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Mathematics; Combinatorics; Least-squares function approximation; Word (group theory); Variation (astronomy); Discrete mathematics; Algorithm; Statistics; Physics; Philosophy","score_opus":0.023775864139508048,"score_gpt":0.2867096296032943,"score_spread":0.2629337654637863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021056221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22605102,0.00067597546,0.7487197,0.0012479064,0.00037932568,0.00014903619,0.00022330647,0.0017611951,0.02079256],"genre_scores_gemma":[0.60953814,0.00046043465,0.3580723,0.0009200051,0.0001754876,0.0002265471,0.00058579387,0.0010375322,0.028983818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973623,0.0007562496,0.00026996687,0.00068571337,0.00062874926,0.00029701882],"domain_scores_gemma":[0.99050564,0.0039142985,0.0008159464,0.003374864,0.0010646753,0.00032459587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735964,0.0007965538,0.0013435149,0.0006006274,0.0018699585,0.0013613604,0.0014471587,0.0017479147,0.005469957],"category_scores_gemma":[0.013109274,0.0007273663,0.0009406212,0.0009667506,0.0023067498,0.005081341,0.0045086197,0.0017617097,0.0023737373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012705754,0.00021023989,0.004834683,0.0010853524,0.00019390097,0.0015068324,0.0034202358,0.057285845,0.05271591,0.55236834,0.016922727,0.30818528],"study_design_scores_gemma":[0.00007760444,0.00039245762,0.0006378337,0.00009970748,0.00009366741,0.0016400306,0.0010968132,0.11119461,0.04849198,0.7901125,0.046049338,0.00011343111],"about_ca_topic_score_codex":0.0005773919,"about_ca_topic_score_gemma":0.0007359091,"teacher_disagreement_score":0.005469957,"about_ca_system_score_codex":0.00050046894,"about_ca_system_score_gemma":0.0009587329,"threshold_uncertainty_score":0.018298805},"labels":[],"label_agreement":null},{"id":"W2021216077","doi":"10.1142/s0129054105003704","title":"SORTING SUFFIXES OF TWO-PATTERN STRINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized suffix tree; Mathematics; Recursion (computer science); String (physics); Sorting; Generalization; Morphism; Suffix tree; Set (abstract data type); Lexicographical order; Iterated function; Time complexity; Combinatorics; Trie; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.017952371191051537,"score_gpt":0.3194346811573973,"score_spread":0.3014823099663458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021216077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11344313,0.00043967777,0.87301606,0.00024521418,0.0001859142,0.00020615499,0.00030672216,0.0029642961,0.009192797],"genre_scores_gemma":[0.22070527,0.00027609442,0.76700777,0.00023900476,0.00007293239,0.00020020719,0.0013177376,0.00045062153,0.009730348],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998604,0.00024836423,0.0002124329,0.00028371494,0.0004933065,0.00015810675],"domain_scores_gemma":[0.9961804,0.0015983955,0.0002831549,0.0009907873,0.00084398064,0.00010328381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009751432,0.00056152506,0.0008752287,0.0014516134,0.00078039983,0.0015301527,0.0011051391,0.0010062851,0.0055265436],"category_scores_gemma":[0.005956025,0.0003859311,0.000821295,0.0025685912,0.0010621151,0.0034383978,0.0016839282,0.0010389051,0.0028185318],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006412177,0.00025825022,0.0024260597,0.00068193243,0.00008706994,0.0007677285,0.0011522936,0.018482875,0.090816274,0.23419216,0.005563226,0.64493096],"study_design_scores_gemma":[0.00018861445,0.00080067164,0.0022518428,0.00017765336,0.000093299976,0.0018377281,0.00047293882,0.35473663,0.1820614,0.3786451,0.07858685,0.00014726983],"about_ca_topic_score_codex":0.0005873266,"about_ca_topic_score_gemma":0.00090162153,"teacher_disagreement_score":0.0055265436,"about_ca_system_score_codex":0.0006943114,"about_ca_system_score_gemma":0.00095531,"threshold_uncertainty_score":0.01848811},"labels":[],"label_agreement":null},{"id":"W2025689196","doi":"10.1142/s0129054105003352","title":"NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Automaton; Artificial intelligence","score_opus":0.009417357858932295,"score_gpt":0.28444976987275594,"score_spread":0.27503241201382367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69538283,0.0010738355,0.2870651,0.0003797296,0.000039029874,0.000060023765,0.0001494488,0.00038928518,0.015460707],"genre_scores_gemma":[0.95628494,0.00017097603,0.040296234,0.000051279065,0.000028862445,0.000083676656,0.00007347853,0.00011389242,0.0028967368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791175,0.00051048386,0.00022692452,0.00069572433,0.00044352913,0.00021151833],"domain_scores_gemma":[0.9908324,0.006071508,0.0011495767,0.0008641306,0.0007608274,0.0003215726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016081487,0.00024014323,0.00073097623,0.0008059638,0.0012847119,0.0014957194,0.0010546382,0.00072707766,0.00255847],"category_scores_gemma":[0.01040015,0.000423293,0.00080278324,0.00038349754,0.0024362807,0.0040644994,0.0014452855,0.0010843019,0.00046372102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002447562,0.000027874185,0.0041455803,0.00028469678,0.000042180618,0.00051612145,0.0018472701,0.012096026,0.038319834,0.922325,0.00040371376,0.019746935],"study_design_scores_gemma":[0.00004070245,0.00020299102,0.002548636,0.000067534515,0.000072423005,0.002170288,0.0008018236,0.07789548,0.043692455,0.86307985,0.009326738,0.00010104792],"about_ca_topic_score_codex":0.00037429182,"about_ca_topic_score_gemma":0.00031430728,"teacher_disagreement_score":0.00255847,"about_ca_system_score_codex":0.00080288993,"about_ca_system_score_gemma":0.00045941235,"threshold_uncertainty_score":0.008558929},"labels":[],"label_agreement":null},{"id":"W2028981459","doi":"10.1142/s0129054110007350","title":"COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hierarchy; Class (philosophy); Overhead (engineering); Resolution (logic); Collision; Theoretical computer science; Process (computing); Constant (computer programming); Parallel computing; Distributed computing; Programming language; Artificial intelligence","score_opus":0.022076746715674115,"score_gpt":0.2932556143907607,"score_spread":0.2711788676750866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028981459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46067622,0.0011306867,0.48500046,0.0017576693,0.00010348944,0.00017370353,0.00015246398,0.0006838483,0.05032149],"genre_scores_gemma":[0.9006106,0.00069174764,0.09150804,0.00021693918,0.00011372606,0.00018260448,0.00012521911,0.00010499482,0.0064460905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874264,0.00035549182,0.000067510526,0.00017033081,0.00042259644,0.00024151677],"domain_scores_gemma":[0.99711007,0.0012330319,0.00022671951,0.00089896645,0.00028385193,0.00024742712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595252,0.0006590205,0.0007571811,0.00071608706,0.0011640211,0.0020463667,0.0015312028,0.0007603206,0.0045514726],"category_scores_gemma":[0.0047031376,0.0005912492,0.0011041899,0.0007959491,0.0022985472,0.005346846,0.0038397904,0.002056841,0.0005134074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011413138,0.00009813607,0.001197471,0.00015517115,0.00004616543,0.00025713627,0.0004350845,0.16870582,0.003948897,0.80407685,0.0010486627,0.019916411],"study_design_scores_gemma":[0.00003629923,0.000078294775,0.0002298378,0.000024766769,0.000029889188,0.00009217359,0.00010567351,0.48352292,0.0011939701,0.5104174,0.0042502335,0.000018496316],"about_ca_topic_score_codex":0.0018241918,"about_ca_topic_score_gemma":0.0016867475,"teacher_disagreement_score":0.0045514726,"about_ca_system_score_codex":0.0009375138,"about_ca_system_score_gemma":0.0009079138,"threshold_uncertainty_score":0.015226185},"labels":[],"label_agreement":null},{"id":"W2030063053","doi":"10.1142/s0129054102001497","title":"CONSTRUCTING RED-BLACK TREE SHAPES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tree (set theory); Correctness; Binary tree; Mathematics; Combinatorics; Sequence (biology); Optimal binary search tree; Random binary tree; K-ary tree; Range tree; Algorithm; Ternary search tree; Weight-balanced tree; Interval tree; Discrete mathematics; Binary search tree; Tree structure; Chemistry","score_opus":0.03742748328499703,"score_gpt":0.30269494474112313,"score_spread":0.2652674614561261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030063053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048898246,0.00019929734,0.93654996,0.00029827963,0.000071848044,0.00016528636,0.00029528575,0.0046043084,0.008917418],"genre_scores_gemma":[0.25749105,0.00020535554,0.7350606,0.00026939777,0.000018311204,0.0002087516,0.0006403474,0.001307315,0.004798952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831414,0.00033814227,0.0001260474,0.0003038952,0.00070493796,0.00021293788],"domain_scores_gemma":[0.99581665,0.0012432212,0.0003990954,0.001434622,0.00088696333,0.00021941637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013105813,0.0006598573,0.0007615239,0.0010599716,0.0010824575,0.0011993644,0.0018242578,0.0011874744,0.0031459974],"category_scores_gemma":[0.008398391,0.00086246023,0.0009147714,0.0010954207,0.0016508288,0.0027335135,0.002759838,0.0014022306,0.001685022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065486354,0.00021070198,0.004758751,0.0005043341,0.00007480291,0.00090442476,0.001980731,0.053937614,0.08331689,0.46485373,0.011993925,0.37680927],"study_design_scores_gemma":[0.00010586861,0.00022736427,0.0014345115,0.00020805722,0.00009419372,0.0010634761,0.00045667792,0.37841833,0.1566922,0.35913128,0.102047004,0.00012107328],"about_ca_topic_score_codex":0.00093867705,"about_ca_topic_score_gemma":0.0014171482,"teacher_disagreement_score":0.0031459974,"about_ca_system_score_codex":0.0007133414,"about_ca_system_score_gemma":0.0009537748,"threshold_uncertainty_score":0.010524392},"labels":[],"label_agreement":null},{"id":"W2030143386","doi":"10.1142/s0129054107005133","title":"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Assertion; TRACE (psycholinguistics); Automaton; Computer science; Representation (politics); Canonical form; Programming language; Theoretical computer science; Finite-state machine; Software; Formal specification; Automata theory; Focus (optics); Expressive power; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.03604204822379109,"score_gpt":0.3274862886789105,"score_spread":0.2914442404551194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030143386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040764823,0.00015352202,0.99104846,0.00017334288,0.000048830556,0.00006592688,0.00006624219,0.00039351254,0.0039735455],"genre_scores_gemma":[0.2772079,0.00057679747,0.7131923,0.00033419425,0.00015635147,0.00066375267,0.00049948896,0.00037041475,0.006998822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969201,0.0010886941,0.0004537954,0.0005062528,0.000748454,0.00028274106],"domain_scores_gemma":[0.99701595,0.0012287649,0.00030557776,0.000779612,0.0005812445,0.00008896883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032758631,0.0006212282,0.0006607468,0.0011719882,0.000652139,0.0031270445,0.0017740662,0.0016554893,0.004368859],"category_scores_gemma":[0.0052424185,0.00066694414,0.0017178048,0.0010519896,0.004534657,0.0068336376,0.0018656257,0.0024776056,0.0011429132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001083596,0.000014687936,0.00012722051,0.000045693156,0.0000057445213,0.00004355832,0.0004152446,0.0022661176,0.00097129116,0.98416674,0.00048033547,0.011452626],"study_design_scores_gemma":[0.000017446977,0.00006339898,0.00013229848,0.000065370186,0.00002089598,0.00014460679,0.00015546792,0.035544284,0.007776099,0.9307723,0.025278231,0.000029607747],"about_ca_topic_score_codex":0.0011518548,"about_ca_topic_score_gemma":0.0007612344,"teacher_disagreement_score":0.004368859,"about_ca_system_score_codex":0.0012931986,"about_ca_system_score_gemma":0.0015318131,"threshold_uncertainty_score":0.017324567},"labels":[],"label_agreement":null},{"id":"W2032261263","doi":"10.1142/s0129054107005303","title":"SOLITON AUTOMATA BASED ON TREES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Molecular Junctions and Nanostructures","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Automaton; Tree (set theory); Mathematics; Quantum finite automata; Discrete mathematics; Soliton; Tree automaton; Automata theory; Set (abstract data type); Combinatorics; Computer science; Physics; Theoretical computer science; Nonlinear system; Quantum mechanics","score_opus":0.007971116984417567,"score_gpt":0.26671703578532424,"score_spread":0.2587459188009067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032261263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1844774,0.0014957812,0.7659526,0.00050231937,0.00022792938,0.00014603973,0.0004924533,0.0011255889,0.045579836],"genre_scores_gemma":[0.7778641,0.0013369218,0.20524983,0.00023605804,0.00011977498,0.0002897279,0.0005501253,0.0001797173,0.014173652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994343,0.00013527024,0.00006855836,0.00011836901,0.00016700891,0.00007653601],"domain_scores_gemma":[0.99855024,0.00070292724,0.00016602798,0.00022801214,0.00026932685,0.00008341591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988804,0.0003055449,0.00040820614,0.0009976816,0.00083507196,0.0014468603,0.0005063011,0.0006370865,0.0034014985],"category_scores_gemma":[0.0026098806,0.00024585868,0.00051611924,0.0009935924,0.0010710811,0.0024971291,0.00091655296,0.001104122,0.00075531815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004673712,0.000014050839,0.00029622755,0.00006906759,0.0000074295376,0.00009117182,0.00021253347,0.008138156,0.0061502033,0.96953493,0.0008570708,0.014582339],"study_design_scores_gemma":[0.0000149807265,0.00003783705,0.00019513982,0.000037725058,0.000014067295,0.00018286517,0.00007599023,0.091655806,0.006303036,0.88483346,0.016629936,0.000019116927],"about_ca_topic_score_codex":0.000496288,"about_ca_topic_score_gemma":0.0007178673,"teacher_disagreement_score":0.0034014985,"about_ca_system_score_codex":0.0006549188,"about_ca_system_score_gemma":0.0005033972,"threshold_uncertainty_score":0.011379123},"labels":[],"label_agreement":null},{"id":"W2034751457","doi":"10.1142/s0129054107004978","title":"THE STRUCTURE OF FACTOR ORACLES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Factor (programming language); Trie; Suffix; Set (abstract data type); Computer science; String (physics); Simple (philosophy); Generalized suffix tree; Matching (statistics); Quotient; Theoretical computer science; Data structure; Mathematics; Suffix tree; Algorithm; Combinatorics; Programming language; Statistics","score_opus":0.01426481259880297,"score_gpt":0.3138316890843494,"score_spread":0.2995668764855464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034751457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056319296,0.001964045,0.9140486,0.0018931278,0.00026363824,0.00019170654,0.0015580609,0.0034229925,0.020338522],"genre_scores_gemma":[0.6761904,0.0018300324,0.29753658,0.0013625806,0.0008328724,0.00062177086,0.0038524687,0.0016373568,0.016135955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899491,0.0019927442,0.0015088737,0.0029674857,0.002549749,0.0010319898],"domain_scores_gemma":[0.9634849,0.018765088,0.0022845704,0.0098444335,0.0043069674,0.0013140565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050937906,0.0009432889,0.0020073594,0.0029920407,0.0019569257,0.008089919,0.0030717242,0.0030297225,0.013612875],"category_scores_gemma":[0.03955491,0.001124338,0.0018320376,0.003582421,0.008218181,0.024756951,0.0061961105,0.004898537,0.0033423668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014811115,0.00003516855,0.00087574334,0.00014523811,0.000017671566,0.000090228044,0.00053703575,0.0034012957,0.0011341947,0.96254516,0.0018367805,0.029233472],"study_design_scores_gemma":[0.000020121424,0.00006527485,0.00017758324,0.00004958164,0.000019347799,0.00015576601,0.00007855694,0.014780649,0.0017960819,0.9759236,0.0068945144,0.00003896762],"about_ca_topic_score_codex":0.0011093502,"about_ca_topic_score_gemma":0.00056197157,"teacher_disagreement_score":0.013612875,"about_ca_system_score_codex":0.001883168,"about_ca_system_score_gemma":0.0015237232,"threshold_uncertainty_score":0.045539558},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009870597442700342,"score_gpt":0.29530844546629664,"score_spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046033718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111298986,0.00026926835,0.8803105,0.00032262056,0.00003454743,0.00011188394,0.00022200885,0.001958105,0.005472058],"genre_scores_gemma":[0.545537,0.00020289326,0.44689223,0.0001239746,0.00003941951,0.00013355124,0.00088121044,0.00022207154,0.0059676487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992494,0.00014572528,0.000067834495,0.00023872417,0.00018187868,0.00011643466],"domain_scores_gemma":[0.99767524,0.0013108421,0.00020881127,0.00044215212,0.00025576528,0.00010708024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652393,0.00041421741,0.0006386714,0.000620059,0.0006277499,0.0013498116,0.00056873175,0.00046461323,0.0030791848],"category_scores_gemma":[0.0044375807,0.00035981173,0.0006097499,0.000606771,0.0012693306,0.002581938,0.00126482,0.000898827,0.0007923907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010871415,0.00020105792,0.0033788485,0.00056982,0.000055564717,0.00055095204,0.0011960258,0.103535496,0.052992653,0.49154392,0.006425318,0.33846322],"study_design_scores_gemma":[0.000053387328,0.00014395814,0.00035502212,0.00003353768,0.000037281596,0.00035836324,0.00019283697,0.42108285,0.03446213,0.5355828,0.007668386,0.000029347675],"about_ca_topic_score_codex":0.001165299,"about_ca_topic_score_gemma":0.0012979204,"teacher_disagreement_score":0.0030791848,"about_ca_system_score_codex":0.0010189862,"about_ca_system_score_gemma":0.0012232962,"threshold_uncertainty_score":0.010300875},"labels":[],"label_agreement":null},{"id":"W2048193893","doi":"10.1142/s0129054103002035","title":"SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Centre National de la Recherche Scientifique","keywords":"Tensor product; Qubit; Separable space; Dimension (graph theory); Mathematics; State (computer science); Hilbert space; Product (mathematics); Basis (linear algebra); Tensor (intrinsic definition); Quantum; Discrete mathematics; Combinatorics; Quantum mechanics; Pure mathematics; Physics; Mathematical analysis; Algorithm","score_opus":0.013622401063982013,"score_gpt":0.301575586761963,"score_spread":0.287953185697981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048193893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6587698,0.00046111472,0.30118963,0.001137065,0.000047987753,0.00008667469,0.00044506515,0.00019904108,0.037663635],"genre_scores_gemma":[0.97916555,0.00015945223,0.017906833,0.00012600087,0.00005811729,0.00010227809,0.00028921737,0.000054250115,0.0021383583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789643,0.0005659509,0.00019094332,0.00040471074,0.000645855,0.00029610822],"domain_scores_gemma":[0.9918188,0.004551379,0.0011729405,0.0012433616,0.00061793445,0.0005957228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018521838,0.00042889517,0.00068269676,0.0014723367,0.0013097903,0.002134703,0.0011788573,0.0012720961,0.0041676313],"category_scores_gemma":[0.010311176,0.0005367865,0.0008436012,0.0009996273,0.004319076,0.0067667183,0.0032315196,0.0020831085,0.0004030706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030720406,0.00008646605,0.0022253457,0.000095865136,0.000020777477,0.00028636504,0.0014591878,0.0056572165,0.008424992,0.973749,0.0004778191,0.00720977],"study_design_scores_gemma":[0.00003912456,0.0000817759,0.0014860507,0.000038228885,0.000016324886,0.00042069968,0.00039014552,0.0688666,0.0070583094,0.9193069,0.0022486898,0.000047205875],"about_ca_topic_score_codex":0.00038713973,"about_ca_topic_score_gemma":0.00030973725,"teacher_disagreement_score":0.0041676313,"about_ca_system_score_codex":0.0010017663,"about_ca_system_score_gemma":0.0007271043,"threshold_uncertainty_score":0.013942182},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04030689551270782,"score_gpt":0.3145119637821279,"score_spread":0.2742050682694201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048819748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041044485,0.00065870857,0.99084103,0.00013719281,0.000074285745,0.00008377619,0.000117572155,0.0009551004,0.0030278382],"genre_scores_gemma":[0.13555014,0.0017079813,0.8536008,0.000201405,0.00015315173,0.0004932308,0.0010893241,0.00040338797,0.006800577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978005,0.0005957573,0.00027884392,0.0004571904,0.00066802604,0.00019969228],"domain_scores_gemma":[0.99667966,0.0017026038,0.0002510699,0.0008475048,0.00045920679,0.000059969214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833566,0.00085021276,0.0011817557,0.0021988405,0.000895671,0.0029393102,0.0020000879,0.0014049882,0.007501835],"category_scores_gemma":[0.011549099,0.0005682281,0.0009782601,0.004243928,0.001345278,0.006132762,0.0024132254,0.0016273173,0.0024494438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021949112,0.00007756381,0.00051131233,0.00031737203,0.00005123982,0.000051499803,0.00015661748,0.07639205,0.0029728601,0.55237013,0.006046123,0.36083373],"study_design_scores_gemma":[0.000041153307,0.00007404932,0.00011249073,0.0000549822,0.00002375437,0.00014856184,0.000060731727,0.37707555,0.0039117364,0.6039398,0.014532134,0.000025089208],"about_ca_topic_score_codex":0.00093852327,"about_ca_topic_score_gemma":0.0010129764,"teacher_disagreement_score":0.007501835,"about_ca_system_score_codex":0.0013616929,"about_ca_system_score_gemma":0.001149675,"threshold_uncertainty_score":0.025096178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015010037028539204,"score_gpt":0.30523978877455843,"score_spread":0.2902297517460192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053288014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024888761,0.00013397222,0.9719203,0.000077335186,0.0000546123,0.000051701598,0.00006793597,0.0013504886,0.001454903],"genre_scores_gemma":[0.13054448,0.000082473714,0.86451024,0.000092147275,0.000026060185,0.00009392987,0.00026375987,0.00017071833,0.0042162663],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.00006987173,0.000050987983,0.00015224464,0.00024157282,0.000043769996],"domain_scores_gemma":[0.9993292,0.00017833068,0.00004986712,0.00018342228,0.00022731471,0.000031904823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048680237,0.00036602872,0.00054768677,0.0011708495,0.0004354533,0.00080078066,0.0016529465,0.00063203473,0.0027802798],"category_scores_gemma":[0.0020084516,0.0002416566,0.00031223218,0.0016789329,0.00045863126,0.001463533,0.00096043426,0.00055820344,0.0012079127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003775931,0.00007387095,0.0011042252,0.000085335996,0.00003393438,0.00016319055,0.00014540763,0.02682238,0.051593415,0.021284064,0.0040531894,0.89426345],"study_design_scores_gemma":[0.00009908651,0.00019503356,0.0008431378,0.000017932709,0.000029214565,0.00066040066,0.00007794154,0.88279617,0.06550475,0.030637896,0.019095328,0.000043080534],"about_ca_topic_score_codex":0.0011285454,"about_ca_topic_score_gemma":0.0013527413,"teacher_disagreement_score":0.0027802798,"about_ca_system_score_codex":0.00032080986,"about_ca_system_score_gemma":0.00055565813,"threshold_uncertainty_score":0.009301007},"labels":[],"label_agreement":null},{"id":"W2055930907","doi":"10.1142/s0129054112400503","title":"CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Transducer; Communication source; Computer science; Channel (broadcasting); Encoder; Encoding (memory); ENCODE; Binary number; Relation (database); Algorithm; Topology (electrical circuits); Theoretical computer science; Decidability; Acoustics; Mathematics; Telecommunications; Physics; Arithmetic; Artificial intelligence","score_opus":0.02610543362871547,"score_gpt":0.2999545621229074,"score_spread":0.2738491284941919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055930907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02968286,0.00025107642,0.9613401,0.00061536225,0.00007236851,0.000078886944,0.00009881457,0.0004371098,0.007423359],"genre_scores_gemma":[0.734377,0.0005201732,0.25657377,0.00024927923,0.000092602975,0.0004714314,0.0002814902,0.00023529751,0.007198981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997486,0.0010379677,0.00019101737,0.00056004996,0.0004504933,0.0002744859],"domain_scores_gemma":[0.98772115,0.010400867,0.0004760066,0.000752539,0.00043292023,0.00021642409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021884076,0.00063146127,0.000643028,0.00058730756,0.0010022054,0.0018696114,0.00092069636,0.0016445772,0.0051509906],"category_scores_gemma":[0.009908625,0.0005210802,0.0017126472,0.00042186695,0.003916159,0.0044740895,0.002805255,0.0021613818,0.0006510318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009464974,0.000038829658,0.0003723158,0.00025584866,0.000033417757,0.00034070935,0.0005587348,0.09716931,0.008792052,0.8794842,0.0005587545,0.012301219],"study_design_scores_gemma":[0.000038667506,0.0000798257,0.00006921897,0.000055656998,0.00004040323,0.00013262208,0.00014307818,0.32415316,0.010985052,0.65996456,0.0043053827,0.00003227893],"about_ca_topic_score_codex":0.0008718806,"about_ca_topic_score_gemma":0.00076586386,"teacher_disagreement_score":0.0051509906,"about_ca_system_score_codex":0.0016555042,"about_ca_system_score_gemma":0.0014446795,"threshold_uncertainty_score":0.017231822},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","score_opus":0.017188576571058888,"score_gpt":0.32330077500854654,"score_spread":0.30611219843748766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057447340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6663595,0.0017180014,0.27181596,0.00057519117,0.00032313046,0.00007304831,0.00038822662,0.00043666377,0.0583103],"genre_scores_gemma":[0.95677125,0.00043991537,0.026689518,0.00023870592,0.0001882059,0.00006799836,0.00030110343,0.00011390894,0.015189271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905187,0.00013358236,0.00010056062,0.00032981552,0.00021242382,0.00017170432],"domain_scores_gemma":[0.9984073,0.00059797894,0.00035804612,0.00024863947,0.00026400076,0.00012407993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043104746,0.00036469992,0.0004709317,0.0010034302,0.001016321,0.0018214588,0.0006728089,0.00063420646,0.004133279],"category_scores_gemma":[0.0023966169,0.00025320367,0.0006790697,0.0007456974,0.0027813576,0.0032979676,0.0012948508,0.00096176943,0.0007713057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045641606,0.00001769956,0.00046503387,0.00004407183,0.000008798946,0.00027404664,0.00045135836,0.0016481677,0.0041368348,0.9837617,0.00031560808,0.008830954],"study_design_scores_gemma":[0.00001563209,0.00007537513,0.00046122097,0.00002448029,0.00001667169,0.00048656584,0.0002948805,0.009382949,0.005252752,0.96904683,0.014914567,0.000028167804],"about_ca_topic_score_codex":0.0006587317,"about_ca_topic_score_gemma":0.0005107754,"teacher_disagreement_score":0.004133279,"about_ca_system_score_codex":0.000731357,"about_ca_system_score_gemma":0.00036717628,"threshold_uncertainty_score":0.013827205},"labels":[],"label_agreement":null},{"id":"W2058305583","doi":"10.1142/s0129054106004418","title":"RECONSTRUCTING A SUFFIX ARRAY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Suffix array; Compressed suffix array; Suffix tree; Generalized suffix tree; Suffix; Computer science; String (physics); Data structure; Alphabet; Simple (philosophy); Construct (python library); Algorithm; Mathematics; Theoretical computer science; Combinatorics; Programming language","score_opus":0.01205037815274377,"score_gpt":0.2796258498087055,"score_spread":0.2675754716559617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058305583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033486657,0.00037679725,0.9594282,0.0002799148,0.0001986124,0.000077779,0.000593302,0.0023927258,0.003166046],"genre_scores_gemma":[0.10131246,0.0005156328,0.8905549,0.00011981688,0.00007536605,0.000084030326,0.002076361,0.00047421004,0.0047872015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999091,0.00017414734,0.00010382126,0.00024065658,0.00030991697,0.00008037151],"domain_scores_gemma":[0.99611557,0.0013408506,0.00027199768,0.0014718985,0.0007097772,0.00008990488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076390285,0.0006853499,0.0009137875,0.0012641967,0.0007603365,0.0016310432,0.0011282976,0.0013183685,0.0041430946],"category_scores_gemma":[0.0074107237,0.0005618757,0.0008251046,0.002446195,0.00071069034,0.003295461,0.0013301527,0.0013607556,0.0041107177],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008127522,0.000114966686,0.0028215637,0.0008337127,0.00010974499,0.00081070076,0.0007069268,0.04386954,0.14301413,0.082852356,0.008889862,0.71516377],"study_design_scores_gemma":[0.000079012134,0.00057036063,0.0011516428,0.00015640746,0.00013659561,0.003228647,0.00065786426,0.43591896,0.34095863,0.13349764,0.08353029,0.00011400491],"about_ca_topic_score_codex":0.00041210136,"about_ca_topic_score_gemma":0.00042132038,"teacher_disagreement_score":0.0041430946,"about_ca_system_score_codex":0.0003210173,"about_ca_system_score_gemma":0.0010610304,"threshold_uncertainty_score":0.013859987},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00849638401482924,"score_gpt":0.28992859198748816,"score_spread":0.28143220797265894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060731856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77381414,0.0010116823,0.15441822,0.0016659702,0.00027129176,0.00005238789,0.00009100174,0.0003501721,0.06832523],"genre_scores_gemma":[0.95890224,0.00028913538,0.025588483,0.00019916169,0.00009284111,0.000056239922,0.000063981446,0.00010672951,0.014701293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00015879821,0.000067622146,0.00017036917,0.00019601575,0.00019368944],"domain_scores_gemma":[0.9978186,0.0012628236,0.00024439665,0.0003051464,0.00016859677,0.00020044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060959073,0.00044573058,0.00067640893,0.00055011484,0.0025748427,0.0023679053,0.00082195585,0.0012878168,0.005098142],"category_scores_gemma":[0.003997889,0.00063806906,0.0007721345,0.0006798367,0.0034739708,0.006454411,0.003225339,0.002099719,0.0009705057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022346276,0.000038536982,0.00065727107,0.00013054757,0.000010825195,0.0010584065,0.0017281332,0.0026260447,0.016749283,0.9591421,0.0010089045,0.016626453],"study_design_scores_gemma":[0.000039323197,0.00006530896,0.0002754544,0.000031183154,0.00001896053,0.000783301,0.00050948287,0.008521404,0.010089594,0.9682372,0.011393099,0.000035650577],"about_ca_topic_score_codex":0.00040484354,"about_ca_topic_score_gemma":0.000623295,"teacher_disagreement_score":0.005098142,"about_ca_system_score_codex":0.0007295475,"about_ca_system_score_gemma":0.00042133324,"threshold_uncertainty_score":0.017054975},"labels":[],"label_agreement":null},{"id":"W2061015906","doi":"10.1142/s0129054102001461","title":"SHUFFLE DECOMPOSITIONS OF REGULAR 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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Undecidable problem; Closure (psychology); Regular language; Equivalence (formal languages); Quotient; Decomposition; Mathematics; Context-free language; Abstract family of languages; Discrete mathematics; Context (archaeology); Computer science; Combinatorics; Decidability; Theoretical computer science; Automaton; Programming language; Rule-based machine translation; Natural language processing","score_opus":0.013496929104036635,"score_gpt":0.2898611299835407,"score_spread":0.27636420087950403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061015906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4461584,0.0004677879,0.53670096,0.00027140675,0.000085865046,0.00014989132,0.0002610718,0.00068482856,0.015219784],"genre_scores_gemma":[0.8861941,0.00021831106,0.10442072,0.00010080147,0.00006006842,0.000164968,0.00046850427,0.00023214129,0.008140327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984836,0.0002619558,0.00015746911,0.0003961473,0.00037650435,0.00032431303],"domain_scores_gemma":[0.9971546,0.0011303329,0.00039049445,0.0005190047,0.00043847229,0.0003670438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630739,0.0004577597,0.0004982812,0.001111385,0.0009568558,0.0021144967,0.0007552832,0.00045318788,0.0026497836],"category_scores_gemma":[0.003964126,0.0004166339,0.0011384451,0.00051549193,0.0026600384,0.0061755674,0.0019066865,0.0014379107,0.00050380215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116928444,0.00006202867,0.0008618561,0.000064710446,0.000013319669,0.00023248633,0.0009232757,0.0041626687,0.010672817,0.9675802,0.0004029496,0.014906707],"study_design_scores_gemma":[0.00002228701,0.000067517394,0.0003987856,0.000025876472,0.000015519317,0.00025611825,0.00028267578,0.028947774,0.014920927,0.94985354,0.0051837936,0.000025177585],"about_ca_topic_score_codex":0.00074605667,"about_ca_topic_score_gemma":0.0007606988,"teacher_disagreement_score":0.0026497836,"about_ca_system_score_codex":0.0011651431,"about_ca_system_score_gemma":0.00073429185,"threshold_uncertainty_score":0.008864403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014411216565540718,"score_gpt":0.25365818394005857,"score_spread":0.23924696737451784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062377295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615074,0.0068868166,0.49000883,0.031755872,0.0032503405,0.000083037354,0.00034971855,0.0015730117,0.30458495],"genre_scores_gemma":[0.9444965,0.0020742512,0.030513784,0.004864109,0.0017945216,0.00008751598,0.00021984504,0.00029831222,0.015651148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995828,0.0011521324,0.00025425694,0.0011122476,0.0009928432,0.00066050625],"domain_scores_gemma":[0.9914697,0.0050017713,0.00057054154,0.0017832867,0.0009008821,0.0002738728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045653377,0.00051739055,0.0015434192,0.0011270875,0.0025252528,0.003080028,0.0012755382,0.0023488922,0.006514504],"category_scores_gemma":[0.016532766,0.0005153033,0.0015552582,0.0011316097,0.008638177,0.014279436,0.004295499,0.0046372833,0.0010949898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001950348,0.0000066780317,0.00015157787,0.00003442843,0.000004742113,0.000046539706,0.00008561104,0.00039741764,0.00018644593,0.9941803,0.0014115664,0.0034752935],"study_design_scores_gemma":[0.000008116732,0.0000055793776,0.00009251384,0.000012366568,0.0000045261067,0.000056270244,0.000022568032,0.0021532986,0.00037273992,0.99344736,0.0038160942,0.000008612631],"about_ca_topic_score_codex":0.00090329186,"about_ca_topic_score_gemma":0.0006999069,"teacher_disagreement_score":0.006514504,"about_ca_system_score_codex":0.0015302344,"about_ca_system_score_gemma":0.0010643435,"threshold_uncertainty_score":0.024144113},"labels":[],"label_agreement":null},{"id":"W2066454279","doi":"10.1142/s0129054106004194","title":"SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; McMaster University","keywords":"Mathematics; Social connectedness; Combinatorics; Permutation (music); Sorting; Parity of a permutation; Sign (mathematics); Discrete mathematics; Cyclic permutation; Algorithm; Symmetric group; Physics","score_opus":0.006583382107404011,"score_gpt":0.27276763834056134,"score_spread":0.26618425623315733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066454279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6265947,0.00047383396,0.35261038,0.0009303125,0.00009264248,0.00013380169,0.00046134362,0.00096029375,0.017742716],"genre_scores_gemma":[0.9100262,0.00049084565,0.08287829,0.00025019693,0.000069260386,0.00012689452,0.00083696406,0.00020252426,0.0051188916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989691,0.00029394808,0.0000937963,0.000277971,0.00022134303,0.00014384424],"domain_scores_gemma":[0.9959247,0.001974164,0.00071579067,0.00089354976,0.00030348112,0.00018833653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332478,0.0004060059,0.0005869628,0.0012859771,0.00090593024,0.0020408584,0.0013381317,0.0013256201,0.0048049917],"category_scores_gemma":[0.0073815417,0.00034463577,0.00070576265,0.0015751491,0.0022949937,0.005005727,0.001862041,0.0009929825,0.0008340596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008365199,0.00017853,0.0052229776,0.0003060163,0.000060473467,0.0005156179,0.00087370153,0.09503827,0.026346372,0.6672122,0.0029825629,0.20042676],"study_design_scores_gemma":[0.00012644865,0.00021153413,0.0013335331,0.00006409064,0.00003521127,0.00043098017,0.00023526725,0.12241313,0.019164262,0.8479062,0.008013647,0.00006567775],"about_ca_topic_score_codex":0.00062671094,"about_ca_topic_score_gemma":0.00071382424,"teacher_disagreement_score":0.0048049917,"about_ca_system_score_codex":0.00091453956,"about_ca_system_score_gemma":0.0006902003,"threshold_uncertainty_score":0.0160743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.014115939800737214,"score_gpt":0.29136790856882744,"score_spread":0.2772519687680902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067033580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3434805,0.001859844,0.64290375,0.0008768648,0.00007252354,0.00015436774,0.000115646304,0.00041396607,0.010122621],"genre_scores_gemma":[0.94928926,0.00077911624,0.047086284,0.00009950039,0.000037669328,0.00009600303,0.00008636899,0.000043002252,0.0024827768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853957,0.00034810623,0.00007735145,0.0003502177,0.0002958724,0.00038879344],"domain_scores_gemma":[0.9902193,0.0062521133,0.001533824,0.0010417785,0.0004888828,0.00046405036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012106524,0.0008644274,0.0012210936,0.0005983921,0.0009472431,0.0013035565,0.0016668474,0.0013959543,0.0027037903],"category_scores_gemma":[0.00784232,0.0003280825,0.00067097816,0.0005507646,0.0016720225,0.0032102372,0.002335068,0.0011939871,0.00027618292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006545521,0.00021044163,0.0036741367,0.0009321666,0.00014496791,0.0009856136,0.00057541614,0.82318014,0.039921947,0.08588507,0.0015260576,0.042309515],"study_design_scores_gemma":[0.00003933013,0.00046717867,0.0009797179,0.000045234734,0.00010806511,0.0006477925,0.00042457462,0.92485565,0.021465251,0.047360424,0.0035756845,0.0000310561],"about_ca_topic_score_codex":0.0009585662,"about_ca_topic_score_gemma":0.0009475053,"teacher_disagreement_score":0.0027037903,"about_ca_system_score_codex":0.0009321243,"about_ca_system_score_gemma":0.00047047893,"threshold_uncertainty_score":0.009045064},"labels":[],"label_agreement":null},{"id":"W2067149955","doi":"10.1142/s0129054104002297","title":"WORD COMPLEXITY AND REPETITIONS IN WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); Word (group theory); De Bruijn sequence; Mathematics; Combinatorics on words; Prefix; Iterated function; Logarithm; Complexity class; Time complexity; Morphism; Computational complexity theory; Combinatorics; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.027779165371465343,"score_gpt":0.3161795475744101,"score_spread":0.2884003822029447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067149955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4408273,0.004634791,0.49425003,0.0024217798,0.00034173307,0.00018144737,0.00100672,0.00083383365,0.055502422],"genre_scores_gemma":[0.88233715,0.0016554197,0.09707962,0.00042067736,0.0008018908,0.000374919,0.0008064244,0.0003949931,0.01612888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970324,0.00045225566,0.0002866562,0.0006737906,0.0012131591,0.00034167164],"domain_scores_gemma":[0.9899644,0.005997177,0.0012924738,0.0013155293,0.0010078537,0.0004225243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009024424,0.0006757373,0.0008589603,0.0028069909,0.0010710653,0.0032463968,0.0010552865,0.0009580618,0.0064683203],"category_scores_gemma":[0.010130842,0.00042613578,0.001152537,0.002535139,0.003744652,0.009257765,0.0028156734,0.0020848757,0.0009493975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014971112,0.00005196144,0.0014132581,0.00018448374,0.000037134814,0.00030038366,0.00086466817,0.018837279,0.005144198,0.93420166,0.0016027712,0.03721244],"study_design_scores_gemma":[0.00001602485,0.00007808461,0.00072406593,0.00003293659,0.000021811402,0.00032503234,0.00011761136,0.03840224,0.0035485239,0.9499152,0.0067694965,0.00004902359],"about_ca_topic_score_codex":0.000827372,"about_ca_topic_score_gemma":0.00063698506,"teacher_disagreement_score":0.0064683203,"about_ca_system_score_codex":0.0015455745,"about_ca_system_score_gemma":0.00064137205,"threshold_uncertainty_score":0.021638691},"labels":[],"label_agreement":null},{"id":"W2071236098","doi":"10.1142/s0129054106004182","title":"QUANTUM OCTAL GAMES","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum pseudo-telepathy; Computer science; Quantum entanglement; Combinatorial game theory; Theoretical computer science; Quantum; Qubit; Quantum information; Quantum computer; Game theory; Quantum information science; Mathematical economics; Mathematics; Sequential game; Quantum mechanics; Physics","score_opus":0.010892600125300578,"score_gpt":0.28781016949384797,"score_spread":0.2769175693685474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071236098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088992864,0.00060846563,0.6334568,0.004743372,0.00034972327,0.0011262606,0.0010592279,0.00054913276,0.26911408],"genre_scores_gemma":[0.8100712,0.0006966121,0.12609558,0.0014161977,0.00017615994,0.0010426849,0.00066821335,0.0000934297,0.05973995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982481,0.0005702235,0.00010420136,0.00025193812,0.0004983207,0.0003271147],"domain_scores_gemma":[0.9987508,0.00053741457,0.00011464271,0.0001390419,0.00020653997,0.0002515043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080814987,0.0007647984,0.00077707163,0.00062092126,0.0017531434,0.0032182217,0.0017308177,0.0013225557,0.011605039],"category_scores_gemma":[0.0035567705,0.00034110475,0.0006810682,0.0007022815,0.003166816,0.003540619,0.0020384814,0.002136823,0.0011446119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040898743,0.000049920065,0.00011200417,0.00004370959,0.0000074698683,0.0000482127,0.0001709548,0.0034854577,0.00039380655,0.9875008,0.002184615,0.0059620794],"study_design_scores_gemma":[0.00006357409,0.00004762651,0.00010540517,0.000024620571,0.000008305057,0.0000666894,0.00019478788,0.057240658,0.00048457392,0.9200252,0.021717822,0.000020665699],"about_ca_topic_score_codex":0.0031073063,"about_ca_topic_score_gemma":0.004007397,"teacher_disagreement_score":0.011605039,"about_ca_system_score_codex":0.0020373128,"about_ca_system_score_gemma":0.0016970348,"threshold_uncertainty_score":0.03882277},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014623804691528124,"score_gpt":0.2890170193050417,"score_spread":0.27439321461351357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071427315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029926306,0.00047469346,0.94287395,0.0010869663,0.00012218844,0.00016470363,0.00008708639,0.0017663094,0.023497729],"genre_scores_gemma":[0.6253503,0.0009393896,0.3512945,0.000502715,0.00021320372,0.0006062451,0.00037413105,0.000893206,0.019826353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970162,0.000698566,0.00025079946,0.0006174493,0.0011027002,0.00031430734],"domain_scores_gemma":[0.9925822,0.0020576154,0.0003530495,0.004275329,0.00057813834,0.00015367576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023331295,0.00069301215,0.00070222997,0.00085172907,0.0008933771,0.002621133,0.0020907382,0.0014166207,0.0065673944],"category_scores_gemma":[0.011987625,0.00047687982,0.0012235023,0.0007831193,0.0030569998,0.006558083,0.003599616,0.0025039013,0.0012040152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052299194,0.00006550786,0.0004224078,0.00015135582,0.00003394849,0.0001465383,0.0003323282,0.015529375,0.007988079,0.8911067,0.001818904,0.08235252],"study_design_scores_gemma":[0.00003544186,0.0000865444,0.00022842574,0.00006834112,0.000057106263,0.0002574051,0.00007112305,0.1077218,0.019159844,0.8312148,0.04106043,0.0000387761],"about_ca_topic_score_codex":0.00076501083,"about_ca_topic_score_gemma":0.0007017095,"teacher_disagreement_score":0.0065673944,"about_ca_system_score_codex":0.0011688119,"about_ca_system_score_gemma":0.0014425644,"threshold_uncertainty_score":0.021970093},"labels":[],"label_agreement":null},{"id":"W2071898078","doi":"10.1142/s0129054106004492","title":"FAST BROADCASTING WITH BYZANTINE FAULTS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Correctness; Broadcasting (networking); Quantum Byzantine agreement; Computer science; Binary logarithm; Byzantine fault tolerance; Robustness (evolution); Log-log plot; Node (physics); Algorithm; Blocking (statistics); Distributed computing; Computer network; Fault tolerance; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.008157644065646001,"score_gpt":0.2592890208855335,"score_spread":0.2511313768198875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071898078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1057983,0.00035861696,0.89085907,0.00025860636,0.000033142176,0.000095505864,0.00005200518,0.00073100004,0.0018136548],"genre_scores_gemma":[0.7641826,0.00056709745,0.23122402,0.00013489631,0.00009967445,0.0002158723,0.00016611308,0.0002095453,0.0032001354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.00033994572,0.00005793322,0.00020711734,0.00046692995,0.00030196065],"domain_scores_gemma":[0.99290985,0.0044743707,0.0008942965,0.00089216046,0.0006773142,0.00015213301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588315,0.00071542163,0.0011693097,0.0009511381,0.0008525212,0.0015323792,0.001554806,0.0013575915,0.0011624774],"category_scores_gemma":[0.008685489,0.0004646571,0.00074261724,0.00086142623,0.0017695129,0.0025197063,0.0013868436,0.0013405234,0.00038402472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005433955,0.0000750344,0.002680795,0.00032406344,0.00008109448,0.00028322169,0.00058700907,0.7820231,0.03500927,0.09703647,0.0018537758,0.07950281],"study_design_scores_gemma":[0.000046055386,0.00010313227,0.00018477226,0.000016410439,0.000025075078,0.000116759555,0.000032254567,0.9608064,0.0080427565,0.029197264,0.0014170791,0.000012010976],"about_ca_topic_score_codex":0.0024365517,"about_ca_topic_score_gemma":0.0011028885,"teacher_disagreement_score":0.0024365517,"about_ca_system_score_codex":0.001338553,"about_ca_system_score_gemma":0.0014043213,"threshold_uncertainty_score":0.009711981},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009884880501276559,"score_gpt":0.2769687651552374,"score_spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073495011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756659,0.00047940132,0.7033756,0.0022345276,0.00011832814,0.00037366306,0.0013057503,0.005863044,0.010583706],"genre_scores_gemma":[0.53309196,0.00036601027,0.4585104,0.00036027844,0.00010176677,0.000405286,0.001761095,0.00093767233,0.004465559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738485,0.0004377186,0.0001964882,0.0008792274,0.00057138456,0.00053026935],"domain_scores_gemma":[0.9749961,0.02059214,0.0013773447,0.0013380744,0.0011822878,0.0005141321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018189992,0.0010860991,0.0011599278,0.0011395274,0.0009802983,0.0030206766,0.0015272843,0.0014676662,0.005852648],"category_scores_gemma":[0.015458175,0.00083855406,0.0024439343,0.0011182697,0.0017143085,0.005433528,0.0017035308,0.0025952614,0.0017369626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003945558,0.0007962399,0.024018016,0.002619886,0.00041872068,0.0014604155,0.002114288,0.25896662,0.19995369,0.128629,0.020912621,0.3561649],"study_design_scores_gemma":[0.0003563035,0.0003747156,0.0019337027,0.00012657553,0.0001873043,0.0009668149,0.00055628346,0.6661088,0.061139796,0.26274934,0.005368493,0.00013191707],"about_ca_topic_score_codex":0.0034243441,"about_ca_topic_score_gemma":0.004006115,"teacher_disagreement_score":0.005852648,"about_ca_system_score_codex":0.0018619726,"about_ca_system_score_gemma":0.0026450003,"threshold_uncertainty_score":0.019579053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029569320463496206,"score_gpt":0.2988042262286668,"score_spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074221742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7953647,0.00062990165,0.1871463,0.0019605565,0.00006635665,0.0001560672,0.0016604707,0.0010113637,0.012004196],"genre_scores_gemma":[0.9712154,0.00022685555,0.025066635,0.00008116447,0.000074831434,0.00013604047,0.0010353761,0.00019069042,0.001973136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992782,0.0014424674,0.000651435,0.0015235492,0.002177737,0.001422881],"domain_scores_gemma":[0.92457396,0.06247458,0.0039759395,0.00485176,0.0026403982,0.0014834461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033430199,0.0006863284,0.0018593426,0.0019537786,0.002374834,0.008321833,0.0032990025,0.0018289534,0.008323002],"category_scores_gemma":[0.03480097,0.0010477992,0.0023516472,0.0027528126,0.004277855,0.019439992,0.0046252925,0.0042333337,0.0005032936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019775413,0.00048297204,0.012983159,0.0006730125,0.0001874259,0.00032995484,0.0023751787,0.27928805,0.011985684,0.630232,0.0037277094,0.055757355],"study_design_scores_gemma":[0.00004450223,0.00009671303,0.0013926598,0.000035604164,0.00006656175,0.00012214754,0.0002264114,0.53859323,0.010859729,0.44741675,0.0010742707,0.0000715556],"about_ca_topic_score_codex":0.0042154035,"about_ca_topic_score_gemma":0.0033221105,"teacher_disagreement_score":0.008323002,"about_ca_system_score_codex":0.005017387,"about_ca_system_score_gemma":0.0030733033,"threshold_uncertainty_score":0.036403835},"labels":[],"label_agreement":null},{"id":"W2075877008","doi":"10.1142/s0129054110007386","title":"ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Logarithm; Regular language; Time complexity; Constant (computer programming); Cover (algebra); Probabilistic logic; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Formal language; Range (aeronautics); Discrete mathematics; Algorithm; Automaton; Artificial intelligence; Programming language","score_opus":0.02129091006112265,"score_gpt":0.31408380027596616,"score_spread":0.2927928902148435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075877008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45050892,0.00254407,0.49571615,0.009769731,0.00016019423,0.00020675173,0.00095220795,0.001015961,0.039125998],"genre_scores_gemma":[0.9560696,0.00091899285,0.03347219,0.00048714288,0.000327119,0.0003428861,0.00056249433,0.0003645061,0.0074551986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99007154,0.002878833,0.00055378163,0.001960101,0.002658185,0.0018775258],"domain_scores_gemma":[0.8365181,0.14596139,0.005336857,0.007783653,0.0026657248,0.0017342091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042344616,0.001048708,0.0015570808,0.001374218,0.0024547167,0.005722954,0.003137124,0.0019660916,0.008569176],"category_scores_gemma":[0.04080363,0.0010153122,0.0021273862,0.0020354192,0.006207469,0.019221716,0.0042279884,0.006929691,0.00104383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007058871,0.00024655848,0.004085402,0.00070848496,0.0001341051,0.00047413574,0.0016348707,0.18106043,0.009361956,0.771859,0.00325936,0.02646977],"study_design_scores_gemma":[0.000058450147,0.00008676938,0.00086000754,0.00004119932,0.000055562068,0.00023623373,0.00017519224,0.323156,0.0047212336,0.6682938,0.0022499806,0.0000656421],"about_ca_topic_score_codex":0.0018792608,"about_ca_topic_score_gemma":0.0013981642,"teacher_disagreement_score":0.008569176,"about_ca_system_score_codex":0.0042956867,"about_ca_system_score_gemma":0.0025863121,"threshold_uncertainty_score":0.031167567},"labels":[],"label_agreement":null},{"id":"W2075936685","doi":"10.1142/s0129054104002352","title":"IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Mathematics; Pairwise comparison; Upper and lower bounds; Quantum finite automata; Finite-state machine; Regular language; DFA minimization; Discrete mathematics; Automaton; Finite set; Nondeterministic finite automaton; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Statistics","score_opus":0.015615832947582784,"score_gpt":0.31805585924589436,"score_spread":0.30244002629831157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075936685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389382,0.0029918542,0.8095402,0.0026139265,0.0005157833,0.00024017833,0.0007667551,0.0041370573,0.040256094],"genre_scores_gemma":[0.67921,0.001626218,0.2984418,0.0009892823,0.00074376434,0.0009792345,0.0016949136,0.0014503725,0.014864397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899803,0.002259987,0.0007826881,0.0023011835,0.0027860445,0.0018897345],"domain_scores_gemma":[0.9405286,0.04295386,0.0021753903,0.01010462,0.0029537012,0.0012839258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005214772,0.002253634,0.0024554678,0.0022549413,0.00197186,0.004437225,0.005997188,0.0024880748,0.014737141],"category_scores_gemma":[0.036924154,0.001223683,0.0035609738,0.001758505,0.0030251832,0.013550883,0.007027803,0.007943539,0.003848272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037468493,0.00089083274,0.0069022547,0.0015343436,0.0002995259,0.00079527235,0.0011945423,0.18218696,0.068586566,0.50239193,0.01553674,0.21593419],"study_design_scores_gemma":[0.00013808101,0.00041367798,0.0014357916,0.0001525805,0.00028479297,0.0005590525,0.0000984974,0.47437942,0.033757493,0.47641054,0.012233733,0.00013639362],"about_ca_topic_score_codex":0.0011672259,"about_ca_topic_score_gemma":0.0020476796,"teacher_disagreement_score":0.014737141,"about_ca_system_score_codex":0.0030759312,"about_ca_system_score_gemma":0.0019602906,"threshold_uncertainty_score":0.04930061},"labels":[],"label_agreement":null},{"id":"W2076953942","doi":"10.1142/s0129054112400199","title":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix; Time complexity; Extension (predicate logic); Suffix array; Factorization; Suffix tree; Parallel algorithm; Compressed suffix array; Running time; Mathematics; Data structure","score_opus":0.015845256807878592,"score_gpt":0.31258860627660084,"score_spread":0.2967433494687223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076953942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01613957,0.0007172017,0.97231513,0.00042046348,0.00013963651,0.00013651779,0.00020863657,0.0031805395,0.0067423396],"genre_scores_gemma":[0.07376803,0.0004591353,0.9179328,0.00026958322,0.00016689023,0.00017823988,0.0004482177,0.000727881,0.0060491846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959734,0.0008593703,0.00038938705,0.0011090167,0.0013087795,0.00035997207],"domain_scores_gemma":[0.99325424,0.0023848591,0.0003580024,0.002545432,0.0013031542,0.00015422144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028430016,0.0014197134,0.0015779187,0.0025052119,0.0012031411,0.0028043932,0.0037798083,0.0017778202,0.004802874],"category_scores_gemma":[0.012725529,0.00085821666,0.0016662143,0.0038515178,0.0025446087,0.0075377896,0.0022756022,0.0028213393,0.0024217153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091240247,0.000114166694,0.0026514153,0.00039969047,0.00014092932,0.00023390558,0.0005105955,0.0783617,0.017007438,0.23226206,0.015219309,0.65218633],"study_design_scores_gemma":[0.00020514915,0.0004514405,0.0017310178,0.0002627651,0.00012171469,0.0010988401,0.00024034372,0.6118893,0.055999443,0.25483522,0.0729499,0.00021487023],"about_ca_topic_score_codex":0.0047767046,"about_ca_topic_score_gemma":0.006581449,"teacher_disagreement_score":0.004802874,"about_ca_system_score_codex":0.0015778225,"about_ca_system_score_gemma":0.0027589025,"threshold_uncertainty_score":0.016067266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01905439722890007,"score_gpt":0.3031961872650348,"score_spread":0.2841417900361347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076994310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030149717,0.0005630007,0.99333006,0.0001472515,0.00009383309,0.00014383892,0.00007132791,0.0006544783,0.0019812228],"genre_scores_gemma":[0.057720713,0.00079580885,0.9350984,0.00016153781,0.000079983874,0.00037835885,0.00042387517,0.0001832769,0.005157963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987834,0.00033623163,0.0000772215,0.00025287957,0.00045690162,0.000093329116],"domain_scores_gemma":[0.998749,0.00036321982,0.000113992726,0.0002722428,0.00044067224,0.000060954666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011599377,0.0009471163,0.00089944556,0.0021246923,0.0015144921,0.001536125,0.0020069613,0.0011561381,0.003899787],"category_scores_gemma":[0.0048192497,0.0004840548,0.00063235266,0.0031961815,0.0010079377,0.002558502,0.001972164,0.0010588049,0.0016514307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002592399,0.000087146516,0.0010535402,0.00031855507,0.00012234888,0.00009451486,0.00031436823,0.41053167,0.0076025007,0.07206834,0.014868272,0.49267948],"study_design_scores_gemma":[0.00007720827,0.00010681233,0.00033562828,0.000034367644,0.000035792735,0.00017450584,0.000093510345,0.90316176,0.0032273717,0.047675308,0.045025904,0.00005186668],"about_ca_topic_score_codex":0.00652884,"about_ca_topic_score_gemma":0.009337933,"teacher_disagreement_score":0.00652884,"about_ca_system_score_codex":0.0011615641,"about_ca_system_score_gemma":0.0016433861,"threshold_uncertainty_score":0.013046086},"labels":[],"label_agreement":null},{"id":"W2077005773","doi":"10.1142/s0129054111008763","title":"UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Adversary; Adversarial system; Computer science; Key (lock); Adversary model; Computer security; Protocol (science); Key distribution; Construct (python library); Theoretical computer science; Provable security; Public-key cryptography; Cryptography; Computer network; Encryption; Artificial intelligence","score_opus":0.019485605838634658,"score_gpt":0.261422321712517,"score_spread":0.24193671587388235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077005773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017814418,0.0031380763,0.96121675,0.0022763303,0.00015896795,0.00019826606,0.00030607585,0.00042670267,0.014464442],"genre_scores_gemma":[0.77185506,0.00653041,0.20982575,0.0008052023,0.00094692194,0.0011519588,0.000654593,0.00034562557,0.007884502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891151,0.002775837,0.00065679627,0.0020843542,0.0037141049,0.00165383],"domain_scores_gemma":[0.9649764,0.019939791,0.0037428092,0.008057451,0.0019990234,0.001284422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007831884,0.0023351505,0.0019166187,0.003164127,0.0029590998,0.009418825,0.0046383333,0.003659535,0.00525558],"category_scores_gemma":[0.026213203,0.0016299232,0.002460437,0.0058815815,0.0098163085,0.02918623,0.01108094,0.012812852,0.0018344756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019041086,0.00012156985,0.0004232317,0.00034618814,0.000049617807,0.00018315073,0.00048596176,0.033972908,0.0040416378,0.94005364,0.002251594,0.017880103],"study_design_scores_gemma":[0.000057782705,0.00017312731,0.00036862039,0.0001923247,0.00010030232,0.00087138644,0.00022943736,0.17536472,0.014509984,0.7922161,0.015774077,0.00014211163],"about_ca_topic_score_codex":0.0010585997,"about_ca_topic_score_gemma":0.00048068218,"teacher_disagreement_score":0.009418825,"about_ca_system_score_codex":0.0077701174,"about_ca_system_score_gemma":0.0033032135,"threshold_uncertainty_score":0.056376457},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008635601422458672,"score_gpt":0.28601269267096646,"score_spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077220764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529564,0.0013069777,0.22670244,0.000471388,0.0001573268,0.00007376593,0.00030501798,0.00026093214,0.017765826],"genre_scores_gemma":[0.95282507,0.0004327042,0.04169648,0.000076058896,0.0001699777,0.00011557341,0.00022351542,0.000094646,0.004366009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975212,0.00050066866,0.00027228854,0.0007230099,0.0006546849,0.0003280301],"domain_scores_gemma":[0.9894577,0.0064249244,0.0018419956,0.00096498535,0.00065802515,0.00065238937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110109,0.00044948896,0.0008360581,0.0023315195,0.0012541667,0.0025780937,0.001066606,0.0010153257,0.004644795],"category_scores_gemma":[0.012128176,0.0004293789,0.0005672173,0.0018050729,0.0032249896,0.0065238,0.0018053022,0.0010727012,0.0007092212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083435635,0.00014304755,0.010515215,0.0003887123,0.00006089815,0.0012870549,0.0025471235,0.004741656,0.027306642,0.85361344,0.001142294,0.09741958],"study_design_scores_gemma":[0.00003335968,0.0002719368,0.0045717782,0.00007263889,0.000060097722,0.0016903267,0.0010540435,0.023358164,0.01521403,0.9454548,0.008133173,0.00008558169],"about_ca_topic_score_codex":0.00030670268,"about_ca_topic_score_gemma":0.00026107207,"teacher_disagreement_score":0.004644795,"about_ca_system_score_codex":0.00077329244,"about_ca_system_score_gemma":0.000339612,"threshold_uncertainty_score":0.015538335},"labels":[],"label_agreement":null},{"id":"W2079344815","doi":"10.1142/s0129054106004042","title":"AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Distributed algorithm; Asynchronous communication; Computer science; Enhanced Data Rates for GSM Evolution; Time complexity; Algorithm; Binary logarithm; Message passing; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Distributed computing; Computer network; Artificial intelligence","score_opus":0.011182936591719284,"score_gpt":0.29382614801252016,"score_spread":0.2826432114208009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079344815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00547622,0.00016450077,0.98904335,0.00013530445,0.00005113395,0.00008976274,0.00010309079,0.0022247573,0.0027119794],"genre_scores_gemma":[0.13236272,0.00015669299,0.8619773,0.00011874338,0.00003633885,0.00030484324,0.00055301405,0.0002384439,0.004251835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994356,0.000085262334,0.000032454715,0.00013402804,0.00021117328,0.000101501835],"domain_scores_gemma":[0.9993374,0.00021684906,0.000049498478,0.0001589385,0.00017684938,0.000060493323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045478932,0.00077902083,0.0008898201,0.000908144,0.0010085155,0.00097615033,0.0022009108,0.0012779855,0.009748884],"category_scores_gemma":[0.0021294327,0.00033533416,0.00053017866,0.001309988,0.00059581833,0.0019052242,0.0025681392,0.00090888195,0.0023637703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048899517,0.00022214686,0.00088610634,0.00032142966,0.00006692436,0.00034306876,0.0002306145,0.12275284,0.01906868,0.079804614,0.029728122,0.7460864],"study_design_scores_gemma":[0.00027063605,0.000147593,0.00043284346,0.000033130334,0.000040039722,0.00047621276,0.00008231617,0.85679245,0.008185966,0.10725275,0.02623785,0.0000482892],"about_ca_topic_score_codex":0.0017891045,"about_ca_topic_score_gemma":0.002951583,"teacher_disagreement_score":0.009748884,"about_ca_system_score_codex":0.0007098432,"about_ca_system_score_gemma":0.0010382992,"threshold_uncertainty_score":0.032613218},"labels":[],"label_agreement":null},{"id":"W2082796216","doi":"10.1142/s0129054108006169","title":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","year":2008,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Upper and lower bounds; State (computer science); Coding (social sciences); Regular language; Computer science; Set (abstract data type); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Automaton; Programming language","score_opus":0.03906646804155322,"score_gpt":0.3068749110862771,"score_spread":0.2678084430447239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082796216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4119304,0.0015494173,0.5564565,0.0038699768,0.00021052582,0.00018192943,0.0014950392,0.00086317834,0.023442999],"genre_scores_gemma":[0.9171374,0.0009118638,0.07420263,0.00036189618,0.00030690484,0.00037930557,0.0010373722,0.0003538431,0.005308894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995365,0.00085687445,0.00037526665,0.0011230152,0.0013694447,0.00091029797],"domain_scores_gemma":[0.96160924,0.030923827,0.0016574055,0.0029027297,0.0018092481,0.0010975518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551547,0.0007650506,0.0017220475,0.0016636747,0.0016084985,0.0049253237,0.0019681118,0.0016589242,0.006261417],"category_scores_gemma":[0.022770235,0.0004953728,0.0023015868,0.0022161957,0.004563964,0.01054209,0.0043500187,0.004809846,0.00057725015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036685786,0.00012109012,0.0013331115,0.00021217996,0.000031104773,0.00020419825,0.00072099024,0.059433073,0.0064250897,0.90711445,0.0019316267,0.022106193],"study_design_scores_gemma":[0.000018636176,0.000043631164,0.00021929639,0.000019666855,0.000015111422,0.0000799899,0.00007478631,0.14457402,0.0030703219,0.8507325,0.0011139367,0.000038156948],"about_ca_topic_score_codex":0.0026062352,"about_ca_topic_score_gemma":0.0016072447,"teacher_disagreement_score":0.006261417,"about_ca_system_score_codex":0.0032734163,"about_ca_system_score_gemma":0.0024584245,"threshold_uncertainty_score":0.023750365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02637070741872171,"score_gpt":0.3423945622337794,"score_spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026336238,0.0032547456,0.90507704,0.0055413344,0.0003069598,0.0002196946,0.00028162813,0.00057453726,0.058407772],"genre_scores_gemma":[0.5367483,0.0039413203,0.4287268,0.001731754,0.000957115,0.00075198035,0.00062759366,0.0004339858,0.026081176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939721,0.0023239944,0.000564099,0.0013023249,0.0013922189,0.00044508534],"domain_scores_gemma":[0.985837,0.009533812,0.0011071675,0.0018046875,0.001398354,0.00031897338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062852036,0.0009480452,0.00069592753,0.0014800148,0.0019515286,0.0043050237,0.0017027671,0.0015312224,0.005449885],"category_scores_gemma":[0.013433278,0.001023704,0.0014516818,0.0023361803,0.011763604,0.0127826575,0.002627136,0.0044923984,0.0009879364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005847624,0.000007816318,0.00005758181,0.00004747744,0.000002822125,0.00008797855,0.00033357958,0.00068101654,0.00032663753,0.99556535,0.00034715948,0.0025368216],"study_design_scores_gemma":[0.000018252706,0.000041718748,0.000117768395,0.000112612914,0.00001781715,0.00049462623,0.00041573486,0.010486422,0.0019855744,0.91077834,0.07550994,0.00002114673],"about_ca_topic_score_codex":0.0012824185,"about_ca_topic_score_gemma":0.00067390595,"teacher_disagreement_score":0.0062852036,"about_ca_system_score_codex":0.0024432614,"about_ca_system_score_gemma":0.0016416141,"threshold_uncertainty_score":0.033239722},"labels":[],"label_agreement":null},{"id":"W2084473191","doi":"10.1142/s0129054107005200","title":"SOLITON LANGUAGES ARE NEARLY AN ANTI-AFL","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Molecular Junctions and Nanostructures","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Linguistics; Computer science; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.007870986350351038,"score_gpt":0.2833468441456931,"score_spread":0.27547585779534206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084473191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7438415,0.00041547947,0.20189644,0.0016802874,0.00021904788,0.00009686119,0.00040971368,0.0006827347,0.05075794],"genre_scores_gemma":[0.97999007,0.00012400668,0.01448238,0.00025521193,0.000102641934,0.00010330402,0.00016478804,0.00010094476,0.004676713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992613,0.000115993724,0.000058618174,0.00020244699,0.00024169566,0.000119961886],"domain_scores_gemma":[0.9969356,0.0013601544,0.0004938048,0.00035015005,0.0006096565,0.00025057932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007762804,0.0003328095,0.00048829423,0.0009553149,0.0014899798,0.0026211864,0.00053209334,0.0009153948,0.0036450448],"category_scores_gemma":[0.003422262,0.00028302454,0.0006958124,0.0004629865,0.0023935963,0.0033671085,0.0008958205,0.0015783003,0.0004997808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061230116,0.000039946986,0.0003725424,0.000032500746,0.0000073864694,0.0002094574,0.0005367973,0.0011356903,0.008400283,0.9844787,0.00056405214,0.004161393],"study_design_scores_gemma":[0.000029203888,0.000057678353,0.000307367,0.0000177806,0.0000067556894,0.0004578218,0.00029980566,0.03136362,0.003584322,0.96051115,0.0033426238,0.000021856977],"about_ca_topic_score_codex":0.00050778344,"about_ca_topic_score_gemma":0.0003658175,"teacher_disagreement_score":0.0036450448,"about_ca_system_score_codex":0.0007496207,"about_ca_system_score_gemma":0.0005377464,"threshold_uncertainty_score":0.012193859},"labels":[],"label_agreement":null},{"id":"W2084584786","doi":"10.1142/s0129054106004200","title":"COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Transient (computer programming); Converse; Electronic circuit; Mathematics; Function (biology); Logic gate; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Physics; Quantum mechanics","score_opus":0.011948986209768113,"score_gpt":0.27855024646066934,"score_spread":0.26660126025090125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084584786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24149129,0.00023847546,0.74576914,0.000125899,0.000042061234,0.00008575206,0.0002408148,0.0013401643,0.0106663965],"genre_scores_gemma":[0.9362891,0.00018978294,0.06037764,0.000078913385,0.000032968386,0.00014962867,0.00033076943,0.00016304613,0.0023882221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991208,0.00017030837,0.000057975514,0.00017141984,0.0003405781,0.0001389774],"domain_scores_gemma":[0.9981237,0.0010687454,0.0001830154,0.00033399664,0.00020752984,0.000083002786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048405112,0.00043002385,0.00046803843,0.0007623832,0.0005242025,0.00083988276,0.00058013154,0.000415472,0.0025719272],"category_scores_gemma":[0.0027557295,0.00031157144,0.0008652148,0.00052101514,0.0009956876,0.0014164897,0.0013309403,0.0006264347,0.00024530586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080097374,0.00016814303,0.004085724,0.0004300022,0.000071974704,0.00067808054,0.00062810327,0.33397073,0.11774846,0.45283714,0.0014299846,0.08715076],"study_design_scores_gemma":[0.00002984101,0.00013718776,0.001027215,0.0000415643,0.000053362543,0.00017687542,0.00004193142,0.8040809,0.052122265,0.13813607,0.0041260244,0.000026691845],"about_ca_topic_score_codex":0.0009782839,"about_ca_topic_score_gemma":0.00052655936,"teacher_disagreement_score":0.0025719272,"about_ca_system_score_codex":0.0010713235,"about_ca_system_score_gemma":0.00062043266,"threshold_uncertainty_score":0.00860399},"labels":[],"label_agreement":null},{"id":"W2085042840","doi":"10.1142/s0129054105003200","title":"THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Hierarchy; Conjecture; Mathematics; Upper and lower bounds; Polynomial; Combinatorics; Polynomial hierarchy; Discrete mathematics; Time complexity; Mathematical analysis","score_opus":0.018719036039273374,"score_gpt":0.28599908382975253,"score_spread":0.26728004779047915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085042840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44589722,0.0009361173,0.38520733,0.0023116255,0.00023038917,0.00014580526,0.0009132291,0.0014466431,0.16291168],"genre_scores_gemma":[0.9196153,0.00051274896,0.05860893,0.0005817687,0.00009347582,0.00013711794,0.00026817498,0.00024531418,0.01993707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999321,0.00006373745,0.000035850844,0.00015721627,0.00022012615,0.00020211069],"domain_scores_gemma":[0.9969049,0.0014480366,0.00023388074,0.0004637404,0.00047464375,0.00047475056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063770066,0.00033423622,0.00047854442,0.0011565468,0.0014935525,0.0035288,0.0010009963,0.0010089139,0.012683775],"category_scores_gemma":[0.0048497505,0.0004387778,0.00059775,0.000840826,0.0024226152,0.0052903323,0.0021138529,0.002782298,0.0026574766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705556,0.000030495936,0.00093677134,0.00008358274,0.0000038531934,0.00013357567,0.0004958656,0.00089855376,0.0064049955,0.9709335,0.0015113613,0.018470371],"study_design_scores_gemma":[0.000027654072,0.000059426373,0.0016065785,0.0000538909,0.000015332183,0.00042080155,0.00040083507,0.016194485,0.005728175,0.9633664,0.012091429,0.00003508467],"about_ca_topic_score_codex":0.0021445225,"about_ca_topic_score_gemma":0.0027487525,"teacher_disagreement_score":0.012683775,"about_ca_system_score_codex":0.0018032109,"about_ca_system_score_gemma":0.00093041314,"threshold_uncertainty_score":0.042431474},"labels":[],"label_agreement":null},{"id":"W2086380781","doi":"10.1142/s0129054107005078","title":"ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Computer science; Decidability; Delegation; Property (philosophy); Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Automaton; Theoretical computer science; Büchi automaton; Discrete mathematics; Deterministic automaton; Programming language; Mathematics; Automata theory","score_opus":0.02257258117667414,"score_gpt":0.31746810412455884,"score_spread":0.2948955229478847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086380781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06932744,0.000458267,0.92407775,0.0011056871,0.00004541991,0.00013883747,0.00009561499,0.00073922926,0.0040117693],"genre_scores_gemma":[0.65037936,0.00065558555,0.34339988,0.000443128,0.00012135929,0.00048946013,0.0002534314,0.00030627384,0.003951491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992019,0.003131244,0.000835505,0.0019248143,0.0011352479,0.0009541112],"domain_scores_gemma":[0.8875273,0.099227585,0.0034219602,0.0066478355,0.001837769,0.0013375474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010251268,0.0011062662,0.0018818948,0.0011917691,0.0026251962,0.0041701575,0.002293663,0.0030071607,0.0047900113],"category_scores_gemma":[0.056776643,0.0014702814,0.0034947132,0.0010967039,0.0072229714,0.013741377,0.005358697,0.0042824904,0.0006767816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006155554,0.0002573047,0.0034453399,0.0006062728,0.00010567411,0.0005184297,0.0025377788,0.14860643,0.008810204,0.78848755,0.0009865116,0.045022994],"study_design_scores_gemma":[0.00009531608,0.00015380238,0.00023842446,0.00009946434,0.000086332104,0.00030715697,0.0002776364,0.280428,0.0104072215,0.7042568,0.003574807,0.000075012926],"about_ca_topic_score_codex":0.0015292502,"about_ca_topic_score_gemma":0.0010929003,"teacher_disagreement_score":0.010251268,"about_ca_system_score_codex":0.0023539236,"about_ca_system_score_gemma":0.0021211507,"threshold_uncertainty_score":0.054214537},"labels":[],"label_agreement":null},{"id":"W2087043915","doi":"10.1142/s0129054102001527","title":"THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Asymmetry; Join (topology); Computer science; Greedy algorithm; Line (geometry); Routing (electronic design automation); Combinatorics; Mathematics; Graph; Mathematical optimization; Algorithm; Distributed computing; Computer network","score_opus":0.01958417640857618,"score_gpt":0.2819924232331981,"score_spread":0.26240824682462194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087043915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64492273,0.0012049045,0.3358668,0.0030351165,0.00013675478,0.00020684063,0.00029320898,0.00049619196,0.013837433],"genre_scores_gemma":[0.97067696,0.0005002867,0.027066378,0.00026836823,0.00013254766,0.00007185287,0.0001211541,0.00011047841,0.0010521109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351805,0.003549604,0.00021029082,0.0004970001,0.0013145334,0.0009104343],"domain_scores_gemma":[0.9527727,0.035934854,0.0051886905,0.0030212444,0.0017475844,0.001335028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053210054,0.0012018965,0.0014522639,0.000722835,0.0015510257,0.002388253,0.0022985514,0.0023064315,0.0019445274],"category_scores_gemma":[0.025505235,0.00052703393,0.00061728567,0.00087958906,0.0017950356,0.007576301,0.0025486678,0.0020067615,0.00044508197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002453573,0.0007173181,0.008115201,0.00036144277,0.00020042855,0.00085842685,0.00040219713,0.8032898,0.021905247,0.07109416,0.0043339375,0.08626835],"study_design_scores_gemma":[0.00016027583,0.0003987886,0.0012896566,0.0000374271,0.00007483197,0.00068391627,0.00024241304,0.8957805,0.011195221,0.08830769,0.0017886892,0.00004052149],"about_ca_topic_score_codex":0.00077435316,"about_ca_topic_score_gemma":0.00041980617,"teacher_disagreement_score":0.0053210054,"about_ca_system_score_codex":0.0017177386,"about_ca_system_score_gemma":0.0008923171,"threshold_uncertainty_score":0.028140545},"labels":[],"label_agreement":null},{"id":"W2087738591","doi":"10.1142/s0129054108005528","title":"IDENTIFYING RHYTHMS IN MUSICAL TEXTS","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rhythm; Substring; Duration (music); Sequence (biology); Musical; Speech recognition; Computer science; Mathematics; Literature; Data structure; Art; Physics; Acoustics","score_opus":0.04141102091982669,"score_gpt":0.32450685140621205,"score_spread":0.28309583048638537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087738591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36730257,0.004814455,0.6122082,0.00070049136,0.00029367092,0.00041505846,0.0037993367,0.0036813512,0.006784939],"genre_scores_gemma":[0.5496507,0.00234975,0.43730462,0.000114085495,0.00039388728,0.00020677925,0.0056814696,0.0003299219,0.0039688726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898225,0.0001465855,0.00015281327,0.00036640908,0.00025206976,0.0000998065],"domain_scores_gemma":[0.9974016,0.001144988,0.0005733144,0.00035632442,0.00036054943,0.00016330346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051697623,0.00065837236,0.0006837037,0.0041314247,0.00077633443,0.001408649,0.00074930757,0.000778846,0.0026432916],"category_scores_gemma":[0.0062690736,0.00042106342,0.00054644624,0.0029795521,0.00062164164,0.00295071,0.0015802544,0.00085069536,0.0024721303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010660065,0.00013995288,0.01762179,0.0009961472,0.00006901035,0.0010492033,0.0020443806,0.009073498,0.12677822,0.013037812,0.0061353357,0.82198864],"study_design_scores_gemma":[0.00034071098,0.001761534,0.06603628,0.0007125591,0.00037858277,0.006297053,0.005749337,0.46649358,0.14082569,0.18000533,0.13112448,0.0002748549],"about_ca_topic_score_codex":0.00092496263,"about_ca_topic_score_gemma":0.00084529334,"teacher_disagreement_score":0.0041314247,"about_ca_system_score_codex":0.00037433123,"about_ca_system_score_gemma":0.00043681837,"threshold_uncertainty_score":0.008842647},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03211804920181332,"score_gpt":0.3122282846005669,"score_spread":0.28011023539875357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089455626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75569504,0.0003709313,0.2132387,0.0012748376,0.00009423871,0.00022731867,0.0010798388,0.0006280209,0.027391044],"genre_scores_gemma":[0.9689066,0.00018444884,0.025249936,0.00006334748,0.000043853834,0.00015409852,0.0006478578,0.00016847196,0.004581465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736565,0.0005085741,0.00021710961,0.0005327944,0.00077134365,0.00060450134],"domain_scores_gemma":[0.9807896,0.013778364,0.0011976765,0.002472268,0.001090254,0.0006717524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134057,0.00055792317,0.00080574374,0.0010159338,0.0013585627,0.004679887,0.0015937536,0.0011783278,0.014451403],"category_scores_gemma":[0.011402853,0.00044657497,0.0018649634,0.0011729655,0.0021250611,0.010126673,0.0028988393,0.0029503272,0.00070809736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014630319,0.00041529353,0.0071452106,0.0005433115,0.00013593685,0.00046423878,0.0010844804,0.09672843,0.017612636,0.8164917,0.0034838251,0.05443184],"study_design_scores_gemma":[0.00008434532,0.00024832966,0.002128559,0.000040973828,0.00016852269,0.00034349164,0.00042969087,0.30886242,0.022502406,0.6613394,0.003743085,0.00010881265],"about_ca_topic_score_codex":0.0017468226,"about_ca_topic_score_gemma":0.0020485404,"teacher_disagreement_score":0.014451403,"about_ca_system_score_codex":0.0020577603,"about_ca_system_score_gemma":0.0021642025,"threshold_uncertainty_score":0.04834479},"labels":[],"label_agreement":null},{"id":"W2090919369","doi":"10.1142/s0129054103002229","title":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; De Bruijn sequence; Computer science; Sorting; Hypercube; Cardinality (data modeling); Algorithm; Set (abstract data type); Sorting algorithm; Communication complexity; Selection (genetic algorithm); Selection algorithm; Node (physics); Theoretical computer science; Parallel computing; Mathematics; Discrete mathematics; Data mining","score_opus":0.015521792565095482,"score_gpt":0.3087336153858631,"score_spread":0.2932118228207676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090919369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0446519,0.00016822097,0.9518465,0.00011918965,0.000025893007,0.00021052641,0.00009643163,0.0014788312,0.0014024646],"genre_scores_gemma":[0.2759635,0.0002955977,0.71936864,0.00008193881,0.00004200828,0.00043476996,0.0004278454,0.00011665495,0.0032690507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990972,0.0002423153,0.00006576403,0.00015508977,0.0003311767,0.00010837599],"domain_scores_gemma":[0.99742955,0.0014143725,0.0002819929,0.00045887285,0.00031487516,0.00010036133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011625987,0.0005548251,0.000697783,0.0012033266,0.0011447624,0.0011403419,0.001272921,0.00064798776,0.0022866945],"category_scores_gemma":[0.0031623272,0.0003683557,0.00045136057,0.0019419342,0.00075482094,0.0021154296,0.0010213548,0.0005475247,0.0006991069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010706093,0.0003145959,0.0032645997,0.00046401372,0.00010065058,0.00028340903,0.00057486875,0.23449077,0.039993208,0.06695608,0.0069575016,0.6455296],"study_design_scores_gemma":[0.0003344918,0.00036318143,0.0013083476,0.00004479065,0.000039026025,0.00039649688,0.0003479566,0.8602238,0.04450066,0.080921434,0.0114704035,0.000049297636],"about_ca_topic_score_codex":0.0011878172,"about_ca_topic_score_gemma":0.001989861,"teacher_disagreement_score":0.0022866945,"about_ca_system_score_codex":0.0009154977,"about_ca_system_score_gemma":0.00096361345,"threshold_uncertainty_score":0.0076497793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","score_opus":0.014145822113634738,"score_gpt":0.2763654520099963,"score_spread":0.26221962989636155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091155243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21926655,0.0015472852,0.6992473,0.0006370681,0.0008190858,0.00021878553,0.0006144479,0.0021765912,0.07547288],"genre_scores_gemma":[0.81733817,0.00078295026,0.15604027,0.0003754903,0.0004446636,0.0003060693,0.0006095018,0.0005793244,0.02352346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798954,0.00025370382,0.00031580575,0.000525052,0.0005415668,0.0003742601],"domain_scores_gemma":[0.9969236,0.00086344854,0.00045135495,0.00091224996,0.00063382054,0.0002154844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182649,0.0008213589,0.0007121979,0.0011376386,0.0012879095,0.0025944717,0.0009806878,0.0010298402,0.0041809194],"category_scores_gemma":[0.0036128913,0.0005068262,0.0008693827,0.0011199713,0.0026432164,0.004005259,0.0018937167,0.0015392973,0.001843326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017789987,0.000066530294,0.001282185,0.00019186169,0.000026122405,0.00086266163,0.0011643094,0.0015640095,0.016028512,0.9166179,0.0024659927,0.05955197],"study_design_scores_gemma":[0.000036984882,0.00014181594,0.0006422414,0.00007070132,0.00005409661,0.0016886091,0.00025116667,0.0105266115,0.019475928,0.9249534,0.042100165,0.00005829191],"about_ca_topic_score_codex":0.00036003703,"about_ca_topic_score_gemma":0.00042117023,"teacher_disagreement_score":0.0041809194,"about_ca_system_score_codex":0.0006032009,"about_ca_system_score_gemma":0.000648123,"threshold_uncertainty_score":0.013986528},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.035633509501549594,"score_gpt":0.30527993390190744,"score_spread":0.26964642440035785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091969952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20956105,0.00019228576,0.78395987,0.00045221715,0.00003716232,0.000072091556,0.00006116709,0.00017282851,0.0054913084],"genre_scores_gemma":[0.9447655,0.00019459713,0.051825173,0.00007128674,0.000022760245,0.0001222946,0.00009300489,0.00004116352,0.0028642374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991027,0.0003069184,0.000043063166,0.00015109222,0.00020203338,0.00019415728],"domain_scores_gemma":[0.99724233,0.0017596143,0.00031825432,0.00027560454,0.00023011226,0.00017408756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360049,0.00054469774,0.0007166595,0.00052015524,0.00078961573,0.0009861882,0.0009095047,0.0008086494,0.001173256],"category_scores_gemma":[0.004671213,0.00035706765,0.000605623,0.00050874247,0.0018884932,0.0017845214,0.003090679,0.0008122071,0.00024555813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003226356,0.000052638883,0.0025134855,0.0001025206,0.00005400942,0.000832185,0.0003379622,0.7980113,0.0069247596,0.1796085,0.0007593446,0.010480635],"study_design_scores_gemma":[0.00004366293,0.00006156903,0.00016223676,0.0000073707697,0.000007988101,0.00005872437,0.0001054786,0.9213091,0.0014531795,0.076175846,0.00060635305,0.000008453869],"about_ca_topic_score_codex":0.0022328503,"about_ca_topic_score_gemma":0.001070181,"teacher_disagreement_score":0.0022328503,"about_ca_system_score_codex":0.0007720289,"about_ca_system_score_gemma":0.0005269726,"threshold_uncertainty_score":0.0056014657},"labels":[],"label_agreement":null},{"id":"W2096151535","doi":"10.1142/s0129054101000485","title":"EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE","year":2001,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; McMaster University; National Aeronautics and Space Administration","keywords":"Computer science; Dynamic priority scheduling; Rate-monotonic scheduling; Scheduling (production processes); Gang scheduling; Fair-share scheduling; Two-level scheduling; Distributed computing; Multiprocessor scheduling; Workload; Bin packing problem; Earliest deadline first scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Bin; Quality of service","score_opus":0.02467930034830723,"score_gpt":0.29136593413513984,"score_spread":0.2666866337868326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096151535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08621289,0.0004987198,0.9045466,0.00022361834,0.00013208552,0.00015319354,0.000097564625,0.0019372978,0.0061979666],"genre_scores_gemma":[0.74608445,0.00043466513,0.24812025,0.00010531072,0.00010119406,0.00017747092,0.0002783846,0.0001964705,0.0045017325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992275,0.00017747885,0.000043352433,0.00008002704,0.00029566116,0.00017600687],"domain_scores_gemma":[0.99897385,0.00032023757,0.00008875113,0.00026171224,0.00021527636,0.00014020689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011149468,0.0004647368,0.00090093113,0.001029442,0.0011886933,0.0012040862,0.0012044039,0.00059258373,0.0018149578],"category_scores_gemma":[0.0022675812,0.00037100734,0.0005682249,0.0017041503,0.0005075705,0.0014926475,0.001841602,0.0006389286,0.00070412445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001349429,0.0005049072,0.0022843883,0.00030625952,0.0001067274,0.00039692596,0.0003379061,0.53665304,0.047302287,0.087274626,0.009669029,0.31381452],"study_design_scores_gemma":[0.00007194663,0.00012388645,0.00028085947,0.000007243112,0.000015075556,0.000119701224,0.000058827343,0.9436712,0.009059363,0.03902919,0.0075412523,0.000021334665],"about_ca_topic_score_codex":0.0014790108,"about_ca_topic_score_gemma":0.0018538021,"teacher_disagreement_score":0.0018149578,"about_ca_system_score_codex":0.00058122765,"about_ca_system_score_gemma":0.0011824893,"threshold_uncertainty_score":0.006071627},"labels":[],"label_agreement":null},{"id":"W2096361394","doi":"10.1142/s0129054114400267","title":"ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Queen's University","funders":"Russian Foundation for Basic Research","keywords":"Bijection, injection and surjection; Abelian group; Connection (principal bundle); Combinatorics on words; Mathematics; Alphabet; Combinatorics; Lattice (music); Word (group theory); Discrete mathematics; Bijection; Geometry; Linguistics","score_opus":0.017819204113933944,"score_gpt":0.28490041943164074,"score_spread":0.2670812153177068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096361394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77875364,0.0014461686,0.1854628,0.0014284952,0.0001893836,0.00010681281,0.00057076,0.00046239854,0.031579535],"genre_scores_gemma":[0.9269978,0.00040058806,0.067570366,0.00016744412,0.00014606211,0.00014273956,0.00031893622,0.0001233716,0.0041327314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756384,0.0005887464,0.00024808943,0.0006954277,0.0005943375,0.00030960087],"domain_scores_gemma":[0.98439366,0.0107885925,0.0019248166,0.0010562678,0.0011649845,0.00067153206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024676425,0.0005096948,0.0008432046,0.0025517985,0.0026832626,0.003302904,0.0018235085,0.0015439241,0.0076636947],"category_scores_gemma":[0.0119381,0.00042880277,0.00094659755,0.0019178815,0.00499321,0.006987588,0.0020740752,0.001295784,0.0007838659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023093361,0.000063903106,0.003272138,0.0002264121,0.000027947644,0.00040799796,0.00083833106,0.0030255911,0.0052776053,0.96831256,0.0007864067,0.017530078],"study_design_scores_gemma":[0.000030923464,0.000085443586,0.0012208377,0.00006206687,0.000036862024,0.0005017375,0.0002595063,0.013484122,0.00728573,0.97179675,0.0051885527,0.000047449197],"about_ca_topic_score_codex":0.0003577174,"about_ca_topic_score_gemma":0.0002788882,"teacher_disagreement_score":0.0076636947,"about_ca_system_score_codex":0.0014396878,"about_ca_system_score_gemma":0.0008011536,"threshold_uncertainty_score":0.025637627},"labels":[],"label_agreement":null},{"id":"W2097880459","doi":"10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Finite-state machine; State (computer science); Turing machine; Encoding (memory); Mathematics; Time hierarchy theorem; Computable function; Deterministic finite automaton; Computational complexity theory; Finite state; Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Universal Turing machine; Computation; Artificial intelligence","score_opus":0.03892250258857448,"score_gpt":0.3235433376829667,"score_spread":0.28462083509439223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097880459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23803918,0.0033015173,0.67784756,0.005263126,0.0002080777,0.00012658956,0.0010762943,0.0010767815,0.07306079],"genre_scores_gemma":[0.9272112,0.0009868463,0.06598047,0.00033082883,0.00040071277,0.00021200808,0.0004695461,0.00012806852,0.0042803884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976279,0.00044440586,0.00019526233,0.00042289373,0.0010039675,0.00030560757],"domain_scores_gemma":[0.9837605,0.0121138,0.0005525617,0.0018886332,0.0009838827,0.0007006291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019181719,0.00043551868,0.0008121251,0.001672986,0.0013630722,0.0032243885,0.0012244694,0.0014558024,0.003944384],"category_scores_gemma":[0.010401824,0.00040874234,0.0011512432,0.00148097,0.004357621,0.009095925,0.0023237152,0.00419923,0.00047867015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146810535,0.000012324664,0.00019651276,0.000042271895,0.000003919002,0.000028014112,0.00012664364,0.0023431503,0.0010415147,0.9926091,0.00036254598,0.0032193346],"study_design_scores_gemma":[0.0000063574153,0.000013076231,0.00025875916,0.000014318024,0.000005750889,0.00003909739,0.000023863817,0.019467903,0.00060681603,0.9782525,0.0012978439,0.000013821938],"about_ca_topic_score_codex":0.00089070265,"about_ca_topic_score_gemma":0.0007807498,"teacher_disagreement_score":0.003944384,"about_ca_system_score_codex":0.0026365821,"about_ca_system_score_gemma":0.0008541022,"threshold_uncertainty_score":0.019129813},"labels":[],"label_agreement":null},{"id":"W2098402986","doi":"10.1142/s0129054105003091","title":"FORMAL MODELLING OF VIRAL GENE COMPRESSION","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Genome; sort; Gene; Computer science; Computational biology; Formal language; Human genome; Biology; Theoretical computer science; Artificial intelligence; Genetics; Programming language; Information retrieval","score_opus":0.028339105833077364,"score_gpt":0.297394017972588,"score_spread":0.26905491213951066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098402986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030114755,0.0006557678,0.94463766,0.0015416851,0.00010307121,0.00008922818,0.00032775087,0.0003158753,0.022214161],"genre_scores_gemma":[0.6511424,0.0014514123,0.32871643,0.0004956817,0.00024871228,0.0005618792,0.0008193159,0.00027731655,0.016286802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866176,0.0004399264,0.00010602246,0.0001816442,0.0004502005,0.00016035838],"domain_scores_gemma":[0.99579346,0.0026278615,0.00038446006,0.00057904306,0.0004369979,0.00017813749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987571,0.000590783,0.0005144758,0.0013102107,0.0011947094,0.0033543601,0.0019554957,0.0016237367,0.003698436],"category_scores_gemma":[0.00708435,0.00045565024,0.0015991331,0.0010178079,0.0046457625,0.004221986,0.002012626,0.0017063876,0.000676901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001215469,0.0000118856115,0.00013788872,0.000025777113,0.0000052374226,0.000086139415,0.00018029932,0.03204,0.0007346141,0.96460366,0.0002639093,0.001898545],"study_design_scores_gemma":[0.000018922936,0.000016644324,0.000060364102,0.000023783214,0.000008454309,0.000114669194,0.00007195469,0.18067409,0.0008155693,0.8117807,0.0063978843,0.000016951913],"about_ca_topic_score_codex":0.0038884417,"about_ca_topic_score_gemma":0.0030803208,"teacher_disagreement_score":0.0038884417,"about_ca_system_score_codex":0.0027709603,"about_ca_system_score_gemma":0.001689417,"threshold_uncertainty_score":0.020104825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","score_opus":0.015434950500011336,"score_gpt":0.36066984633973614,"score_spread":0.34523489583972483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099378738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01031982,0.00055424706,0.981185,0.00049660093,0.00004460609,0.00008423526,0.00012641701,0.0004248814,0.006764083],"genre_scores_gemma":[0.35637322,0.0014234941,0.63010955,0.0005098231,0.00022098522,0.0010495961,0.00059658755,0.0007785537,0.008938221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962196,0.001122743,0.00048409475,0.00092283543,0.00094085536,0.00030999264],"domain_scores_gemma":[0.9921968,0.005465785,0.0006559805,0.00095988455,0.0005077651,0.00021385895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038373875,0.0010487854,0.0007021825,0.0012885659,0.0011894521,0.0030111794,0.0029352645,0.001465676,0.004387895],"category_scores_gemma":[0.009299863,0.0012811195,0.0023914704,0.0015716943,0.007583271,0.0086564375,0.002874356,0.004615746,0.0010977524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012808527,0.000016355425,0.00011157394,0.00010022277,0.000005892722,0.000040180374,0.00029775136,0.004798805,0.0012840074,0.98389155,0.00041312474,0.0090278005],"study_design_scores_gemma":[0.000015251311,0.000021677683,0.000038086102,0.00005441013,0.000013181614,0.00015824115,0.00009775991,0.024207346,0.004993729,0.96111125,0.009261652,0.00002741134],"about_ca_topic_score_codex":0.0009092145,"about_ca_topic_score_gemma":0.00070232403,"teacher_disagreement_score":0.004387895,"about_ca_system_score_codex":0.002487294,"about_ca_system_score_gemma":0.0015933955,"threshold_uncertainty_score":0.020294309},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020391253009062395,"score_gpt":0.30380964273272787,"score_spread":0.28341838972366545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099641843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027879829,0.0011018544,0.9540546,0.0010401723,0.00031979702,0.00018442392,0.00012869429,0.0008201932,0.014470411],"genre_scores_gemma":[0.44940686,0.0010867392,0.5369763,0.0004263054,0.00026599114,0.00041568905,0.000269596,0.00023115517,0.010921344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849236,0.00041859102,0.000070553564,0.00013167984,0.0007236572,0.0001630831],"domain_scores_gemma":[0.99805826,0.0009216173,0.00012858154,0.0005356042,0.00028922432,0.00006662299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010171104,0.0007079051,0.00069253444,0.000677242,0.0007951304,0.0016251853,0.0018856404,0.0013577498,0.007853623],"category_scores_gemma":[0.004244192,0.0003551385,0.0006276012,0.0006514641,0.0015700833,0.0026524009,0.0014699391,0.0017497919,0.0012232799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013103819,0.00011997707,0.0001540495,0.00025469973,0.000030221416,0.000080449834,0.00009880326,0.044382654,0.013823489,0.86768717,0.003092615,0.07014473],"study_design_scores_gemma":[0.00017961167,0.0001874157,0.00026205674,0.000059908398,0.00004355321,0.00019196648,0.00003525876,0.4981947,0.034259133,0.4431403,0.023392238,0.000053887925],"about_ca_topic_score_codex":0.0005023372,"about_ca_topic_score_gemma":0.0012309537,"teacher_disagreement_score":0.007853623,"about_ca_system_score_codex":0.0012588468,"about_ca_system_score_gemma":0.0010737436,"threshold_uncertainty_score":0.026273012},"labels":[],"label_agreement":null},{"id":"W2103582037","doi":"10.1142/s0129054107005224","title":"INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"","keywords":"Intramolecular force; Closure (psychology); Recombination; Computer science; Molecular evolution; Algorithm; Biological system; Gene; Chemistry; Biology; Genetics; Stereochemistry; Genome","score_opus":0.014222193630403395,"score_gpt":0.3394265452310127,"score_spread":0.3252043516006093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103582037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22720799,0.0006761058,0.71959126,0.0007683372,0.00018917685,0.000106999345,0.00006114777,0.0004489485,0.050950043],"genre_scores_gemma":[0.9122559,0.00040432834,0.074071966,0.00033277879,0.000074782496,0.0001189107,0.00007947401,0.00015257286,0.012509322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946326,0.00012633795,0.000024970115,0.00014309658,0.00014835651,0.00009393762],"domain_scores_gemma":[0.99935836,0.0002715918,0.00008704371,0.00018848333,0.000044936733,0.000049544808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894942,0.0003140844,0.00046867397,0.00022974162,0.00045455503,0.0011118758,0.0012943594,0.0012413674,0.0023859423],"category_scores_gemma":[0.0015056381,0.00018429874,0.00090035016,0.00018716621,0.0015269811,0.0020771686,0.0011306055,0.0013564806,0.00058453984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054547447,0.00007414597,0.00032164512,0.000081283055,0.00001694751,0.00038540218,0.00030240638,0.028409336,0.062008195,0.8939587,0.00047346452,0.013913899],"study_design_scores_gemma":[0.00008734218,0.0003840257,0.000555888,0.000045320347,0.000049449904,0.0018223866,0.0003860114,0.48713127,0.07571731,0.40842864,0.025296655,0.00009571005],"about_ca_topic_score_codex":0.00037981645,"about_ca_topic_score_gemma":0.00020533243,"teacher_disagreement_score":0.0023859423,"about_ca_system_score_codex":0.0004908588,"about_ca_system_score_gemma":0.00041924109,"threshold_uncertainty_score":0.007981777},"labels":[],"label_agreement":null},{"id":"W2105159972","doi":"10.1142/s0129054114500129","title":"EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Security token; Node (physics); Computer science; Grid; Port (circuit theory); Degree (music); Traverse; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Geography; Engineering; Geometry; Physics","score_opus":0.020309873665442287,"score_gpt":0.2950705856064975,"score_spread":0.2747607119410552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105159972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15092146,0.0004475221,0.8383511,0.00041731395,0.000058555353,0.00007441721,0.00026613937,0.0018885504,0.007574982],"genre_scores_gemma":[0.7791119,0.00015091425,0.21595539,0.00004794327,0.000012000517,0.0001268567,0.00025088756,0.00009439578,0.004249678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963295,0.00008977954,0.00002782782,0.00006681515,0.000061906336,0.00012067674],"domain_scores_gemma":[0.9993919,0.00026240796,0.00006597442,0.00016922905,0.000049304006,0.000061097126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003780147,0.00035997166,0.00075373414,0.0002768829,0.0004991481,0.00071983784,0.0010469311,0.0005543306,0.0023083163],"category_scores_gemma":[0.0015529017,0.00031090557,0.00054968713,0.00063730206,0.00060399366,0.0013508718,0.002125305,0.00039174478,0.00052744546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008796258,0.000066784574,0.0023757836,0.00017234887,0.000046781082,0.0003500171,0.0002238114,0.8840099,0.006753909,0.027721487,0.0033899064,0.07400959],"study_design_scores_gemma":[0.000036191876,0.00004021755,0.00017562468,0.000006101249,0.000006296365,0.00006157896,0.000036973583,0.98652864,0.0012376944,0.010643818,0.001218895,0.000007885279],"about_ca_topic_score_codex":0.0034220307,"about_ca_topic_score_gemma":0.0036588449,"teacher_disagreement_score":0.0034220307,"about_ca_system_score_codex":0.0005636608,"about_ca_system_score_gemma":0.0011007913,"threshold_uncertainty_score":0.0077220798},"labels":[],"label_agreement":null},{"id":"W2111476730","doi":"10.1142/s0129054113400248","title":"GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Generosity; Diligence; Wife; Computer science; Friendship; Sociology; Conversation; Law; Psychology; Political science; Social science","score_opus":0.012607172487750945,"score_gpt":0.2786848954411714,"score_spread":0.26607772295342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111476730","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010794055,0.055419013,0.009349409,0.6874209,0.17263317,0.00011159367,0.0007208224,0.0012739846,0.062277116],"genre_scores_gemma":[0.071122184,0.015126578,0.0051315436,0.116615936,0.029144133,0.00013475881,0.0010312004,0.0009464217,0.7607473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900717,0.00019155277,0.00004803584,0.0003138556,0.00029384717,0.00014568772],"domain_scores_gemma":[0.9971771,0.00031686467,0.00012614696,0.00012421102,0.0009776092,0.0012781002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015695295,0.0007614183,0.0006954203,0.00093238323,0.0039008618,0.0033897948,0.00051152357,0.0016970517,0.027521325],"category_scores_gemma":[0.0048783356,0.00027768605,0.00046374905,0.0009493107,0.0016745405,0.0031329705,0.0021488143,0.0041879695,0.015285188],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047774585,0.0000133344865,0.0006643987,0.00005830094,0.000008645569,0.00016860012,0.00072938576,0.00004813207,0.000561473,0.007257067,0.95848864,0.031954207],"study_design_scores_gemma":[0.0000040215873,0.000017864117,0.0006089041,0.000028730205,0.000003584393,0.00015315096,0.0006345486,0.0000990754,0.0002791126,0.0018235011,0.9963313,0.000016110804],"about_ca_topic_score_codex":0.0028160736,"about_ca_topic_score_gemma":0.0057339156,"teacher_disagreement_score":0.027521325,"about_ca_system_score_codex":0.002300755,"about_ca_system_score_gemma":0.002455218,"threshold_uncertainty_score":0.09206796},"labels":[],"label_agreement":null},{"id":"W2119388436","doi":"10.1142/s0129054107005479","title":"SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Programming language; Synchronization (alternating current); Object (grammar); Object-oriented programming; Inheritance (genetic algorithm); Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.01770261419507057,"score_gpt":0.3274741712441289,"score_spread":0.30977155704905834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119388436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524488,0.000595131,0.98294365,0.0007360555,0.00025712,0.00017755709,0.00016971449,0.00087487063,0.009721476],"genre_scores_gemma":[0.17322822,0.0016737875,0.81082094,0.0012564276,0.00056472607,0.0010159599,0.00058917404,0.00089127786,0.009959621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925619,0.0026298612,0.0014172649,0.0010007778,0.0019208263,0.00046936137],"domain_scores_gemma":[0.98981595,0.005643435,0.0010754338,0.0013500378,0.00183505,0.0002801528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065850317,0.0011147212,0.0009895321,0.0019568363,0.0020179122,0.0032239624,0.0017664641,0.0017273582,0.0036361231],"category_scores_gemma":[0.011575889,0.0010196359,0.0014887636,0.002884893,0.005996688,0.009514433,0.0032630975,0.0037378396,0.0014948637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001902152,0.0000069376365,0.00012156433,0.00010179723,0.000008601687,0.00012794416,0.000490382,0.0016123536,0.00072775903,0.9849023,0.001697438,0.010183909],"study_design_scores_gemma":[0.000026778078,0.00002980148,0.00006899695,0.00013366394,0.00002677052,0.0002588019,0.00021440643,0.017954633,0.0039283317,0.8988755,0.07844331,0.000039156537],"about_ca_topic_score_codex":0.0014199567,"about_ca_topic_score_gemma":0.00097290764,"teacher_disagreement_score":0.0065850317,"about_ca_system_score_codex":0.0019166077,"about_ca_system_score_gemma":0.002341186,"threshold_uncertainty_score":0.034825385},"labels":[],"label_agreement":null},{"id":"W2122692551","doi":"10.1142/s0129054112400394","title":"RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología; McMaster University","keywords":"Preference; Computer science; Leader election; Bandwidth (computing); Theoretical computer science; Mathematics; Statistics; Computer network","score_opus":0.03817242970142039,"score_gpt":0.3004254805165874,"score_spread":0.26225305081516703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122692551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1604982,0.0000804677,0.8370399,0.00015081925,0.00002264928,0.000093848124,0.000053791442,0.00038265702,0.0016776812],"genre_scores_gemma":[0.86715233,0.000054650034,0.13111007,0.00004150987,0.000014830626,0.00009855373,0.00007170826,0.000028499591,0.0014278792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988996,0.00046428887,0.00004853922,0.00016389473,0.00025602838,0.00016758211],"domain_scores_gemma":[0.99779546,0.001182818,0.00032270688,0.0002648357,0.00027076574,0.0001634493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016659708,0.00023497311,0.00069111394,0.00039132521,0.00081799785,0.0006230355,0.0011221691,0.000560285,0.0007882708],"category_scores_gemma":[0.0042535346,0.00022305964,0.00032723218,0.0006866794,0.00066252216,0.0009345769,0.0008166303,0.0004737606,0.00016902901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003461612,0.00013345244,0.0015935453,0.000068958645,0.000047581532,0.00020428654,0.00024723084,0.879334,0.0077172634,0.05683045,0.0010990772,0.05237799],"study_design_scores_gemma":[0.000030615865,0.00004422716,0.00012057196,0.0000019492825,0.0000054876095,0.000033969987,0.00002366316,0.9856494,0.0011731595,0.012575245,0.00033457048,0.0000070993815],"about_ca_topic_score_codex":0.001785099,"about_ca_topic_score_gemma":0.0020104102,"teacher_disagreement_score":0.001785099,"about_ca_system_score_codex":0.00067048566,"about_ca_system_score_gemma":0.0011302319,"threshold_uncertainty_score":0.00881058},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012182284036929059,"score_gpt":0.2975188154901351,"score_spread":0.28533653145320603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131225295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010515453,0.06202008,0.8258931,0.013479871,0.0011083507,0.00011779719,0.00041806084,0.00027256273,0.0861747],"genre_scores_gemma":[0.49225998,0.06829939,0.4092544,0.0042465026,0.006260126,0.00058965344,0.00078439066,0.00023173414,0.01807389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944675,0.0019146441,0.00047558808,0.0011277478,0.0017645502,0.0002499857],"domain_scores_gemma":[0.9855414,0.010210747,0.00052457914,0.0015130839,0.0018218462,0.00038836186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047834483,0.001075572,0.0014609492,0.0060526463,0.0021081977,0.0043942467,0.0020739234,0.0033424303,0.0046339016],"category_scores_gemma":[0.020461181,0.00064650393,0.00153541,0.0074911383,0.0071182833,0.009331764,0.0049995584,0.0053633265,0.0012271386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114097065,0.000013190922,0.00033779533,0.00016404434,0.00001966392,0.00006535141,0.00013741285,0.0032596155,0.00018194351,0.9621615,0.0020187597,0.03162927],"study_design_scores_gemma":[0.0000041973676,0.000017127228,0.0001797725,0.00007064635,0.000010018006,0.00018129515,0.00005746433,0.010784242,0.0002552031,0.97042364,0.018001283,0.000015083636],"about_ca_topic_score_codex":0.0019987938,"about_ca_topic_score_gemma":0.0006875202,"teacher_disagreement_score":0.0060526463,"about_ca_system_score_codex":0.003916373,"about_ca_system_score_gemma":0.001480769,"threshold_uncertainty_score":0.028415382},"labels":[],"label_agreement":null},{"id":"W2134525515","doi":"10.1142/s0129054107004863","title":"IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Range (aeronautics); Set (abstract data type); Power consumption; Computer science; Mathematics; Simple (philosophy); Mathematical optimization; Power (physics)","score_opus":0.03364534168025078,"score_gpt":0.3541425856134184,"score_spread":0.3204972439331676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134525515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009334166,0.00027180515,0.98496544,0.00023371795,0.00006730101,0.00011082481,0.000107820386,0.0013912164,0.0035176752],"genre_scores_gemma":[0.08620926,0.00019580315,0.90885854,0.000101201906,0.00006228652,0.0003402732,0.00051699625,0.000191176,0.0035244701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929905,0.00017627784,0.000031337222,0.00016176519,0.00018741607,0.00014422518],"domain_scores_gemma":[0.9993623,0.00032578153,0.00005214175,0.00008123857,0.00013661952,0.0000418751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057468016,0.0011347651,0.0013399152,0.00095496734,0.0007214834,0.0011038124,0.0026409922,0.0014935745,0.009491616],"category_scores_gemma":[0.0020377531,0.00045807794,0.00074910047,0.001379469,0.00042404703,0.0018877068,0.001622885,0.001801053,0.0019623523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005135785,0.0003728799,0.0006352508,0.0004937946,0.000059668688,0.0002806652,0.00029853714,0.45498133,0.009728142,0.03597818,0.020105649,0.47655225],"study_design_scores_gemma":[0.0001748799,0.00011761548,0.00017871558,0.00002304184,0.00002144637,0.00015893157,0.00006040669,0.97244793,0.0018939067,0.018051025,0.006849569,0.000022478625],"about_ca_topic_score_codex":0.0031734956,"about_ca_topic_score_gemma":0.00306972,"teacher_disagreement_score":0.009491616,"about_ca_system_score_codex":0.000724804,"about_ca_system_score_gemma":0.001326079,"threshold_uncertainty_score":0.031752646},"labels":[],"label_agreement":null},{"id":"W2141618567","doi":"10.1142/s012905410500311x","title":"AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Sequence (biology); Sequence database; String (physics); Computer science; Protein sequencing; Database; Computational biology; Peptide sequence; Biology; Genetics; Mathematics; Data structure; Programming language","score_opus":0.028705751240357107,"score_gpt":0.34873401197349724,"score_spread":0.3200282607331401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141618567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010171219,0.00014089941,0.98639375,0.000121191435,0.00005795314,0.000100591846,0.00016376338,0.0017018535,0.0011488239],"genre_scores_gemma":[0.12603074,0.0002744564,0.869216,0.00016892665,0.000044801895,0.00033696907,0.0006526257,0.00016662075,0.0031088984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984871,0.00024120067,0.00025763758,0.00051628327,0.0004085286,0.000089319095],"domain_scores_gemma":[0.9977272,0.0011534459,0.000167403,0.00048221188,0.00038615565,0.00008360612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010332173,0.0008952653,0.0011507679,0.0017377315,0.0011460312,0.0015876219,0.002884106,0.0015973928,0.004343151],"category_scores_gemma":[0.004936732,0.0006760113,0.0011808635,0.0019057083,0.0011381129,0.0036824048,0.0020287896,0.0010630363,0.0019280307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061140844,0.0003861032,0.0037594372,0.00066992437,0.00024408767,0.00069331616,0.00059700536,0.14846542,0.034046397,0.11834992,0.0058442433,0.68633276],"study_design_scores_gemma":[0.000038979906,0.00020523548,0.0003012991,0.000034254488,0.000077477336,0.0005293635,0.00009952045,0.86805445,0.02209585,0.09718265,0.011335456,0.0000454473],"about_ca_topic_score_codex":0.0020284168,"about_ca_topic_score_gemma":0.0020706584,"teacher_disagreement_score":0.004343151,"about_ca_system_score_codex":0.0008391232,"about_ca_system_score_gemma":0.001241377,"threshold_uncertainty_score":0.014529288},"labels":[],"label_agreement":null},{"id":"W2142901839","doi":"10.1142/s0129054115500197","title":"Automatic Sets of Rational Numbers","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closure (psychology); Rational number; Set (abstract data type); Set theory; Rational point; Algebra over a field","score_opus":0.027225692747738194,"score_gpt":0.31808074829621114,"score_spread":0.29085505554847296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142901839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30805027,0.0021180278,0.4608425,0.0027976467,0.00082553213,0.00022656801,0.0013245221,0.0021202913,0.22169462],"genre_scores_gemma":[0.9020367,0.00057947525,0.08062494,0.00046064312,0.0005680605,0.00025914525,0.00091390754,0.00031631035,0.014240816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961146,0.0007152745,0.00026465196,0.0008589775,0.0017050792,0.00034132556],"domain_scores_gemma":[0.99409544,0.0032347364,0.00058056193,0.0008668772,0.0009433476,0.0002791132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014454908,0.00058668206,0.0006828874,0.0022635886,0.0024024495,0.004529107,0.0012813489,0.00093978766,0.0064371387],"category_scores_gemma":[0.007835979,0.00061257096,0.0014326505,0.0011567615,0.0052548894,0.009751416,0.0029710806,0.0023445417,0.001069571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024653695,0.000013715306,0.00016701334,0.000039011324,0.000005814819,0.00007266864,0.00021079309,0.0005872151,0.0013174845,0.9921182,0.0005402142,0.004903314],"study_design_scores_gemma":[0.000016885744,0.000015056438,0.00017387324,0.000023418686,0.000011439969,0.00017181889,0.000075982636,0.006210323,0.002368026,0.9816442,0.009263765,0.000025288118],"about_ca_topic_score_codex":0.00062391703,"about_ca_topic_score_gemma":0.0005220894,"teacher_disagreement_score":0.0064371387,"about_ca_system_score_codex":0.001561402,"about_ca_system_score_gemma":0.0011491681,"threshold_uncertainty_score":0.021534443},"labels":[],"label_agreement":null},{"id":"W2144782101","doi":"10.1142/s0129054111008647","title":"OVERLAP-FREE LANGUAGES AND SOLID CODES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Undecidable problem; Decidability; Prefix code; Property (philosophy); Computer science; Linear code; Mathematics; Prime (order theory); Regular language; Discrete mathematics; Block code; Algorithm; Theoretical computer science; Combinatorics; Automaton","score_opus":0.018678284295213607,"score_gpt":0.30702943961086426,"score_spread":0.28835115531565064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144782101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14083245,0.00034746923,0.843371,0.00068865274,0.000064834094,0.000098848686,0.00024774316,0.00068632193,0.013662613],"genre_scores_gemma":[0.7744266,0.00032777945,0.21287003,0.00025295204,0.000104109036,0.0002548645,0.000569523,0.00023356387,0.010960661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808276,0.00035337146,0.00016790305,0.00056088256,0.0005090238,0.00032614046],"domain_scores_gemma":[0.99442554,0.0033530344,0.00061645516,0.0007259587,0.0006085955,0.00027042936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011212251,0.0004646099,0.0004896118,0.0007673363,0.0011794621,0.001832287,0.00080545014,0.0007839219,0.004144405],"category_scores_gemma":[0.0050390246,0.00046787676,0.0009608434,0.0009439835,0.0040189284,0.004196051,0.0021969394,0.0019417123,0.0006139559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007360492,0.000022365042,0.0004345663,0.00008241583,0.0000094357165,0.0001524725,0.00058866275,0.007979824,0.0036976694,0.9714026,0.0007103483,0.014846032],"study_design_scores_gemma":[0.000025541503,0.00003444043,0.00012668046,0.000024202674,0.0000112305315,0.00021981972,0.0002007815,0.027909694,0.005395259,0.9576783,0.008353468,0.00002052754],"about_ca_topic_score_codex":0.0013626497,"about_ca_topic_score_gemma":0.0010748826,"teacher_disagreement_score":0.004144405,"about_ca_system_score_codex":0.0011183278,"about_ca_system_score_gemma":0.0013641196,"threshold_uncertainty_score":0.013864398},"labels":[],"label_agreement":null},{"id":"W2146051038","doi":"10.1142/s0129054108005954","title":"COMPLEXITY, INFORMATION, ENERGY","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Connection (principal bundle); Computer science; Energy (signal processing); Theoretical computer science; Mathematics","score_opus":0.034401421306920775,"score_gpt":0.28782088795968747,"score_spread":0.2534194666527667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146051038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054863665,0.10190996,0.38643625,0.10170509,0.003965883,0.00011980434,0.0007776129,0.00020949874,0.35001236],"genre_scores_gemma":[0.86846524,0.041328654,0.059551764,0.00800156,0.0049290545,0.00030105558,0.0002694327,0.000115818366,0.017037477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988231,0.00041669767,0.000054594188,0.00022518162,0.00034550624,0.00013482547],"domain_scores_gemma":[0.9938585,0.0047756545,0.00039053435,0.00038934514,0.00035962413,0.00022637493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015259534,0.0006758113,0.00080632296,0.0024293743,0.0013809314,0.0043777805,0.0012537637,0.0025878057,0.008349088],"category_scores_gemma":[0.0062008956,0.00027580743,0.00068338355,0.0025197016,0.009073819,0.012222204,0.002555142,0.0037859627,0.00066323957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042314878,0.000005634378,0.000104907216,0.000052810206,0.0000049822556,0.000025019252,0.00005001682,0.00038744885,0.000091974835,0.9951788,0.0010776821,0.0030165196],"study_design_scores_gemma":[0.0000017627201,0.0000071292193,0.00013615428,0.000032611617,0.000002984753,0.000053312575,0.000054920667,0.000978678,0.0000749239,0.99115974,0.0074922037,0.000005642404],"about_ca_topic_score_codex":0.0009834152,"about_ca_topic_score_gemma":0.0007643077,"teacher_disagreement_score":0.008349088,"about_ca_system_score_codex":0.002178502,"about_ca_system_score_gemma":0.0006814964,"threshold_uncertainty_score":0.027930498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07281263454795484,"score_gpt":0.35218667728933695,"score_spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146148441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015508206,0.00028449052,0.9747447,0.002088636,0.000049227874,0.00012586672,0.00023797611,0.0007459295,0.0062149144],"genre_scores_gemma":[0.38553876,0.0007629092,0.60514605,0.0005534714,0.00028203064,0.0007573618,0.0011242582,0.000548837,0.0052863304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508023,0.0013338361,0.0006031625,0.00078878243,0.0017751092,0.00041888483],"domain_scores_gemma":[0.97627866,0.01774593,0.0010265103,0.0033861387,0.0012663458,0.00029647746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050982265,0.00071844424,0.00073965365,0.0015790382,0.0015775379,0.0055423505,0.002842976,0.0013747822,0.005610653],"category_scores_gemma":[0.021194624,0.0009729489,0.0024207619,0.0014821402,0.0074990564,0.013116271,0.002773626,0.0048838067,0.00069878786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031409818,0.00004818664,0.00036672957,0.00015914055,0.000014760849,0.000083446415,0.00042329094,0.014217325,0.0015248882,0.96191174,0.0010879847,0.020131204],"study_design_scores_gemma":[0.000025076313,0.000013094358,0.0000835054,0.00003865648,0.000015574944,0.0000748654,0.000098972,0.07288582,0.0037280149,0.9183004,0.0047175763,0.000018392102],"about_ca_topic_score_codex":0.0023115813,"about_ca_topic_score_gemma":0.0028107853,"teacher_disagreement_score":0.005610653,"about_ca_system_score_codex":0.0035000807,"about_ca_system_score_gemma":0.0030214235,"threshold_uncertainty_score":0.02696228},"labels":[],"label_agreement":null},{"id":"W2146441371","doi":"10.1142/s0129054114400103","title":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Monomial; Mathematics; Combinatorics; Upper and lower bounds; Time complexity; Polynomial; State (computer science); PSPACE; Matching (statistics); Discrete mathematics; Constant (computer programming); Regular language; NP; Computational complexity theory; Automaton; Computer science; Algorithm; Turing machine; Theoretical computer science","score_opus":0.029026363745375795,"score_gpt":0.3105459000499086,"score_spread":0.2815195363045328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146441371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75821036,0.00026565685,0.21887776,0.0013838606,0.00009101152,0.00017503057,0.00083399186,0.0012292239,0.01893307],"genre_scores_gemma":[0.95724994,0.00016673045,0.033193685,0.00016859995,0.00007457892,0.00015800422,0.000745241,0.00029148688,0.007951591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645376,0.00054221216,0.0002877538,0.00086836336,0.0010306834,0.0008173151],"domain_scores_gemma":[0.9865031,0.008910816,0.00093195535,0.0024362719,0.0007805402,0.0004372567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176805,0.00044425164,0.0009405777,0.00075141486,0.0014861751,0.0033933953,0.0019187168,0.0010834514,0.007981237],"category_scores_gemma":[0.0104645025,0.00048771323,0.0018522287,0.0009093154,0.002504217,0.005610401,0.0027014923,0.002388545,0.0007846424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019000049,0.00045792933,0.0065648826,0.00058243563,0.00011746984,0.00047416234,0.0013238252,0.17327975,0.051370397,0.6769068,0.0053942595,0.08162808],"study_design_scores_gemma":[0.00008590267,0.0001418603,0.0016738559,0.000023061966,0.000097769276,0.00024331371,0.0001506989,0.36310858,0.032660592,0.59750015,0.004221879,0.000092330505],"about_ca_topic_score_codex":0.0017724625,"about_ca_topic_score_gemma":0.0018128786,"teacher_disagreement_score":0.007981237,"about_ca_system_score_codex":0.0018575275,"about_ca_system_score_gemma":0.0024692512,"threshold_uncertainty_score":0.0266999},"labels":[],"label_agreement":null},{"id":"W2155847630","doi":"10.1142/s0129054102001254","title":"A DYNAMICS RECOMMENDATION SYSTEM BASED ON LOG MINING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University; Chinese Academy of Sciences; University of Saskatchewan; National Science Foundation","keywords":"Computer science; Recommender system; Classifier (UML); Web page; Web mining; Data mining; Information retrieval; Search engine; World Wide Web; Artificial intelligence","score_opus":0.025673810077958128,"score_gpt":0.28154205429292,"score_spread":0.2558682442149619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155847630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06171865,0.0007927329,0.86374754,0.0006288251,0.00029286806,0.00049359567,0.0022164914,0.06398353,0.0061258003],"genre_scores_gemma":[0.48925033,0.0007539584,0.48868605,0.00036021695,0.00029105027,0.00063426304,0.0054950025,0.0005920123,0.013937257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993567,0.000058555823,0.000059597405,0.00019641119,0.00028758377,0.00004117238],"domain_scores_gemma":[0.9988079,0.000295968,0.00010217665,0.0002516406,0.0004260996,0.000116248106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006972851,0.00074690575,0.0013520623,0.001923636,0.00079667225,0.0010993859,0.0018396825,0.000951415,0.003636073],"category_scores_gemma":[0.0023309074,0.0005311896,0.00042663285,0.0012920568,0.00021032542,0.0021887356,0.00069174846,0.0008818796,0.0037380615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001140769,0.00087916385,0.0135721,0.00033744617,0.00026672203,0.0004802627,0.00017314454,0.023715539,0.04759024,0.003790449,0.02906495,0.8789892],"study_design_scores_gemma":[0.00017932343,0.00026814328,0.0063790125,0.000028946304,0.00013381813,0.00045865442,0.000053193708,0.94375515,0.021550538,0.004065261,0.02302665,0.000101290396],"about_ca_topic_score_codex":0.008493917,"about_ca_topic_score_gemma":0.009409411,"teacher_disagreement_score":0.008493917,"about_ca_system_score_codex":0.00049835676,"about_ca_system_score_gemma":0.0007259609,"threshold_uncertainty_score":0.016888976},"labels":[],"label_agreement":null},{"id":"W2163125260","doi":"10.1142/s0129054113400339","title":"UNAMBIGUOUS CONSTRAINED AUTOMATA","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Decidability; Class (philosophy); Automaton; Closure (psychology); Set (abstract data type); Bounded function; Discrete mathematics; Mathematics; Tree automaton; Computer science; Combinatorics; Theoretical computer science; Programming language","score_opus":0.011032883667456058,"score_gpt":0.2731136558638009,"score_spread":0.2620807721963448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163125260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08829412,0.0008049485,0.86348134,0.0008140425,0.00022329878,0.00032153155,0.0016733393,0.002249374,0.042138096],"genre_scores_gemma":[0.81058306,0.0007520307,0.17480117,0.000582156,0.00016269079,0.00045178918,0.0014242008,0.00031092088,0.010932001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972446,0.0004478833,0.00028664063,0.0008587558,0.00080453785,0.0003575867],"domain_scores_gemma":[0.9932313,0.0029447572,0.0008949256,0.0017235639,0.0008910286,0.00031455644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751836,0.0006881305,0.00067492406,0.00068606914,0.0013254117,0.0033582489,0.0016922478,0.0010525394,0.00642074],"category_scores_gemma":[0.007505685,0.00051425764,0.0011604471,0.0010221316,0.0024791062,0.0045308033,0.0025141754,0.0019124355,0.0010436286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010508206,0.00006624574,0.0007850138,0.00016416474,0.000019856312,0.00041350236,0.0004022545,0.01394763,0.009526296,0.95219916,0.001928226,0.020442516],"study_design_scores_gemma":[0.00004540919,0.00006546067,0.000468116,0.00006389849,0.00004740036,0.00045638005,0.00023621,0.06630538,0.0115346005,0.8930016,0.027710719,0.00006474926],"about_ca_topic_score_codex":0.0028671927,"about_ca_topic_score_gemma":0.0034223837,"teacher_disagreement_score":0.00642074,"about_ca_system_score_codex":0.0009609629,"about_ca_system_score_gemma":0.0021728363,"threshold_uncertainty_score":0.021479487},"labels":[],"label_agreement":null},{"id":"W2164666293","doi":"10.1142/s0129054106004364","title":"ERRATA: \"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES\"","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Representation (politics); Non canonical; Mathematics; Algebra over a field; Computer science; Pure mathematics; Linguistics; Philosophy; Biology; Political science","score_opus":0.03642338316837041,"score_gpt":0.38992975772581817,"score_spread":0.35350637455744777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164666293","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026257474,0.002591783,0.035189644,0.2062879,0.72135353,0.000060243347,0.0021487721,0.003834374,0.02590795],"genre_scores_gemma":[0.22214258,0.011150875,0.0638937,0.22689687,0.14292601,0.00062268606,0.008912358,0.008727742,0.31472725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936765,0.0016242155,0.00084243267,0.0008252983,0.0026374348,0.0003941078],"domain_scores_gemma":[0.9794707,0.005905507,0.0009500658,0.0019459906,0.011345673,0.00038208935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038201641,0.0017820667,0.0014966156,0.0018356956,0.0041782307,0.003757132,0.0034258526,0.0051403376,0.029038083],"category_scores_gemma":[0.04217173,0.0010031955,0.0012499016,0.002732054,0.0044603543,0.005672094,0.0021389795,0.008205998,0.016263457],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010573304,0.000012742671,0.00010821142,0.00021045741,0.000018643208,0.00022721176,0.00022777714,0.00014683792,0.000290908,0.02481064,0.961602,0.012238793],"study_design_scores_gemma":[0.00011353682,0.000055894772,0.0011285209,0.0003407461,0.00009933684,0.0012473237,0.0003630319,0.0021949194,0.003907115,0.045009177,0.94540256,0.00013792948],"about_ca_topic_score_codex":0.008030376,"about_ca_topic_score_gemma":0.0052745393,"teacher_disagreement_score":0.029038083,"about_ca_system_score_codex":0.0036544672,"about_ca_system_score_gemma":0.0039649718,"threshold_uncertainty_score":0.09714204},"labels":[],"label_agreement":null},{"id":"W2165734290","doi":"10.1142/s0129054105003145","title":"OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Substitution (logic); Computer science; Generalization; Closure (psychology); Coding (social sciences); Theoretical computer science; Cryptanalysis; Algorithm; Mathematics; Cryptography; Programming language","score_opus":0.016088233679205848,"score_gpt":0.3034733916116786,"score_spread":0.2873851579324727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165734290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350483,0.0024712426,0.9487997,0.0014865833,0.00026516922,0.000072460876,0.0003345286,0.00025119272,0.012814133],"genre_scores_gemma":[0.5528978,0.0070618438,0.41670358,0.0005684975,0.0009948226,0.0005215841,0.0012084938,0.00046312634,0.019580254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00058146304,0.00015756207,0.00030995838,0.00042412494,0.00018435915],"domain_scores_gemma":[0.99168396,0.005806377,0.0008782036,0.00062120636,0.0006353901,0.00037474648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017883809,0.0010249711,0.0007836146,0.0017507726,0.0011450425,0.0020623892,0.0011238974,0.0016402886,0.0066963704],"category_scores_gemma":[0.008485015,0.00033494883,0.0013099432,0.0029949695,0.004017615,0.006221684,0.0022136013,0.0023989275,0.0011587446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000258228,0.000014323758,0.00017079608,0.00005725461,0.000006655444,0.00012711178,0.00011777801,0.012598135,0.0010491699,0.9742321,0.0005580406,0.01104298],"study_design_scores_gemma":[0.0000073987617,0.00004016272,0.00006471252,0.000020246573,0.0000043257505,0.00012920571,0.00005424054,0.041135013,0.00095053785,0.9521983,0.0053798067,0.000016041686],"about_ca_topic_score_codex":0.0014721544,"about_ca_topic_score_gemma":0.00076099037,"teacher_disagreement_score":0.0066963704,"about_ca_system_score_codex":0.0013858151,"about_ca_system_score_gemma":0.0010170116,"threshold_uncertainty_score":0.022401571},"labels":[],"label_agreement":null},{"id":"W2167511304","doi":"10.1142/s0129054109006486","title":"ON SPANNERS OF GEOMETRIC GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Mathematics; Upper and lower bounds; Graph; Discrete mathematics; Geometric graph theory; Graph power; Line graph; Computer science","score_opus":0.015589209680839705,"score_gpt":0.3018274943960976,"score_spread":0.28623828471525786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167511304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30245084,0.003176935,0.64673066,0.0019406433,0.00020633359,0.00035084368,0.0008441317,0.0008653675,0.043434273],"genre_scores_gemma":[0.7692604,0.005577692,0.20307079,0.00068934116,0.0007274217,0.0004627488,0.0027480216,0.00044938453,0.017014198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864274,0.00032951543,0.000078873556,0.0004331161,0.00031014744,0.00020562149],"domain_scores_gemma":[0.995943,0.0028105,0.00042618497,0.00038150107,0.00017300133,0.00026578488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009194744,0.0014626579,0.001290254,0.0013641593,0.0010830732,0.0020320446,0.0016923653,0.0015634402,0.009855168],"category_scores_gemma":[0.0065260683,0.0006713802,0.0012727403,0.0023916468,0.0026513315,0.008280454,0.0037667034,0.0022589893,0.0016009894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040375465,0.00025462385,0.0018145452,0.0008636534,0.000087651046,0.0009423123,0.0008132491,0.22664012,0.011358687,0.66578406,0.0062615667,0.08477572],"study_design_scores_gemma":[0.00004103981,0.00015125799,0.00045398023,0.000082746934,0.00002705665,0.00043993405,0.00025141155,0.14809555,0.003197001,0.8409942,0.006242613,0.000023229039],"about_ca_topic_score_codex":0.0007822672,"about_ca_topic_score_gemma":0.0007969114,"teacher_disagreement_score":0.009855168,"about_ca_system_score_codex":0.0010417983,"about_ca_system_score_gemma":0.0005176009,"threshold_uncertainty_score":0.03296888},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02620600082371652,"score_gpt":0.3086807984164208,"score_spread":0.28247479759270433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168854371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778781,0.00020348668,0.3122821,0.00046957293,0.00003981297,0.00006315156,0.000502984,0.0006286646,0.007932081],"genre_scores_gemma":[0.96566355,0.00011995454,0.030377062,0.00005368302,0.00002298447,0.00010044892,0.00045290796,0.000059599093,0.0031497974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806935,0.00037046144,0.00023798787,0.00050638756,0.00060419075,0.00021166375],"domain_scores_gemma":[0.9944383,0.0035520955,0.000507168,0.0008410027,0.00042628867,0.00023518658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083681924,0.00035989736,0.00071547955,0.00075607933,0.0006161703,0.0027296336,0.0014477838,0.0007222693,0.0034690797],"category_scores_gemma":[0.0058365124,0.00037126773,0.0012443673,0.00073091564,0.0014089221,0.004610156,0.0020554673,0.0014924237,0.00035860908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047913057,0.0001741547,0.0036897091,0.00029363544,0.000108979904,0.00047113138,0.0010474978,0.18397899,0.02699163,0.73768765,0.0010965719,0.043980997],"study_design_scores_gemma":[0.000025305435,0.00008852349,0.0008342102,0.000015984448,0.000062353,0.00013519246,0.00010977011,0.3734566,0.012838097,0.6109838,0.0014137647,0.00003652618],"about_ca_topic_score_codex":0.0013110902,"about_ca_topic_score_gemma":0.0011444739,"teacher_disagreement_score":0.0034690797,"about_ca_system_score_codex":0.0010404295,"about_ca_system_score_gemma":0.0005767219,"threshold_uncertainty_score":0.011605203},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","score_opus":0.041020828804904735,"score_gpt":0.29559549966654275,"score_spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169267790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67782956,0.0005595358,0.2931658,0.001492642,0.00011030466,0.00027086286,0.0011679335,0.0009481279,0.024455244],"genre_scores_gemma":[0.95962113,0.00022532101,0.035039008,0.00006815096,0.00004602336,0.00022595559,0.0006715088,0.00023019186,0.0038727168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563295,0.0008042256,0.0003178159,0.0009132637,0.0014714723,0.0008601541],"domain_scores_gemma":[0.9673524,0.024808945,0.001849733,0.0033910284,0.0018256722,0.0007722439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020091503,0.00062341447,0.00095214596,0.001380884,0.0018221196,0.0056914142,0.0016900115,0.0013598235,0.011622532],"category_scores_gemma":[0.022056995,0.0006251745,0.0018866758,0.0013649423,0.0027901425,0.01293034,0.0033371116,0.0029683276,0.00071822375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018160283,0.00050183694,0.012237429,0.0008018567,0.00025666447,0.0004944705,0.001416153,0.12084978,0.023201939,0.77169836,0.003197071,0.06352846],"study_design_scores_gemma":[0.00009901859,0.0003254789,0.0037953886,0.00006275293,0.000299448,0.0004776261,0.000649473,0.42027918,0.046352178,0.52192926,0.005559968,0.0001701358],"about_ca_topic_score_codex":0.001933558,"about_ca_topic_score_gemma":0.0019284087,"teacher_disagreement_score":0.011622532,"about_ca_system_score_codex":0.0030591208,"about_ca_system_score_gemma":0.0032169553,"threshold_uncertainty_score":0.038881183},"labels":[],"label_agreement":null},{"id":"W2178095809","doi":"10.1142/s0129054115500124","title":"State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Intersection (aeronautics); Upper and lower bounds; Alphabet; Combinatorics; Mathematics; State (computer science); Discrete mathematics; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Binary number; Automaton; Automata theory; Computer science; Arithmetic; Theoretical computer science; Algorithm","score_opus":0.03549565474146355,"score_gpt":0.3102429891193492,"score_spread":0.2747473343778857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178095809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67407954,0.0005064074,0.30596206,0.0018939438,0.00007718099,0.00015621915,0.0013297598,0.0017136509,0.014281224],"genre_scores_gemma":[0.9524801,0.00018444716,0.04307509,0.000118623415,0.000056372537,0.00018867468,0.00090357824,0.00027264046,0.0027205956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631554,0.0004642096,0.00035687606,0.0009821273,0.0009644678,0.00091682695],"domain_scores_gemma":[0.9754322,0.018208642,0.0020208561,0.0023651626,0.0011266124,0.00084646966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017168042,0.00071837334,0.001416048,0.0011574781,0.0018089932,0.0049021365,0.0023563348,0.0011242608,0.006135588],"category_scores_gemma":[0.012127365,0.00079632615,0.002209794,0.0013411867,0.003059432,0.009092084,0.0036206238,0.0035017626,0.0005909762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020483057,0.00056449615,0.015711855,0.0010124808,0.00019972886,0.00053460157,0.0027211546,0.40146127,0.04044217,0.4526996,0.005112898,0.077491455],"study_design_scores_gemma":[0.000042509735,0.00015144433,0.0018608404,0.000047708774,0.00009978092,0.00019461644,0.00024528705,0.6586707,0.03462986,0.30225983,0.0016992702,0.00009808941],"about_ca_topic_score_codex":0.0033168714,"about_ca_topic_score_gemma":0.0035006232,"teacher_disagreement_score":0.006135588,"about_ca_system_score_codex":0.0042160684,"about_ca_system_score_gemma":0.0031350132,"threshold_uncertainty_score":0.030589879},"labels":[],"label_agreement":null},{"id":"W2214007724","doi":"10.1142/s0129054115500288","title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bounded function; Graph; Upper and lower bounds; Shortest path problem; Class (philosophy); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.026783227500746628,"score_gpt":0.3116693806386324,"score_spread":0.2848861531378858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214007724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15882665,0.005050896,0.8133048,0.0014873015,0.00016624326,0.00011855415,0.00021455962,0.0005663029,0.020264717],"genre_scores_gemma":[0.8868368,0.0044758855,0.10276011,0.00022520735,0.00023326071,0.000210418,0.00028837606,0.00017865337,0.0047912938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00020524379,0.000024594972,0.00016053408,0.00016363976,0.00010757806],"domain_scores_gemma":[0.99605113,0.0029958899,0.0004216405,0.00018607793,0.00021172018,0.00013359124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012234015,0.000503143,0.00066875876,0.00094395335,0.00081344804,0.0013251303,0.0010964277,0.0010599676,0.0011607934],"category_scores_gemma":[0.008861914,0.0004379794,0.00044878657,0.0010146401,0.0016348307,0.0025639383,0.0009675163,0.0011980816,0.00021948473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023572703,0.0000746801,0.0013728171,0.00054835255,0.000026658678,0.00021508515,0.00041965497,0.5276824,0.0059273923,0.40505147,0.0045779315,0.053867724],"study_design_scores_gemma":[0.000020265503,0.000064126856,0.00034940013,0.000037758215,0.000019617793,0.00010187643,0.0001433018,0.76974046,0.0012191251,0.22481813,0.0034669894,0.000018943376],"about_ca_topic_score_codex":0.0030600126,"about_ca_topic_score_gemma":0.0020296327,"teacher_disagreement_score":0.0030600126,"about_ca_system_score_codex":0.0014860266,"about_ca_system_score_gemma":0.00090388977,"threshold_uncertainty_score":0.010782003},"labels":[],"label_agreement":null},{"id":"W2219863946","doi":"10.1142/s0129054118500089","title":"On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Universal hashing; Hash chain; Cryptography; Perfect hash function; Integer (computer science); Secrecy; Information-theoretic security; Double hashing","score_opus":0.01575639365929202,"score_gpt":0.28787025731881577,"score_spread":0.2721138636595237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219863946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18074508,0.002979674,0.7737795,0.0030570999,0.00022623791,0.00020089708,0.00035991444,0.00044871774,0.03820282],"genre_scores_gemma":[0.84929883,0.0027633265,0.13475184,0.000678002,0.0006699225,0.0003347551,0.00040554206,0.00015428141,0.01094341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967271,0.0010153034,0.00020608786,0.00070015166,0.00092118065,0.00043012574],"domain_scores_gemma":[0.98967534,0.0067007733,0.00080520735,0.001362127,0.00085069926,0.0006058588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036274455,0.0009834967,0.0014710566,0.0020752333,0.0024739949,0.0019705747,0.0011099803,0.0016015002,0.0041023386],"category_scores_gemma":[0.014967249,0.00060658366,0.0018807361,0.002911388,0.006011731,0.0073107225,0.006060922,0.0034768526,0.00075819483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106168,0.00002843103,0.00039626198,0.0000716808,0.000010475783,0.00012407593,0.00038019987,0.009355797,0.0015269723,0.97544765,0.00071556255,0.011871835],"study_design_scores_gemma":[0.00003129353,0.000102312915,0.0002570185,0.000048448026,0.000023840259,0.00034201657,0.00009933214,0.06051446,0.0020522897,0.93073785,0.0057389284,0.00005215824],"about_ca_topic_score_codex":0.0012714736,"about_ca_topic_score_gemma":0.0004805404,"teacher_disagreement_score":0.0041023386,"about_ca_system_score_codex":0.0022026235,"about_ca_system_score_gemma":0.0013249062,"threshold_uncertainty_score":0.019183993},"labels":[],"label_agreement":null},{"id":"W2234017799","doi":"10.1142/s0129054118500053","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","score_opus":0.03772099834689924,"score_gpt":0.352113442025102,"score_spread":0.31439244367820274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234017799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067161284,0.0017212983,0.9061982,0.0029001322,0.00023495799,0.0007129591,0.00075152965,0.0009790789,0.019340554],"genre_scores_gemma":[0.34741548,0.0015370399,0.6308978,0.0013878664,0.0006770271,0.0013634014,0.0023713533,0.0010453138,0.013304786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934383,0.0025898803,0.00048152983,0.0014075042,0.001241957,0.0008408704],"domain_scores_gemma":[0.9771433,0.017939355,0.0012197614,0.0019891516,0.00085995527,0.0008485119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005718438,0.0033101737,0.0039163395,0.0019499887,0.0032188685,0.0041886456,0.004394998,0.004992386,0.0120998835],"category_scores_gemma":[0.0325278,0.0022775321,0.0027946357,0.005696166,0.003444097,0.014637772,0.006393544,0.005599778,0.0017366622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009890143,0.000888307,0.001980779,0.001337573,0.00023977258,0.0007193901,0.0010990227,0.40476993,0.003115381,0.38903916,0.022801716,0.17301999],"study_design_scores_gemma":[0.00016895703,0.00020146822,0.00037270822,0.00013142395,0.00007313639,0.00037997228,0.00034995173,0.50477135,0.002546978,0.48051375,0.01043066,0.00005969104],"about_ca_topic_score_codex":0.0020300122,"about_ca_topic_score_gemma":0.0020377752,"teacher_disagreement_score":0.0120998835,"about_ca_system_score_codex":0.002244971,"about_ca_system_score_gemma":0.0017025669,"threshold_uncertainty_score":0.04047817},"labels":[],"label_agreement":null},{"id":"W2274293958","doi":"10.1142/s0129054116500313","title":"Exploration of Faulty Hamiltonian Graphs","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Node (physics); Overhead (engineering); Competitive analysis; Situated; Hamiltonian path; Algorithm; Mathematics; Theoretical computer science; Graph; Engineering; Upper and lower bounds; Artificial intelligence","score_opus":0.05308547114641386,"score_gpt":0.3491501009345286,"score_spread":0.2960646297881147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274293958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55812174,0.0008135163,0.43230975,0.0007823604,0.000047818867,0.00007620206,0.0003598969,0.0004046715,0.0070840437],"genre_scores_gemma":[0.92746764,0.0004556145,0.06876537,0.00008146301,0.00002190545,0.00006025783,0.0002753307,0.00007525917,0.0027972353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948895,0.00020291685,0.000019303561,0.0000929528,0.00009514849,0.00010060807],"domain_scores_gemma":[0.9968821,0.0021123057,0.0003634378,0.0003265394,0.00014332816,0.00017235025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260868,0.00043046128,0.00054611434,0.0005127337,0.000526532,0.0007038909,0.0009326915,0.0007390283,0.0024359736],"category_scores_gemma":[0.005525019,0.00037933065,0.00049139553,0.0006778916,0.0010494696,0.002014994,0.001312407,0.00052681944,0.00017715328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023876614,0.00004087125,0.0018134296,0.00016139832,0.00006243442,0.0004886827,0.00023671515,0.92398304,0.004041276,0.04765027,0.0010557047,0.020227516],"study_design_scores_gemma":[0.000030563973,0.000044147393,0.00034373617,0.000011577929,0.000015667238,0.00014485384,0.00011164621,0.8900798,0.001656708,0.1061261,0.0014258336,0.000009317245],"about_ca_topic_score_codex":0.0016115828,"about_ca_topic_score_gemma":0.0013626368,"teacher_disagreement_score":0.0024359736,"about_ca_system_score_codex":0.0007179429,"about_ca_system_score_gemma":0.00044762678,"threshold_uncertainty_score":0.008149147},"labels":[],"label_agreement":null},{"id":"W2278164876","doi":"10.1142/s012905411540016x","title":"Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Word (group theory); Complement (music); Generalization; Combinatorics; Binary number; Measure (data warehouse); Similarity (geometry); Natural number; Discrete mathematics; Morse code; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.01973837594558339,"score_gpt":0.2763361209495411,"score_spread":0.2565977450039577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278164876","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51834244,0.0039250352,0.42927703,0.0024929706,0.0002546375,0.00012753098,0.00029789665,0.00064605003,0.04463643],"genre_scores_gemma":[0.94365066,0.0006615611,0.050515823,0.00033292657,0.0003826708,0.00017847666,0.00021407704,0.00021512838,0.003848691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508506,0.0012691476,0.0002694766,0.0009561145,0.0018191043,0.00060103164],"domain_scores_gemma":[0.9611421,0.028718984,0.0016509888,0.0029871122,0.002306037,0.0031947617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006081827,0.0010931039,0.0024876487,0.0032890956,0.0018235052,0.004616526,0.0033767892,0.0021202073,0.0054030446],"category_scores_gemma":[0.051210128,0.001070467,0.0011826876,0.0021685904,0.00552048,0.011962305,0.008271661,0.0032944228,0.00088908616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005385023,0.00016882464,0.0026654124,0.00027972937,0.00007232549,0.00016671621,0.0007793585,0.028960038,0.0045680595,0.93654644,0.0015455335,0.023709098],"study_design_scores_gemma":[0.000038691494,0.0001645624,0.0013659919,0.000072401825,0.000044384942,0.00024083404,0.00024003175,0.17757386,0.003736117,0.81441003,0.0020430416,0.0000699691],"about_ca_topic_score_codex":0.0010106378,"about_ca_topic_score_gemma":0.0009946858,"teacher_disagreement_score":0.006081827,"about_ca_system_score_codex":0.003939475,"about_ca_system_score_gemma":0.0012814966,"threshold_uncertainty_score":0.032164216},"labels":[],"label_agreement":null},{"id":"W2336446049","doi":"10.1142/s0129054115400067","title":"Large Aperiodic Semigroups","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Semigroup; Mathematics; Unitary state; Special classes of semigroups; Tree (set theory); Quotient; Krohn–Rhodes theory; Discrete mathematics; State (computer science); Bicyclic semigroup; Pure mathematics; Combinatorics; Monoid; Algorithm","score_opus":0.02200527659450329,"score_gpt":0.30170178542708187,"score_spread":0.27969650883257857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336446049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7380623,0.0006375374,0.24502374,0.00033313184,0.000051534826,0.00006717224,0.00015736574,0.00028649493,0.01538075],"genre_scores_gemma":[0.95105636,0.00018513754,0.045853097,0.000040757302,0.000057893347,0.000058977792,0.00014984362,0.000032482225,0.002565458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00011407905,0.000041477968,0.00021095331,0.0001491103,0.00006381509],"domain_scores_gemma":[0.99692434,0.0018824836,0.0003428105,0.000306697,0.00025527223,0.00028833203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170253,0.00019793832,0.00034924742,0.0006002365,0.0007045738,0.00095931767,0.00041810144,0.00029387392,0.0019509204],"category_scores_gemma":[0.002722185,0.00020620492,0.00048856286,0.00033752606,0.0015070115,0.001776247,0.0008255415,0.0004986661,0.00020358997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010850298,0.000049820992,0.0021198632,0.00015746974,0.0000157705,0.00048763357,0.0006357221,0.008291957,0.024777425,0.9420847,0.00063408125,0.020637007],"study_design_scores_gemma":[0.000027583186,0.000119741766,0.0013796502,0.000031367257,0.000019864963,0.00068280014,0.00030613077,0.051793102,0.010380715,0.92708594,0.008147956,0.000025272222],"about_ca_topic_score_codex":0.0001634658,"about_ca_topic_score_gemma":0.00019497926,"teacher_disagreement_score":0.0019509204,"about_ca_system_score_codex":0.00037467753,"about_ca_system_score_gemma":0.0004702998,"threshold_uncertainty_score":0.00652647},"labels":[],"label_agreement":null},{"id":"W2396714452","doi":"10.1142/s0129054105003327","title":"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Prefix; Rewriting; Mathematics; Canonical form; Equivalence (formal languages); State (computer science); Word (group theory); Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Pure mathematics; Programming language","score_opus":0.022387374634667168,"score_gpt":0.35223913773278087,"score_spread":0.3298517630981137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396714452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047054276,0.000277846,0.94115967,0.0001571626,0.00007209351,0.000081075785,0.00014592193,0.00072441803,0.010327501],"genre_scores_gemma":[0.55626225,0.00041731182,0.4326839,0.00013692878,0.00015874568,0.00033225576,0.0004792797,0.0004624122,0.009066979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975107,0.00064337725,0.00027631863,0.0006611303,0.0006153891,0.00029312872],"domain_scores_gemma":[0.99705076,0.0012214466,0.00038525657,0.0006670252,0.00051830715,0.000157198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001639126,0.0005346039,0.00052806776,0.0015412185,0.0009334334,0.002750405,0.0013425268,0.00093633943,0.0049450826],"category_scores_gemma":[0.0052021747,0.0005261362,0.0011790555,0.0011384045,0.003046905,0.0054307794,0.002297304,0.0016538122,0.0010957463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001766839,0.000026054777,0.00018460852,0.000038886497,0.0000068172303,0.0001248608,0.00043864534,0.0050159814,0.0024654137,0.97575676,0.00026853263,0.015655879],"study_design_scores_gemma":[0.000015008623,0.000042158124,0.00008885521,0.000026807738,0.00001523698,0.00012932031,0.00009902197,0.035428345,0.0044476315,0.9501135,0.0095744375,0.000019639707],"about_ca_topic_score_codex":0.0008307145,"about_ca_topic_score_gemma":0.00084023626,"teacher_disagreement_score":0.0049450826,"about_ca_system_score_codex":0.0009713055,"about_ca_system_score_gemma":0.0008548753,"threshold_uncertainty_score":0.016542912},"labels":[],"label_agreement":null},{"id":"W2439381154","doi":"10.1142/s0129054112400436","title":"ABELIAN PRIMITIVE WORDS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Rank of an abelian group; Arithmetic of abelian varieties; Combinatorics on words; Mathematics; Word (group theory); Elementary abelian group; Context (archaeology); Free abelian group; Alphabet; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Biology; Linguistics; Philosophy","score_opus":0.016539528795581793,"score_gpt":0.30270130491401165,"score_spread":0.28616177611842986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439381154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48805323,0.0032766527,0.3731434,0.0013122751,0.00089281856,0.00030383375,0.0011210662,0.0010493471,0.13084744],"genre_scores_gemma":[0.8785223,0.0008765007,0.09329251,0.0004519737,0.0004683778,0.00020436499,0.00089916785,0.00025055304,0.025034316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999054,0.00018738674,0.0000839025,0.00024144395,0.0002695738,0.00016380115],"domain_scores_gemma":[0.99667203,0.0016967264,0.00044359855,0.00042454983,0.0005802067,0.0001827996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043501888,0.0005474918,0.00056581903,0.0011427772,0.0013153458,0.0015552064,0.00093427737,0.0006587112,0.009711621],"category_scores_gemma":[0.0034066786,0.000285989,0.0005114195,0.0010885395,0.0024039312,0.0046678935,0.0016193975,0.0010608152,0.0021941753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001597379,0.000058458598,0.001879367,0.00032441816,0.000022538354,0.0009847968,0.00059888297,0.0025043106,0.013786957,0.93454725,0.00377235,0.041360848],"study_design_scores_gemma":[0.00001714692,0.000097128075,0.0005142825,0.000058121237,0.000028822002,0.0010001739,0.00029963892,0.0068309405,0.011204279,0.9426654,0.037250746,0.00003343694],"about_ca_topic_score_codex":0.000238501,"about_ca_topic_score_gemma":0.00026950843,"teacher_disagreement_score":0.009711621,"about_ca_system_score_codex":0.00042562425,"about_ca_system_score_gemma":0.00037678922,"threshold_uncertainty_score":0.032488644},"labels":[],"label_agreement":null},{"id":"W2480249651","doi":"10.1142/s0129054119500060","title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Combinatorics; Running time; Vertex (graph theory); Binary logarithm; Time complexity; Graph algorithms; Mathematics; Algorithm; Path (computing); Computer science; Discrete mathematics","score_opus":0.030500637376295502,"score_gpt":0.3227517377298996,"score_spread":0.29225110035360413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480249651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04915382,0.00085962634,0.9357433,0.00052828254,0.00013829439,0.00025503366,0.0006576292,0.0057607614,0.006903262],"genre_scores_gemma":[0.1073076,0.0002758354,0.88782704,0.00007616884,0.000047576,0.00022937974,0.0010778917,0.0005442918,0.0026142919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907446,0.00017884329,0.000062540625,0.00026662796,0.0002551836,0.00016234959],"domain_scores_gemma":[0.99761754,0.0013186111,0.0002142342,0.0005488505,0.0001992203,0.00010154384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008235188,0.0016564053,0.0013810687,0.0014101369,0.0008837622,0.0012405921,0.0022237625,0.001728579,0.010013272],"category_scores_gemma":[0.006018291,0.0009340967,0.001149869,0.0022791473,0.00094214274,0.0040059686,0.0030951193,0.0016075668,0.002523279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078865833,0.00024165923,0.001672921,0.0006521133,0.0000751496,0.00024724333,0.00042440052,0.34559023,0.013220623,0.06084193,0.02188822,0.5543569],"study_design_scores_gemma":[0.00016839926,0.0002071603,0.00037904756,0.000053849206,0.00004059997,0.00020657653,0.00017014559,0.80228895,0.0075276974,0.17724773,0.011677208,0.000032621996],"about_ca_topic_score_codex":0.0019985416,"about_ca_topic_score_gemma":0.0037247685,"teacher_disagreement_score":0.010013272,"about_ca_system_score_codex":0.0011014984,"about_ca_system_score_gemma":0.0012427209,"threshold_uncertainty_score":0.03349775},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023064990121982428,"score_gpt":0.27846263967602103,"score_spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570053645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5097392,0.0005943916,0.44829467,0.0007935938,0.00007621153,0.000090154375,0.00042206558,0.0011233196,0.03886637],"genre_scores_gemma":[0.93673897,0.00024950248,0.056232184,0.000115680414,0.0001006048,0.00012245268,0.00049076293,0.00011634666,0.0058334004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840254,0.00038327664,0.00015983907,0.0004242983,0.00040636933,0.00022367897],"domain_scores_gemma":[0.9915759,0.006455371,0.0006909456,0.00068150164,0.0004028467,0.00019348014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063018,0.00046258437,0.00039580735,0.00094851514,0.0010993404,0.0019160504,0.0011753136,0.000693583,0.0036777123],"category_scores_gemma":[0.006650012,0.00042899413,0.0010782866,0.001032865,0.0025402678,0.00432832,0.0014268558,0.0018361072,0.00043602465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014469038,0.00011462281,0.0021903766,0.00019707561,0.000023091916,0.00052292226,0.0011246854,0.01685335,0.016346708,0.926371,0.0011285216,0.034982923],"study_design_scores_gemma":[0.00002323124,0.000048800044,0.0005640399,0.000037325408,0.000019367419,0.00040654547,0.00015142836,0.05186465,0.01278738,0.93014795,0.0039185206,0.00003082154],"about_ca_topic_score_codex":0.0006543523,"about_ca_topic_score_gemma":0.0008350373,"teacher_disagreement_score":0.0036777123,"about_ca_system_score_codex":0.0011410922,"about_ca_system_score_gemma":0.0007205314,"threshold_uncertainty_score":0.012303233},"labels":[],"label_agreement":null},{"id":"W2570565098","doi":"10.1142/s0129054105003273","title":"WORDS AVOIDING $\\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Complement (music); Morse code; Word (group theory); Combinatorics; Identity (music); Term (time); Combinatorics on words; Binary number; Discrete mathematics; Pure mathematics; Arithmetic; Computer science; Physics; Geometry","score_opus":0.009880745572070696,"score_gpt":0.27315879649748337,"score_spread":0.2632780509254127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570565098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750015,0.0013538464,0.14236157,0.0009715531,0.0003460892,0.0000700169,0.00010633421,0.00039365972,0.10438185],"genre_scores_gemma":[0.94796675,0.00036055926,0.022100398,0.00018080125,0.00017004607,0.00008600077,0.000077575874,0.00013225684,0.0289256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.000090392954,0.000035995563,0.00011073318,0.00012395534,0.00012136402],"domain_scores_gemma":[0.99880624,0.0005341415,0.00017163673,0.00016679574,0.00019587291,0.00012527953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051185593,0.00039192985,0.0005291969,0.00088721677,0.00196164,0.001669146,0.00045913976,0.0008234559,0.0064835865],"category_scores_gemma":[0.002483356,0.00039400224,0.0005734444,0.0004875326,0.002735269,0.0032706792,0.00187381,0.0010044622,0.0013958426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010417483,0.000016365988,0.0003787256,0.000049652343,0.000008931487,0.00041208215,0.00083034905,0.00096317445,0.0042492975,0.9792605,0.00074520754,0.0129815815],"study_design_scores_gemma":[0.000023797273,0.00004538042,0.00045863775,0.000036322792,0.000015564065,0.00049936364,0.00034117798,0.00338428,0.0052252426,0.9746012,0.015336588,0.000032421965],"about_ca_topic_score_codex":0.0005807041,"about_ca_topic_score_gemma":0.00074601517,"teacher_disagreement_score":0.0064835865,"about_ca_system_score_codex":0.00065665314,"about_ca_system_score_gemma":0.00035314573,"threshold_uncertainty_score":0.021689773},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.018727166221951738,"score_gpt":0.3057454771416453,"score_spread":0.28701831091969354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570765932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49412942,0.0040823347,0.41770723,0.006866171,0.00025330271,0.00021040249,0.00086691225,0.0013026453,0.07458155],"genre_scores_gemma":[0.9336241,0.00091445557,0.055912375,0.0005367375,0.00021112259,0.00024273101,0.00034158785,0.00012527748,0.008091462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973116,0.0006343951,0.0002793201,0.00063978456,0.0007250203,0.00040997827],"domain_scores_gemma":[0.99550325,0.0027149073,0.0005178211,0.00050448795,0.00049687986,0.00026273573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003220036,0.00043998507,0.0008846873,0.0016349504,0.002562706,0.003051468,0.0010778105,0.0008239104,0.0034873777],"category_scores_gemma":[0.006295922,0.0006463049,0.0016981168,0.0012255779,0.009768791,0.012344399,0.0035751807,0.002688006,0.0006025827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071466784,0.000021404609,0.00040188877,0.00007817372,0.000008883872,0.00013043555,0.00091960846,0.0011532686,0.0014147153,0.988696,0.0006077313,0.0064964076],"study_design_scores_gemma":[0.000051913205,0.00003774919,0.00038174485,0.00003255301,0.000014825644,0.00021988807,0.0002670267,0.0030302303,0.0018380686,0.9830619,0.011033682,0.00003045209],"about_ca_topic_score_codex":0.0022016556,"about_ca_topic_score_gemma":0.0012360765,"teacher_disagreement_score":0.0034873777,"about_ca_system_score_codex":0.0030274608,"about_ca_system_score_gemma":0.0016011106,"threshold_uncertainty_score":0.021965802},"labels":[],"label_agreement":null},{"id":"W2577580961","doi":"10.1142/s0129054112400023","title":"ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Boolean function; Computer science; And-inverter graph; Boolean circuit; Product term; Transient (computer programming); Boolean expression; Mathematics; Theoretical computer science; Calculus (dental); Algorithm; Two-element Boolean algebra; Algebra over a field; Programming language; Medicine; Pure mathematics","score_opus":0.12915129891804625,"score_gpt":0.3521225510733017,"score_spread":0.22297125215525546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577580961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6117142,0.0012642831,0.36648315,0.0036618798,0.00011195284,0.00037146077,0.0011860988,0.0024107012,0.012796369],"genre_scores_gemma":[0.88010556,0.00056418916,0.11366944,0.00041709072,0.00014803297,0.00026004892,0.0011557603,0.000394095,0.0032857824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920129,0.0026858766,0.000703889,0.001212837,0.0022331413,0.0011513351],"domain_scores_gemma":[0.91330236,0.07733281,0.0025003178,0.003972124,0.002075371,0.0008171102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005062505,0.0011397348,0.0017421949,0.0011974609,0.0015995016,0.005358773,0.0028468692,0.0015938028,0.0060087736],"category_scores_gemma":[0.03693616,0.000804402,0.0023510419,0.0023847215,0.0026787757,0.013335045,0.0031642006,0.0030473932,0.00063116377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005285994,0.00075959036,0.019111544,0.0016497724,0.0005126326,0.001614301,0.0022545068,0.48315996,0.02305288,0.16796163,0.010318091,0.2843191],"study_design_scores_gemma":[0.0001965877,0.00017978226,0.0015575731,0.000057813482,0.0001639628,0.00031633605,0.00025397696,0.7850527,0.007620871,0.2029607,0.0015818282,0.000057850273],"about_ca_topic_score_codex":0.0050720563,"about_ca_topic_score_gemma":0.0050332113,"teacher_disagreement_score":0.0060087736,"about_ca_system_score_codex":0.0032054116,"about_ca_system_score_gemma":0.003044439,"threshold_uncertainty_score":0.026773393},"labels":[],"label_agreement":null},{"id":"W2582188091","doi":"10.1142/s0129054116500349","title":"State Complexity of Insertion","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.032465811927913014,"score_gpt":0.3026928864660438,"score_spread":0.2702270745381308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582188091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5034271,0.00078688347,0.4302968,0.0064020134,0.00021256534,0.00046626592,0.0040897345,0.005392327,0.04892634],"genre_scores_gemma":[0.9176138,0.0004124312,0.06177216,0.00058240443,0.00013875836,0.00044289546,0.0028678314,0.0015017422,0.014668095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899664,0.0018204125,0.0007362233,0.0020311498,0.0031000134,0.0023459152],"domain_scores_gemma":[0.95161694,0.037071973,0.002225513,0.005317131,0.00284082,0.0009276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034540668,0.0008566415,0.001658245,0.0014618726,0.0023546752,0.007361904,0.004030559,0.0029733838,0.019944971],"category_scores_gemma":[0.03164541,0.0013696933,0.0040850034,0.0020701163,0.003888774,0.013235315,0.0047828904,0.0043228013,0.0024377797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020794575,0.000502669,0.010777322,0.0014404448,0.000271586,0.000954587,0.0026689079,0.21834213,0.022126017,0.64435405,0.010655258,0.08582763],"study_design_scores_gemma":[0.000120599245,0.00017582164,0.0015135575,0.00007268742,0.00017884455,0.00036047437,0.000306666,0.37435332,0.01448086,0.6032894,0.0050349417,0.00011285362],"about_ca_topic_score_codex":0.0057415487,"about_ca_topic_score_gemma":0.005073438,"teacher_disagreement_score":0.019944971,"about_ca_system_score_codex":0.0048853755,"about_ca_system_score_gemma":0.005143765,"threshold_uncertainty_score":0.06672257},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022275286274606947,"score_gpt":0.2935118611464839,"score_spread":0.27123657487187697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590512199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112635575,0.00048810797,0.8720171,0.001001374,0.00009982479,0.00021565837,0.0002486733,0.00065026747,0.012643564],"genre_scores_gemma":[0.55498594,0.0002702293,0.43462467,0.00040257408,0.0001581291,0.00045185158,0.00066419085,0.00020636237,0.008236056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722004,0.0008124341,0.00032549672,0.0006110268,0.0007098296,0.00032113874],"domain_scores_gemma":[0.9891977,0.008313451,0.0005484398,0.0009130351,0.00076727854,0.0002601103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021311308,0.00048252626,0.0008091222,0.0012462895,0.0013206078,0.003151291,0.0019742947,0.0011523508,0.0046418523],"category_scores_gemma":[0.010807513,0.0005066067,0.0010945711,0.0013122013,0.0022080871,0.0058883666,0.002749627,0.0019326085,0.0007675158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026345975,0.00014362716,0.0018845506,0.00024170247,0.000041172087,0.00010137208,0.0004697251,0.018522449,0.0067531522,0.8453655,0.003294972,0.12291822],"study_design_scores_gemma":[0.00006786335,0.00006252622,0.0003450832,0.000042667816,0.000021644493,0.00010734219,0.00013984983,0.16320059,0.0065009263,0.82607865,0.0034003071,0.00003256172],"about_ca_topic_score_codex":0.0010836909,"about_ca_topic_score_gemma":0.0016459799,"teacher_disagreement_score":0.0046418523,"about_ca_system_score_codex":0.002055614,"about_ca_system_score_gemma":0.0014869629,"threshold_uncertainty_score":0.01552856},"labels":[],"label_agreement":null},{"id":"W2592757846","doi":"10.1142/s0129054113400182","title":"AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Function (biology); Algorithm; Word (group theory)","score_opus":0.011031482350575644,"score_gpt":0.2717489781803248,"score_spread":0.2607174958297491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592757846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08777449,0.000374021,0.89882714,0.0005324518,0.000114088936,0.00009910111,0.0001523007,0.0012460211,0.010880444],"genre_scores_gemma":[0.59930265,0.0004591188,0.39376846,0.0003061596,0.00030295528,0.00034035466,0.00034040256,0.00042872372,0.0047510955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968707,0.0009887039,0.0003105202,0.00060554803,0.00092322374,0.00030127753],"domain_scores_gemma":[0.99116427,0.006099005,0.0005623419,0.0014467838,0.00055283424,0.000174813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026702199,0.000839922,0.0008820805,0.0024617,0.0017740441,0.0026933725,0.0019835464,0.0007396886,0.004133244],"category_scores_gemma":[0.013201188,0.00092451635,0.0025096198,0.001997514,0.004889392,0.007606945,0.0031472163,0.0023146658,0.00093988434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058293557,0.000037179336,0.00077273423,0.00016402885,0.000030462406,0.00015759688,0.00054443075,0.0076016304,0.005649343,0.9596093,0.00083001086,0.024544906],"study_design_scores_gemma":[0.000024329598,0.000047412555,0.00027441813,0.000026530219,0.000019103296,0.000119402226,0.000063259286,0.026364656,0.008180659,0.9598513,0.005001004,0.000027864986],"about_ca_topic_score_codex":0.0008105314,"about_ca_topic_score_gemma":0.00091177627,"teacher_disagreement_score":0.004133244,"about_ca_system_score_codex":0.0018353427,"about_ca_system_score_gemma":0.0012257864,"threshold_uncertainty_score":0.014121592},"labels":[],"label_agreement":null},{"id":"W2603214747","doi":"10.1142/s012905411750006x","title":"Deterministic Rendezvous with Detection Using Beeps","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Node (physics); Mobile agent; Computer network; Real-time computing; Distributed computing","score_opus":0.04234109411602974,"score_gpt":0.35111037560664526,"score_spread":0.30876928149061555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603214747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017291535,0.00026113522,0.97406274,0.00023010864,0.00007264878,0.000086121465,0.00011932643,0.0007205067,0.0071558454],"genre_scores_gemma":[0.82047737,0.00043218568,0.16510193,0.00027619803,0.00007257083,0.0004290337,0.00026958762,0.00022656802,0.012714601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976184,0.0005366655,0.0001306613,0.0005863431,0.00067317626,0.00045477177],"domain_scores_gemma":[0.9950352,0.0026870251,0.00054198236,0.0010755954,0.00040837808,0.00025181525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012108133,0.0012153601,0.0013020203,0.00071065925,0.0012159559,0.0019470813,0.0029539904,0.001848286,0.004271036],"category_scores_gemma":[0.0066012377,0.0007484751,0.001144807,0.0008231225,0.0020349196,0.0030082087,0.0039651524,0.0019794125,0.0009114675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041996743,0.00008182196,0.0012519428,0.00025348313,0.0000823064,0.0005404186,0.00047129084,0.62306565,0.011004806,0.32263923,0.0037107535,0.036478393],"study_design_scores_gemma":[0.000043660853,0.000059632028,0.0001092155,0.000015078717,0.000018647277,0.00012350896,0.00004195021,0.92790395,0.0027878108,0.06455946,0.004301586,0.000035483466],"about_ca_topic_score_codex":0.0048512784,"about_ca_topic_score_gemma":0.004416908,"teacher_disagreement_score":0.0048512784,"about_ca_system_score_codex":0.0014894372,"about_ca_system_score_gemma":0.0012931746,"threshold_uncertainty_score":0.014288008},"labels":[],"label_agreement":null},{"id":"W2605900390","doi":"10.1142/s0129054118420030","title":"Counting, Generating, Analyzing and Sampling Tree Alignments","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Tree (set theory); Mathematics; Pairwise comparison; Probabilistic logic; Combinatorics; Equivalence (formal languages); Gibbs sampling; Theoretical computer science; Computer science; Algorithm; Discrete mathematics; Statistics; Bayesian probability","score_opus":0.020921866871416166,"score_gpt":0.31344064021825496,"score_spread":0.2925187733468388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605900390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041398253,0.00014748225,0.9564392,0.00018156879,0.000022048504,0.000054362798,0.00010395749,0.00033983032,0.0013132995],"genre_scores_gemma":[0.30039844,0.00041673778,0.6945174,0.00012932472,0.000065360684,0.00031174795,0.00079787563,0.00056046224,0.0028026856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980933,0.00071658834,0.00010434718,0.0004239651,0.000500761,0.00016104312],"domain_scores_gemma":[0.993093,0.0051312265,0.0004410083,0.0007275909,0.0003987633,0.0002085042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024850802,0.0005538189,0.0011592198,0.0012712508,0.0008788238,0.0019498838,0.002768537,0.0011389534,0.0026563066],"category_scores_gemma":[0.015508554,0.00075603544,0.0007915923,0.0022343611,0.0019422699,0.003506103,0.0016641556,0.0016223568,0.00079105125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014471261,0.00012585889,0.0058928095,0.0002998964,0.00004780323,0.0002369615,0.00044205599,0.4391716,0.011398913,0.38085735,0.0025361055,0.15884598],"study_design_scores_gemma":[0.000011618482,0.000021748307,0.00030027624,0.000015707608,0.000011090378,0.00009370068,0.00005195252,0.77971995,0.0032292914,0.21504994,0.0014810311,0.000013708221],"about_ca_topic_score_codex":0.0016643497,"about_ca_topic_score_gemma":0.00304685,"teacher_disagreement_score":0.002768537,"about_ca_system_score_codex":0.0013719047,"about_ca_system_score_gemma":0.0018762016,"threshold_uncertainty_score":0.013142526},"labels":[],"label_agreement":null},{"id":"W2616617106","doi":"10.1142/s0129054117500137","title":"Worst Case Branching and Other Measures of Nondeterminism","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Mathematics; Computation; Upper and lower bounds; Nondeterministic finite automaton; Tree (set theory); Bounded function; Discrete mathematics; Branching (polymer chemistry); Automaton; Combinatorics; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.04300114367963864,"score_gpt":0.3331492841058865,"score_spread":0.29014814042624787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616617106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18126877,0.005754352,0.78618187,0.0025760715,0.0002727981,0.00011516032,0.00080145727,0.001302869,0.021726564],"genre_scores_gemma":[0.90894866,0.0017154452,0.081923604,0.00034264746,0.00050749606,0.00024512675,0.0005242268,0.0006012864,0.0051915636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375474,0.0011349687,0.0003933773,0.0017968162,0.002105582,0.0008143997],"domain_scores_gemma":[0.91199327,0.06731215,0.0055337762,0.008515255,0.0033367132,0.0033089002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005402145,0.0016800419,0.0017708864,0.0026669432,0.0017375975,0.004954474,0.0032803924,0.0022105502,0.006336429],"category_scores_gemma":[0.055523638,0.00079205557,0.002303449,0.0028226986,0.0053846166,0.012967884,0.0028624604,0.006004893,0.00061017694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003261065,0.00016229409,0.005259325,0.00038311855,0.00013600964,0.00044820513,0.0008081157,0.08597812,0.009608644,0.86669284,0.0014900941,0.028707175],"study_design_scores_gemma":[0.000012876192,0.00008729821,0.0010946277,0.00005593915,0.00004634282,0.00037031763,0.00007687006,0.14949603,0.0036374226,0.8429606,0.0021129786,0.00004864413],"about_ca_topic_score_codex":0.0009897085,"about_ca_topic_score_gemma":0.0006165269,"teacher_disagreement_score":0.006336429,"about_ca_system_score_codex":0.0033255306,"about_ca_system_score_gemma":0.0013907923,"threshold_uncertainty_score":0.028569639},"labels":[],"label_agreement":null},{"id":"W2754500190","doi":"10.1142/s0129054114400048","title":"HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY","year":2014,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hypergraph; Automaton; Mobile automaton; Computer science; Expressive power; Regular language; Büchi automaton; Theoretical computer science; Automata theory; Discrete mathematics; Deterministic automaton; Mathematics","score_opus":0.011402478454349137,"score_gpt":0.2961747853438949,"score_spread":0.28477230688954575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754500190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09207621,0.0005818141,0.88197184,0.0007947122,0.00011090343,0.00010676113,0.00031086392,0.00070930045,0.023337618],"genre_scores_gemma":[0.8332606,0.000804612,0.14559396,0.00034977178,0.00010509538,0.0004951432,0.00041556696,0.00018556355,0.018789673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995427,0.00011806728,0.00002975204,0.00012877805,0.00011481864,0.000065787695],"domain_scores_gemma":[0.99894994,0.0005660183,0.00009753281,0.00020772222,0.00010454167,0.00007424725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037997798,0.00037808155,0.0004428441,0.000562615,0.0008442119,0.0022040673,0.0014082756,0.001401242,0.0050129853],"category_scores_gemma":[0.0017996732,0.00040497727,0.00096101145,0.0006044098,0.0023792698,0.0032955722,0.001120886,0.0012886592,0.0009194967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017845192,0.000017145063,0.00019705968,0.00004322148,0.000008482688,0.000116714255,0.00017986362,0.026717193,0.0029072918,0.966214,0.00044269368,0.0031386039],"study_design_scores_gemma":[0.000018711797,0.000032354772,0.00009628128,0.00001817287,0.000012456521,0.00011421207,0.00009184429,0.23217383,0.0019468411,0.7604437,0.005033161,0.000018419976],"about_ca_topic_score_codex":0.0016886861,"about_ca_topic_score_gemma":0.0013827572,"teacher_disagreement_score":0.0050129853,"about_ca_system_score_codex":0.0011829372,"about_ca_system_score_gemma":0.0007997543,"threshold_uncertainty_score":0.016770124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020012000271576177,"score_gpt":0.32110049861142975,"score_spread":0.30108849833985357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786516640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22559924,0.0015477991,0.7609836,0.00085045083,0.000066966924,0.0002515362,0.000882489,0.0012782533,0.008539733],"genre_scores_gemma":[0.55507046,0.0013457001,0.43270174,0.00035000054,0.0002428569,0.00040059473,0.002603388,0.000391908,0.006893323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793243,0.00050361385,0.00015059864,0.0005805328,0.00065187516,0.00018090048],"domain_scores_gemma":[0.99247426,0.004991744,0.00094509416,0.000808412,0.0005649064,0.00021552193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018666568,0.0007884946,0.0012190342,0.002279284,0.0007150092,0.0033338177,0.0010833642,0.00088161416,0.0030025754],"category_scores_gemma":[0.0115193995,0.00076970214,0.0013835601,0.0019887516,0.0016122413,0.0044117025,0.001857539,0.0013030656,0.00089356693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002001089,0.0003361681,0.020720255,0.0029841086,0.00045968193,0.0025270067,0.0023651265,0.13642909,0.049604267,0.46634933,0.00862449,0.3075994],"study_design_scores_gemma":[0.000108775836,0.0003859713,0.0024378279,0.00017383357,0.00014243902,0.001454511,0.000944577,0.47852275,0.016196571,0.47774023,0.02181,0.000082486215],"about_ca_topic_score_codex":0.0006855727,"about_ca_topic_score_gemma":0.00076448574,"teacher_disagreement_score":0.0033338177,"about_ca_system_score_codex":0.0009645471,"about_ca_system_score_gemma":0.0011725314,"threshold_uncertainty_score":0.010044634},"labels":[],"label_agreement":null},{"id":"W2797999682","doi":"10.1142/s0129054118400099","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Mathematics; Combinatorics; Upper and lower bounds; Deterministic finite automaton; State (computer science); Nondeterministic algorithm; String (physics); Discrete mathematics; Finite-state machine; Set (abstract data type); Computer science; Algorithm","score_opus":0.026187599199695585,"score_gpt":0.303750500253681,"score_spread":0.2775629010539854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797999682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7047003,0.00037686928,0.281956,0.0013261853,0.00004612862,0.00012802402,0.001342022,0.0014790164,0.008645447],"genre_scores_gemma":[0.9642821,0.0001319783,0.03045403,0.000097831886,0.0000396304,0.00016814534,0.0011098229,0.0002054972,0.0035109518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467,0.0009228052,0.00057876075,0.0013693317,0.0016659498,0.0007931118],"domain_scores_gemma":[0.97362095,0.01765152,0.0016128842,0.0048385975,0.0014549311,0.00082109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019171442,0.00056846533,0.0014603358,0.0012008196,0.0014571816,0.0041338108,0.002991974,0.0017050073,0.0076201605],"category_scores_gemma":[0.020564765,0.00075635465,0.0021300025,0.0016064116,0.0027409224,0.009043702,0.0039652484,0.0023274524,0.000733447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023687738,0.00041814864,0.012714677,0.00070913724,0.00022287005,0.000504184,0.0014213679,0.46182552,0.030198364,0.41375992,0.0034257807,0.07243114],"study_design_scores_gemma":[0.0000493299,0.00012586758,0.0014021811,0.000021779213,0.00007960444,0.00015858116,0.00010182971,0.5861783,0.010240694,0.40057918,0.00100699,0.000055575776],"about_ca_topic_score_codex":0.002838161,"about_ca_topic_score_gemma":0.0023392844,"teacher_disagreement_score":0.0076201605,"about_ca_system_score_codex":0.002860171,"about_ca_system_score_gemma":0.0017715254,"threshold_uncertainty_score":0.025491953},"labels":[],"label_agreement":null},{"id":"W2798699651","doi":"10.1142/s0129054120410014","title":"Additive Number Theory via Approximation by Regular Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Base (topology); Formal language; Regular language; Number theory; Discrete mathematics; Automaton; Representation (politics); Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.008711594732859467,"score_gpt":0.27563610870373884,"score_spread":0.26692451397087935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798699651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074459836,0.00087777607,0.8941443,0.001357182,0.00034050006,0.00006148241,0.00014648636,0.0008560889,0.027756399],"genre_scores_gemma":[0.7603132,0.0010475578,0.22090736,0.0008567581,0.0006989859,0.00020927512,0.00031044224,0.0002960298,0.015360295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962525,0.000974749,0.0002666842,0.000928832,0.001205151,0.00037207388],"domain_scores_gemma":[0.9919842,0.0052846484,0.0005321694,0.001278421,0.0006276136,0.0002930039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028706437,0.0010495861,0.0013509027,0.0024187658,0.0014109637,0.00384048,0.0021371208,0.00092754536,0.005503326],"category_scores_gemma":[0.01191876,0.00065074704,0.0027569118,0.0019034804,0.004636845,0.010136117,0.0040170355,0.0041745002,0.0013099893],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005186916,0.00002892879,0.0002874167,0.00006617801,0.00001978264,0.00009907378,0.0002776458,0.004908251,0.0011585419,0.9811755,0.0007203061,0.011206527],"study_design_scores_gemma":[0.000016920672,0.000034779412,0.00011028215,0.000019985875,0.000034686134,0.00013625147,0.00004790468,0.03265397,0.0019163956,0.96071744,0.004292764,0.00001859186],"about_ca_topic_score_codex":0.00072508445,"about_ca_topic_score_gemma":0.00060432823,"teacher_disagreement_score":0.005503326,"about_ca_system_score_codex":0.0017570698,"about_ca_system_score_gemma":0.00070996536,"threshold_uncertainty_score":0.018410444},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014958775711966481,"score_gpt":0.29957644344810586,"score_spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802228513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78588206,0.00083492,0.14050503,0.0004811409,0.00013809859,0.000047181857,0.00034860545,0.00032726035,0.07143565],"genre_scores_gemma":[0.9720518,0.00020878746,0.01746547,0.000116653304,0.00006167797,0.000035227506,0.00020911245,0.000055972738,0.009795223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.000115140465,0.000060184335,0.00021009221,0.00019310832,0.0001048048],"domain_scores_gemma":[0.9989391,0.00036340675,0.0002073204,0.00019625481,0.00017151506,0.0001224437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033723787,0.00036203588,0.00035333837,0.0008584379,0.0013447981,0.0011464806,0.0004738268,0.00072668004,0.0049542463],"category_scores_gemma":[0.0014114026,0.00037263753,0.00049214764,0.0005275878,0.002735819,0.0019387649,0.00137472,0.00091833354,0.0010446546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006873215,0.000011710787,0.00041099128,0.000045756853,0.0000055882656,0.00030000706,0.0005266576,0.002113674,0.009373027,0.98090655,0.00037154905,0.005865678],"study_design_scores_gemma":[0.000020272699,0.000077771096,0.0012911538,0.000034912355,0.000017140574,0.0011458347,0.00046997837,0.011243545,0.010430968,0.9629101,0.012305463,0.00005285532],"about_ca_topic_score_codex":0.00053064735,"about_ca_topic_score_gemma":0.00053827104,"teacher_disagreement_score":0.0049542463,"about_ca_system_score_codex":0.0005943723,"about_ca_system_score_gemma":0.00028781424,"threshold_uncertainty_score":0.016573608},"labels":[],"label_agreement":null},{"id":"W2802872846","doi":"10.1142/s0129054120420010","title":"Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Regular language; Regular expression; Invariant (physics); Automaton; Alphabet; String (physics); Prefix; Decision problem; Discrete mathematics; Formal language; Mathematics; Graph; Predicate (mathematical logic); Word (group theory); Decidability; Computer science; Theoretical computer science; Algorithm; Programming language","score_opus":0.016306984253055712,"score_gpt":0.26942994187874125,"score_spread":0.25312295762568554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802872846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011143452,0.00020591426,0.97723174,0.00063287624,0.00015431004,0.000082588485,0.00029235406,0.0011713338,0.009085441],"genre_scores_gemma":[0.24863894,0.0006694934,0.73346335,0.0007948156,0.00047955898,0.00067487557,0.0011328472,0.0009193502,0.013226806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900635,0.003115031,0.001025594,0.002824949,0.0022379302,0.0007328845],"domain_scores_gemma":[0.9867006,0.0072670267,0.0010742146,0.0032927,0.0013283718,0.00033711136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005097726,0.00079590885,0.0008310233,0.0016674893,0.0013680389,0.0040494218,0.0022218577,0.0018680566,0.0050829826],"category_scores_gemma":[0.01589247,0.0010467861,0.0022018966,0.0022356596,0.008799577,0.012515578,0.0029215019,0.003833922,0.001789654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003784708,0.000015851196,0.00022708227,0.00005718806,0.000008978066,0.00010811676,0.0004535246,0.0024724603,0.001474834,0.98485106,0.0008450344,0.009447952],"study_design_scores_gemma":[0.000015575864,0.000028603465,0.000102887905,0.00004299642,0.00002804498,0.00014046274,0.00013654724,0.015571768,0.003342842,0.965462,0.015096596,0.00003163459],"about_ca_topic_score_codex":0.001185413,"about_ca_topic_score_gemma":0.0011852116,"teacher_disagreement_score":0.005097726,"about_ca_system_score_codex":0.0016306357,"about_ca_system_score_gemma":0.0019786214,"threshold_uncertainty_score":0.026959717},"labels":[],"label_agreement":null},{"id":"W2805215296","doi":"10.1142/s0129054119500102","title":"Tight Bounds for Restricted Grid Scheduling","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Villum Fonden; Velux Fonden; Natur og Univers, Det Frie Forskningsråd","keywords":"Computer science; Grid; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Geometry","score_opus":0.021411712199889535,"score_gpt":0.32111725181519885,"score_spread":0.2997055396153093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805215296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07636808,0.011234133,0.82505524,0.0055296044,0.0011317261,0.00033431052,0.001980914,0.0033886747,0.074977376],"genre_scores_gemma":[0.8041944,0.006445646,0.1677045,0.0017900518,0.000940519,0.0006342412,0.0023899449,0.0015976124,0.014303006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468756,0.0014462661,0.00018313674,0.00081234315,0.0014108958,0.0014598685],"domain_scores_gemma":[0.9775988,0.0155058205,0.0014057329,0.0029207894,0.0012856488,0.001283298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054306174,0.002850582,0.0036221931,0.0025209505,0.0018788868,0.0051469845,0.004956706,0.0020009505,0.018671995],"category_scores_gemma":[0.034350876,0.0014001242,0.0015069391,0.006175623,0.002674803,0.008255447,0.004725942,0.0049178693,0.003004817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014263066,0.0004041402,0.001511651,0.0010564508,0.0001774381,0.0002402581,0.00028607098,0.6272854,0.0032518206,0.27187133,0.028710658,0.063778386],"study_design_scores_gemma":[0.00010681861,0.0001414755,0.0004654084,0.00011382868,0.00005824444,0.00010689147,0.00011535491,0.6834593,0.00074255216,0.30751368,0.0071456362,0.000030896063],"about_ca_topic_score_codex":0.00888878,"about_ca_topic_score_gemma":0.0071534286,"teacher_disagreement_score":0.018671995,"about_ca_system_score_codex":0.0048308196,"about_ca_system_score_gemma":0.0037488989,"threshold_uncertainty_score":0.062464},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017999668340575658,"score_gpt":0.30974991188201595,"score_spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888233883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36082977,0.001599259,0.5958172,0.0009868598,0.00026978063,0.00019147103,0.0013162191,0.001522579,0.037466902],"genre_scores_gemma":[0.8828743,0.0009173214,0.10889831,0.00019648859,0.00030069824,0.00029202097,0.0007733971,0.00030465506,0.0054428624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946138,0.0010131078,0.0007012525,0.0011898367,0.001693925,0.0007880022],"domain_scores_gemma":[0.9795297,0.014057016,0.0015612004,0.002543891,0.0015277405,0.0007804788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016614825,0.00094748806,0.0009867371,0.0015200676,0.0016963691,0.004495133,0.0015847756,0.0011271214,0.0072901743],"category_scores_gemma":[0.016443063,0.00083776866,0.0014888062,0.0018739696,0.0035900392,0.012308847,0.0037173193,0.0025670803,0.0010745518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018231852,0.00006564662,0.00088752864,0.00021341984,0.00001668381,0.00020250131,0.0006214637,0.020864246,0.005156367,0.94643646,0.0011519156,0.024201438],"study_design_scores_gemma":[0.000021793681,0.000055134886,0.00023919213,0.000030022065,0.000018254352,0.00010676787,0.00011338413,0.035749357,0.004407694,0.9551646,0.0040592803,0.000034587494],"about_ca_topic_score_codex":0.001086292,"about_ca_topic_score_gemma":0.0008954117,"teacher_disagreement_score":0.0072901743,"about_ca_system_score_codex":0.0014415592,"about_ca_system_score_gemma":0.0010768119,"threshold_uncertainty_score":0.024388075},"labels":[],"label_agreement":null},{"id":"W2890948056","doi":"10.1142/s0129054119500308","title":"Cobham’s Theorem and Automaticity","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada; Université de Liège","keywords":"Aperiodic graph; Automaticity; Prefix; Sequence (biology); Mathematics; Discrete mathematics; Combinatorics; Philosophy; Linguistics","score_opus":0.016367887227190753,"score_gpt":0.29745463307549835,"score_spread":0.2810867458483076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890948056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13775395,0.0065730773,0.5783481,0.011707572,0.0017474919,0.00012924819,0.00033380932,0.0008524668,0.2625542],"genre_scores_gemma":[0.8611084,0.0016271893,0.10581127,0.0022003632,0.0009851723,0.00027240408,0.00017793638,0.00032418396,0.027493132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968393,0.00053640903,0.0001681506,0.0010103208,0.0009860974,0.00045973127],"domain_scores_gemma":[0.9861692,0.008327522,0.00067175535,0.0022490055,0.001960716,0.000621872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036239557,0.00089522277,0.000926496,0.0027670274,0.0031341293,0.0022665241,0.0016184194,0.0016306085,0.006717788],"category_scores_gemma":[0.013963141,0.00055135053,0.0015314325,0.0016490694,0.0072694747,0.009213721,0.004644819,0.0050346395,0.0015481233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039919378,0.000008975672,0.00023660912,0.000047771267,0.000006854894,0.00007946688,0.00024274719,0.00038953073,0.0009902134,0.99110305,0.0009926385,0.005862186],"study_design_scores_gemma":[0.000014534714,0.00003050795,0.0004214898,0.000029654293,0.000013866568,0.00014809836,0.000058966165,0.0034402914,0.0028801619,0.97907686,0.013857244,0.00002833086],"about_ca_topic_score_codex":0.0016015543,"about_ca_topic_score_gemma":0.0012456017,"teacher_disagreement_score":0.006717788,"about_ca_system_score_codex":0.0030715216,"about_ca_system_score_gemma":0.0012131354,"threshold_uncertainty_score":0.022473276},"labels":[],"label_agreement":null},{"id":"W2950107561","doi":"10.1142/s0129054118400051","title":"On the Density of Context-Free and Counter Languages","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of British Columbia","funders":"","keywords":"Undecidable problem; Deterministic pushdown automaton; Context-free language; Decidability; Mathematics; Regular language; Pushdown automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Word (group theory); Pumping lemma for regular languages; Combinatorics; Bounded function; Automaton; Nondeterministic finite automaton; Computer science; Finite-state machine; Automata theory; Quantum finite automata; Algorithm; Theoretical computer science; Rule-based machine translation; Programming language","score_opus":0.011998211497109624,"score_gpt":0.2856617002251832,"score_spread":0.2736634887280736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950107561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33970758,0.002528542,0.6221501,0.0017288184,0.00012661032,0.00033243874,0.0006513783,0.0014936015,0.03128093],"genre_scores_gemma":[0.9319115,0.0006668561,0.060597375,0.0003235461,0.00015084061,0.00039882906,0.00044417195,0.00019056188,0.005316253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961392,0.0009933827,0.00032667466,0.0007531564,0.0011838715,0.0006036377],"domain_scores_gemma":[0.9776999,0.017800406,0.00085269526,0.0015450717,0.0014155327,0.00068644114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026115384,0.00068006036,0.00079172873,0.0018956204,0.0016548069,0.0036663394,0.0016069569,0.0010093037,0.0031667557],"category_scores_gemma":[0.015422626,0.0010258162,0.0014175153,0.0012419092,0.0055706087,0.010444706,0.0035864948,0.0029264216,0.0004129782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014469096,0.000049994465,0.0012774676,0.00012136628,0.000019223053,0.00023411373,0.0012295147,0.011525889,0.002690011,0.9705185,0.0005904523,0.011598708],"study_design_scores_gemma":[0.000041157524,0.00007467955,0.0005055893,0.000081663755,0.000053286687,0.00037291978,0.0003656453,0.08740761,0.0060842545,0.9004166,0.004544506,0.000052107778],"about_ca_topic_score_codex":0.0033804625,"about_ca_topic_score_gemma":0.001818531,"teacher_disagreement_score":0.0036663394,"about_ca_system_score_codex":0.0028602877,"about_ca_system_score_gemma":0.0023547614,"threshold_uncertainty_score":0.020752966},"labels":[],"label_agreement":null},{"id":"W2950450215","doi":"10.1142/s0129054121500209","title":"Search on a Line by Byzantine Robots","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"National Science Foundation","keywords":"Robot; Line (geometry); Computer science; Algorithm; Fault tolerance; Mobile robot; Distributed computing; Artificial intelligence; Mathematics; Geometry","score_opus":0.050519827703159915,"score_gpt":0.3664393369516543,"score_spread":0.3159195092484944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950450215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17639993,0.00075419806,0.81590044,0.0012025466,0.00010077474,0.00011102213,0.000198845,0.00056829967,0.0047639725],"genre_scores_gemma":[0.7897853,0.00051688467,0.20181689,0.00018778382,0.00008008763,0.00024017622,0.00024730043,0.00014740754,0.006978093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992756,0.0002605534,0.000033271,0.00021033577,0.00011051881,0.000109667846],"domain_scores_gemma":[0.9963689,0.0026020687,0.0004719743,0.0002198863,0.00019526453,0.00014184395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011669219,0.0010875579,0.0015278086,0.0005800044,0.0007513973,0.0010299796,0.001987219,0.0016501468,0.0038752677],"category_scores_gemma":[0.0071212538,0.00046747216,0.0005844025,0.0010555021,0.0015407417,0.002718741,0.0011912964,0.00124867,0.00053929427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033928794,0.00007386563,0.00056427537,0.00019017441,0.00005203534,0.00021768035,0.00010260276,0.95579046,0.002062353,0.021790016,0.0011990509,0.017618142],"study_design_scores_gemma":[0.00006206376,0.00008612797,0.00009556336,0.000009591026,0.000010755031,0.000053329917,0.000024308134,0.97631454,0.00085500395,0.021772448,0.00070835964,0.000007901243],"about_ca_topic_score_codex":0.0018635305,"about_ca_topic_score_gemma":0.0012149856,"teacher_disagreement_score":0.0038752677,"about_ca_system_score_codex":0.0009515882,"about_ca_system_score_gemma":0.0006683841,"threshold_uncertainty_score":0.01296401},"labels":[],"label_agreement":null},{"id":"W2950888016","doi":"10.1142/s012905412050001x","title":"Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Secure multi-party computation; Computation; Computer network; Algorithm","score_opus":0.0368566705093553,"score_gpt":0.33961078080682344,"score_spread":0.3027541102974681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950888016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011007929,0.00041012335,0.9809629,0.0006413218,0.000092051465,0.00015328509,0.0001156066,0.00032497026,0.0062918267],"genre_scores_gemma":[0.49396297,0.0007645711,0.49655637,0.0005691664,0.0001993459,0.00040163085,0.00026809398,0.00020508328,0.007072634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931137,0.002321754,0.00040135076,0.001405506,0.002085353,0.0006722399],"domain_scores_gemma":[0.993804,0.0025094296,0.00045318418,0.002594795,0.00042511596,0.00021355897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005399251,0.0010123671,0.001614345,0.00093394046,0.0013818206,0.0036736974,0.003067016,0.0026705067,0.0032387713],"category_scores_gemma":[0.0090852985,0.0009796657,0.0020940357,0.0014046591,0.0037630228,0.008521764,0.0084496485,0.006314897,0.0018585975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018978181,0.00006120956,0.00016680856,0.00016880107,0.000050596154,0.00019474316,0.0002608035,0.04092454,0.0050965105,0.92866874,0.0015993696,0.022618137],"study_design_scores_gemma":[0.00008308869,0.00008337746,0.00010686812,0.000060513426,0.0000430558,0.00019524939,0.000053216176,0.3053695,0.009262334,0.67609674,0.008583182,0.00006287842],"about_ca_topic_score_codex":0.000748805,"about_ca_topic_score_gemma":0.0004869966,"teacher_disagreement_score":0.005399251,"about_ca_system_score_codex":0.0019494356,"about_ca_system_score_gemma":0.002014441,"threshold_uncertainty_score":0.02855432},"labels":[],"label_agreement":null},{"id":"W2951629521","doi":"10.1142/s0129054119400239","title":"Most Complex Non-Returning Regular Languages","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Upper and lower bounds; Regular language; State (computer science); Semigroup; Discrete mathematics; Star (game theory); Mathematics; Combinatorics; Binary number; Automaton; Computer science; Algorithm; Theoretical computer science; Arithmetic","score_opus":0.02039698106508405,"score_gpt":0.31923168493430226,"score_spread":0.29883470386921823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951629521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65808076,0.0003567015,0.31814376,0.001085699,0.000053229345,0.0002224802,0.0009889306,0.0016693592,0.01939913],"genre_scores_gemma":[0.91638595,0.00016539854,0.077424586,0.00019907347,0.00004592128,0.00015682544,0.00080462225,0.00024498813,0.004572607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998086,0.00030843672,0.00023442796,0.00050891715,0.0006647027,0.00019760139],"domain_scores_gemma":[0.9896975,0.0051436936,0.0014595252,0.002025102,0.0012725436,0.00040157235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097412785,0.00035739917,0.0004489952,0.00050158694,0.00079954363,0.0021220886,0.0012524966,0.0005333165,0.0051449384],"category_scores_gemma":[0.006761292,0.00047355518,0.000853164,0.00050375576,0.0016144648,0.00352847,0.0016487474,0.0013309714,0.0008191902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069044746,0.00024525885,0.008114255,0.00074163044,0.000062692954,0.0010098632,0.0026646806,0.014765923,0.08671308,0.8153795,0.0031179977,0.0664947],"study_design_scores_gemma":[0.00006435149,0.00026567696,0.005308034,0.00008955236,0.00011827848,0.0017820972,0.00094139023,0.068635345,0.110693604,0.7890145,0.02297161,0.00011551851],"about_ca_topic_score_codex":0.00033884004,"about_ca_topic_score_gemma":0.0004764307,"teacher_disagreement_score":0.0051449384,"about_ca_system_score_codex":0.0008752421,"about_ca_system_score_gemma":0.00077448896,"threshold_uncertainty_score":0.017211497},"labels":[],"label_agreement":null},{"id":"W2951958096","doi":"10.1142/s0129054120410075","title":"The Intersection Problem for Finite Semigroups","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Decidability; Special classes of semigroups; Intersection (aeronautics); Mathematics; Commutative property; Semigroup; Complexity class; Monoid; Bounded function; Class (philosophy); Word problem (mathematics education); Discrete mathematics; Morphism; Order (exchange); Krohn–Rhodes theory; Pure mathematics; Time complexity; Computer science; Arithmetic","score_opus":0.026329324620930957,"score_gpt":0.30822186272285923,"score_spread":0.28189253810192827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951958096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037534,0.0013411298,0.26221114,0.0057245353,0.00010675754,0.00027447127,0.0019439602,0.0012122559,0.023432255],"genre_scores_gemma":[0.943066,0.0005444517,0.047646284,0.0002922801,0.0002484913,0.00021631298,0.0025166213,0.0001911772,0.0052784714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459165,0.0012395091,0.00058784714,0.0015541804,0.0014008029,0.0006259997],"domain_scores_gemma":[0.95666206,0.03683802,0.0018570852,0.0022046997,0.0012407635,0.0011973103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032153379,0.0006213792,0.001583523,0.0016320157,0.0029585385,0.006554853,0.0020130905,0.0016834225,0.008262462],"category_scores_gemma":[0.018900976,0.00083907647,0.0024835807,0.002030672,0.00482601,0.016009575,0.004268739,0.004350547,0.00064660126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014343151,0.00040161176,0.007643981,0.0007842249,0.00017887991,0.00068391033,0.0034182558,0.03869976,0.006993284,0.86781543,0.006141104,0.06580524],"study_design_scores_gemma":[0.000078926634,0.00009014022,0.0010999889,0.0000655357,0.00006755255,0.0004208122,0.00075605646,0.07800834,0.0068921377,0.9082106,0.004258534,0.000051341987],"about_ca_topic_score_codex":0.0017654705,"about_ca_topic_score_gemma":0.0010906579,"teacher_disagreement_score":0.008262462,"about_ca_system_score_codex":0.0032376954,"about_ca_system_score_gemma":0.0025582353,"threshold_uncertainty_score":0.02764064},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013466439627247716,"score_gpt":0.2863128427988463,"score_spread":0.2728464031715986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952369254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17035542,0.001940509,0.74742377,0.003447638,0.00018467307,0.00012307441,0.00032063332,0.00019069556,0.07601359],"genre_scores_gemma":[0.9290754,0.0018821347,0.058140416,0.0004276612,0.00047412058,0.00017076188,0.00022227774,0.0001772445,0.00942994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998505,0.0004081321,0.00006014864,0.00020562939,0.00058780686,0.00023336643],"domain_scores_gemma":[0.99660045,0.0020407033,0.0002423995,0.0005118777,0.0004655251,0.00013910967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628323,0.0006174731,0.00088358915,0.0018207983,0.0016881162,0.0024669617,0.0013267158,0.0012405661,0.0059176744],"category_scores_gemma":[0.007693623,0.00032626837,0.0010949757,0.0009545438,0.0046502366,0.0072796675,0.0020441213,0.0026057803,0.0006017903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044994504,0.0000053820568,0.00007378218,0.000019358995,0.0000030252047,0.000012148726,0.000040756302,0.0035336928,0.00025729684,0.9943936,0.00022391141,0.0014326948],"study_design_scores_gemma":[0.000003642978,0.000011202793,0.00015711588,0.000015458307,0.000003883274,0.000027971493,0.000035556728,0.03887163,0.00045316762,0.9579979,0.0024131641,0.000009237207],"about_ca_topic_score_codex":0.0011382955,"about_ca_topic_score_gemma":0.0005244056,"teacher_disagreement_score":0.0059176744,"about_ca_system_score_codex":0.0021051953,"about_ca_system_score_gemma":0.0011541619,"threshold_uncertainty_score":0.01979655},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028626477348128468,"score_gpt":0.3462912195548554,"score_spread":0.31766474220672697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7795151,0.0012735388,0.1828075,0.00074242614,0.00010442917,0.000065626155,0.00039103115,0.00089446944,0.03420598],"genre_scores_gemma":[0.97994244,0.00032299123,0.01714893,0.000065400614,0.00008539565,0.000038427752,0.00021563882,0.000119820026,0.0020610641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.000090268266,0.000059475635,0.00019520102,0.00019385439,0.00011277724],"domain_scores_gemma":[0.99432266,0.003822151,0.000395316,0.0006565859,0.0005994719,0.00020390772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061901956,0.0005742991,0.00055679504,0.0018617378,0.0007914229,0.0027120484,0.00048825302,0.00043288292,0.0029038468],"category_scores_gemma":[0.011215149,0.00034653296,0.0003937116,0.0013259477,0.0022972124,0.005363385,0.0014314204,0.0015766931,0.00053260487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037730215,0.000056189365,0.008525268,0.00031017503,0.00003274644,0.0004912154,0.0012072609,0.011065984,0.0156491,0.9051342,0.0026589646,0.054491647],"study_design_scores_gemma":[0.00004669807,0.000041807223,0.0015921256,0.00009456248,0.00003410371,0.00030657972,0.00016471901,0.048977137,0.014980883,0.92826486,0.005446892,0.000049508533],"about_ca_topic_score_codex":0.0009254964,"about_ca_topic_score_gemma":0.00088185986,"teacher_disagreement_score":0.0029038468,"about_ca_system_score_codex":0.0014997749,"about_ca_system_score_gemma":0.0007774134,"threshold_uncertainty_score":0.010881662},"labels":[],"label_agreement":null},{"id":"W2964084228","doi":"10.1142/s0129054112400096","title":"<font>L</font>-SYSTEMS IN GEOMETRIC MODELING","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Bézier curve; Context (archaeology); Parametric equation; Parametric statistics; Font; Computer science; Geometric design; Subdivision; Geometric modeling; Algorithm; Parametric model; Mathematics; Interpretation (philosophy); Pure mathematics; Geometry; Artificial intelligence","score_opus":0.022264680893232927,"score_gpt":0.3062847088080332,"score_spread":0.2840200279148003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964084228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005734557,0.0014423481,0.93898284,0.0024400426,0.0012427252,0.000049624476,0.00036432815,0.0012117946,0.048531793],"genre_scores_gemma":[0.32770225,0.0035564948,0.6021965,0.0029787056,0.0021825193,0.00034665148,0.001183969,0.0016361148,0.058216758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988194,0.00043767318,0.00010345308,0.00021982606,0.00034623456,0.000073384275],"domain_scores_gemma":[0.99859506,0.0004982281,0.00014722906,0.00036712282,0.00031777375,0.00007456525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010684732,0.00068851653,0.0005169321,0.0010599166,0.0009290751,0.0034106066,0.0010450298,0.001467676,0.023861913],"category_scores_gemma":[0.0038163823,0.00036657747,0.00092675164,0.0014395342,0.0023497595,0.004101302,0.0024559118,0.002436101,0.010617806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018117309,0.00001188528,0.00014165774,0.00009437259,0.0000074208697,0.00014523837,0.00020294148,0.007154193,0.0016522534,0.945279,0.012622164,0.032670766],"study_design_scores_gemma":[0.000008682408,0.000045388042,0.00018898847,0.000093623916,0.000008596614,0.00024440093,0.00007243449,0.050599568,0.0028332758,0.79602164,0.14984788,0.00003552807],"about_ca_topic_score_codex":0.001184131,"about_ca_topic_score_gemma":0.000835763,"teacher_disagreement_score":0.023861913,"about_ca_system_score_codex":0.0009248498,"about_ca_system_score_gemma":0.0005181027,"threshold_uncertainty_score":0.07982606},"labels":[],"label_agreement":null},{"id":"W2971864569","doi":"10.1142/s0129054121420041","title":"Descriptional Complexity of Semi-Simple Splicing Systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Regular language; RNA splicing; Axiom; Mathematics; Set (abstract data type); Recursively enumerable language; Simple (philosophy); Focus (optics); Combinatorics; Discrete mathematics; Computer science; Theoretical computer science; Physics; Automaton; Genetics; RNA","score_opus":0.04492041818409099,"score_gpt":0.30748736289904227,"score_spread":0.2625669447149513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971864569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63589555,0.0013254116,0.34101593,0.0030567332,0.000055410863,0.00018747254,0.0019097396,0.0009171166,0.015636647],"genre_scores_gemma":[0.9607004,0.0004979688,0.033943105,0.00019315133,0.000058476446,0.00024264432,0.0013441786,0.00011137008,0.0029087414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606246,0.0010804912,0.00045568167,0.00076454366,0.0012627586,0.00037401242],"domain_scores_gemma":[0.9833266,0.012236319,0.0013991457,0.0015411988,0.0010169429,0.00047977918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901205,0.00064315606,0.0010699624,0.0014855235,0.0011011027,0.00402368,0.0023903172,0.001694804,0.0035104225],"category_scores_gemma":[0.011130854,0.0008878231,0.0017972738,0.001324835,0.0038560908,0.008006674,0.0031339582,0.0024647554,0.0004187089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016276177,0.000110751644,0.003314655,0.00035149403,0.00012011399,0.00041890374,0.0016415932,0.108399905,0.0051972796,0.8636263,0.0015522849,0.015103893],"study_design_scores_gemma":[0.000028948009,0.00002392751,0.00038135453,0.000017588123,0.000025732408,0.00011404132,0.00013943017,0.17025727,0.0012930545,0.8263165,0.0013730623,0.00002909678],"about_ca_topic_score_codex":0.0022192006,"about_ca_topic_score_gemma":0.0014971694,"teacher_disagreement_score":0.00402368,"about_ca_system_score_codex":0.0029409763,"about_ca_system_score_gemma":0.0012098368,"threshold_uncertainty_score":0.021338403},"labels":[],"label_agreement":null},{"id":"W2973381442","doi":"10.1142/s0129054119400367","title":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Quotient; Context-free language; Nested word; Discrete mathematics; String (physics); Regular language; Mathematics; Closure (psychology); Computer science; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Finite-state machine; Automata theory; Automaton; Rule-based machine translation; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.022675386170567174,"score_gpt":0.2866288769865917,"score_spread":0.2639534908160245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973381442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80003273,0.00019510432,0.19002084,0.00055463775,0.000042795426,0.00011100406,0.0005818948,0.0010389773,0.0074219583],"genre_scores_gemma":[0.98246884,0.000072595605,0.0154836,0.000037629896,0.000022233446,0.00009797085,0.0003392049,0.000080601145,0.0013972075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706465,0.00053404574,0.00030431568,0.0007657758,0.00081649766,0.00051486236],"domain_scores_gemma":[0.98245,0.012578086,0.000960145,0.0019236589,0.001295109,0.0007930997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015384357,0.00053513976,0.0010644783,0.000963104,0.00111713,0.0038211732,0.0013141531,0.00078507874,0.004200953],"category_scores_gemma":[0.011622324,0.00041740586,0.0014818884,0.00072661805,0.0026843778,0.006655208,0.0025676885,0.0017423617,0.00031264446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021082675,0.00041680766,0.014646881,0.00050048175,0.0001580765,0.0008148278,0.0025913643,0.2723872,0.051329628,0.58989954,0.0019205782,0.06322638],"study_design_scores_gemma":[0.00006203035,0.00015958986,0.0014476893,0.00002046613,0.00007633429,0.00015061698,0.00014189236,0.6421192,0.021055335,0.33358788,0.0011227806,0.000056212102],"about_ca_topic_score_codex":0.0035351822,"about_ca_topic_score_gemma":0.002026333,"teacher_disagreement_score":0.004200953,"about_ca_system_score_codex":0.0029707644,"about_ca_system_score_gemma":0.0023318923,"threshold_uncertainty_score":0.02155453},"labels":[],"label_agreement":null},{"id":"W2973570009","doi":"10.1142/s0129054119400306","title":"Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Suffix; Prefix; Factor (programming language); Regular language; Star (game theory); Computer science; Mathematics; Complementation; Discrete mathematics; Linguistics; Artificial intelligence; Programming language; Automaton","score_opus":0.01206863278707973,"score_gpt":0.2887628517587392,"score_spread":0.27669421897165947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973570009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85746616,0.00016012884,0.12596196,0.00032583642,0.0000305271,0.00013356826,0.00032394458,0.00032653415,0.015271261],"genre_scores_gemma":[0.9636066,0.00013028669,0.029713577,0.000059118775,0.000037746453,0.00014443527,0.00040843184,0.00008933379,0.0058103567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988477,0.00022474455,0.00011315619,0.00021158955,0.00032323058,0.00027952285],"domain_scores_gemma":[0.9959831,0.0016577932,0.00084600196,0.0004544823,0.00059570064,0.0004629814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012662786,0.00047743952,0.0006900948,0.00084842433,0.0015185723,0.0018581508,0.00096842326,0.0004194797,0.005103163],"category_scores_gemma":[0.004558061,0.00030370074,0.0011835526,0.00081319455,0.0020790268,0.0039394037,0.001184628,0.000976249,0.0007754719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005747847,0.00017513517,0.003539763,0.00015880965,0.000049825485,0.0005443784,0.0012269255,0.036961377,0.014854013,0.9280087,0.0010425694,0.012863785],"study_design_scores_gemma":[0.00012573942,0.00021175033,0.0011930557,0.000035081255,0.00007385293,0.0005472763,0.0007041812,0.10429308,0.021890357,0.8661838,0.0046351575,0.00010660969],"about_ca_topic_score_codex":0.0015170873,"about_ca_topic_score_gemma":0.0018479931,"teacher_disagreement_score":0.005103163,"about_ca_system_score_codex":0.0012522688,"about_ca_system_score_gemma":0.0017967777,"threshold_uncertainty_score":0.017071784},"labels":[],"label_agreement":null},{"id":"W3028589106","doi":"10.1142/s0129054121410094","title":"An Inequality for the Number of Periods in a Word","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Prefix; Square-free integer; Inequality; Exponent; Representation (politics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Linguistics; Geometry; Law","score_opus":0.03514299275799944,"score_gpt":0.3783249735212547,"score_spread":0.3431819807632553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028589106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65347433,0.0023869686,0.26806557,0.002631366,0.00043527217,0.0001259602,0.000987822,0.00055848894,0.07133424],"genre_scores_gemma":[0.9511437,0.00054387597,0.03861637,0.00038246662,0.00050698465,0.00022317952,0.00036270448,0.0002564331,0.00796426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764663,0.00040062043,0.00021837972,0.0006718862,0.000620528,0.0004419864],"domain_scores_gemma":[0.98731637,0.008427879,0.0011185341,0.0011837783,0.0010750521,0.0008784534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025028095,0.00073171814,0.0009801852,0.0020506538,0.0016704313,0.002931354,0.0016715911,0.0011046665,0.006351796],"category_scores_gemma":[0.012337251,0.00063631526,0.00093584985,0.0010660645,0.0039110174,0.0076891896,0.0029654007,0.0022842763,0.0010470753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007458429,0.00009154285,0.006326208,0.00036676976,0.000076009244,0.0007341522,0.0010460177,0.0053422884,0.03374118,0.91543394,0.0026603132,0.03343581],"study_design_scores_gemma":[0.00008120899,0.00031228774,0.004556041,0.00012710052,0.0001111137,0.0010329548,0.00028023208,0.044943172,0.01499104,0.9240652,0.00939564,0.000104102015],"about_ca_topic_score_codex":0.00043436378,"about_ca_topic_score_gemma":0.0003975567,"teacher_disagreement_score":0.006351796,"about_ca_system_score_codex":0.0015856994,"about_ca_system_score_gemma":0.00077829475,"threshold_uncertainty_score":0.021248877},"labels":[],"label_agreement":null},{"id":"W3116871471","doi":"10.1142/s0129054120420095","title":"Semilinearity of Families of Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Linguistics; Computer science; Sociology; Philosophy","score_opus":0.017634115768495644,"score_gpt":0.30219732675415434,"score_spread":0.2845632109856587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116871471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459532,0.0007676365,0.75840443,0.0012380658,0.00016437541,0.00017584492,0.0009532541,0.002172185,0.0515289],"genre_scores_gemma":[0.8453786,0.00052004476,0.13307224,0.0005314216,0.00020743211,0.00037091319,0.0010633117,0.0005148991,0.018341213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704933,0.0006935974,0.00032985647,0.00087408884,0.0007207662,0.0003323342],"domain_scores_gemma":[0.98869705,0.006381325,0.00084305817,0.0019240533,0.0017090499,0.0004455656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023224112,0.0003645972,0.000527498,0.0013572244,0.0015460205,0.0023119135,0.0010437017,0.00053508976,0.006783828],"category_scores_gemma":[0.0058692214,0.00076679897,0.0017190482,0.0006577098,0.003346148,0.008129444,0.0030180567,0.0024507572,0.000924897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009083073,0.000046471672,0.0015537482,0.00016502026,0.000026747894,0.00039218986,0.0019457622,0.0028049015,0.00881967,0.96070784,0.0018627623,0.021584114],"study_design_scores_gemma":[0.000025484298,0.00009115535,0.0008602284,0.000072957875,0.000041003168,0.0009885835,0.00066724495,0.025484301,0.012299122,0.9336175,0.025799846,0.000052754458],"about_ca_topic_score_codex":0.00086492667,"about_ca_topic_score_gemma":0.000803035,"teacher_disagreement_score":0.006783828,"about_ca_system_score_codex":0.0016706652,"about_ca_system_score_gemma":0.0010711077,"threshold_uncertainty_score":0.02269411},"labels":[],"label_agreement":null},{"id":"W3120557648","doi":"10.1142/s0129054121500106","title":"Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Bounded function; Computer science; Decidability; Timed automaton; Automaton; Word (group theory); Discretization; Upper and lower bounds; Regular language; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science","score_opus":0.0166647698265721,"score_gpt":0.3381901749490095,"score_spread":0.3215254051224374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120557648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0429688,0.00008731551,0.95287466,0.000113384354,0.000054164273,0.00014802981,0.0001692018,0.0011008098,0.0024836317],"genre_scores_gemma":[0.7392891,0.00013395707,0.2576618,0.00013783814,0.00002533879,0.00032972835,0.00048756466,0.00013090788,0.0018036274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588495,0.0008124691,0.00038779643,0.00091754785,0.0015993393,0.00039776604],"domain_scores_gemma":[0.99576557,0.0022619616,0.00040120276,0.00078283396,0.00069577206,0.00009262666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881068,0.00034488543,0.00045112116,0.00052840385,0.00061086036,0.0013191553,0.0011540536,0.0004996162,0.0020562636],"category_scores_gemma":[0.0060330504,0.00030711817,0.0015583446,0.00049693254,0.0018629859,0.0021708617,0.0016659454,0.0011934413,0.0002717527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079368264,0.0002824798,0.004507852,0.00064096047,0.00016462544,0.0018873283,0.0020548205,0.19153419,0.11823868,0.58567727,0.0019199633,0.092298105],"study_design_scores_gemma":[0.00013595053,0.00024791757,0.0005756475,0.00008021969,0.00008903423,0.0005340999,0.00024711524,0.7512308,0.07316102,0.16459711,0.0090371175,0.000063997715],"about_ca_topic_score_codex":0.003452073,"about_ca_topic_score_gemma":0.0022308624,"teacher_disagreement_score":0.003452073,"about_ca_system_score_codex":0.0011173716,"about_ca_system_score_gemma":0.0020636488,"threshold_uncertainty_score":0.008107185},"labels":[],"label_agreement":null},{"id":"W3126750858","doi":"10.1142/s0129054121410033","title":"Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Separable space; Mathematics; Partition (number theory); Zero (linguistics); Embedding; Word (group theory); Constructive; Rational number; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.011756043757670224,"score_gpt":0.26541966523242494,"score_spread":0.25366362147475474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126750858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15621094,0.00034140266,0.8259807,0.0009936616,0.00010667454,0.000088204,0.00012867774,0.00072028505,0.015429411],"genre_scores_gemma":[0.7585519,0.0003324457,0.22559533,0.0003202511,0.00012642148,0.00021141834,0.000406439,0.0004429757,0.014012771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799,0.00041605916,0.0001547283,0.0005969368,0.0004604332,0.00038184106],"domain_scores_gemma":[0.9958274,0.0023638087,0.00029341763,0.00086285407,0.0003429693,0.00030952122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017813746,0.00079604087,0.0008168918,0.0008460174,0.0018725984,0.0022467,0.0017922941,0.0015166532,0.0049119834],"category_scores_gemma":[0.0052508707,0.0008073474,0.0012941628,0.00095269084,0.0054864925,0.008507513,0.004679923,0.0029616093,0.0011616306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009635627,0.000030523624,0.0003764755,0.00009138938,0.000011184287,0.00020500598,0.00083367655,0.0064225076,0.0067503336,0.9641677,0.0006215648,0.020393157],"study_design_scores_gemma":[0.000022760789,0.000040499646,0.00012743626,0.000024801031,0.000029569028,0.00015141703,0.00036724072,0.023975914,0.008206284,0.9620378,0.0049862806,0.00002997101],"about_ca_topic_score_codex":0.0015139506,"about_ca_topic_score_gemma":0.0020804745,"teacher_disagreement_score":0.0049119834,"about_ca_system_score_codex":0.0016035609,"about_ca_system_score_gemma":0.0012422913,"threshold_uncertainty_score":0.016432226},"labels":[],"label_agreement":null},{"id":"W3130094013","doi":"10.1142/s0129054121410057","title":"Generalizations of Code Languages with Marginal Errors","year":2021,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Prefix; Suffix; String (physics); Prefix code; Context-free language; Regular language; Mathematics; Combinatorics; Discrete mathematics; Compressed suffix array; Computer science; Suffix tree; Automaton; Algorithm; Theoretical computer science; Linguistics; Linear code; Natural language processing; Rule-based machine translation","score_opus":0.014953662195514748,"score_gpt":0.31410213911426543,"score_spread":0.2991484769187507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130094013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23624316,0.0005620506,0.7290446,0.0019593562,0.0002510589,0.000336752,0.001594628,0.0052979463,0.024710465],"genre_scores_gemma":[0.7719976,0.00043807807,0.21087688,0.00090066687,0.0003024577,0.00040167116,0.0015218081,0.0012514687,0.012309355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995533,0.00053227576,0.00044967132,0.0012444505,0.0015105207,0.0007300376],"domain_scores_gemma":[0.9816969,0.0087977545,0.0016257424,0.004784187,0.0022879126,0.0008075244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020392733,0.0008674267,0.0007661153,0.0016718514,0.0015416258,0.0029556735,0.0022881287,0.0010398325,0.0059259436],"category_scores_gemma":[0.019777393,0.00083638163,0.0023637738,0.001541228,0.004351919,0.007136559,0.004733646,0.0043393876,0.0010600161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025896184,0.000095343996,0.0019189969,0.0002938715,0.00004160673,0.0006281531,0.0011820444,0.03236273,0.006597638,0.8992243,0.0043599242,0.053036474],"study_design_scores_gemma":[0.000039603106,0.00003954076,0.00026534733,0.00004422168,0.000034750337,0.00038209066,0.00013589059,0.059011713,0.007017854,0.9232198,0.009751604,0.000057541616],"about_ca_topic_score_codex":0.003678827,"about_ca_topic_score_gemma":0.0027704255,"teacher_disagreement_score":0.0059259436,"about_ca_system_score_codex":0.0023806759,"about_ca_system_score_gemma":0.0025437654,"threshold_uncertainty_score":0.019824266},"labels":[],"label_agreement":null},{"id":"W3152988225","doi":"10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Euclidean geometry; Geometric networks; Approximation algorithm; Time complexity; Network planning and design; Computer science; Polynomial; Geometric design; Euclidean space; Algorithm; Mathematical optimization; Polynomial-time approximation scheme; Discrete mathematics; Theoretical computer science; Mathematics; Graph theory; Combinatorics; Geometry","score_opus":0.09136408144728773,"score_gpt":0.34830072277790397,"score_spread":0.2569366413306162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152988225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030323856,0.0011819114,0.9581024,0.0010705852,0.00011515002,0.00017624146,0.0005023454,0.0015643409,0.006963183],"genre_scores_gemma":[0.3954516,0.0010732255,0.5942636,0.000431553,0.00019358828,0.00034084747,0.0020415247,0.00046997226,0.0057340623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808705,0.0005756285,0.00008697295,0.0004871692,0.0003922081,0.00037101645],"domain_scores_gemma":[0.99627656,0.0021002514,0.00036138546,0.0008457647,0.00023928803,0.00017672553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988565,0.0019322664,0.0021991273,0.0010587097,0.00096673303,0.0025064095,0.0032785297,0.002225259,0.008624668],"category_scores_gemma":[0.007936962,0.0008307675,0.0013772204,0.0029958868,0.0011751904,0.0065682274,0.0022377209,0.0032031971,0.0017075585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006671926,0.00036518945,0.0012850066,0.0005360312,0.00012975384,0.00013697929,0.0002521168,0.7249243,0.003341416,0.08446067,0.01943501,0.1644663],"study_design_scores_gemma":[0.00009558122,0.00006399664,0.00013899867,0.00001731866,0.000029545086,0.000074519,0.00006383486,0.9167324,0.000804738,0.079446025,0.0025211999,0.000011992362],"about_ca_topic_score_codex":0.0038235465,"about_ca_topic_score_gemma":0.006568219,"teacher_disagreement_score":0.008624668,"about_ca_system_score_codex":0.002749282,"about_ca_system_score_gemma":0.0019489152,"threshold_uncertainty_score":0.028852403},"labels":[],"label_agreement":null},{"id":"W3158013313","doi":"10.1142/s0129054121410045","title":"Generalizations of Checking Stack Automata: Characterizations and Hierarchies","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decidability; Turing machine; Computer science; Automaton; Stack (abstract data type); Theoretical computer science; Bounded function; Expressive power; Pushdown automaton; Automata theory; PSPACE; Discrete mathematics; Mathematics; Computational complexity theory; Programming language; Algorithm; Computation","score_opus":0.014366912644291241,"score_gpt":0.28497822296240233,"score_spread":0.2706113103181111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158013313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4371498,0.0027307891,0.5252642,0.0020836496,0.00016602347,0.00036937548,0.0014601172,0.002433841,0.02834222],"genre_scores_gemma":[0.91478294,0.00092879374,0.08035433,0.00038610882,0.00029296003,0.00021984382,0.0006801908,0.00027218452,0.0020826804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942099,0.0011061232,0.0005681665,0.0015718048,0.0017045249,0.00083949626],"domain_scores_gemma":[0.9714589,0.01696077,0.0024314036,0.0059517603,0.001880521,0.0013167636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028478643,0.0011794784,0.0014809608,0.0038964844,0.002024968,0.004227023,0.0034772458,0.0017362788,0.0052200537],"category_scores_gemma":[0.016926669,0.0011958178,0.0031511574,0.004415875,0.004880065,0.012801398,0.0036945534,0.0052660303,0.0004363585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001983647,0.00020048716,0.007824704,0.0005716359,0.00012922545,0.0007253931,0.0024906446,0.05692775,0.013205537,0.8770273,0.0023230463,0.03837594],"study_design_scores_gemma":[0.000026083144,0.000065845736,0.0014685531,0.000087934044,0.000095916235,0.0005097837,0.0003731276,0.15727147,0.005067661,0.8306934,0.00425405,0.00008621762],"about_ca_topic_score_codex":0.0040001962,"about_ca_topic_score_gemma":0.0036477523,"teacher_disagreement_score":0.0052200537,"about_ca_system_score_codex":0.002726249,"about_ca_system_score_gemma":0.0016400442,"threshold_uncertainty_score":0.019780338},"labels":[],"label_agreement":null},{"id":"W3169850973","doi":"10.1142/s0129054121420028","title":"Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Regular language; Mathematics; State (computer science); Combinatorics; Word (group theory); Discrete mathematics; Computer science; Automaton; Artificial intelligence; Algorithm","score_opus":0.012540010066171578,"score_gpt":0.2983123553723818,"score_spread":0.28577234530621026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169850973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23198636,0.0002880491,0.7570027,0.00092213694,0.00006653375,0.00020391817,0.000748073,0.0034281875,0.0053539895],"genre_scores_gemma":[0.54730195,0.00024981415,0.44528195,0.00028325262,0.000070521266,0.00032675322,0.0020042413,0.00054912304,0.003932412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960622,0.000679542,0.0004658218,0.001344444,0.00086859724,0.00057943823],"domain_scores_gemma":[0.98641557,0.009644799,0.0011495717,0.001739414,0.0007580103,0.00029275144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018754087,0.00090909534,0.001116069,0.0017326567,0.0011878251,0.003965337,0.0022607376,0.0016168137,0.004550365],"category_scores_gemma":[0.015114926,0.0012605914,0.0031756053,0.0019239307,0.0032337676,0.012250168,0.002958917,0.0024228191,0.0010836744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00167346,0.0006196519,0.011907204,0.0015467384,0.00020300919,0.00093577366,0.0031386027,0.20445709,0.062804885,0.50103676,0.00464074,0.20703611],"study_design_scores_gemma":[0.00010498945,0.00016902854,0.0008064378,0.00010337515,0.00013810582,0.000249647,0.00035184072,0.320304,0.04877221,0.6241849,0.0047028447,0.000112591806],"about_ca_topic_score_codex":0.004368917,"about_ca_topic_score_gemma":0.006553415,"teacher_disagreement_score":0.004550365,"about_ca_system_score_codex":0.0025427553,"about_ca_system_score_gemma":0.0027331326,"threshold_uncertainty_score":0.018449008},"labels":[],"label_agreement":null},{"id":"W3199131588","doi":"10.1142/s0129054121420090","title":"Space Complexity of Stack Automata Models","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Automaton; Measure (data warehouse); Stack (abstract data type); Bounded function; Computer science; Word (group theory); Discrete mathematics; Function (biology); Mathematics; Pushdown automaton; Theoretical computer science; Programming language","score_opus":0.051088884067070364,"score_gpt":0.31622316539600487,"score_spread":0.2651342813289345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199131588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48687878,0.0015880591,0.4907061,0.0017558142,0.00008273319,0.0001685346,0.0013851364,0.0013122453,0.016122455],"genre_scores_gemma":[0.9488344,0.0005770235,0.045155756,0.00012961347,0.0001313258,0.00024760852,0.0007726082,0.0002519598,0.0038997012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942498,0.0012422225,0.0005041181,0.0011142965,0.0021102582,0.00077926466],"domain_scores_gemma":[0.9720344,0.02145975,0.0019248637,0.0026353726,0.0011734149,0.00077227445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021206622,0.0012486231,0.0013992765,0.0023051198,0.0015082913,0.0066097733,0.0024249973,0.0019061118,0.006595318],"category_scores_gemma":[0.017017424,0.0009833464,0.0025330058,0.002300376,0.0038917696,0.015564638,0.0036010698,0.002513421,0.00053500815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041172197,0.00012795658,0.00437686,0.00039638815,0.0001584867,0.00028533486,0.0012730156,0.22601432,0.007246331,0.73866427,0.0014510987,0.01959428],"study_design_scores_gemma":[0.000028222199,0.000064982436,0.0005740904,0.000029737372,0.000054482516,0.00013354502,0.00014525873,0.34233204,0.0031874091,0.65157384,0.0018360699,0.000040360133],"about_ca_topic_score_codex":0.0030109803,"about_ca_topic_score_gemma":0.0021087977,"teacher_disagreement_score":0.0066097733,"about_ca_system_score_codex":0.003331586,"about_ca_system_score_gemma":0.0019443914,"threshold_uncertainty_score":0.024172485},"labels":[],"label_agreement":null},{"id":"W4230315400","doi":"10.1142/s0129054113400364","title":"MULTIPSEUDOPERIODIC WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Simple (philosophy); Word (group theory); Mathematics; Palindrome; Natural number; Combinatorics; Discrete mathematics; Computer science; Linguistics","score_opus":0.01158208468288874,"score_gpt":0.2736022467836538,"score_spread":0.26202016210076506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230315400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63308495,0.0015353338,0.28033817,0.00062078866,0.00036313126,0.00017579937,0.00034034063,0.00051886943,0.08302263],"genre_scores_gemma":[0.94592005,0.000347978,0.03991869,0.00014727349,0.00013234916,0.00013645273,0.0001872582,0.000066292916,0.013143648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996904,0.000052188127,0.000029687615,0.00010496045,0.0000621391,0.000060672857],"domain_scores_gemma":[0.99951136,0.00013888357,0.00009433132,0.00010362659,0.0000893715,0.00006238458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029579207,0.000360477,0.00029811275,0.0005353997,0.0011316416,0.001060704,0.0005649126,0.00062971807,0.0057810983],"category_scores_gemma":[0.0009991052,0.00020049654,0.00044929574,0.00039756086,0.0012261734,0.002351418,0.0012767932,0.000573015,0.0009539616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001315166,0.000051663752,0.0009623438,0.00015749667,0.000012099809,0.0014994594,0.00079686474,0.0016721179,0.023172878,0.9478743,0.000837719,0.022831522],"study_design_scores_gemma":[0.000035710214,0.00021314344,0.000996143,0.000067716326,0.000034575136,0.0030550829,0.00083010085,0.0141263725,0.022629414,0.9162458,0.04171898,0.000046864418],"about_ca_topic_score_codex":0.000116170755,"about_ca_topic_score_gemma":0.00019243344,"teacher_disagreement_score":0.0057810983,"about_ca_system_score_codex":0.0003523281,"about_ca_system_score_gemma":0.00027221715,"threshold_uncertainty_score":0.01933968},"labels":[],"label_agreement":null},{"id":"W4232417187","doi":"10.1142/s0129054105003054","title":"PREFACE","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Computer science; Mathematics; Philosophy","score_opus":0.02243732172748708,"score_gpt":0.3440244698782949,"score_spread":0.3215871481508078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232417187","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014107765,0.010661258,0.011713803,0.037973434,0.32120344,0.00066903164,0.013478311,0.0019597288,0.6009302],"genre_scores_gemma":[0.0055829436,0.0043656845,0.0031511397,0.006783073,0.032947276,0.00029044488,0.0074075772,0.00092407037,0.9385478],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934703,0.000097990924,0.00004112466,0.0001121104,0.00034697028,0.000054830234],"domain_scores_gemma":[0.9942367,0.00082921266,0.0001765254,0.00050718134,0.003453539,0.0007969431],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013196453,0.0009679985,0.000591128,0.0030657884,0.0023787697,0.0030459564,0.0012131411,0.00085444696,0.42046204],"category_scores_gemma":[0.011529856,0.0002591128,0.0005253447,0.0018626915,0.0005299056,0.002254155,0.0019268602,0.0025923895,0.28880692],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025982969,0.000017716784,0.000077707715,0.00006811048,0.0000015341645,0.000025799214,0.000035778547,0.00004566929,0.000116113464,0.004080754,0.9628607,0.032644197],"study_design_scores_gemma":[0.0000042830156,0.000012410621,0.00021644268,0.00007746585,0.0000019319743,0.0000318641,0.000047206613,0.000028438822,0.00011123424,0.0035650674,0.99589914,0.000004481808],"about_ca_topic_score_codex":0.0039392468,"about_ca_topic_score_gemma":0.005102851,"teacher_disagreement_score":0.579538,"about_ca_system_score_codex":0.0016766774,"about_ca_system_score_gemma":0.0019026336,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4234130960","doi":"10.1142/s012905411940032x","title":"Branching Measures and Nearly Acyclic NFAs","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Path (computing); String (physics); Discrete mathematics; Computation; Finite-state machine; Directed acyclic graph; Automaton; Algorithm; Computer science; Automata theory","score_opus":0.010147681627145586,"score_gpt":0.27040780591959834,"score_spread":0.26026012429245277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234130960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24174626,0.0013514179,0.7393182,0.00083838013,0.00007800225,0.00008252551,0.00049281877,0.0009949176,0.01509745],"genre_scores_gemma":[0.86012816,0.0006571585,0.13423912,0.00028874536,0.00012492895,0.0002025269,0.00038726584,0.00018416594,0.0037880861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671656,0.00062109163,0.00030173754,0.00090048567,0.0010559564,0.0004041971],"domain_scores_gemma":[0.9847845,0.010334028,0.0015657422,0.001457574,0.0010465508,0.00081157935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020778656,0.0006755946,0.00065309316,0.0021332926,0.0010990509,0.0022220502,0.0010205728,0.0009069826,0.0036035124],"category_scores_gemma":[0.013651968,0.0005840233,0.0011271745,0.0020090586,0.0030377991,0.0064511276,0.0017792576,0.0024194806,0.0003131689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007911494,0.00003295392,0.0017637045,0.00007781309,0.000020457495,0.00010986839,0.00037193918,0.015416658,0.0036664035,0.9599294,0.00038102627,0.01815062],"study_design_scores_gemma":[0.000011319627,0.00002575936,0.00045675717,0.000021689033,0.000012812685,0.00010249615,0.000044724802,0.03497694,0.0009831517,0.96122205,0.0021236362,0.000018645656],"about_ca_topic_score_codex":0.0026482213,"about_ca_topic_score_gemma":0.0017437282,"teacher_disagreement_score":0.0036035124,"about_ca_system_score_codex":0.0022005255,"about_ca_system_score_gemma":0.0008038212,"threshold_uncertainty_score":0.015966058},"labels":[],"label_agreement":null},{"id":"W4245962026","doi":"10.1142/s012905411402002x","title":"PREFACE","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Library science; Computer science; Download; World Wide Web","score_opus":0.010147234711187279,"score_gpt":0.27748372626392215,"score_spread":0.26733649155273487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245962026","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014123671,0.010570618,0.007743024,0.041430302,0.30182812,0.00054439815,0.011330262,0.0015014089,0.6236395],"genre_scores_gemma":[0.0057321475,0.004061727,0.002458326,0.008076322,0.032947395,0.00027079973,0.0062620332,0.00072490855,0.93946636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926025,0.00011273911,0.000043020573,0.00012865133,0.00038729448,0.00006808411],"domain_scores_gemma":[0.9943481,0.00080831506,0.00019076109,0.00047563462,0.003191506,0.0009857414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013400523,0.0008901092,0.00056870026,0.0029267278,0.0023474959,0.0031827178,0.0012114178,0.0009368499,0.44632158],"category_scores_gemma":[0.0118421065,0.00023775335,0.0004847608,0.0017085668,0.0005509862,0.0022049,0.0021403693,0.0025624947,0.30010673],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026215592,0.000017755858,0.00008412471,0.00006948512,0.0000014707136,0.000025942538,0.000039699255,0.0000439946,0.00009911397,0.0043669892,0.9605202,0.03470499],"study_design_scores_gemma":[0.000004167729,0.000011809212,0.00020550516,0.00008759728,0.0000017035318,0.000030303023,0.000054526976,0.000024886729,0.00008670448,0.0036520471,0.99583685,0.0000039811284],"about_ca_topic_score_codex":0.003230692,"about_ca_topic_score_gemma":0.00468156,"teacher_disagreement_score":0.44632158,"about_ca_system_score_codex":0.0017600198,"about_ca_system_score_gemma":0.002209422,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4245987390","doi":"10.1142/s0129054118020033","title":"Preface","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02693178093746129,"score_gpt":0.35803170331140144,"score_spread":0.33109992237394015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245987390","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015113608,0.012105856,0.012221901,0.044630434,0.36234748,0.00067009585,0.013560529,0.0019305395,0.5510217],"genre_scores_gemma":[0.0072917524,0.005619939,0.0040668193,0.009885057,0.04694243,0.00039558878,0.008800513,0.0011760803,0.9158219],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923015,0.00012464136,0.00004821934,0.00013461942,0.00039928412,0.000063119405],"domain_scores_gemma":[0.9934436,0.0010624536,0.00021644896,0.00055622397,0.0038335684,0.0008875842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014423137,0.0009901422,0.0005850811,0.0029302365,0.0024615922,0.0031591044,0.0011893411,0.00089714315,0.39310193],"category_scores_gemma":[0.014527775,0.00025238155,0.0005132743,0.001799424,0.0005968886,0.002312753,0.0020893696,0.0028988337,0.27586356],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027008191,0.000018122466,0.000082472245,0.00007767296,0.0000016387664,0.000028561424,0.00004333074,0.000049390255,0.00011242504,0.00456844,0.9636055,0.031385504],"study_design_scores_gemma":[0.0000043874625,0.000013042228,0.00020978747,0.000097797034,0.0000019520432,0.000037576752,0.00005650803,0.000028348955,0.00011124666,0.004101975,0.9953324,0.0000050443173],"about_ca_topic_score_codex":0.0037757955,"about_ca_topic_score_gemma":0.0047370703,"teacher_disagreement_score":0.39310193,"about_ca_system_score_codex":0.0017588482,"about_ca_system_score_gemma":0.0021232683,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252967799","doi":"10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Suffix; Prefix; Regular language; Mathematics; Upper and lower bounds; Neighbourhood (mathematics); Combinatorics; State (computer science); Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science","score_opus":0.020896797954858718,"score_gpt":0.29279449418749776,"score_spread":0.27189769623263904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252967799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8134442,0.0003849263,0.16750906,0.0010254873,0.00006794259,0.00014904901,0.0018853938,0.0014445382,0.01408939],"genre_scores_gemma":[0.9763594,0.00015028367,0.01765112,0.00007535881,0.00003346337,0.0001383099,0.0010081965,0.00017678502,0.0044069365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710137,0.00044105912,0.00028966658,0.0008998579,0.0007984538,0.00046957977],"domain_scores_gemma":[0.98062205,0.012969368,0.0011481759,0.0030646524,0.0013097804,0.0008860367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903399,0.0004384266,0.0013398157,0.00083850697,0.0013808031,0.0034005353,0.0019377143,0.0012294264,0.010209993],"category_scores_gemma":[0.01487553,0.0005067905,0.0019712988,0.00092146697,0.0022958072,0.006327237,0.0037237972,0.00199604,0.00093259825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003980555,0.00043369769,0.015125266,0.0011384254,0.00024193176,0.0008613929,0.0026233648,0.36777574,0.06565136,0.45232165,0.006077858,0.08376876],"study_design_scores_gemma":[0.00008113661,0.00029655083,0.0024199686,0.000045651967,0.000113036804,0.00030474842,0.0002357674,0.5339879,0.019937916,0.44047025,0.002001598,0.000105470666],"about_ca_topic_score_codex":0.0024006264,"about_ca_topic_score_gemma":0.0022087786,"teacher_disagreement_score":0.010209993,"about_ca_system_score_codex":0.0018828524,"about_ca_system_score_gemma":0.0015113443,"threshold_uncertainty_score":0.034155905},"labels":[],"label_agreement":null},{"id":"W4253673406","doi":"10.1142/s0129054108006145","title":"PREFACE","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Library science; Queen (butterfly); Download; Computer science; World Wide Web; Ecology","score_opus":0.0378022316468655,"score_gpt":0.3347702542418501,"score_spread":0.29696802259498456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253673406","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014346358,0.011275664,0.011752912,0.038617563,0.32972112,0.0006528636,0.012890568,0.0018878941,0.59176683],"genre_scores_gemma":[0.006040468,0.0047878115,0.0034054823,0.007462155,0.036456026,0.0003118016,0.0075254375,0.0009756842,0.93303514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934083,0.00010062415,0.00004139196,0.00011479283,0.00034701877,0.000055324366],"domain_scores_gemma":[0.9944494,0.00082635507,0.00017305055,0.00048502503,0.0033043534,0.0007617972],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013123263,0.000977675,0.00059027085,0.0029706708,0.0023788116,0.0029892144,0.001209107,0.0008543981,0.40661594],"category_scores_gemma":[0.011661268,0.00025600838,0.00051816565,0.0018197456,0.00055118685,0.002255673,0.0019408762,0.0026701398,0.2804829],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025868125,0.000017821934,0.00007844209,0.00007089438,0.0000015626727,0.000026541999,0.000037709862,0.000047065638,0.000117312666,0.004343358,0.9624292,0.032804146],"study_design_scores_gemma":[0.0000042226925,0.000012600981,0.0002127775,0.000081851496,0.0000019192105,0.000033488723,0.000048738217,0.000028299155,0.00011084767,0.0037347125,0.99572587,0.0000045758534],"about_ca_topic_score_codex":0.0038137056,"about_ca_topic_score_gemma":0.0048806467,"teacher_disagreement_score":0.593384,"about_ca_system_score_codex":0.0016691944,"about_ca_system_score_gemma":0.0019237871,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4317402046","doi":"10.1142/s0129054122460078","title":"Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Scheduling (production processes); Price of anarchy; Mathematical optimization; Best response; Schedule; Single-machine scheduling; Game theory; Job shop scheduling; Mathematical economics; Mathematics; Price of stability; Economics","score_opus":0.046164140740085784,"score_gpt":0.29706401677237637,"score_spread":0.2508998760322906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317402046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18607214,0.00012445841,0.80192894,0.00047998127,0.000038306272,0.000209353,0.00019652981,0.00019372256,0.010756588],"genre_scores_gemma":[0.90097696,0.00017090948,0.09231644,0.00011486538,0.000028962224,0.00032155984,0.00016041762,0.000062180705,0.0058476077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855214,0.0006648324,0.00006865887,0.00025566464,0.00022716113,0.00023155291],"domain_scores_gemma":[0.99613804,0.0025117337,0.00045869846,0.0002677212,0.0003311791,0.00029256823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015861199,0.0011837177,0.0013858151,0.0006368161,0.00093679235,0.0016753697,0.0015778901,0.0012968441,0.004129524],"category_scores_gemma":[0.008921573,0.0004894685,0.00075819483,0.00067932316,0.0016237468,0.0027611495,0.0014491783,0.0014438096,0.00037871135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003410045,0.0001347964,0.00093106425,0.0001131876,0.000060083737,0.00017154323,0.0002551914,0.59735745,0.0030396313,0.3852734,0.0012502896,0.011072258],"study_design_scores_gemma":[0.00004036363,0.000043418735,0.00012842298,0.0000075183884,0.000009247053,0.000030084942,0.000043672426,0.8494145,0.00054690504,0.14927691,0.00044661024,0.00001237514],"about_ca_topic_score_codex":0.005631205,"about_ca_topic_score_gemma":0.0040566395,"teacher_disagreement_score":0.005631205,"about_ca_system_score_codex":0.0023247623,"about_ca_system_score_gemma":0.0021074836,"threshold_uncertainty_score":0.0168674},"labels":[],"label_agreement":null},{"id":"W4318303117","doi":"10.1142/s0129054122460029","title":"Graph Algorithm Based Submodular Function for Sparsest Cut Problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Minimum cut; Combinatorics; Subroutine; Graph partition; Maximum flow problem; Maximum cut; Partition (number theory); Graph; Weight function; Cut; Discrete mathematics; Minimum weight; Algorithm; Segmentation; Computer science; Image segmentation; Artificial intelligence","score_opus":0.03254517234860851,"score_gpt":0.3020471426313973,"score_spread":0.2695019702827888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318303117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03453886,0.0005762354,0.95778483,0.000619525,0.000069586145,0.0001701824,0.00030523533,0.0005792564,0.00535635],"genre_scores_gemma":[0.40104276,0.00092040235,0.58842427,0.0006316582,0.00013521827,0.0006755252,0.0014778938,0.00036774264,0.0063245515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904186,0.0003493049,0.00003215473,0.0002530635,0.00017553737,0.00014802211],"domain_scores_gemma":[0.99844956,0.0010035346,0.00012144159,0.00013709225,0.00018550473,0.000102765225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479856,0.0014278126,0.0019254212,0.0011085822,0.00081726164,0.0015525639,0.0018752598,0.0016605875,0.0043999143],"category_scores_gemma":[0.003993312,0.0004006743,0.0009730092,0.0020326057,0.0010662839,0.0032662305,0.0017569319,0.0022864137,0.00079894235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026996745,0.00037864345,0.0010989936,0.0004840476,0.000084758736,0.00012967302,0.0002349317,0.65055126,0.0047904495,0.10422531,0.018492455,0.21925952],"study_design_scores_gemma":[0.00004025917,0.00010148013,0.0001611854,0.000018757173,0.000014644324,0.0000827636,0.0000499042,0.9236578,0.00087657885,0.07296831,0.002016365,0.000012105795],"about_ca_topic_score_codex":0.0019903062,"about_ca_topic_score_gemma":0.0019824717,"teacher_disagreement_score":0.0043999143,"about_ca_system_score_codex":0.0014065425,"about_ca_system_score_gemma":0.0019115884,"threshold_uncertainty_score":0.014719188},"labels":[],"label_agreement":null},{"id":"W4378837733","doi":"10.1142/s0129054123470019","title":"Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hamiltonian path; Control reconfiguration; Hamiltonian (control theory); Transpose; Vertex (graph theory); Mathematics; Combinatorics; Grid; Lattice graph; Cycle basis; Graph; Discrete mathematics; Line graph; Computer science; Geometry; Voltage graph; Physics; Graph power; Quantum mechanics; Mathematical optimization","score_opus":0.017912321683965504,"score_gpt":0.302799428054932,"score_spread":0.2848871063709665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378837733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081779,0.0004469888,0.077033885,0.00015001018,0.00006803779,0.0000458002,0.000107030915,0.000334669,0.013635652],"genre_scores_gemma":[0.9882465,0.0001743694,0.009698693,0.0000338639,0.000013480899,0.000035013305,0.00008980057,0.000035956127,0.0016723952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998698,0.000029335424,0.0000072800462,0.00003701289,0.00001840813,0.000038233837],"domain_scores_gemma":[0.9995881,0.00016411298,0.00009569038,0.00006961989,0.000024890633,0.000057561465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094054645,0.00024495434,0.00030127398,0.0003335086,0.00033478343,0.00041709005,0.00046811358,0.00036276862,0.0022439726],"category_scores_gemma":[0.0010085875,0.00021520123,0.00026334828,0.00046402615,0.0007105363,0.0008096,0.0005839552,0.00028080522,0.00018909057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043781643,0.00012891262,0.0043832464,0.00036451695,0.00008652036,0.0030157834,0.0008286116,0.63146573,0.07753293,0.21426396,0.003537819,0.06395421],"study_design_scores_gemma":[0.000100396464,0.00022065779,0.0036651934,0.000031759315,0.00004122971,0.00084360805,0.00059870107,0.78797746,0.016257094,0.18080781,0.009408826,0.000047270045],"about_ca_topic_score_codex":0.0014623641,"about_ca_topic_score_gemma":0.0010748641,"teacher_disagreement_score":0.0022439726,"about_ca_system_score_codex":0.00040357158,"about_ca_system_score_gemma":0.00015613757,"threshold_uncertainty_score":0.007506788},"labels":[],"label_agreement":null},{"id":"W4387377762","doi":"10.1142/s0129054123410083","title":"Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Monotone polygon; Streaming algorithm; Time complexity; Set (abstract data type); Ideal (ethics); Algorithm; Function (biology); Computer science; Running time; Approximation algorithm; Integer (computer science); Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.046945529046224205,"score_gpt":0.333160625608366,"score_spread":0.28621509656214184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387377762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027170783,0.0007988033,0.9663149,0.00062148867,0.00007698889,0.00018715982,0.0003009819,0.0014927369,0.0030360618],"genre_scores_gemma":[0.2530295,0.00048430462,0.7417522,0.00033427245,0.00021575113,0.0003444801,0.00078302843,0.000389334,0.002667159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737215,0.0007451162,0.00018793676,0.00064243015,0.0006897537,0.00036264886],"domain_scores_gemma":[0.9909043,0.005964834,0.0005701427,0.0014370205,0.0007856205,0.00033809262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037221916,0.0018449252,0.0021484238,0.0012669391,0.0009396905,0.0019329553,0.0040258495,0.0017624821,0.004201464],"category_scores_gemma":[0.016518699,0.0008513071,0.0015300886,0.002713194,0.0011582716,0.006522851,0.002628602,0.0029025339,0.001084888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093563437,0.0005149551,0.002269057,0.00059563015,0.00015724485,0.00020386778,0.00045227888,0.5082949,0.012718979,0.12605004,0.014946153,0.33286124],"study_design_scores_gemma":[0.000047507125,0.00006597743,0.00012154785,0.000012744163,0.000016793603,0.00008304153,0.00003105771,0.954518,0.002264455,0.041616898,0.001207845,0.0000141600385],"about_ca_topic_score_codex":0.0033490942,"about_ca_topic_score_gemma":0.0044090543,"teacher_disagreement_score":0.004201464,"about_ca_system_score_codex":0.0023109994,"about_ca_system_score_gemma":0.002752365,"threshold_uncertainty_score":0.01968509},"labels":[],"label_agreement":null},{"id":"W4390744696","doi":"10.1142/s0129054123020057","title":"Special Issue: Articles Dedicated to the Memory of Magnus Steinby — Preface","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Crafts, Textile, and Design","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Cognitive science; Psychology","score_opus":0.034559884771927084,"score_gpt":0.29568275041471953,"score_spread":0.26112286564279247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390744696","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013320662,0.008506001,0.00016804434,0.029477568,0.953175,0.000056395536,0.00029101686,0.00013364905,0.008059046],"genre_scores_gemma":[0.0008357285,0.00693933,0.00015851106,0.016884262,0.9166511,0.00007238731,0.00032488228,0.00017598548,0.057957828],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986975,0.00014634847,0.00016024381,0.00025292125,0.0005973271,0.00014559632],"domain_scores_gemma":[0.98877627,0.00224595,0.0010555794,0.00041638358,0.0045300955,0.0029756927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346422,0.0021896097,0.0025542171,0.004259606,0.002147459,0.00747066,0.0020645622,0.0063533755,0.14364497],"category_scores_gemma":[0.012684427,0.0006165833,0.000995457,0.0022957537,0.0010241601,0.0036929094,0.0028776312,0.004721909,0.10129394],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028517363,0.000009080547,0.000023007693,0.00012232429,0.000003830891,0.000037692782,0.0000063669927,0.000011449171,0.00009127157,0.00012117284,0.9919104,0.007634897],"study_design_scores_gemma":[0.00001966342,0.000027493477,0.00042210674,0.00022872644,0.000010336557,0.00015330258,0.000029406428,0.000045369474,0.000101853184,0.0005263338,0.9984243,0.000011120409],"about_ca_topic_score_codex":0.0008590332,"about_ca_topic_score_gemma":0.001717007,"teacher_disagreement_score":0.14364497,"about_ca_system_score_codex":0.0015742449,"about_ca_system_score_gemma":0.0018675526,"threshold_uncertainty_score":0.48054034},"labels":[],"label_agreement":null},{"id":"W4401198969","doi":"10.1142/s0129054124430019","title":"Repetition Factorization of Automatic Sequences","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Factorization; Repetition (rhetorical device); Computer science; Mathematics; Theoretical computer science; Algorithm; Linguistics","score_opus":0.016683348424025496,"score_gpt":0.3159330991453174,"score_spread":0.2992497507212919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401198969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43678012,0.0016338904,0.4951434,0.00055600924,0.00045792112,0.00014768538,0.00038033587,0.00074111915,0.06415944],"genre_scores_gemma":[0.85649484,0.00060008356,0.119876556,0.00029021633,0.00039760015,0.00015070489,0.0004261187,0.0001915984,0.02157239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990914,0.00015470892,0.000073299256,0.00023677925,0.0002679992,0.0001759121],"domain_scores_gemma":[0.99853003,0.00053067773,0.00025988024,0.00020003009,0.00036973064,0.000109664536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991143,0.0005194016,0.00039140994,0.0013359962,0.0010324572,0.00090851606,0.00035077168,0.0005800273,0.006426035],"category_scores_gemma":[0.0029340896,0.0002799493,0.00069439184,0.0007589145,0.0017764524,0.0024582855,0.0010863349,0.000859226,0.0014662106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012775483,0.00002850204,0.00085496996,0.000120398705,0.000012009212,0.00052817684,0.0008956382,0.0037062448,0.015991278,0.9406192,0.0018681439,0.035247777],"study_design_scores_gemma":[0.000026945028,0.00019141694,0.0008449055,0.00006007695,0.000018309089,0.0009661735,0.00030068654,0.024950668,0.012236247,0.9393984,0.020932363,0.00007383575],"about_ca_topic_score_codex":0.00072847796,"about_ca_topic_score_gemma":0.0007195776,"teacher_disagreement_score":0.006426035,"about_ca_system_score_codex":0.00052459334,"about_ca_system_score_gemma":0.00047680232,"threshold_uncertainty_score":0.02149725},"labels":[],"label_agreement":null},{"id":"W4403341864","doi":"10.1142/s0129054124430044","title":"Language Acceptors with a Pushdown: Characterizations and Complexity","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pushdown automaton; Programming language; Theoretical computer science; Discrete mathematics; Mathematics; Finite-state machine","score_opus":0.024407691971876783,"score_gpt":0.34573292049519483,"score_spread":0.321325228523318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403341864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34478444,0.0006906936,0.62686616,0.0020262618,0.00018430979,0.00028248777,0.00090139714,0.0017583517,0.02250591],"genre_scores_gemma":[0.8834592,0.0005567988,0.100904904,0.00046356543,0.0002446097,0.0007180139,0.0011332253,0.0005609663,0.011958599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576,0.0009877606,0.00046869053,0.0009820494,0.0011828534,0.00061860075],"domain_scores_gemma":[0.97901434,0.014916741,0.0016460152,0.0019305621,0.0015541259,0.00093823666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331496,0.0010520542,0.000956823,0.0016776706,0.0016046336,0.006708539,0.0025179104,0.0019764127,0.0074654007],"category_scores_gemma":[0.0130288955,0.00094253785,0.002710768,0.001437123,0.0032098424,0.0115569355,0.003610386,0.0053086183,0.0011984246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002801137,0.00022352663,0.0019378732,0.0002974717,0.000054240307,0.00039349,0.001100093,0.045396153,0.009317226,0.9203643,0.001696568,0.018939016],"study_design_scores_gemma":[0.00005720729,0.00010231062,0.00040562655,0.00005081701,0.000059292914,0.0003093508,0.00017340056,0.1808471,0.008251452,0.8055683,0.004106878,0.00006838861],"about_ca_topic_score_codex":0.0009892111,"about_ca_topic_score_gemma":0.00065918104,"teacher_disagreement_score":0.0074654007,"about_ca_system_score_codex":0.0029939488,"about_ca_system_score_gemma":0.0014452477,"threshold_uncertainty_score":0.024974227},"labels":[],"label_agreement":null},{"id":"W4405697651","doi":"10.1142/s0129054124420061","title":"Compressed Structures for Partial Derivative Automata Constructions","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Discrete mathematics; Star (game theory); Expression (computer science); Computer science; Geometry; Mathematical analysis","score_opus":0.019820882502079015,"score_gpt":0.3248887273504064,"score_spread":0.3050678448483274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405697651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11466658,0.00057013775,0.85219646,0.0011770917,0.00016856518,0.00042371827,0.0015906743,0.016608316,0.01259843],"genre_scores_gemma":[0.5934881,0.00025599403,0.3941824,0.0003386571,0.000120565375,0.0007171682,0.0030891031,0.0015545931,0.0062534213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969138,0.00082368846,0.00028387943,0.0005963011,0.0010885334,0.00029366548],"domain_scores_gemma":[0.98812336,0.005306468,0.00062267896,0.004643198,0.0009992146,0.00030508463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016081524,0.00074970035,0.000760067,0.0012834435,0.0011886441,0.0021271715,0.002156762,0.0010484009,0.012959921],"category_scores_gemma":[0.013873925,0.00078690524,0.0012992127,0.001963781,0.0022912866,0.0058939345,0.0038189976,0.0020470405,0.0026617188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012273038,0.00033408168,0.0025731735,0.0006294212,0.000053501928,0.00031647703,0.0013831964,0.0675945,0.0276705,0.52392614,0.017449735,0.356842],"study_design_scores_gemma":[0.0001605658,0.00034877576,0.0004050769,0.00009147961,0.000064045555,0.0003123049,0.00021232924,0.29660264,0.03643826,0.6431144,0.022189835,0.000060237333],"about_ca_topic_score_codex":0.001499762,"about_ca_topic_score_gemma":0.0025030072,"teacher_disagreement_score":0.012959921,"about_ca_system_score_codex":0.002323441,"about_ca_system_score_gemma":0.0022001874,"threshold_uncertainty_score":0.043355286},"labels":[],"label_agreement":null},{"id":"W4406786949","doi":"10.1142/s0129054125500029","title":"Almost Perfect <i>c</i>-Nonlinear Permutations with Trace Functions over 𝔽2n","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Gansu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"TRACE (psycholinguistics); Mathematics; Nonlinear system; Combinatorics; Discrete mathematics; Physics; Philosophy; Quantum mechanics","score_opus":0.005174225003495601,"score_gpt":0.24993348897042472,"score_spread":0.24475926396692912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406786949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7060101,0.00026194565,0.13960251,0.00052834477,0.00021745932,0.000072093644,0.00026446037,0.00030900998,0.15273409],"genre_scores_gemma":[0.98018825,0.000120484736,0.0077858292,0.00010681321,0.00009921215,0.000028294962,0.00011112559,0.000055735884,0.011504389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938667,0.000089193476,0.000033814853,0.00014421763,0.00016207619,0.0001840672],"domain_scores_gemma":[0.999516,0.000110699,0.00008969553,0.00010381759,0.000071087896,0.000108607186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041941577,0.0003864025,0.00031475647,0.00074685586,0.0011499352,0.0015778826,0.0003922949,0.00042493685,0.0059884847],"category_scores_gemma":[0.0010387369,0.00020257995,0.00039316682,0.0005094131,0.0020309892,0.0020982786,0.0011430585,0.0009910092,0.00076720945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045163524,0.000012580775,0.00030475194,0.000019675615,0.0000034698771,0.00015966756,0.000099525394,0.0010181753,0.0030190854,0.9881798,0.00040064694,0.0067374697],"study_design_scores_gemma":[0.00002451523,0.00008052729,0.0013113406,0.00002072402,0.000011756178,0.0007256623,0.00015072222,0.020025171,0.013379401,0.95475626,0.0094659375,0.000047870537],"about_ca_topic_score_codex":0.0007304122,"about_ca_topic_score_gemma":0.0005524997,"teacher_disagreement_score":0.0059884847,"about_ca_system_score_codex":0.0010081544,"about_ca_system_score_gemma":0.00063735433,"threshold_uncertainty_score":0.020033479},"labels":[],"label_agreement":null},{"id":"W4409442370","doi":"10.1142/s0129054125430026","title":"Language Quotients Revisited","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Quotient; Mathematics; Computer science; Linguistics; Programming language; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.008207469668431198,"score_gpt":0.3085720398270894,"score_spread":0.3003645701586582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409442370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12528072,0.00094495626,0.85005206,0.0015006784,0.00022290536,0.00021863819,0.000360568,0.0040023546,0.017417058],"genre_scores_gemma":[0.7821642,0.00040765057,0.20703842,0.00046904874,0.000113666225,0.00018872251,0.00039334802,0.0012187217,0.008006224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921089,0.0016891691,0.0010168231,0.0017657861,0.0027990772,0.00062022],"domain_scores_gemma":[0.98627466,0.0060697487,0.00069003424,0.004373064,0.002256294,0.00033612142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033980866,0.00065508985,0.0010040399,0.001092956,0.0011513474,0.0036648975,0.002249712,0.0009350333,0.0054455264],"category_scores_gemma":[0.01996671,0.0007048451,0.0021543384,0.00094860006,0.0056443783,0.012866036,0.0049704053,0.0034879392,0.0010606571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029913164,0.00006525319,0.002293024,0.00026946262,0.000030321251,0.0004170268,0.0021225198,0.021732455,0.013412595,0.88415146,0.0018431584,0.07336361],"study_design_scores_gemma":[0.000051660023,0.0001536042,0.00041517615,0.00008613129,0.000059844093,0.00060834724,0.00036868438,0.12554798,0.03735541,0.80625254,0.029015906,0.000084741536],"about_ca_topic_score_codex":0.0039456524,"about_ca_topic_score_gemma":0.002197599,"teacher_disagreement_score":0.0054455264,"about_ca_system_score_codex":0.0029357108,"about_ca_system_score_gemma":0.0019997852,"threshold_uncertainty_score":0.021300137},"labels":[],"label_agreement":null},{"id":"W4409898124","doi":"10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Bangladesh University of Engineering and Technology","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum degree spanning tree; Weight-balanced tree; Tree (set theory); Discrete mathematics; Trémaux tree; Graph; Binary tree; Binary search tree; Line graph; Pathwidth","score_opus":0.017781280910574723,"score_gpt":0.3485295082599452,"score_spread":0.3307482273493705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409898124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33078223,0.0017630766,0.6385591,0.0011292415,0.00016011998,0.000366671,0.0030307192,0.0068054227,0.017403428],"genre_scores_gemma":[0.43471536,0.0005059478,0.5536853,0.00021055301,0.00003980552,0.00016607888,0.005802292,0.00059139676,0.0042832573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939346,0.000113377064,0.00007284136,0.0001377174,0.00014640382,0.00013618969],"domain_scores_gemma":[0.9982931,0.00082712667,0.00024730523,0.00024135718,0.00026362613,0.0001275214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042811516,0.0006513921,0.0008163144,0.0010557717,0.0007709607,0.0011249862,0.0010822064,0.00078278536,0.0033369865],"category_scores_gemma":[0.003776188,0.00047185805,0.00076814287,0.0018080677,0.00044653667,0.0032262327,0.0012151471,0.0006554633,0.0013558728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008497285,0.00036791,0.01345081,0.0019559462,0.0002219654,0.0010914486,0.0010873117,0.16562048,0.05931531,0.06751179,0.044524904,0.64400244],"study_design_scores_gemma":[0.00014396099,0.00026737456,0.003361895,0.00015273559,0.00012642847,0.0013547693,0.00071471947,0.75638896,0.031120649,0.18800381,0.018299319,0.000065381944],"about_ca_topic_score_codex":0.0020256331,"about_ca_topic_score_gemma":0.0042133485,"teacher_disagreement_score":0.0033369865,"about_ca_system_score_codex":0.0006853503,"about_ca_system_score_gemma":0.0013827118,"threshold_uncertainty_score":0.011163354},"labels":[],"label_agreement":null},{"id":"W4413382085","doi":"10.1142/s0129054125400040","title":"Note on Two-Stage BP Maximization","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Stage (stratigraphy); Maximization; Mathematics; Computer science; Combinatorics; Mathematical economics; Mathematical optimization; Biology","score_opus":0.008774879941117864,"score_gpt":0.2911984750217288,"score_spread":0.28242359508061093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413382085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026838735,0.0003786594,0.99288005,0.0004742053,0.00009472129,0.00005227032,0.00004968764,0.00019855467,0.0031879612],"genre_scores_gemma":[0.22286887,0.0012250419,0.7631487,0.0012872042,0.000573928,0.0004350276,0.00026002823,0.0004100937,0.009791078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696964,0.0012948554,0.000111833884,0.0006660673,0.0006892683,0.00026832137],"domain_scores_gemma":[0.9942569,0.0034788263,0.00022009085,0.0010909734,0.0006892393,0.00026404051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142479,0.0019043864,0.0016324135,0.00062192936,0.0007325571,0.001260553,0.0021348079,0.0021259624,0.005748194],"category_scores_gemma":[0.010042783,0.0007584525,0.0012706195,0.0015288237,0.0021533698,0.0037580158,0.0037261806,0.0047954354,0.0013149262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074917736,0.0002280895,0.0010812379,0.0006560435,0.00018800102,0.00048218996,0.00031456098,0.3295102,0.017827645,0.44806585,0.024164377,0.17673273],"study_design_scores_gemma":[0.00006787221,0.00016288874,0.0003092952,0.00003221808,0.00003278435,0.00028117743,0.000018778952,0.85595125,0.004115346,0.13067445,0.0083119655,0.000041982483],"about_ca_topic_score_codex":0.0019515816,"about_ca_topic_score_gemma":0.0017740004,"teacher_disagreement_score":0.005748194,"about_ca_system_score_codex":0.0012491721,"about_ca_system_score_gemma":0.0020100684,"threshold_uncertainty_score":0.021907806},"labels":[],"label_agreement":null}]}